This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
travelling_salesman_problem [2023/08/02 07:18] 65.108.103.106 old revision restored (2023/07/01 21:06) |
travelling_salesman_problem [2024/04/29 14:07] 47.128.60.86 old revision restored (2024/04/26 13:58) |
||
---|---|---|---|
Line 1: | Line 1: | ||
====== Travelling salesman problem ====== | ====== Travelling salesman problem ====== | ||
- | |||
- | < | ||
The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, | The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, | ||
Line 7: | Line 5: | ||
===== Integer linear programming formulation ===== | ===== Integer linear programming formulation ===== | ||
- | TSP can be formulated as an integer linear program. Label the cities with the numbers $0, ..., n$ and define: | + | TSP can be formulated as an integer linear program. Label the cities with the numbers $0, \ldots, n$ and define: |
$$ | $$ | ||
| |