{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:04:23Z","timestamp":1725483863404},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441205"},{"type":"electronic","value":"9783540461357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_2","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T05:59:47Z","timestamp":1179208787000},"page":"17-32","source":"Crossref","is-referenced-by-count":7,"title":["Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem"],"prefix":"10.1007","author":[{"given":"Gautam","family":"Appa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Mourtos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris","family":"Magos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"2_CR1","unstructured":"Appa G., Magos D., Mourtos I., Janssen J. C. M.: On the Orthogonal Latin Squares polytope. Submitted to Discrete Mathematics (2001). (URL: http:\/\/www.cdam.lse.ac.uk\/Reports\/reports2001.html )"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1287\/ijoc.10.3.287","volume":"10","author":"A. Bockmayr","year":"1998","unstructured":"Bockmayr A., Casper T.: Branch and infer: a unifying framework for integer and finite domain constraint programming. INFORMS Journal on Computing, 10 (1998) 187\u2013200.","journal-title":"INFORMS Journal on Computing"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Chandru V., Hooker J. N.: Optimization methods for logical inference. J.Wiley (1999).","DOI":"10.1002\/9781118033166"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Dantzig G. B.: Linear Programming and extensions. Princeton Univ. Press (1963).","DOI":"10.7249\/R366"},{"key":"2_CR5","unstructured":"D\u00e9nes J., Keedwell A. D.: Latin squares and their applications. Acad. Press (1974)."},{"key":"2_CR6","unstructured":"Freuder E. C., Wallace R. J. (ed.): Constraint Programming and Large Scale Discrete Optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 57, Amer. Math. Soc (1998)."},{"key":"2_CR7","unstructured":"Gomes C., Shmoys D.: The Promise of LP to Boost CSP Techniques for Combinatorial Problems, CP-AI-OR\u201902, 291-305, Le Croisic, France (2002)."},{"issue":"97","key":"2_CR8","first-page":"395","volume":"96","author":"J. N. Hooker","year":"1994","unstructured":"Hooker J. N., Osorio M. A.: Mixed logical\/linear programming. Discrete Applied Mathematics, 9697 (1994) 395\u2013442.","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Hooker J. N.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. J.Wiley (2000).","DOI":"10.1002\/9781118033036"},{"key":"2_CR10","unstructured":"Laywine C. F., Mullen G. L.: Discrete Mathematics using Latin squares. J.Wiley (1998)."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0377-2217(94)90034-5","volume":"77","author":"D. Magos","year":"1994","unstructured":"Magos D., Miliotis P.: An algorithm for the planar three-index assignment problem. European Journal of Operational Research 77 (1994) 141\u2013153.","journal-title":"European Journal of Operational Research"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Nemhauser G. L., Wolsey L. A.: Integer and Combinatorial Optimization. J.Wiley (1988).","DOI":"10.1002\/9781118627372"},{"key":"2_CR13","unstructured":"Regin J. C.: A filtering algorithm for constraints of difference in CSPs. Proceedings of National Conference on Artificial Intelligence (1994), 362\u2013367."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"M. W. P. Savelsbergh","year":"1994","unstructured":"Savelsbergh M. W. P.: Preprocessing and Probing for Mixed Integer Programming Problems. ORSA J. on Computing, 6 (1994) 445\u2013454.","journal-title":"ORSA J. on Computing"},{"key":"2_CR15","unstructured":"Tsang E.: Foundations of Constraint Satisfaction, Acad. Press (1993)."},{"key":"2_CR16","unstructured":"Dash Associates: XPRESS-MP Version 12, Reference Manual (2001)."},{"key":"2_CR17","unstructured":"Zhang H., Hsiang J.: Solving open quasigroup problems by propositional reasoning, Proc. of International Computer Symposium, Hsinchu, Taiwan (1994)."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46135-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T00:25:54Z","timestamp":1556411154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}