TY - GEN A1 - Berthold, Timo A1 - Heinz, Stefan A1 - Pfetsch, Marc E. T1 - Nonlinear pseudo-Boolean optimization: relaxation or propagation? N2 - 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. KW - mixed integer quadratically constrained programming KW - constraint KW - integer programming KW - branch-and-cut KW - convex relaxation KW - domain propagation KW - primal KW - heuristic KW - nonconvex Y1 - 2009 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/605 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-6050 ER -