From post

Polyhedral methods for the maximum clique problem.

, , , и . Cliques, Coloring, and Satisfiability, том 26 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 11-28. DIMACS/AMS, (1993)

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.

 

Другие публикации лиц с тем же именем

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