David Shmoys

from Wikipedia, the free encyclopedia

David Bernard Shmoys (* 1959 ) is an American mathematician who deals with mathematical optimization and operations research .

Education and career

David Shmoys, Oberwolfach 2005

Shmoys received his bachelor's degree in electrical engineering from Princeton University in 1981 and received his PhD from the University of California, Berkeley under Eugene Lawler in 1984 ( Approximation Algorithms for Problems in Sequencing, Scheduling, and Communication Network Design ). As a post-graduate student , he was at MSRI and Harvard University . He taught at the Massachusetts Institute of Technology before becoming a professor at Cornell University , where he is director of the School of Operations Research and Information Engineering.

research

He deals with the design and analysis of approximation algorithms for discrete optimization problems, especially NP-difficult problems for example in scheduling , cluster analysis , facility location , sequencing and inventory problems (inventory theory) with applications in genetic engineering, airports or for example Conservation. He used methods of linear programming.

Awards and honors, memberships, editorship

He is a Fellow of the Association for Computing Machinery and SIAM and was an NSF Presidential Young Investigator. Shmoys is Associate Editor of Mathematics of Operations Research and was editor of the SIAM Journal of Discrete Mathematics.

Fonts

  • with David P. Williamson: The Design of Approximation Algorithms, Cambridge University Press 2011
  • with Jan Karel Lenstra , Alexander Rinnooy Kan , Eugene Lawler: The traveling salesman problem - a guided tour of combinatorial optimization, Wiley 1985

Web links

Individual evidence

  1. David Shmoys in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  2. ^ Frederick W. Lanchester Prize. (No longer available online.) Informs.org ( Institute for Operations Research and the Management Sciences ), archived from the original on October 2, 2015 ; accessed on February 16, 2016 . Info: The archive link was inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice. @1@ 2Template: Webachiv / IABot / www.informs.org