{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:26:41Z","timestamp":1725560801578},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292388"},{"type":"electronic","value":"9783540320500"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564751_55","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T13:31:28Z","timestamp":1129642288000},"page":"737-741","source":"Crossref","is-referenced-by-count":4,"title":["Multi-point Constructive Search"],"prefix":"10.1007","author":[{"given":"J. Christopher","family":"Beck","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"55_CR1","unstructured":"Achlioptas, D., Gomes, C.P., Kautz, H.A., Selman, B.: Generating satisfiable problem instances. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence, pp. 256\u2013261 (2000)"},{"key":"55_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-based Scheduling","author":"P. Baptiste","year":"2001","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based Scheduling. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"55_CR3","unstructured":"Carchrae, T., Beck, J.C.: Low knowledge algorithm control. In: Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI 2004), pp. 49\u201354 (2004)"},{"key":"55_CR4","volume-title":"Empirical Methods for Artificial Intelligence","author":"P.R. Cohen","year":"1995","unstructured":"Cohen, P.R.: Empirical Methods for Artificial Intelligence. The MIT Press, Cambridge (1995)"},{"key":"55_CR5","volume-title":"New Optimization Techniques in Engineering","author":"F. Glover","year":"2004","unstructured":"Glover, F., Laguna, M., Marti, R.: Scatter search and path relinking: advances and applications. In: Onwubolu, G.C., Babu, B.V. (eds.) New Optimization Techniques in Engineering. Springer, Heidelberg (2004)"},{"key":"55_CR6","unstructured":"Gomes, C.P., Shmoys, D.: Completing quasigroups or latin squares: A structured graph coloring problem. In: Proceedings of the Computational Symposium on Graph Coloring and Generalizations (2002)"},{"key":"55_CR7","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI 1994), vol.\u00a01, pp. 362\u2013367 (1994)"},{"issue":"2","key":"55_CR8","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1287\/ijoc.14.2.98.120","volume":"14","author":"J.-P. Watson","year":"2002","unstructured":"Watson, J.-P., Barbulescu, L., Whitley, L.D., Howe, A.E.: Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance. INFORMS Journal on Computing\u00a014(2), 98\u2013123 (2002)","journal-title":"INFORMS Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564751_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T14:11:24Z","timestamp":1552831884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564751_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292388","9783540320500"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11564751_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}