A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm 1 : Optimization: Vol 19, No 5

Optimization

A Journal of Mathematical Programming and Operations Research

Volume 19, 1988 - Issue 5

Views

CrossRef citations to date

Altmetric

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.

AMS 1980 Subject Classifications:

Keywords:

¹The main, of this paper was written, while the author was visiting the Computer and Automation Institute of the Hungarian Academy of Sciences, Budapest.

Notes

¹The main, of this paper was written, while the author was visiting the Computer and Automation Institute of the Hungarian Academy of Sciences, Budapest.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm Footnote¹
¹The main, of this paper was written, while the author was visiting the Computer and Automation Institute of the Hungarian Academy of Sciences, Budapest.

Related Research Data

Information for

Open access

Opportunities

Help and information

A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm Footnote11The main, of this paper was written, while the author was visiting the Computer and Automation Institute of the Hungarian Academy of Sciences, Budapest.

Abstract

Notes

Reprints and Corporate Permissions

Academic Permissions

Related Research Data

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date

Your download is now in progress and you may close this window

Login or register to access this feature

A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm Footnote¹
¹The main, of this paper was written, while the author was visiting the Computer and Automation Institute of the Hungarian Academy of Sciences, Budapest.