Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
Year of publication: |
2014
|
---|---|
Authors: | Akyüz, M. Hakan ; Altınel, İ. Kuban ; Öncan, Temel |
Published in: |
ORP 3 - OR for young researchers and practitioners. - New York, NY : Springer. - 2014, p. 45-71
|
Subject: | Betriebliche Standortwahl | Firm location choice | Branch-and-Bound | Branch and Bound | Theorie | Theory | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming | Operations Research | Operations research | Transportkosten | Transport costs |
-
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems
Akyüz, M. Hakan, (2013)
-
An exact algorithm for the modular hub location problem with single assignments
Tanash, Moayad, (2017)
-
Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem
Akyüz, M. Hakan, (2019)
- 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)
-
Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem
Akyüz, M. Hakan, (2019)
- More ...