This paper surveys complexity and approximability results for the Maximum Solution (Max Sol) problem. Max Sol is an optimisation variant of the constraint satisfaction problem. Many important and well-known combinatorial optimisation problems are instances of Max Sol: for example, Max Sol restricted to the domain {0,1} is exactly the Max Ones problem (which, in turn, captures problems such as Independent Set and 0/1 Integer Programming). By using this relationship, many different problems in logic, graph theory, integer programming, and algebra can be given a uniform treatment. This opens up for new ways of analysing and solving combinatorial optimisation problems. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Jonsson, P., & Nordh, G. (2008). Introduction to the maximum solution problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5250 LNCS, pp. 255–282). https://doi.org/10.1007/978-3-540-92800-3_10
Mendeley helps you to discover research relevant for your work.