Computing optimal scalings by parametric network algorithms J. B. OrlinU. G. Rothblum OriginalPaper Pages: 1 - 10
Extracting embedded generalized networks from linear programming problems Gerald G. BrownRichard D. McBrideR. Kevin Wood OriginalPaper Pages: 11 - 31
Simple bounds for solutions of monotone complementarity problems and convex programs O. L. MangasarianL. McLinden OriginalPaper Pages: 32 - 40
A fast and robust unconstrained optimization method requiring minimum storage D. Le OriginalPaper Pages: 41 - 68
Local properties of algorithms for minimizing nonsmooth composite functions R. S. Womersley OriginalPaper Pages: 69 - 89
On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem Nicholas I. M. Gould OriginalPaper Pages: 90 - 99
Improved algorithm for mixed-integer quadratic programs and a computational study Rafael Lazimy OriginalPaper Pages: 100 - 113
On the refinement of bounds of heuristic algorithms for the traveling salesman problem Bernd JerominFrank Körner Short Communication Pages: 114 - 117