{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:20:59Z","timestamp":1725567659667},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540218364"},{"type":"electronic","value":"9783540246640"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24664-0_14","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T14:59:59Z","timestamp":1287845999000},"page":"200-208","source":"Crossref","is-referenced-by-count":5,"title":["Filtering Methods for Symmetric Cardinality Constraint"],"prefix":"10.1007","author":[{"given":"Waldemar","family":"Kocjan","sequence":"first","affiliation":[]},{"given":"Per","family":"Kreuger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"Theory, algorithms and applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows. In: Theory, algorithms and applications, Prentice-Hall Inc., Englewood Cliffs (1993)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","volume":"10","author":"J.-L. Lauri\u00e8re","year":"1978","unstructured":"Lauri\u00e8re, J.-L.: A language and a program for stating and solving combinatorial problems. Artificial Intelligence\u00a010, 29\u2013127 (1978)","journal-title":"Artificial Intelligence"},{"key":"14_CR3","unstructured":"R\u00e9gin, J.-C.: Generalized Arc Consistency for Global Cardinality Constraint. In: Proc. of the Fourteenth National Conference on Artificial Intelligence (AAAI 1996) (1996)"},{"key":"14_CR4","volume-title":"Combinatorial Optimization: Network and Matroids","author":"E. Lawler","year":"1976","unstructured":"Lawler, E.: Combinatorial Optimization: Network and Matroids. Holt, Rinehart and Winston (1976)"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/S0377-2217(96)00269-X","volume":"97","author":"R.K. Ahuja","year":"1997","unstructured":"Ahuja, R.K., Kodialam, A., Mishra, A.K., Orlin, J. B.: Computational Investigations of Maximum Flow Algorithms. European Journal of Operational Research, 97 (1997) 509\u2013542","journal-title":"European Journal of Operational Research"},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. E. Tarjan","year":"1972","unstructured":"Tarjan, R. E.: Depth\u2013First Search and Linear Graph Algorithms. SIAM J. Computing, 1 (1972) 146\u2013160","journal-title":"SIAM J. Computing"}],"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-540-24664-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T23:04:56Z","timestamp":1558307096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24664-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540218364","9783540246640"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24664-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}