An Analysis of Slow Convergence in Interval Propagation

DOI10.1007/978-3-540-74970-7_56zbMath1145.68506OpenAlexW1518451826MaRDI QIDQ3523087

Moshe Y. Vardi, Youssef Hamadi, Lucas Bordeaux

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_56

Mathematics Subject Classification ID

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

Related Items

Domain reduction techniques for global NLP and MINLP optimization

Cites Work

• Unnamed Item
• Constraint propagation with interval labels
• Accelerating filtering techniques for numeric CSPs
• The essence of constraint propagation
• An analysis of arithmetic constraints on integer intervals
• A lattice-theoretical fixpoint theorem and its applications
• On the complexity of integer programming
• Theory and practice of constraint handling rules
• Applying interval arithmetic to real, integer, and boolean constraints
• Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds