分支定界法的思是首先确定目标值的上下界.docVIP

分支定界法的思想是：首先确定目标值的上下界 发布人：chengxu0921? 发布时间：2008-7-21 18:16:27? 新闻类别：分支-界限法 例1：设有A,B,C,D,E 5人从事j1,j2,j3,j4,j5 5项工作每人只能从事一项,它们的 效益表如下: 　 j1 j2 j3 j4 j5 A 13 11 10 4 7 B 13 10 10 8 5 C 5 9 7 7 4 D 15 12 10 11 5 E 10 11 8 8 4 求最佳安排,使效益最高？ ? 原文代码重写如下，希望增加点可读性。 ? program PlanJob;const MAX_SIZE = 20;type? TIntArray = array[1..MAX_SIZE] of Integer;? PNode = ^Node;? Node = record??? Job2Man: TIntArray;???? // Job2Man[n] = m, job-n assign to person-m??? Man2Job: TIntArray;??? // Man2Job[n] = m, person-n assign to job-m??? UpperVal: Integer; // upper value??? JobsDep: Integer;?? // jobs decided, as search depth??? Next: PNode;? end;var?? CurNode: PNode;????? // Current node?? NewNode: PNode;????? // New branch node?? DelNode: PNode;????? // for delete?? GoalNode: PNode;???? // the goal?? GoalMaxVal: Integer; // goal max value?? CurMan, CurJob: Integer;???? // Current Man and Job of current Node?? Size: Integer;?????? // Person number, also task number?? Values: array[1..MAX_SIZE, 1..MAX_SIZE] of Integer;function CalUpperValue(ANode: PNode): Integer;var? Res: Integer;? Man, Job: Integer;? JobMaxVal: Integer;begin? Res := 0;? with ANode^ do? begin??? for Job := 1 to Size do??? begin????? if Job = JobsDep then????? begin??????? Man := Job2Man[Job];??????? Res := Res + Values[Man, Job];??????? Continue;????? end;????? // else find the max value for Job????? JobMaxVal := 0;????? for Man := 1 to Size do????? begin??????? if (JobMaxVal Values[Man,Job]) and (Man2Job[Man] = 0) then????????? JobMaxVal := Values[Man,Job];????? end;????? Res := Res + JobMaxVal;??? end;??? // for Job? end;??? // with ANode^? CalUpperValue := Res;end;function InitNode(): PNode;var? Man, Job: Integer;? FInput: Text;? Res: PNode;begin? Assign(FInput, input.txt);? Reset(FInput);? Read(FInput, Size);? Readln(FInput);? for Man := 1 to Size do? begin??? for Job := 1 to Size do????? Read(FInput, Values[Man,Job]);??? Readln(FInput);? end;?