Method and system for solving a convex integer quadratic programming problem using a binary optimizer
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Dec 5, 2017
Grant Date -
Apr 16, 2015
app pub date -
Oct 8, 2014
filing date -
Oct 10, 2013
priority date (Note) -
In Force
status (Latency Note)
Importance
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.
First Claim
Family
International Classification(s)
- [Classification Symbol]
- [Patents Count]
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully