Pages that link to "Item:Q1421050"
From MaRDI portal
The following pages link to Two exact algorithms for the capacitated \(p\)-median problem (Q1421050):
Displaying 13 items.
- An implementation of exact knapsack separation (Q330511) (← links)
- An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
- Using dual feasible functions to construct fast lower bounds for routing and location problems (Q499343) (← links)
- Model-based capacitated clustering with posterior regularization (Q724144) (← links)
- A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
- A branch-and-price algorithm for the two-dimensional level strip packing problem (Q1029564) (← links)
- Primal and dual bounds for the vertex \(p\)-median problem with balance constraints (Q1686518) (← links)
- A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem (Q1761153) (← links)
- Linearization technique with superior expressions for centralized planning problem with discount policy (Q2137652) (← links)
- A cutting plane method for knapsack polytope (Q2391714) (← links)
- Solving the swath segment selection problem through Lagrangean relaxation (Q2456644) (← links)
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← 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)
