Articles

A combinatorial optimization problem is trying to find out the value (combination) of variables that optimizes an index (value) from among many options under various constraints.

Most of the information devices we use today, such as PCs and smartphones, web servers that send out information on websites, IoT devices, and mission-critical systems that control power supply, are processed by computers called Neumann-type computers.

What is a typical combinatorial optimization problem? Many people may answer with the 'traveling salesman problem'.

This demo app is to solve the problem of estimating the original image from a noisy black and white image with an annealing machine.

This demo app is to solve combinatorial optimization problems with an annealing machine taking as an example a problem called vertex cover problem of graph.