Combinatorial Optimization Patent - TOHOKU University, April 21 2026
Summary
The USPTO granted patent US12608438B2 to TOHOKU UNIVERSITY for a combinatorial optimization problem processing apparatus, method, and program. The patent covers an annealing scheme for solving combinatorial optimization problems including third-or-higher-order terms in the Hamiltonian using an alternate optimization algorithm. The patent contains 11 claims and is classified under CPC groups G06N 5/01, G06N 7/00-01, and G06N 10/00-60, with applications in supply chain optimization (G06Q 10/04-047).
What changed
The USPTO granted patent US12608438B2 to TOHOKU UNIVERSITY for a combinatorial optimization problem processing apparatus, method, and program. The patent discloses an annealing unit, calculation unit, and solution candidate acquisition unit operating in an alternate optimization algorithm to solve combinatorial optimization problems with third-or-higher-order terms in the Hamiltonian. The filing date was October 22, 2020, and the application number is 17770483.
For technology companies and researchers developing combinatorial optimization solutions, particularly those employing annealing methods, this patent represents enforceable IP rights held by TOHOKU UNIVERSITY. Companies developing similar systems should consider potential licensing needs or freedom-to-operate analysis to assess infringement exposure.
Archived snapshot
Apr 21, 2026GovPing captured this document from the original source. If the source has since changed or been removed, this is the text as it existed at that time.
Combinatorial optimization problem processing apparatus, combinatorial optimization problem processing method, and program
Grant US12608438B2 Kind: B2 Apr 21, 2026
Assignee
TOHOKU UNIVERSITY
Inventors
Masayuki Ohzeki
Abstract
A combinatorial optimization problem processing apparatus includes an annealing unit that acquires, using an annealing scheme, a candidate for a first solution that is a variable q satisfying a first condition regarding a partition function whose Hamiltonian is a function representing a combination optimization problem that is an analysis target and the function includes third- or higher-order terms of a variable q, the Hamiltonian being represented by an integral representation using a variable X, the Hamiltonian being represented by a sum of a first equation that includes only second- or lower-order terms of the variable q and a second equation that does not include the variable q, in an alternate optimization algorithm in which first optimization processing for acquiring the first solution and second optimization processing for acquiring a second solution that is a variable X satisfying a second condition regarding the partition function are repeated until an end condition is satisfied, a calculation unit that acquires the second solution, and a solution candidate acquisition unit that acquires a candidate for the immediately preceding first solution when the end condition is satisfied, as a candidate for a solution of the combinatorial optimization problem.
CPC Classifications
G06F 17/10-13 G06N 5/01 G06N 7/00 G06N 7/01 G06N 10/00-60 G06Q 10/04 G06Q 10/047
Filing Date
2020-10-22
Application No.
17770483
Claims
11
Mentioned entities
Parties
Related changes
Get daily alerts for USPTO Patent Grants - AI & Computing (G06N)
Daily digest delivered to your inbox.
Free. Unsubscribe anytime.
Source
About this page
Every important government, regulator, and court update from around the world. One place. Real-time. Free. Our mission
Source document text, dates, docket IDs, and authority are extracted directly from USPTO.
The summary, classification, recommended actions, deadlines, and penalty information are AI-generated from the original text and may contain errors. Always verify against the source document.
Classification
Who this affects
Taxonomy
Browse Categories
Get alerts for this source
We'll email you when USPTO Patent Grants - AI & Computing (G06N) publishes new changes.
Subscribed!
Optional. Filters your digest to exactly the updates that matter to you.