scientific article; zbMATH DE number 1305496

From MaRDI portal
Revision as of 16:26, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4252386

zbMath1052.90580MaRDI QIDQ4252386

David B. Shmoys, Fabián A. Chudak

Publication date: 1999


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (20)

Clustering to minimize the sum of cluster diametersNew approximation algorithms for the unsplittable capacitated facility location problemIntegrality gaps for strengthened linear relaxations of capacitated facility locationLP-based approximation for uniform capacitated facility location problemIncremental facility location problem and its competitive algorithmsAn improved approximation algorithm for the \(k\)-level facility location problem with soft capacitiesApproximation algorithms for supply chain planning and logistics problems with market choiceApproximation algorithms for the robust/soft-capacitated 2-level facility location problemsApproximating soft-capacitated facility location problem with uncertaintyCapacitated domination problemA simple and deterministic competitive algorithm for online facility locationFacility location models for distribution system designImproved approximation algorithms for capacitated facility location problemsBenders decomposition, Lagrangean relaxation and metaheuristic designThe facility location problem with general cost functionsAn LP-rounding based algorithm for a capacitated uniform facility location problem with penaltiesA systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problemsAn improved approximation algorithm for uncapacitated facility location problem with penaltiesA 3-approximation algorithm for the \(k\)-level uncapacitated facility location problemA constant-factor approximation algorithm for the \(k\)-median problem







This page was built for publication: