Egon Balas

28 catalog papers. Identity-linked publications and additional name matches are distinguished below.

OpenAlex: A5072070820

Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213

Publications

• When Lift-and-Project Cuts Are Different — INFORMS Journal on Computing 2020
• Combining Lift-and-Project and Reduce-and-Split — INFORMS Journal on Computing 2013
• Octane: A New Heuristic for Pure 0–1 Programs — Operations Research 2001
• Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study — INFORMS Journal on Computing 2001
• Guided Local Search with Shifting Bottleneck for Job Shop Scheduling — Management Science 1998
• A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering — Operations Research 1996
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework — Management Science 1996
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling — Management Science 1995
• An Algorithm for the Three-Index Assignment Problem — Operations Research 1991
• The Shifting Bottleneck Procedure for Job Shop Scheduling — Management Science 1988
• An Algorithm for Large Zero-One Knapsack Problems — Operations Research 1980
• Pivot and Complement–A Heuristic for 0-1 Programming — Management Science 1980
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning — Operations Research 1975
• Technical Note—A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case — Operations Research 1973
• On the Set-Covering Problem — Operations Research 1972
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming — Operations Research 1971
• An Intersection Cut from the Dual of the Unit Hypercube — Operations Research 1971
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm — Operations Research 1969
• Duality in Discrete Programming: II. The Quadratic Case — Management Science 1969
• Errata — Operations Research 1968
• Letter to the Editor—A Note on the Branch-and-Bound Principle — Operations Research 1968
• Discrete Programming by the Filter Method — Operations Research 1967
• Letter to the Editor—Comments on the Preceding Note — Operations Research 1966
• An Infeasibility-Pricing Decomposition Method for Linear Programs — Operations Research 1966
• The Dual Method for the Generalized Transportation Problem — Management Science 1966
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables — Operations Research 1965
• Solution of Large-Scale Transportation Problems Through Aggregation — Operations Research 1965
• On the Generalized Transportation Problem — Management Science 1964