Author of the publication

Lexicography and degeneracy: can a pure cutting plane algorithm work?

, , and . Math. Program., 130 (1): 153-176 (2011)

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

Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study., and . INFORMS J. Comput., 13 (1): 56-75 (2001)Projection with a Minimal System of Inequalities.. Comput. Optim. Appl., 10 (2): 189-193 (1998)Projecting systems of linear inequalities with binary variables.. Ann. Oper. Res., 188 (1): 19-31 (2011)Finding Out Whether a Valid Inequality is Facet Defining.. IPCO, page 45-59. University of Waterloo Press, (1990)Sequential convexification in reverse convex and disjunctive programming., , and . Math. Program., 44 (1-3): 337-350 (1989)The perfectly matchable subgraph polytope of a bipartite graph., and . Networks, 13 (4): 495-516 (1983)On the cycle polytope of a directed graph and its relaxations., and . Networks, 54 (1): 47-55 (2009)Nonlinear 0-1 programming: I. Linearization techniques., and . Math. Program., 30 (1): 1-21 (1984)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 modified lift-and-project procedure.. Math. Program., (1997)