Egon Balas

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