An exact algorithm for the modular hub location problem with single assignments
Year of publication: |
September 2017
|
---|---|
Authors: | Tanash, Moayad ; Contreras, Ivan ; Vidyarthi, Navneet |
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. 85.2017, p. 32-44
|
Subject: | Hub location | Flow-dependent costs | Lagrangean relaxation | Hub-and-Spoke-Netzwerk | Hub-and-spoke network | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Operations Research | Operations research | Theorie | Theory | Heuristik | Heuristics | Betriebliche Standortwahl | Firm location choice | Branch-and-Bound | Branch and Bound | Ganzzahlige Optimierung | Integer programming |
-
Exact solution of hub network design problems with profits
Alibeyg, Armaghan, (2018)
-
Meier, Fabian, (2017)
-
An improved MIP heuristic for the intermodal hub location problem
He, Yan, (2015)
- More ...
-
Exact and heuristic approaches for the cycle hub location problem
Contreras, Ivan, (2017)
-
Two-level capacitated discrete location with concave costs
Malik, Aditya, (2022)
-
Al Athamneh, Raed, (2023)
- More ...