The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
Published 2022 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
Authors
Keywords
-
Journal
NETWORKS
Volume -, Issue -, Pages -
Publisher
Wiley
Online
2022-09-07
DOI
10.1002/net.22125
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm
- (2021) Michiel A. J. uit het Broek et al. OPERATIONS RESEARCH
- The family traveling salesman problem with incompatibility constraints
- (2021) Raquel Bernardino et al. NETWORKS
- Wave order picking under the mixed-shelves storage strategy: A solution method and advantages
- (2021) Seyyed Amir Babak Rasmi et al. COMPUTERS & OPERATIONS RESEARCH
- Heuristic approaches for the family traveling salesman problem
- (2020) Raquel Bernardino et al. International Transactions in Operational Research
- A generic exact solver for vehicle routing and related problems
- (2020) Artur Pessoa et al. MATHEMATICAL PROGRAMMING
- Compact formulations for multi-depot routing problems: Theoretical and computational comparisons
- (2020) Tolga Bektaş et al. COMPUTERS & OPERATIONS RESEARCH
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
- (2020) Katrin Heßler et al. DISCRETE APPLIED MATHEMATICS
- Exact solution of the soft-clustered vehicle-routing problem
- (2019) Timo Hintsch et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
- (2018) M. Burger et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Solving the family traveling salesman problem
- (2018) Raquel Bernardino et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Designing efficient order picking systems by combining planning problems: State-of-the-art classification and review
- (2018) Teun van Gils et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Operating room planning and surgical case scheduling: a review of literature
- (2018) Shuwan Zhu et al. JOURNAL OF COMBINATORIAL OPTIMIZATION
- Warehousing in the e-commerce era: A survey
- (2018) Nils Boysen et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Picker routing in the mixed-shelves warehouses of e-commerce retailers
- (2018) Felix Weidinger et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- New path elimination constraints for multi-depot routing problems
- (2017) Tolga Bektaş et al. NETWORKS
- Exact and heuristic algorithms for the Hamiltonian p -median problem
- (2016) Güneş Erdoğan et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Multiple depot ring star problem: a polyhedral study and an exact algorithm
- (2016) Kaarthik Sundar et al. JOURNAL OF GLOBAL OPTIMIZATION
- Multi-depot rural postman problems
- (2016) Elena Fernández et al. Top
- A comparison of several models for the hamiltonian p -median problem
- (2014) Stefan Gollowitzer et al. NETWORKS
- Exact Algorithms for the Clustered Vehicle Routing Problem
- (2014) Maria Battarra et al. OPERATIONS RESEARCH
- Randomized heuristics for the family traveling salesperson problem
- (2013) L.F. Morán-Mirabal et al. International Transactions in Operational Research
- Multi-depot Multiple TSP: a polyhedral study and computational results
- (2011) Enrique Benavent et al. ANNALS OF OPERATIONS RESEARCH
- The multi-depot split delivery vehicle routing problem: An integer programming-based heuristic, new test problems, and computational results
- (2011) Damon Gulczynski et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
- (2011) Tolga Bektaş EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- (2011) Roberto Baldacci et al. OPERATIONS RESEARCH
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- (2010) José-Manuel Belenguer et al. COMPUTERS & OPERATIONS RESEARCH
- Operating room planning and scheduling: A literature review
- (2009) Brecht Cardoen et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Become a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get StartedAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started