1 option
Global Optimization and Constraint Satisfaction : First International Workshop Global Constraint Optimization and Constraint Satisfaction, COCOS 2002, Valbonne-Sophia Antipolis, France, October 2-4, 2002, Revised Selected Papers / edited by Christian Bliek, Christophe Jermann, Arnold Neumaier.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2861.
- Lecture Notes in Computer Science, 0302-9743 ; 2861
- Language:
- English
- Subjects (All):
- Mathematical optimization.
- Numerical analysis.
- Programming languages (Electronic computers).
- Combinatorial analysis.
- Operations research.
- Management science.
- Decision making.
- Optimization.
- Numeric Computing.
- Programming Languages, Compilers, Interpreters.
- Combinatorics.
- Operations Research, Management Science.
- Operations Research/Decision Theory.
- Local Subjects:
- Optimization.
- Numeric Computing.
- Programming Languages, Compilers, Interpreters.
- Combinatorics.
- Operations Research, Management Science.
- Operations Research/Decision Theory.
- Physical Description:
- 1 online resource (XII, 248 pages).
- Edition:
- First edition 2003.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
- System Details:
- text file PDF
- Summary:
- 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 were carefully selected during two rounds of reviewing and improvement. The papers address current issues in global optimization, mathematical programming, and constraint programming; they are grouped in topical sections on optimization, constraint satisfaction, and benchmarking.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-39901-8
- 9783540399018
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.