- Email: [email protected]
Author index to volume 29
Operations Research Letters 29 (2001) 247 } 248
Author Index to Volume 29 The issue number is given in front of the page numbers Aghezzaf, B. and T. Ouaderhman, An interactive interior point algorithm for multiobjective linear programming problems Arthanari, T.S. and M. Usha, On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem AtamtuK rk, A., Flow pack facets of the single node "xed-charge #ow polytope
(4) 163}170 (3) 129}139 (3) 107}114
Balakrishnan, A., T.L. Magnanti and P. Mirchandani, Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems Boyaci, T. and G. Gallego, Minimizing holding and ordering costs subject to a bound on backorders is as easy as solving a single backorder cost model Breit, J., G. Schmidt and V.A. Strusevich, Two-machine open shop scheduling with an availability constraint Bumb, A., An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
(4) 155}161
Cao, J., see Yue, D. Chen, X., see Grassmann, W.K. Chen, Z.-L., see Zhang, F.
(4) 193}197 (2) 57} 63 (1) 41} 47
Dahl, T.A. and T.R. Willemain, The e!ect of long-memory arrivals on queue performance de Farias Jr., I.R. and G.L. Nemhauser, A family of inequalities for the generalized assignment polytope Dem\ neko, V.G. and G.J. Woeginger, Hardness of approximation of the discrete time-cost tradeo! problem
(3)
99}106
(4) 187}192 (2)
65} 77
(3) 123}127 (2)
49} 55
(5) 207}210
Epstein, L., Optimal preemptive on-line scheduling on uniform processors with nondecreasing speed ratios
(2)
Franx, G.J., A simple solution for the M/D/c waiting time distribution
(5) 221}229
Gallego, G., see Boyaci, T. GaH rciga, O.R., A. Iusem and B.F. Svaiter, On the need for hybrid steps in hybrid proximal point methods Goldberg, R.R. and J. Shapiro, Extending Graham's result on scheduling to other heuristics Grassmann, W.K., X. Chen and B.R.K. Kashyap, Optimal service rates for the statedependent M/G/1 queues in steady state
(4) 187}192
Haviv, M., The Aumann}Shapley price mechanism for allocating congestion costs Hoogeveen, H. and G.J. Woeginger, A very di$cult scheduling problem with communication delays Hurink, J. and S. Knust, List scheduling in a parallel machine environment with precedence constraints and setup times
(5) 211}215 (5) 241}245
Imreh, C., Online strip packing with modi"able boxes Iusem, A., see GaH rciga, O.R.
(2) 79} 85 (5) 217}220
Elsevier Science B.V. PII: S 0 1 6 7 - 6 3 7 7 ( 0 1 ) 0 0 1 1 1 - 0
93} 98
(5) 217}220 (4) 149}153 (2)
57} 63
(5) 231}239
248
Author Index to Volume 29 (2001) 247}248 Jia, L., see Zukerman, M. Kaminsky, P. and D. Simchi-Levi, Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates Karas7 an, O.E., see Yaman, H. Kashyap, B.R.K., see Grassmann, W.K. Knust, S., see Hurink, J. Koulamas, C. see Kyparisis, G.J. Kyparisis, G.J. and C. Koulamas, A note on weighted completion time minimization in a #exible #ow shop
(1)
13} 16
(3) 141}148 (1) 31} 40 (2) 57} 63 (5) 231}239 (1) 5} 11 (1)
5} 11
Li, D., see Sun, X.L.
(2)
87} 92
Magnanti, T.L., see Balakrishnan, A. Marcotte, P., G. Savard and D.L. Zhu, A trust region algorithm for nonlinear bilevel programming Mirchandani, P., see Balakrishnan, A.
(3)
99}106
(4) 171}179 (3) 99}106
Neame, T., see Zukerman, M. Nemhauser, G.L., see de Farias Jr., I.R.
(1) (2)
Ouaderhman, T., see Aghezzaf, B.
(4) 163}170
Pmnar, M.C7 ., see Yaman, H. PreH kopa, A., On the concavity of multivariate probability distribution functions
(1) (1)
Righter,R. and J.G. Shanthikumar, Optimal ordering of operations in a manufacturing chain
(3) 115}121
Savard, G., see Marcotte, P. Schmidt, G., see Breit, J. Shanthikumar, J.G., see Righter, R. Shapiro, J., see Goldberg, R.R. Simchi-Levi, D., see Kaminsky, P. Singh, G., Performance of critical path type algorithms for scheduling on parallel processors Stadje, W. and D. Zuckerman, A random walk model for a multi-component deteriorating system Strusevich, V.A., see Breit, J. Sun, X.L. and D. Li, On the relationship between the integer and continuous solutions of convex programs Svaiter, B.F., see GaH rciga, O.R.
(4) (2) (3) (4) (3)
171}179 65} 77 115}121 149}153 141}148
(1)
17} 30
Tang, G., see Zhang, F. Tunc7 el, L., On the Slater condition for the SDP relaxations of nonconvex sets
(1) 41} 47 (4) 181}186
Usha, M., see Arthanari, T.S.
(3) 129}139
Willemain, T.R., see Dahl, T.A. Woeginger, G.J., see Dem\ neko, V.G. Woeginger, G.J., see Hoogeveen, H. Woeginger, G.J., see Zukerman, M.
(3) 123}127 (5) 207}210 (5) 241}245 (1) 13} 16
Yaman, H., O.E. Karas7 an and M.C7 . Pmnar, The robust spanning tree problem with interval data Yue, D. and J. Cao, Some results on successive failure times of a system with minimal instantaneous repairs Zhang, F., G. Tang and Z.-L. Chen, A -approximation algorithm for parallel machine scheduling with controllable processing times Zhu, D.L., see Marcotte, P. Zuckerman, D., see Stadje, W. Zukerman, M., L. Jia, T. Neame and G.J. Woeginger, A polynomially solvable special case of the unbounded knapsack problem
13} 16 49} 55
31} 40 1} 4
(5) 199}205 (2) 65} 77 (2) 87} 92 (5) 217}220
(1)
31} 40
(4) 193}197 (1) 41} 47 (4) 171}179 (5) 199}205 (1)
13} 16
Author Index to Volume 29 The issue number is given in front of the page numbers Aghezzaf, B. and T. Ouaderhman, An interactive interior point algorithm for multiobjective linear programming problems Arthanari, T.S. and M. Usha, On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem AtamtuK rk, A., Flow pack facets of the single node "xed-charge #ow polytope
(4) 163}170 (3) 129}139 (3) 107}114
Balakrishnan, A., T.L. Magnanti and P. Mirchandani, Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems Boyaci, T. and G. Gallego, Minimizing holding and ordering costs subject to a bound on backorders is as easy as solving a single backorder cost model Breit, J., G. Schmidt and V.A. Strusevich, Two-machine open shop scheduling with an availability constraint Bumb, A., An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
(4) 155}161
Cao, J., see Yue, D. Chen, X., see Grassmann, W.K. Chen, Z.-L., see Zhang, F.
(4) 193}197 (2) 57} 63 (1) 41} 47
Dahl, T.A. and T.R. Willemain, The e!ect of long-memory arrivals on queue performance de Farias Jr., I.R. and G.L. Nemhauser, A family of inequalities for the generalized assignment polytope Dem\ neko, V.G. and G.J. Woeginger, Hardness of approximation of the discrete time-cost tradeo! problem
(3)
99}106
(4) 187}192 (2)
65} 77
(3) 123}127 (2)
49} 55
(5) 207}210
Epstein, L., Optimal preemptive on-line scheduling on uniform processors with nondecreasing speed ratios
(2)
Franx, G.J., A simple solution for the M/D/c waiting time distribution
(5) 221}229
Gallego, G., see Boyaci, T. GaH rciga, O.R., A. Iusem and B.F. Svaiter, On the need for hybrid steps in hybrid proximal point methods Goldberg, R.R. and J. Shapiro, Extending Graham's result on scheduling to other heuristics Grassmann, W.K., X. Chen and B.R.K. Kashyap, Optimal service rates for the statedependent M/G/1 queues in steady state
(4) 187}192
Haviv, M., The Aumann}Shapley price mechanism for allocating congestion costs Hoogeveen, H. and G.J. Woeginger, A very di$cult scheduling problem with communication delays Hurink, J. and S. Knust, List scheduling in a parallel machine environment with precedence constraints and setup times
(5) 211}215 (5) 241}245
Imreh, C., Online strip packing with modi"able boxes Iusem, A., see GaH rciga, O.R.
(2) 79} 85 (5) 217}220
Elsevier Science B.V. PII: S 0 1 6 7 - 6 3 7 7 ( 0 1 ) 0 0 1 1 1 - 0
93} 98
(5) 217}220 (4) 149}153 (2)
57} 63
(5) 231}239
248
Author Index to Volume 29 (2001) 247}248 Jia, L., see Zukerman, M. Kaminsky, P. and D. Simchi-Levi, Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates Karas7 an, O.E., see Yaman, H. Kashyap, B.R.K., see Grassmann, W.K. Knust, S., see Hurink, J. Koulamas, C. see Kyparisis, G.J. Kyparisis, G.J. and C. Koulamas, A note on weighted completion time minimization in a #exible #ow shop
(1)
13} 16
(3) 141}148 (1) 31} 40 (2) 57} 63 (5) 231}239 (1) 5} 11 (1)
5} 11
Li, D., see Sun, X.L.
(2)
87} 92
Magnanti, T.L., see Balakrishnan, A. Marcotte, P., G. Savard and D.L. Zhu, A trust region algorithm for nonlinear bilevel programming Mirchandani, P., see Balakrishnan, A.
(3)
99}106
(4) 171}179 (3) 99}106
Neame, T., see Zukerman, M. Nemhauser, G.L., see de Farias Jr., I.R.
(1) (2)
Ouaderhman, T., see Aghezzaf, B.
(4) 163}170
Pmnar, M.C7 ., see Yaman, H. PreH kopa, A., On the concavity of multivariate probability distribution functions
(1) (1)
Righter,R. and J.G. Shanthikumar, Optimal ordering of operations in a manufacturing chain
(3) 115}121
Savard, G., see Marcotte, P. Schmidt, G., see Breit, J. Shanthikumar, J.G., see Righter, R. Shapiro, J., see Goldberg, R.R. Simchi-Levi, D., see Kaminsky, P. Singh, G., Performance of critical path type algorithms for scheduling on parallel processors Stadje, W. and D. Zuckerman, A random walk model for a multi-component deteriorating system Strusevich, V.A., see Breit, J. Sun, X.L. and D. Li, On the relationship between the integer and continuous solutions of convex programs Svaiter, B.F., see GaH rciga, O.R.
(4) (2) (3) (4) (3)
171}179 65} 77 115}121 149}153 141}148
(1)
17} 30
Tang, G., see Zhang, F. Tunc7 el, L., On the Slater condition for the SDP relaxations of nonconvex sets
(1) 41} 47 (4) 181}186
Usha, M., see Arthanari, T.S.
(3) 129}139
Willemain, T.R., see Dahl, T.A. Woeginger, G.J., see Dem\ neko, V.G. Woeginger, G.J., see Hoogeveen, H. Woeginger, G.J., see Zukerman, M.
(3) 123}127 (5) 207}210 (5) 241}245 (1) 13} 16
Yaman, H., O.E. Karas7 an and M.C7 . Pmnar, The robust spanning tree problem with interval data Yue, D. and J. Cao, Some results on successive failure times of a system with minimal instantaneous repairs Zhang, F., G. Tang and Z.-L. Chen, A -approximation algorithm for parallel machine scheduling with controllable processing times Zhu, D.L., see Marcotte, P. Zuckerman, D., see Stadje, W. Zukerman, M., L. Jia, T. Neame and G.J. Woeginger, A polynomially solvable special case of the unbounded knapsack problem
13} 16 49} 55
31} 40 1} 4
(5) 199}205 (2) 65} 77 (2) 87} 92 (5) 217}220
(1)
31} 40
(4) 193}197 (1) 41} 47 (4) 171}179 (5) 199}205 (1)
13} 16