David Shmoys

Citée par

	Toutes	Depuis 2018
Citations	26770	7010
indice h	61	35
indice i10	111	79

1400

700

350

1050

19881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202376 90 126 119 182 229 251 355 362 470 492 534 512 606 582 647 772 905 932 930 926 890 875 980 978 1043 1091 1095 1154 1022 1232 1312 1300 1236 1354 573

Accès public

Tout afficher

16 articles

1 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Eva TardosProfessor of Computer Science, Cornell UniversityAdresse e-mail validée de cornell.edu
Dorit S. HOCHBAUMUC BerkeleyAdresse e-mail validée de ieor.berkeley.edu
David P. WilliamsonProfessor of Operations Research, Cornell UniversityAdresse e-mail validée de cornell.edu
Retsef LeviProfessor of Operations Management, MITAdresse e-mail validée de mit.edu
Joel WeinAdresse e-mail validée de google.com
Shane HendersonProfessor of Operations Research and Information Engineering, Cornell UniversityAdresse e-mail validée de cornell.edu
Paat RusmevichientongProfessor, Marshall School of Business, University of Southern CaliforniaAdresse e-mail validée de marshall.usc.edu
Andreas S. SchulzTechnische Universität MünchenAdresse e-mail validée de tum.de
Karen AardalAdresse e-mail validée de tudelft.nl
Daniel FreundMITAdresse e-mail validée de mit.edu
Clifford SteinProfessor of IEOR and CS, Columbia UniversityAdresse e-mail validée de ieor.columbia.edu
Andrew V. GoldbergSenior Principal Scientist, Amazon.com, Inc.Adresse e-mail validée de alum.mit.edu
Peter I FrazierAssociate Professor of Operations Research and Information Engineering, Cornell UniversityAdresse e-mail validée de cornell.edu
Eoin O'MahonyUber TechnologiesAdresse e-mail validée de cornell.edu
Huseyin TopalogluCornell UniversityAdresse e-mail validée de orie.cornell.edu
Zuo-Jun Max SHENProfessor, UC BerkeleyAdresse e-mail validée de berkeley.edu
Martin PálGoogle, Inc.Adresse e-mail validée de google.com
Adam N. ElmachtoubColumbia University, Dept. of Industrial Engineering and Operations ResearchAdresse e-mail validée de ieor.columbia.edu
Moses CharikarProfessor of Computer Science, Stanford UniversityAdresse e-mail validée de cs.stanford.edu
Sudipto Guha`Adresse e-mail validée de cis.upenn.edu

Suivre

David Shmoys

Professor of Operations Research & Information Engineering and of Computer Science

Adresse e-mail validée de cs.cornell.edu

Optimization Algorithms Data Science Approximation Algorithms Operations Research


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
The traveling salesman problem: a guided tour of combinatorial optimization EL Lawler, JK Lenstra, AHG Rinnooy Kan, DB Shmoys WILEY-INTERSCIENCE SERIES IN DISCRETE MATHEMATICS, 1985	5048	1985
Sequencing and scheduling: Algorithms and complexity EL Lawler, JK Lenstra, AHG Rinnooy Kan, DB Shmoys Handbooks in operations research and management science 4, 445-522, 1993	2262	1993
The design of approximation algorithms DP Williamson, DB Shmoys Cambridge university press, 2011	1620	2011
Approximation algorithms for scheduling unrelated parallel machines JK Lenstra, DB Shmoys, É Tardos Mathematical programming 46, 259-271, 1990	1243	1990
A best possible heuristic for the k-center problem DS Hochbaum, DB Shmoys Mathematics of operations research 10 (2), 180-184, 1985	1225	1985
Approximation algorithms for facility location problems DB Shmoys, E Tardos, KI Aardal Proceedings of 29th Annual ACM Symposium on Theory of Computing (STOC) 1997 …, 1997	1055	1997
Using dual approximation algorithms for scheduling problems: theoretical and practical results DS Hochbaum, DB Shmoys Journal of the ACM (JACM) 34 (1), 144-162, 1987	945	1987
An approximation algorithm for the generalized assignment problem DB Shmoys, É Tardos Mathematical programming 62 (1-3), 461-474, 1993	865	1993
A constant-factor approximation algorithm for the k-median problem M Charikar, S Guha, É Tardos, DB Shmoys Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999	848	1999
Fast approximation algorithms for fractional packing and covering problems SA Plotkin, DB Shmoys, É Tardos Mathematics of Operations Research 20 (2), 257-301, 1995	756	1995
Scheduling to minimize average completion time: Off-line and on-line approximation algorithms LA Hall, AS Schulz, DB Shmoys, J Wein Mathematics of operations research 22 (3), 513-544, 1997	725	1997
Dynamic assortment optimization with a multinomial logit choice model and capacity constraint P Rusmevichientong, ZJM Shen, DB Shmoys Operations research 58 (6), 1666-1680, 2010	484	2010
A unified approach to approximation algorithms for bottleneck problems DS Hochbaum, DB Shmoys Journal of the ACM (JACM) 33 (3), 533-550, 1986	455	1986
A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach DS Hochbaum, DB Shmoys SIAM journal on computing 17 (3), 539-551, 1988	426	1988
Improved approximation algorithms for the uncapacitated facility location problem FA Chudak, DB Shmoys SIAM Journal on Computing 33 (1), 1-25, 2003	370	2003
Improved approximation algorithms for network design problems MX Goemans, AV Goldberg, SA Plotkin, DB Shmoys, E Tardos, ... Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, 223, 1994	318	1994
Assortment optimization under the multinomial logit model with random choice parameters P Rusmevichientong, D Shmoys, C Tong, H Topaloglu Production and Operations Management 23 (11), 2023-2039, 2014	316*	2014
Short shop schedules DP Williamson, LA Hall, JA Hoogeveen, CAJ Hurkens, JK Lenstra, ... Operations Research 45 (2), 288-294, 1997	299	1997
Scheduling parallel machines on-line DB Shmoys, J Wein, DP Williamson SIAM journal on computing 24 (6), 1313-1331, 1995	272	1995
Well-solved special cases PC Gilmore, EL Lawler, DB Shmoys The traveling salesman problem, 87-143, 1985	271*	1985

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs