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 | Theorie | Theory | Betriebliche Standortwahl | Firm location choice |
-
A new formulation and branch-and-cut method for single-allocation hub location problems
Espejo, Inmaculada, (2023)
-
Branch-and-price-and-cut for a service network design and hub location problem
Rothenbächer, Ann-Kathrin, (2016)
-
Yıldız, Bariş, (2021)
- 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)
-
The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
Hernández-Pérez, Hipólito, (2009)
- More ...