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

DOI10.2514/3.20336zbMath0661.90091OpenAlexW2051211344MaRDI QIDQ3812063

Manfred W. Padberg, Giovanni 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-cutpolynomial timezero-one linear programmodified traveling salesman

Mathematics Subject Classification ID

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

Related Items

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, Survey of facial results for the traveling salesman polytope