External Links

    Journal: Math. Program.

    Volume 39, Issue 3

    231 -- 239Robert E. Bixby, Odile M.-C. Marcotte, Leslie E. Trotter Jr.. Packing and covering with integral feasible flows in integral supply-demand networks
    241 -- 252T. M. Doup, Gerard van der Laan, A. J. J. Talman. n+1-2)-ray algorithm: A new simplicial algorithm to compute economic equilibria
    253 -- 261Aparna Ramanathan, Charles J. Colbourn. Counting almost minimum cutsets with reliability applications
    263 -- 284Anantaram Balakrishnan. LP extreme points and cuts for the fixed-charge network design problem
    285 -- 304Jerzy Kyparisis, Anthony V. Fiacco. Generalized convexity and concavity of the optimal value function in nonlinear programming
    305 -- 317Yinyu Ye, Masakazu Kojima. Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
    319 -- 335Christian Michelot, Odile Lefebvre. A primal-dual algorithm for the fermat-weber problem involving mixed gauges
    337 -- 0Marco A. Duran, Ignacio E. Grossmann. An outer-approximation algorithm for a class of mixed-integer nonlinear programs
    339 -- 0Michel L. Balinski. Nominations for 1988 elections

    Volume 39, Issue 2

    117 -- 129Katta G. Murty, Santosh N. Kabadi. Some NP-complete problems in quadratic and nonlinear programming
    131 -- 155Leon S. Lasdon, John C. Plummer, B. Buehler, Allan D. Waren. Optimal design of efficient acoustic antenna arrays
    157 -- 179Peter L. Jackson, David F. Lynch. Revised dantzig-wolfe decomposition for staircase-structured linear programs
    181 -- 188Immo Diener. On the global convergence of path-following methods to determine all solutions to a system of nonlinear equations
    189 -- 205A. B. Poore, C. A. Tiahrt. Bifurcation problems in nonlinear parametric programming
    207 -- 214Marc E. Posner, Hisatoshi Suzuki. A dual approach for the continuous collapsing knapsack problem
    215 -- 228Monique Guignard, Siwhan Kim. Lagrangean decomposition: A model yielding stronger lagrangean bounds

    Volume 39, Issue 1

    1 -- 20John E. Dennis Jr., A. M. Morshedi, Kathryn Turner. A variable-metric variant of the Karmarkar algorithm for linear programming
    21 -- 25R. Chandrasekaran, Jong-Shi Pang, Richard E. Stone. Two counterexamples on the polynomial solvability of the linear complementarity problem
    27 -- 56Alexander H. G. Rinnooy Kan, G. T. Timmer. Stochastic global optimization methods part I: Clustering methods
    57 -- 78Alexander H. G. Rinnooy Kan, G. T. Timmer. Stochastic global optimization methods part II: Multi level methods
    79 -- 92Guy de Ghellinck, Jean-Philippe Vial. An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex
    93 -- 116Paul H. Calamai, Jorge J. Moré. Projected gradient methods for linearly constrained problems
    runs on