用分支限界求解0-1背包问题VIP免费

实验题目：用分支限界求解0-1背包问题物品个数n=4，背包容量c=7，价值向量p={9，10，7,4}，重量向量w={3,5,2,1}请求出最优的解及其目标函数值

#include#include#defineMaxSize100//最多结点数typedefstructQNode{floatweight;floatvalue;intceng;structQNode*parent;boolleftChild;}QNode,*qnode;//存放每个结点typedefstruct{qnodeQ[MaxSize];intfront,rear;}SqQueue;//存放结点的队列SqQueuesq;floatbestv=0;//最优解intn=0;//实际物品数floatw[MaxSize];//物品的重量floatv[MaxSize];//物品的价值intbestx[MaxSize];//存放最优解qnodebestE;voidInitQueue(SqQueue&sq)//队列初始化{sq

front=1;sq

rear=1;}boolQueueEmpty(SqQueuesq)//队列是否为空{if(sq

front==sq

rear)returntrue;elsereturnfalse;}voidEnQueue(SqQueue&sq,qnodeb)//入队{if(sq

front==(sq

rear+1)%MaxSize){printf("队列已满

");return;}sq

rear]=b;sq

rear=(sq

rear+1)%MaxSize;}qnodeDeQueue(SqQueue&sq)//出队{qnodee;if(sq

front==sq

rear){printf("队列已空

");return0;}e=sq

front];sq

front=(s