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

DOI10.1051/RO/1992260101131zbMATH Open0764.90058OpenAlexW2511806218MaRDI QIDQ4016776FDOQ4016776

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

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

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)

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¹
• Title not available (Why is that?)
• The spherical constraint in Boolean quadratic programs
• Title not available (Why is that?)

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)