Simplex pivots on the set packing polytope Yoshiro IkuraGeorge L. Nemhauser OriginalPaper Pages: 123 - 138
On the complexity of four polyhedral set containment problems Robert M. FreundJames B. Orlin OriginalPaper Pages: 139 - 145
On constraint sets of infinite linear programs over ordered fields K. O. KortanekH. M. Strojwas OriginalPaper Pages: 146 - 161
Properties of a representation of a basis for the null space Philip E. GillWalter MurrayMargaret H. Wright OriginalPaper Pages: 172 - 186
Efficient dual simplex algorithms for the assignment problem D. Goldfarb OriginalPaper Pages: 187 - 203
A simplex algorithm for piecewise-linear programming I: Derivation and proof Robert Fourer OriginalPaper Pages: 204 - 233
Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems A. Warburton OriginalPaper Pages: 234 - 241
