{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:39:20Z","timestamp":1725680360691},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298271"},{"type":"electronic","value":"9783642298288"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29828-8_4","type":"book-chapter","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T03:59:40Z","timestamp":1336967980000},"page":"50-65","source":"Crossref","is-referenced-by-count":5,"title":["Graph Coloring Facets from All-Different Systems"],"prefix":"10.1007","author":[{"given":"David","family":"Bergman","sequence":"first","affiliation":[]},{"given":"John N.","family":"Hooker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-540-24664-0_25","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"G. Appa","year":"2004","unstructured":"Appa, G., Magos, D., Mourtos, I.: Linear Programming Relaxations of Multiple All-Different Predicates. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 364\u2013369. Springer, Heidelberg (2004)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ipl.2005.01.009","volume":"94","author":"G. Appa","year":"2004","unstructured":"Appa, G., Magos, D., Mourtos, I.: On the system of two all-different predicates. Information Processing Letters\u00a094, 99\u2013105 (2004)","journal-title":"Information Processing Letters"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/A:1021315911306","volume":"116","author":"P. Coll","year":"2002","unstructured":"Coll, P., Marenco, J., M\u00e9ndez-D\u00edaz, I., Zabala, P.: Facets of the graph coloring polytope. Annals of Operations Research\u00a0116, 79\u201390 (2002)","journal-title":"Annals of Operations Research"},{"key":"4_CR4","unstructured":"Gen\u00e7-Kaya, L., Hooker, J.N.: The circuit polytope. Carnegie Mellon University (2010) (manuscript)"},{"key":"4_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033036","volume-title":"Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction","author":"J.N. Hooker","year":"2000","unstructured":"Hooker, J.N.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, New York (2000)"},{"key":"4_CR6","unstructured":"Hooker, J.N.: Integrated Methods for Optimization. Springer (2007)"},{"key":"4_CR7","first-page":"47","volume":"197","author":"S. Kruk","year":"2009","unstructured":"Kruk, S., Toma, S.: On the system of the multiple all different predicates. Congressus Numerantium\u00a0197, 47\u201364 (2009)","journal-title":"Congressus Numerantium"},{"key":"4_CR8","first-page":"5","volume":"204","author":"S. Kruk","year":"2010","unstructured":"Kruk, S., Toma, S.: On the facets of the multiple alldifferent constraint. Congressus Numerantium\u00a0204, 5\u201332 (2010)","journal-title":"Congressus Numerantium"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Magos, D., Mourtos, I.: On the facial structure of the alldifferent system. SIAM Journal on Discrete Mathematics, 130\u2013158 (2011)","DOI":"10.1137\/090780298"},{"key":"4_CR10","unstructured":"Magos, D., Mourtos, I., Appa, G.: A polyhedral approach to the alldifferent system. Mathematical Programming (to appear)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/S1571-0653(04)00254-9","volume":"7","author":"I. M\u00e9ndez-D\u00edaz","year":"2001","unstructured":"M\u00e9ndez-D\u00edaz, I., Zabala, P.: A polyhedral approach for graph coloring. Electronic Notes in Discrete Mathematics\u00a07, 178\u2013181 (2001)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.dam.2006.07.010","volume":"156","author":"I. M\u00e9ndez-D\u00edaz","year":"2008","unstructured":"M\u00e9ndez-D\u00edaz, I., Zabala, P.: A cutting plane algorithm for graph coloring. Discrete Applied Mathematics\u00a0156, 159\u2013179 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR13","first-page":"7","volume":"37","author":"G. Palubeckis","year":"2008","unstructured":"Palubeckis, G.: On the graph coloring polytope. Information Technology and Control\u00a037, 7\u201311 (2008)","journal-title":"Information Technology and Control"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1287\/ijoc.13.2.96.10515","volume":"13","author":"H.P. Williams","year":"2001","unstructured":"Williams, H.P., Yan, H.: Representations of the alldifferent predicate of constraint satisfaction in integer programming. INFORMS Journal on Computing\u00a013, 96\u2013103 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s101070050061","volume":"85","author":"H. Yan","year":"1995","unstructured":"Yan, H., Hooker, J.N.: Tight representations of logical constraints as cardinality rules. Mathematical Programming\u00a085, 363\u2013377 (1995)","journal-title":"Mathematical Programming"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-46135-3_6","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"T.H. Yunes","year":"2002","unstructured":"Yunes, T.H.: On the Sum Constraint:Relaxation and Applications. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 80\u201392. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29828-8_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:17:44Z","timestamp":1620112664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29828-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298271","9783642298288"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}