search query: @author Hochbaum, D. S. / total: 5
references: 1-5 / 5
« previous page | next page »
 titleyearauthor
1.
Capacity Acquisition, Subcontracting, and Lot Sizing
Management Science
2001 : AUG, VOL. 47:8, p. 1081-1100
 2001 Atamturk, A.
Hochbaum, D. S.
2.
Strongly polynomial algorithms for the high multiplicity scheduling problem
Operations Research
1991 : JUL-AUG, VOL. 39:4, p. 648-653
 1991 Hochbaum, D. S.
Shamir, R.
3.
Strongly polynomial algorithms for the high multiplicity scheduling problem.
Operations Research
1991 : JUL-AUG, VOL. 39:4, p. 648-654
 1991 Hochbaum, D. S.
Shamir, R.
4.
Lagrangian relaxation for testing infeasibility in VLSI routing.
Operations Research
1986 : NOV-DEC, VOL. 34:6, p. 819-831
 1986 Feo, T. A.
Hochbaum, D. S.
5.
Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem.
European Journal of Operational Research
1986 : SEP, VOL. 26:3, p. 380-384
 1986 Hochbaum, D. S.
Shmoys, D. B.
« previous page | next page »
SCIMA