Packing rooted directed cuts in a weighted directed graph D. R. Fulkerson OriginalPaper Pages: 1 - 13
An extension of the frank and Wolfe method of feasible directions Charles A. Holloway OriginalPaper Pages: 14 - 27
A nonlinear programming approach to a very large hydroelectric system optimization C. R. GagnonR. H. HicksJ. S. Kowalik OriginalPaper Pages: 28 - 41
On pricing and backward transformation in linear programming J. A. Tomlin OriginalPaper Pages: 42 - 47
Properties of vertex packing and independence system polyhedra G. L. NemhauserL. E. Trotter Jr. OriginalPaper Pages: 48 - 61
Validation of subgradient optimization Michael HeldPhilip WolfeHarlan P. Crowder OriginalPaper Pages: 62 - 88
Trivial integer programs unsolvable by branch-and-bound R. G. Jeroslow Short Communication Pages: 105 - 109
On “a cofferdam design optimization” John J. DinkelGary A. Kochenberger Short Communication Pages: 114 - 116
Implicit function theorems for mathematical programming and for systems of inequalities James H. BigelowNorman Z. Shapiro OriginalPaper Pages: 141 - 156
Modified regularity conditions for nonlinear programming problems over mixed cone domains V. A. Sposito OriginalPaper Pages: 167 - 179
Improved penalty calculations for a mixed integer branch-and-bound algorithm Ronald D. ArmstrongPrabhakant Sinha OriginalPaper Pages: 212 - 223
Scheduling activities among conflicting facilities to minimize conflict cost F. E. DavisM. D. DevineR. P. Lutz Short Communication Pages: 224 - 228
A simplicial algorithm for the nonlinear complementarity problem M. L. FisherF. J. Gould OriginalPaper Pages: 281 - 300
Computational experience in sensitivity analysis for nonlinear programming Robert L. ArmacostAnthony V. Fiacco OriginalPaper Pages: 301 - 326
Classes of functions and feasibility conditions in nonlinear complementarity problems Jorge J. Moré OriginalPaper Pages: 327 - 338
Distribution functions in stochastic programs with recourse: A parametric analysis Stanley J. Garstka OriginalPaper Pages: 339 - 351
A note on column generation in Dantzig—Wolfe decomposition algorithms Cary Swoveland Short Communication Pages: 365 - 370
