External Links

    Journal: Math. Program.

    Volume 32, Issue 3

    249 -- 277Tom M. Cavalier, Hanif D. Sherali. Sequential location-allocation problems on chains and trees with probabilistic link demands
    278 -- 300Ury Passy, Eliezer Z. Prisman. A convex-like duality scheme for quasi-convex programs
    301 -- 318James Renegar. On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
    319 -- 336James Renegar. On the cost of approximating all roots of a complex polynomial
    337 -- 356Ian D. Coope, G. Alistair Watson. A projected lagrangian algorithm for semi-infinite programming
    357 -- 365Uriel G. Rothblum. Ratios of affine functions
    366 -- 370Richard Engelbrecht-Wiggans, Daniel Granot. On market prices in linear production games

    Volume 32, Issue 2

    123 -- 0Kenneth J. Arrow, George B. Dantzig, Alan Manne. In memory of Tjalling C. Koopmans
    125 -- 145Dimitri P. Bertsekas. A unified framework for primal-dual methods in minimum cost network flow problems
    146 -- 164Robert G. Jeroslow. The polynomial hierarchy and a simple model for competitive analysis
    165 -- 182Uwe H. Suhl. Solving large-scale mixed-integer programs with fixed charge variables
    183 -- 198Alexander V. Karzanov. Metrics and undirected cuts
    199 -- 223Jonathan E. Spingarn. Applications of the method of partial inverses to convex programming: Decomposition
    224 -- 231Ya-Xiang Yuan. An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximations
    232 -- 237Richard H. Byrd. An example of irregular convergence in some constrained optimization methods that use the projected hessian
    238 -- 241George Morton, Rabe von Randow, Karl Ringwald. A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory
    242 -- 246Jerzy Kyparisis. On uniqueness of Kuhn-Tucker multipliers in nonlinear programming

    Volume 32, Issue 1

    1 -- 10James B. Orlin, Uriel G. Rothblum. Computing optimal scalings by parametric network algorithms
    11 -- 31Gerald G. Brown, Richard D. McBride, R. Kevin Wood. Extracting embedded generalized networks from linear programming problems
    32 -- 40Olvi L. Mangasarian, L. McLinden. Simple bounds for solutions of monotone complementarity problems and convex programs
    41 -- 68D. Le. A fast and robust unconstrained optimization method requiring minimum storage
    69 -- 89Robert S. Womersley. Local properties of algorithms for minimizing nonsmooth composite functions
    90 -- 99Nicholas I. M. Gould. On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem
    100 -- 113Rafael Lazimy. Improved algorithm for mixed-integer quadratic programs and a computational study
    114 -- 117Bernd Jeromin, Frank Körner. On the refinement of bounds of heuristic algorithms for the traveling salesman problem
    runs on