Egon Balas

According to our database1, Egon Balas authored at least 98 papers between 1966 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Partial hyperplane activation for generalized intersection cuts.
Math. Program. Comput., 2020

When Lift-and-Project Cuts Are Different.
INFORMS J. Comput., 2020

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

2015
Intersection cuts - standard versus restricted.
Discret. Optim., 2015

2013
Generalized intersection cuts and a new cut generating paradigm.
Math. Program., 2013

Combining Lift-and-Project and Reduce-and-Split.
INFORMS J. Comput., 2013

Intersection cuts from multiple rows: a disjunctive programming approach.
EURO J. Comput. Optim., 2013

2012
A hard integer program made easy by lexicography.
Math. Program., 2012

Monoidal cut strengthening revisited.
Discret. Optim., 2012

2011
Lexicography and degeneracy: can a pure cutting plane algorithm work?
Math. Program., 2011

Projecting systems of linear inequalities with binary variables.
Ann. Oper. Res., 2011

2010
On the enumerative nature of Gomory's dual cutting plane method.
Math. Program., 2010

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

2009
Integer Programming.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

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

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

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

Optimizing over the split closure.
Math. Program., 2008

A Special Issue in Memory of George B. Dantzig.
Discret. Optim., 2008

Can Pure Cutting Plane Algorithms Work?.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007
Some thoughts on the development of integer programming during my research career.
Ann. Oper. Res., 2007

New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006
IFORS' Operational Research Hall of Fame.
Int. Trans. Oper. Res., 2006

New facets of the STS polytope generated from known facets of the ATS polytope.
Discret. Optim., 2006

2005
The vertex separator problem: algorithms and computations.
Math. Program., 2005

The vertex separator problem: a polyhedral investigation.
Math. Program., 2005

Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization.
Ann. Oper. Res., 2005

2004
On unions and dominants of polytopes.
Math. Program., 2004

Logical Constraints as Cardinality Rules: Tight Representation.
J. Comb. Optim., 2004

Pivot and shift - a mixed integer programming heuristic.
Discret. Optim., 2004

2003
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming.
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].
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.
Eur. J. Oper. Res., 2002

Lift-and-project for Mixed 0-1 programming: recent progress.
Discret. Appl. Math., 2002

2001
Octane: A New Heuristic for Pure 0-1 Programs.
Oper. Res., 2001

Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study.
INFORMS J. Comput., 2001

Generating Cuts from Multiple-Term Disjunctions.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001

Projection and Lifting in Combinatorial Optimization.
Proceedings of the Computational Combinatorial Optimization, 2001

2000
On the cycle polytope of a directed graph.
Networks, 2000

1999
Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem.
Math. Oper. Res., 1999

1998
Job Shop Scheduling With Deadlines.
J. Comb. Optim., 1998

Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems.
J. Heuristics, 1998

On the Dimension of Projected Polyhedra.
Discret. Appl. Math., 1998

Disjunctive Programming: Properties of the Convex Hull of Feasible Points.
Discret. Appl. Math., 1998

Projection with a Minimal System of Inequalities.
Comput. Optim. Appl., 1998

1997
On the monotonization of polyhedra.
Math. Program., 1997

A modified lift-and-project procedure.
Math. Program., 1997

1996
Gomory cuts revisited.
Oper. Res. Lett., 1996

A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering.
Oper. Res., 1996

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

Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995
The prize collecting traveling salesman problem: II. Polyhedral results.
Networks, 1995

The precedence-constrained asymmetric traveling salesman polytope.
Math. Program., 1995

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

A lift-and-project cutting plane algorithm for mixed 0-1 programs.
Math. Program., 1993

Linear-Time Separation Algorithms for the Three-Index Assignment Polytope.
Discret. Appl. Math., 1993

Solving Mixed 0-1 Programs by a Lift-and-Project Method.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Polyhedral methods for the maximum clique problem.
Proceedings of the Cliques, 1993

Finding large cliques in arbitrary graphs by bipartite matching.
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.
SIAM J. Comput., 1992

The Fixed-Outdegree 1-Arborescence Polytope.
Math. Oper. Res., 1992

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

A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem.
J. ACM, 1991

An Algorithm for the Three-Index Assignment Problem.
Oper. Res., 1991

1990
Finding Out Whether a Valid Inequality is Facet Defining.
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.
SIAM J. Discret. Math., 1989

On graphs with polynomially solvable maximum-weight clique problem.
Networks, 1989

The prize collecting traveling salesman problem.
Networks, 1989

Sequential convexification in reverse convex and disjunctive programming.
Math. Program., 1989

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

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

Facets of the three-index assignment polytope.
Discret. Appl. Math., 1989

The perfectly matchable subgraph polytope of an arbitrary graph.
Comb., 1989

1987
On the Maximum Weight Clique Problem.
Math. Oper. Res., 1987

1986
Finding a Maximum Clique in an Arbitrary Graph.
SIAM J. Comput., 1986

A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring.
Discret. Appl. Math., 1986

1984
Nonlinear 0-1 programming: II. Dominance relations and algorithms.
Math. Program., 1984

Nonlinear 0-1 programming: I. Linearization techniques.
Math. Program., 1984

A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers.
Math. Oper. Res., 1984

1983
The perfectly matchable subgraph polytope of a bipartite graph.
Networks, 1983

1981
A restricted Lagrangean approach to the traveling salesman problem.
Math. Program., 1981

1980
An Algorithm for Large Zero-One Knapsack Problems.
Oper. Res., 1980

1977
Graph substitution and set packing polytopes.
Networks, 1977

Critical Cutsets of Graphs and Canonical Facets of Set-Packing Polytopes.
Math. Oper. Res., 1977

1975
Facets of the knapsack polytope.
Math. Program., 1975

On the Set-Covering Problem: II. An Algorithm for Set Partitioning.
Oper. Res., 1975

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

1972
Integer programming and convex analysis: Intersection cuts from outer polars.
Math. Program., 1972

On the Set-Covering Problem.
Oper. Res., 1972

Ranking the facets of the octahedron.
Discret. Math., 1972

1971
An Intersection Cut from the Dual of the Unit Hypercube.
Oper. Res., 1971

Intersection Cuts - A New Type of Cutting Planes for Integer Programming.
Oper. Res., 1971

1969
Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm.
Oper. Res., 1969

1968
Errata.
Oper. Res., 1968

Letter to the Editor - A Note on the Branch-and-Bound Principle.
Oper. Res., 1968

1967
Discrete Programming by the Filter Method.
Oper. Res., 1967

1966
Letter to the Editor - Comments on the Preceding Note.
Oper. Res., 1966

An Infeasibility-Pricing Decomposition Method for Linear Programs.
Oper. Res., 1966


  Loading...