Operations Research Letters 26 (2000) 247}248
Author Index to Volume 26
The issue number is given in front of the page numbers
AraHoz, J., Forward chaining is simple(x) (1) 23} 26
Barahona, F., On thek-cut problem (3) 99}105
Brown, G.G., R.F. Dell and M.P. Olson, Valid integer polytope (VIP) penalties for
branch-and-bound enumeration (3) 117}126
Cai, X.,seeZhang, G. (5) 217}222
Caron, R.J.,seeHolder, A.G. (2) 49} 54
Cheng, T.C.E. and G. Wang, An improved heuristic for two-machine#owshop
schedul-ing with an availability constraint (5) 223}229
Choi, G.,seeSherali, H.D. (1) 1} 8
Csenki, A., Asymptotics for renewal-reward processes with retrospective reward
struc-ture (5) 201}209
Dell, R.F.,seeBrown, G.G. (3) 117}126
Epstein, L. and J. Sgall, A lower bound for on-line scheduling on uniformly related
machines (1) 17} 22
Ghiani, G. and G. Improta, An algorithm for the hierarchical Chinese postman problem (1) 27} 32 GuKntzer, M.M. and D. Jungnickel, Approximate minimization algorithms for the 0/1
Knapsack and Subset-Sum Problem (2) 55} 66
Goemans, M.X., J.M. Wein and D.P. Williamson, A 1.47-approximation algorithm for
a preemptive single-machine scheduling problem (4) 149}154
Grippo, L. and M. Sciandrone, On the convergence of the block nonlinear Gauss}Seidel
method under convex constraints (3) 127}136
He, Q.-M., Classi"cation of Markov processes of M/G/1 type with a tree structure and
its applications to queueing models (2) 67} 80
Holder, A.G. and R.J. Caron, Uniform bounds on the limiting and marginal derivatives
of the analytic center solution over a set of normalized weights (2) 49} 54 Hwang, F.K., S. Onn and U.G. Rothblum, Linear-shaped partition problems (4) 159}163
Improta, G.,seeGhiani, G. (1) 27} 32
Jungnickel, D.,seeGuKntzer, M.M. (2) 55} 66
Konana, P.,seeSanchez, S.M. (2) 81} 89
Koulamas, C. and G.J. Kyparisis, Scheduling on uniform parallel machines to minimize
maximum lateness (4) 175}179
Kyparisis, G.J.,seeKoulamas, C. (4) 175}179
Lawphongpanich, S., Simplicial with truncated Dantzig}Wolfe decomposition for
non-linear multicommodity network#ow problems with side constraints (1) 33} 41
Elsevier Science B.V.
Luebke, E. and J.S. Provan, On the structure and complexity of the 2-connected Steiner
network problem in the plane (3) 111}116
Luna, H.P.L. and P. Mahey, Bounds for global optimization of capacity expansion and
#ow assignment problems (5) 211}216
Mahey, P.,seeLuna, H.P.L. (5) 211}216
MuKller, A., On the waiting times in queues with dependency between interarrival and
service times (1) 43} 47
Olson, M.P.,seeBrown, G.G. (3) 117}126
Onn, S.,seeHwang, F.K. (4) 159}163
Perry, D. and M.J.M. Posner, A correlated M/G/1-type queue with randomized server
repair and maintenance modes (3) 137}147
Posner, M.J.M.,seePerry, D. (3) 137}147
Potts, C.N.,seeSidney, J.B. (4) 165}173
Provan, J.S.,seeLuebke, E. (3) 111}116
Rothblum, U.G.,seeHwang, F.K. (4) 159}163
Salama, Y., Optimal control of a simple manufacturing system with restarting costs (1) 9} 16 Sanchez, S.M. and P. Konana, E$cient data allocation for frequency domain
experi-ments (2) 81} 89
Sciandrone, M.,seeGrippo, L. (3) 127}136
Seila, A.F.,seeZheng, S. (5) 231}235
Sgall, J.,seeEpstein, L. (1) 17} 22
Sherali, H.D., G. Choi and C.H. Tuncbilek, A variable target value method for
nondif-ferentiable optimization (1) 1} 8
Sidney, J.B., C.N. Potts and C. Sriskandarajah, A heuristic for scheduling two-machine
no-wait#ow shops with anticipatory setups (4) 165}173
Sriskandarajah, C.,seeSidney, J.B. (4) 165}173
Strusevich, V.A., Group technology approach to the open shop scheduling problem with
batch setup times (4) 181}192
Sviridenko, M.I., Worst-case analysis of the greedy algorithm for a generalization of the
maximum p-facility location problem (4) 193}197
Teunter, R.H. and E.S. van der Poort, The maximum number of Hamiltonian cycles in
graphs with a"xed number of vertices and edges (2) 91} 98 Thorlund-Petersen, L., Comparison of probability measures: Dominance of the third
degree (5) 237}245
Tijms, H.C. and R. Veldman, A fast algorithm for the transient reward distribution in
continuous-time Markov chains (4) 155}158
Tuncbilek, C.H.,seeSherali, H.D. (1) 1} 8
Van der Poort, E.S.,seeTeunter, R.H. (2) 91} 98
Veldman, R.,seeTijms, H.C. (4) 155}158
Wang, G.,seeCheng, T.C.E. (5) 223}229
Wein, J.M.,seeGoemans, M.X. (4) 149}154
Williamson, D.P.,seeGoemans, M.X. (4) 149}154
Woeginger, G.J., A comment on scheduling on uniform machines under chain-type
precedence constraints (3) 107}109
Wong, C.K.,seeZhang, G. (5) 217}222
Zhang, G., X. Cai and C.K. Wong, Linear time-approximation algorithms for bin
packing (5) 217}222
