A note on the approximability of deepest-descent circuit steps
Year of publication: |
2021
|
---|---|
Authors: | Borgwardt, Steffen Alexander ; Brand, Cornelius ; Feldmann, Andreas Emil ; Koutecký, Martin |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 3, p. 310-315
|
Subject: | Circuits | Complexity theory | Deepest-descent steps | Linear programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
An implementation of steepest-descent augmentation for linear programs
Borgwardt, Steffen, (2020)
-
Yazdanjue, Navid, (2023)
-
Nickel, Stefan, (2022)
- More ...
-
Approximating max-cut under graph-MSO constraints
Koutecký, Martin, (2018)
-
Scheduling meets n-fold integer programming
Knop, Dušan, (2018)
-
Reducibility bounds of objective functions over the integers
Eisenbrand, Friedrich, (2023)
- More ...