Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems
Year of publication: |
2013
|
---|---|
Authors: | Akyüz, M. Hakan ; Öncan, Temel ; Altınel, İ. Kuban |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 40.2013, 12, p. 3056-3068
|
Subject: | Location–allocation | Transportation | Branch and bound | Beam search | Heuristik | Heuristics | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Betriebliche Standortwahl | Firm location choice | Operations Research | Operations research | Transportkosten | Transport costs | Branch-and-Bound | Branch and Bound |
-
Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem
Akyüz, M. Hakan, (2019)
-
An exact algorithm for the block relocation problem with a stowage plan
Tanaka, Shunji, (2019)
-
Akyüz, M. Hakan, (2014)
- More ...
-
Akyüz, M. Hakan, (2014)
-
Akyüz, M. Hakan, (2012)
-
Assignment problem with conflicts
Öncan, Temel, (2019)
- More ...