New path elimination constraints for multi-depot routing problems
From MaRDI portal
Publication:6496355
DOI10.1002/NET.21760WikidataQ58169418 ScholiaQ58169418MaRDI QIDQ6496355FDOQ6496355
Authors: Tolga Bektaş, Luis Gouveia, Daniel Santos 
Publication date: 3 May 2024
Published in: Networks (Search for Journal in Brave)
Recommendations
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons
- Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- Multi-depot rural postman problems
- Multi-depot multiple TSP: a polyhedral study and computational results
integer linear programmingbranch-and-cutseparationtraveling salesmanreformulationmulti-depot routing
Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Cites Work
- Network flows. Theory, algorithms, and applications.
- A comparative analysis of several asymmetric traveling salesman problem formulations
- A compact model and tight bounds for a combined location-routing problem
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- Optimal capacitated ring trees
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Hamiltonian location problems
- On a time-dependent formulation and an updated classification of ATSP formulations
- Multi-depot multiple TSP: a polyhedral study and computational results
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
- Multiple depot ring star problem: a polyhedral study and an exact algorithm
- Multi-depot rural postman problems
Cited In (3)
- The Hamiltonian \(p\)-median problem: polyhedral results and branch-and-cut algorithms
- Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
This page was built for publication: New path elimination constraints for multi-depot routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496355)
