Posts Tagged ‘MTZ’

Mark Velednitsky Finds Short Proof For Traveling Salesman Problem

IEOR graduate student Mark Velednitsky has reduced a twenty-eight page proof for the traveling salesman problem (TSP) to just a few lines. Velednitsky’s proof titled “Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the Asymmetric Traveling Salesman Problem” was recently published in Operations Research Letters, and will make learning this particular TSP…

Read More