Operations Research Letters 12 (1992) 349-351 November 1992 North-Holland Author Index to Volume 12 (1992) The issue number is given in front of the page numbers Abate, J. and W. Whitt, Numerical inversion of probability generating functions (4) 245-251 Abate, J. and W. Whitt, Solving probability transform functional equations for numerical inversion (5) 275-281 Antunes, C.H. and J.N. Climaco, Sensitivity analysis in MCDM using the weight space (3) 187-196 Arian, Y. and Y. Levy, Algorithms for generalized round robin routing (S) 313-319 Armstrong, R.D. and Z. Jin, Solving linear bottleneck assignment problems via strong spanning trees (4) 179-199 Badrinath, V., see Mazumdar, R.R. (4) 263-270 Barahona, F., Separating from the dominant of the spanning tree polytope (4) 201-203 Bastian, M. and M. Volkmer, A perfect forward procedure for a single facility dynamic location / relocation problem (1) 11- 16 Billionnet, A. and A. Sutter, An efficient algorithm for the 3-satisfiability problem (1) 29- 36 Browne, S. and G. Weiss, Dynamic priority rules when polling with multiple parallel servers (3) 129-137 Cardoso, D.M. and J.C.N. Climaco, The generalized simplex method (5) 337-348 Chen, F. and Y.-S. Zheng, Waiting time distribution in (7, S) inventory systems (3) 145-151 Cheng, D.W., Second order properties in a tandem queue with general blocking (3) 139-144 Chu, C., Efficient heuristics to minimize total flow time with release dates (5) 321-330 Climaco, J.C.N., see Cardoso, D.M. (5) 337-348 Climaco, J.N., see Antunes, C.H. (3) 187-196 den Hertog, D., C. Roos and T. Terlaky, A build-up variant of the logarithmic barrier method for LP (3) 181-186 Fulop, J. and M. Prill, On the minimax approximation in the class of the univariate piecewise constant functions (S) 307-312 Gallego, G., D. Shaw and D. Simchi-Levi, The complexity of the staggering problem, and other classical inventory problems (1) 47- 52 Grover, L.K., Local search and the local structure of NP-complete problems (4) 235-243 Guillemin, F., see Mazumdar, R.R. (4) 263-270 Gulledge, T.R., see Ringuest, J.L. (1) 53- 58 Gupta, D., On the economic lot scheduling problem with backlogging: The common cycle approach (2) 101-109 Hasegawa, T., see Takine, T. (2) 97- 81 Hassin, R., Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (4) 227-233 Hellstrand, J., T. Larsson and A. Migdalas, A characterization of the uncapacitated network design polytope (3) 159-163 Hwang, F.K. and U.G. Rothblum, Generalization of an engineering principle (4) 197-199 Jin, Z., see Armstrong, R.D. (4) 179-199 Kalvelagen, E. and H. Tijms, ORSTAT: Software for operations research and statis- tics (2) 125-127 Kamburowski, J., Bounding the distribution of project duration in PERT networks (1) 17- 22 Kannurpatti, R., see Mazumdar, R.R. (4) 263-270 Keil, J.M., On the complexity of scheduling tasks with discrete starting times (5) 293-295 Kohli, R. and R. Krishnamurti, A total-value greedy heuristic for the integer knapsack problem (2) 65- 71 Krishnamurti, R., see Kohli, R. (2) 65- 71 Kumar, A., On the average idle time and average queue length estimates in an M/M/1 queue (3) 153-157 0167-6377 /92/$05.00 © 1992, Elsevier Science Publishers B.V. All rights reserved Volume 12, Number 5 OPERATIONS RESEARCH LETTERS November 1992 Larsson, T., see Hellstrand, J. (3) 159-163 Levy, Y., see Arian, Y. (5) 313-319 Loulou, R., Minimal cut cover of a graph with an application to the testing of electronic boards (S) 301-305 Magirou, V.F., An improved partial solution to the task assignment and multiway cut problems (1) 3- 10 Manber, U., see Wu, S. (3) 173-178 Masuda, Y., see Sumita, U. (1) 37- 45 Mazumdar, R.R., F. Guillemin, V. Badrinath and R. Kannurpatti, On pathwise behavofi qouerue s (4) 263-270 Migdalas, A., see Hellstrand, J. (3) 159-163 Min, K.J., Inventory and pricing policies under competition (4) 253-261 Mizuno, S. and A. Nagasawa, Strict monotonicity in Todd’s low-complexity algorithm for linear programming (1) 59- 64 Mulvey, J.M. and A. Ruszczynski, A diagonal quadratic approximation method for large scale linear programs (4) 205-215 Nagasawa, A., see Mizuno, S. (1) 59- 64 Nagurney, A., see Thore, S. (4) 217-226 Neme, A. and L. Quintas, Nash equilibrium strategies in repeated games with and without cost of implementation (2) 111-115 Ohi, F. and F. Proschan, Crossing properties of reliability functions (2) 79- 81 Pan, J., see Thore,S . (4) 217-226 Paolucci, M. and R. Pesenti, Assessing a new utility/cost function for multiattribute decision making (5) 331-336 Perttunen, J., On the solving strategy in composite heuristics (3) 165-172 Pesenti, R., see Paolucci, M. (5) 331-336 Prill, M., see Fulop, J. (5) 307-312 Proschan, F., see Ohi, F. (2) 79- 81 Punnen, A.P., Traveling salesman problem under categorization (2) 89- 95 Quintas, L., see Neme, A. (2) 111-115 Ringuest, J.L. and T.R. Gulledge, An interactive multi-objective gradient search (1) 53- 58 Rispoli, F.J., An O(n) bound for the diameter of transshipment polytopes (S) 297-299 Rispoli, F.J., The monotonic diameter of the perfect matching and shortest path polytopes (1) 23- 27 Roos, C., see den Hertog, D. (3) 181-186 Rothblum, U.G., see Hwang, F.K. (4) 197--199 Ruszczynski, A., see Mulvey, J.M. (4) 205-215 Salowe, J.S., A simple proof of the planar rectilinear Steiner ratio (4) 271-274 Shaw, D., see Gallego, G. (1) 47- 52 Sierksma, G. and G.A. Tijssen, Faces with large diameter on the symmetric traveling salesman polytope (2) 73- 77 Simchi-Levi, D., see Gallego, G. (1) 47- 52 Sumita, U. and Y. Masuda, Analysis of multivariate Markov modulated Poisson processes (1) 37- 45 Sutter, A., see Billionnet, A. (1) 29- 36 Takine, T. and T. Hasegawa, A generalization of the decomposition property in the M/G/1 queue with server vacations (2) 97- 81 Terlaky, T., see den Hertog, D. (3) 181-186 Thore, S., A. Nagurney and J. Pan, Generalized goal programming and variational inequalities (4) 217-226 Tijms, H., see Kalvelagen, E. (2) 125-127 Tijssen, G.A., see Sierksma, G. (2) 73- 77 Tsai, L.-H., Sequencing to minimize the maximum renewal cumulative cost (2) 117-124 van Dijk, N.M., Uniformization for nonhomogeneous Markov chains (5S) 283-291 Vial, J.-P., A projective algorithm for linear programming with no regularity condition (1) 1- 2 Volkmer, M., see Bastian, M. (1) 11- 16 Weiss, G., see Browne, S. (3) 129-137 Whitt, W., see Abate, J. (4) 245-251 Whitt, W., see Abate, J. (S) 275-281 Williamson, D.P., Analysis of the Held-Karp lower bound for the asymmetric TSP (2) 83- 88 Volume 12, Number 5 OPERATIONS RESEARCH LETTERS November 1992 Wu, S. and U. Manber, An algorithm for min-cost edge-disjoint cycles and its applications (3) 173-178 Zheng, Y.-S., see Chen, F. (3) 145-151