Egon Balas

Publication Activity (10 Years)

Years Active: 1966-2023
Publications (10 Years): 5

Top Venues

Math. Program.

INFORMS J. Comput.

IPCO

Discret. Optim.

Publications

Aleksandr M. Kazachkov, Egon Balas
-Polyhedral Disjunctive Cuts. IPCO (2023)
Egon Balas, Thiago Serra
When Lift-and-Project Cuts Are Different. INFORMS J. Comput. 32 (3) (2020)
Aleksandr M. Kazachkov, Selvaprabu Nadarajah, Egon Balas, François Margot
Partial hyperplane activation for generalized intersection cuts. Math. Program. Comput. 12 (1) (2020)
Egon Balas, Thiago Serra
When Lift-and-Project Cuts are Different. CoRR (2018)
Egon Balas, Tamás Kis
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts. Math. Program. 160 (1-2) (2016)
Egon Balas, Tamás Kis
Intersection cuts - standard versus restricted. Discret. Optim. 18 (2015)
Egon Balas, Andrea Qualizza
Intersection cuts from multiple rows: a disjunctive programming approach. EURO J. Comput. Optim. 1 (1-2) (2013)
Egon Balas, François Margot
Generalized intersection cuts and a new cut generating paradigm. Math. Program. 137 (1-2) (2013)
Egon Balas, Gérard Cornuéjols, Tamás Kis, Giacomo Nannicini
Combining Lift-and-Project and Reduce-and-Split. INFORMS J. Comput. 25 (3) (2013)
Egon Balas, Matteo Fischetti, Arrigo Zanette
A hard integer program made easy by lexicography. Math. Program. 135 (1-2) (2012)
Egon Balas, Andrea Qualizza
Intersection cuts from multiple rows: a disjunctive programming approach CoRR (2012)
Egon Balas, Andrea Qualizza
Monoidal cut strengthening revisited. Discret. Optim. 9 (1) (2012)
Arrigo Zanette, Matteo Fischetti, Egon Balas
Lexicography and degeneracy: can a pure cutting plane algorithm work? Math. Program. 130 (1) (2011)
Egon Balas
Projecting systems of linear inequalities with binary variables. Ann. Oper. Res. 188 (1) (2011)
Egon Balas, Matteo Fischetti, Arrigo Zanette
On the enumerative nature of Gomory's dual cutting plane method. Math. Program. 125 (2) (2010)
Egon Balas, Pierre Bonami
Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants. Math. Program. Comput. 1 (2-3) (2009)
Egon Balas, Rüdiger Stephan
On the cycle polytope of a directed graph and its relaxations. Networks 54 (1) (2009)
Arrigo Zanette, Matteo Fischetti, Egon Balas
Can Pure Cutting Plane Algorithms Work?. IPCO (2008)
Egon Balas, Anureet Saxena
Optimizing over the split closure. Math. Program. 113 (2) (2008)
Egon Balas, Alan J. Hoffman, S. Thomas McCormick
A Special Issue in Memory of George B. Dantzig. Discret. Optim. 5 (2) (2008)
Egon Balas, Neil Simonetti, Alkis Vazacopoulos
Job shop scheduling with setup times, deadlines and precedence constraints. J. Sched. 11 (4) (2008)
Egon Balas
Some thoughts on the development of integer programming during my research career. Ann. Oper. Res. 149 (1) (2007)
Egon Balas, Pierre Bonami
New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing. IPCO (2007)
Egon Balas, Robert D. Carr, Matteo Fischetti, Neil Simonetti
New facets of the STS polytope generated from known facets of the ATS polytope. Discret. Optim. 3 (1) (2006)
Egon Balas
IFORS' Operational Research Hall of Fame. Int. Trans. Oper. Res. 13 (2) (2006)
Egon Balas, Rüdiger Stephan
On the Cycle Polytope of a Directed Graph and Its Relaxations. OR (2006)
Cid C. de Souza, Egon Balas
The vertex separator problem: algorithms and computations. Math. Program. 103 (3) (2005)
Egon Balas, Cid C. de Souza
The vertex separator problem: a polyhedral investigation. Math. Program. 103 (3) (2005)
Egon Balas
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization. Ann. Oper. Res. 140 (1) (2005)
Egon Balas
Logical Constraints as Cardinality Rules: Tight Representation. J. Comb. Optim. 8 (2) (2004)
Egon Balas, Alexander Bockmayr, Nicolai Pisaruk, Laurence A. Wolsey
On unions and dominants of polytopes. Math. Program. 99 (2) (2004)
Egon Balas, Stefan Schmieta, Christopher Wallace
Pivot and shift - a mixed integer programming heuristic. Discret. Optim. 1 (1) (2004)
Egon Balas, Michael Perregaard
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming. Math. Program. 94 (2-3) (2003)
Egon Balas
Some thoughts on the development of integer programming during my research career - lecture delivered upon receiving the EURO Gold Medal, July 9, 2001, Rotterdam. Eur. J. Oper. Res. 141 (1) (2002)
Egon Balas
"Some thoughts on the development of integer programming during my research career--lecture delivered upon receiving the EURO Gold Medal, July 9, 2001, Rotterdam": [European Journal of Operational Research 141 (1) (2002) 1-7]. Eur. J. Oper. Res. 143 (3) (2002)
Egon Balas, Michael Perregaard
Lift-and-project for Mixed 0-1 programming: recent progress. Discret. Appl. Math. 123 (1-3) (2002)
Michael Perregaard, Egon Balas
Generating Cuts from Multiple-Term Disjunctions. IPCO (2001)
Egon Balas
Projection and Lifting in Combinatorial Optimization. Computational Combinatorial Optimization (2001)
Egon Balas, Neil Simonetti
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study. INFORMS J. Comput. 13 (1) (2001)
Egon Balas, Sebastián Ceria, Milind Dawande, François Margot, Gábor Pataki
Octane: A New Heuristic for Pure 0-1 Programs. Oper. Res. 49 (2) (2001)
Egon Balas, Maarten Oosten
On the cycle polytope of a directed graph. Networks 36 (1) (2000)
Egon Balas, Matteo Fischetti
Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem. Math. Oper. Res. 24 (2) (1999)
Egon Balas, Maarten Oosten
On the Dimension of Projected Polyhedra. Discret. Appl. Math. 87 (1-3) (1998)
Egon Balas, William Niehaus
Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems. J. Heuristics 4 (2) (1998)
Egon Balas, Giuseppe Lancia, Paolo Serafini, Alkiviadis Vazacopoulos
Job Shop Scheduling With Deadlines. J. Comb. Optim. 1 (4) (1998)
Egon Balas
Projection with a Minimal System of Inequalities. Comput. Optim. Appl. 10 (2) (1998)
Egon Balas
Disjunctive Programming: Properties of the Convex Hull of Feasible Points. Discret. Appl. Math. 89 (1-3) (1998)
Egon Balas
A modified lift-and-project procedure. Math. Program. 79 (1997)
Egon Balas, Matteo Fischetti
On the monotonization of polyhedra. Math. Program. 77 (1997)
Egon Balas, Jue Xue
Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring. Algorithmica 15 (5) (1996)
Egon Balas, Sebastián Ceria, Gérard Cornuéjols, N. Natraj
Gomory cuts revisited. Oper. Res. Lett. 19 (1) (1996)
Egon Balas, Maria C. Carrera
A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering. Oper. Res. 44 (6) (1996)
Neil Simonetti, Egon Balas
Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems. IPCO (1996)
Egon Balas
The prize collecting traveling salesman problem: II. Polyhedral results. Networks 25 (4) (1995)
Egon Balas, Matteo Fischetti, William R. Pulleyblank
The precedence-constrained asymmetric traveling salesman polytope. Math. Program. 68 (1995)
Egon Balas, Sebastián Ceria, Gérard Cornuéjols
A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58 (1993)
Egon Balas, Matteo Fischetti
On the monotonization of polyhedra. IPCO (1993)
Egon Balas, Sebastián Ceria, Gérard Cornuéjols
Solving Mixed 0-1 Programs by a Lift-and-Project Method. SODA (1993)
Egon Balas, Liqun Qi
Linear-Time Separation Algorithms for the Three-Index Assignment Polytope. Discret. Appl. Math. 43 (1) (1993)
Egon Balas, Sebastián Ceria, Gérard Cornuéjols, Gábor Pataki
Polyhedral methods for the maximum clique problem. Cliques, Coloring, and Satisfiability (1993)
Egon Balas, Matteo Fischetti
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets. Math. Program. 58 (1993)
Egon Balas, William Niehaus
Finding large cliques in arbitrary graphs by bipartite matching. Cliques, Coloring, and Satisfiability (1993)
Egon Balas, Matteo Fischetti
The Fixed-Outdegree 1-Arborescence Polytope. Math. Oper. Res. 17 (4) (1992)
Egon Balas, Jue Xue
Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs. SIAM J. Comput. 21 (5) (1992)
Egon Balas, Matthew J. Saltzman
An Algorithm for the Three-Index Assignment Problem. Oper. Res. 39 (1) (1991)
Egon Balas, Jue Xue
Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs. SIAM J. Comput. 20 (2) (1991)
Egon Balas, Donald L. Miller, Joseph F. Pekny, Paolo Toth
A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem. J. ACM 38 (4) (1991)
Egon Balas
Finding Out Whether a Valid Inequality is Facet Defining. IPCO (1990)
Egon Balas, William R. Pulleyblank
The perfectly matchable subgraph polytope of an arbitrary graph. Comb. 9 (4) (1989)
Egon Balas, Shu Ming Ng
On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}. Math. Program. 43 (1-3) (1989)
Egon Balas
The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph. SIAM J. Discret. Math. 2 (4) (1989)
Egon Balas, Shu Ming Ng
On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}. Math. Program. 45 (1-3) (1989)
Egon Balas, Joseph M. Tama, Jørgen Tind
Sequential convexification in reverse convex and disjunctive programming. Math. Program. 44 (1-3) (1989)
Egon Balas, Matthew J. Saltzman
Facets of the three-index assignment polytope. Discret. Appl. Math. 23 (3) (1989)
Egon Balas
The prize collecting traveling salesman problem. Networks 19 (6) (1989)
Egon Balas, Chang Sung Yu
On graphs with polynomially solvable maximum-weight clique problem. Networks 19 (2) (1989)
Egon Balas, Vasek Chvátal, Jaroslav Nesetril
On the Maximum Weight Clique Problem. Math. Oper. Res. 12 (3) (1987)
Egon Balas, Chang Sung Yu
Finding a Maximum Clique in an Arbitrary Graph. SIAM J. Comput. 15 (4) (1986)
Egon Balas
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring. Discret. Appl. Math. 15 (2-3) (1986)
Egon Balas
A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers. Math. Oper. Res. 9 (1) (1984)
Egon Balas, Joseph B. Mazzola
Nonlinear 0-1 programming: II. Dominance relations and algorithms. Math. Program. 30 (1) (1984)
Egon Balas, Joseph B. Mazzola
Nonlinear 0-1 programming: I. Linearization techniques. Math. Program. 30 (1) (1984)
Egon Balas, William R. Pulleyblank
The perfectly matchable subgraph polytope of a bipartite graph. Networks 13 (4) (1983)
Egon Balas, Nicos Christofides
A restricted Lagrangean approach to the traveling salesman problem. Math. Program. 21 (1) (1981)
Egon Balas, Eitan Zemel
An Algorithm for Large Zero-One Knapsack Problems. Oper. Res. 28 (5) (1980)
Egon Balas, Eitan Zemel
Graph substitution and set packing polytopes. Networks 7 (3) (1977)
Egon Balas, Eitan Zemel
Critical Cutsets of Graphs and Canonical Facets of Set-Packing Polytopes. Math. Oper. Res. 2 (1) (1977)
Egon Balas, Manfred Padberg
On the Set-Covering Problem: II. An Algorithm for Set Partitioning. Oper. Res. 23 (1) (1975)
Egon Balas
Facets of the knapsack polytope. Math. Program. 8 (1) (1975)
Egon Balas
Technical Note - A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case. Oper. Res. 21 (1) (1973)
Egon Balas, Manfred W. Padberg
On the Set-Covering Problem. Oper. Res. 20 (6) (1972)
Egon Balas
Ranking the facets of the octahedron. Discret. Math. 2 (1) (1972)
Egon Balas
Integer programming and convex analysis: Intersection cuts from outer polars. Math. Program. 2 (1) (1972)
Egon Balas, V. Joseph Bowman, Fred W. Glover, David Sommer
An Intersection Cut from the Dual of the Unit Hypercube. Oper. Res. 19 (1) (1971)
Egon Balas
Intersection Cuts - A New Type of Cutting Planes for Integer Programming. Oper. Res. 19 (1) (1971)
Egon Balas
Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm. Oper. Res. 17 (6) (1969)
Egon Balas
Letter to the Editor - A Note on the Branch-and-Bound Principle. Oper. Res. 16 (2) (1968)
Egon Balas
Errata. Oper. Res. 16 (4) (1968)
Egon Balas
Discrete Programming by the Filter Method. Oper. Res. 15 (5) (1967)
Egon Balas
Letter to the Editor - Comments on the Preceding Note. Oper. Res. 14 (5) (1966)

Egon Balas.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Egon Balas