A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
Year of publication: |
2012
|
---|---|
Authors: | Görtz, Simon ; Klose, Andreas |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 24.2012, 4, p. 597-610
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Betriebliche Standortwahl | Firm location choice | Algorithmus | Algorithm |
-
On a class of algorithms solving the multifacility location problem with perturbed Lp-distances
Frenk, J. B., (1994)
-
Construction line algorithms for the connection location-allocation problem
Bischoff, Martin, (2008)
-
A cutting plane algorithm for the capacitated facility location problem
Avella, Pasquale, (2009)
- More ...
-
Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem
Görtz, Simon, (2009)
-
The single-sink fixed-charge transportation problem : applications and solution methods
Görtz, Simon, (2007)
-
On-line routing per mobile phone : a case on subsequent deliveries of newspapers
Bieding, Thomas, (2009)
- More ...