Lower bounds for the Chvátal-Gomory rank in the 0/1cube
Year of publication: |
2011
|
---|---|
Authors: | Pokutta, Sebastian ; Stauffer, Gautier |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 39.2011, 3, p. 200-203
|
Subject: | Theorie | Theory | Ranking-Verfahren | Ranking method | Mathematische Optimierung | Mathematical programming |
-
On the design of R-based scalable frameworks for data science applications
Theußl, Stefan Peter, (2020)
-
A linear time randomizing algorithm for local roots and optima of ranked functions
Zemel, Eitan, (1984)
-
A restarting approach for the symmetric rank one update for unconstrained optimization
Leong, Wah June, (2009)
- More ...
-
Lower bounds for the Chvátal–Gomory rank in the 0/1 cube
Pokutta, Sebastian, (2011)
-
Robust modeling and planning: Insights from three industrial applications
Marla, Lavanya, (2020)
-
The p-median polytype of Y-free graphs : an application of the matching theory
Stauffer, Gautier, (2008)
- More ...