Generalized Subtour Elimination Constraints and Connectivity Constraints

DOI10.2307/2582674zbMath0594.90064OpenAlexW4245988194MaRDI QIDQ3725874

Gilbert 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

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

Related Items (12)

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

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