1. Preface

   • G. Mitra
   • I. Maros
   • A. Sciomachen

   OriginalPaper Pages: 0 - 0

2. A nonconvex weighted potential function forpolynomial target following methods

   • E. de Klerk
   • C. Roos
   • T. Terlaky

   OriginalPaper Pages: 3 - 14

3. A nonlinear path-following method for computingthe equilibrium curve of structures

   • A. Csébfalvi

   OriginalPaper Pages: 15 - 24

4. ASYNPLEX, an asynchronous parallelrevised simplex algorithm

   • J. A. J. Hall
   • K. I. M. McKinnon

   OriginalPaper Pages: 27 - 50

5. Calculating the exact bounds of optimal valuesin LP with interval coefficients

   • Frantisÿek Mráz

   OriginalPaper Pages: 51 - 62

6. An algorithm for solving bicriterial linear programmingproblems with parametrical coefficients in theobjective functions

   • Stefan Chanas
   • Dorota Kuchta

   OriginalPaper Pages: 63 - 72

7. A block active set algorithm for large-scalequadratic programming with box constraints

   • L. Fernandes
   • A. Fischer
   • J. Soares

   OriginalPaper Pages: 75 - 96

8. A path following method for LCP withsuperlinearly convergent iteration sequence

   • Florian A. Potra
   • Rongqin Sheng

   OriginalPaper Pages: 97 - 114

9. A Newton-like approach to solvingan equilibrium problem

   • Vladimir A. Bulavsky
   • Vyacheslav V. Kalashnikov

   OriginalPaper Pages: 115 - 128

10. Dynamic stochastic programmingfor asset-liability management

    • G. Consigli
    • M. A. H. Dempster

    OriginalPaper Pages: 131 - 162

11. Parallelization and aggregation ofnested Benders decomposition

    • M. A. H. Dempster
    • R. T. Thompson

    OriginalPaper Pages: 163 - 188

12. Stochastic optimization with structured distributions:The case of Bayesian nets

    • A. Gaivoronski
    • F. Stella

    OriginalPaper Pages: 189 - 212

13. Chance-constrained stochastic programming forintegrated services network management

    • E. A. Medova

    OriginalPaper Pages: 213 - 230

14. Reformulation of the set partitioning problem as apure network with special order set constraints

    • Agha Iqbal Ali

    OriginalPaper Pages: 233 - 250

15. Implementation of a steepest-edge primal - dualsimplex method for network linear programs

    • Norman D. Curet

    OriginalPaper Pages: 251 - 270

16. Solving the multi-airport Ground Holding Problem

    • Lorenzo Brunetta
    • Guglielmo Guastalla
    • Lisa Navazio

    OriginalPaper Pages: 271 - 288

17. A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem

    • M. Dell'Amico
    • F. Maffioli
    • A. Sciomachen

    OriginalPaper Pages: 289 - 306

18. A generalization of the Hoffman - Lovász upper boundon the independence number of a regular graph

    • Carlos J. Luz
    • Domingos M. Cardoso

    OriginalPaper Pages: 307 - 320

19. An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum lateness

    • Yakov Zinder
    • Duncan Roper

    OriginalPaper Pages: 321 - 343

20. On the set covering polytope:Facets with coefficients in {0, 1, 2, 3}

    • M. Sánchez-García
    • M. I. Sobrón
    • B. Vitoriano

    OriginalPaper Pages: 343 - 356

21. A method for solving ship routing problemswith inventory constraints

    • Marielle Christiansen
    • Bjorn Nygreen

    OriginalPaper Pages: 357 - 378

22. On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems

    • L. F. Escudero
    • S. Martello
    • P. Toth

    OriginalPaper Pages: 379 - 404

23. Integer programming approaches tofacilities layout models with forbidden areas

    • L. R. Foulds
    • H. W. Hamacher
    • J. M. Wilson

    OriginalPaper Pages: 405 - 418

24. Towards a closer integration of finite domainpropagation and simplex-based algorithms

    • Mozafar T. Hajian
    • Hani El-Sakkout
    • Barry Richards

    OriginalPaper Pages: 421 - 433

25. Assignment and sequencing models for thescheduling of process systems

    • Jose M. Pinto
    • Ignacio E. Grossmann

    OriginalPaper Pages: 433 - 466

26. Modelling discrete optimisation problems inconstraint logic programming

    • Peter Barth
    • Alexander Bockmayr

    OriginalPaper Pages: 467 - 496

27. Solving a mixed-integer multiobjective bond portfoliomodel involving logical conditions

    • R. L. V. Pinto
    • B. Rustem

    OriginalPaper Pages: 497 - 514