Transactions of the Institute of Systems, Control and Information Engineers
Online ISSN : 2185-811X
Print ISSN : 1342-5668
Papers
Tractable Global Optimization Algorithms for Small Boolean Quadratic Programming Problems without Multiplications and Floating-Point Operations
Kohei Mori
Author information
JOURNALS FREE ACCESS

2014 Volume 27 Issue 6 Pages 254-258

Details
Abstract

We introduce tractable global optimization algorithms for small boolean quadratic programming problems using reflected Gray coding technique. In the algorithms, the space complexity is limited to O(n2). Furthermore, we can implement them without multiplications or floating point operations when the instances are integers. Numerical experiments revealed that the proposed algorithms run as fast as interior point algorithms for solving convex relaxation problems of the original QPs.

Information related to the author
© 2014 The Institute of Systems, Control and Information Engineers
Previous article
feedback
Top