A branch and cut algorithm for the hierarchical network design problem
Year of publication: |
2010
|
---|---|
Authors: | Obreque, Carlos ; Donoso, Macarena ; Gutiérrez, Gabriel ; Marianov, Vladimir |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 200.2009/10, 1 (1.1.), p. 28-35
|
Subject: | Algorithmus | Algorithm | Operations Research | Operations research | Branch-and-Bound | Branch and Bound | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming |
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
Branch-and-cut algorithms for the p-arborescence star problem
Pereira, Armando Honorio, (2022)
-
A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
Karaoglan, Ismail, (2011)
- More ...
-
A branch and cut algorithm for the hierarchical network design problem
Obreque, Carlos, (2010)
-
Obreque, Carlos, (2010)
-
Scheduling problems with deteriorating jobs and learning effects including proportional setup times
Gutiérrez-Jarpa, Gabriel, (2010)
- More ...