This paper addresses constraint solving over continuous domains in the context of decision making, and discusses the trade-off between precision in the definition of the solution space and the computational effort required. In alternative to local consistency, which is usually maintained in handling continuous constraints, we discuss maintaining global hull-consistency. Experimental results show that this may be an appropriate choice, achieving acceptable precision with relatively low computational cost. The approach relies on efficient algorithms and the best results are obtained with the integration of a local search procedure within interval constraint propagation. © Springer-Verlag Berlin Heidelberg 2001.
CITATION STYLE
Cruz, J., & Barahona, P. (2001). Global hull consistency with local search for continuous constraint solving. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2258 LNAI, pp. 349–362). Springer Verlag. https://doi.org/10.1007/3-540-45329-6_34
Mendeley helps you to discover research relevant for your work.