Method and system for solving a convex integer quadratic programming problem using a binary optimizer
US9836432B2 · kind B2 · utility
7Cited by
0References
14Claims
0Family size
Assignee
Inventor
Key dates
| Filing date | Oct 8, 2014 |
| Grant date | Dec 5, 2017 |
| Priority date | — |
| Expiry date | May 11, 2035 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06N5/01
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method and system are disclosed for solving a convex integer quadratic programming problem using a binary optimizer, the method comprising use of a processor for receiving a convex integer quadratic programming problem; converting the convex integer quadratic programming problem into a plurality of constrained and unconstrained binary quadratic programming problems and providing the plurality of unconstrained binary quadratic programming problems to the binary optimizer to thereby solve the convex integer quadratic programming problem.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.