1. Self-concordant barriers for hyperbolic means

   • Adrian S. Lewis
   • Hristo S. Sendov

   Pages: 1 - 10

2. New classes of fast lower bounds for bin packing problems

   • Sándor P. Fekete
   • Jörg Schepers

   Pages: 11 - 31

3. Entropic proximal decomposition methods for convex programs and variational inequalities

   • Alfred Auslender
   • Marc Teboulle

   Pages: 33 - 47

4. A polynomial case of unconstrained zero-one quadratic optimization

   • Kim Allemand
   • Komei Fukuda
   • Erich Steiner

   Pages: 49 - 52

5. Discretization in semi-infinite programming: the rate of convergence

   • G. Still

   Pages: 53 - 69

6. Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem

   • Ravindra K. Ahuja
   • James B. Orlin
   • Dushyant Sharma

   Pages: 71 - 97

7. Q-superlinear convergence of the iterates in primal-dual interior-point methods

   • Florian A. Potra

   Pages: 99 - 115

8. Dual bounding procedures lead to convergent Branch–and–Bound algorithms

   • Mirjam Dür

   Pages: 117 - 125

9. Perfect duality in semi–infinite and semidefinite programming

   • K.O. Kortanek
   • Q. Zhang

   Pages: 127 - 144

10. Valid inequalities for problems with additive variable upper bounds

    • Alper Atamtürk
    • George L. Nemhauser
    • Martin W.P. Savelsbergh

    Pages: 145 - 162

11. A new condition number for linear programming

    • Dennis Cheung
    • Felipe Cucker

    Pages: 163 - 174

12. Box-inequalities for quadratic assignment polytopes

    • Michael Jünger
    • Volker Kaibel

    Pages: 175 - 197

13. Errata: On semidefinite linear complementarity problems

    • M. Seetharama Gowda
    • Yoon Song

    Pages: 199 - 200