Unified complexity analysis for Newton LP methods James RenegarMichael Shub OriginalPaper Pages: 1 - 16
Partitioned quasi-Newton methods for nonlinear equality constrained optimization Thomas F. ColemanPeter A. Fenyes OriginalPaper Pages: 17 - 44
On an instance of the inverse shortest paths problem D. BurtonPh. L. Toint OriginalPaper Pages: 45 - 61
Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem Franz RendlHenry Wolkowicz OriginalPaper Pages: 63 - 78
Duality in infinite dimensional linear programming H. Edwin RomeijnRobert L. SmithJames C. Bean OriginalPaper Pages: 79 - 97
Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems Masao Fukushima OriginalPaper Pages: 99 - 110
Computing a global optimal solution to a design centering problem V. Hien NguyenJean-Jacques Strodiot OriginalPaper Pages: 111 - 123
The traveling salesman problem in graphs with some excluded minors Jean FonluptDenis Naddef OriginalPaper Pages: 147 - 172
An additive bounding procedure for the asymmetric travelling salesman problem Matteo FischettiPaolo Toth OriginalPaper Pages: 173 - 197
A simplex algorithm for piecewise-linear programming III: Computational analysis and applications Robert Fourer OriginalPaper Pages: 213 - 235
Finding minimum-cost flows by double scaling Ravindra K. AhujaAndrew V. GoldbergRobert E. Tarjan OriginalPaper Pages: 243 - 266
A note on d-stability of convex programs and limiting Lagrangians C. Zălinescu OriginalPaper Pages: 267 - 277
A constrained min‐max algorithm for rival models of the same economic system Berc Rustem OriginalPaper Pages: 279 - 295
Complexity analysis of a linear complementarity algorithm based on a Lyapunov function Paul Tseng OriginalPaper Pages: 297 - 306
Dines—Fourier—Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields B. Curtis EavesUriel G. Rothblum OriginalPaper Pages: 307 - 321
Pure adaptive search in global optimization Zelda B. ZabinskyRobert L. Smith OriginalPaper Pages: 323 - 338
A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure Phan Thien Thach OriginalPaper Pages: 339 - 359
A note on the Frank—Tardos bi-truncation algorithm for crossing-submodular functions Takeshi NaitohSatoru Fujishige Short communication Pages: 361 - 363