Hierarchical optimization: an introduction
Annals of Operations Research - Special issue on hierarchical optimization
Generic ILP versus specialized 0-1 ILP: an update
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Comparing Arguments Using Preference Orderings for Argument-Based Reasoning
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Satisfiability-Based Algorithms for Boolean Optimization
Annals of Mathematics and Artificial Intelligence
Managing the Complexity of Large Free and Open Source Package-Based Software Distributions
ASE '06 Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering
OPIUM: Optimal Package Install/Uninstall Manager
ICSE '07 Proceedings of the 29th international conference on Software Engineering
Planning as satisfiability with preferences
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Within-problem learning for efficient lower bound computation in Max-SAT solving
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
MINIMAXSAT: an efficient weighted max-SAT solver
Journal of Artificial Intelligence Research
Solving multi-objective pseudo-boolean problems
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
A bilevel programming approach to the travelling salesman problem
Operations Research Letters
Dependency management for the eclipse ecosystem: eclipse p2, metadata and resolution
Proceedings of the 1st international workshop on Open component ecosystems
Boolean lexicographic optimization: algorithms & applications
Annals of Mathematics and Artificial Intelligence
Efficient and accurate haplotype inference by combining parsimony and pedigree information
ANB'10 Proceedings of the 4th international conference on Algebraic and Numeric Biology
Reformulation based MaxSAT robustness
Constraints
HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
| Hi-index | 0.00 |
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 number of potential applications. The experimental results indicate that algorithms for BMO allow solving optimization problems that existing MaxSAT and PB solvers would otherwise be unable to solve.