| Ser. |
|
599
|
| Title |
|
Nonlinear pseudo-Boolean optimization: relaxation or propagation?
|
| Abstract |
|
Pseudo-Boolean problems lie on the border between satisfiability problems, constraint programming, and integer programming. In particular, nonlinear constraints in pseudo-Boolean optimization can be handled by methods arising in these different fields: One can either linearize them and work on a linear programming relaxation or one can treat them directly by propagation. In this paper, we investigate the individual strengths of these approaches and compare their computational performance. Furthermore, we integrate these techniques into a branch-and-cut-and-propagate framework, resulting in an efficient nonlinear pseudo-Boolean solver.
|
| Author(s) |
|
Timo Berthold, Stefan Heinz, Marc Pfetsch
|
| PS-File |
|
|
| PDF-File |
|
|
| Reviewing Referee |
|
Prof. Dr. Dr. h.c. mult. Martin Grötschel |
| MSC |
|
90C11, 90C20, 90C26, 90C27, 90C57 |
| Projects |
|
B20 |
| Keywords |
|
mixed integer quadratically constrained programming, constraint
integer programming, branch-and-cut, convex relaxation, domain propagation, primal
heuristic, nonconvex
|
| Previously published |
|
ZIB-Report 09-11 |
| |
|
|
