Global search algorithms for minimum concave-cost network flow problems G. M. GuisewiteP. M. Pardalos OriginalPaper Pages: 309 - 330
On when to stop sampling for the maximum C. G. E. BoenderA. H. G. Rinnooy Kan OriginalPaper Pages: 331 - 340
A global optimization approach for solving the convex multiplicative programming problem Nguyen Van Thoai OriginalPaper Pages: 341 - 357
Bounding the set of solutions of a perturbed global optimization problem E. R. Hansen OriginalPaper Pages: 359 - 374
A trajectory algorithm based on the gradient method I. The search on the quasioptimal trajectories E. G. SturuaS. K. Zavriev OriginalPaper Pages: 375 - 388
An application of Lipschitzian global optimization to product design E. M. T. HendrixJ. Pintér OriginalPaper Pages: 389 - 401