A tight bound for the Boolean quadratic optimization problem and its use in branch and bound algorithm

A tight bound for the Boolean quadratic optimization problem and its use in branch and bound algorithm

0.00 Avg rating—0 Votes
Article ID: iaor1988267
Country: Germany
Volume: 19
Start Page Number: 711
End Page Number: 721
Publication Date: Oct 1988
Journal: Optimization
Authors:
Keywords: programming: quadratic
Abstract:

Known duality statements are used to find tight bounds for the branch and bound process in solving Boolean quadratic optimization problems. To solve the corresponding continuous partial problem, a Newton-like procedure is indicated. Superlinear convergence, however, is only obtained in partial cases,

Reviews

Required fields are marked *. Your email address will not be published.