Differences

This shows you the differences between two versions of the page.

--- travelling_salesman_problem [2024/04/17 15:30]
47.128.35.247 old revision restored (2024/03/14 10:57)
+++ travelling_salesman_problem [2024/04/17 15:30]
47.128.49.104 old revision restored (2024/03/14 10:56)
@@ Line 5: / Line 5: @@
 ===== Integer linear programming formulation =====
-TSP can be formulated as an integer linear program. Label the cities with the numbers $0, \ldots, n$ and define:
+TSP can be formulated as an integer linear program. Label the cities with the numbers $0, ..., n$ and define:
 $$
  x_{ij} = \begin{cases} 1 & \text{the path goes from city } i \text{ to city } j \\ 0 & \text{otherwise} \end{cases}

Lehigh ISE / COR@L Lab Wiki