{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T05:24:53Z","timestamp":1781760293212,"version":"3.54.5"},"reference-count":48,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,12]]},"DOI":"10.1016\/s0377-2217(98)00364-6","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"557-581","source":"Crossref","is-referenced-by-count":282,"title":["Constraint satisfaction problems: Algorithms and applications"],"prefix":"10.1016","volume":"119","author":[{"given":"Sally C.","family":"Brailsford","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chris N.","family":"Potts","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Barbara M.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00364-6_BIB1","unstructured":"Baptiste, P., Le Pape, C., 1995. A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. In: Mellish, C.S. (Ed.), Proceedings of The 14th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, Palo Alto, CA, pp. 600\u2013606"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB2","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.P.M., 1995. Constraint-based optimization and approximation for job shop scheduling. In: Sadeh, N. (Ed.), Proceedings of The AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems (IJCAI-95), http:\/\/www.ilog.com.sg\/html\/products\/optimization\/research_papers.htm"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/ijoc.10.3.287","article-title":"Branch and infer: A unifying framework for integer and finite domain constraint programming","volume":"10","author":"Bockmayr","year":"1998","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB4","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the job-shop problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/(SICI)1097-024X(199801)28:1<49::AID-SPE147>3.0.CO;2-R","article-title":"Integrating constraint logic programming and operations research techniques for the crew rostering problem","volume":"28","author":"Caprara","year":"1998","journal-title":"Software \u2013 Practice & Experience"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB6","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1023\/A:1018934507395","article-title":"Applying constraint satisfaction techniques to job shop scheduling","volume":"70","author":"Cheng","year":"1997","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB7","first-page":"135","article-title":"Constraint logic programming and its application to fleet scheduling","volume":"19","author":"Christodoulou","year":"1994","journal-title":"Information and Decision Technologies"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB8","first-page":"121","article-title":"Resource scheduling \u2013 comparing simulated annealing with constraint programming","volume":"13","author":"Crabtree","year":"1995","journal-title":"BT Technology Journal"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB9","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1287\/ijoc.10.3.276","article-title":"Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming","volume":"10","author":"Darby-Dowman","year":"1998","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB10","unstructured":"David, J.-M., Chew, T.L., 1995. Constraint-based applications in production planning: examples from the automotive industry. In: Proceedings of Practical Applications of Constraint Technology (PACT'95). Practical Applications Company, Blackpool, UK, pp. 37\u201351"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB11","unstructured":"Dincbas, M., Simonis, H., Van Hentenryck, P., 1988a. Solving a cutting-stock problem in constraint logic programming. In: Kowalski, R.A., Bowen, K.A. (Eds.), Logic Programming. MIT Press, Cambridge, MA, pp. 42\u201358"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB12","unstructured":"Dincbas, M., Simonis, H., Van Hentenryck, P., 1988b. Solving the car-sequencing problem in constraint logic programming. In: Kodratoff, Y. (Ed.), Proceedings of European Conference on Artificial Intelligence (ECAI-88), Pitman, London, pp. 290\u2013295"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB13","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","article-title":"A dual-based procedure for uncapacitated facility location","volume":"26","author":"Erlenkotter","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB14","unstructured":"Fisher, H., Thompson, G.L., 1963. Probabilistic learning combinations of local job-shop scheduling rules. In: Muth, J.F., Thompson, G.L. (Eds.), Industrial Scheduling. Prentice-Hall, Englewood Cliffs, NJ, pp. 225\u2013251"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB15","doi-asserted-by":"crossref","unstructured":"Gendreau, M., Laporte, G., Potvin, J.-Y., 1997. Vehicle routing: modern heuristics. In: Aarts, E.H.L., Lenstra, J.K. (Eds.), Local Search in Combinatorial Optimization. Wiley, Chichester, UK, pp. 311\u2013336","DOI":"10.2307\/j.ctv346t9c.14"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB16","doi-asserted-by":"crossref","unstructured":"Guerinik, N., Van Caneghem, M., 1995. Solving crew scheduling problems by constraint programming. In: Montanari, U., Rossi, F. (Eds.), Proceedings of The First Conference of Principles & Practice of CP, Lecture Notes in Computer Science, vol. 976. Springer, Berlin, pp. 481\u2013498","DOI":"10.1007\/3-540-60299-2_29"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB17","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","article-title":"Increasing tree search efficiency for constraint satisfaction problems","volume":"14","author":"Haralick","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB18","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","article-title":"Optimization by simulated annealing: An experimental evaluation; Part II, graph coloring and number partitioning","volume":"39","author":"Johnson","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB19","doi-asserted-by":"crossref","unstructured":"Karp, R.M., 1972. Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (Eds.), Complexity of Computer Computations. Plenum Press, New York, pp. 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB20","doi-asserted-by":"crossref","unstructured":"Lajos, G., 1995. Complete university modular timetabling using constraint logic programming. In: Burke, E., Ross, P. (Eds.), First International Conference on Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, vol. 1153. Springer, Berlin, pp. 146\u2013161","DOI":"10.1007\/3-540-61794-9_57"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB21","unstructured":"Lawrence, S., 1984. Resource constrained scheduling: An experimental investigation of heuristic scheduling techniques. Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB22","unstructured":"Little, J., Darby-Dowman, K., 1995. The significance of constraint logic programming to operational research. In: Lawrence, M., Wilsdon, C. (Eds.), Operational Research Society Tutorial Papers 1995. Operational Research Society, Birmingham, UK, pp. 20\u201345"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB23","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","article-title":"Consistency in networks of relations","volume":"8","author":"Mackworth","year":"1977","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB24","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/BF02085650","article-title":"Heuristics and look-ahead integration to solve constraint satisfaction problems efficiently","volume":"50","author":"Menezes","year":"1994","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB25","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","article-title":"Networks of constraints: fundamental properties and applications to picture processing","volume":"7","author":"Montanari","year":"1974","journal-title":"Information Science"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB26","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","article-title":"A fast taboo search algorithm for the job shop problem","volume":"42","author":"Nowicki","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB27","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0377-2217(95)00354-1","article-title":"A computational study of constraint satisfaction for multiple capacitated job shop scheduling","volume":"90","author":"Nuijten","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB28","unstructured":"Nuitjen, W.P.M., Gunnen, G.M., Aarts, E.H.L., Dignum, F.P.M., 1994. Examination time tabling: A case study for constraint satisfaction. In: Cohn, A.G. (Ed.), Proceedings of Workshop on Constraint Satisfaction Issues Raised by Practical Applications (ICAI'94), pp. 11\u201319"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB29","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1287\/ijoc.10.3.265","article-title":"Integer linear programming and constraint programming approaches to a template design problem","volume":"10","author":"Proll","year":"1998","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB30","doi-asserted-by":"crossref","unstructured":"Puget, J.-F., 1993. On the satisfiability of symmetrical constrained satisfaction problems. In: Komorowski, J., Ras, Z.W. (Eds.), Proceedings of Seventh International Symposium on Methodologies for Intelligent Systems (ISMIS'93), Lecture Notes in Computer Science\/Lecture Notes in Artificial Intelligence, vol. 689. Springer, Berlin, pp. 350\u2013361","DOI":"10.1007\/3-540-56804-2_33"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB31","unstructured":"Puget, J.-F., 1995. A comparison between constraint programming and integer programming. In: Conference on Applied Mathematical Programming and Modelling (APMOD95), Brunel University"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB32","unstructured":"R\u00e9gin, J.-C., 1994. A filtering algorithm for constraints of difference in CSPs. In: Proceedings of Twelfth National Conference on Artificial Intelligence 1 (AAAI-94). MIT Press, Cambridge, MA, pp. 362\u2013367"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB33","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.-C., Puget, J.-F., 1997. A filtering algorithm for global sequencing constraints. In: Smolka, G. (Ed.), Principles and Practice of Constraint Programming \u2013 CP97, Lecture Notes in Computer Science, vol. 1330. Springer, Berlin, pp. 32\u201346","DOI":"10.1007\/BFb0017428"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB34","unstructured":"Rodosek, R., Wallace, M.G., Hajian, M.T., to appear. A new approach to integrate mixed integer programming with CLP. Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB35","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1057\/jors.1992.72","article-title":"Solution of massive generalized set partitioning problems in aircrew rostering","volume":"43","author":"Ryan","year":"1992","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB36","doi-asserted-by":"crossref","unstructured":"Sabin, D., Freuder, E.C., 1994. Contradicting conventional wisdom in constraint satisfaction. In: Cohn, A.G. (Ed.), Proceedings of European Conference on Artificial Intelligence (ECAI-94). Wiley, Chichester, UK, pp. 125\u2013129","DOI":"10.1007\/3-540-58601-6_86"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB37","doi-asserted-by":"crossref","unstructured":"Shaw, P., 1998. Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (Eds.), Principles and Practice of Constraint Programming \u2013 CP98, Lecture Notes in Computer Science, vol. 1520. Springer, Berlin, pp. 417\u2013431","DOI":"10.1007\/3-540-49481-2_30"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB38","unstructured":"Simonis, H., 1996. A problem classification scheme for finite-domain constraint solving (tutorial paper given at PACT'96). In: Second International Conference on the Practical Applications of Constraint Technology"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB39","unstructured":"Smith, B.M., 1996. Succeed-first or fail-first: A case study in variable and value ordering heuristics. In: Proceedings of The Third International Conference on the Practical Applications of Constraint Technology (PACT'97). Practical Applications Company, Blackpool, UK, pp. 321\u2013330"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB40","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF00143880","article-title":"The progressive party problem: Integer linear programming and constraint programming compared","volume":"1","author":"Smith","year":"1996","journal-title":"Constraints"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB41","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1080\/09537289408919527","article-title":"Decision approach to workload distribution","volume":"5","author":"Thuriot","year":"1994","journal-title":"Production Planning & Control"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB42","doi-asserted-by":"crossref","unstructured":"Van Hentenryck, P., 1995. Constraint solving for combinatorial search problems: A tutorial. In: Montanari, U., Rossi, F. (Eds.), Proceedings of The First Conference of Principles & Practice of CP, Lecture Notes in Computer Science, vol. 976. Springer, Berlin, pp. 564\u2013587","DOI":"10.1007\/3-540-60299-2_35"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB43","unstructured":"Van Hentenryck, P., Carillon, J.-P., 1988. Generality versus specificity: An experience with AI and OR techniques. In: Proceedings of The Seventh National Conference on Artificial Intelligence 2 (AAAI 88). AAAI Press\/MIT Press, Cambridge, MA, pp. 660\u2013664"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB44","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0004-3702(92)90020-X","article-title":"A generic arc-consistency algorithm and its specializations","volume":"57","author":"Van Hentenryck","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB45","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0004-3702(92)90006-J","article-title":"Constraint satisfaction using constraint logic programming","volume":"58","author":"Van Hentenryck","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB46","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1287\/ijoc.8.3.302","article-title":"Job shop scheduling by local search","volume":"8","author":"Vaessens","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB47","unstructured":"Waltz, D., 1972. Generating semantic descriptions from drawings of scenes with shadows. Technical Report AI271. MIT, MA"},{"key":"10.1016\/S0377-2217(98)00364-6_BIB48","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1287\/ijoc.10.3.261","article-title":"Connections between integer linear programming and constraint logic programming \u2013 an overview and introduction to the cluster of articles","volume":"10","author":"Williams","year":"1998","journal-title":"INFORMS Journal on Computing"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798003646?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798003646?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T10:31:34Z","timestamp":1578479494000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798003646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,12]]}},"alternative-id":["S0377221798003646"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00364-6","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}