A new formulation and branch-and-cut method for single-allocation hub location problems
Year of publication: |
2023
|
---|---|
Authors: | Espejo, Inmaculada ; Marín, Alfredo ; Muñoz-Ocaña, Juan M. ; Rodríguez-Chía, Antonio 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. 155.2023, p. 1-16
|
Subject: | Hub location | Single allocation | Discrete optimization | Branch-and-cut | Theorie | Theory | Hub-and-Spoke-Netzwerk | Hub-and-spoke network | Ganzzahlige Optimierung | Integer programming | Betriebliche Standortwahl | Firm location choice | Mathematische Optimierung | Mathematical programming |
-
Exact methods for the discrete multiple allocation (r|p) hub-centroid problem
Araújo, Antonio Camargo Andrade de, (2020)
-
The single allocation hub location problem : a robust optimisation approach
Ghaffari-Nasab, Nader, (2015)
-
An improved MIP heuristic for the intermodal hub location problem
He, Yan, (2015)
- More ...
-
Closest assignment constraints in discrete location problems
Espejo, Inmaculada, (2012)
-
Closest assignment constraints in discrete location problems
Espejo, Inmaculada, (2012)
-
Closest assignment constraints in discrete location problems
Espejo, Inmaculada, (2012)
- More ...