Differences

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

--- travelling_salesman_problem [2024/05/04 23:56]
18.218.196.182 old revision restored (2024/04/24 03:11)
+++ travelling_salesman_problem [2024/05/05 11:26] (current)
3.136.154.103 old revision restored (2014/09/23 22:48)
@@ 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