The following pages link to Hamiltonian location problems (Q1173005):
Displaying 25 items.
- Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem (Q323162) (← links)
- A memetic algorithm for the capacitated location-routing problem with mixed backhauls (Q337427) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery (Q713116) (← links)
- Location-routing: issues, models and methods (Q856260) (← links)
- The Hamiltonian p-median problem (Q918861) (← links)
- Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
- Vehicle routing considerations in distribution system design (Q1107414) (← links)
- Hamiltonian location problems (Q1173005) (← links)
- Combined location-routing problems: A synthesis and future research directions (Q1295989) (← links)
- Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm (Q1728472) (← links)
- Distribution network design: New problems and related models (Q1771348) (← links)
- Designing radio-mobile access networks based on synchronous digital hierarchy rings (Q1885949) (← links)
- A compact model and tight bounds for a combined location-routing problem (Q1886846) (← links)
- Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
- A particle swarm optimization algorithm with path relinking for the location routing problem (Q2481605) (← links)
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons (Q2664423) (← links)
- Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem (Q2815453) (← links)
- A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)
- A Branch-and-Price Algorithm for Solving the Hamiltonian <i>p</i>-Median Problem (Q2960363) (← links)
- Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem (Q3088086) (← links)
- Distribution network design on the battlefield (Q3168957) (← links)
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (Q6085888) (← links)
- A hybrid genetic algorithm for the Hamiltonian <i>p</i>‐median problem (Q6196877) (← links)
- New path elimination constraints for multi-depot routing problems (Q6496355) (← links)
