Generalized Subtour Elimination Constraints and Connectivity Constraints

DOI10.2307/2582674MaRDI QIDQ3725874zbMATH OpenOpenAlexFDO

Authors G. Laporte

Publication date 1986

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2582674

zbMATH Keywords

travelling salesmanconnectivity constraintsgeneralized subtour elimination constraintsvehicle routeing

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• A New Formulation for the Travelling Salesman Problem
• A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
• Some Applications of the Generalized Travelling Salesman Problem

Cited in

(12)

• The selective travelling salesman problem
• The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
• A stabilized column generation scheme for the traveling salesman subtour problem
• A framework for multi-robot node coverage in sensor networks
• Primal-dual schema and Lagrangian relaxation for the \(k\)-location-routing problem
• Vehicle routing with split deliveries
• Routing problems: A bibliography
• A branch-and-cut algorithm for an assembly routing problem
• A branch-and-cut algorithm for the ring spur assignment problem
• On symmetric subtour problems
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
• Minimum‐cost flow problems having arc‐activation costs

This page was built for publication: Generalized Subtour Elimination Constraints and Connectivity Constraints

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