Abstract
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure results in a polynomial-size linear programming description of the convex hull of all integer feasible solutions when the BCP that is given has bounded tree-width.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R.K., Magnati, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)
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. 3990, pp. 16–28. Springer, Heidelberg (2006)
Bienstock, D.: Approximate formulations for 0-1 knapsack sets. CORC Report TR-2006-03, Columbia University (2006)
Bienstock, D., Ozbay, N.: Tree-width and the Sherali-Adams operator (2003), http://citeseer.ist.psu.edu/bienstock03treewidth.html
Bodlaender, H.L.: A Linear Time Algorithm for Finding Tree-decompositions of Small Treewidth. SIAM Journal on Computing 25, 1305–1317 (1996)
Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artificial Intelligence 38, 353–366 (1989)
Freuder, E.C.: Complexity of k-tree structured constraint satisfaction problems. In: AAAI, pp. 4–9 (1990)
Gent, I.P.: Arc Consistency in SAT. In: ECAI, pp. 121–125 (2002)
Hooker, J.N.: A hybrid method for planning and scheduling. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 305–316. Springer, Heidelberg (2004)
Kasif, S.: On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence 45, 275–286 (1990)
Khemmoudj, M.O.I., Bennaceur, H., Nagih, A.: Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 258–272. Springer, Heidelberg (2005)
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. 3990, pp. 152–166. Springer, Heidelberg (2006)
Milano, M.: Integration of Mathematical Programming and Constraint Programming for Combinatorial Optimization Problems. In: Tutorial at CP (2000)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, Chichester (1988)
Robertson, N., Seymour, P.D.: Graph minors - Algorithmic aspects of treewidth. Algorithms 7, 309–322 (1986)
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 3, 411–430 (1990)
Van Vyve, M., Wolsey, L.A.: Approximate extended formulations. Mathematical Programming 105(2–3), 501–522 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Sellmann, M., Mercier, L., Leventhal, D.H. (2007). The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width. In: Van Hentenryck, P., Wolsey, L. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2007. Lecture Notes in Computer Science, vol 4510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72397-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-72397-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72396-7
Online ISBN: 978-3-540-72397-4
eBook Packages: Computer ScienceComputer Science (R0)