Approximation algorithms for hard capacitated k-facility location problems
Year of publication: |
2015
|
---|---|
Authors: | Aardal, Karen ; Berg, Pieter L. van den ; Gijswijt, Dion ; Li, Shanfei |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 242.2015, 2 (16.4.), p. 358-368
|
Subject: | Combinatorial optimization | Facility location | Approximation algorithms | Algorithmus | Algorithm | Betriebliche Standortwahl | Firm location choice | Mathematische Optimierung | Mathematical programming | Standorttheorie | Location theory | Ganzzahlige Optimierung | Integer programming | Operations Research | Operations research |
-
Facility location with matroid or knapsack constraints
Krishnaswamy, Ravishankar, (2015)
-
Some new clique inequalities in four-index hub location models
Landete, Mercedes, (2024)
-
A scalable exact algorithm for the vertex p-center problem
Contardo, Claudio, (2019)
- More ...
-
Approximation algorithms for hard capacitated k-facility location problems
Aardal, Karen, (2015)
-
Time-dependent MEXCLP with start-up and relocation cost
Berg, Pieter L. van den, (2015)
-
Integer packing sets form a well-quasi-ordering
Del Pia, Alberto, (2021)
- More ...