A branch-and-cut framework for the consistent traveling salesman problem
DOI10.1016/J.EJOR.2015.07.030zbMATH Open1346.90720OpenAlexW1212691569MaRDI QIDQ320686FDOQ320686
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
Recommendations
- The periodic vehicle routing problem with driver consistency
- A template-based adaptive large neighborhood search for the consistent vehicle routing problem
- The multi-objective generalized consistent vehicle routing problem
- The indefinite period traveling salesman problem
- A branch-and-cut algorithm for vehicle routing problems
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Benchmarking optimization software with performance profiles.
- Reducibility among Combinatorial Problems
- Integer Programming Formulation of Traveling Salesman Problems
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- A comparative analysis of several asymmetric traveling salesman problem formulations
- On the symmetric travelling salesman problem I: Inequalities
- Title not available (Why is that?)
- Integer Programming and Combinatorial Optimization
- Forty years of periodic vehicle routing
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- A result on projection for the vehicle routing problem
- A template-based adaptive large neighborhood search for the consistent vehicle routing problem
- On service consistency in multi-period vehicle routing
- Odd Minimum Cut-Sets and b-Matchings
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- A mixed-integer model for solving ordering problems with side constraints
- 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
- Facets of the Asymmetric Traveling Salesman Polytope
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- Title not available (Why is that?)
- 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
Cited In (13)
- Title not available (Why is that?)
- Mathematical formulations for consistent travelling salesman problems
- The consistent vehicle routing problem with heterogeneous fleet
- Product-oriented time window assignment for a multi-compartment vehicle routing problem
- The vehicle routing problem with profits and consistency constraints
- Branch-and-check approaches for the tourist trip design problem with rich constraints
- The travelling salesman problem with positional consistency constraints: an application to healthcare services
- The time‐consistent dial‐a‐ride problem
- A branch-and-cut algorithm for the target visitation problem
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
- Discrete optimization model and algorithm for driver planning in periodic driver routing problem
- Branch-and-cut algorithms for the covering salesman problem
- Binary driver-customer familiarity in service routing
Uses Software
This page was built for publication: A branch-and-cut framework for the consistent traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320686)
