Constructive Interval Disjunction

DOI10.1007/978-3-540-74970-7_45MaRDI QIDQ3523079zbMATH OpenOpenAlexFDO

Authors Gilles Trombettoni, Gilles Chabert

Publication date 2 September 2008

Published in Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74970-7_45

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Adaptive constructive interval disjunction: algorithms and experiments
• Mind the Gaps: A New Splitting Strategy for Consistency Techniques
• Accelerating filtering techniques for numeric CSPs
• scientific article; zbMATH DE number 1322791
• scientific article; zbMATH DE number 512884

Cites work

• A rigorous global filtering algorithm for quadratic constraints
• Algorithm 852
• Design, implementation, and evaluation of the constraint language cc(FD)
• Interval Methods for Systems of Equations
• Principles and Practice of Constraint Programming – CP 2004
• When Interval Analysis Helps Inter-block Backtracking

Cited in

(25)

• \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems
• Constrained global optimization for wine blending
• Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
• Extending interval branch-and-bound from two to few objectives in nonlinear multiobjective optimization
• Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
• Hybridizing two linear relaxation techniques in interval-based solvers
• \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
• Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
• Integral algebra for simulating dynamical systems with interval uncertainties
• Node selection strategies in interval branch and bound algorithms
• Node selection through upper bounding local search methods in branch \& bound solvers for NCOPs
• Global solution of quadratic problems using interval methods and convex relaxations
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
• An interval extension based on occurrence grouping
• Upper bounding in inner regions for global optimization under inequality constraints
• Mind the Gaps: A New Splitting Strategy for Consistency Techniques
• Improving inter-block backtracking with interval Newton
• A standard branch-and-bound approach for nonlinear semi-infinite problems
• Accelerating filtering techniques for numeric CSPs
• Interval methods for model qualification: methodology and advanced application
• Lie symmetries applied to interval integration
• Adaptive constructive interval disjunction: algorithms and experiments
• Range-only SLAM with indistinguishable landmarks; a constraint programming approach
• Thick set inversion
• Discrete interval truth values logic and its application

This page was built for publication: Constructive Interval Disjunction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523079)