RetroSearch Browse

);

133 if

( branchruledata->cloudclock !=

)

141

ntried = branchruledata->ntried;

142

nuseful = branchruledata->nuseful;

143

ncloudpoints = branchruledata->ncloudpoints;

144

nsavedlps = branchruledata->nsavedlps;

149 SCIPstatisticMessage

(

"cloud success rates useful/tried: %8.6g points/useful: %8.6g saved/useful: %8.6g \n"

150

ntried == 0 ? -1 : (

)nuseful / ntried, nuseful == 0 ? -1 : (

)ncloudpoints / nuseful, nuseful == 0 ? -1 : (

)nsavedlps / nuseful);

174

branchruledata->lastcand = 0;

175

branchruledata->nuseful = 0;

176

branchruledata->nusefulunions = 0;

177

branchruledata->ntried = 0;

178

branchruledata->ntriedunions = 0;

179

branchruledata->ncloudpoints = 0;

180

branchruledata->nsavedlps = 0;

182 if

( branchruledata->cloudclock !=

)

230

assert(branchrule !=

);

233

assert(result !=

);

249

assert(nlpcands > 0);

253

assert(branchruledata !=

);

256 if

( branchruledata->skipdown ==

)

258

assert(branchruledata->skipup ==

);

260

branchruledata->skipsize = nvars;

275

newlpcandsmin =

;

276

newlpcandsmax =

;

277 if

( branchruledata->useunion &&

(

) < branchruledata->maxdepthunion && !branchruledata->onlyF2)

289

branchruledata->ntried++;

295 for

( i = 0; i < nvars; ++i )

315 for

( i = 0; i < nlprows; ++i )

335 if

( branchruledata->useunion && !branchruledata->onlyF2 &&

(

) < branchruledata->maxdepthunion )

338 for

( i = 0; i < ndiscvars; ++i)

343

assert(newlpcandsmin !=

);

344

assert(newlpcandsmax !=

);

346

newlpcandsmin[i] = solval;

347

newlpcandsmax[i] = solval;

352 while

( newpoint && branchruledata->usecloud )

359 for

( i = 0; i < nlpcands; ++i )

419 for

( i = 0; i < nlpcands; ++i)

427

lpcandsmin[i] =

MIN

(lpcandsmin[i], solval);

428

lpcandsmax[i] =

MAX

(lpcandsmax[i], solval);

431 if

( branchruledata->useunion && !branchruledata->onlyF2 &&

(

) < branchruledata->maxdepthunion )

434 for

( i = 0; i < ndiscvars; ++i)

439

assert(newlpcandsmin !=

);

440

assert(newlpcandsmax !=

);

442

newlpcandsmin[i] =

MIN

(newlpcandsmin[i], solval);

443

newlpcandsmax[i] =

MAX

(newlpcandsmax[i], solval);

450 if

( branchruledata->maxpoints != -1 && counter >= branchruledata->maxpoints )

454 SCIPdebugMsg

(

"considered %d additional points in the cloud\n"

,counter);

460

ncomplete = nlpcands;

464

branchruledata->ncloudpoints += (counter+1);

465

branchruledata->nuseful++;

470 for

( i = 0; i < nlpcands; ++i)

474

assert(counter <= i);

475

lpcandscopy[counter] = lpcandscopy[i];

476

lpcandssolcopy[counter] = lpcandssolcopy[i];

477

lpcandsfraccopy[counter] = lpcandsfraccopy[i];

483

assert(nlpcands - counter > 0);

488 for

( i = 0; i < nlpcands && !branchruledata->onlyF2; ++i)

492

assert(counter < nlpcands);

493

lpcandscopy[counter] = lpcandscopy[i];

494

lpcandssolcopy[counter] = lpcandssolcopy[i];

495

lpcandsfraccopy[counter] = lpcandsfraccopy[i];

498

branchruledata->skipdown[counter] =

;

500

branchruledata->skipup[counter] =

;

501

assert(branchruledata->skipdown[counter] != branchruledata->skipup[counter]);

507 SCIPdebugMsg

(

"can fully skip %d/%d strong branching candidates\n"

, nlpcands - counter, nlpcands);

508 SCIPdebugMsg

(

"can half skip %d/%d strong branching candidates\n"

, counter - ncomplete, nlpcands);

514 if

( branchruledata->usecloud &&

515

branchruledata->ntried > 100 &&

516

(

)branchruledata->nuseful / branchruledata->ntried < branchruledata->minsuccessrate )

519

branchruledata->usecloud =

;

522 if

( branchruledata->onlyF2 )

523

counter =

MAX

(counter,1);

527

branchruledata->skipup, counter, counter, ncomplete, &branchruledata->lastcand, 0,

528

&bestcand, &bestdown, &bestup, &bestscore, &bestdownvalid, &bestupvalid, &provedbound, result) );

530 if

( branchruledata->lastcand <= ncomplete )

532 SCIPdebugMsg

(

"saved %d of %d LPs\n"

, 2*(nlpcands - ncomplete), 2*nlpcands);

533

branchruledata->nsavedlps += 2*(nlpcands - ncomplete);

537 SCIPdebugMsg

(

"saved %d of %d LPs\n"

, 2*(nlpcands - counter)+counter - ncomplete, 2*nlpcands);

538

branchruledata->nsavedlps += 2*(nlpcands - counter)+counter - ncomplete;

552

assert(0 <= bestcand && bestcand < nlpcands);

555

var = lpcandscopy[bestcand];

556

newselected =

;

559 if

( branchruledata->useunion && !branchruledata->onlyF2 &&

(

) < branchruledata->maxdepthunion && branchruledata->lastcand > ncomplete )

571 for

( i = 0; i < ndiscvars; ++i)

576

assert(newlpcandsmin !=

);

577

assert(newlpcandsmax !=

);

581

newlpcands[counter] = vars[i];

584

branchruledata->skipdown[counter] =

;

586

branchruledata->skipup[counter] =

;

587

assert(branchruledata->skipdown[counter] != branchruledata->skipup[counter]);

604

branchruledata->ntriedunions++;

607

&newcand, &newdown, &newup, &newscore, &newdownvalid, &newupvalid, &newbound, result) );

615 if

( newscore > bestscore )

618

var = newlpcands[newcand];

621

bestdownvalid = newdownvalid;

622

bestupvalid = newupvalid;

623

bestscore = newscore;

625

branchruledata->nusefulunions++;

635 SCIPdebugMsg

(

" -> %d candidates, selected candidate %d: variable <%s> (solval=%g, down=%g, up=%g, score=%g)\n"

636

counter, bestcand,

SCIPvarGetName

(var), lpcandssolcopy[bestcand], bestdown, bestup, bestscore);

640 SCIPdebugMsg

(

" -> selected from %d new candidates, candidate %d: variable <%s> (down=%g, up=%g, score=%g)\n"

641

counter, bestcand,

SCIPvarGetName

(var), bestdown, bestup, bestscore);

647

assert(downchild !=

);

648

assert(upchild !=

);

659 if

( allcolsinlp && !exactsolve )

671 if

( branchruledata->useunion && !branchruledata->onlyF2 &&

(

) < branchruledata->maxdepthunion )

683 if

( branchruledata->useunion &&

684

branchruledata->ntriedunions > 10 &&

685

(

)branchruledata->nusefulunions / branchruledata->ntriedunions < branchruledata->minsuccessunion )

688

branchruledata->useunion =

;

708

branchruledata->lastcand = 0;

709

branchruledata->skipsize = 0;

710

branchruledata->skipup =

;

711

branchruledata->skipdown =

;

718

assert(branchrule !=