Approximation algorithms for bounded facility location problems
From MaRDI portal
Recommendations
- An approximation framework for bounded facility location problems
- scientific article; zbMATH DE number 1559542
- scientific article; zbMATH DE number 1303535
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Analysis of a Local Search Heuristic for Facility Location Problems
Cited in
(16)- Approximation of the competitive facility location problem with MIPs
- Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
- Bounded fan-out \(m\)-center problem
- scientific article; zbMATH DE number 1688388 (Why is no real title available?)
- scientific article; zbMATH DE number 2159272 (Why is no real title available?)
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- Approximation algorithm for the uniform bounded facility problem
- scientific article; zbMATH DE number 1445291 (Why is no real title available?)
- Approximation algorithm for uniform bounded facility location problem
- On the approximation of the minimum disturbance \(p\)-facility location problem
- An approximation framework for bounded facility location problems
- Approximation Algorithms for Generalized Plant Location
- Approximate the lower-bounded connected facility location problem
- A voltage drop limited decentralized electric power distribution network
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- Borda winner in facility location problems on sphere
This page was built for publication: Approximation algorithms for bounded facility location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5943822)
