Optimal Narrowing of a Block of Sortings in Optimal Time

Constraints

Volumn 5, Issue 1-2, 2000, Pages 85-118

  Bleuzen Guernalec, Noélle ^a   Colmerauer, Alain ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

Block; Box; Constraint; Interval; Narrowing; Sorting

Indexed keywords

EID: 0042921195     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009870418160     Document Type: Article

References (5)

1. Benhamou F. and Older W.J. (1997). Applying Interval Arithmetic to Real, Integer and Boolean Constraints. Journal of Logic Programming.
2. Knuth D.E. (1973). Sorting and Searching: The Art of Computer Programming, volume 3, Addison Wesley.
3. Older W.J. and Vellino A. (1990). Extending Prolog with Constraint Arithmetic on Real Intervals, Proceedings of the Canadian Conference on Electrical and Computer Engineering.
4. Older W.J., Swinkels G.M. and van Emden M.H. (1995). Getting to the Real Problem: Experience with BNR Prolog in OR, in Proceedings of the Third International Conference on the Practical Applications of Prolog, (PAP'95 à Paris), Alinmead Software Ltd, ISBN 0 9 525554 0 9.
5. Zhou J. (1997). A permutation-based approach for solving the job-shop problem, Constraints, vol 2, no 2, 185-213.