{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:17:26Z","timestamp":1725603446510},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237850"},{"type":"electronic","value":"9783642237867"}],"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-23786-7_16","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T07:58:42Z","timestamp":1314777522000},"page":"187-194","source":"Crossref","is-referenced-by-count":2,"title":["Hierarchically Nested Convex VCSP"],"prefix":"10.1007","author":[{"given":"Martin C.","family":"Cooper","sequence":"first","affiliation":[]},{"given":"Stanislav","family":"\u017divn\u00fd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall\/Pearson (2005)"},{"issue":"6","key":"16_CR2","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"E.K. Burke","year":"2004","unstructured":"Burke, E.K., Causmaecker, P.D., Berghe, G.V., Landeghem, H.V.: The state of the art of nurse rostering. Journal of Scheduling\u00a07(6), 441\u2013499 (2004)","journal-title":"Journal of Scheduling"},{"issue":"9-10","key":"16_CR3","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1016\/j.artint.2011.02.003","volume":"175","author":"M.C. Cooper","year":"2011","unstructured":"Cooper, M.C., \u017divn\u00fd, S.: Hybrid tractability of valued constraint problems. Artificial Intelligence\u00a0175(9-10), 1555\u20131569 (2011)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM\u00a034(3), 596\u2013615 (1987)","journal-title":"Journal of the ACM"},{"key":"16_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"issue":"4-5","key":"16_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10732-006-6550-4","volume":"12","author":"W.J. Hoeve van","year":"2006","unstructured":"van Hoeve, W.J., Pesant, G., Rousseau, L.M.: On global warming: Flow-based soft global constraints. Journal of Heuristics\u00a012(4-5), 347\u2013373 (2006)","journal-title":"Journal of Heuristics"},{"key":"16_CR7","unstructured":"Lee, J.H.M., Leung, K.L.: Towards efficient consistency enforcement for global constraints in weighted constraint satisfaction. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 559\u2013565 (2009)"},{"key":"16_CR8","unstructured":"R\u00e9gin, J.C.: Generalized Arc Consistency for Global Cardinality Constraint. In: Proceedings of the 13th National Conference on AI (AAAI 1996), vol.\u00a01, pp. 209\u2013215 (1996)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-540-72397-4_26","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"A. Zanarini","year":"2007","unstructured":"Zanarini, A., Pesant, G.: Generalizations of the global cardinality constraint for hierarchical resources. In: Van Hentenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol.\u00a04510, pp. 361\u2013375. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T16:25:04Z","timestamp":1554135904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}