Adaptive constructive interval disjunction: algorithms and experiments

DOI10.1007/s10601-015-9180-3zbMath1329.90152OpenAlexW2009768181MaRDI QIDQ903916

Gilles Trombettoni, Bertrand Neveu, Ignacio J. Araya

Publication date: 15 January 2016

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://hal-enpc.archives-ouvertes.fr/hal-01119535/file/acid_constraints_2015.pdf

zbMATH Keywords

adaptive algorithmsinterval methodsstrong consistency

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (4)

A generic interval branch and bound algorithm for parameter estimation ⋮ Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ Node selection strategies in interval branch and bound algorithms

Uses Software

• COCONUT
• COPRIN
• IBEX
• IbexOpt
• Numerica
• RODES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contractor programming
• Consistency in networks of relations
• Robust autonomous robot localization using interval analysis
• A rigorous ODE solver and Smale's 14th problem
• A polyhedral branch-and-cut approach to global optimization
• Constructive Interval Disjunction
• Efficient and Safe Global Constraints for Handling Numerical Constraint Systems

This page was built for publication: Adaptive constructive interval disjunction: algorithms and experiments