Q39
_____________ is one of the fundamental combinatorial optimization problems.
A.
Assignment problem
AnswerB.
Transportation problem
C.
Optimization Problem
D.
None of the above
Answer: Option A
Solution
Answer: Option A
Solution:
Assignment problem is one of the fundamental combinatorial optimization problems. It consists of finding, in a weighted bipartite graph, a matching of a given size, in which the sum of weights of the edges is a minimum. A common variant consists of finding a maximum-weight matching.