The Incremental Gauss-Newton Algorithm with Adaptive Stepsize Rule Hiroyuki MoriyamaNobuo YamashitaMasao Fukushima OriginalPaper Pages: 107 - 141
Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations Sunyoung KimMasakazu Kojima OriginalPaper Pages: 143 - 154
A Branch and Bound Method for Solving Integer Separable Concave Problems O. BarrientosR. CorreaA. Valdebenito OriginalPaper Pages: 155 - 171
Efficient Algorithms for Large Scale Global Optimization: Lennard-Jones Clusters Marco LocatelliFabio Schoen OriginalPaper Pages: 173 - 190
Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept Raffaele CerulliPaola FestaGiancarlo Raiconi OriginalPaper Pages: 191 - 208
Book Review: Computational Techniques of the Simplex Method Tamás Terlaky BookReview Pages: 209 - 210
