Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem
Year of publication: |
2019
|
---|---|
Authors: | Akyüz, M. Hakan ; Öncan, Temel ; Altınel, İ. Kuban |
Published in: |
Annals of operations research ; volume 279, numbers 1/2 (August 2019). - New York, NY, USA : Springer. - 2019, p. 1-42
|
Subject: | Facility location-allocation | Branch-and-bound algorithm | Multi-commodity transportation | Branch-and-Bound | Branch and Bound | Betriebliche Standortwahl | Firm location choice | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Theorie | Theory | Heuristik | Heuristics | Transportkosten | Transport costs |
-
The parallel stack loading problem of minimizing the exact number of relocations
Tanaka, Shunji, (2024)
-
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems
Akyüz, M. Hakan, (2013)
-
Akyüz, M. Hakan, (2014)
- More ...
-
Akyüz, M. Hakan, (2012)
-
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems
Akyüz, M. Hakan, (2013)
-
Akyüz, M. Hakan, (2014)
- More ...