Pages that link to "Item:Q1433151"
From MaRDI portal
The following pages link to A column generation approach to capacitated \(p\)-median problems (Q1433151):
Displayed 16 items.
- A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
- A scatter search-based heuristic to locate capacitated transshipment points (Q878590) (← links)
- An effective VNS for the capacitated \(p\)-median problem (Q932177) (← links)
- Validating vehicle routing zone construction using Monte Carlo simulation (Q976400) (← links)
- A branch and bound algorithm for determining locations of long-term care facilities (Q976416) (← links)
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow (Q1025254) (← links)
- A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
- Clustering search algorithm for the capacitated centered clustering problem (Q1038295) (← links)
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
- A branch-and-price approach to \(p\)-median location problems (Q1764773) (← links)
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← links)
- An exact algorithm for the capacitated vertex \(p\)-center problem (Q2496034) (← links)
- Solving a class of stochastic mixed-integer programs with branch and price (Q2502208) (← links)
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem (Q2570156) (← links)
- The capacitated centred clustering problem (Q2581607) (← links)
- Large-scale local search heuristics for the capacitated vertex<i>p</i>-center problem (Q4474299) (← links)