java分支限界法解决背包问题_(Java)分支界限法求解背包问题

1.代码

package com.test;

import java.util.*;

public class Main {

static double c;

static int n;

static double w[];

static double p[];

static double cw;

static double cp;

static int bestX[];

static MaxHeap heap;

//上界函数bound计算结点所相应价值的上界

private static double bound(int i){

double cleft=c-cw;

double b=cp;

while(i<=n&&w[i]<=cleft){

cleft=cleft-w[i];

b=b+p[i];

i++;

}

//装填剩余容量装满背包

if(i<=n)

b=b+p[i]/w[i]*cleft;

return b;

}

//addLiveNode将一个新的活结点插入到子集树和优先队列中

private static void addLiveNode(double up,double pp,double ww,int lev,BBnode par,boolean ch){

//将一个新的活结点插入到子集树和最大堆中

BBnode b=new BBnode(par,ch);

HeapNode node =new HeapNode(b,up,pp,ww,lev);

heap.put(node);

}

private static double MaxKnapsack(){

//优先队列式分支限界法，返回最大价值，bestx返回最优解

BBnode enode=null;

int i=1;

double bestp=0;//当前最优值

double up=bound(1);//当前上界

while(i!=n+1){//非叶子结点

//检查当前扩展结点的左儿子子结点

double wt=cw+w[i];

if(wt<=c){

if(cp+p[i]>bestp)

bestp=cp+p[i];

addLiveNode(up,cp+