NO - Chapter 19 (Modified). Lower Bounds for TSP

NO - Linear Relaxation

Link to original

NO - Assignment Problem

SEC: Sub-tour Elimination Constraint (the only exponential constraint in the TSP)

Link to original

NO - 1-Tree

NOTE: The graph $G-\{1\}$ is the graph $G$ less the node $1$

Link to original

NO - Legrangean Relaxation for TSP

References:

• NO - 1-Tree

---

NOTE: step length: how much should we change ${\lambda }^t$

Link to original