{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:26:37Z","timestamp":1725560797188},"publisher-location":"Berlin, Heidelberg","reference-count":3,"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_109","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T09:31:28Z","timestamp":1129627888000},"page":"871-871","source":"Crossref","is-referenced-by-count":3,"title":["Robust Constraint Solving Using Multiple Heuristics"],"prefix":"10.1007","author":[{"given":"Alfio","family":"Vidotto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth N.","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"109_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"C.P. Gomes","year":"2001","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolios. Artificial Intelligence\u00a0126(1-2), 43\u201362 (2001)","journal-title":"Artificial Intelligence"},{"key":"109_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(87)90037-0","volume":"18","author":"E.M. Arkin","year":"1987","unstructured":"Arkin, E.M., Silverberg, E.B.: Scheduling jobs with fixed start and end times. Discrete Applied Mathematics\u00a018, 1\u20138 (1987)","journal-title":"Discrete Applied Mathematics"},{"key":"109_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/B:ANOR.0000032572.32788.da","volume":"130","author":"C.P. Gomes","year":"2004","unstructured":"Gomes, C.P., Shmoys, D.B.: Approximations and Randomization to Boost CSP Techniques. Annals of Operation Research\u00a0130, 117\u2013141 (2004)","journal-title":"Annals of Operation Research"}],"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_109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T10:41:08Z","timestamp":1552819268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564751_109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292388","9783540320500"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/11564751_109","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}