{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:50:30Z","timestamp":1743133830032,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642213106"},{"type":"electronic","value":"9783642213113"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21311-3_16","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T08:47:22Z","timestamp":1304585242000},"page":"170-175","source":"Crossref","is-referenced-by-count":0,"title":["Recovering Indirect Solution Densities for Counting-Based Branching Heuristics"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Pesant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Zanarini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/S0377-2217(98)00008-3","volume":"113","author":"K. Holmberg","year":"1999","unstructured":"Holmberg, K., Ronnqvist, M., Yuan, D.: An exact algorithm for the capacitated facility location problems with single sourcing. European Journal of Operational Research\u00a0113(3), 544\u2013559 (1999)","journal-title":"European Journal of Operational Research"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-68155-7_17","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"G. Pesant","year":"2008","unstructured":"Pesant, G., Quimper, C.-G.: Counting Solutions of Knapsack Constraints. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 203\u2013217. Springer, Heidelberg (2008)"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1021801522545","volume":"118","author":"M.A. Trick","year":"2003","unstructured":"Trick, M.A.: A dynamic programming approach for consistency and propagation for knapsack constraints. Annals of Operations Research\u00a0118, 73\u201384 (2003)","journal-title":"Annals of Operations Research"},{"key":"16_CR4","first-page":"1172","volume-title":"Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 1999","author":"T. Walsh","year":"1999","unstructured":"Walsh, T.: Search in a small world. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 1999, pp. 1172\u20131177. Morgan Kaufmann Publishers Inc., San Francisco (1999)"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/s10601-008-9065-9","volume":"14","author":"A. Zanarini","year":"2009","unstructured":"Zanarini, A., Pesant, G.: Solution Counting Algorithms for Constraint-Centered Search Heuristics. Constraints\u00a014, 392\u2013413 (2009)","journal-title":"Constraints"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-642-13520-0_38","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"A. Zanarini","year":"2010","unstructured":"Zanarini, A., Pesant, G.: More Robust Counting-Based Search Heuristics with Alldifferent Constraints. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol.\u00a06140, pp. 354\u2013368. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21311-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:04:24Z","timestamp":1609203864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21311-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642213106","9783642213113"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21311-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}