1. Non-euclidean restricted memory level method for large-scale convex optimization

   • Aharon Ben-Tal
   • Arkadi Nemirovski

   OriginalPaper 29 December 2004 Pages: 407 - 456

2. Split closure and intersection cuts

   • Kent Andersen
   • Gérard Cornuéjols
   • Yanjun Li

   OriginalPaper 29 December 2004 Pages: 457 - 493

3. Safe and tight linear estimators for global optimization

   • Glencora Borradaile
   • Pascal Van Hentenryck

   OriginalPaper 07 July 2004 Pages: 495 - 517

4. The two-dimensional cutting stock problem revisited

   • Steven S. Seiden
   • Gerhard J. Woeginger

   OriginalPaper 20 August 2004 Pages: 519 - 530

5. A polyhedral study of nonconvex quadratic programs with box constraints

   • Dieter Vandenbussche
   • George L. Nemhauser

   OriginalPaper 01 October 2004 Pages: 531 - 557

6. A branch-and-cut algorithm for nonconvex quadratic programs with box constraints

   • Dieter Vandenbussche
   • George L. Nemhauser

   OriginalPaper 01 October 2004 Pages: 559 - 575

7. Strengthening the Lovász bound for graph coloring

   • Philippe Meurdesoif

   OriginalPaper 01 October 2004 Pages: 577 - 588

8. An improved semidefinite programming relaxation for the satisfiability problem

   • Miguel F. Anjos

   OriginalPaper 01 October 2004 Pages: 589 - 608

9. A note on treating a second order cone program as a special case of a semidefinite program

   • Chee-Khian Sim
   • Gongyun Zhao

   OriginalPaper 20 August 2004 Pages: 609 - 613