scientific article; zbMATH DE number 1263277

MaRDI QIDQ4234150zbMATH OpenFDO

Authors Jean-Maurice Clochard, Denis Naddef

Publication date 2 November 1999

zbMATH Keywords

branch-and-boundbranch-and-cutlarge traveling salesmanpolytope

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Transportation, logistics and supply chain management (90B06) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35)

Recommendations

• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
• Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities.
• Solution of large-scale symmetric travelling salesman problems
• On the domino-parity inequalities for the STSP

Cited in

(4)

• Certification of an optimal TSP tour through 85,900 cities
• The rural postman problem with deadline classes
• Branching rules revisited
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

This page was built for publication:

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