Exact approaches for the directed network design problem with relays
| Year of publication: |
2020
|
|---|---|
| Authors: | Leitner, Markus ; Ljubić, Ivana ; Riedler, Martin ; Ruthmair, Mario |
| Published in: |
Omega : the international journal of management science. - Oxford [u.a.] : Elsevier, ISSN 0305-0483, ZDB-ID 124502-8. - Vol. 91.2020, p. 1-17
|
| Subject: | Integer programming | Layered graphs | Networks | Telecommunications | Ganzzahlige Optimierung | Graphentheorie | Graph theory | Netzplantechnik | Project network techniques | Telekommunikation | Operations Research | Operations research | Algorithmus | Algorithm |
-
An exact method for the biobjective shortest path problem for large-scale road networks
Duque, Daniel, (2015)
-
Chen, Yanru, (2025)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
- More ...
-
Exact approaches for network design problems with relays
Leitner, Markus, (2019)
-
Arc routing with electric vehicles : dynamic charging and speed-dependent energy consumption
Fernández, Elena, (2022)
-
Benders decomposition for competitive influence maximization in (social) networks
Kahr, Michael, (2021)
- More ...