Branch-and-cut approach to a variant of the traveling salesman problem

DOI10.2514/3.20336MaRDI QIDQ3812063zbMATH OpenOpenAlexFDO

Authors Manfred Padberg, G. Rinaldi

Publication date 1988

Published in Journal of Guidance, Control, and Dynamics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2514/3.20336

zbMATH Keywords

branch-and-cutmodified traveling salesmanpolynomial timezero-one linear program

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Boolean programming (90C09) Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• A Branch-and-Cut Approach to a Traveling Salesman Problem with Side Constraints
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• The traveling salesman problem. II: Exact methods
• Solution of large-scale symmetric travelling salesman problems

Cited in

(8)

• Survey of facial results for the traveling salesman polytope
• A branch-and-cut algorithm for the target visitation problem
• scientific article; zbMATH DE number 3880463 (Why is no real title available?)
• A Branch-and-Cut Approach to a Traveling Salesman Problem with Side Constraints
• Branch-and-cut algorithms for the covering salesman problem
• Controller placement problem in software‐defined networking: A survey
• Evolutionary algorithms for solving multi-objective travelling salesman problem
• Large-scale 0-1 linear programming on distributed workstations

This page was built for publication: Branch-and-cut approach to a variant of the traveling salesman problem

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