Abstract
AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the structure of the model, which can translate into exponential time savings for search algorithms. In this paper we introduce an AND/OR search algorithm that explores a context-minimal AND/OR search graph in a best-first manner for solving 0/1 Integer Linear Programs (0/1 ILP). We also extend to the 0/1 ILP domain the depth-first AND/OR Branch-and-Bound search with caching algorithm which was recently proposed by [1] for solving optimization tasks in graphical models. The effectiveness of the best-first AND/OR search approach compared to depth-first AND/OR Branch-and-Bound search is demonstrated on a variety of benchmarks for 0/1 ILPs, including instances from the MIPLIB library, real-world combinatorial auctions, random uncapacitated warehouse location problems and MAX-SAT instances.
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
Marinescu, R., Dechter, R.: Memory intensive branch-and-bound search for graphical models. In: National Conference on Artificial Intelligence, AAAI’06 (2006)
Nemhauser, G., Wolsey, L.: Integer and combinatorial optimization. Wiley, Chichester (1988)
Lawler, E., Wood, D.: Branch-and-bound methods: A survey. Operations Research 14(4), 699–719 (1966)
Dechter, R., Mateescu, R.: And/or search spaces for graphical models. Artificial Intelligence (2006)
Marinescu, R., Dechter, R.: And/or branch-and-bound for graphical models. In: International Joint Conference on Artificial Intelligence (IJCAI’05), pp. 224–229 (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)
Marinescu, R., Dechter, R.: Dynamic orderings for and/or branch-and-bound search in graphical models. In: European Conference on Artificial Intelligence (ECAI’06), pp. 138–142 (2006)
Dechter, R., Pearl, J.: Generalized best-first search strategies and the optimality of a*. Journal of ACM 32(3), 505–536 (1985)
Dantzig, G.B.: Maximization of a linear function of variables subject to linear inequalities. Activity Analysis of Production and Allocation (1951)
Vasquez, M., Hao, J.: A hybrid approach for the 0/1 multidimensional knapsack approach. In: International Joint Conference on Artificial Intelligence (IJCAI’01), pp. 328–333 (2001)
Shih, W.: A branch-and-bound method for the multiconstraint 0/1 knapsack problem. Journal of the Operational Research Society 30, 369–378 (1979)
Gavish, B., Pirkul, H.: Allocation of data bases and processors in a distributed computing system. Management of Distributed Data Processing 31, 215–231 (1982)
Sandholm, T.: An algorithm for optimal winner determination in combinatorial auctions. In: International Joint Conference on Artificial Intelligence (IJCAI’99), pp. 542–547 (1999)
Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: ACM Electronic Commerce, pp. 66–76 (2000)
Joy, S., Mitchell, J., Borchers, B.: A branch and cut algorithm for max-sat and weighted max-sat. In: Satisfiability Problem: Theory and Applications, pp. 519–536 (1997)
Xing, Z., Zhang, W.: Efficient strategies for (Weighted) maximum satisfiability. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 690–705. Springer, Heidelberg (2004)
Freuder, E., Quinn, M.: Taking advantage of stable sets of variables in constraint satisfaction problems. In: International Joint Conference on Artificial Intelligence (IJCAI’85), pp. 1076–1078 (1985)
Darwiche, A.: Recursive conditioning. Artificial Intelligence 126(1-2), 5–41 (2001)
Nillson, K.: Principles of Artificial Intelligence. Tioga, Palo Alto (1980)
de Givry, S., Larrosa, J., Meseguer, P., Schiex, T.: Solving max-SAT as weighted CSP. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 363–376. Springer, Heidelberg (2003)
Aloul, F., Ramani, A., Markov, I., Sakallah, K.: Pbs: A backtrack search pseudo-boolean solver. In: Symposium on the Theory and Applications of Satisfiability Testing, SAT’02 (2002)
Chakrabati, P., Ghose, S., Acharya, A., de Sarkar, S.: Heuristic search in restricted memory. Artificial Intelligence 3(41), 197–221 (1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Marinescu, R., Dechter, R. (2007). Best-First AND/OR Search for 0/1 Integer Programming. 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_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-72397-4_13
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)