Следене
David Shmoys
David Shmoys
Professor of Operations Research & Information Engineering and of Computer Science
Потвърден имейл адрес: cs.cornell.edu
Заглавие
Позовавания
Позовавания
Година
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
4878*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
21821993
The design of approximation algorithms
DP Williamson, DB Shmoys
Cambridge university press, 2011
14232011
Approximation algorithms for scheduling unrelated parallel machines
JK Lenstra, DB Shmoys, É Tardos
Mathematical programming 46 (1), 259-271, 1990
11891990
A best possible heuristic for the k-center problem
DS Hochbaum, DB Shmoys
Mathematics of operations research 10 (2), 180-184, 1985
11421985
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
10171997
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
8971987
An approximation algorithm for the generalized assignment problem
DB Shmoys, É Tardos
Mathematical programming 62 (1), 461-474, 1993
8241993
A constant-factor approximation algorithm for the k-median problem
M Charikar, S Guha, É Tardos, DB Shmoys
Journal of Computer and System Sciences 65 (1), 129-149, 2002
7882002
Fast approximation algorithms for fractional packing and covering problems
SA Plotkin, DB Shmoys, É Tardos
Mathematics of Operations Research 20 (2), 257-301, 1995
7401995
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
5661997
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
4262010
A unified approach to approximation algorithms for bottleneck problems
DS Hochbaum, DB Shmoys
Journal of the ACM (JACM) 33 (3), 533-550, 1986
4201986
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
4161988
Scheduling parallel machines on-line
DB Shmoys, J Wein, DP Williamson
SIAM journal on computing 24 (6), 1313-1331, 1995
3961995
Improved approximation algorithms for the uncapacitated facility location problem
FA Chudak, DB Shmoys
SIAM Journal on Computing 33 (1), 1-25, 2003
3512003
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
3011994
Short shop schedules
DP Williamson, LA Hall, JA Hoogeveen, CAJ Hurkens, JK Lenstra, ...
Operations Research 45 (2), 288-294, 1997
2861997
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
270*2014
Well-solved special cases
PC Gilmore, EL Lawler, DB Shmoys
The traveling salesman problem, 87-143, 1985
268*1985
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20