Pages that link to "Item:Q1728472"

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 6 items.

• The directional \(p\)-median problem: definition, complexity, and algorithms (Q864030) (← links)
• The Hamiltonian \(p\)-median problem (Q1578475) (← links)
• Compact formulations for multi-depot routing problems: theoretical and computational comparisons (Q2664423) (← links)
• A Branch-and-Price Algorithm for Solving the Hamiltonian <i>p</i>-Median Problem (Q2960363) (← 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)