Reformulations and computational results for the uncapacitated single allocation hub covering problem
Year of publication: |
2011
|
---|---|
Authors: | Ernst, Andreas T. ; Jiang, Houyuan ; Krishnamoorty, Mohan ; Baatar, Davaatseren |
Publisher: |
Cambridge : Judge Business School, Univ. of Cambridge |
Subject: | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Hub-and-Spoke-Netzwerk | Hub-and-spoke network | Scheduling-Verfahren | Scheduling problem |
-
Al Athamneh, Raed, (2023)
-
Single allocation hub covering problems with waiting times
Wagner, Bernd, (2004)
-
A tabu-search based heuristic for the hub covering problem over incomplete hub networks
Calık, Hatice, (2009)
- More ...
-
Andreas T. Ernst, (2011)
-
Algorithms for large scale shift minimisation personnel task scheduling problems
Krishnamoorthy, M., (2012)
-
Symmetry breaking of identical projects in the high-multiplicity RCPSP/max
Edwards, Steven J., (2021)
- More ...