Abstract: |
A processing unit generates a first graph that has a plurality of vertices respectively corresponding to all variables included in an objective function and has edges each connecting two vertices to indicate an existence of interaction between corresponding variables, generates a second graph, which is an abstraction of the first graph, by repeatedly merging two vertices connected by an edge into one vertex in the first graph, classifies all variables into candidates for variable groups to be respectively used for partial problems and a candidate for a boundary variable group to be used for computing a complete solution to a combinatorial optimization problem, based on the connection relationship among a plurality of vertices included in the second graph and a partition count, and determines the variable groups and boundary variable group, based on these candidates by reference to the connection relationship among the vertices included in the first graph. |
Inventor: |
Inagaki, Kazuhisa (Yokohama, JP); Sakai, Akira (Kawasaki, JP) |
Applicant: |
FUJITSU LIMITED (Kawasaki-shi, JP) |
Face Assignee: |
FUJITSU LIMITED (Kawasaki-shi, JP) |
Filed: |
2019-06-07 |
Issued: |
2019-12-26 |
Claims: |
9 |
|
US20190391807
|
1. A non-transitory computer-readable recording medium storing an optimization problem computing program that causes a computer to perform a process comprising:
(4)
(10)
|
|
6. A non-transitory computer-readable recording medium storing an optimization problem computing program that causes a computer to perform a process comprising:
(2)
(10)
|
|
9. An optimization problem computing system comprising:
(0)
(2)
|
|