Mathematical formulations for consistent travelling salesman problems
From MaRDI portal
Publication:6555132
DOI10.1016/j.ejor.2023.08.021MaRDI QIDQ6555132
Juan-José Salazar-González, Daniel Díaz-Ríos
Publication date: 14 June 2024
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- On service consistency in multi-period vehicle routing
- The multi-objective generalized consistent vehicle routing problem
- A branch-and-cut framework for the consistent traveling salesman problem
- The orienteering problem: a survey
- The periodic vehicle routing problem with driver consistency
- A branch-and-cut algorithm for the time window assignment vehicle routing problem
- The Benders decomposition algorithm: a literature review
- The vehicle routing problem with profits and consistency constraints
- A survey on Benders decomposition applied to fixed-charge network design problems
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
- Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector
- The collaborative consistent vehicle routing problem with workload balance
- Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
- The consistent vehicle routing problem with heterogeneous fleet
- The consistent electric-vehicle routing problem with backhauls and charging management
- A template-based adaptive large neighborhood search for the consistent vehicle routing problem
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- Max flows in O(nm) time, or better
- The consistent production routing problem
This page was built for publication: Mathematical formulations for consistent travelling salesman problems
