{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:42:04Z","timestamp":1725514924417},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540723967"},{"type":"electronic","value":"9783540723974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72397-4_20","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T19:56:32Z","timestamp":1182542192000},"page":"275-287","source":"Crossref","is-referenced-by-count":3,"title":["The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width"],"prefix":"10.1007","author":[{"given":"Meinolf","family":"Sellmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"Mercier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel H.","family":"Leventhal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","volume-title":"Network Flows","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnati, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/11757375_4","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"I.D. Aron","year":"2006","unstructured":"Aron, I.D., Leventhal, D.H., Sellmann, M.: A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming. In: Beck, J.C., Smith, B.M. (eds.) CPAIOR 2006. LNCS, vol.\u00a03990, pp. 16\u201328. Springer, Heidelberg (2006)"},{"key":"20_CR3","unstructured":"Bienstock, D.: Approximate formulations for 0-1 knapsack sets. CORC Report TR-2006-03, Columbia University (2006)"},{"key":"20_CR4","unstructured":"Bienstock, D., Ozbay, N.: Tree-width and the Sherali-Adams operator (2003), http:\/\/citeseer.ist.psu.edu\/bienstock03treewidth.html"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A Linear Time Algorithm for Finding Tree-decompositions of Small Treewidth. SIAM Journal on Computing\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R. Dechter","year":"1989","unstructured":"Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artificial Intelligence\u00a038, 353\u2013366 (1989)","journal-title":"Artificial Intelligence"},{"key":"20_CR7","unstructured":"Freuder, E.C.: Complexity of k-tree structured constraint satisfaction problems. In: AAAI, pp. 4\u20139 (1990)"},{"key":"20_CR8","unstructured":"Gent, I.P.: Arc Consistency in SAT. In: ECAI, pp. 121\u2013125 (2002)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/978-3-540-30201-8_24","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"J.N. Hooker","year":"2004","unstructured":"Hooker, J.N.: A hybrid method for planning and scheduling. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 305\u2013316. Springer, Heidelberg (2004)"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0004-3702(90)90009-O","volume":"45","author":"S. Kasif","year":"1990","unstructured":"Kasif, S.: On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence\u00a045, 275\u2013286 (1990)","journal-title":"Artificial Intelligence"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/11493853_20","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"M.O.I. Khemmoudj","year":"2005","unstructured":"Khemmoudj, M.O.I., Bennaceur, H., Nagih, A.: Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 258\u2013272. Springer, Heidelberg (2005)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11757375_14","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"R. Marinescu","year":"2006","unstructured":"Marinescu, R., Dechter, R.: AND\/OR Branch-and-Bound Search for Pure 0\/1 Integer Linear Programming Problems. In: Beck, J.C., Smith, B.M. (eds.) CPAIOR 2006. LNCS, vol.\u00a03990, pp. 152\u2013166. Springer, Heidelberg (2006)"},{"key":"20_CR13","unstructured":"Milano, M.: Integration of Mathematical Programming and Constraint Programming for Combinatorial Optimization Problems. In: Tutorial at CP (2000)"},{"key":"20_CR14","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, Chichester (1988)"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors - Algorithmic aspects of treewidth. Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Algorithms"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H.D. Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics\u00a03, 411\u2013430 (1990)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2\u20133","key":"20_CR17","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10107-005-0663-7","volume":"105","author":"M. Vyve Van","year":"2006","unstructured":"Van Vyve, M., Wolsey, L.A.: Approximate extended formulations. Mathematical Programming\u00a0105(2\u20133), 501\u2013522 (2006)","journal-title":"Mathematical Programming"}],"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-72397-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T06:39:46Z","timestamp":1707979186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72397-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540723967","9783540723974"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72397-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}