Pages that link to "Item:Q662296"
From MaRDI portal
The following pages link to LP-based approximation algorithms for capacitated facility location (Q662296):
Displaying 14 items.
- Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- The stochastic capacitated branch restructuring problem (Q512982) (← links)
- An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties (Q2045029) (← links)
- Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
- LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
- A note on LP-based approximation algorithms for capacitated facility location problem (Q2172603) (← links)
- Capacitated covering problems in geometric spaces (Q2189730) (← links)
- Approximation algorithms for hard capacitated \(k\)-facility location problems (Q2630091) (← links)
- A Game Theoretic Model for the Optimal Location of Integrated Air Defense System Missile Batteries (Q2830945) (← links)
- LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
- A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions (Q4995059) (← links)
- Constant factor approximation algorithm for uniform hard capacitated knapsack median problem (Q5090959) (← links)
- Capacitated Covering Problems in Geometric Spaces (Q5115774) (← links)
