Pages that link to "Item:Q299099"
From MaRDI portal
The following pages link to Approximate robust optimization for the connected facility location problem (Q299099):
Displaying 8 items.
- Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
- Almost robust discrete optimization (Q666949) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- On the power of static assignment policies for robust facility location problems (Q2061885) (← links)
- Deployment optimization of multi-hop wireless networks based on substitution graph (Q2293167) (← links)
- Approximate the lower-bounded connected facility location problem (Q2695316) (← links)
- Approximation Algorithms for the Robust Facility Location Problem with Penalties (Q2942466) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)