Allocating nodes to hubs for minimizing the hubs processing resources : a case study
Year of publication: |
2019
|
---|---|
Authors: | Balma, Ali ; Mrad, Mehdi |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 53.2019, 3, p. 807-827
|
Subject: | Hub allocation | Non-linear programming | Combinatorial optimization | Graphs and Networks | Reformulation-Linearization Technique | Telecommunications | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Allokation | Allocation | Telekommunikation | Scheduling-Verfahren | Scheduling problem | Hub-and-Spoke-Netzwerk | Hub-and-spoke network |
-
Algorithms for the minimum spanning tree problem with resource allocation
Kataoka, Seiji, (2016)
-
Comparison of metaheuristics for the k-labeled spanning forest problem
Consoli, Sergio, (2017)
-
Population-based iterated greedy algorithm for the S-labeling problem
Lozano, Manuel, (2023)
- More ...
-
Strong multi-commodity flow formulations for the asymmetric traveling salesman problem
Balma, Ali, (2018)
-
Tight lower bounds for the Traveling Salesman Problem with draft limits
Balma, Ali, (2023)
-
Balma, Ali, (2011)
- More ...