Lukasiewycz M, Glaß M, Haubelt C, Teich J (2007)
Publication Status: Published
Publication Type: Conference contribution
Publication year: 2007
Pages Range: 56-69
Conference Proceedings Title: Proceedings of Tenth International Conference on Theory and Applications of Satisfiability Testing (SAT 2007)
ISBN: 9783540727873
URI: https://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=38049113235&origin=inward
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these problems have a Boolean nature, i.e., the variables are restricted to 0 and 1, so called Pseudo-Boolean solvers have been proposed. They are mostly based on SAT solvers which took continuous improvements over the past years. However, Pseudo-Boolean solvers are only able to optimize a single linear function while fulfilling several constraints. Unfortunately many real-world optimization problems have multiple objective functions which are often conflicting and have to be optimized simultaneously, resulting in general in a set of optimal solutions. As a consequence, a single-objective Pseudo-Boolean solver will not be able to find this set of optimal solutions. As a remedy, we propose three different algorithms for solving multi-objective Pseudo-Boolean problems. Our experimental results will show the applicability of these algorithms on the basis of several test cases. © Springer-Verlag Berlin Heidelberg 2007.
APA:
Lukasiewycz, M., Glaß, M., Haubelt, C., & Teich, J. (2007). Solving multi-objective Pseudo-Boolean problems. In Proceedings of Tenth International Conference on Theory and Applications of Satisfiability Testing (SAT 2007) (pp. 56-69). Lisbon, PT.
MLA:
Lukasiewycz, Martin, et al. "Solving multi-objective Pseudo-Boolean problems." Proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing, SAT 2007, Lisbon 2007. 56-69.
BibTeX: Download