{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T15:40:12Z","timestamp":1736523612657,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540377917"},{"type":"electronic","value":"9783540377931"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11821069_48","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T10:25:12Z","timestamp":1156501512000},"page":"549-560","source":"Crossref","is-referenced-by-count":5,"title":["Generalised Integer Programming Based on Logically Defined Relations"],"prefix":"10.1007","author":[{"given":"Peter","family":"Jonsson","sequence":"first","affiliation":[]},{"given":"Gustav","family":"Nordh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"48_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)"},{"key":"48_CR2","unstructured":"Creignou, N., Hermann, M., Krokhin, A., Salzer, G.: Complexity of clausal constraints over chains (2006). To appear in: Theory of Computing Systems (2006), Preliminary version available from www.cis.syr.edu\/~royer\/lcc\/LCC05"},{"key":"48_CR3","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718546","volume-title":"Complexity Classifications of Boolean Constraint Satisfaction Problems","author":"N. Creignou","year":"2001","unstructured":"Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications, vol.\u00a07. SIAM, Philadelphia (2001)"},{"key":"48_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"J. Gil, \u00c0., Hermann, M., Salzer, G., Zanuttini, B.: Efficient algorithms for constraint description problems over finite totally ordered domains. In: Proceedings of Automated Reasoning, Second International Joint Conference (IJCAR 2004), pp. 244\u2013258 (2004)","DOI":"10.1007\/978-3-540-25984-8_17"},{"key":"48_CR6","doi-asserted-by":"crossref","unstructured":"H\u00e4hnle, R.: Complexity of many-valued logics. In: Proceedings of the 31st IEEE International Symposium on Multiple-valued Logic (ISMVL 2001), pp. 137\u2013148 (2001)","DOI":"10.1109\/ISMVL.2001.924565"},{"key":"48_CR7","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0166-218X(99)00100-6","volume":"96-97","author":"J.N. Hooker","year":"1999","unstructured":"Hooker, J.N., Osorio, M.: Mixed logical-linear programming. Discrete Applied Mathematics\u00a096-97, 395\u2013442 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0004-3702(95)00107-7","volume":"79","author":"P.G. Jeavons","year":"1996","unstructured":"Jeavons, P.G., Cooper, M.C.: Tractable constraints on ordered domains. Artificial Intelligence\u00a079, 327\u2013339 (1996)","journal-title":"Artificial Intelligence"},{"issue":"1-2","key":"48_CR9","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0304-3975(98)00343-0","volume":"244","author":"P. Jonsson","year":"2000","unstructured":"Jonsson, P.: Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights. Theoretical Computer Science\u00a0244(1-2), 189\u2013203 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"48_CR10","doi-asserted-by":"publisher","first-page":"1863","DOI":"10.1137\/S0097539799349948","volume":"30","author":"S. Khanna","year":"2000","unstructured":"Khanna, S., Sudan, M., Trevisan, L., Williamson, D.P.: The approximability of constraint satisfaction problems. SIAM J. Comput.\u00a030(6), 1863\u20131920 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"48_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1145\/321864.321877","volume":"22","author":"R.E. Ladner","year":"1975","unstructured":"Ladner, R.E.: On the structure of polynomial time reducibility. Journal of the ACM\u00a022(1), 155\u2013171 (1975)","journal-title":"Journal of the ACM"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"P\u00f6schel, R., Kalu\u017enin, L.: Funktionen- und Relationenalgebren. DVW, Berlin (1979)","DOI":"10.1007\/978-3-0348-5547-1"},{"key":"48_CR13","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/jctb.2000.1989","volume":"80","author":"A. Schrijver","year":"2000","unstructured":"Schrijver, A.: A combinatorial algorithm minimizing submodular functions in polynomial time. Journal of Combinatorial Theory, ser. B\u00a080, 346\u2013355 (2000)","journal-title":"Journal of Combinatorial Theory, ser. B"},{"key":"48_CR14","unstructured":"Wolfman, S.A., Weld, D.S.: The LPSAT engine & its application to resource planning. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 310\u2013317 (1999)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11821069_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T15:23:00Z","timestamp":1736522580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11821069_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377917","9783540377931"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11821069_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}