Proceedings

On Solving Boolean Multilevel Optimization Problemse

Download BibTeX Cite

Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 393-397.

© 2009 International Joint Conferences on Artificial Intelligence

Abstract

Many combinatorial optimization problems entail a number of hierarchically dependent optimization problems. An often used solution is to associate a suitably large cost with each individual optimization problem, such that the solution of the resulting aggregated optimization problem solves the original set of optimization problems. This paper starts by studying the package upgradeability problem in software distributions. Straightforward solutions based on Maximum Satisfiability (MaxSAT) and pseudo-Boolean (PB) optimization are shown to be ineffective, and unlikely to scale for large problem instances. Afterwards, the package upgradeability problem is related to multilevel optimization. The paper then develops new algorithms for Boolean Multilevel Optimization (BMO) and highlights a large number of potential applications. The experimental results indicate that the proposed algorithms for BMO allow solving optimization problems that existing MaxSAT and PB solvers would otherwise be unable to solve.Josep Argelich, Inês Lynce, Joao Marques-Silva

  1. [Aloul et al., 2002] F. A. Aloul, A. Ramani, I. L. Markov, and K. A. Sakallah. Generic ILP versus specialized 0-1 ILP: an update. In International Conference on Computer- Aided Design, pages 450-457, 2002.
  2. [Amgoud et al., 1996] L. Amgoud, C. Cayrol, and D. Le Berre. Comparing arguments using preference ordering for argument-based reasoning. In Int. Conf. on Tools with Artificial Intelligence, pages 400-403, 1996.
  3. [Anandalingam and Friesz, 1992] G. Anandalingam and T. L. Friesz. Hierarchical optimization: An introduction. Annals of Operations Research, 34:1-11, 1992.
  4. [Argelich and Lynce, 2008] J. Argelich and I. Lynce. CNF instances from the software package installation problem. In RCRA Workshop, 2008.
  5. [Argelich and Manyà, 2007] J. Argelich and F. Manyà. An improved exact solver for partial Max-SAT. In Int. Conf. on Nonconvex Programming: Local & Global Ap- proaches, pages 230-231, 2007.
  6. [Boutilier et al., 2004] C. Boutilier, R. I. Brafman, C. Domshlak, H. H. Hoos, and D. Poole. CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. Journal of Artificial Intelligence Research, 21:135-191, 2004.
  7. [Bracken and McGill, 1973] J. Bracken and J. T. McGill. Mathematical programs with optimization problems in the constraints. Operations Research, 21:37-44, 1973.
  8. [Candler and Norton, 1977] W. Candler and R. Norton. Multi-level programming. Technical Report DRD-20, World Bank, January 1977.
  9. [Colson et al., 2007] B. Colson, P. Marcotte, and G. Savard. An overview of bilevel programming. Annals of Opera- tions Research, 153:235-256, 2007.
  10. [Denegre and Ralphs, 2009] S. Denegre and T. Ralphs. A branch-and-cut algorithm for integer bilevel linear pro- grams. In INFORMS Comp. Soc. Meeting, January 2009.
  11. [Eén and Sörensson, 2006] N. Eén and N. Sörensson. Trans- lating pseudo-Boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation, 2:226, 2006.
  12. Freuder et al., In Press] E. Freuder, R. Heffernan, R. Wal- lace, and N. Wilson. Lexicographically-ordered constraint satisfaction problems. Constraints, In Press.
  13. [Giunchiglia and Maratea, 2007] E. Giunchiglia and M. Maratea. Planning as satisfiability with preferences. In AAAI Conference on Artificial Intelligence, pages 987-992, 2007.
  14. [Heras et al., 2008] F. Heras, J. Larrosa, and A. Oliveras. MiniMaxSAT: An efficient weighted Max-SAT solver. Journal of Artificial Intelligence Research, 31:1-32, 2008.
  15. [Junker, 2004] U. Junker. Preference-based search and multi-criteria optimization. Annals of Operations Re- search, 130(1-4):75-115, 2004.
  16. [Lin et al., 2008] H. Lin, K. Su, and C.-M. Li. Within- problem learning for efficient lower bound computation in max-sat solving. In AAAI Conference on Artificial Intelli- gence, pages 351-356, 2008.
  17. [Lukasiewycz et al., 2007] M. Lukasiewycz, M. Glaß, C. Haubelt, and Jürgen Teich. Solving multi-objective pseudo-boolean problems. In Int. Conf. on Theory and Applications of Satisfiability Testing, pages 56-69, 2007.
  18. [Mancinelli et al., 2006] F. Mancinelli, J. Boender, R. di Cosmo, J. Vouillon, B. Durak, X. Leroy, and R. Treinen. Managing the complexity of large free and open source package-based software distributions. In Int. Conf. Automated Soft. Engineering, pages 199-208, 2006.
  19. [Manquinho and Marques-Silva, 2004] V. Manquinho and J. Marques-Silva. Satisfiability-based algorithms for boolean optimization. Annals of Mathematics and Arti- ficial Intelligence, 40(3-4):353-372, 2004.
  20. [Marcotte et al., 2004] P. Marcotte, G. Savard, and F. Semet. A bilevel programming to the travelling salesman problem. Operations Research Letters, 21:240-248, 2004.
  21. [Meseguer et al., 2006] P. Meseguer, F. Rossi, and T. Schiex. Soft constraints. In Handbook of Constraint Program- ming, pages 281-328. 2006.
  22. [Rossi et al., 2008] F. Rossi, K. B. Venable, and T. Walsh. Preferences in constraint satisfaction and optimization. AI Magazine, 29(4), 2008.
  23. [Tucker et al., 2007] C. Tucker, D. Shuffelton, R. Jhala, and S. Lerner. OPIUM: Optimal package install/uninstall man- ager. In Int. Conf. Soft. Engineering, pages 178-188, 2007.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards