Assignment lower bound from independent task minima
= Assignment lower bound from independent task minima
For a partial <assignment problem>, add its fixed cost to the sum, over remaining tasks, of each task's cheapest available machine cost. This is a <lower bound> because it relaxes the requirement that different tasks use distinct machines. It is an admissible bound for <branch and bound>, even though the minimizing choices may assign the same machine repeatedly.
// Target: mathematical-optimization.bigb