Egon Balas

View Printable Version

University Professor of Industrial Administration and Applied Mathematics, The Thomas Lord Professor of Operations Research

Teaching and Research Interests:

• Mathematical programming, in particular integer programming, combinatorial optimization, graphs, networks, polyhedral theory, disjunctive programming, projection and lifting, scheduling theory, facility location, logistics. Solution techniques for vertex packing and maximum clique problems, traveling salesman and related problems, set covering and partitioning, knapsack problems, general 0-1 programming problems; machine sequencing, scheduling of communication satellites, of crew assignments.

Useful Links:

• Bio
• Papers
• Books

Select Publications: 

• Optimizing Over the Split Closure
  Mathematical Programming, 2007.
  (With: Anureet Saxena)
  
  
• A Precise Correspondence Between Lift-and-Project Cuts, Simple Disjunctive Cuts, and Mixed Integer Gomory Cuts for 0-1 Programming (with M. Perregaard)
  Mathematical Programming B, 2003; 221-245.
  
  
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework (with S. Ceria and G. Cornuéjols)
  Management Science 42, 1996; 1229-1246.
  
  
• The Prize Collecting Traveling Salesman Problem: II Polyhedad Results
  Networks 25, 1995; 199-216.
  
  
• A Lift-and-Project Cutting Plane Algorithm for Mixed 0-1 Programs (with S. Ceria and G. Cornuéjols)
  Mathematical Programming 58, 1993; 295-324.
  
  
• The Prize Collecting Traveling Salesman Problem I
  Networks 19, 1989; 621-636.
  
  
• The Shifting Bottleneck Procedure for Job Shop Scheduling
  Management Science 34, 1988; 391-401.
  (With: J. Adams, D. Zawack)
  
  
• On The Maximum-Weight Clique Problem (with V. Chivatal and J. Nesetril)
  Mathematics of Operations Research 12, 1987; 522-536.
  
  
• Disjunctive Programming
  Annals of Discrete Mathematics 5, 1979; 3-51.
  
  
• An Additive Algorithm for Linear Programming in Zero-One Variables
  Operations Research 13, 1965; 517-546.
  
  

Additional Publications: 

• OCTANE: A New Heuristic for Pure 0-1 Programs
  Operations Research, 2001; 207-225.
  (With: François Margot, S. Ceria, Milind Dawande, G. Pataki)
  
  

• Will to Freedom: A Perilous Journey Through Fascism and Communism, 469 pp., Syracuse University Press, (January, 2000).
  
  

Awards:

• National Academy of Engineering - 2006
• IFORS Hall of Fame - 2006
• Honorary Doctorate in Mathematics, University of Waterloo - 2005
• Hungarian Academy of Science, external member - 2004-
• INFORMS Fellow - 2002
• Honorary Doctorate in Mathematics, Miguel Hernandez University, Elche, Spain - 2002
• EURO Gold Medal - 2001
• John von Neumann Theory Prize, INFORMS - 1995
• Senior U.S. Scientist Award of the von Humboldt Foundation - 1980-1981

Editorial Boards:

• Discrete Optimization, 2003-
• Naval Logistics Research, 2002-
• Journal of Combinatorial Optimization, 1996-
• Computational Optimization and Applications, 1991-
• Annals of Operations Research, 1983-
• Zeitschrift für Operations Research, 1980-
• Revue d'Automatique, Informatique et Recherche Opérationnelle, 1976-2003
• Discrete Applied Mathematics, 1976-
• European Journal of Operational Research, 1976-
• Operations Research, 1966-1996

Consulting:

• Algorithmica, Inc.
• Sumitomo Steel
• LTV Steel
• CombineNet, Inc.
• American Airlines

Courses Taught:

• Sequencing and Scheduling (45-866)
  (Masters Program)
  • 2007, Mini 4 (Section: A)
  
  
• Integer Programming (47-830)
  (Ph.D. Program)
  • 2008, Mini 3 (Section: A)
  
  
• Advanced Integer Programming (47-831)
  (Ph.D. Program)
  • 2009, Mini 4 (Section: A)
  
  
• Linear Programming (47-834)
  (Ph.D. Program)
  • 2008, Mini 1 (Section: A)
  
  
• Graph Theory (47-835)
  (Ph.D. Program)
  • 2007, Mini 1 (Section: A)
  
  
• Networks and Matchings (47-836)
  (Ph.D. Program)
  • 2007, Mini 2 (Section: A)
  
  
• Convex Polytopes (47-861)
  (Ph.D. Program)
  • 2008, Mini 2 (Section: A)
  • 2007, Mini 3 (Section: A)