Egon Balas
According to our database^{1},
Egon Balas
authored at least 100 papers
between 1966 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at zbmath.org

at id.loc.gov

at dnb.info

at isni.org
On csauthors.net:
Bibliography
2018
When LiftandProject Cuts are Different.
CoRR, 2018
2016
On the relationship between standard intersection cuts, liftandproject cuts, and generalized intersection cuts.
Math. Program., 2016
2015
Intersection cuts  standard versus restricted.
Discrete Optimization, 2015
2013
Generalized intersection cuts and a new cut generating paradigm.
Math. Program., 2013
Combining LiftandProject and ReduceandSplit.
INFORMS Journal on Computing, 2013
Intersection cuts from multiple rows: a disjunctive programming approach.
EURO J. Computational Optimization, 2013
2012
A hard integer program made easy by lexicography.
Math. Program., 2012
Monoidal cut strengthening revisited.
Discrete Optimization, 2012
Intersection cuts from multiple rows: a disjunctive programming approach
CoRR, 2012
2011
Lexicography and degeneracy: can a pure cutting plane algorithm work?
Math. Program., 2011
Projecting systems of linear inequalities with binary variables.
Annals OR, 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 19582008, 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 liftandproject 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. Scheduling, 2008
Optimizing over the split closure.
Math. Program., 2008
A Special Issue in Memory of George B. Dantzig.
Discrete Optimization, 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.
Annals OR, 2007
New Variants of LiftandProject 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.
ITOR, 2006
New facets of the STS polytope generated from known facets of the ATS polytope.
Discrete Optimization, 2006
On the Cycle Polytope of a Directed Graph and Its Relaxations.
Proceedings of the Operations Research, 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.
Annals OR, 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.
Discrete Optimization, 2004
2003
A precise correspondence between liftandproject cuts, simple disjunctive cuts, and mixed integer gomory cuts for 01 programming.
Math. Program., 2003
2002
"Some thoughts on the development of integer programming during my research careerlecture delivered upon receiving the EURO Gold Medal, July 9, 2001, Rotterdam": [European Journal of Operational Research 141 (1) (2002) 17].
European Journal of Operational Research, 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, 2002
Liftandproject for Mixed 01 programming: recent progress.
Discrete Applied Mathematics, 2002
2001
Octane: A New Heuristic for Pure 01 Programs.
Operations Research, 2001
Linear Time DynamicProgramming Algorithms for New Classes of Restricted TSPs: A Computational Study.
INFORMS Journal on Computing, 2001
Generating Cuts from MultipleTerm 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 CrossoverBased Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems.
J. Heuristics, 1998
On the Dimension of Projected Polyhedra.
Discrete Applied Mathematics, 1998
Disjunctive Programming: Properties of the Convex Hull of Feasible Points.
Discrete Applied Mathematics, 1998
Projection with a Minimal System of Inequalities.
Comp. Opt. and Appl., 1998
1997
On the monotonization of polyhedra.
Math. Program., 1997
A modified liftandproject procedure.
Math. Program., 1997
1996
Gomory cuts revisited.
Oper. Res. Lett., 1996
A Dynamic SubgradientBased BranchandBound Procedure for Set Covering.
Operations Research, 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 precedenceconstrained 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 liftandproject cutting plane algorithm for mixed 01 programs.
Math. Program., 1993
LinearTime Separation Algorithms for the ThreeIndex Assignment Polytope.
Discrete Applied Mathematics, 1993
Solving Mixed 01 Programs by a LiftandProject Method.
Proceedings of the Fourth Annual ACM/SIGACTSIAM Symposium on Discrete Algorithms, 1993
On the monotonization of polyhedra.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 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 FixedOutdegree 1Arborescence 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 ThreeIndex Assignment Problem.
Operations Research, 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. Discrete Math., 1989
On graphs with polynomially solvable maximumweight 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 threeindex assignment polytope.
Discrete Applied Mathematics, 1989
The perfectly matchable subgraph polytope of an arbitrary graph.
Combinatorica, 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 edgemaximal subgraph with a TRformative coloring.
Discrete Applied Mathematics, 1986
1984
Nonlinear 01 programming: II. Dominance relations and algorithms.
Math. Program., 1984
Nonlinear 01 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 ZeroOne Knapsack Problems.
Operations Research, 1980
1977
Graph substitution and set packing polytopes.
Networks, 1977
Critical Cutsets of Graphs and Canonical Facets of SetPacking Polytopes.
Math. Oper. Res., 1977
1975
Facets of the knapsack polytope.
Math. Program., 1975
On the SetCovering Problem: II. An Algorithm for Set Partitioning.
Operations Research, 1975
1973
Technical Note  A Note on the Group Theoretic Approach to Integer Programming and the 01 Case.
Operations Research, 1973
1972
Integer programming and convex analysis: Intersection cuts from outer polars.
Math. Program., 1972
On the SetCovering Problem.
Operations Research, 1972
Ranking the facets of the octahedron.
Discrete Mathematics, 1972
1971
An Intersection Cut from the Dual of the Unit Hypercube.
Operations Research, 1971
Intersection Cuts  A New Type of Cutting Planes for Integer Programming.
Operations Research, 1971
1969
Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm.
Operations Research, 1969
1968
Errata.
Operations Research, 1968
Letter to the Editor  A Note on the BranchandBound Principle.
Operations Research, 1968
1967
Discrete Programming by the Filter Method.
Operations Research, 1967
1966
Letter to the Editor  Comments on the Preceding Note.
Operations Research, 1966
An InfeasibilityPricing Decomposition Method for Linear Programs.
Operations Research, 1966