Interval propagation and search on directed acyclic graphs for numerical constraint solving

DOI10.1007/s10898-008-9386-7zbMath1179.90267MaRDI QIDQ1041436

Hermann Schichl, Xuan-Ha Vu, Djamila Sam-Haroud

Publication date: 2 December 2009

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/159250/files/10898_2008_Article_9386.pdf

zbMATH Keywords

branch and prune; interval constraint propagation

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C26: Nonconvex programming, global optimization

Related Items

Bound constrained interval global optimization in the COCONUT environment, Reverse propagation of McCormick relaxations, Constraint propagation on quadratic constraints, Variable symmetry breaking in numerical constraint problems, Enhancing numerical constraint propagation using multiple inclusion representations, First order rejection tests for multiple-objective optimization, Algorithmic differentiation techniques for global optimization in the COCONUT environment

Uses Software

• ICOS
• RealPaver

Cites Work

• Interval analysis on directed acyclic graphs for global optimization
• Interval arithmetic with containment sets
• Consistency in networks of relations
• \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}
• Networks of constraints: Fundamental properties and applications to picture processing
• Interval arithmetic
• Algorithm 852
• Interval Methods for Systems of Equations
• Applying interval arithmetic to real, integer, and boolean constraints
• Global Optimization and Constraint Satisfaction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item