Eugene Lawler

from Wikipedia, the free encyclopedia

Eugene Lawler ( 1933 - September 2, 1994 ) was an American mathematician , electrical engineer and computer scientist who is one of the founders of combinatorial optimization .

Live and act

Eugene Lawler grew up in Evanston (Illinois) and studied at Florida State University (Bachelor in Mathematics 1954) and at Harvard (Master 1957). From 1959 to 1961 he was an electrical engineer at Sylvania Electric Products in Needham , Massachusetts . In 1962 he went back to Harvard, where he received his doctorate from Anthony Oettinger in 1963 ("Some Aspects of Discrete Mathematical Programming"). Then he was from 1962 at the University of Michigan , where he became a professor of electrical engineering. From 1971 he was a professor at Berkeley , where he retired in 1994.

Lawler dealt with combinatorial optimization and especially scheduling and branch and bound methods. From 1990 he turned increasingly to computer science applications in biochemistry as part of large sequencing projects.

Eugene Lawler was known for his interdisciplinary commitment to the interaction of computers and society (on which he held a well-attended course at Berkeley). That is why the ACM awards a Eugene Lawler Prize in his honor. In 1992 he became a Fellow of the American Association for the Advancement of Science .

David Shmoys is one of his PhD students .


  • Selected Publications of Eugene Lawler, Amsterdam 1999
  • Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, 1976
  • with Jan Karel Lenstra , Alexander Rinnooy Kan , David Shmoys: The traveling salesman problem - a guided tour of combinatorial optimization, Wiley 1985
  • with David Wood “Branch and bound methods - a survey”, Operations Research Vol. 14, 1966, pp. 699-719

Web links

Individual evidence

  1. Eugene Lawler in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used