{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:42:56Z","timestamp":1742913776441,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"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_18","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T08:47:22Z","timestamp":1304585242000},"page":"190-195","source":"Crossref","is-referenced-by-count":3,"title":["The Objective Sum Constraint"],"prefix":"10.1007","author":[{"given":"Jean-Charles","family":"R\u00e9gin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Petit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Kov\u00e1cs, A., Beck, J.C.: A global constraint for total weighted completion time for cumulative resources. Constraints (2010) (in print)","DOI":"10.1007\/s10601-009-9088-x"},{"key":"18_CR2","unstructured":"Larrosa, J., Meseguer, P., Schiex, T., Verfaillie, G.: Reversible DAC and other improvements for solving Max-CSP. Proceedings AAAI, pp. 347\u2013352 (1998)"},{"key":"18_CR3","first-page":"169","volume-title":"Proc. of the 19th Course of the International School of Mathematics","author":"T. Larsson","year":"1995","unstructured":"Larsson, T., Patriksson, M.: On side constrained models of traffic equilibria. In: Proc. of the 19th Course of the International School of Mathematics, pp. 169\u2013178. Plenum Press, New York (1995)"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10479-010-0683-4","volume":"184","author":"T. Petit","year":"2011","unstructured":"Petit, T., Poder, E.: Global propagation of side constraints for solving over-constrained problems. Annals of Operations Research\u00a0184, 295\u2013315 (2011)","journal-title":"Annals of Operations Research"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/3-540-45349-0_46","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"J.-C. R\u00e9gin","year":"2000","unstructured":"R\u00e9gin, J.-C., Petit, T., Bessi\u00e8re, C., Puget, J.-F.: An original constraint based approach for solving over constrained problems. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 543\u2013548. Springer, Heidelberg (2000)"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:04:21Z","timestamp":1609203861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21311-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642213106","9783642213113"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21311-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}