Implicit representation of generalized variable upper bounds in linear programming Linus Schrage OriginalPaper Pages: 11 - 20
A hybrid approach to discrete mathematical programming Roy E. MarstenThomas L. Morin OriginalPaper Pages: 21 - 40
Large-scale linearly constrained optimization B. A. MurtaghM. A. Saunders OriginalPaper Pages: 41 - 72
On optimality conditions in nondifferentiable programming J. B. Hiriart-Urruty OriginalPaper Pages: 73 - 86
A quadratic network optimization model for equilibrium single commodity trade flows C. Roger Glassey OriginalPaper Pages: 98 - 107
Various definitions of the derivative in mathematical programming — an addendum H. MassamS. Zlobec Short Communication Pages: 108 - 111
Tight bounds for christofides' traveling salesman heuristic G. CornuejolsG. L. Nemhauser Short Communication Pages: 116 - 121
A finite procedure for determining if a quadratic form is bounded below on a closed polyhedral convex set B. Curtis Eaves Short Communication Pages: 122 - 124
Matrix conditioning and nonlinear optimization D. F. ShannoKang -Hoh Phua OriginalPaper Pages: 149 - 160
A class of methods for linear programming Markku KallioEvan L. Porteus OriginalPaper Pages: 161 - 169
Second order characterizations of pseudoconvex functions Mordecai AvrielSiegfried Schaible OriginalPaper Pages: 170 - 185
The computation of a general equilibrium in a public goods economy Donald K. Richter OriginalPaper Pages: 186 - 207
Linearly constrained minimax optimization Kaj MadsenHans Schjær-Jacobsen OriginalPaper Pages: 208 - 223
Algorithms for nonlinear constraints that use lagrangian functions M. J. D. Powell OriginalPaper Pages: 224 - 248
Finding all efficient extreme points for multiple objective linear programs J. G. EckerI. A. Kouada OriginalPaper Pages: 249 - 261
An analysis of approximations for maximizing submodular set functions—I G. L. NemhauserL. A. WolseyM. L. Fisher OriginalPaper Pages: 265 - 294
On the Fermat—Weber problem with convex cost functions F. CordellierJ. Ch. Fiorot OriginalPaper Pages: 295 - 311
The adjacency relation on the traveling salesman polytope is NP-Complete Christos H. Papadimitriou OriginalPaper Pages: 312 - 324
The reformulation of two mixed integer programming problems H. P. Williams OriginalPaper Pages: 325 - 331
Numerically stable methods for quadratic programming Philip E. GillWalter Murray OriginalPaper Pages: 349 - 372
A property of continuous unbounded algorithms Martin GrötschelRabe Von Randow Short Communication Pages: 373 - 377