External Links

    Journal: Math. Program.

    Volume 26, Issue 3

    245 -- 286R. Tyrrell Rockafellar. Marginal values and second-order necessary conditions for optimality
    287 -- 294Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank. Halin graphs and the travelling salesman problem
    295 -- 315Byong-Hun Ahn. Iterative methods for linear complementarity problems with upperbounds on primary variables
    316 -- 325John R. Birge, Akli Gana. Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's
    326 -- 344Ralph E. Steuer, Eng Ung Choo. An interactive weighted Tchebycheff procedure for multiple objective programming
    345 -- 362Toshihide Ibaraki. Parametric approaches to fractional programs

    Volume 26, Issue 2

    123 -- 143Gilbert Strang. Maximal flow through a domain
    144 -- 152Kaoru Tone. Revisions of constraint approximations in the successive QP method for nonlinear programming problems
    153 -- 171S. Thomas McCormick. Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
    172 -- 181W. B. van Dam, J. B. G. Frenk, Jan Telgen. Randomly generated polytopes for testing mathematical programming algorithms
    182 -- 189William H. Cunningham, John G. Klincewicz. On cycling in the network simplex method
    190 -- 212Ron S. Dembo, Trond Steihaug. Truncated-newtono algorithms for large-scale unconstrained optimization
    213 -- 231Pierre Loridan, Jacqueline Morgan. Penalty functions in ε-programming and ε-minimax problems
    232 -- 237Sándor Komlósi. Some properties of nondifferentiable pseudoconvex functions
    238 -- 242Paul H. Zipkin, K. Raimer. An improved disaggregation method for transportation problems

    Volume 26, Issue 1

    1 -- 20Michael J. Todd. Large-scale linear programming: Geometry, working bases and factorizations
    21 -- 39Robert R. Meyer. Computational aspects of two-segment separable programming
    40 -- 47Stella Dafermos. An iterative scheme for variational inequalities
    48 -- 63R. Kipp Martin, Dennis J. Sweeney. An ideal column algorithm for integer programs with special ordered sets of variables
    64 -- 75Patricia J. Carstensen. Complexity of some parametric integer and network programming problems
    76 -- 86Marc E. Posner. The continuous collapsing Knapsack problem
    87 -- 99Stephen J. Grotzinger. 1-supports, natural and Chebyshev approximates
    100 -- 108Gur Huberman. Error bounds for the aggregated convex programming problem
    109 -- 116S. Halfin. The sphere method and the robustness of the ellipsoid algorithm
    runs on