Table Of Content

Mathematical Programming 78 (1997) 397-398 Author Index Volume 78 Ahuja, R.K. see Sokkalingam, P.T. 78 (19971)4 9 Antipin, A.S. see Flam, S.D. 78 (1997) 29 Armstrong, R.D. and Z. Jin, A new strongly polynomial dual network simplex algorithm 78 (19971)3 1 Balas, E. and M. Fischetti, On the monotonization of polyhedra 78 (1997) 59 Boland, N.L., A dual-active-set algorithm for positive semi-definite quadratic programming 78 (1997) 1 Brunetta, L., M. Conforti and G. Rinaldi, A branch-and-cut algorithm for the equicut problem 78 (1997) 243 Buchanan, J.T. see Henig, M.I. 78 (1997) 357 Cambini, R., G. Gallo and M.G. Scutella, Flows on hypergraphs 78 (1997) 195 Chen, W. see Goldfarb, D. 78 (1997) 159 Christou, I. see Yackel, J. 78 (1997) 283 Conforti, M. see Brunetta, L. 78 (1997) 243 Crouzeix, J.-P., Pseudomonotone variational inequality problems: Existence of solutions 78 (1997) 305 Fischetti, M. see Balas, E. 78 (1997) 59 Flim, S.D. and A.S. Antipin, Equilibrium programming using proximal-like algorithms 78 (1997) 29 Gallo, G. and M.D. Grigoriadis, Network Optimization: Algorithms and Applications 78 (1997) 105 Gallo, G. see Cambini, R. 78 (1997) 195 Goldfarb, D. and W. Chen, On strongly polynomial dual simplex algorithms for the maximum flow problem 78 (1997) 159 Grigoriadis, M.D. see Gallo, G. 78 (1997) 105 Grippo, L. and S. Lucidi, A globally convergent version of the Polak—Ribiére conjugate gradient method 78 (1997) 375 Grétschel, M., A. Martin and R. Weismantel, The Steiner tree packing problem in VLSI design 78 (1997) 265 Henig, M.I. and J.T. Buchanan, Tradeoff directions in multiobjective optimization problems 78 (1997) 357 Jansen, B., K. Roos, T. Terlaky and A. Yoshise, Polynomiality of primal—dual affine scaling algorithms for nonlinear complementarity problems 78 (1997) 315 Jin, Z. see Armstrong, R.D. 78 (1997) 131 Karzanov, A.V., Multiflows and disjoint paths of minimum total cost 78 (19972)1 9 Lucidi, S. see Grippo, L. 78 (1997) 375 Martin, A. see Grdtschel, M. 78 (1997) 265 McCormick, S.T., How to compute least infeasible flows 78 (1997) 179 Meyer, R.R. see Yackel, J. 78 (1997) 283 Monteiro, R.D.C. and P.R. Zanjécomo, A note on the existence of the Alizadeh—Haeberly— Overton direction for semidefinite programming 78 (1997) 393 Orlin, J.B., A polynomial time primal network simplex algorithm for minimum cost flows 78 (1997) 109 Peng, J.-M., Equivalence of variational inequality problems to unconstrained minimization 78 (1997) 347 Radzik, T., Fast deterministic approximation for the multicommodity flow problem 78 (1997) 43 Rinaldi, G. see Brunetta, L. 78 (1997) 243 Roos, K. see Jansen, B. 78 (1997) 315 Scutella, M.G. see Cambini, R. 78 (1997) 195 Sharma, P. see Sokkalingam, P.T. 78 (1997) 149 398 Author Index Volume 78 Sokkalingam, P.T., P. Sharma and R.K. Ahuja, A new pivot selection rule for the network simplex algorithm 78 (1997) 149 Tarjan, R.E., Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm 78 (1997) 169 Terlaky, T. see Jansen, B. 78 (1997) 315 Weismantel, R. see Grodtschel, M. 78 (1997) 265 Yackel, J., R.R. Meyer and I. Christou, Minimum-perimeter domain assignment 78 (1997) 283 Ye, Y., Complexity analysis of the analytic center cutting plane method that uses multiple cuts 78 (1997) 85 Yoshise, A. see Jansen, B. 78 (1997) 315 Zanjacomo, P.R. see Monteiro, R.D.C. 78 (1997) 393