組合せ最適化
1. Combinatorial optimizationIn applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects. In many such problems, exhaustive search is not feasible. It operates on the domain of those optimization problems, in which the set of feasible solutions is discrete or can be reduced to discrete, and in which the goal is to find the best solution.
Read “Combinatorial optimization” on English Wikipedia
Read “組合せ最適化” on Japanese Wikipedia
Read “Combinatorial optimization” on DBpedia
Read “Combinatorial optimization” on English Wikipedia
Read “組合せ最適化” on Japanese Wikipedia
Read “Combinatorial optimization” on DBpedia
Discussions
Log in to talk about this word.