{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:39:44Z","timestamp":1725557984099},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135194"},{"type":"electronic","value":"9783642135200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13520-0_38","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T16:10:33Z","timestamp":1276359033000},"page":"354-368","source":"Crossref","is-referenced-by-count":3,"title":["More Robust Counting-Based Search Heuristics with Alldifferent Constraints"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Zanarini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Pesant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"38_CR1","first-page":"945","volume":"14","author":"L.M. Bregman","year":"1973","unstructured":"Bregman, L.M.: Some Properties of Nonnegative Matrices and their Permanents. Soviet Mathematics Doklady\u00a014(4), 945\u2013949 (1973)","journal-title":"Soviet Mathematics Doklady"},{"key":"38_CR2","unstructured":"Gomes, C., Shmoys, D.: Completing Quasigroups or Latin Squares: A Structured Graph Coloring Problem. In: COLOR 2002: Proceedings of Computational Symposium on Graph Coloring and Generalizations, pp. 22\u201339 (2002)"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0021-8693(66)90016-0","volume":"3","author":"W.B. Jurkat","year":"1966","unstructured":"Jurkat, W.B., Ryser, H.J.: Matrix Factorizations of Determinants and Permanents. Journal of Algebra\u00a03, 1\u201327 (1966)","journal-title":"Journal of Algebra"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.laa.2003.09.003","volume":"377","author":"H. Liang","year":"2004","unstructured":"Liang, H., Bai, F.: An Upper Bound for the Permanent of (0,1)-Matrices. Linear Algebra and its Applications\u00a0377, 291\u2013295 (2004)","journal-title":"Linear Algebra and its Applications"},{"issue":"6","key":"38_CR5","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s10951-008-0097-1","volume":"12","author":"R.A. Melo","year":"2009","unstructured":"Melo, R.A., Urrutia, S., Ribeiro, C.C.: The traveling tournament problem with predefined venues. Journal of Scheduling\u00a012(6), 607\u2013622 (2009)","journal-title":"Journal of Scheduling"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1090\/S0002-9904-1963-11031-9","volume":"69","author":"H. Minc","year":"1963","unstructured":"Minc, H.: Upper Bounds for Permanents of (0, 1)-matrices. Bulletin of the American Mathematical Society\u00a069, 789\u2013791 (1963)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"38_CR7","unstructured":"Pryor, J.: Branching Variable Direction Selection in Mixed Integer Programming. Master\u2019s thesis, Carleton University (2009)"},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/978-3-540-30201-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P. Refalo","year":"2004","unstructured":"Refalo, P.: Impact-Based Search Strategies for Constraint Programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 557\u2013571. Springer, Heidelberg (2004)"},{"key":"38_CR9","first-page":"362","volume-title":"AAAI 1994: Proceedings of the Twelfth National Conference on Artificial Intelligence","author":"J.-C. R\u00e9gin","year":"1994","unstructured":"R\u00e9gin, J.-C.: A Filtering Algorithm for Constraints of Difference in CSPs. In: AAAI 1994: Proceedings of the Twelfth National Conference on Artificial Intelligence, vol.\u00a01, pp. 362\u2013367. American Association for Artificial Intelligence, Menlo Park (1994)"},{"issue":"4","key":"38_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1080\/0308108031000098450","volume":"51","author":"G.W. Soules","year":"2003","unstructured":"Soules, G.W.: New Permanental Upper Bounds for Nonnegative Matrices. Linear and Multilinear Algebra\u00a051(4), 319\u2013337 (2003)","journal-title":"Linear and Multilinear Algebra"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.laa.2004.06.022","volume":"394","author":"G.W. Soules","year":"2005","unstructured":"Soules, G.W.: Permanental Bounds for Nonnegative Matrices via Decomposition. Linear Algebra and its Applications\u00a0394, 73\u201389 (2005)","journal-title":"Linear Algebra and its Applications"},{"issue":"2","key":"38_CR12","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L. Valiant","year":"1979","unstructured":"Valiant, L.: The Complexity of Computing the Permanent. Theoretical Computer Science\u00a08(2), 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"38_CR13","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(3), 392\u2013413 (2009)","journal-title":"Constraints"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13520-0_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:06:09Z","timestamp":1619784369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13520-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135194","9783642135200"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13520-0_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}