Egon Balas

Q: What Schools Are Affiliated With Egon Balas

Egon Balas is affiliated with the following schools: Babeș-Bolyai University, Université Paris Cité, Stanford University, Carnegie Mellon University

Egon Balas's AcademicInfluence.com Rankings

Egon Balas

Mathematics

#1362

World Rank

#2261

Historical Rank

Measure Theory

#527

World Rank

#741

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Egon Balas's Degrees

PhD Mathematics Université Paris Cité

Why Is Egon Balas Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Egon Balas was an applied mathematician and a professor of industrial administration and applied mathematics at Carnegie Mellon University. He was the Thomas Lord Professor of Operations Research at Carnegie Mellon's Tepper School of Business and did fundamental work in developing integer and disjunctive programming.

(See a Problem?)

Egon Balas's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The Shifting Bottleneck Procedure for Job Shop Scheduling (1988) (1658)
A lift-and-project cutting plane algorithm for mixed 0–1 programs (1993) (842)
An Additive Algorithm for Solving Linear Programs with Zero-One Variables (1965) (702)
The prize collecting traveling salesman problem (1989) (563)
An Algorithm for Large Zero-One Knapsack Problems (1980) (493)
Set Partitioning: A survey (1976) (467)
Disjunctive Programming: Properties of the Convex Hull of Feasible Points (1998) (452)
Disjunctive programming and a hierarchy of relaxations for discrete optimization problems (1985) (447)
Facets of the knapsack polytope (1975) (423)
Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm (1969) (403)
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling (1998) (388)
Finding a Maximum Clique in an Arbitrary Graph (1986) (351)
Intersection Cuts - A New Type of Cutting Planes for Integer Programming (1971) (344)
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study (1980) (322)
Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework (1996) (286)
Pivot and Complement–A Heuristic for 0-1 Programming (1980) (269)
Gomory cuts revisited (1996) (263)
Canonical Cuts on the Unit Hypercube (1972) (261)
Facets of the Knapsack Polytope From Minimal Covers (1978) (215)
A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering (1992) (212)
On the Set-Covering Problem (1972) (205)
An Algorithm for the Three-Index Assignment Problem (1991) (187)
The precedence-constrained asymmetric traveling salesman polytope (1995) (163)
A restricted Lagrangean approach to the traveling salesman problem (1981) (155)
Discrete Programming by the Filter Method (1967) (153)
The one-machine problem with delayed precedence constraints and its use in job shop scheduling (1995) (141)
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming (2003) (139)
DISJUNCTIVE PROGRAMMING: CUTTING PLANES FROM LOGICAL CONDITIONS (1975) (132)
On graphs with polynomially solvable maximum-weight clique problem (1989) (131)
Strengthening cuts for mixed integer programs (1980) (129)
Optimizing over the split closure (2008) (127)
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study (2000) (123)
Integer Programming (2021) (122)
PROJECT SCHEDULING WITH RESOURCE CONSTRAINTS. (1968) (117)
On the facial structure of scheduling polyhedra (1985) (117)
On the set covering polytope: I. All the facets with coefficients in {0, 1, 2} (1986) (110)
Job shop scheduling with setup times, deadlines and precedence constraints (2008) (108)
Nonlinear 0–1 programming: I. Linearization techniques (1984) (106)
The perfectly matchable subgraph polytope of a bipartite graph (1983) (104)
Lift-and-project for Mixed 0-1 programming: recent progress (2002) (96)
Disjunctive Programming (2010) (96)
On the Set-Covering Problem: II. An Algorithm for Set Partitioning (1972) (85)
Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems (1998) (83)
Octane: A New Heuristic for Pure 0-1 Programs (2001) (83)
Branch and Bound Methods for the Traveling Salesman Problem (1983) (80)
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization (2005) (76)
Pivot and shift - a mixed integer programming heuristic (2004) (72)
MINIMAX AND DUALITY FOR LINEAR AND NONLINEAR MIXED-INTEGER PROGRAMMING (1969) (70)
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (1996) (69)
On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2} (1989) (68)
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets (1993) (68)
New classes of efficiently solvable generalized Traveling Salesman Problems (1999) (68)
The vertex separator problem: a polyhedral investigation (2005) (68)
Polyhedral methods for the maximum clique problem (1994) (65)
Letter to the Editor - A Note on the Branch-and-Bound Principle (1968) (62)
The prize collecting traveling salesman problem: II. Polyhedral results (1995) (62)
Nonlinear 0–1 programming: II. Dominance relations and algorithms (1983) (61)
A parallel shortest augmenting path algorithm for the assignment problem (1991) (61)
Facets of the three-index assignment polytope (1989) (60)
On the Generalized Transportation Problem (1964) (60)
The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph (1987) (58)
Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs (1991) (57)
Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs (1992) (52)
The perfectly Matchable Subgraph Polytope of an arbitrary graph (1989) (50)
Cutting planes from conditional bounds: A new approach to set covering (1980) (49)
On the Maximum Weight Clique Problem (1987) (48)
Integer programming and convex analysis: Intersection cuts from outer polars (1972) (48)
The vertex separator problem: algorithms and computations (2005) (45)
The Strategic Petroleum Reserve: How Large Should it be? (1981) (45)
Lexicography and degeneracy: can a pure cutting plane algorithm work? (2011) (44)
Traffic assignment in communication satellites (1983) (43)
On the Dimension of Projected Polyhedra (1998) (42)
Linear-Time Separation Algorithms for the Three-Index Assignment Polytope (1993) (41)
The Prize Collecting Traveling Salesman Problem and its Applications (2007) (38)
A class of location, distribution and scheduling problems : modeling and solution methods (1982) (37)
One Machine Scheduling With Delayed Precedence Constraints. (1993) (37)
A modified lift-and-project procedure (1997) (37)
Generating Cuts from Multiple-Term Disjunctions (2001) (37)
Job Shop Scheduling With Deadlines (1998) (37)
Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants (2009) (37)
DUALITY IN DISCRETE PROGRAMMING (1967) (37)
Duality in Discrete Programming: II. The Quadratic Case (1969) (36)
On the convex hull of the union of certain polyhedra (1988) (36)
The Dual Method for the Generalized Transportation Problem (1966) (36)
Solution of Large-Scale Transportation Problems Through Aggregation (1965) (34)
An Infeasibility-Pricing Decomposition Method for Linear Programs (1966) (33)
Generalized intersection cuts and a new cut generating paradigm (2013) (33)
A PARALLEL SHORTEST PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM (1989) (32)
Finding large cliques in arbitrary graphs by bipartite matching (1993) (31)
An Intersection Cut from the Dual of the Unit Hypercube (1971) (30)
The Fixed-Outdegree 1-Arborescence Polytope (1992) (29)
Projection and Lifting in Combinatorial Optimization (2000) (28)
On the monotonization of polyhedra (1997) (27)
A note on duality in disjunctive programming (1977) (27)
Integer and Fractional Matchings (1981) (27)
Maximizing a Convex Quadratic Function Subject to Linear Constraints. (1973) (26)
Projection with a Minimal System of Inequalities (1998) (26)
Polyhedral Theory for the Asymmetric Traveling Salesman Problem (2007) (26)
On unions and dominants of polytopes (2004) (25)
Nonconvex Quadratic Programming via Generalized Polars (1975) (24)
Sequential convexification in reverse convex and disjunctive programming (1989) (24)
Solving mixed 0-1programs by a lift-and-project method (1993) (23)
Solving Large Zero-One Knapsack Problems. (1977) (20)
A node covering algorithm (1977) (20)
Machine sequencing: Disjunctive graphs and degree‐constrained subgraphs (1970) (19)
On the cycle polytope of a directed graph and its relaxations (2000) (19)
Intersection Cuts from Disjunctive Constraints. (1974) (19)
A Linear Characterization of Permutation Vectors. (1975) (19)
Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem (1999) (18)
Some Valid Inequalities for the Set Partitioning Problem (1977) (18)
A duality theorem and an algorithm for (mixed-) integer nonlinear programming (1971) (17)
Can Pure Cutting Plane Algorithms Work? (2008) (17)
Ranking the facets of the octahedron (1972) (16)
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring (1986) (16)
THE INTERSECTION CUT - A NEW CUTTING PLANE FOR INTEGER PROGRAMMING. (1969) (15)
New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing (2007) (15)
Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems (1996) (15)
Critical Cutsets of Graphs and Canonical Facets of Set Packing Polytopes (1998) (14)
Critical Cutsets of Graphs and Canonical Facets of Set-Packing Polytopes (1977) (13)
Long- and Short-Term Interest Rates in a Risky World (2015) (13)
A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers (1984) (13)
On the enumerative nature of Gomory’s dual cutting plane method (2010) (12)
Monoidal cut strengthening revisited (2012) (11)
Intersection cuts from multiple rows: a disjunctive programming approach (2012) (10)
Benders's method revisited☆ (1983) (9)
Graph substitution and set packing polytopes (1977) (9)
Report of the Session on: Branch and Bound/Implicit Enumeration (1979) (9)
New facets of the STS polytope generated from known facets of the ATS polytope (2005) (8)
Logical Constraints as Cardinality Rules: Tight Representation (2004) (8)
A Note on the Weiszfeld-Kuhn Algorithm for the General Fermat Problem. (1982) (7)
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (2016) (6)
Will to Freedom: A Perilous Journey Through Fascism and Communism (2000) (6)
Set Covering with Cutting Planes from Conditional Bounds. (1977) (5)
A hard integer program made easy by lexicography (2012) (5)
Integer Programming and Convex Analysis. (1971) (5)
All the Facets of Zero-One Programming Polytopes with Positive Coefficients. (1975) (5)
Technical Note - A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case (1973) (5)
Combining Lift-and-Project and Reduce-and-Split (2013) (5)
Some thoughts on the development of integer programming during my research career - lecture delivered upon receiving the EURO Gold Medal, July 9, 2001, Rotterdam (2002) (4)
DUALITY IN DISCRETE PROGRAMMING: IV. APPLICATIONS. (1968) (4)
DUALITY IN DISCRETE PROGRAMMING. III. NONLINEAR OBJECTIVE FUNCTION AND CONSTRAINTS. (1968) (4)
Adjacent vertices of the all 0-1 programming polytope (1979) (4)
Alternative Strategies for Using Intersection Cuts in Integer Programming. (1970) (4)
Intersection cuts - standard versus restricted (2015) (4)
The Assignable Subgraph Polytope of a Directed Graph. (1987) (4)
Finding a Minimum Node Cover in an Arbitrary Graph. (1973) (4)
ON THE SET COVERING POLYTOPE : II . LIFTING THE FACETS ' I WITH COEFFICIENTS IN { 0 , 1 , 2 ) by 0 N (4)
Mixed integer programming heuristics (2010) (3)
Finding Out Whether a Valid Inequality is Facet Defining (1990) (3)
The Convex Hull of a Disjunctive Set (2018) (3)
Intersection Cuts from Maximal Convex Extensions of the Ball and the Octahedron. (1970) (2)
Intersection cuts from outer polars of truncated cubes (1975) (2)
Partial hyperplane activation for generalized intersection cuts (2017) (2)
Adjacent Vertices of the Convex Hull of Feasible 0-1 Points. (1973) (2)
Projecting systems of linear inequalities with binary variables (2011) (2)
Statistical Analysis of Some Traveling Salesman Algorithms. (1984) (2)
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 (1983) (2)
Recent Advanced in Lift-and-Project (1997) (2)
Linearizing Nonlinear 0-1 Programs. (1980) (2)
The perfectly matchable subgraph polytope (1982) (2)
Chapter 5: Integer (Linear) Optimization (2017) (1)
A Note on the Asymptotic Theory of Integer Programming and the 0-1 Case. (1971) (1)
Comment on 'some computational results on real 0-1 knapsack problems' (1987) (1)
Design of maximum-cardinality and maximum-weight clique heuristics with applications (1996) (1)
Minimum Weighted Coloring Of Triangulated Graphs, With Application To Weighted Vertex Packing In Arbitrary Graphs (1989) (1)
Bucknell Digital Commons Bucknell Digital Commons When Lift-and-Project Cuts are Different When Lift-and-Project Cuts are Different (2021) (1)
A Constraint-Activating Outer Polar Method for Solving Pure or Mixed Integer 0-1 Programs. (1972) (1)
Partial hyperplane activation for generalized intersection cuts (2019) (1)
Stronger Cuts from Weaker Disjunctions (2010) (1)
IFORS’ Operational Research Hall of Fame Egon Balas (2006) (1)
Some Facets of the Tri-Index Assignment Polytope. (1984) (1)
Nonlinear 0-1 Programming: I. Linearization Techniques. Revision. (1983) (1)
An Inquiry into the Origins of Campidoglio Statues (1997) (1)
Implicit Enumeration: An Introductory Survey. (1973) (1)
When Lift-and-Project Cuts are Different (2018) (1)
Some thoughts on the development of integer programming during my research career (2007) (1)
Optimal Integer and Fractional Covers: A Sharp Bound on Their Ratio. (1981) (1)
A Special Issue in Memory of George B. Dantzig (2008) (1)
Erratum to “Intersection cuts–standard versus restricted” [Discrete Optim. 18 (2015) 189–192] [ ] (2018) (0)
COPY-00 00 N LINEAR-TIME SEPARATION ALGORITHMS 4 FOR THE THREE-INDEX ASSIGNMENT POLYTOPE (0)
Robert G. Jeroslow 1942 – 1988 (1989) (0)
Will to Freedom (2015) (0)
Integer Programming and Combinatorial Optimization (1995) (0)
Lift-and-Project Cuts for Mixed 0-1 Programs (2018) (0)
N < 3 BRANCH AND BOUND METHODS FOR THE TRAVELING SALESMAN PROBLEM by (2012) (0)
Tepper School of Business 8-30-2010 Stronger Cuts from Weaker Disjunctions (2015) (0)
Mathematical Programming and Logical Inference (1990) (0)
Implementation and Testing of Variants (2018) (0)
Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization (1995) (0)
Solving (CGLP)k on the LP Simplex Tableau (2018) (0)
Tepper School of Business 1984 On the facial structure of scheduling polyhedra (2015) (0)
Parallel shortest augmenting path algorithm for the assignment problem. Technical report (1989) (0)
Monoidal strengthening of simple $\mathcal{V}$-polyhedral disjunctive cuts (2023) (0)
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (2016) (0)
Moving Between Conjunctive and Disjunctive Normal Forms (2018) (0)
A Note on Outer Polar Cuts from 0-1 Points. (1972) (0)
Facets of the Three-Index Assignment Polytope. Revision. (1986) (0)
$\mathcal{V}$-Polyhedral Disjunctive Cuts (2022) (0)
Errata (1968) (0)
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, USA, May 1992 (1992) (0)
Robert G. Jeroslow 1942–1988 (1990) (0)
Valid Inequalities for 0-1 Programming Polytopes. (1980) (0)
Disjunctive Programming and Extended Formulations (2018) (0)
Error Noted in a Paper by Jacobs, Silan, and Clemson (1998) (0)
Disjunctive Programming and Its Relation to Integer Programming (2018) (0)
Participants Teachers (0)
A hard integer program made easy by lexicography (2011) (0)
Covering, Packing and Logical Inference (1993) (0)
IFORS' Operational Research Hall of Fame (2006) (0)
The Correspondence Between Lift-and-Project Cuts and Simple Disjunctive Cuts (2018) (0)
Generalized intersection cuts and a new cut generating paradigm (2011) (0)
Nonlinear Higher-Dimensional Representations (2018) (0)
CMU Tepper School of Business 1983 Traffic assignment in communication satellites (2015) (0)
Unions of Polytopes in Different Spaces (2018) (0)
"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] (2002) (0)
Integer Programming and Combinatorial Optimization: 4th International Ipco Conference Copenhagen, Denmark, May 29-31, 1995 : Proceedings (1995) (0)
Letter to the Editor - Comments on the Preceding Note (1966) (0)
Cuts from General Disjunctions (2018) (0)
Sequential Convexification of Disjunctive Sets (2018) (0)
Disjunctive Cuts from the V -Polyhedral Representation (2018) (0)
In 0 D In * 4 (0)

This paper list is powered by the following services:

Other Resources About Egon Balas

What Schools Are Affiliated With Egon Balas?

Egon Balas is affiliated with the following schools:

Egon Balas's Academic­Influence.com Rankings