Global Optimization and Constraint Satisfaction

Second International Workshop, COCOS 2003, Lausanne, Switzerland, November 18-21, 2003, Revised Selected Papers

  • Christophe Jermann
  • Arnold Neumaier
  • Djamila Sam
Conference proceedings COCOS 2003

DOI: 10.1007/b136292

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3478)

Table of contents

  1. Front Matter
  2. Constraint Satisfaction

    1. Yahia Lebbah, Claude Michel, Michel Rueher
      Pages 1-14
    2. Bertrand Neveu, Christophe Jermann, Gilles Trombettoni
      Pages 15-30
  3. Global Optimization

    1. Nitin Lamba, Mark Dietz, Daniel P. Johnson, Mark S. Boddy
      Pages 61-70
    2. Alexander Kleymenov, Alexander Semenov
      Pages 86-100
    3. Rúbia M. Oliveira, Paulo A. V. Ferreira
      Pages 101-111
  4. Applications

    1. Daniele Peri, Emilio F. Campana
      Pages 112-126
    2. Cyril Drocourt, Laurent Delahoche, Eric Brassart, Bruno Marhic, Arnaud Clérentin
      Pages 127-141
    3. Fabien Lydoire, Philippe Poignet
      Pages 142-153
    4. Alexandru Stancu, Vicenç Puig, Joseba Quevedo
      Pages 154-170
    5. Alexandru Stancu, Vicenç Puig, Pep Cugueró, Joseba Quevedo
      Pages 171-191
  5. Back Matter

About these proceedings

Introduction

Theformulationofmanypracticalproblemsnaturallyinvolvesconstraintsonthe variables entering the mathematical model of a real-life situation to be analyzed. It is of great interest to ?nd the possible scenarios satisfying all constraints, and, iftherearemanyofthem,eitherto?ndthebestsolution,ortoobtainacompact, explicit representation of the whole feasible set. The 2nd Workshop on Global Constrained Optimization and Constraint S- isfaction, COCOS 2003, which took place during November 18–21, 2003 in L- sanne, Switzerland, was dedicated to theoretical, algorithmic, and application oriented advances in answering these questions. Here global optimization refers to ?nding the absolutely best feasible point, while constraint satisfaction refers to?ndingallpossiblefeasiblepoints.AsinCOCOS2002,the?rstsuchworkshop (see the proceeedings [1]), the emphasis was on complete solving techniques for problems involving continuous variables that provide all solutions with full rigor, and on applications which, however, were allowed to have relaxed standards of rigor. The participants used the opportunity to meet experts from global optimi- tion, mathematical programming, constraint programming, and applications, and to present and discuss ongoing work and new directions in the ?eld. Four invited lectures and 20 contributed talks were presented at the workshop. The invited lectures were given by John Hooker (Logic-Based Methods for Global Optimization), Jean-Pierre Merlet (Usual and Unusual Applications of Interval Analysis), Hermann Schichl (The COCONUT Optimization Environment), and Jorge Mor´ e (Global Optimization Computational Servers). This volume contains the text of Hooker’s invited lecture and of 12 c- tributed talks. Copies of the slides for most presentations can be found at [2]. Constraintsatisfactionproblems.Threepapersfocusonalgorithmicaspects of constraint satisfaction problems.

Keywords

algorithms calculus constraint optimization constraint satisfaction constraint solving constraint solving problems constraints convex programming csp global optimization interval analysis linear relaxation optimization programming pruning

Editors and affiliations

  • Christophe Jermann
    • 1
  • Arnold Neumaier
    • 2
  • Djamila Sam
    • 3
  1. 1.LINA, FRE CNRS 2729 – University of NantesNantes cedex 3France
  2. 2.Institute for MathematicsUniversity WienWienAustria
  3. 3.Artificial Intelligence LaboratorySwiss Federal Institute of TechnologyLausanneSwitzerland

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-26003-5
  • Online ISBN 978-3-540-32041-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349