( en | de | ru )

 

Disambiguation of "Balas, Egon"

Author of the publication

copydeleteadd this publication to your clipboard
Can Pure Cutting Plane Algorithms Work?.

, , and . IPCO, volume 5035 of Lecture Notes in Computer Science, page 416-434. Springer, (2008)

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.

Gnana Prakash Balasubramanian

Kaipa Balasankara Reddy

Krishnakumar Balasubramanian

Vahan Balassanian

Eduard Balasch

 

Other publications of authors with the same name

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