Approximation algorithms for facility location problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1303535
- Analysis of a Local Search Heuristic for Facility Location Problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- scientific article; zbMATH DE number 1559542
- Approximation Algorithms for Metric Facility Location Problems
Cited in
(53)- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- Efficient algorithms for the capacitated concentrator location problem
- Approximation of the competitive facility location problem with MIPs
- Approximation algorithms for the transportation problem with market choice and related models
- An approximation framework for bounded facility location problems
- Approximation of solutions for location problems
- A constant-factor approximation algorithm for the k-median problem
- Donation center location problem
- On the power of static assignment policies for robust facility location problems
- Online facility location with mobile facilities
- Facility location problems: a parameterized view
- A new approximation algorithm for the k-facility location problem
- On the competitive ratio for online facility location
- Approximating the two-level facility location problem via a quasi-greedy approach
- Incremental algorithms for facility location and \(k\)-median
- Approximate the lower-bounded connected facility location problem
- Algorithms for facility location problems with outliers. (Extended abstract)
- Approximation Algorithms for Generalized Plant Location
- The reliable facility location problem: formulations, heuristics, and approximation algorithms
- Local search based approximation algorithms for two-stage stochastic location problems
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- Cost-effective designs of fault-tolerant access networks in communication systems
- The online prize-collecting facility location problem
- scientific article; zbMATH DE number 4204108 (Why is no real title available?)
- Approximation algorithms for distributed multi-robot coverage in non-convex environments
- Approximation Algorithms for Data Placement Problems
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties
- scientific article; zbMATH DE number 1303535 (Why is no real title available?)
- Using linear programming in the design and analysis of approximation algorithms: Two illustrative problems
- scientific article; zbMATH DE number 1947060 (Why is no real title available?)
- The facility location problem with general cost functions
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 2159272 (Why is no real title available?)
- Recent developments in approximation algorithms for facility location and clustering problems
- scientific article; zbMATH DE number 1445291 (Why is no real title available?)
- Exact algorithms for integrated facility location and production planning problems
- Facility Location with Matroid or Knapsack Constraints
- A survey on approximation algorithms for facility location problems
- Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
- scientific article; zbMATH DE number 5064928 (Why is no real title available?)
- Approximation algorithms for hierarchical location problems
- LP-based approximation algorithms for capacitated facility location
- A simple and deterministic competitive algorithm for online facility location
- A nearly optimal deterministic online algorithm for non-metric facility location
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem
- Compatibility of max and sum objectives for committee selection and k-facility location
- A 16-competitive algorithm for hierarchical median problem
- Approximation algorithms for the priority facility location problem with penalties
- A primal-dual algorithm for online non-uniform facility location
- A new approximation algorithm for the multilevel facility location problem
- Randomized priority algorithms
This page was built for publication: Approximation algorithms for facility location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753723)
