A 2-phase algorithm for solving the single allocation p-hub center problem
Year of publication: |
2009
|
---|---|
Authors: | Meyer, Tanja ; Ernst, A. T. ; Krishnamoorthy, M. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 36.2009, 12, p. 3143-3151
|
Subject: | Standorttheorie | Location theory | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Ganzzahlige Optimierung | Integer programming | USA | United States | Hub-and-Spoke-Netzwerk | Hub-and-spoke network | Algorithmus | Algorithm |
-
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
García, Sergio, (2012)
-
Uncapacitated single and multiple allocation p-hub center problems
Ernst, Andreas T., (2009)
-
Tóth, Boglárka, (2009)
- More ...
-
Dynamic scheduling of recreational rental vehicles with revenue management extensions
Ernst, A. T., (2010)
-
Staff scheduling and rostering: A review of applications, methods and models
Ernst, A. T., (2004)
-
Hub Arc Location Problems: Part II---Formulations and Optimal Algorithms
Campbell, J. F., (2005)
- More ...