Author:
Dunkel Juliane,Schulz Andreas S.
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Chv´atal, V.: Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Mathematics 4, 305–337 (1973)
2. Cornu´ejols, G.: Valid inequalities for mixed integer linear programs, Mathematical Programming B 112, 3–44 (2008)
3. Dadush, D.; Dey, S. S.; Vielma, J. P.: The Chv´atal-Gomory closure of a strictly convex body,
http://www.optimization-online.org/DB/HTML/2010/05/2608.html
(2010)
4. Dadush, D.; Dey, S. S.; Vielma, J. P.: The Chv´atal-Gomory closure of a compact convex set, Proceedings of the 15th Conference on Integer Programming and Combinatorial Optimization (IPCO 2011), Lecture Notes in Computer Science Vol. 6655 (O. G¨unl¨uk and G. J.Woeginger, editors), 130–142 (2011)
5. Dey, S. S.; Vielma, J. P.: The Chv´atal-Gomory closure of an ellipsoid is a polyhedron, Proceedings of the 14th Conference on Integer Programming and Combinatorial Optimization (IPCO 2010), Lecture Notes in Computer Science Vol. 6080 (F. Eisenbrand and F. B. Shepherd, editors), 327–340 (2010)