ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Solving Polynomial Systems Using a Branch and Prune Approach
SIAM Journal on Numerical Analysis
Testing Unconstrained Optimization Software
ACM Transactions on Mathematical Software (TOMS)
Three Cuts for Accelerated Interval Propagation
Three Cuts for Accelerated Interval Propagation
Including ordinary differential equations based constraints in the standard CP framework
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A box-consistency contractor based on extremal functions
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A branch and prune algorithm for the computation of generalized aspects of parallel robots
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
The canonical algorithm to enforce box consistency over a constraint relies on a dichotomic process to isolate the leftmost and rightmost solutions. We identify some weaknesses of the standard implementations of this approach and review the existing body of work to tackle them; we then present an adaptive shaving process to achieve box consistency by tightening a domain from both bounds inward. Experimental results show a significant improvement over existing approaches in terms of robustness for difficult problems.