Approximation limits of linear programs (beyond hierarchies)
Year of publication: |
2015
|
---|---|
Authors: | Braun, Gábor ; Fiorini, Samuel ; Pokutta, Sebastian ; Steurer, David |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 40.2015, 3, p. 756-772
|
Subject: | combinatorial optimization | linear programming | semidefinite programming | approximation algorithms | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Computational results of a semidefinite branch-and-bound algorithm for k-cluster
Krislock, Nathan, (2016)
-
Approximating combinatorial optimization problems with the ordered weighted averaging criterion
Chassein, André, (2020)
-
Reference points and approximation algorithms in multicriteria discrete optimization
Büsing, Christina, (2017)
- More ...
-
Random half-integral polytopes
Braun, Gábor, (2011)
-
A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
Braun, Gábor, (2014)
-
Random half-integral polytopes
Braun, Gábor, (2011)
- More ...