AbstractThis survey examines the state of the art of a variety of problems related to pseudo-Boolean optimization, i.e. to the optimization of set functions represented by closed algebraic expressions. The main parts of the survey examine general pseudo-Boolean optimization, the specially important case of quadratic pseudo-Boolean optimization (to which every pseudo-Boolean optimization can be reduced), several other important special classes, and approximation algorithms
Boolean constraints play an important role in various constraint logic programming languages. In thi...
Optimization can make at least two contributions to boolean logic. Its solution methods can address ...
This dissertation addresses several approaches with the common goal of reducing the time required to...
AbstractThis survey examines the state of the art of a variety of problems related to pseudo-Boolean...
peer reviewedThis article briefly surveys some fundamental results regarding pseudo-Boolean function...
Very often, problems modeled using pseudo-Boolean constraints are optimization problems, not satisfa...
Pseudo-Boolean problems lie on the border between satisfiability problems, constraint programming, a...
International audienceWe investigate various solution approaches for the uncon-strained minimization...
Pseudo-Boolean problems are a generalization of Boolean problems and combine Boolean algebra with ar...
Pseudo-Boolean problems are a generalization of Boolean problems and combine Boolean algebra with ar...
A pseudo-Boolean function is a function from a 0/1-vector to the reals. Minimizing pseudo-Boolean fu...
Pseudo-Boolean problems are a generalization of Boolean problems and combine Boolean algebra with ...
Core-guided techniques have revolutionized Boolean satisfiability approaches to optimization problem...
We develop a polynomial-time algorithm to minimize pseudo-Boolean functions. The computational compl...
Abstract. Recently, several unsatisfiability-based algorithms have been proposed for Maximum Satisfi...
Boolean constraints play an important role in various constraint logic programming languages. In thi...
Optimization can make at least two contributions to boolean logic. Its solution methods can address ...
This dissertation addresses several approaches with the common goal of reducing the time required to...
AbstractThis survey examines the state of the art of a variety of problems related to pseudo-Boolean...
peer reviewedThis article briefly surveys some fundamental results regarding pseudo-Boolean function...
Very often, problems modeled using pseudo-Boolean constraints are optimization problems, not satisfa...
Pseudo-Boolean problems lie on the border between satisfiability problems, constraint programming, a...
International audienceWe investigate various solution approaches for the uncon-strained minimization...
Pseudo-Boolean problems are a generalization of Boolean problems and combine Boolean algebra with ar...
Pseudo-Boolean problems are a generalization of Boolean problems and combine Boolean algebra with ar...
A pseudo-Boolean function is a function from a 0/1-vector to the reals. Minimizing pseudo-Boolean fu...
Pseudo-Boolean problems are a generalization of Boolean problems and combine Boolean algebra with ...
Core-guided techniques have revolutionized Boolean satisfiability approaches to optimization problem...
We develop a polynomial-time algorithm to minimize pseudo-Boolean functions. The computational compl...
Abstract. Recently, several unsatisfiability-based algorithms have been proposed for Maximum Satisfi...
Boolean constraints play an important role in various constraint logic programming languages. In thi...
Optimization can make at least two contributions to boolean logic. Its solution methods can address ...
This dissertation addresses several approaches with the common goal of reducing the time required to...
DOI
Add to ORKG