Publisher
Springer Berlin Heidelberg
Reference36 articles.
1. Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems. Mathl. Comput. Modelling, 17(7), 57–73 (1993)
2. Andrews, W.S.: Magic Squares and Cubes. New York: Dover (1960)
3. Applegate, D., Cook, W.: A computational study of the job shop scheduling problem. Operations Research Society of America, 3(2): 149–156 (1991)
4. Apt, K.R., Wallace, M.: Constraint Logic Programming using Eclipse. Cambridge University Press (2007)
5. Bleuzen-Guernalec, N., Colmerauer, A.: Optimal narrowing of a block of sortings in optimal time. Constraints 5(1/2): 85–118 (2000)