An efficient method for obtaining sharp bounds for nonlinear boolean programming problems

DOI10.1051/RO/1992260101131MaRDI QIDQ4016776zbMATH OpenOpenAlexFDO

Authors P. Frank Körner

Publication date 16 January 1993

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/105025

zbMATH Keywords

branch and boundLagrange dualityBoolean programmingquadratic equality constraints

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Boolean programming (90C09)

Recommendations

• A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm¹
• scientific article; zbMATH DE number 4035570
• On duality for Boolean programming
• Dual quadratic estimates in polynomial and Boolean programming
• Lagrangian quadratic bounds in polynomial nonconvex and Boolean models with superfluous constraints

Cited in

(6)

• The Boolean quadratic programming problem with generalized upper bound constraints
• On duality for Boolean programming
• A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm¹
• scientific article; zbMATH DE number 4035570 (Why is no real title available?)
• The spherical constraint in Boolean quadratic programs
• scientific article; zbMATH DE number 3978823 (Why is no real title available?)

This page was built for publication: An efficient method for obtaining sharp bounds for nonlinear boolean programming problems

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