Sequential location-allocation problems on chains and trees with probabilistic link demands Tom M. CavalierHanif D. Sherali OriginalPaper Pages: 249 - 277
A convex-like duality scheme for quasi-convex programs U. PassyE. Z. Prisman OriginalPaper Pages: 278 - 300
On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials James Renegar OriginalPaper Pages: 301 - 318
On the cost of approximating all roots of a complex polynomial James Renegar OriginalPaper Pages: 319 - 336
A projected lagrangian algorithm for semi-infinite programming I. D. CoopeG. A. Watson OriginalPaper Pages: 337 - 356
On market prices in linear production games Richard Engelbrecht-WiggansDaniel Granot OriginalPaper Pages: 366 - 370