New path elimination constraints for multi-depot routing problems
From MaRDI portal
Publication:6496355
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
Cites work
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- A compact model and tight bounds for a combined location-routing problem
- A comparative analysis of several asymmetric traveling salesman problem formulations
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
- Hamiltonian location problems
- Multi-depot multiple TSP: a polyhedral study and computational results
- Multi-depot rural postman problems
- Multiple depot ring star problem: a polyhedral study and an exact algorithm
- Network flows. Theory, algorithms, and applications.
- On a time-dependent formulation and an updated classification of ATSP formulations
- Optimal capacitated ring trees
Cited in
(3)- 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
- The Hamiltonian \(p\)-median problem: polyhedral results and branch-and-cut algorithms
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)
