Author of the publication

Polyhedral methods for the maximum clique problem.

, , , and . Cliques, Coloring, and Satisfiability, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 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. 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

Solving Integer and Disjunctive Programs by Lift and Project., and . IPCO, volume 1412 of Lecture Notes in Computer Science, page 271-283. Springer, (1998)A Lagrangian-based heuristic for large-scale set covering problems., , and . Math. Program., (1998)Octane: A New Heuristic for Pure 0-1 Programs., , , , and . Oper. Res., 49 (2): 207-225 (2001)Polyhedral methods for the maximum clique problem., , , and . Cliques, Coloring, and Satisfiability, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 11-28. DIMACS/AMS, (1993)Solving Mixed 0-1 Programs by a Lift-and-Project Method., , and . SODA, page 232-242. ACM/SIAM, (1993)Combining and Strengthening Gomory Cuts., , and . IPCO, volume 920 of Lecture Notes in Computer Science, page 438-451. Springer, (1995)