Pages that link to "Item:Q1728472"
From MaRDI portal
The following pages link to Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm (Q1728472):
Displaying 3 items.
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons (Q2664423) (← links)
- Node based compact formulations for the Hamiltonian <i>p</i>‐median problem (Q6180025) (← links)
- A hybrid genetic algorithm for the Hamiltonian <i>p</i>‐median problem (Q6196877) (← links)
