Pages that link to "Item:Q613660"
From MaRDI portal
The following pages link to An approximation algorithm for the \(k\)-level capacitated facility location problem (Q613660):
Displaying 11 items.
- An approximation algorithm for the dynamic facility location problem with submodular penalties (Q403471) (← links)
- A primal-dual approximation algorithm for stochastic facility location problem with service installation costs (Q644537) (← links)
- Approximation algorithms for the priority facility location problem with penalties (Q905151) (← links)
- A cross-monotonic cost sharing method for the facility location game with service installation costs (Q1047875) (← links)
- Multi-level facility location problems (Q1754251) (← links)
- An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space (Q2165794) (← links)
- Approximation algorithms for the dynamic \(k\)-level facility location problems (Q2220850) (← links)
- A primal-dual approximation algorithm for the facility location problem with submodular penalties (Q2429335) (← links)
- Approximation algorithms for the stochastic priority facility location problem (Q2868906) (← links)
- Exactly solving a two-level location problem with modular node capacities (Q2892154) (← links)
- Approximation Algorithm for Resource Allocation Problems with Time Dependent Penalties (Q4639927) (← links)
