1. A new bound for the quadratic assignment problem based on convex quadratic programming

   • Kurt M. Anstreicher
   • Nathan W. Brixius

   Pages: 341 - 357

2. Parallel machine scheduling with high multiplicity

   • John J. Clifford
   • Marc E. Posner

   Pages: 359 - 383

3. On the stability of solutions to quadratic programming problems

   • H.X. Phu
   • N.D. Yen

   Pages: 385 - 394

4. On the p-Median polytope

   • Pasquale Avella
   • Antonio Sassano

   Pages: 395 - 411

5. Error bounds for 2-regular mappings with Lipschitzian derivatives and their applications

   • A.F. Izmailov
   • M.V. Solodov

   Pages: 413 - 435

6. A disjunctive cutting plane procedure for general mixed-integer linear programs

   • Jonathan H. Owen
   • Sanjay Mehrotra

   Pages: 437 - 448

7. On the generic properties of convex optimization problems in conic form

   • Gábor Pataki
   • Levent Tunçel

   Pages: 449 - 457

8. Global optimization of nonconvex factorable programming problems

   • Hanif D. Sherali
   • Hongjie Wang

   Pages: 459 - 478

9. Hesitant adaptive search: the distribution of the number of iterations to convergence

   • G.R. Wood
   • Z.B. Zabinsky
   • B.P. Kristinsdottir

   Pages: 479 - 486

10. The uncapacitated lot-sizing problem with sales and safety stocks

    • Marko Loparic
    • Yves Pochet
    • Laurence A. Wolsey

    Pages: 487 - 504

11. On the convexity of the multiplicative potential and penalty functions and related topics

    • Pierre Maréchal

    Pages: 505 - 516

12. On two homogeneous self-dual approaches to linear programming and its extensions

    • Shinji Mizuno
    • Michael J. Todd

    Pages: 517 - 534