Global optimization and constraint satisfaction : First international workshop on global constraint optimization and constraint satisfaction, COCOS 2002, Valbonne-Sophia Antipolis, France, October 2-4, 2002 : revised selected papers
This book constitutes the thoroughly refereed post-proceedings of the First International Workshop on Global Constraints Optimization and Costraint Satisfaction, COCOS 2002, held in Valbonne-Sophia Antipolis, France in October 2002. The 15 revised full papers presented together with 2 invited papers...
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin ; Heidelberg :
Springer-Verlag Berlin Heidelberg : Springer e-books
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
2861 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Global optimization and constraint satisfaction, First international workshop on global constraint optimization and constraint satisfaction, COCOS 2002, Valbonne-Sophia Antipolis, France, October 2-4, 2002, revised selected papers, Christian Bliek, Christophe Jermann, Arnold Neumaier (eds.), Berlin, Springer, 2003, 1 vol. (XII-239 p.), Lecture notes in computer science, 3-540-20463-6 • Global Optimization and Constraint Satisfaction, Texte imprimé, 9783662210147 |
Taula de continguts:
- Invited Lectures
- Global Optimization and Constraint Satisfaction: The Branch-and-Reduce Approach
- GlobSol: History, Composition, and Advice on Use
- Optimisation
- LaGO An Object Oriented Library for Solving MINLPs
- Solving Global Optimization Problems over Polynomials with GloptiPoly 2.1
- Rigorous Error Bounds for the Optimal Value of Linear Programming Problems
- Minimal and Maximal Real Roots of Parametric Polynomials Using Interval Analysis
- D.C. Programming for Solving a Class of Global Optimization Problems via Reformulation by Exact Penalty
- Symbolic-Interval Heuristic for Bound-Constrained Minimization
- A Global Constrained Optimization Algorithm for Engine Calibration
- Numerical Behavior of a Stabilized SQP Method for Degenerate NLP Problems
- Constraint Satisfaction
- A New Method for the Global Solution of Large Systems of Continuous Constraints
- Consistency Techniques for the Localization of a Satellite
- Computing Interval Parameter Bounds from Fallible Measurements Using Overdetermined (Tall) Systems of Nonlinear Equations
- Maintaining Global Hull Consistency with Local Search for Continuous CSPs
- Numerical Constraint Satisfaction Problems with Non-isolated Solutions
- Benchmarking
- Benchmarking Global Optimization and Constraint Satisfaction Codes
- Quality Assurance and Global Optimization.