Terse integer linear programs for Boolean optimization

MaRDI QIDQ3181648zbMATH OpenFDO

Authors Christoph Buchheim, G. Rinaldi

Publication date 12 October 2009

zbMATH Keywords

cut polytopemaximum satisfiabilitypseudo-Boolean optimization

Mathematics Subject Classification ID

Boolean programming (90C09) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 279605
• Boolean polynomials and set functions
• On using cutting planes in pseudo-Boolean optimization
• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
• scientific article; zbMATH DE number 4035570

Cited in

(6)

• Discrete dynamical system approaches for Boolean polynomial optimization
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
• Comparisons of commercial MIP solvers and an adaptive memory (tabu search) procedure for a class of 0-1 integer programming problems
• On using cutting planes in pseudo-Boolean optimization
• scientific article; zbMATH DE number 4035570 (Why is no real title available?)
• Quadratic reformulations of nonlinear binary optimization problems

Describes a project that uses

Uses Software

• Pueblo

This page was built for publication: Terse integer linear programs for Boolean optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3181648)