The following pages link to The Hamiltonian p-median problem (Q918861):
Displaying 19 items.
- Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem (Q323162) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- Location-routing: issues, models and methods (Q856260) (← links)
- Using clustering analysis in a capacitated location-routing problem (Q864016) (← links)
- The Hamiltonian p-median problem (Q918861) (← links)
- A new variant of a vehicle routing problem: Lower and upper bounds (Q1598727) (← links)
- A simple and effective evolutionary algorithm for the capacitated location-routing problem (Q1651634) (← links)
- An endosymbiotic evolutionary algorithm for the hub location-routing problem (Q1665926) (← links)
- A survey of the standard location-routing problem (Q1698292) (← links)
- Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm (Q1728472) (← links)
- Algorithms for the design of network topologies with balanced disjoint rings (Q2267818) (← links)
- A survey of variants and extensions of the location-routing problem (Q2629668) (← 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)
- Distribution network design on the battlefield (Q3168957) (← links)
- Node based compact formulations for the Hamiltonian <i>p</i>‐median problem (Q6180025) (← links)
- Decision support for the technician routing and scheduling problem (Q6180048) (← links)
- A hybrid genetic algorithm for the Hamiltonian <i>p</i>‐median problem (Q6196877) (← links)
- The Hamiltonian \(p\)-median problem: polyhedral results and branch-and-cut algorithms (Q6565387) (← links)
