分支界限法解决01背包问题(共2页).doc

精选优质文档-倾情为你奉上#include#include#define N 200using namespace std;class HeapNode public: double uprofit,profit,weight; int level,xN;stack H;double wN,pN;double cw,cp,c;int n;double Bound(int i) double cleft=c-cw,b=cp; while(i=n&wi=cleft) cleft-=wi; b+=pi; i+; if(i=n) b+=pi/wi*cleft; return b;void AddLiveNode(double up,double