combinatorial optimization problem
C44866
concept
A combinatorial optimization problem is a mathematical task of finding an optimal object (such as a subset, sequence, or arrangement) from a finite but typically large set of discrete possibilities, subject to given constraints.
Observed surface forms (6)
- Boolean optimization problem ×1
- NP-hard optimization problem ×1
- constraint optimization problem ×1
- constraint satisfaction optimization problem ×1
- constraint satisfaction problem ×1
- optimization problem ×1
Instances (5)
- Steiner tree problem
- Max-SAT via concept surface "optimization problem"
- Max-3-SAT via concept surface "constraint satisfaction problem"
- Max-E3-LIN-2 via concept surface "constraint satisfaction optimization problem"
- Subset sum problem