( en | de | ru )

 

Disambiguation of "Cornuéjols, Gérard"

Author of the publication

copydeleteadd this publication to your clipboard
Cutting planes from two-term disjunctions.

, , , , and . Oper. Res. Lett., 41 (5): 442-444 (2013)

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.

Gérard Gäfgen

Walter Gérard

Gérard Sprüssel

Emilie Gérard

Bruno Gérard

 

Other publications of authors with the same name

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)Critical graphs, matching and tours or a hierarchy of relaxations for the traveling salesman problem., and . Combinatorica, 3 (1): 35-52 (1983)A Class of Logic Problems Solvable by Linear Programming., and . J. ACM, 42 (5): 1107-1113 (1995)A matroid algorithm and its application to the efficient solution of two optimization problems on graphs., , and . Math. Program., 42 (1-3): 471-487 (1988)Practical strategies for generating rank-1 split cuts in mixed-integer linear programming., and . Math. Program. Comput., 3 (4): 281-318 (2011)Recognizing Balanced 0, +/- Matrices., , , and . SODA, page 103-111. ACM/SIAM, (1994)When the Gomory-Chvátal closure coincides with the integer hull., and . Oper. Res. Lett., 46 (2): 251-256 (2018)K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau., , and . INFORMS J. Comput., 15 (4): 385-396 (2003)A Class of Hard Small 0-1 Programs., and . INFORMS J. Comput., 11 (2): 205-210 (1999)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)