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 0160-5682, 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)
-
A new modeling approach for the unrestricted block relocation problem
Kimms, Alf, (2023)
-
The parallel stack loading problem of minimizing the exact number of relocations
Tanaka, Shunji, (2024)
- More ...
-
Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
Aras, N., (2008)
-
An evolutionary approach for tuning parametric Esau and Williams heuristics
Battarra, M., (2012)
-
Öncan, T., (2009)
- More ...