{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:17:18Z","timestamp":1649204238378},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,10,28]],"date-time":"2014-10-28T00:00:00Z","timestamp":1414454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10878-014-9810-5","type":"journal-article","created":{"date-parts":[[2014,10,27]],"date-time":"2014-10-27T05:46:04Z","timestamp":1414388764000},"page":"1061-1089","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cardinality constraints and systems of restricted representatives"],"prefix":"10.1007","volume":"31","author":[{"given":"Ioannis","family":"Mourtos","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,28]]},"reference":[{"key":"9810_CR1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10107-003-0432-4","volume":"99","author":"E Balas","year":"2004","unstructured":"Balas E, Bockmayr A, Pisaruk N, Wolsey L (2004) On unions and dominants of polytopes. Math Program 99:223\u2013239","journal-title":"Math Program"},{"key":"9810_CR2","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/s10601-014-9164-8","volume":"19","author":"D Bergman","year":"2014","unstructured":"Bergman D, Hooker JN (2014) Graph coloring inequalities from all-different systems. Constraints 19:404\u2013433","journal-title":"Constraints"},{"key":"9810_CR3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/1810891.1810914","volume":"53","author":"AA Bulatov","year":"2010","unstructured":"Bulatov AA, Marx D (2010) Constraint satisfaction problems and global cardinality constraints. Commun ACM 53:99\u2013106","journal-title":"Commun ACM"},{"key":"9810_CR4","doi-asserted-by":"crossref","first-page":"78","DOI":"10.4153\/CJM-1958-009-1","volume":"10","author":"LR Ford Jr","year":"1958","unstructured":"Ford LR Jr, Fulkerson DR (1958) Network flow and systems of representatives. Can J Math 10:78\u201384","journal-title":"Can J Math"},{"key":"9810_CR5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1981) The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1:169\u2013197","journal-title":"Combinatorica"},{"key":"9810_CR6","doi-asserted-by":"crossref","unstructured":"Hooker JN (2012) Integrated methods for optimization, international series in operations research & management science, vol 170. Springer","DOI":"10.1007\/978-1-4614-1900-6"},{"key":"9810_CR7","doi-asserted-by":"crossref","unstructured":"Hooker JN, Yan H (2002) A relaxation of the cumulative constraint. Proceedings of CP2002. Lect. Notes Comput. Sci., vol. 2470, pp 80\u201392","DOI":"10.1007\/3-540-46135-3_46"},{"key":"9810_CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10601-005-2237-y","volume":"10","author":"I Katriel","year":"2005","unstructured":"Katriel I, Thiel S (2005) Complete bound consistency for the global cardinality constraint. Constraints 10:191\u2013217","journal-title":"Constraints"},{"key":"9810_CR9","unstructured":"Kaya LG, Hooker JN (2011) The circuit polytope. http:\/\/wpweb2.tepper.cmu.edu\/jnh\/CircuitPolytope"},{"key":"9810_CR10","doi-asserted-by":"crossref","first-page":"884","DOI":"10.1016\/j.jcss.2008.02.001","volume":"74","author":"M Kutz","year":"2008","unstructured":"Kutz M, Elbassioni K, Katriel I, Mahajan M (2008) Simultaneous matchings: hardness and approximation. J Comput Syst Sci 74:884\u2013897","journal-title":"J Comput Syst Sci"},{"key":"9810_CR11","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1137\/090780298","volume":"25","author":"D Magos","year":"2011","unstructured":"Magos D, Mourtos I (2011) On the facial structure of the AllDifferent system. SIAM J Discrete Math 25:130\u2013158","journal-title":"SIAM J Discrete Math"},{"key":"9810_CR12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10107-010-0390-6","volume":"132","author":"D Magos","year":"2012","unstructured":"Magos D, Mourtos I, Appa G (2012) A polyhedral approach to the alldifferent system. Math Program 132:209\u2013260","journal-title":"Math Program"},{"key":"9810_CR13","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.14.4.387.2830","volume":"14","author":"M Milano","year":"2002","unstructured":"Milano M, Ottosson G, Refalo P, Thorsteinsson E (2002) The role of integer programming techniques in constraint programming\u2019s global constraints. INFORMS J Comput 14:387\u2013402","journal-title":"INFORMS J Comput"},{"key":"9810_CR14","unstructured":"Mirsky L (1971) Transversal theory. Math. Sci. Eng., vol 75. Academic Press, London"},{"key":"9810_CR15","unstructured":"Mourtos I (2013) Tight LP-relaxations of overlapping global cardinality constraints. Proceedings of CPAIOR\u201913. Lect. Notes Comput. Sci., vol 7874, pp 362\u2013368"},{"key":"9810_CR16","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10601-005-0552-y","volume":"10","author":"CG Quimper","year":"2005","unstructured":"Quimper CG, Golynski A, L\u00f3pez-Ortiz A, van Beek P (2005) An efficient bounds consistency algorithm for the global cardinality constraint. Constraints 10:115\u2013135","journal-title":"Constraints"},{"key":"9810_CR17","doi-asserted-by":"crossref","unstructured":"Quimper CG, Walsh T (2006) The all different and global cardinality constraints on set, multiset and tuple variables. In: Hnich B et al (eds) CSCLP 2005. Lect. Notes Artificial Intelligence, vol 3978. Springer pp 1\u201313","DOI":"10.1007\/11754602_1"},{"key":"9810_CR18","unstructured":"Regin JC (1996) Generalized arc consistency for global cardinality constraint. Proceedings of AAAI-96, Portland, OR, pp 209\u2013215"},{"key":"9810_CR19","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1023\/A:1020506526052","volume":"7","author":"JC Regin","year":"2002","unstructured":"Regin JC (2002) Cost-based Arc consistency for global cardinality constraints. Constraints 7:387\u2013405","journal-title":"Constraints"},{"key":"9810_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10601-009-9079-y","volume":"16","author":"M Samer","year":"2011","unstructured":"Samer M, Szeider S (2011) Tractable cases of the extended global cardinality constraint. Constraints 16:1\u201324","journal-title":"Constraints"},{"key":"9810_CR21","volume-title":"Polyhedra and efficiency (algorithms and combinatorics)","author":"A Schrijver","year":"2004","unstructured":"Schrijver A (2004) Polyhedra and efficiency (algorithms and combinatorics). Springer, Berlin"},{"key":"9810_CR22","doi-asserted-by":"crossref","unstructured":"van Beek P, Wilken K (2001) Fast optimal instruction scheduling for single-issue processors with arbitrary latencies. Proceedings of CP-01. Paphos, Cyprus, pp 625\u2013639","DOI":"10.1007\/3-540-45578-7_52"},{"key":"9810_CR23","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1287\/ijoc.13.2.96.10515","volume":"13","author":"HP Williams","year":"2001","unstructured":"Williams HP, Yan H (2001) Representations of the all-different predicate of constraint satisfaction in integer programming. INFORMS J Comput 13:96\u2013103","journal-title":"INFORMS J Comput"},{"key":"9810_CR24","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s101070050061","volume":"85","author":"H Yan","year":"1999","unstructured":"Yan H, Hooker JN (1999) Tight representation of logic constraints as cardinality rules. Math Program 85:363\u2013377","journal-title":"Math Program"},{"key":"9810_CR25","doi-asserted-by":"crossref","unstructured":"Yunes TH (2002) On the sum constraint: relaxation and applications. In: van Hentenryck P (ed) Proceedings of CP2002. Lect. Notes Comput. Sci., vol 2470, pp 80\u201392","DOI":"10.1007\/3-540-46135-3_6"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9810-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9810-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9810-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T13:38:01Z","timestamp":1565962681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9810-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,28]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["9810"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9810-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,28]]}}}