v********l
发帖数: 3 | 1 题目比较长,我就不烦劳大侠费劲看了,我来总结一下:
题目首先要求formulate 一个problem as a mixed-integer program,
目标函数是minimizes the total assignment cost.约束条件就是每个工作需要一定小时
, 共n个工作,每个工人工作时间有个上限和下限,available工人数有限制什么的.反正就
是个复杂一点的assignment problem. 问题是 Suppose that you would like to
develop a branch-and-bound approach to solve this problem. Suggest methods for
obtaining primal and dual bounds. Comment on the strength of the bounds
obtained with the methods that you suggest employing.
我不太明白题目要求回答什么,primal and dual bounds. 无非就是解一个rel |
|
