World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
73
Citations
33499
World Ranking
1545
National Ranking
801

Mathematics

D-Index
71
Citations
33056
World Ranking
254
National Ranking
141

Research.com Recognitions

  • 2014 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)
  • 2012 - SIAM Fellow For contributions to the design, analysis, and application of efficient discrete optimization algorithms in scheduling, facility location, networks, and sustainability.
  • 2001 - ACM Fellow For fundamental achievements in the design and analysis of algorithms for discrete optimization problems.

Overview

David B. Shmoys is affiliated with Cornell University in the United States. Their research spans multiple areas within engineering and computer science, with a focus on optimization, algorithms, and operations research.

Their recent publications include the following papers:

  • Modeling for COVID-19 college reopening decisions: Cornell, a case study, 2021, Proceedings of the National Academy of Sciences
  • Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems, 2022, Operations Research
  • Booster vaccination protection against SARS-CoV-2 infections in young adults during an Omicron BA.1-predominant period: A retrospective cohort study, 2023, PLoS Medicine
  • Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem, 2021, ACM Transactions on Algorithms
  • Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem, 2020, arXiv (Cornell University)

Their frequent co-authors include:

  • Shane G. Henderson
  • Wes Gurnee
  • Peter I. Frazier
  • Manxi Wu
  • Sander Aarts

David B. Shmoys has published prominently in venues such as:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Operations Research Letters
  • INFORMS Journal on Applied Analytics
  • Proceedings of the National Academy of Sciences

The main fields of study for their research are:

  • Engineering
  • Computer Science

Subfields include:

  • Industrial and Manufacturing Engineering
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Management Science and Operations Research
  • Political Science and International Relations

The research topics addressed cover:

  • Optimization and Search Problems
  • Complexity and Algorithms in Graphs
  • Transportation and Mobility Innovations
  • Game Theory and Voting Systems
  • Facility Location and Emergency Management
  • Vehicle Routing Optimization Methods
  • Optimization and Packing Problems

Shmoys has been recognized with several awards, including:

  • Fellow of the Institute for Operations Research and the Management Sciences (INFORMS), 2014
  • SIAM Fellow, 2012, for contributions to the design, analysis, and application of efficient discrete optimization algorithms in scheduling, facility location, networks, and sustainability
  • ACM Fellow, 2001, for fundamental achievements in the design and analysis of algorithms for discrete optimization problems

Best Publications

  • The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

    E.L. Lawler;Jan Karel Lenstra;A.H.G. Rinnooy Kan;D.B. Shmoys

  • The traveling salesman problem

    Eugene L. Lawler;Jan Karel Lenstra;Alexander H. G. Rinnooy Kan;David Shmoys

  • Sequencing and scheduling : algorithms and complexity

    EL Lawler;JK Jan Karel Lenstra;Ahg Alexander Rinnooy Kan;DB David Shmoys

  • The Design of Approximation Algorithms

    David P. Williamson;David B. Shmoys

  • Approximation algorithms for scheduling unrelated parallel machines

    J. K. Lenstra;D. B. Shmoys;É. Tardos

  • A Best Possible Heuristic for the k-Center Problem

    Dorit S. Hochbaum;David B. Shmoys

  • Using dual approximation algorithms for scheduling problems theoretical and practical results

    Dorit S. Hochbaum;David B. Shmoys

  • An approximation algorithm for the generalized assignment problem

    David B. Shmoys;Éva Tardos

  • Sequencing and scheduling : algorithms and complexity

    E.L. Lawler;J.K. Lenstra;A.H.G. Rinnooy Kan;D.B. Shmoys

  • Fast approximation algorithms for fractional packing and covering problems

    Serge A. Plotkin;David B. Shmoys;Éva Tardos

  • A constant-factor approximation algorithm for the k -median problem

    Moses Charikar;Sudipto Guha;Éva Tardos;David B. Shmoys

  • Chapter 9 Sequencing and scheduling: Algorithms and complexity

    Eugene L. Lawler;Jan Karel Lenstra;Alexander H.G. Rinnooy Kan;David B. Shmoys

  • Approximation algorithms for facility location problems

    D.B. Shmoys;É. Tardos;K.I. Aardal

  • Approximation algorithms for facility location problems (extended abstract)

    David B. Shmoys;Éva Tardos;Karen Aardal

  • Scheduling to minimize average completion time: off-line and on-line approximation algorithms

    Leslie A. Hall;Andreas S. Schulz;David B. Shmoys;Joel Wein

  • Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint

    Paat Rusmevichientong;Zuo-Jun Max Shen;David B. Shmoys

  • Scheduling Parallel Machines On-line

    David B. Shmoys;Joel Wein;David P. Williamson

  • A unified approach to approximation algorithms for bottleneck problems

    Dorit S. Hochbaum;David B. Shmoys

  • A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

    Dorit s. Hochbaum;David B. Shmoys

  • Improved Approximation Algorithms for the Uncapacitated Facility Location Problem

    Fabián A. Chudak;David B. Shmoys

  • A constant-factor approximation algorithm for the k-median problem (extended abstract)

    Moses Charikar;Sudipto Guha;Éva Tardos;David B. Shmoys

  • The Design of Approximation Algorithms: Further Uses of Random Sampling and Randomized Rounding of Linear Programs

    David P. Williamson;David B. Shmoys

  • The Design of Approximation Algorithms: Random Sampling and Randomized Rounding of Linear Programs

    David P. Williamson;David B. Shmoys

Frequent Co-Authors

David P. Williamson
David P. Williamson Cornell University
Jan Karel Lenstra
Jan Karel Lenstra Centrum Wiskunde & Informatica
Éva Tardos
Éva Tardos Cornell University
Chaitanya Swamy
Chaitanya Swamy University of Waterloo
Dorit S. Hochbaum
Dorit S. Hochbaum University of California, Berkeley
Eugene L. Lawler
Eugene L. Lawler University of California, Berkeley
Shane G. Henderson
Shane G. Henderson Cornell University
Carla P. Gomes
Carla P. Gomes Cornell University
Andreas S. Schulz
Andreas S. Schulz Technical University of Munich
Robert Kleinberg
Robert Kleinberg Cornell University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Mathematics in the USA opens doors to various interdisciplinary fields and career opportunities. Many students complement their math background with business-focused graduate degrees to enhance their skillsets and employability. For those interested in rapidly advancing their careers, exploring fastest online MBA programs can be a strategic choice, allowing completion in less time without sacrificing quality.

Marketing professionals with strong analytical skills are in demand, and a masters in marketing can be an excellent complement to a math background. This degree combines quantitative analysis with market strategy, preparing graduates for roles in data-driven marketing and business analytics.

For those seeking intensive study options, one year MBA programs offer a compact, rigorous curriculum that fast-tracks leadership skills. Additionally, many students benefit from flexibility by enrolling in an online MBA with transfer credits accepted, which eases the transition and reduces time to degree completion.

Considering these related degrees provides math students with diverse pathways to careers in finance, marketing, management, and beyond, leveraging their analytical strengths in practical, high-demand fields.

Best Scientists Citing David B. Shmoys

Trending Scientists