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 /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Bliek, Christian (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Jermann, Christophe (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Neumaier, Arnold (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
• Έκδοση: 1st ed. 2003.
• Σειρά: Lecture Notes in Computer Science, 2861
• Θέματα: Mathematical optimization.; Numerical analysis.; Programming languages (Electronic computers).; Combinatorics.; Operations research.; Management science.; Decision making.; Optimization.; Numeric Computing.; Programming Languages, Compilers, Interpreters.; Operations Research, Management Science.; Operations Research/Decision Theory.

 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. 

 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.