Facility location with matroid or knapsack constraints
Year of publication: |
2015
|
---|---|
Authors: | Krishnaswamy, Ravishankar ; Kumar, Amit ; Nagarajan, Viswanath ; Sabharwal, Yogish ; Saha, Barna |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 40.2015, 2, p. 446-459
|
Subject: | approximation algorithms | facility location | matroid | knapsack | Mathematische Optimierung | Mathematical programming | Betriebliche Standortwahl | Firm location choice | Ganzzahlige Optimierung | Integer programming | Standorttheorie | Location theory | Algorithmus | Algorithm |
-
Approximation algorithms for hard capacitated k-facility location problems
Aardal, Karen, (2015)
-
Greedy algorithms for the single-demand facility location problem
Cheung, Sin-Shuen, (2017)
-
Distributionally robust facility location with bimodal random demand
Shehadeh, Karmel S., (2021)
- More ...
-
Running errands in time : approximation algorithms for stochastic orienteering
Gupta, Anupam, (2015)
-
Stochastic load balancing on unrelated machines
Gupta, Anupam, (2021)
-
Facility location with red-blue demands
Arora, Sonika, (2014)
- More ...