Handling software upgradeability problems with MILP solvers

Claude Michel
(University of Nice - Sophia Antipolis / I3S-CNRS)
Michel Rueher
(University of Nice - Sophia Antipolis / I3S-CNRS)

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.

In Inês Lynce and Ralf Treinen: Proceedings First International Workshop on Logics for Component Configuration (LoCoCo 2010), Edinburgh, UK, 10th July 2010, Electronic Proceedings in Theoretical Computer Science 29, pp. 1–10.
Published: 6th July 2010.

ArXived at: https://dx.doi.org/10.4204/EPTCS.29.1 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org