External Links

    Journal: Math. Program.

    Volume 28, Issue 3

    243 -- 270Thomas F. Coleman, Jorge J. Moré. Estimation of sparse hessian matrices and graph coloring problems
    271 -- 287Richard T. Wong. A dual ascent approach for steiner tree problems on a directed graph
    288 -- 328Masakazu Kojima, Yoshitsugu Yamamoto. A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
    329 -- 336Shinji Mizuno. An analysis of the solution set to a homotopy equation between polynomials with real coefficients
    337 -- 348Gottfried Tinhofer. Rational solutions of the graphsack problem
    349 -- 362Muhamed Aganagic. Newton's method for linear complementarity problems

    Volume 28, Issue 2

    121 -- 155Peter L. Hammer, Pierre Hansen, Bruno Simeone. Roof duality, complementation and persistency in quadratic 0-1 optimization
    156 -- 163Harold W. Kuhn, Ze-ke Wang, Senlin Xu. On the cost of computing roots of polynomials
    164 -- 173Romesh Saigal. Computational complexity of a piecewise linear homotopy algorithm
    174 -- 184Stella Dafermos, Anna Nagurney. Sensitivity analysis for the asymmetric network equilibrium problem
    185 -- 191Jonathan M. Borwein, J. W. Nieuwenhuis. Two kinds of normality in vector optimization
    192 -- 197Yoshitsugu Yamamoto. A unifying model based on retraction for fixed point algorithms
    198 -- 205Silvano Martello, Paolo Toth. Worst-case analysis of greedy algorithms for the subset-sum problem
    206 -- 217Robert F. Giese, Philip C. Jones. An economic model of short-rotation forestry
    218 -- 225Marshall L. Fisher, Abba M. Krieger. Analysis of a linearization heuristic for single-machine scheduling to maximize profit
    226 -- 239Kim-Lin Chew, Eng Ung Choo. Pseudolinearity and efficiency

    Volume 28, Issue 1

    1 -- 24Gerard van der Laan. On the existence and approximation of zeroes
    25 -- 49Andreas Griewank, Philippe L. Toint. On the existence of convex decompositions of partially separable functions
    50 -- 71Robert Mifflin. Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization
    72 -- 83Jitka Dupacová. Stability in stochastic programming with recourse-estimated parameters
    84 -- 95Rainer Rhode, Reinhard Weber. The range of the efficient frontier in multiple objective linear programming
    96 -- 115Guy Pierra. Decomposition through formalization in a product space
    116 -- 118Takao Fujimoto. An extension of Tarski's fixed point theorem and its application to isotone complementarity problems
    runs on