scientific article; zbMATH DE number 1305496
From MaRDI portal
Publication:4252386
Cited in
(20)- An improved approximation algorithm for uncapacitated facility location problem with penalties
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- An improved approximation algorithm for the k-level facility location problem with soft capacities
- Improved approximation algorithms for capacitated facility location problems
- A constant-factor approximation algorithm for the k-median problem
- Clustering to minimize the sum of cluster diameters
- An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties
- LP-based approximation for uniform capacitated facility location problem
- Approximating soft-capacitated facility location problem with uncertainty
- Benders decomposition, Lagrangean relaxation and metaheuristic design
- New approximation algorithms for the unsplittable capacitated facility location problem
- Integrality gaps for strengthened linear relaxations of capacitated facility location
- The facility location problem with general cost functions
- Capacitated domination problem
- Incremental facility location problem and its competitive algorithms
- Approximation algorithms for supply chain planning and logistics problems with market choice
- Approximation algorithms for the robust/soft-capacitated 2-level facility location problems
- An LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
- A simple and deterministic competitive algorithm for online facility location
- Facility location models for distribution system design
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252386)
