Multi-depot multiple TSP: a polyhedral study and computational results
From MaRDI portal
Publication:367624
DOI10.1007/S10479-011-1024-YzbMATH Open1272.90065OpenAlexW2119235896MaRDI QIDQ367624FDOQ367624
Authors: Enrique Benavent, Antonio Martínez 
Publication date: 16 September 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-1024-y
Recommendations
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
- A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
- Integer linear programming formulations of multiple salesman problems and its variations
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
- A multi-depot travelling salesman problem and its iterative and integrated approaches
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- The traveling salesman problem. A computational study.
- TSPLIB—A Traveling Salesman Problem Library
- The traveling salesman problem and its variations
- On the symmetric travelling salesman problem I: Inequalities
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
- Title not available (Why is that?)
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Facet identification for the symmetric traveling salesman polytope
- A unified exact method for solving different classes of vehicle routing problems
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
- A branch-and-cut algorithm for the plant-cycle location problem
- Integer linear programming formulations of multiple salesman problems and its variations
- Transformation of multidepot multisalesmen problem to the standard travelling salesman problem
- The graphical relaxation: A new framework for the symmetric traveling salesman polytope
- Hamiltonian path and symmetric travelling salesman polytopes
- A cutting plane algorithm for minimum perfect 2-matchings
- A Lagrangian-based algorithm for a combinatorial motion planning problem
- Edmonds polytopes and weakly hamiltonian graphs
Cited In (20)
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
- Integer linear programming formulations of multiple salesman problems and its variations
- The Hamiltonian \(p\)-median problem: polyhedral results and branch-and-cut algorithms
- On the multiple Steiner traveling salesman problem with order constraints
- A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
- Node based compact formulations for the Hamiltonian p‐median problem
- A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
- Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
- Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
- The multiple Steiner TSP with order constraints: complexity and optimization algorithms
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
- New path elimination constraints for multi-depot routing problems
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons
- Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
- Multiple depot ring star problem: a polyhedral study and an exact algorithm
- A multi-depot travelling salesman problem and its iterative and integrated approaches
Uses Software
This page was built for publication: Multi-depot multiple TSP: a polyhedral study and computational results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367624)
