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

Exact Duality in Semidefinite Programming Based on Elementary Reformulations., and . SIAM J. Optimization, 25 (3): 1441-1454 (2015)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)A simplified treatment of Ramana's exact dual for semidefinite programming., and . Optim. Lett., 17 (2): 219-243 (March 2023)Basis Reduction and the Complexity of Brand-and-Bound., , and . SODA, page 1254-1261. SIAM, (2010)Solving Integer and Disjunctive Programs by Lift and Project., and . IPCO, volume 1412 of Lecture Notes in Computer Science, page 271-283. Springer, (1998)Cone-LP's and Semidefinite Programs: Geometry.. IPCO, volume 1084 of Lecture Notes in Computer Science, page 162-174. Springer, (1996)An Echelon Form of Weakly Infeasible Semidefinite Programs and Bad Projections of the psd Cone., and . Found. Comput. Math., 24 (2): 347-384 (April 2024)