Optimum matching forests III: Facets of matching forest polyhedra Rick Giles OriginalPaper Pages: 39 - 51
On the use of penumbras in blocking and antiblocking theory Jørgen TindLaurence A. Wolsey OriginalPaper Pages: 71 - 81
On optimality conditions for structured families of nonlinear programming problems J. E. Spingarn OriginalPaper Pages: 82 - 92
On the non-polynomiality of the relaxation method for systems of linear inequalities J. L. Goffin OriginalPaper Pages: 93 - 103
Axiomatic approach to statistical models and their use in multimodal optimization theory A. Žilinskas OriginalPaper Pages: 104 - 116
Boolean sublattices connected with minimization problems on matroids Masataka Nakamura Short Communication Pages: 117 - 120
On the structure of all minimum cuts in a network and applications Jean-Claude PicardMaurice Queyranne Notice Pages: 121 - 121
A stochastic method for global optimization C. G. E. BoenderA. H. G. Rinnooy KanL. Stougie OriginalPaper Pages: 125 - 140
Finite checkability for integer rounding properties in combinatorial programming problems S. BaumL. E. Trotter Jr. OriginalPaper Pages: 141 - 147
On the computational utility of posynomial geometric programming solution methods J. E. FattlerG. V. ReklaitisK. M. Ragsdell OriginalPaper Pages: 163 - 201
A method of centers algorithm for certain minimax problems Robin W. Chaney OriginalPaper Pages: 202 - 226
A polynomial algorithm for integer programming covering problems satisfying the integer round-up property James B. Orlin Short Communication Pages: 231 - 235
Call for papers: Fourth Symposium on Mathematical Programming with Data Perturbations Notice Pages: 238 - 238
Convergence of a cyclic ellipsoid algorithm for systems of linear equalities J. L. Goffin OriginalPaper Pages: 239 - 260
Evaluating computational efficiency: A stochastic approach Regina Benveniste OriginalPaper Pages: 261 - 287
Partial pivoting strategies for symmetric gaussian elimination Achiya Dax OriginalPaper Pages: 288 - 303
Polynomially bounded algorithms for locatingp-centers on a tree R. ChandrasekaranA. Tamir OriginalPaper Pages: 304 - 315
Decomposition algorithms for locating minimal cuts in a network John J. JarvisSuleyman Tufekci OriginalPaper Pages: 316 - 331
An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs Daniel GranotFrieda GranotWillem Vaessen Short Communication Pages: 350 - 357