search.m

来自「分支定界」· M 代码 · 共 39 行

function [x1,y1,z1,B,k1]=Search(x,y,z,k,i,r,q,p,B,d,N)

m=q;

for q=m:-1:1
    Qk=k;k(:,q)=[];
    Qx=x;x(:,q)=[];
    Qy=y;y(:,q)=[];
    Qz=z;z(:,q)=[];
    J=PanJu(x,y,z,p);
    if J>B
        r_1=r-q;
        q_1=r_1-(N-d-i-2); 
        if q_1==1
            Qk1=k;Qx1=x;Qy1=y;Qz1=z;
            for v=(d+1):1:(N-1-i)
                k(:,3)=[];
                x(:,3)=[];
                y(:,3)=[];
                z(:,3)=[];
            end
            J=PanJu(x,y,z,p);
            if J>B
                B=J;x1=x;y1=y;z1=z;k1=k;
            else
                k=Qk1;x=Qx1;y=Qy1;z=Qz1;
            end
        elseif (i+1)==(N-d)
            B=J;x1=x;y1=y;z1=z;k1=k;
        else
            i=i+1;
            [x1,y1,z1,B,k1]=Search(x,y,z,k,i,r_1,q_1,p,B,d,N);
            i=i-1;
        end
    else
        k=Qk;x=Qx;y=Qy;z=Qz;
    end
    k=Qk;x=Qx;y=Qy;z=Qz;
end