Combinatorial algorithms in concorde

MaRDI QIDQ3104252zbMATH OpenFDO

Authors Vašek Chvátal

Publication date 19 December 2011

zbMATH Keywords

separation algorithmsseparation problemtraveling salesman problem (TSP)TSPLIB

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35)

Recommendations

• Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
• The traveling salesman problem. A computational study.
• Separating maximally violated comb inequalities in planar graphs
• The travelling salesman and the PQ-tree
• Solution of large-scale symmetric travelling salesman problems

Cited in

(3)

• Edge elimination in TSP instances
• The travelling salesman and the PQ-tree
• Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem

This page was built for publication: Combinatorial algorithms in concorde

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104252)