{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T04:10:02Z","timestamp":1752379802039,"version":"3.41.2"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1023\/a:1020565317875","type":"journal-article","created":{"date-parts":[[2003,3,18]],"date-time":"2003-03-18T15:12:43Z","timestamp":1048000363000},"page":"255-288","source":"Crossref","is-referenced-by-count":12,"title":["SALSA: A Language for Search Algorithms"],"prefix":"10.1007","volume":"7","author":[{"given":"Fran\u00e7ois","family":"Laburthe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"Caseau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5095778_CR1","doi-asserted-by":"crossref","unstructured":"Apt, K. R., & Schaerf, A. (1997) Search and imperative programming. In ACM SIGPLAN-SIGACT Symposium on Programming Languages (POPL'97), Paris, France, pp. 67\u201379.","DOI":"10.1145\/263699.263709"},{"key":"5095778_CR2","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N. (2000). Global constraints as graph properties on structured network of elementary constraints of the same type. Technical Report 12000-01. SICS.","DOI":"10.1007\/3-540-45349-0_6"},{"key":"5095778_CR3","doi-asserted-by":"crossref","unstructured":"Balas, E., & Vazacopoulos, A. (1998). Guided local search with shifting bottleneck for job shop scheduling, Management Science, 44(2).","DOI":"10.1287\/mnsc.44.2.262"},{"key":"5095778_CR4","unstructured":"Caseau, Y., & Laburthe, F. (1999). Effective forget and extend heuristics for scheduling problems. In Proceedings 3rd Metaheuristics International Conference."},{"issue":"3","key":"5095778_CR5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1009661600931","volume":"5","author":"Y. Caseau","year":"1999","unstructured":"Caseau, Y., & Laburthe, F. (1999). Heuristics for large constrained vehicle routing problems. Journal of Heuristics, 5(3): 281\u2013303.","journal-title":"Journal of Heuristics"},{"key":"5095778_CR6","volume-title":"Proceedings of CP'99","author":"Y. Caseau","year":"1999","unstructured":"Caseau, Y., Laburthe, F., & Silverstein, G. (1999). A meta-heuristics factory for vehicle routing problems. In Jaffar, J., ed., Proceedings of CP'99. LNCS 1713, Springer-Verlag, Berlin."},{"key":"5095778_CR7","unstructured":"De Givry, S., & Saveant, P. (1999). Optimisation combinatoire en Temps Limit\u00e9: Depth First Branch and Bound adaptatif. Fages, F., ed., Proceedings of JFPLC'99, Hermes Science Publication."},{"key":"5095778_CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M. Dell' Amico","year":"1993","unstructured":"Dell' Amico, M., & Trubian, M. (1993). Applying tabu-search to the job-shop scheduling problem. Annals of Operations Research, 41: 231\u2013252.","journal-title":"Annals of Operations Research"},{"key":"5095778_CR9","volume-title":"Optimal algorithms for various classes of multiple resource constrained project scheduling problems","author":"E. Demeulemeester","year":"1992","unstructured":"Demeulemeester, E. (1992). Optimal algorithms for various classes of multiple resource constrained project scheduling problems, Ph.D. dissertation, Universit\u00e9 Catholique de Louvain, Belgium."},{"key":"5095778_CR10","unstructured":"LP shift and LP roster documentation, http:\/\/www.eurodecision.fr."},{"key":"5095778_CR11","unstructured":"Fourer, R., MacGay, D., & Kernighan, B. W. (1993). AMPL: A Modelling Language for Mathematical Programming, Brook\/Cole Publishing Company."},{"key":"5095778_CR12","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M. Gendreau","year":"1994","unstructured":"Gendreau, M., Hertz, A., & Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management Science, 40: 1276\u20131290.","journal-title":"Management Science"},{"key":"5095778_CR13","unstructured":"Helm, R. (1987). Inductive and deductive control of logic programs. In Proceedings of ICPL 87, pages 488\u2013512."},{"key":"5095778_CR14","unstructured":"Harvey, W. & Ginsberg, M. (1995). Limited discrepancy search. In Proceedings of the 14th IJCAI, pages 607\u2013615. Morgan Kaufmann."},{"key":"5095778_CR15","doi-asserted-by":"crossref","unstructured":"Hanus, M., & Steiner, F. (1998). Controlling search in declarative programs. PLIP\/ALP, pages 374\u2013390.","DOI":"10.1007\/BFb0056627"},{"key":"5095778_CR16","doi-asserted-by":"crossref","unstructured":"Jaffar, J., & Lassez, J.-L. (1987). Constraint logic programming. In Proceedings of the ACM Symposium on Principles of Programming Languages.","DOI":"10.1145\/41625.41635"},{"key":"5095778_CR17","unstructured":"Jourdan, J. (1995). Concurrence et coop\u00e9ration de mod\u00e8les multiples dans les langages CLP et CC. Ph.D. thesis, University of Paris 7."},{"key":"5095778_CR18","doi-asserted-by":"crossref","unstructured":"Junker, U., Karish, S., Kohl, N., Vaaben, B., Fahle, T., & Sellmann, M. (1999). A framework for constraint programming based column generation. In Jaffar, J., ed., Proceedings of CP'99. LNCS 1713, Springer-Verlag.","DOI":"10.1007\/978-3-540-48085-3_19"},{"issue":"7","key":"5095778_CR19","first-page":"424","volume":"22","author":"R. A. Kowalski","year":"1979","unstructured":"Kowalski, R. A. (1979). Algorithm = logic + control. GACM, 22(7): 424\u2013436.","journal-title":"GACM"},{"key":"5095778_CR20","doi-asserted-by":"crossref","unstructured":"Lin, S., & Kernighan, B. W. (1973). An effective heuristic for the traveling salesman problem. Operations Research, 21.","DOI":"10.1287\/opre.21.2.498"},{"key":"5095778_CR21","unstructured":"x, L., & Lema\u00eetre, M. (1998). Branch and bound algorithm selection by performance prediction. In Proceedings of AAAI'98, Madison, WI."},{"key":"5095778_CR22","doi-asserted-by":"crossref","unstructured":"Lloyd, J. W. (1987). Foundation of Logic Programming, Springer-Verlag.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"5095778_CR23","unstructured":"Martin, D., & Shmoys, P. (1996). A time-based approach to the jobshop problem. In Queyranne, M., ed., Proceedings of IPCO'5. LCNS 1084, Springer-Verlag."},{"key":"5095778_CR24","doi-asserted-by":"crossref","unstructured":"Michel, L., & Van Hentenryck, P. (1997). Localizer: a modeling language for local search. In Proceedings of CP'97. LNCS 1330, Springer-Verlag.","DOI":"10.1007\/BFb0017443"},{"key":"5095778_CR25","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., & Hansen, P. (1997). Variable neighborhood search. Computers in Operations Research, 24: 1097\u20131100.","journal-title":"Computers in Operations Research"},{"issue":"4","key":"5095778_CR26","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0743-1066(84)90027-X","volume":"1","author":"L. Naish","year":"1984","unstructured":"Naish, L. (1984). Heterogeneous SLD resolution, Journal of Logic Programming, 1(4): 297\u2013303.","journal-title":"Journal of Logic Programming"},{"key":"5095778_CR27","unstructured":"Pearl, J. (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley."},{"key":"5095778_CR28","doi-asserted-by":"crossref","unstructured":"Perron, L. (1999). Search procedures and parallelism in constraint programming. In Jaffar, J., ed., Proceedings of CP'99. LNCS 1713, Springer-Verlag.","DOI":"10.1007\/978-3-540-48085-3_25"},{"key":"5095778_CR29","doi-asserted-by":"crossref","unstructured":"Pesant, G., & Gendreau, M. (1996). A view of local search in constraint programming. Proceedings of CP'96. pages 353\u2013366. LNCS 1118, Springer-Verlag.","DOI":"10.1007\/3-540-61551-2_86"},{"key":"5095778_CR30","unstructured":"Puget, J.-F. (1999). Constraint programming: a framework for mathematical programming. Invited Lecture, CP-AI-OR workshop, Ferrara."},{"key":"5095778_CR31","doi-asserted-by":"crossref","unstructured":"Russell, R. (1995). Hybrid heuristics for the vehicle routing problem with time windows. Transportation Science, 29(2).","DOI":"10.1287\/trsc.29.2.156"},{"key":"5095778_CR32","unstructured":"Schulte, C., & Smolka, G. (1994). Encapsulated search for higher-order concurrent constraint programming. In Proceedings of ILPS'94, pages 505\u2013520. MIT Press."},{"key":"5095778_CR33","doi-asserted-by":"crossref","unstructured":"Schulte, C. (1997). Oz explorer: a visual constraint programming tool. In Naish, L., ed., Proceedings 14th ICLP, pages 286\u2013300. MIT Press.","DOI":"10.7551\/mitpress\/4299.003.0026"},{"key":"5095778_CR34","unstructured":"Selman, B., Levesque, H., & Mitchell, D. (1992). A new method for solving hard satisfiability problems. In Proceedings of AAAI-92, pages 440\u2013446."},{"key":"5095778_CR35","doi-asserted-by":"crossref","unstructured":"Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In Proceedings of CP'98. LNCS 1520, Springer-Verlag.","DOI":"10.1007\/3-540-49481-2_30"},{"key":"5095778_CR36","unstructured":"Simonis, H., & Aggoun, A. (1999). Search tree debugging. In Fages, F., ed., Proceedings of JFPLC'99. Hermes Science Publication."},{"key":"5095778_CR37","volume-title":"Proceedings of Applied Mathematical Programming and Modeling","author":"J. Tebboth","year":"1998","unstructured":"Tebboth, J., & Daniel, R. (1998). A tightly integrated modelling and optimisation library: a new framework for rapid algorithm development, Proceedings of Applied Mathematical Programming and Modeling, (APMOD\u2019 98), Limassol, Cyprus."},{"key":"5095778_CR38","unstructured":"Van Hentenryck, P. (1999). The OPL Optimization Programming Language. MIT Press."},{"key":"5095778_CR39","volume-title":"perational rationality through compilation of anytime algorithms","author":"S. Zilberstein","year":"1993","unstructured":"Zilberstein, S. (1993). Operational rationality through compilation of anytime algorithms, Ph.D. dissertation, University of California at Berkeley."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020565317875.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020565317875\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020565317875.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:51:04Z","timestamp":1752378664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020565317875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":39,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["5095778"],"URL":"https:\/\/doi.org\/10.1023\/a:1020565317875","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}