Lagrangean relaxation for the capacitated hub location problem with single assignment
| Year of publication: |
2009
|
|---|---|
| Authors: | Contreras, Ivan ; Díaz, Juan A. ; Fernández, Elena |
| Published in: |
OR spectrum : quantitative approaches in management. - Berlin : Springer, ISSN 0171-6468, ZDB-ID 2073885-7. - Vol. 31.2009, 3, p. 483-505
|
| Subject: | Hub-and-Spoke-Netzwerk | Hub-and-spoke network | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Unternehmensarchitektur | Enterprise architecture | Operations Research | Operations research |
-
The tree-of-hubs location problem with interhub stopovers
Ariztegui-Beltrán, Oscar H., (2026)
-
A parallel adaptive memory algorithm for the capacitated modular hub location problem
Wu, Qinghua, (2023)
-
The hub location problem with market selection
Wu, Tao, (2021)
- More ...
-
Branch and price for large-scale capacitated hub location problems with single assignment
Contreras, Ivan, (2011)
-
Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
Contreras, Ivan, (2011)
-
Lagrangean relaxation for the capacitated hub location problem with single assignment
Contreras, Ivan, (2009)
- More ...