Find the shortest tour through a given set of n cities that visits each city exactly once before returning to the city where it started.
Knapsack Problem
Given n items of known weights w1, …, wn and values v1, …, vn and a knapsack of capacity W.
Find the most valuable subset of the items that fit into the knapsack
Assignment Problem
There are n people who need to be assigned to execute n jobs, one person per job.
The cost of assigning the ith person to the jth job is a known quantity C[i,j] for each pair i,j=1, … , n.
Problem is to find an assignment with smallest total cost !
Hiç yorum yok:
Yorum Gönder