Pages that link to "Item:Q323162"
From MaRDI portal
The following pages link to Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem (Q323162):
Displaying 6 items.
- Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm (Q1728472) (← links)
- A general variable neighborhood search approach based on a \(p\)-median model for cellular manufacturing problems (Q2070119) (← links)
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons (Q2664423) (← 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)
- A hybrid genetic algorithm for the Hamiltonian <i>p</i>‐median problem (Q6196877) (← links)
