1. Roof duality, complementation and persistency in quadratic 0–1 optimization

   • P. L. Hammer
   • P. Hansen
   • B. Simeone

   OriginalPaper Pages: 121 - 155

2. On the cost of computing roots of polynomials

   • Harold W. Kuhn
   • Zeke Wang
   • Senlin Xu

   OriginalPaper Pages: 156 - 163

3. Computational complexity of a piecewise linear homotopy algorithm

   • R. Saigal

   OriginalPaper Pages: 164 - 173

4. Sensitivity analysis for the asymmetric network equilibrium problem

   • Stella Dafermos
   • Anna Nagurney

   OriginalPaper Pages: 174 - 184

5. Two kinds of normality in vector optimization

   • J. M. Borwein
   • J. W. Nieuwenhuis

   OriginalPaper Pages: 185 - 191

6. A unifying model based on retraction for fixed point algorithms

   • Yoshitsugu Yamamoto

   OriginalPaper Pages: 192 - 197

7. Worst-case analysis of greedy algorithms for the subset-sum problem

   • Silvano Martello
   • Paolo Toth

   OriginalPaper Pages: 198 - 205

8. An economic model of short-rotation forestry

   • Robert F. Giese
   • Philip C. Jones

   OriginalPaper Pages: 206 - 217

9. Analysis of a linearization heuristic for single-machine scheduling to maximize profit

   • Marshall L. Fisher
   • Abba M. Krieger

   OriginalPaper Pages: 218 - 225

10. Pseudolinearity and efficiency

    • Kim Lin Chew
    • Eng Ung Choo

    OriginalPaper Pages: 226 - 239

11. Announcement

    Notice Pages: 240 - 240

12. Call for nominations: The 1983 Lanchester Prize

    Notice Pages: 241 - 242