{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:37Z","timestamp":1725663637954},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540569442"},{"type":"electronic","value":"9783540478300"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56944-8_40","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:58:10Z","timestamp":1330239490000},"page":"40-51","source":"Crossref","is-referenced-by-count":4,"title":["Linear 0\u20131 inequalities and extended clauses"],"prefix":"10.1007","author":[{"given":"Peter","family":"Barth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591796","volume":"30","author":"E. Balas","year":"1984","unstructured":"E. Balas and J. B. Mazzola. Nonlinear 0\u20131 programming: I. Linearization techniques. Mathematical Programming, 30:1\u201321, 1984.","journal-title":"Mathematical Programming"},{"key":"4_CR2","unstructured":"P. Barth. A complete symbolic 0\u20131 constraint solver. In ACCLAIM Kick-Off Workshop, Stockholm, November 1992."},{"key":"4_CR3","volume-title":"Solving 0\u20131 problems in CLP(PB)","author":"P. Barth","year":"1993","unstructured":"P. Barth and A. Bockmayr. Solving 0\u20131 problems in CLP(PB). In Proc. 9th Conf. Artificial Intelligence for Applications (CAIA), Orlando. IEEE, 1993."},{"key":"4_CR4","unstructured":"A. Bockmayr. Logic programming with pseudo-Boolean constraints. In A. Colmerauer and F. Benhamou, editors, Constraint Logic Programming \u2014 Selected Research. MIT Press, 1992. (to appear)."},{"issue":"5","key":"4_CR5","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"H. Crowder, E.L. Johnson, and M. Padberg. Solving large-scale zero-one linear programming problems. Operations Research, 31(5):803\u2013834, September 1983.","journal-title":"Operations Research"},{"key":"4_CR6","first-page":"154","volume":"12","author":"F. Granot","year":"1971","unstructured":"F. Granot and P. L. Hammer. On the use of boolean functions in 0\u20131 programming. Methods of Operations Research, 12:154\u2013184, 1971.","journal-title":"Methods of Operations Research"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"P.L. Hammer and S. Rudeanu. Boolean Methods in Operations Research and Related Areas. Springer-Verlag, 1968.","DOI":"10.1007\/978-3-642-85823-9"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF01531033","volume":"6","author":"J. N. Hooker","year":"1992","unstructured":"J. N. Hooker. Generalized resolution for 0\u20131 linear inequalities. Annals of Mathematics and Artificial Intelligence, 6:271\u2013286, 1992.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.-L. Lassez. Constraint logic programming. In Proc. 14th ACM Symp. Principles of Programming Languages, Munich, 1987.","DOI":"10.1145\/41625.41635"},{"issue":"4","key":"4_CR10","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.33.4.803","volume":"33","author":"E.L. Johnson","year":"1985","unstructured":"E.L. Johnson, M. Kostreva, and U.H. Suhl. Solving 0\u20131 integer programming problems arising from large scale planning models. Operations Research, 33(4):803\u2013819, July 1985.","journal-title":"Operations Research"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. Series in Discrete Mathematics and Optimization. Wiley-Interscience, 1988.","DOI":"10.1002\/9781118627372"},{"key":"4_CR12","unstructured":"P. Van Hentenryck. Constraint satisfaction in logic programming. MIT Press, 1989."}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56944-8_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:07:37Z","timestamp":1605629257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56944-8_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569442","9783540478300"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-56944-8_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}