scientific article; zbMATH DE number 1305496
From MaRDI portal
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.
Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items
Clustering to minimize the sum of cluster diameters, New approximation algorithms for the unsplittable capacitated facility location problem, Integrality gaps for strengthened linear relaxations of capacitated facility location, LP-based approximation for uniform capacitated facility location problem, Incremental facility location problem and its competitive algorithms, An improved approximation algorithm for the \(k\)-level facility location problem with soft capacities, Approximation algorithms for supply chain planning and logistics problems with market choice, Approximation algorithms for the robust/soft-capacitated 2-level facility location problems, Approximating soft-capacitated facility location problem with uncertainty, Capacitated domination problem, A simple and deterministic competitive algorithm for online facility location, Facility location models for distribution system design, Improved approximation algorithms for capacitated facility location problems, Benders decomposition, Lagrangean relaxation and metaheuristic design, The facility location problem with general cost functions, An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties, A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems, An improved approximation algorithm for uncapacitated facility location problem with penalties, A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem, A constant-factor approximation algorithm for the \(k\)-median problem
