{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:14:23Z","timestamp":1726409663141},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027765"},{"type":"electronic","value":"9783642027772"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02777-2_40","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T06:58:18Z","timestamp":1245999498000},"page":"441-446","source":"Crossref","is-referenced-by-count":11,"title":["Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?"],"prefix":"10.1007","author":[{"given":"Timo","family":"Berthold","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Heinz","sequence":"additional","affiliation":[]},{"given":"Marc E.","family":"Pfetsch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Achterberg, T.: Constraint Integer Programming. PhD thesis, TU Berlin (2007)","key":"40_CR1"},{"doi-asserted-by":"crossref","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Mathematical Programming Computation, 1 (2008)","key":"40_CR2","DOI":"10.1007\/s12532-008-0001-1"},{"key":"40_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/978-3-540-68155-7_4","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"T. Achterberg","year":"2008","unstructured":"Achterberg, T., Berthold, T., Koch, T., Wolter, K.: Constraint integer programming: A new approach to integrate CP and MIP. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 6\u201320. Springer, Heidelberg (2008)"},{"issue":"2","key":"40_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1287\/opre.38.2.217","volume":"38","author":"W.P. Adams","year":"1990","unstructured":"Adams, W.P., Sherali, H.D.: Linearization strategies for a class of zero-one mixed integer programming problems. Oper. Res.\u00a038(2), 217\u2013226 (1990)","journal-title":"Oper. Res."},{"key":"40_CR5","first-page":"450","volume-title":"Proc. of the 2002 IEEE\/ACM International Conference on Computer-aided Design","author":"F.A. Aloul","year":"2002","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Generic ILP versus specialized 0-1 ILP: an update. In: Pileggi, L.T., Kuehlmann, A. (eds.) Proc. of the 2002 IEEE\/ACM International Conference on Computer-aided Design, pp. 450\u2013457. ACM, New York (2002)"},{"unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: PBS: A backtrack-search pseudo-boolean solver and optimizer. In: Proc. Fifth International Symposium on Theory and Applications of Satisfiability Testing (SAT 2002), pp. 346\u2013353 (2002)","key":"40_CR6"},{"issue":"1","key":"40_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02591796","volume":"30","author":"E. Balas","year":"1984","unstructured":"Balas, E., Mazzola, J.B.: Nonlinear 0-1 programming: I. Linearization techniques. Math. Prog.\u00a030(1), 1\u201321 (1984)","journal-title":"Math. Prog."},{"unstructured":"Berre, D.L.: Sat4j, http:\/\/www.sat4j.org\/","key":"40_CR8"},{"unstructured":"Clp. COIN-OR LP-solver, http:\/\/www.coin-or.org\/projects\/Clp.xml","key":"40_CR9"},{"key":"40_CR10","first-page":"1","volume":"2","author":"N. E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-boolean constraints into SAT. J. Satisf. Boolean Model. Comput.\u00a02, 1\u201326 (2006)","journal-title":"J. Satisf. Boolean Model. Comput."},{"issue":"1","key":"40_CR11","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F. Glover","year":"1974","unstructured":"Glover, F., Woolsey, E.: Converting the 0-1 polynomial programming problem to a 0-1 linear program. Oper. Res.\u00a022(1), 180\u2013182 (1974)","journal-title":"Oper. Res."},{"unstructured":"GLPK. GNU linear programming kit, http:\/\/www.gnu.org\/software\/glpk\/","key":"40_CR12"},{"unstructured":"Hemery, F., Lecoutre, C.: AbsconPseudo 2006 (2006), http:\/\/www.cril.univ-artois.fr\/PB06\/papers\/abscon2006V2.pdf","key":"40_CR13"},{"key":"40_CR14","first-page":"209","volume":"2","author":"V.M. Manquinho","year":"2006","unstructured":"Manquinho, V.M., Marques-Silva, J.: On using cutting planes in pseudo-Boolean optimization. J. Satisf. Boolean Model. Comput.\u00a02, 209\u2013219 (2006)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"40_CR15","first-page":"103","volume":"2","author":"V.M. Manquinho","year":"2006","unstructured":"Manquinho, V.M., Roussel, O.: The first evaluation of pseudo-Boolean solvers (PB 2005). J. Satisf. Boolean Model. Comput.\u00a02, 103\u2013143 (2006)","journal-title":"J. Satisf. Boolean Model. Comput."},{"unstructured":"Manquinho, V.M., Roussel, O.: Pseudo-Boolean evaluation 2007 (2007), http:\/\/www.cril.univ-artois.fr\/PB07\/","key":"40_CR16"},{"unstructured":"SCIP. Solving Constraint Integer Programs, http:\/\/scip.zib.de\/","key":"40_CR17"},{"key":"40_CR18","first-page":"165","volume":"2","author":"H.M. Sheini","year":"2006","unstructured":"Sheini, H.M., Sakallah, K.A.: Pueblo: A hybrid pseudo-boolean SAT solver. J. Satisf. Boolean Model. Comput.\u00a02, 165\u2013189 (2006)","journal-title":"J. Satisf. Boolean Model. Comput."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02777-2_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T02:57:52Z","timestamp":1558407472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}