Branch and price for large-scale capacitated hub location problems with single assignment
Year of publication: |
2011
|
---|---|
Authors: | Contreras, Ivan ; Díaz, Juan A. ; Fernández Muñoz, Elena |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 23.2011, 1, p. 41-55
|
Subject: | Mathematische Optimierung | Mathematical programming | Hub-and-Spoke-Netzwerk | Hub-and-spoke network | Heuristik | Heuristics | Operations Research | Operations research |
-
Al Athamneh, Raed, (2023)
-
An improved MIP heuristic for the intermodal hub location problem
He, Yan, (2015)
-
Saboury, Ali, (2013)
- More ...
-
General network design : a unified view of combined location and network design problems
Contreras, Ivan, (2012)
-
Lagrangean relaxation for the capacitated hub location problem with single assignment
Contreras, Ivan, (2009)
-
Lagrangean relaxation for the capacitated hub location problem with single assignment
Contreras, Ivan, (2009)
- More ...