Operations Research Letters 1992: Vol 11 Index

3 Pages·1992·0.71 MB·English

Operations Research Letters 11 (1992) 329-331
June 1992
North-Holland
Author Index to Volume 11 (1992)
The issue number is given in front of the page numbers
Aghezzaf, E.H. and L.A. Wolsey, Lot-sizing polyhedra with a cardinality constraint (1) 13- 18
Anstreicher, K.M., On interior algorithms for linear programming with no regularity
assumptions (4) 209-212
Barbosa, V.C., see de Carvalho, L.A.V. (3) 141-145
Baxter, L.A. and F. Harche, On the optimal assembly of series—parallel systems (3) 153-157
Birge, J.R., R.M. Freund and R. Vanderbei, Prior reduced fill-in in solving equations
in interior point algorithms (4) 195-198
Bollobas, B. and A. Meir, A travelling salesman problem in the k-dimensional unit
cube (1) 19- 22
Buzacott, J.A., see Liu, X.-G. (4) 233-242
Carlson, R.C., see Kouvelis, P. (1) 61- 65
Cavazos-Cadena, R. and L.I. Sennott, Comparing recent assumptions for the existence
of average optimal stationary policies (1) 33- 37
Chern, M.-S., On the computational complexity of reliability redundancy allocation in
a series system (5) 309-315
Csirik, J.. H. Kellerer and G. Woeginger, The exact LPT-bound for maximizing the
minimum completion time (5) 281-287
de Carvalho, L.A.V. and V.C. Barbosa, Fast linear system solution by neural networks (3) 141-145
Felten, E.W., see Martin, O. (4) 219-224
Fishman, G.S. and D.S. Rubin, Bounding the variance in Monte Carlo experiments (4) 243-248
Freund, R.M., see Birge, J.R. (4) 195-198
Gal, T. and F. Geue, A new pivoting rule for solving various degeneracy problems (1) 23- 32
Gallego, G., A minmax distribution free procedure for the (Q, R) inventory model (1) 55- 60
Gautier, A. and F. Granot, A parametric analysis of a nonlinear asset allocation
management model (5) 273-279
Geue, F., see Gal, T. (1) 23- 32
Ghosh, M.K. and S.I. Marcus, On strong average optimality of markov decision
processes with unbounded costs (2) 99-104
Granot, D. and D. Zuckerman, Training and job search in the labor market (2) 87- 92
Granot, F. and M. Penn, On the integral plane two-commodity flow problem (3) 135-140
Granot, F., see Gautier, A. (S) 273-279
Gyetvan, F. and Y. Shi, Weak duality theorem and complementary slackness theorem
for linear matrix programming problems (4) 249-252
Harche, F., see Baxter, L.A. (3) 153-157
Haviv, M. and M.L. Puterman, Estimating the value of a discounted reward process (S) 267-272
Hoogeveen, J.A. and S.L. van de Velde, A new lower bound approach for single-ma-
chine multicriteria scheduling (1) 39- 44
Hu, J.-Q., Variance properties of sample path derivatives of parametric random
variables (1) 47- 54
Huang, S., see Zhu, J. (5) 289-291
JackP.Ls., oseen Tu,nce l, L. (4) 255-259
Jha, S., see Pardalos, P.M. (2) 119-123
Kalantari, B., Generalization of Karmarkar’s algorithm to convex homogeneous func-
tions (2) 93- 98
Kellerer, H., see Csirik, J. (S) 281-287
Kogan, Y., Another approach to asymptotic expansions for large closed queueing
networks (S) 317-321
0167-6377 /92/$05.00 © 1992, Elsevier Science Publishers B.V. All rights reserved 329
Volume 11, Number 5 OPERATIONS RESEARCH LETTERS June 1992
Kouvelis, P. and R.C. Carlson, Total unimodularity applications in bi-objective dis-
crete optimization (1) 61- 65
Larsen, C. and J. Tind, Lagrangean duality for facial programs with applications to
integer and complementarity problems (5) 293-301
Laurent, M. and A. Sassano, A characterization of knapsacks with the max-flow—min-
cut property (2) 105-110
Lee, C.-Y. and R. Uzsoy, A new dynamic programming algorithm for the parallel
machines total weighted completion time problem (2) 73- 75
Li, C.-L., S.T. McCormick and D. Simchi-Levi, On the minimum-cardinality-
bounded-diameter and the bounded-cardinality-minimum-diameter edge addition
problems (5) 303-308
Liu, Q.-S., K. Ohno and U. Sumita, Structural properties of optimal tool replacement
policy in a machining center (3) 179-185
Liu, X.-G. and J.A. Buzacott, The reversibility of cyclic queues (4) 233-242
Luo, Z.-Q. and P. Tseng, On a global error bound for a class of monotone affine
variational inequality problems (3) 159-165
Marcus, S.I., see Ghosh, M.K. (2) 99-104
Margot, F., Quick updates for p-opt TSP heuristics (1) 45- 46
Martin, O., S.W. Otto and E.W. Felten, Large-step Markov chains for the TSP
incorporlaoctal isneagrc h heuristics (4) 219-224
McCormick, S.T., see Li, C.-L. (5) 303-308
Meir, A., see Bollobas, B. (1) 19- 22
Min, K.J., Inventory and quantity discount pricing policies under profit maximization (3) 187-193
Ohno, K., see Liu, Q.-S. (3) 179-185
Otto, S.W., see Martin, O. (4) 219-224
Ou, J. and L.M. Wein, On the improvement from scheduling a two-station queueing
network in heavy traffic (4) 225-232
Pardalos, P.M. and S. Jha, Complexity of uniqueness and local search in quadratic 0-1
programming (2) 119-123
Penn, M., see Granot, F. (3) 135-140
Potts, C.N. and L.N. Van Wassenhove, Approximation algorithms for scheduling a
single machine to minimize total late work (5) 261-266
Prodon, A., Steiner trees with n terminals among n + 1 nodes (3) 125-133
Puterman, M.L., see Haviv, M. (5) 267-272
Queyranne, M. and Y. Wang, On the convex hull of feasible solutions to certain
combinatorial problems Q@) 1-11
Rhee, W.S., see Spaccamela, A.M. (2) 67- 71
Rose, J.S., The newsboy with known demand and uncertain replenishment: Applica-
tions to quality control and container fill (2) 111-117
Rosenkrantz, W.A. and R. Simha, Some theorems on conditional Pasta: A stochastic
integral approach (3) 173-177
Rubin, D.S., see Fishman, G.S. (4) 243-248
Sassano, A., see Laurent, M. (2) 105-110
Scott, C. and C.S. Tang, Separable convex programs with ratio constraints over a
directed tree (3) 147-152
Sen, S., Relaxations for probabilistically constrained programs with discrete random
variables (2) 81- 86
Sennott, L.I., see Cavazos-Cadena, R. (1) 33- 37
Shallcross, D.F., A polynomial algorithm for a one machine batching problem (4) 213-218
Shi, Y., see Gyetvan, F. (4) 249-252
Simchi-Levi, D., see Li, C.-L. (5) 303-308
Simha, R., see Rosenkrantz, W.A. (3) 173-177
Spaccamela, A.M., W.S. Rhee, L. Stougie and S. van de Geer, Probabilistic analysis of
the minimum weighted flowtime scheduling problem (2) 67- 71
Stadje, W. and D. Zuckerman, Optimal repair policies with general degree of repair in
two maintenance models (2) 77- 80
Stougie, L., see Spaccamela, A.M. (2) 67- 71
Sumita, U., see Liu, Q.-S. (3) 179-185
Tang, C.S., see Scott, C. (3) 147-152
Tind, J., see Larsen, C. (5) 293-301
Volume 11, Number 5 OPERATIONS RESEARCH LETTERS June 1992
Todd, M.J. and J.-P. Vial, Todd’s low-complexity algorithm is a predictor—corrector
path-following method (4) 199-207
Triantaphyllou, E., A sensitivity analysis of a (t;, S;) inventory policy with increasing
demand (3) 167-172
Tseng, P., see Luo, Z.-Q. (3) 159-165
Tungel, L. and P.L. Jackson, On the convexity of a function related to the Wagner-
Whitin model (4) 255-259
Uzsoy, R., see Lee, C.-Y. (2) 73- 75
van de Geer, S., see Spaccamela, A.M. (2) 67- 71
Vanderbei, R., see Birge, J.R. (4) 195-198
van de Velde, S.L., see Hoogeveen, J.A. (1) 39- 44
van Dijk, N.M., A note on monotonicity results in multicasting (5) 323-328
Van Wassenhove, L.N., see Potts, C.N. (5) 261-266
Vial, J.-P., see Todd, M.J. (4) 199-207
Wang, Y., see Queyranne, M. (1) 1- 11
Wein, L.M., see Ou, J. (4) 225-232
Woeginger, G., see Csirik, J. (S) 281-287
Wolsey, L.A., see Aghezzaf, E.H. (1) 13- 18
Zhu, J. and S. Huang, On the convergence rate of the duality gap in a symmetric
primal—dual potential reduction algorithm (5) 289-291
Zuckerman, D., see Granot, D. (2) 87- 92
Zuckerman, D., see Stadje, W. (2) 77- 80