{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:44:05Z","timestamp":1725522245486},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540926948"},{"type":"electronic","value":"9783540926955"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92695-5_6","type":"book-chapter","created":{"date-parts":[[2008,12,16]],"date-time":"2008-12-16T10:11:59Z","timestamp":1229422319000},"page":"69-80","source":"Crossref","is-referenced-by-count":0,"title":["Learning from the Past to Dynamically Improve Search: A Case Study on the MOSP Problem"],"prefix":"10.1007","author":[{"given":"Hadrien","family":"Cambazard","sequence":"first","affiliation":[]},{"given":"Narendra","family":"Jussien","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","first-page":"2315","volume":"31","author":"J.C. Becceneri","year":"2004","unstructured":"Becceneri, J.C., Yannasse, H.H., Soma, N.Y.: A method for solving the minimization of the maximum number of open stacks problem within a cutting process. C&OR\u00a031, 2315\u20132332 (2004)","journal-title":"C&OR"},{"key":"6_CR2","unstructured":"Benoist, T.: A dynamic programming approach. In: IJCAI 2005 Fifth Workshop on Modelling and Solving Problems with Constraints (2005)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Garcia de la Banda, M., Stuckey, P.J.: Using dynamic programming to minimize the maximum number of open stacks. INFORMS Journal of Computing (2007)","DOI":"10.1287\/ijoc.1060.0205"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"M. Ginsberg","year":"1993","unstructured":"Ginsberg, M.: Dynamic backtracking. Journal of Artificial Intelligence Research\u00a01, 25\u201346 (1993)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"6_CR5","unstructured":"Junker, U.: QuickXplain: Conflict detection for arbitrary constraint propagation algorithms. In: IJCAI 2001 Workshop on Modelling and Solving problems with constraints (2001)"},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0004-3702(02)00221-7","volume":"139","author":"N. Jussien","year":"2002","unstructured":"Jussien, N., Lhomme, O.: Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence\u00a0139(1), 21\u201345 (2002)","journal-title":"Artificial Intelligence"},{"key":"6_CR7","unstructured":"Katsirelos, G., Bacchus, F.: Generalized nogoods in csps. In: National Conference on Artificial Intelligence (AAAI 2005), pp. 390\u2013396 (2005)"},{"key":"6_CR8","series-title":"The Art of Computer Programming","first-page":"492","volume-title":"Sorting and Searching","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: Sorting and Searching. The Art of Computer Programming, vol.\u00a03, pp. 492\u2013512. Addison-Wesley, Reading (1997)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001) (2001)","DOI":"10.1145\/378239.379017"},{"key":"6_CR10","unstructured":"Prosser, P.: MAC-CBJ: maintaining arc consistency with conflict-directed backjumping. Technical Report Research Report\/95\/177, Dept. of Computer Science, University of Strathclyde (1995)"},{"issue":"2","key":"6_CR11","first-page":"187","volume":"3","author":"T. Schiex","year":"1994","unstructured":"Schiex, T., Verfaillie, G.: Nogood recording for static and dynamic constraint satisfaction problem. IJAIT\u00a03(2), 187\u2013207 (1994)","journal-title":"IJAIT"},{"key":"6_CR12","unstructured":"Shaw, P., Laborie, P.: A constraint programming approach to the min-stack problem. In: IJCAI 2005 Fifth Workshop on Modelling and Solving Problems with Constraints (2005)"},{"key":"6_CR13","unstructured":"De Siqueira, J.L., Puget, J.F.: Explanation-based generalisation of failures. In (ECAI 1988), pp. 339\u2013344 (1988)"},{"key":"6_CR14","unstructured":"Smith, B., Gent, I.: Constraint modelling challenge 2005. In: IJCAI 2005 Fifth Workshop on Modelling and Solving Problems with Constraints (2005)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92695-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T09:21:56Z","timestamp":1557998516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92695-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540926948","9783540926955"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92695-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}