1. Preface

   • Panos M. Pardalos
   • J. B. Rosen

   EditorialNotes Pages: VI - VI

2. On solving general reverse convex programming problems by a sequence of linear programs and line searches

   • Reiner Horst
   • Thai Q. Phong
   • Nguyen V. Thoai

   OriginalPaper Pages: 1 - 17

3. A level set algorithm for a class of reverse convex programs

   • Sihem Ben Saad
   • Stephen E. Jacobsen

   OriginalPaper Pages: 19 - 42

4. Computational experience with an interior point algorithm on the satisfiability problem

   • A. P. Kamath
   • N. K. Karmarkar
   • M. G. C. Resende

   OriginalPaper Pages: 43 - 58

5. Interior-point algorithms for global optimization

   • Yinyu YE

   OriginalPaper Pages: 59 - 73

6. Minimum concave-cost network flow problems: Applications, complexity, and algorithms

   • G. M. Guisewite
   • P. M. Pardalos

   OriginalPaper Pages: 75 - 99

7. A parallel algorithm for partially separable non-convex global minimization: Linear constraints

   • A. T. Phillips
   • J. B. Rosen

   OriginalPaper Pages: 101 - 118

8. A decomposition approach for global optimum search in QP, NLP and MINLP problems

   • Avanish Aggarwal
   • Christodoulos A. Floudas

   OriginalPaper Pages: 119 - 145

9. Generalized linear multiplicative and fractional programming

   • Hiroshi Konno
   • Takahito Kuno

   OriginalPaper Pages: 147 - 161

10. Dual quadratic estimates in polynomial and Boolean programming

    • N. Z. Shor

    OriginalPaper Pages: 163 - 168

11. Global optimization of a quadratic function subject to a bounded mixed integer consraint set

    • Faiz A. Al-Khayyal
    • Christian Larsen

    OriginalPaper Pages: 169 - 180

12. Interval Newton/generalized bisection when there are singularities near roots

    • R. Baker Kearfott

    OriginalPaper Pages: 181 - 196

13. An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes

    • Hanif D. Sherali
    • Amine Alameddine

    OriginalPaper Pages: 197 - 209

14. Globally optimized calibration of environmental models

    • János Pintér

    OriginalPaper Pages: 211 - 221

15. The interactive fixed charge inhomogeneous flows optimization problem

    • Boris V. Pelzwerger
    • Anatoly Yu. Shafir

    OriginalPaper Pages: 223 - 242

16. A note on adapting methods for continuous global optimization to the discrete case

    • Harold P. Benson
    • S. Selcuk Erenguc
    • Reiner Horst

    OriginalPaper Pages: 243 - 252

17. Methods for solving multi-extremal problems (global search)

    • V. P. Bulatov

    OriginalPaper Pages: 253 - 277

18. Optimum departure times for commuters in congested networks

    • André de Palma
    • Pierre Hansen

    OriginalPaper Pages: 279 - 290

19. On the equivalence between some discrete and continuous optimization problems

    • Fabio Tardella

    OriginalPaper Pages: 291 - 300