A branch-and-cut algorithm for the hub location and routing problem
Year of publication: |
2014
|
---|---|
Authors: | Rodríguez-Martín, Immaculada ; Salazar-González, Juan-José ; Yaman, Hande |
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. 50.2014, p. 161-174
|
Subject: | Hub location | Routing | Valid inequalities | Branch-and-cut | Tourenplanung | Vehicle routing problem | Hub-and-Spoke-Netzwerk | Hub-and-spoke network | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm |
-
Heuristic algorithms for the single allocation p-hub center problem with routing considerations
Kartal, Zühal, (2019)
-
Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
Schulz, Arne, (2024)
-
Formulations and Branch-and-cut algorithms for the Period Travelling Salesman Problem
Henriques, Sofia, (2025)
- More ...
-
A branch-and-cut algorithm for two-level survivable network design problems
Rodríguez-Martín, Inmaculada, (2016)
-
The periodic vehicle routing problem with driver consistency
Rodríguez-Martín, Inmaculada, (2019)
-
Statistical confidentiality: optimization techniques to protect tables
Salazar-González, Juan-José, (2008)
- More ...