External Links

    Journal: Math. Program.

    Volume 33, Issue 2

    123 -- 138Yoshiro Ikura, George L. Nemhauser. Simplex pivots on the set packing polytope
    139 -- 145Robert M. Freund, James B. Orlin. On the complexity of four polyhedral set containment problems
    146 -- 161Kenneth O. Kortanek, H. M. Strojwas. On constraint sets of infinite linear programs over ordered fields
    162 -- 171Jonathan Goodman. Newton's method for constrained optimization
    172 -- 186Philip E. Gill, Walter Murray, Michael A. Saunders, G. W. Stewart, Margaret H. Wright. Properties of a representation of a basis for the null space
    187 -- 203Donald Goldfarb. Efficient dual simplex algorithms for the assignment problem
    204 -- 233Robert Fourer. A simplex algorithm for piecewise-linear programming I: Derivation and proof
    234 -- 241A. Warburton. Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems
    runs on