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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	European journal of operational research Ročník 242; číslo 2; s. 358 - 368
Hlavní autori:	Aardal, Karen, van den Berg, Pieter L., Gijswijt, Dion, Li, Shanfei
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 16.04.2015 Elsevier Sequoia S.A
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!