Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
Year of publication: |
2008
|
---|---|
Authors: | Aras, N. ; Orbay, M. ; Altinel, I. K. |
Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 716033-1. - Vol. 59.2008, 1, p. 64-79
|
Subject: | Betriebliche Standortwahl | Firm location choice | Transportkosten | Transport costs | Ganzzahlige Optimierung | Integer programming | Heuristik | Heuristics | Theorie | Theory |
-
Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem
Akyüz, M. Hakan, (2019)
-
Akyüz, M. H., (2012)
-
Single-source capacitated Multi-Facility Weber Problem : an iterative two phase heuristic algorithm
Manzour-al-Ajdad, S. M. H., (2012)
- More ...
-
Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
Aras, N., (2008)
-
Akyüz, M. H., (2012)
-
Optimal placement, scheduling, and routing to maximize lifetime in sensor networks
Türkoğulları, Y. B., (2010)
- More ...