A method and system are disclosed for solving a convex integer quadraticprogramming problem using a binary optimizer, the method comprising use of aprocessor for receiving a convex integer quadratic programming problem;convertingthe convex integer quadratic programming problem into a plurality ofconstrainedand unconstrained binary quadratic programming problems and providing theplurality of unconstrained binary quadratic programming problems to the binaryoptimizer to thereby solve the convex integer quadratic programming problem.
展开▼
