[转载] 问个弱智的branch and bound 问题哈,抓狂中~~~# Computation - 科学计算
v*l
1 楼
【 以下文字转载自 Engineering 讨论区,原文如下 】
发信人: violetgirl (羞答答的玫瑰静悄悄的开), 信区: Engineering
标 题: 问个弱智的branch and bound 问题哈,抓狂中~~~
发信站: Unknown Space - 未名空间 (Fri Oct 29 04:15:40 2004) WWW-POST
题目比较长,我就不烦劳大侠费劲看了,我来总结一下:
题目首先要求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 metho
发信人: violetgirl (羞答答的玫瑰静悄悄的开), 信区: Engineering
标 题: 问个弱智的branch and bound 问题哈,抓狂中~~~
发信站: Unknown Space - 未名空间 (Fri Oct 29 04:15:40 2004) WWW-POST
题目比较长,我就不烦劳大侠费劲看了,我来总结一下:
题目首先要求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 metho