LP-based approximation algorithms for capacitated facility location

In the capacitated facility location problem with hard capacities, we are given a set of facilities, , and a set of clients in a common metric space. Each facility i has a facility opening cost f i and capacity u i that specifies the maximum number of clients that may be assigned to this facility. W...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 131; no. 1-2; pp. 365 - 379
Main Authors:	Levi, Retsef, Shmoys, David B., Swamy, Chaitanya
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer-Verlag 01.02.2012 Springer Springer Nature B.V
Subjects:	Algorithms Applied sciences Approximation Calculus of Variations and Optimal Control; Optimization Clients Combinatorics Cost engineering Costs Exact sciences and technology Flows in networks. Combinatorial problems Full Length Paper Guarantees Integer programming Linear programming Location analysis Logistics Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Operational research and scientific management Operational research. Management science Operations research Optimization Position (location) Scripts Studies Theoretical logistics Mathematical Programming 90B06 Operations Research transportation Costs Operations research Metric space Rounding error Approximation algorithm Location problem Facility location Partitioning Capacity Opening Relaxation method Mathematical programming Lp approximation Lower bound Local search Linear programming Standards Optimal solution NP hard problem Open systems Problem solving Capacity constraint Logistics
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!