A Branch-and-Cut Approach to a Traveling Salesman Problem with Side Constraints

DOI10.1287/mnsc.35.11.1393zbMath0695.90068OpenAlexW2041584418MaRDI QIDQ3471856

No author found.

Publication date: 1989

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.35.11.1393

zbMATH Keywords

heuristicbranch-and-cutnon-deterministic traveling salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Linear programming (90C05) Boolean programming (90C09)

Related Items (4)

Extended formulations for the \(A\)-cut problem ⋮ Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness ⋮ Modeling and solving a multi-period inventory fulfilling and routing problem for hazardous materials ⋮ Survey of facial results for the traveling salesman polytope

This page was built for publication: A Branch-and-Cut Approach to a Traveling Salesman Problem with Side Constraints