Skip to main content

Egon Balas

  • 1439 Accesses

Part of the International Series in Operations Research & Management Science book series (ISOR,volume 147)

Abstract

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.

Keywords

  • Operation Research
  • Travel Salesman Problem
  • Communist Party
  • Disjunctive Programming
  • Honorary Doctorate

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-1-4419-6281-2_24
  • Chapter length: 15 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   89.00
Price excludes VAT (USA)
  • ISBN: 978-1-4419-6281-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   119.00
Price excludes VAT (USA)
Hardcover Book
USD   199.99
Price excludes VAT (USA)

References

  • Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manage Sci 34(3):391–401

    CrossRef  Google Scholar 

  • Balas E (1965)_ An additive algorithm for solving linear programs with zero-one variables. Oper Res 13(4):517–546

    CrossRef  Google Scholar 

  • Balas E (1969) Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Oper Res 17(6):941–957

    CrossRef  Google Scholar 

  • Balas E (1970) Machine sequencing: disjunctive graphs and degree-constrained subgraphs. Nav Res Logistics Q 17(1):1–10

    CrossRef  Google Scholar 

  • Balas E (1974) Disjunctive programming: properties of the convex hull of feasible points. MSRR No. 348, Carnegie Mellon University, July

    Google Scholar 

  • Balas E (1989) The prize collecting traveling salesman problem. Networks 19(6):621–636

    CrossRef  Google Scholar 

  • Balas E (1995) The prize collecting traveling salesman problem: II polyhedral results. Networks 25(4):199–216

    CrossRef  Google Scholar 

  • Balas E (1998) Disjunctive programming: properties of the convex hull of feasible points. Disc Appl Math 89(1–3):3–44

    CrossRef  Google Scholar 

  • 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 

  • 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)

    CrossRef  Google Scholar 

  • Balas E (2005) Projection, lifting and extended formulation in integer and combinatorial optimization. Ann Oper Res 140:125–161

    CrossRef  Google Scholar 

  • 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–104

    Google Scholar 

  • 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–324

    CrossRef  Google Scholar 

  • 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–1246

    CrossRef  Google Scholar 

  • 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–352

    CrossRef  Google Scholar 

  • Balas E, Fischetti M (1999) Lifted cycle inequalities for the asymmetric traveling salesman problem. Math Oper Res 24(2):273–292

    CrossRef  Google Scholar 

  • Balas E, Fischetti M, Pulleyblank WR (1995) The precedence-constrained asymmetric traveling salesman polytope. Math Program A 68(3):241–265

    CrossRef  Google Scholar 

  • 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–116

    Google Scholar 

  • 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–160

    Google Scholar 

  • Balas E, Ivănescu PL (Hammer) (1964) On the generalized transportation problem. Manage Sci 11(1):188–202

    CrossRef  Google Scholar 

  • 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–245

    CrossRef  Google Scholar 

  • Balas E, Pulleyblank WR (1983) The perfectly matchable subgraph polytope of a bipartite graph. Networks 13(4):495–516

    CrossRef  Google Scholar 

  • Balas E, Vazacopoulos A (1998) Guided local search with shifting bottleneck for job shop scheduling. Manage Sci 44(2):262–275

    CrossRef  Google Scholar 

  • Ceria S (2007) A brief history of lift-and-project. Ann Oper Res 149:57–61

    CrossRef  Google Scholar 

  • Cornuéjols G (2007) Revival of the Gomory cuts in the 1990’s. Ann Oper Res 149:63–66

    CrossRef  Google Scholar 

  • Dorfman R, Samuelson P, Solow R (1958) Linear programming and economic analysis. McGraw-Hill, New York, NY

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Rand, G.K. (2011). Egon Balas. In: Assad, A., Gass, S. (eds) Profiles in Operations Research. International Series in Operations Research & Management Science, vol 147. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-6281-2_24

Download citation