An improved cut-and-solve algorithm for the single-source capacitated facility location problem
Year of publication: |
March 2018
|
---|---|
Authors: | Gadegaard, Sune Lauth ; Klose, Andreas ; Nielsen, Lars Relund |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 6.2018, 1, p. 1-27
|
Subject: | Facility location | Capacitated facility location | Single-sourcing | Cutting planes | Local branching | Cut-and-solve | Betriebliche Standortwahl | Firm location choice | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Standorttheorie | Location theory | Ganzzahlige Optimierung | Integer programming |
-
Approximation algorithms for hard capacitated k-facility location problems
Aardal, Karen, (2015)
-
Facility location with matroid or knapsack constraints
Krishnaswamy, Ravishankar, (2015)
-
Greedy algorithms for the single-demand facility location problem
Cheung, Sin-Shuen, (2017)
- More ...
-
A bi-objective approach to discrete cost-bottleneck location problems
Gadegaard, Sune Lauth, (2018)
-
Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
Gadegaard, Sune Lauth, (2019)
-
Forget, Nicolas, (2022)
- More ...