An exact method for binary fortification games
Year of publication: |
2023
|
---|---|
Authors: | Leitner, Markus ; Ljubić, Ivana ; Monaci, Michele ; Sinnl, Markus ; Tanınmış, Kübra |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 307.2023, 3 (16.6.), p. 1026-1039
|
Subject: | Branch-and-cut | Combinatorial optimization | Maximum knapsack fortification | Shortest path fortification | Three-level optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming |
-
Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem
Cunha, Alexandre Salles da, (2015)
-
Solving resource constrained shortest path problems with LP-based methods
Horváth, Markó, (2016)
-
Silva, Allyson, (2021)
- More ...
-
ILP heuristics and a new exact method for bi-objective 0/1 ILPs : application to FTTx-network design
Leitner, Markus, (2016)
-
A computational study of exact approaches for the bi-objective prize-collecting steiner tree problem
Leitner, Markus, (2015)
-
Leitner, Markus, (2018)
- More ...