Egon Balas

  • Graham K. Rand
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 147)


For the past 40 years, Egon Balas has been one of the most distinguished contributors to the theory of integer programming. He was recognized for his work by being awarded the John von Neumann Theory Prize by the Institute of Operations Research and the Management Science (INFORMS) and the European Operational Research Societies’ EURO Gold Medal. He was further honored as a fellow of INFORMS and inducted into the International Federation of Operational Research Societies’ (IFORS) Hall of Fame. The impact of his contributions has been enhanced by his extensive research collaborations: His speech on receipt of the EURO Gold Medal acknowledged the contributions of his 50 or so coauthors, listing them by name, with the number of joint papers.


Operation Research Travel Salesman Problem Communist Party Disjunctive Programming Honorary Doctorate 


  1. Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manage Sci 34(3):391–401CrossRefGoogle Scholar
  2. Balas E (1965)_ An additive algorithm for solving linear programs with zero-one variables. Oper Res 13(4):517–546CrossRefGoogle Scholar
  3. Balas E (1969) Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Oper Res 17(6):941–957CrossRefGoogle Scholar
  4. Balas E (1970) Machine sequencing: disjunctive graphs and degree-constrained subgraphs. Nav Res Logistics Q 17(1):1–10CrossRefGoogle Scholar
  5. Balas E (1974) Disjunctive programming: properties of the convex hull of feasible points. MSRR No. 348, Carnegie Mellon University, JulyGoogle Scholar
  6. Balas E (1989) The prize collecting traveling salesman problem. Networks 19(6):621–636CrossRefGoogle Scholar
  7. Balas E (1995) The prize collecting traveling salesman problem: II polyhedral results. Networks 25(4):199–216CrossRefGoogle Scholar
  8. Balas E (1998) Disjunctive programming: properties of the convex hull of feasible points. Disc Appl Math 89(1–3):3–44CrossRefGoogle Scholar
  9. Balas E (2000) Will to freedom: a perilous journey through fascism and communism. Syracuse University Press, Syracuse, NY. (Also translated into Hungarian, Romanian, French and Italian)Google Scholar
  10. Balas E (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 141(1):1–7. (Also published in 2007 in Ann Oper Res 149:19–26)CrossRefGoogle Scholar
  11. Balas E (2005) Projection, lifting and extended formulation in integer and combinatorial optimization. Ann Oper Res 140:125–161CrossRefGoogle Scholar
  12. Balas E, Bonami P (2007) New variants of lift-and-project cut generation from the LP tableau: open source implementation and testing. In: Fischetti M, Williamson DP (eds) Integer programming and combinatorial optimization: Proceedings of the 12th IPCO conference. Springer, Berlin, pp 89–104Google Scholar
  13. Balas E, Ceria S, Cornuéjols G (1993) A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math Program A 58(3):295–324CrossRefGoogle Scholar
  14. Balas E, Ceria S, Cornuéjols G (1996) Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Manage Sci 42(9):1229–1246CrossRefGoogle Scholar
  15. Balas E, Fischetti M (1993) A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets. Math Program A 58(3):325–352CrossRefGoogle Scholar
  16. Balas E, Fischetti M (1999) Lifted cycle inequalities for the asymmetric traveling salesman problem. Math Oper Res 24(2):273–292CrossRefGoogle Scholar
  17. Balas E, Fischetti M, Pulleyblank WR (1995) The precedence-constrained asymmetric traveling salesman polytope. Math Program A 68(3):241–265CrossRefGoogle Scholar
  18. Balas E, Ivănescu PL (Hammer) (1962a) On the transportation problem – part I. Cahiers du Centre d'Études de Recherche Opérationelle 4(2):98–116Google Scholar
  19. Balas E, Ivănescu PL (Hammer) (1962b) On the transportation problem – part II. Cahiers du Centre d'Études de Recherche Opérationelle 4(3):131–160Google Scholar
  20. Balas E, Ivănescu PL (Hammer) (1964) On the generalized transportation problem. Manage Sci 11(1):188–202CrossRefGoogle Scholar
  21. Balas E, Perregaard M (2003) A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming. Math Program B 94(2–3):221–245CrossRefGoogle Scholar
  22. Balas E, Pulleyblank WR (1983) The perfectly matchable subgraph polytope of a bipartite graph. Networks 13(4):495–516CrossRefGoogle Scholar
  23. Balas E, Vazacopoulos A (1998) Guided local search with shifting bottleneck for job shop scheduling. Manage Sci 44(2):262–275CrossRefGoogle Scholar
  24. Ceria S (2007) A brief history of lift-and-project. Ann Oper Res 149:57–61CrossRefGoogle Scholar
  25. Cornuéjols G (2007) Revival of the Gomory cuts in the 1990’s. Ann Oper Res 149:63–66CrossRefGoogle Scholar
  26. Dorfman R, Samuelson P, Solow R (1958) Linear programming and economic analysis. McGraw-Hill, New York, NYGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Graham K. Rand
    • 1
  1. 1.Lancaster UniversityLancasterUK

Personalised recommendations