Octagonal Domains for Continuous Constraints

Marie Pelleau (1) , Charlotte Truchet (2) , Frédéric Benhamou (1)

1 LINA - Laboratoire d'Informatique de Nantes Atlantique
2 TASC - Theory, Algorithms and Systems for Constraints

Domains in Continuous Constraint Programming (CP) are generally represented with intervals whose $n$-ary Cartesian product (box) approximates the solution space. This paper proposes a new representation for continuous variable domains based on octagons. We generalize local consistency and split to this octagon representation, and we propose an octagonal-based branch and prune algorithm. Preliminary experimental results show promising performance improvements on several classical benchmarks.

Domaines: Autre [cs.OH]

Marie Pelleau, Charlotte Truchet, Frédéric Benhamou. Octagonal Domains for Continuous Constraints. 17th International Conference on Principles and Practice of Constraint Programming (CP'11), 2011, Perrugia, Italy. pp.706--720. ⟨hal-00785598⟩