{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:48:01Z","timestamp":1752461281905},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540652243"},{"type":"electronic","value":"9783540494812"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49481-2_23","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T19:46:10Z","timestamp":1195933570000},"page":"310-324","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Salsa: A Language for Search Algorithms"],"prefix":"10.1007","author":[{"given":"Fran\u00c7ois","family":"Laburthe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"Caseau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"K.R. Apt, A. Schaerf, Search and Imperative Programming, Proc. of the 24th ACM Symposium on Principles of Programming Languages (POPL\u201997), ACM Press, 1997","DOI":"10.1145\/263699.263709"},{"key":"23_CR2","unstructured":"Y. Caseau, F. Laburthe, Heuristics for Large Constrained Vehicle Routing Problems, submitted for publication, march 1998."},{"key":"23_CR3","unstructured":"Y. Caseau, F. Laburthe, SaLSA: A Specification Language for Search Algorithms, LIENS 97-11, \u00e9cole Normale Sup\u00e9rieure, 1997."},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M. DellAmico","year":"1993","unstructured":"M. Dell\u2019Amico & M. Trubian. Applying Tabu-Search to the Job-Shop Scheduling Problem. Annals of Op. Research, 41, p. 231\u2013252, 1993.","journal-title":"Annals of Op. Research"},{"key":"23_CR5","volume-title":"Optimal Algorithms for various classes of multiple resource constrained project scheduling problems","author":"E. Demeulemeester","year":"1992","unstructured":"E. Demeulemeester, Optimal Algorithms for various classes of multiple resource constrained project scheduling problems, unpublished PhD. dissertation, Universit\u00e9 Catholique de Louvain, Belgique, 1992."},{"key":"23_CR6","unstructured":"R. Fourer, D. MacGay, B.W. Kernighan, AMPL: A Modelling Language for Mathematical Programming, Brook\/Cole Publishing Company, 1993."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M. Gendreau","year":"1994","unstructured":"M. Gendreau, A. Hertz, G. Laporte. A Tabu Search Heuristic for the Vehicle Routing Problem, Management Science, 40, p. 1276\u20131290, 1994.","journal-title":"Management Science"},{"key":"23_CR8","volume-title":"technical report","author":"M. Hanus","year":"1998","unstructured":"M. Hanus, F. Steiner, Controlling Search in Functional Logic Programs, technical report, RWTH Aachen, 1998."},{"key":"23_CR9","unstructured":"W. Harvey, M. Ginsberg, Limited Discrepancy Search, Proceedings of the 14th IJCAI, p. 607\u2013615, Morgan Kaufmann, 1995."},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"J. Jaffar, J.-L. Lassez, Constraint Logic Programming, Proceedings of the ACM symposium on Principles of Programming Languages, 1987.","DOI":"10.1145\/41625.41635"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"S. Lin, B.W. Kernighan, An Effective Heuristic for the Traveling Salesman Problem. Operations Research 21, 1973.","DOI":"10.1287\/opre.21.2.498"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, Foundation of Logic Programming, Spinger, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"23_CR13","unstructured":"D. Martin, P. Shmoys, A time-based approach to the Jobshop problem, Proc. of IPCO\u20195, M. Queyranne ed., LCNS 1084, Springer, 1996."},{"key":"23_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of CP\u201997","author":"L. Michel","year":"1997","unstructured":"L. Michel, P. Van Hentenryck, Localizer: A Modeling Language for Local Search. Proc. of CP\u201997, LNCS 1330, Springer, 1997."},{"key":"23_CR15","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of CP\u201997","author":"J.-M. Labat","year":"1997","unstructured":"J.-M. Labat, L. Mynard, Oscillation, Heuristic Ordering and Pruning in Neighborhood Search. Proc. of CP\u201997, G. Smolka ed., LNCS 1330, Springer, 1997."},{"key":"23_CR16","unstructured":"J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, 1984."},{"key":"23_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/3-540-61551-2_86","volume-title":"proc. of CP\u201996","author":"G. Pesant","year":"1996","unstructured":"G. Pesant, M. Gendreau, A View of Local Search in Constraint Programming, proc. of CP\u201996, LNCS 1118, p. 353\u2013366, Springer 1996."},{"key":"23_CR18","unstructured":"G. Pesant, M. Gendreau, J.-Y. Potvin, J.-M. Rousseau, An Exact Constraint Logic Programming Algorithm for the Travelling Salesman with Time Windows, to appear in Transportation Science, 1996."},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"R. Russell, Hybrid Heuristics for the Vehicle Routing Problem with Time Windows, Transportation Science, 29(2), may 1995.","DOI":"10.1287\/trsc.29.2.156"},{"key":"23_CR20","unstructured":"C. Schulte, G. Smolka, Encapsulated Search for Higher-order Concurrent Constraint Programming, Proc. of ILPS\u201994, M. Bruynooghe ed., p. 505\u2013520, MIT Press, 1994."},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"C. Schulte, Oz explorer: A Visual Constraint Programming Tool, Proc. 14th ICLP, L. Naish ed., p. 286\u2013300, MIT Press, 1997.","DOI":"10.7551\/mitpress\/4299.003.0026"},{"key":"23_CR22","unstructured":"B. Selman, H. Levesque, D. Mitchell, A New Method for Solving Hard Satisfiability Problems Proc. of AAAI-92, p. 440\u2013446, 1992."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP98"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49481-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T15:19:08Z","timestamp":1708355948000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49481-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540652243","9783540494812"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-49481-2_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"11 June 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}