5,572 research outputs found
Effective Lower Bounding Techniques for Pseudo-Boolean Optimization
Linear Pseudo-Boolean Optimization (PBO) is a widely used modeling framework in Electronic Design Automation (EDA). Due to significant advances in Boolean Satisfiability (SAT), new algorithms for PBO have emerged, which are effective on highly constrained instances. However, these algorithms fail to handle effectively the information provided by the cost function of PBO. This paper addresses the integration of lower bound estimation methods with SAT-related techniques in PBO solvers. Moreover, the paper shows that the utilization of lower bound estimates can dramatically improve the overall performance of PBO solvers for most existing benchmarks from EDA. 1
Handling software upgradeability problems with MILP solvers
Upgradeability problems are a critical issue in modern operating systems. The
problem consists in finding the "best" solution according to some criteria, to
install, remove or upgrade packages in a given installation. This is a
difficult problem: the complexity of the upgradeability problem is NP complete
and modern OS contain a huge number of packages (often more than 20 000
packages in a Linux distribution). Moreover, several optimisation criteria have
to be considered, e.g., stability, memory efficiency, network efficiency. In
this paper we investigate the capabilities of MILP solvers to handle this
problem. We show that MILP solvers are very efficient when the resolution is
based on a linear combination of the criteria. Experiments done on real
benchmarks show that the best MILP solvers outperform CP solvers and that they
are significantly better than Pseudo Boolean solvers.Comment: In Proceedings LoCoCo 2010, arXiv:1007.083
Comparison of PBO solvers in a dependency solving domain
Linux package managers have to deal with dependencies and conflicts of
packages required to be installed by the user. As an NP-complete problem, this
is a hard task to solve. In this context, several approaches have been pursued.
Apt-pbo is a package manager based on the apt project that encodes the
dependency solving problem as a pseudo-Boolean optimization (PBO) problem. This
paper compares different PBO solvers and their effectiveness on solving the
dependency solving problem.Comment: In Proceedings LoCoCo 2010, arXiv:1007.083
- …