1. The Incremental Gauss-Newton Algorithm with Adaptive Stepsize Rule

   • Hiroyuki Moriyama
   • Nobuo Yamashita
   • Masao Fukushima

   OriginalPaper Pages: 107 - 141

2. Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations

   • Sunyoung Kim
   • Masakazu Kojima

   OriginalPaper Pages: 143 - 154

3. A Branch and Bound Method for Solving Integer Separable Concave Problems

   • O. Barrientos
   • R. Correa
   • A. Valdebenito

   OriginalPaper Pages: 155 - 171

4. Efficient Algorithms for Large Scale Global Optimization: Lennard-Jones Clusters

   • Marco Locatelli
   • Fabio Schoen

   OriginalPaper Pages: 173 - 190

5. Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept

   • Raffaele Cerulli
   • Paola Festa
   • Giancarlo Raiconi

   OriginalPaper Pages: 191 - 208

6. Book Review: Computational Techniques of the Simplex Method

   • Tamás Terlaky

   BookReview Pages: 209 - 210