Folgen
David Shmoys
David Shmoys
Professor of Operations Research & Information Engineering and of Computer Science
Bestätigte E-Mail-Adresse bei cs.cornell.edu
Titel
Zitiert von
Zitiert von
Jahr
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
53801985
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
23981993
The design of approximation algorithms
DP Williamson, DB Shmoys
Cambridge university press, 2011
19402011
Approximation algorithms for scheduling unrelated parallel machines
JK Lenstra, DB Shmoys, É Tardos
Mathematical programming 46, 259-271, 1990
13421990
A best possible heuristic for the k-center problem
DS Hochbaum, DB Shmoys
Mathematics of operations research 10 (2), 180-184, 1985
13361985
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
10961997
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
10001987
An approximation algorithm for the generalized assignment problem
DB Shmoys, É Tardos
Mathematical programming 62 (1), 461-474, 1993
9321993
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
9171999
Fast approximation algorithms for fractional packing and covering problems
SA Plotkin, DB Shmoys, É Tardos
Mathematics of Operations Research 20 (2), 257-301, 1995
8001995
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
7481997
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
6032010
A unified approach to approximation algorithms for bottleneck problems
DS Hochbaum, DB Shmoys
Journal of the ACM (JACM) 33 (3), 533-550, 1986
5051986
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
4501988
Scheduling parallel machines on-line
DB Shmoys, J Wein, DP Williamson
SIAM journal on computing 24 (6), 1313-1331, 1995
4251995
Improved approximation algorithms for the uncapacitated facility location problem
FA Chudak, DB Shmoys
SIAM Journal on Computing 33 (1), 1-25, 2003
4002003
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
381*2014
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
3291994
Provably near-optimal sampling-based policies for stochastic inventory control models
R Levi, RO Roundy, DB Shmoys
Mathematics of Operations Research 32 (4), 821-839, 2007
3132007
Short shop schedules
DP Williamson, LA Hall, JA Hoogeveen, CAJ Hurkens, JK Lenstra, ...
Operations Research 45 (2), 288-294, 1997
3131997
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20