Pages that link to "Item:Q367624"
From MaRDI portal
The following pages link to Multi-depot multiple TSP: a polyhedral study and computational results (Q367624):
Displaying 12 items.
- Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163) (← links)
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623) (← links)
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
- Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm (Q1728472) (← links)
- The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons (Q2664423) (← links)
- Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach (Q2668611) (← links)
- Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (Q6085888) (← links)
- Node based compact formulations for the Hamiltonian <i>p</i>‐median problem (Q6180025) (← links)
- New path elimination constraints for multi-depot routing problems (Q6496355) (← links)
- The Hamiltonian \(p\)-median problem: polyhedral results and branch-and-cut algorithms (Q6565387) (← links)
