Details about Egon Balas

This author is deceased (2019-03-18).

Access statistics for papers by Egon Balas.

Last updated 2023-02-17. Update your information in the RePEc Author Service.

Short-id: pba1664

Working Papers

2004

1. On unions and dominants of polytopes
   LIDAM Reprints CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (3)
   Also in LIDAM Discussion Papers CORE, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2002)

1989

2. A LIFTING PROCEDURE FOR THE ASYMMETRIC TRAVELING SALEMAN POLYTOPE AND A LARGE NEW CLASS OF FACETS
   GSIA Working Papers, Carnegie Mellon University, Tepper School of Business
3. A PARALLEL SHORTEST PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM
   GSIA Working Papers, Carnegie Mellon University, Tepper School of Business
4. MINIMUM WEIGHTED COLORING OF TRIANGULATED GRAPHS, WITH APPLICATION TO WEIGHTED VERTEX PACKING IN ARBITRARY GRAPHS
   GSIA Working Papers, Carnegie Mellon University, Tepper School of Business

1988

5. AN ALGORITHM FOR THE THREE-INDEX ASSIGNMENT PROBLEM
   GSIA Working Papers, Carnegie Mellon University, Tepper School of Business
   See also Journal Article An Algorithm for the Three-Index Assignment Problem, Operations Research, INFORMS (1991) View citations (21) (1991)
6. THE FIXED-OUTDEGREE 1-ARBORESCENCE POLYTOPE
   GSIA Working Papers, Carnegie Mellon University, Tepper School of Business

Journal Articles

2020

1. When Lift-and-Project Cuts Are Different
   INFORMS Journal on Computing, 2020, 32, (3), 822-834

2011

2. Projecting systems of linear inequalities with binary variables
   Annals of Operations Research, 2011, 188, (1), 19-31 View citations (1)

2007

3. Some thoughts on the development of integer programming during my research career
   Annals of Operations Research, 2007, 149, (1), 19-26

2005

4. Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
   Annals of Operations Research, 2005, 140, (1), 125-161 View citations (10)

2004

5. Logical Constraints as Cardinality Rules: Tight Representation
   Journal of Combinatorial Optimization, 2004, 8, (2), 115-128 View citations (1)

2002

6. 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, 141, (1), 1-7 View citations (1)

2001

7. Octane: A New Heuristic for Pure 0--1 Programs
   Operations Research, 2001, 49, (2), 207-225 View citations (8)

1999

8. New classes of efficiently solvable generalized Traveling Salesman Problems
   Annals of Operations Research, 1999, 86, 529-558 View citations (16)

1998

9. Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
   Management Science, 1998, 44, (2), 262-275 View citations (29)
10. Job Shop Scheduling With Deadlines
    Journal of Combinatorial Optimization, 1998, 1, (4), 329-353 View citations (2)

1996

11. A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
    Operations Research, 1996, 44, (6), 875-890 View citations (23)
12. Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
    Management Science, 1996, 42, (9), 1229-1246 View citations (32)

1995

13. The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
    Management Science, 1995, 41, (1), 94-109 View citations (20)

1991

14. An Algorithm for the Three-Index Assignment Problem
    Operations Research, 1991, 39, (1), 150-161 View citations (21)
    See also Working Paper AN ALGORITHM FOR THE THREE-INDEX ASSIGNMENT PROBLEM, GSIA Working Papers (1988) (1988)

1988

15. The Shifting Bottleneck Procedure for Job Shop Scheduling
    Management Science, 1988, 34, (3), 391-401 View citations (150)

1980

16. An Algorithm for Large Zero-One Knapsack Problems
    Operations Research, 1980, 28, (5), 1130-1154 View citations (58)
17. Pivot and Complement--A Heuristic for 0-1 Programming
    Management Science, 1980, 26, (1), 86-96 View citations (28)
18. Strengthening cuts for mixed integer programs
    European Journal of Operational Research, 1980, 4, (4), 224-234 View citations (14)

1977

19. A node covering algorithm
    Naval Research Logistics Quarterly, 1977, 24, (2), 213-233

1975

20. Intersection cuts from outer polars of truncated cubes
    Naval Research Logistics Quarterly, 1975, 22, (3), 477-496
21. On the Set-Covering Problem: II. An Algorithm for Set Partitioning
    Operations Research, 1975, 23, (1), 74-90 View citations (11)

1973

22. Technical Note—A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case
    Operations Research, 1973, 21, (1), 321-322

1972

23. On the Set-Covering Problem
    Operations Research, 1972, 20, (6), 1152-1161 View citations (14)

1971

24. An Intersection Cut from the Dual of the Unit Hypercube
    Operations Research, 1971, 19, (1), 40-44 View citations (1)
25. Intersection Cuts—A New Type of Cutting Planes for Integer Programming
    Operations Research, 1971, 19, (1), 19-39 View citations (31)

1970

26. Machine sequencing: Disjunctive graphs and degree‐constrained subgraphs
    Naval Research Logistics Quarterly, 1970, 17, (1), 1-10

1969

27. Duality in Discrete Programming: II. The Quadratic Case
    Management Science, 1969, 16, (1), 14-32 View citations (1)
28. Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
    Operations Research, 1969, 17, (6), 941-957 View citations (39)

1968

29. Errata
    Operations Research, 1968, 16, (4), 886-886
30. Letter to the Editor—A Note on the Branch-and-Bound Principle
    Operations Research, 1968, 16, (2), 442-445 View citations (1)

1967

31. Discrete Programming by the Filter Method
    Operations Research, 1967, 15, (5), 915-957 View citations (8)

1966

32. An Infeasibility-Pricing Decomposition Method for Linear Programs
    Operations Research, 1966, 14, (5), 847-873 View citations (1)
33. Letter to the Editor—Comments on the Preceding Note
    Operations Research, 1966, 14, (5), 942-942
34. The Dual Method for the Generalized Transportation Problem
    Management Science, 1966, 12, (7), 555-568 View citations (3)

1965

35. An Additive Algorithm for Solving Linear Programs with Zero-One Variables
    Operations Research, 1965, 13, (4), 517-546 View citations (34)
36. Solution of Large-Scale Transportation Problems Through Aggregation
    Operations Research, 1965, 13, (1), 82-93 View citations (1)

1964

37. On the Generalized Transportation Problem
    Management Science, 1964, 11, (1), 188-202 View citations (4)

Chapters

2007

1. On the Cycle Polytope of a Directed Graph and Its Relaxations
   Springer