AAAAAA
Results:
1-9
|
Results: 9
Authors:
PHILLIPS CA
SCHULZ AS
SHMOYS DB
STEIN C
WEIN J
Citation: Ca. Phillips et al., IMPROVED BOUNDS ON RELAXATIONS OF A PARALLEL MACHINE SCHEDULING PROBLEM, Journal of combinatorial optimization, 1(4), 1998, pp. 413-426
Authors:
HALL LA
SCHULZ AS
SHMOYS DB
WEIN J
Citation: La. Hall et al., SCHEDULING TO MINIMIZE AVERAGE COMPLETION-TIME - OFF-LINE AND ONLINE APPROXIMATION ALGORITHMS, Mathematics of operations research, 22(3), 1997, pp. 513-544
Authors:
WILLIAMSON DP
HALL LA
HOOGEVEEN JA
HURKENS CAJ
LENSTRA JK
SEVASTJANOV SV
SHMOYS DB
Citation: Dp. Williamson et al., SHORT SHOP SCHEDULES, Operations research, 45(2), 1997, pp. 288-294
Authors:
SCHULZ AS
SHMOYS DB
WILLIAMSON DP
Citation: As. Schulz et al., APPROXIMATION ALGORITHMS, Proceedings of the National Academy of Sciences of the United Statesof America, 94(24), 1997, pp. 12734-12735
Authors:
LOUI MC
CONDON A
FICH F
FREDERICKSON GN
GOLDBERG AV
JOHNSON DS
MAHANEY S
RAGHAVAN P
SAVAGE J
SELMAN AL
SHMOYS DB
Citation: Mc. Loui et al., STRATEGIC DIRECTIONS IN RESEARCH IN THEORY OF COMPUTING, ACM computing surveys, 28(4), 1996, pp. 575-590
Authors:
PLOTKIN SA
SHMOYS DB
TARDOS E
Citation: Sa. Plotkin et al., FAST APPROXIMATION ALGORITHMS FOR FRACTIONAL PACKING AND COVERING PROBLEMS, Mathematics of operations research, 20(2), 1995, pp. 257-301
Authors:
SHMOYS DB
WEIN J
WILLIAMSON DP
Citation: Db. Shmoys et al., SCHEDULING PARALLEL MACHINES ONLINE, SIAM journal on computing, 24(6), 1995, pp. 1313-1331
Authors:
SHMOYS DB
STEIN C
WEIN J
Citation: Db. Shmoys et al., IMPROVED APPROXIMATION ALGORITHMS FOR SHOP SCHEDULING PROBLEMS, SIAM journal on computing, 23(3), 1994, pp. 617-632
Authors:
SHMOYS DB
TARDOS E
Citation: Db. Shmoys et E. Tardos, AN APPROXIMATION ALGORITHM FOR THE GENERALIZED ASSIGNMENT PROBLEM, Mathematical programming, 62(3), 1993, pp. 461-474
Risultati:
1-9
|