Pages that link to "Item:Q1578475"

The following pages link to The Hamiltonian \(p\)-median problem (Q1578475):

Displaying 9 items.

• Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem (Q323162) (← links)
• The Hamiltonian p-median problem (Q918861) (← links)
• A new variant of a vehicle routing problem: Lower and upper bounds (Q1598727) (← 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 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)
• The Hamiltonian \(p\)-median problem: polyhedral results and branch-and-cut algorithms (Q6565387) (← links)