Approximation algorithms for hard capacitated k-facility location problems

•The first FPTAS for the single-sink capacitated k-facility location problem (CKFL).•A polynomial time algorithm for the uniform CKFL with a fixed number of clients.•Approximation algorithms for two variants of CKFL by utilizing the extreme solutions.•An improved approximation algorithm for CFL with...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 242; no. 2; pp. 358 - 368
Main Authors:	Aardal, Karen, van den Berg, Pieter L., Gijswijt, Dion, Li, Shanfei
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 16.04.2015 Elsevier Sequoia S.A
Subjects:	Algorithms Approximation Approximation algorithms Clients Combinatorial optimization Cost reduction Costs Demand Facility location Integer programming Location analysis Mathematical analysis Operations research Polynomials Studies Transportation problem (Operations research) Facility location Combinatorial optimization Approximation algorithms
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!