Finding the right cutting planes for the TSP

DOI10.1145/351827.384248zbMath1070.90534OpenAlexW2166188787MaRDI QIDQ5463401

No author found.

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/351827.384248

zbMATH Keywords

combinatorial optimizationminimum cuttraveling salesman problemcutting plane

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (3)

Special Frequency Quadrilaterals and an Application ⋮ The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem ⋮ A quick method to compute sparse graphs for traveling salesman problem using random frequency quadrilaterals

Uses Software

• TSPLIB

This page was built for publication: Finding the right cutting planes for the TSP