Author of the publication

Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point.

, and . IPCO, volume 9682 of Lecture Notes in Computer Science, page 387-397. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Sufficiency of cut-generating functions., , and . Math. Program., 152 (1-2): 643-651 (2015)A Geometric Perspective on Lifting., , and . Operations Research, 59 (3): 569-577 (2011)Intersecting Restrictions in Clutters., , and . Comb., 40 (5): 605-623 (2020)On Packing Dijoins in Digraphs and Weighted Digraphs., , and . SIAM J. Discret. Math., 37 (4): 2417-2461 (December 2023)A counterexample to a conjecture of Gomory and Johnson., , , and . Math. Program., 133 (1-2): 25-38 (2012)Balanced matrices., , and . Discret. Math., 306 (19-20): 2411-2437 (2006)Idealness of k-wise Intersecting Families., , , and . IPCO, volume 12125 of Lecture Notes in Computer Science, page 1-12. Springer, (2020)A Class of Logic Problems Solvable by Linear Programming, and . FOCS, page 670-675. IEEE Computer Society, (1992)Special issue of Mathematical Programming, Series B, dedicated to the international symposium on mathematical programming, Pittsburgh, July 2015., and . Math. Program., 151 (1): 1-2 (2015)The packing property., , and . Math. Program., 89 (1): 113-126 (2000)