Skip to main content

Hitachi

Corporate InformationResearch & Development

Show Index

Explanation

A process of searching for solutions, a combination of maximum (or minimum) parameters, within a set of given conditions. The most famous case of a combinatorial optimization problem is the traveling salesman problem.

A characteristic of combinatorial optimization problems is that, as the number of parameters that will be decided upon in a problem increases, the candidate solutions increase explosively.

Related Glossary

Popular Terms

Recently Added