{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:20:55Z","timestamp":1725567655067},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540218364"},{"type":"electronic","value":"9783540246640"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24664-0_25","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T14:59:59Z","timestamp":1287845999000},"page":"364-369","source":"Crossref","is-referenced-by-count":6,"title":["LP Relaxations of Multiple all_different Predicates"],"prefix":"10.1007","author":[{"given":"Gautam","family":"Appa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris","family":"Magos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Mourtos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-46135-3_2","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"G. Appa","year":"2002","unstructured":"Appa, G., Mourtos, I., Magos, D.: Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 17\u201332. Springer, Heidelberg (2002)"},{"key":"25_CR2","unstructured":"Appa, G., Magos, D., Mourtos, I.: Polyhedral resuls for assignment problems. LSE CDAM Workin Paper Series, URL: \n                    \n                      http:\/\/www.cdam.lse.ac.uk\/Reports\/Files\/cdam-2002-01.pdf"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0166-218X(89)90014-0","volume":"23","author":"E. Balas","year":"1989","unstructured":"Balas, E., Saltzman, M.J.: Facets of the three-index assignment polytope. Discrete Applied Mathematics\u00a023, 201\u2013229 (1989)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR4","unstructured":"Christoff, T., L\u00f6bel, A.: Polyhedral Representation Transformation Algorithm v.1.4.0 (2003), URL: \n                    \n                      http:\/\/www.zib.de\/Optimization\/Software\/Porta"},{"key":"25_CR5","volume-title":"Latin Squares: New developments in the Theory and Applications","author":"J. D\u00e9nes","year":"1991","unstructured":"D\u00e9nes, J., Keedwell, A.D.: Latin Squares: New developments in the Theory and Applications. North-Holland, Amsterdam (1991)"},{"key":"25_CR6","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033036","volume-title":"Logic Based Methods for Optimization","author":"J.N. Hooker","year":"2000","unstructured":"Hooker, J.N.: Logic Based Methods for Optimization. Wiley, NY (2000)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1287\/opre.16.2.422","volume":"16","author":"W.P. Pierskalla","year":"1968","unstructured":"Pierskalla, W.P.: The multidimensional assignment problem. Operations Research\u00a016, 422\u2013431 (1968)","journal-title":"Operations Research"},{"key":"25_CR8","first-page":"1","volume-title":"Nonlinear Assignment Problems, Algorithms and Applications","author":"F.C.R. Spieksma","year":"2000","unstructured":"Spieksma, F.C.R.: Multi-index assignment problems: complexity, approximation, applications. In: Pitsoulis, L., Pardalos, P. (eds.) Nonlinear Assignment Problems, Algorithms and Applications, pp. 1\u201312. Kluwer Academic Publishers, Dordrecht (2000)"},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s101070050061","volume":"85","author":"H. Yan","year":"1999","unstructured":"Yan, H., Hooker, J.N.: Tight Representation of Logic Constraints as Cardinality Rules. Mathematical Programming\u00a085(2), 363\u2013377 (1999)","journal-title":"Mathematical Programming"},{"key":"25_CR10","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., Yang, H.: Representations of the all-different Predicate of Constraint Satisfaction in Integer Programming. INFORMS Journal on Computing\u00a013, 96\u2013103 (2001)","journal-title":"INFORMS Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24664-0_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T02:59:09Z","timestamp":1620010749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24664-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540218364","9783540246640"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24664-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}