( en | de | ru )

 

Disambiguation of "Balas, Egon"

Author of the publication

copydeleteadd this publication to your clipboard
On the cycle polytope of a directed graph and its relaxations.

, and . Networks, 54 (1): 47-55 (2009)

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

Eduard Balasch

Vahan Balassanian

 

Other publications of authors with the same name

Finding large cliques in arbitrary graphs by bipartite matching., and . Cliques, Coloring, and Satisfiability, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 29-51. DIMACS/AMS, (1993)Pivot and shift - a mixed integer programming heuristic., , and . Discret. Optim., 1 (1): 3-12 (2004)On the Dimension of Projected Polyhedra., and . Discret. Appl. Math., 87 (1-3): 1-9 (1998)Ranking the facets of the octahedron.. Discret. Math., 2 (1): 1-15 (1972)On the Cycle Polytope of a Directed Graph and Its Relaxations., and . OR, page 203-208. (2006)Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems., and . IPCO, volume 1084 of Lecture Notes in Computer Science, page 316-329. Springer, (1996)Octane: A New Heuristic for Pure 0-1 Programs., , , , and . Oper. Res., 49 (2): 207-225 (2001)On the cycle polytope of a directed graph., and . Networks, 36 (1): 34-46 (2000)Solving Mixed 0-1 Programs by a Lift-and-Project Method., , and . SODA, page 232-242. ACM/SIAM, (1993)Intersection cuts from multiple rows: a disjunctive programming approach, and . CoRR, (2012)