Login / Signup
Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the Asymmetric Traveling Salesman Problem.
Mark Velednitsky
Published in:
Oper. Res. Lett. (2017)
Keyphrases
</>
lattice points
subtour elimination
stable set
convex hull
knapsack problem
extreme points
information systems
theorem prover
geometric properties
semidefinite
facet defining inequalities
directed graph
traveling salesman problem
neural network
hamiltonian cycle