Integer linear programming formulations of multiple salesman problems and its variations

DOI10.1016/j.ejor.2005.03.008zbMath1103.90065MaRDI QIDQ2503218

Tolga Bektaş, Imdat Kara

Publication date: 14 September 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.03.008

zbMATH Keywords

integer programming; subtour elimination constraints; multidepot multisalesmen problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C10: Integer programming

90C27: Combinatorial optimization

Related Items

The school bus routing problem: a review, VEHICLE ROUTE OPTIMIZATION FOR RFID INTEGRATED WASTE COLLECTION SYSTEM

Cites Work

• Integer programming formulations for the multi-depot vehicle routing problem: Comments on a paper by Kulkarni and Bhave
• Transformation of multidepot multisalesmen problem to the standard travelling salesman problem
• A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Integer Programming Formulation of Traveling Salesman Problems
• An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• A Cutting Planes Algorithm for the m-Salesmen Problem
• Some Simple Applications of the Travelling Salesman Problem
• Note—A Note on “The Formulation of the M-Salesman Traveling Salesman Problem”
• Implementing vehicle routing algorithms
• Computational Experience with an M-Salesman Traveling Salesman Algorithm