Compact formulations for multi-depot routing problems: theoretical and computational comparisons
From MaRDI portal
Publication:2664423
DOI10.1016/j.cor.2020.105084zbMath1458.90059OpenAlexW3056354848MaRDI QIDQ2664423
Tolga Bektaş, Daniel Santos, Luís Gouveia
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105084
Programming involving graphs or networks (90C35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items (3)
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods ⋮ The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem ⋮ Node based compact formulations for the Hamiltonian p‐median problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal capacitated ring trees
- Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem
- Multi-depot multiple TSP: a polyhedral study and computational results
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
- Multiple depot ring star problem: a polyhedral study and an exact algorithm
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- A comparative analysis of several asymmetric traveling salesman problem formulations
- Hamiltonian location problems
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
- Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
- Clustering data that are graph connected
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- A compact model and tight bounds for a combined location-routing problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Multi-depot rural postman problems
- Vehicle Routing
- Integer Programming Formulation of Traveling Salesman Problems
- Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem
- A comparison of several models for the hamiltonian p‐median problem
- On extended formulations for the precedence constrained asymmetric traveling salesman problem
This page was built for publication: Compact formulations for multi-depot routing problems: theoretical and computational comparisons
