Pages that link to "Item:Q2960363"

The following pages link to A Branch-and-Price Algorithm for Solving the Hamiltonian <i>p</i>-Median Problem (Q2960363):

Displaying 11 items.

• Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem (Q323162) (← links)
• The Hamiltonian p-median problem (Q918861) (← links)
• Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm (Q1728472) (← links)
• A branch-and-price approach to \(p\)-median location problems (Q1764773) (← links)
• An exact column-generation approach for the lot-type design problem (Q1979196) (← links)
• Adaptation of a branching algorithm to solve the multi-objective Hamiltonian cycle problem (Q2050267) (← links)
• The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
• A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem (Q3386785) (← 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)