Computer Science – Logic in Computer Science
Scientific paper
2009-03-31
Computer Science
Logic in Computer Science
Scientific paper
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 hierarchically dependent 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.
Argelich Josep
Lynce Inês
Marques-Silva Joao
No associations
LandOfFree
On Solving Boolean Multilevel Optimization Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Solving Boolean Multilevel Optimization Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Solving Boolean Multilevel Optimization Problems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-592833