Pages that link to "Item:Q4680415"
From MaRDI portal
The following pages link to A branch‐and‐price algorithm for the capacitated <i>p</i>‐median problem (Q4680415):
Displaying 9 items.
- An implementation of exact knapsack separation (Q330511) (← links)
- Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent (Q337640) (← links)
- An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
- Model-based capacitated clustering with posterior regularization (Q724144) (← links)
- A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← links)
- A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
- Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems (Q6095737) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
