Egon Balas

According to our database, Egon Balas authored at least 101 papers between 1966 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Monoidal Strengthening of Simple <i>V</i>-Polyhedral Disjunctive Cuts.

Aleksandr M. Kazachkov, Egon Balas

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2020

Partial hyperplane activation for generalized intersection cuts.

Aleksandr M. Kazachkov, Selvaprabu Nadarajah, Egon Balas, François Margot

Math. Program. Comput., 2020

When Lift-and-Project Cuts Are Different.

Egon Balas, Thiago Serra

INFORMS J. Comput., 2020

2016

On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts.

Egon Balas, Tamás Kis

Math. Program., 2016

2015

Intersection cuts - standard versus restricted.

Egon Balas, Tamás Kis

Discret. Optim., 2015

2013

Generalized intersection cuts and a new cut generating paradigm.

Egon Balas, François Margot

Math. Program., 2013

Combining Lift-and-Project and Reduce-and-Split.

Egon Balas, Gérard Cornuéjols, Tamás Kis, Giacomo Nannicini

INFORMS J. Comput., 2013

Intersection cuts from multiple rows: a disjunctive programming approach.

Egon Balas, Andrea Qualizza

EURO J. Comput. Optim., 2013

2012

A hard integer program made easy by lexicography.

Egon Balas, Matteo Fischetti, Arrigo Zanette

Math. Program., 2012

Monoidal cut strengthening revisited.

Egon Balas, Andrea Qualizza

Discret. Optim., 2012

2011

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

Arrigo Zanette, Matteo Fischetti, Egon Balas

Math. Program., 2011

Projecting systems of linear inequalities with binary variables.

Egon Balas

Ann. Oper. Res., 2011

2010

On the enumerative nature of Gomory's dual cutting plane method.

Egon Balas, Matteo Fischetti, Arrigo Zanette

Math. Program., 2010

Disjunctive Programming.

Egon Balas

Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009

Integer Programming.

Egon Balas

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

On the cycle polytope of a directed graph and its relaxations.

Egon Balas, Rüdiger Stephan

Networks, 2009

Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants.

Egon Balas, Pierre Bonami

Math. Program. Comput., 2009

2008

Job shop scheduling with setup times, deadlines and precedence constraints.

Egon Balas, Neil Simonetti, Alkis Vazacopoulos

J. Sched., 2008

Optimizing over the split closure.

Egon Balas, Anureet Saxena

Math. Program., 2008

A Special Issue in Memory of George B. Dantzig.

Egon Balas, Alan J. Hoffman, S. Thomas McCormick

Discret. Optim., 2008

Can Pure Cutting Plane Algorithms Work?.

Arrigo Zanette, Matteo Fischetti, Egon Balas

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007

Some thoughts on the development of integer programming during my research career.

Egon Balas

Ann. Oper. Res., 2007

New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing.

Egon Balas, Pierre Bonami

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

IFORS' Operational Research Hall of Fame.

Egon Balas

Int. Trans. Oper. Res., 2006

New facets of the STS polytope generated from known facets of the ATS polytope.

Egon Balas, Robert D. Carr, Matteo Fischetti, Neil Simonetti

Discret. Optim., 2006

2005

The vertex separator problem: algorithms and computations.

Cid C. de Souza, Egon Balas

Math. Program., 2005

The vertex separator problem: a polyhedral investigation.

Egon Balas, Cid C. de Souza

Math. Program., 2005

Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization.

Egon Balas

Ann. Oper. Res., 2005

2004

On unions and dominants of polytopes.

Egon Balas, Alexander Bockmayr, Nicolai Pisaruk, Laurence A. Wolsey

Math. Program., 2004

Logical Constraints as Cardinality Rules: Tight Representation.

Egon Balas

J. Comb. Optim., 2004

Pivot and shift - a mixed integer programming heuristic.

Egon Balas, Stefan Schmieta, Christopher Wallace

Discret. Optim., 2004

2003

A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming.

Egon Balas, Michael Perregaard

Math. Program., 2003

2002

"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].

Egon Balas

Eur. J. Oper. Res., 2002

Some thoughts on the development of integer programming during my research career - lecture delivered upon receiving the EURO Gold Medal, July 9, 2001, Rotterdam.

Egon Balas

Eur. J. Oper. Res., 2002

Lift-and-project for Mixed 0-1 programming: recent progress.

Egon Balas, Michael Perregaard

Discret. Appl. Math., 2002

2001

Octane: A New Heuristic for Pure 0-1 Programs.

Egon Balas, Sebastián Ceria, Milind Dawande, François Margot, Gábor Pataki

Oper. Res., 2001

Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study.

Egon Balas, Neil Simonetti

INFORMS J. Comput., 2001

Generating Cuts from Multiple-Term Disjunctions.

Michael Perregaard, Egon Balas

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

Projection and Lifting in Combinatorial Optimization.

Egon Balas

Proceedings of the Computational Combinatorial Optimization, 2001

2000

On the cycle polytope of a directed graph.

Egon Balas, Maarten Oosten

Networks, 2000

1999

Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem.

Egon Balas, Matteo Fischetti

Math. Oper. Res., 1999

New classes of efficiently solvable generalized Traveling Salesman Problems.

Egon Balas

Ann. Oper. Res., 1999

1998

Job Shop Scheduling With Deadlines.

Egon Balas, Giuseppe Lancia, Paolo Serafini, Alkiviadis Vazacopoulos

J. Comb. Optim., 1998

Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems.

Egon Balas, William Niehaus

J. Heuristics, 1998

On the Dimension of Projected Polyhedra.

Egon Balas, Maarten Oosten

Discret. Appl. Math., 1998

Disjunctive Programming: Properties of the Convex Hull of Feasible Points.

Egon Balas

Discret. Appl. Math., 1998

Projection with a Minimal System of Inequalities.

Egon Balas

Comput. Optim. Appl., 1998

1997

On the monotonization of polyhedra.

Egon Balas, Matteo Fischetti

Math. Program., 1997

A modified lift-and-project procedure.

Egon Balas

Math. Program., 1997

1996

Gomory cuts revisited.

Egon Balas, Sebastián Ceria, Gérard Cornuéjols, N. Natraj

Oper. Res. Lett., 1996

A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering.

Egon Balas, Maria C. Carrera

Oper. Res., 1996

Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring.

Egon Balas, Jue Xue

Algorithmica, 1996

Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems.

Neil Simonetti, Egon Balas

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995

The prize collecting traveling salesman problem: II. Polyhedral results.

Egon Balas

Networks, 1995

The precedence-constrained asymmetric traveling salesman polytope.

Egon Balas, Matteo Fischetti, William R. Pulleyblank

Math. Program., 1995

1993

A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets.

Egon Balas, Matteo Fischetti

Math. Program., 1993

A lift-and-project cutting plane algorithm for mixed 0-1 programs.

Egon Balas, Sebastián Ceria, Gérard Cornuéjols

Math. Program., 1993

Linear-Time Separation Algorithms for the Three-Index Assignment Polytope.

Egon Balas, Liqun Qi

Discret. Appl. Math., 1993

Solving Mixed 0-1 Programs by a Lift-and-Project Method.

Egon Balas, Sebastián Ceria, Gérard Cornuéjols

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Polyhedral methods for the maximum clique problem.

Egon Balas, Sebastián Ceria, Gérard Cornuéjols, Gábor Pataki

Proceedings of the Cliques, 1993

Finding large cliques in arbitrary graphs by bipartite matching.

Egon Balas, William Niehaus

Proceedings of the Cliques, 1993

1992

Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs.

Egon Balas, Jue Xue

SIAM J. Comput., 1992

The Fixed-Outdegree 1-Arborescence Polytope.

Egon Balas, Matteo Fischetti

Math. Oper. Res., 1992

1991

Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs.

Egon Balas, Jue Xue

SIAM J. Comput., 1991

A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem.

Egon Balas, Donald L. Miller, Joseph F. Pekny, Paolo Toth

J. ACM, 1991

An Algorithm for the Three-Index Assignment Problem.

Egon Balas, Matthew J. Saltzman

Oper. Res., 1991

1990

Finding Out Whether a Valid Inequality is Facet Defining.

Egon Balas

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989

The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph.

Egon Balas

SIAM J. Discret. Math., 1989

On graphs with polynomially solvable maximum-weight clique problem.

Egon Balas, Chang Sung Yu

Networks, 1989

The prize collecting traveling salesman problem.

Egon Balas

Networks, 1989

Sequential convexification in reverse convex and disjunctive programming.

Egon Balas, Joseph M. Tama, Jørgen Tind

Math. Program., 1989

On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}.

Egon Balas, Shu Ming Ng

Math. Program., 1989

On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}.

Egon Balas, Shu Ming Ng

Math. Program., 1989

Facets of the three-index assignment polytope.

Egon Balas, Matthew J. Saltzman

Discret. Appl. Math., 1989

The perfectly matchable subgraph polytope of an arbitrary graph.

Egon Balas, William R. Pulleyblank

Comb., 1989

1987

On the Maximum Weight Clique Problem.

Egon Balas, Vasek Chvátal, Jaroslav Nesetril

Math. Oper. Res., 1987

1986

Finding a Maximum Clique in an Arbitrary Graph.

Egon Balas, Chang Sung Yu

SIAM J. Comput., 1986

A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring.

Egon Balas

Discret. Appl. Math., 1986

1984

Nonlinear 0-1 programming: II. Dominance relations and algorithms.

Egon Balas, Joseph B. Mazzola

Math. Program., 1984

Nonlinear 0-1 programming: I. Linearization techniques.

Egon Balas, Joseph B. Mazzola

Math. Program., 1984

A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers.

Egon Balas

Math. Oper. Res., 1984

1983

The perfectly matchable subgraph polytope of a bipartite graph.

Egon Balas, William R. Pulleyblank

Networks, 1983

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.

Egon Balas

Discret. Appl. Math., 1983

1981

A restricted Lagrangean approach to the traveling salesman problem.

Egon Balas, Nicos Christofides

Math. Program., 1981

1980

An Algorithm for Large Zero-One Knapsack Problems.

Egon Balas, Eitan Zemel

Oper. Res., 1980

1977

Graph substitution and set packing polytopes.

Egon Balas, Eitan Zemel

Networks, 1977

Critical Cutsets of Graphs and Canonical Facets of Set-Packing Polytopes.

Egon Balas, Eitan Zemel

Math. Oper. Res., 1977

1975

Facets of the knapsack polytope.

Egon Balas

Math. Program., 1975

On the Set-Covering Problem: II. An Algorithm for Set Partitioning.

Egon Balas, Manfred Padberg

Oper. Res., 1975

1973

Technical Note - A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case.

Egon Balas

Oper. Res., 1973

1972

Integer programming and convex analysis: Intersection cuts from outer polars.

Egon Balas

Math. Program., 1972

On the Set-Covering Problem.

Egon Balas, Manfred W. Padberg

Oper. Res., 1972

Ranking the facets of the octahedron.

Egon Balas

Discret. Math., 1972

1971

An Intersection Cut from the Dual of the Unit Hypercube.

Egon Balas, V. Joseph Bowman, Fred W. Glover, David Sommer

Oper. Res., 1971

Intersection Cuts - A New Type of Cutting Planes for Integer Programming.

Egon Balas

Oper. Res., 1971

1969

Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm.

Egon Balas

Oper. Res., 1969

1968

Errata.

Egon Balas

Oper. Res., 1968

Letter to the Editor - A Note on the Branch-and-Bound Principle.

Egon Balas

Oper. Res., 1968

1967

Discrete Programming by the Filter Method.

Egon Balas

Oper. Res., 1967

1966

Letter to the Editor - Comments on the Preceding Note.

Egon Balas

Oper. Res., 1966

An Infeasibility-Pricing Decomposition Method for Linear Programs.

Egon Balas

Oper. Res., 1966