Abstract
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-first AND/OR search algorithms to solving 0-1 Integer Linear Programs (0-1 ILP) within this framework. We also include a class of dynamic variable ordering heuristics while exploring an AND/OR search tree for 0-1 ILPs. We demonstrate the effectiveness of these search algorithms on a variety of benchmarks, including real-world combinatorial auctions, random uncapacitated warehouse location problems and MAX-SAT instances.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Aloul, F., Ramani, A., Markov, I., & Sakallah, K. (2002). PBS: A backtrack search pseudo-boolean solver. In Symposium on the theory and applications of satisfiability testing (SAT).
Bacchus, F., Dalmao, S., & Pittasi, T. (2003). Value elimination: Bayesian inference via backtracking search. In Uncertainty in artificial intelligence (UAI) (pp. 20–28).
Bayardo, R., & Miranker, D. (1995). On the space-time trade-off in solving constraint satisfaction problems. In International joint conference on artificial intelligence (IJCAI) (pp. 558–562).
Benichou, M., Gauthier, J. M., Girodet, P., Hentges, G., Ribiere, G., & Vincent, O. (1971). Experiments in mixed-integer programming. Mathematical Programming, 1(1), 76–94.
Bistarelli, S., Montanari, U., & Rossi, F. (1997). Semiring based constraint solving and optimization. Journal of the ACM, 44(2), 309–315.
Chakrabati, P., Ghose, S., Acharya, A., & de Sarkar, S. (1989). Heuristic search in restricted memory. Artificial Intelligence, 41(3), 197–221.
Chvatal, V., Applegate, D., Bixby, R., & Cook, W. (1995). Finding cuts in the TSP (a preliminary report). Technical Report 95-05, DIMACS, Rutgers University.
Collin, Z., Dechter, R., & Katz, S. (1991). On the feasibility of distributed constraint satisfaction. In International joint conference on artificial intelligence (IJCAI) (pp. 318–324).
Cramton, P., Shoham, Y., & Steinberg, R. (2006). Combinatorial auctions. Cambridge: MIT.
Dantzig, G. B. (1951). Maximization of a linear function of variables subject to linear inequalities. Activity analysis of production and allocation.
Darwiche, A. (2001). Recursive conditioning. Artificial Intelligence, 126(1–2), 5–41.
Dechter, R. (1990). Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition. Artificial Intelligence, 41(3), 273–312.
Dechter, R. (2003). Constraint processing. Cambridge: MIT.
Dechter, R., & Mateescu, R. (2007). AND/OR search spaces for graphical models. Artificial Intelligence, 171(2–3), 73–106.
Dechter, R., & Pearl, J. (1985). Generalized best-first search strategies and the optimality of A*. Journal of the ACM, 32(3), 505–536.
de Givry, S., Heras, F., Larrosa, J., & Zytnicki, M. (2005). Existential arc consistency: Getting closer to full arc consistency in weighted CSPs. In International joint conference in artificial intelligence (IJCAI).
de Givry, S., Larrosa, J., & Schiex, T. (2003). Solving Max-SAT as weighted CSP. In Principles and practice of constraint programming (CP).
Dixon, H., & Ginsberg, M. L. (2006). Inference methods for a pseudo-boolean satisfiability solver. In National conference on artificial intelligence (AAAI) (pp. 635–640).
Freuder, E., & Quinn, M. (1985). Taking advantage of stable sets of variables in constraint satisfaction problems. In International joint conference on artificial intelligence (IJCAI) (pp. 1076–1078).
Jegou, P., & Terrioux, C. (2004). Decomposition and good recording for solving Max-CSPs. In European conference on artificial intelligence (ECAI) (pp. 196–200).
Joy, S., Mitchell, J., & Borchers, B. (1997). A branch and cut algorithm for Max-SAT and weighted Max-SAT. In Satisfiability problem: Theory and applications (pp. 519–536).
Kanal, L., & Kumar, V. (1988). Search in artificial intelligence. New York: Springer.
Karmarkar, N. (1984). A new polynomial time algorithm for linear programming. Combinatorica, 4(4), 373–395.
Karp, R. (1972). Reducibility among combinatorial problems. Complexity of computer computations (pp. 85–103). New York: Plenum.
Khachian, L. G. (1979). A polynomial algorithm in linear programming. Doklady Akademii Nauk SSSR, 244(5), 1093–1096 (in Russian).
Korf, R. (1993). Linear-space best-first search. Artificial Intelligence, 62(1), 41–78.
Larrosa, J., Meseguer, P., & Sanchez, M. (2002). Pseudo-tree search with soft constraints. In European conference on artificial intelligence (ECAI) (pp. 131–135).
Lawler, E., & Wood, D. (1966). Branch-and-bound methods: A survey. Operations Research, 14(4), 699–719.
Lemaitre, M., Verfaillie, G., & Schiex, T. (1996). Russian doll search for solving constraint optimization problems. In National conference on artificial intelligence (AAAI) (pp. 298–304).
Leyton-Brown, K., Pearson, M., & Shoham, Y. (2000). Towards a universal test suite for combinatorial auction algorithms. In ACM electronic commerce (pp. 66–76).
Marinescu, R., & Dechter, R. (2005). AND/OR branch-and-bound for graphical models. In International joint conference on artificial intelligence (IJCAI) (pp. 224–229).
Marinescu, R., & Dechter, R. (2006). AND/OR branch-and-bound search for pure 0/1 integer linear programming problems. In International conference on integration of AI and OR techniques in constraint programming for combinatorial optimization (CPAIOR) (pp. 152–166).
Marinescu, R., & Dechter, R. (2006). Memory intensive branch-and-bound search for graphical models. In National conference on artificial intelligence (AAAI).
Marinescu, R., & Dechter, R. (2006). Dynamic orderings for AND/OR branch-and-bound search in graphical models. In European conference on artificial intelligence (ECAI) (pp. 138–142).
Marinescu, R., & Dechter, R. (2007). Best-first AND/OR search for 0/1 integer programming. In International conference on integration of AI and OR techniques in constraint programming for combinatorial optimization (CPAIOR).
Marinescu, R., & Dechter, R. (2007). Best-first AND/OR search for graphical models. In National conference on artificial intelligence (AAAI) (pp. 1171–1176).
Marinescu, R., & Dechter, R. (2007). Best-first AND/OR search for most probable explanations. In International conference on uncertainty in artificial intelligence (UAI).
Marinescu, R., & Dechter, R. (2008). AND/OR branch-and-bound search for combinatorial optimization in graphical models. Technical report, University of California, Irvine.
Marinescu, R., & Dechter, R. (2008). Memory intensive AND/OR search for combinatorial optimization in graphical models. Technical report, University of California, Irvine.
Nemhauser, G., & Wolsey, L. (1988). Integer and combinatorial optimization. New York: Wiley.
Nilsson, N. J. (1980). Principles of artificial intelligence. Tioga.
Nilsson, N., Hart, P., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 8(2), 100–107.
Padberg, M., & Rinaldi, G. (1987). Optimization of a 532-city symmetric traveling salesman problem by branch-and-cut. Operations Research Letters, 6(1), 1–7.
Padberg, M., & Rinaldi, G. (1991). A branch-and-cut algorithm for the resolution of large scale symmetric traveling salesman problems. SIAM Review, 33(1), 60–100.
Pearl, J. (1984). Heuristics: Intelligent search strategies for computer problem solving. Reading: Addison-Welsey.
Walser, J. P. (1999). Integer optimization local search. New York: Springer.
Wolsey, J. (1998). Integer programming. New York: Wiley.
Xing, Z., & Zhang, W. (2004). Efficient strategies for (weighted) maximum satisfiability. In Principles and practice of constraint programming (CP) (pp. 660–705).
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was done while at the University of California, Irvine.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Marinescu, R., Dechter, R. Evaluating the impact of AND/OR search on 0-1 integer linear programming. Constraints 15, 29–63 (2010). https://doi.org/10.1007/s10601-009-9070-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10601-009-9070-7