Parameterized complexity of configuration integer programs
| Year of publication: |
2021
|
|---|---|
| Authors: | Knop, Dušan ; Koutecký, Martin ; Levin, Asaf ; Mnich, Matthias ; Onn, Shmuel |
| Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 6, p. 908-913
|
| Subject: | Configuration IP | Parameterized algorithms | Surfing | Theorie | Theory | Algorithmus | Algorithm | Ganzzahlige Optimierung | Integer programming |
-
Consistency cuts for Dantzig-Wolfe reformulations
Clausen, Jens Vinther, (2022)
-
Models for the two-dimensional level strip packing problem : a review and a computational evaluation
Bezerra, Vanessa M. R., (2020)
-
Variable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models
Desaulniers, Guy, (2020)
- More ...
-
Reducibility bounds of objective functions over the integers
Eisenbrand, Friedrich, (2023)
-
Sparse integer programming is fixed-parameter tractable
Eisenbrand, Friedrich, (2025)
-
Scheduling meets n-fold integer programming
Knop, Dušan, (2018)
- More ...