使用MILP求解器处理软件可升级性问题
Handling software upgradeability problems with MILP solvers
摘要：
可升级性问题是现代操作系统中的关键问题。问题在于根据某些标准找到“最佳”解决方案，以在给定安装中安装，删除或升级软件包。这是一个难题：可扩展性问题的复杂性是NP完全的，并且现代OS包含大量的软件包（在Linux发行版中通常超过20000个软件包）。此外，必须考虑几个优化标准，例如，稳定性、内存效率、网络效率。在本文中，我们调查的能力MILP求解器来处理这个问题。我们表明，MILP求解器是非常有效的分辨率是基于线性组合的标准。在真实基准上进行的实验表明，最好的MILP求解器优于CP求解器，并且它们明显优于伪布尔求解器。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
