The alternating basis algorithm for assignment problems R. S. BarrF. GloverD. Klingman OriginalPaper Pages: 1 - 13
Objective function approximations in mathematical programming Arthur M. Geoffrion OriginalPaper Pages: 23 - 37
Simplicial decomposition in nonlinear programming algorithms Balder Von Hohenbalken OriginalPaper Pages: 49 - 68
A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron Manuel J. Carrillo OriginalPaper Pages: 69 - 80
On optimizing certain nonlinear convex functions which are partially defined by a simulation process D. J. HartfielG. L. Curry OriginalPaper Pages: 88 - 93
Generating conjugate directions without line searches using factorized variable metric updating formulas D. Goldfarb OriginalPaper Pages: 94 - 110
A modification of Armijo's step-size rule for negative curvature Garth P. McCormick Short Communication Pages: 111 - 115
Maximizing the minimum source-sink path subject to a budget constraint D. R. FulkersonGary C. Harding Short Communication Pages: 116 - 118
Linear multiple objective programs with zero–one variables Gabriel R. Bitran OriginalPaper Pages: 121 - 139
New algorithms for constrained minimax optimization S. R. K. DuttaM. Vidyasagar OriginalPaper Pages: 140 - 155
A geometric programming approach to the Van der Waerden conjecture on doubly stochastic matrices M. Raghavachari OriginalPaper Pages: 156 - 166
Optimal electric power scheduling: A large nonlinear programming test problem solved by recursive quadratic programming M. C. BiggsM. A. Laughton OriginalPaper Pages: 167 - 182
Multivalued convexity and optimization: A unified approach to inequality and equality constraints J. Borwein OriginalPaper Pages: 183 - 199
Computational aspects of cutting-plane algorithms for geometric programming problems John J. DinkelWilliam H. ElliottGary A. Kochenberger OriginalPaper Pages: 200 - 220
The traveling salesman problem: A duality approach Mokhtar S. BazaraaJamie J. Goode OriginalPaper Pages: 221 - 237
Matrix augmentation and partitioning in the updating of the basis inverse Johannes BisschopAlexander Meeraus OriginalPaper Pages: 241 - 254
Fractional knapsack problems Hiroaki IshiiToshihide IbarakiHisashi Mine OriginalPaper Pages: 255 - 271
On the Bartels—Golub decomposition for linear programming bases D. Goldfarb OriginalPaper Pages: 272 - 279
The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results M. BenichouJ. M. GauthierG. Ribiere OriginalPaper Pages: 280 - 322
Graphic matroids and the multicommodity transportation problem James R. EvansJohn J. JarvisRichard A. Duke OriginalPaper Pages: 323 - 328
Decomposition of arborescent linear programs Markku KallioEvan L. Porteus OriginalPaper Pages: 348 - 356
A note on an open problem in linear complementarity Jong-Shi Pang Short Communication Pages: 360 - 363
A relationship between the second derivatives of a convex function and of its conjugate J. P. Crouzeix Short Communication Pages: 364 - 365
