Some lower bounds on sparse outer approximations of polytopes
Year of publication: |
2015
|
---|---|
Authors: | Dey, Santanu S. ; Iroume, Andres ; Molinaro, Marco |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 43.2015, 3, p. 323-328
|
Subject: | Sparse inequalities | Polytopes | Approximation | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Einkommensverteilung | Income distribution |
-
The Quadratic Unconstrained Binary Optimization Problem : Theory, Algorithms, and Applications
Punnen, Abraham P., (2022)
-
The mixing time of the Dikin walk in a polytope : a simple proof
Sachdeva, Sushant, (2016)
-
Imputation of numerical data under edit restrictions : the vertices approach
Waal, Ton de, (2017)
- More ...
-
The strength of multi-row aggregation cuts for sign-pattern integer programs
Dey, Santanu S., (2018)
-
Analysis of sparse cutting planes for sparse MILPs with applications to stochastic MILPs
Dey, Santanu S., (2018)
-
Characterization of the split closure via geometric lifting
Basu, Amitabh, (2015)
- More ...