scientific article; zbMATH DE number 3717129

MaRDI QIDQ3907407zbMATH OpenFDO

Authors Peter L. Hammer, Pierre Hansen

Publication date 1981

zbMATH Keywords

additive penaltiesalgorithmsconstrained problemsforcing conditionsinfeasibility conditionslinear inequalitieslogical relationsquadratic 0-1 programmingrelational conditionsunconstrained problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boolean programming (90C09) Quadratic programming (90C20)

Cited in

(10)

• Uniquely solvable quadratic Boolean equations
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
• Best second order bounds for two-terminal network reliability with dependent edge failures
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
• Mathematical programming models and exact algorithms
• The bipartite QUBO
• A preprocessing technique for quadratic unconstrained binary optimization
• On duality for Boolean programming
• Logical processing for integer programming

This page was built for publication:

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