Publisher
Springer International Publishing
Reference44 articles.
1. Araya, I., Reyes, V.: Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects. J. Glob. Optim. 65(4), 837–866 (2016)
2. Araya, I., Trombettoni, G., Neveu, B., Chabert, G.: Upper bounding in inner regions for global optimization under inequality constraints. J. Glob. Optim. 60(2), 145–164 (2014)
3. van Beek, P., Dechter, R.: Constraint tightness and looseness versus local and global consistency. J. ACM 44(4), 549–566 (1997)
4. Foundations of Artificial Intelligence;F Benhamou,2006
5. Benhamou, F., McAllester, D., van Hentenryck, P.: CLP (intervals) revisited. In: International Symposium on Logic Programming, pp. 124–138. MIT Press, Cambridge (1994)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献