A branch-and-cut framework for the consistent traveling salesman problem
From MaRDI portal
Publication:320686
DOI10.1016/j.ejor.2015.07.030zbMath1346.90720OpenAlexW1212691569MaRDI QIDQ320686
Chrysanthos E. Gounaris, Anirudh Subramanyam
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.07.030
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items
The consistent vehicle routing problem with heterogeneous fleet ⋮ Binary driver-customer familiarity in service routing ⋮ The time‐consistent dial‐a‐ride problem ⋮ The travelling salesman problem with positional consistency constraints: an application to healthcare services ⋮ Product-oriented time window assignment for a multi-compartment vehicle routing problem ⋮ The vehicle routing problem with profits and consistency constraints ⋮ Discrete optimization model and algorithm for driver planning in periodic driver routing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On service consistency in multi-period vehicle routing
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
- An efficient algorithm for the minimum capacity cut problem
- A comparative analysis of several asymmetric traveling salesman problem formulations
- A result on projection for the vehicle routing problem
- A mixed-integer model for solving ordering problems with side constraints
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Forty years of periodic vehicle routing
- A template-based adaptive large neighborhood search for the consistent vehicle routing problem
- On the symmetric travelling salesman problem I: Inequalities
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- Integer Programming Formulation of Traveling Salesman Problems
- Odd Minimum Cut-Sets and b-Matchings
- Facets of the Asymmetric Traveling Salesman Polytope
- TSPLIB—A Traveling Salesman Problem Library
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Reducibility among Combinatorial Problems
- Solution of a Large-Scale Traveling-Salesman Problem
- Integer Programming and Combinatorial Optimization
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- Benchmarking optimization software with performance profiles.
