1. Structures of polyhedra determined by submodular functions on crossing families

   • Satoru Fujishige

   OriginalPaper Pages: 125 - 141

   

2. Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions

   • Satoru Fujishige

   OriginalPaper Pages: 142 - 155

3. Optimization of unconstrained functions with sparse hessian matrices-newton-type methods

   • Mukund N. Thapa

   OriginalPaper Pages: 156 - 186

4. A class of rank-two ellipsoid algorithms for convex programming

   • A. Ech-Cherif
   • J. G. Ecker

   OriginalPaper Pages: 187 - 202

5. Scalarization in vector optimization

   • Johannes JAHN

   OriginalPaper Pages: 203 - 218

6. The pivot and probe algorithm for solving a linear program

   • Awanti P. Sethi
   • Gerald L. Thompson

   OriginalPaper Pages: 219 - 233

7. A note on the computation of an orthonormal basis for the null space of a matrix

   • Thomas F. Coleman
   • Danny C. Sorensen

   OriginalPaper Pages: 234 - 242

8. Duality in generalized linear fractional programming

   • J. -P. Crouzeix
   • J. A. Ferland
   • S. Schaible

   Notice Pages: 243 - 243