Solving the multi-commodity capacitated multi-facility Weber problem usning Lagrangean relaxation and a subgradient-like algorithm
Year of publication: |
2012
|
---|---|
Authors: | Akyüz, M. H. ; Öncan, T. ; Altinel, I. K. |
Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 716033-1. - Vol. 63.2012, 6, p. 771-789
|
Subject: | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Betriebliche Standortwahl | Firm location choice | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Transportkosten | Transport costs |
-
Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem
Akyüz, M. Hakan, (2019)
-
Ghaderi, Abdolsalam, (2015)
-
Irawan, Chandra Ade, (2019)
- More ...
-
Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
Aras, N., (2008)
-
Altinel, I.K., (2005)
-
Design of unidirectional cyclic layouts
Altinel, I., (2005)
- More ...