On the computational behavior of a polynomial-time network flow algorithm Robert G. BlandDavid L. Jensen OriginalPaper Pages: 1 - 39
New scaling algorithms for the assignment and minimum mean cycle problems James B. OrlinRavindra K. Ahuja OriginalPaper Pages: 41 - 56
Characterization of stable matchings as extreme points of a polytope Uriel G. Rothblum OriginalPaper Pages: 57 - 67
Optimal partitions having disjoint convex and conic hulls E. R. BarnesA. J. HoffmanUriel G. Rothblum OriginalPaper Pages: 69 - 86
Extremal points and optimal solutions for general capacity problems H. C. LaiS. Y. Wu OriginalPaper Pages: 87 - 113
Persistency in quadratic 0–1 optimization Alain BillionnetAlain Sutter Short communication Pages: 115 - 119
Local minima for indefinite quadratic knapsack problems Stephen A. Vavasis OriginalPaper Pages: 127 - 153
A barrier function method for minimax problems E. PolakJ. E. HigginsD. Q. Mayne OriginalPaper Pages: 155 - 176
Convergence rates of a global optimization algorithm Regina Hunter Mladineo OriginalPaper Pages: 223 - 232
On the best case performance of hit and run methods for detecting necessary constraints R. J. CaronM. HlynkaJ. F. McDonald OriginalPaper Pages: 233 - 249
Long steps in an O(n 3 L) algorithm for linear programming Kurt M. AnstreicherRobert A. Bosch OriginalPaper Pages: 251 - 265
An interior point potential reduction algorithm for the linear complementarity problem Masakazu KojimaNimrod MegiddoYinyu Ye OriginalPaper Pages: 267 - 279
Crashing a maximum-weight complementary basis Kurt M. AnstreicherJon LeeThomas F. Rutherford OriginalPaper Pages: 281 - 294
A polynomial method of approximate centers for linear programming C. RoosJ. -Ph. Vial OriginalPaper Pages: 295 - 305
Finite dimensional approximation in infinite dimensional mathematical programming Irwin E. SchochetmanRobert L. Smith OriginalPaper Pages: 307 - 333
A time indexed formulation of non-preemptive single machine scheduling problems Jorge P. SousaLaurence A. Wolsey OriginalPaper Pages: 353 - 367