scientific article; zbMATH DE number 91756

DOI10.1002/1520-6750(199210)39:6%3C839::AID-NAV3220390609%3E3.0.CO;2-CMaRDI QIDQ4017559zbMATH OpenFDO

Authors Martha G. Pilcher, Ronald L. Rardin

Publication date 16 January 1993

Full work available at URL https://doi.org/10.1002/1520-6750(199210)39:6%3C839::AID-NAV3220390609%3E3.0.CO;2-C

zbMATH Keywords

comb inequalitiescutting plane approachesdiscrete optimizationheuristicssymmetric traveling salesman

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)

Recommendations

• Generating Travelling-Salesman Problems with Known Optimal Tours
• scientific article; zbMATH DE number 2134197
• scientific article; zbMATH DE number 3943560
• A cutting plane procedure for the travelling salesman problem on road networks
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

Cited in

(4)

• Generation techniques for linear programming instances with controllable properties
• Generating Travelling-Salesman Problems with Known Optimal Tours
• Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments
• Polarity and the complexity of the shooting experiment

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 Q4017559)