RetroSearch Browse

;

179

heurdata->vbbounds =

;

180

heurdata->nvbvars = 0;

181

heurdata->initialized =

;

182

heurdata->applicable =

;

197 int

* stacknextcliquevar,

219

assert(startnode >= 0);

221

assert(visited !=

);

222

assert(visited[startnode] ==

);

223

assert(dfsstack !=

);

224

assert(dfsnodes !=

);

225

assert(ndfsnodes !=

);

230

dfsstack[0] = startnode;

231

stacknextcliquevar[0] = 0;

232

stacknextedge[0] = 0;

238 while

( stacksize > 0 )

241

curridx = dfsstack[stacksize - 1];

244

assert(visited[curridx] == (stacknextedge[stacksize - 1] != 0));

245

visited[curridx] =

TRUE

;

251 if

( stacknextedge[stacksize - 1] >= 0 )

268 for

( i = stacknextedge[stacksize - 1]; i < nvbvars; ++i )

284

assert(!visited[idx]);

287

dfsstack[stacksize] = idx;

288

stacknextedge[stacksize] = 0;

289

stacknextcliquevar[stacksize] = 0;

290

stacknextedge[stacksize - 1] = i + 1;

299

stacknextedge[stacksize - 1] = -1;

309 for

( j = -stacknextedge[stacksize - 1] - 1; j < ncliques; ++j )

316 if

( stacknextcliquevar[stacksize - 1] == 0 )

323

stacknextedge[stacksize - 1] = -j - 2;

324

stacknextcliquevar[stacksize - 1] = 0;

345 for

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

349 if

( cliquevars[i] == startvar )

360 if

( idx >= 0 && !visited[idx] )

362 if

( i < ncliquevars - 1 )

364

stacknextedge[stacksize - 1] = -j - 1;

365

stacknextcliquevar[stacksize - 1] = i + 1;

369

stacknextedge[stacksize - 1] = -j - 2;

370

stacknextcliquevar[stacksize - 1] = 0;

379

assert(!visited[idx]);

382

dfsstack[stacksize] = idx;

383

stacknextedge[stacksize] = 0;

384

stacknextcliquevar[stacksize] = 0;

396

maxstacksize =

MAX

(maxstacksize, stacksize);

404

dfsnodes[(*ndfsnodes)] = curridx;

408

visited[curridx] =

;

425 int

* stacknextcliquevar;

445 for

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

449 SCIP_CALL

(

dfs

(

, i, visited, dfsstack, stacknextedge, stacknextcliquevar, cliqueexit, vbvars, nvbvars) );

452

assert(*nvbvars <= nbounds);

483

heurdata->usednodes = 0;

484

heurdata->initialized =

TRUE

;

496 if

( nvbs > 0 && nvbs >= 0.1 * heurdata->minintfixingrate * nvars )

502 for

( v = 0; v < nvbs; ++v )

511

heurdata->nvbvars = nvbs;

512

heurdata->applicable =

TRUE

;

528

minimprove = heurdata->minimprove;

544

heurdata->cutoffbound =

MIN

(upperbound, cutoffbound);

576 for

( v = 0; v < nvbvars && !(*infeasible); ++v )

579 bound

= heurdata->vbbounds[v];

643 SCIPdebugMsg

(

"fixing %d: variable <%s> (obj=%g) to lower bound <%g> (%d pseudo cands)\n"

662 SCIPdebugMsg

(

"fixing %d: variable <%s> (obj=%g) to upper bound <%g> (%d pseudo cands)\n"

664

lastfixedlb =

;

674

assert(lastvar !=

);

678

*infeasible =

;

705 if

( !(*infeasible) )

710 SCIPdebugMessage

(

"backtrack %d was %sfeasible\n"

, nbacktracks, (*infeasible ?

"in"

""

));

715 SCIPdebugMsg

(

"probing was infeasible after %d backtracks\n"

, nbacktracks);

719 else if

( nbacktracks > heurdata->maxbacktracks )

721 SCIPdebugMsg

(

"interrupt probing after %d backtracks\n"

, nbacktracks);

727

*backtracked = (nbacktracks > 0);

753

assert(subscip !=

);

754

assert(heur !=

);

757

assert(heurdata !=

);

762 SCIP_CALL

(

SCIPcopyConsCompression

(

, subscip, varmap,

"_vbounds"

, 0,

765 if

( heurdata->copycuts )

773 for

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

822

minimprove = heurdata->minimprove;

838

heurdata->cutoffbound =

MIN

(upperbound, cutoffbound);

844 SCIPdebugMsg

(

"setting objlimit for subscip to %g\n"

, heurdata->cutoffbound);

855 SCIPdebugMsg

(

"vbounds heuristic presolved subproblem at time %g : %d vars, %d cons; fixing value = %g\n"

925

assert(heur !=

);

926

assert(heurdata !=

);

932 if

( skipobj1 !=

)

934 if

( skipobj2 !=

)

953

nstallnodes += heurdata->nodesofs;

956

nstallnodes -= heurdata->usednodes;

957

nstallnodes =

MIN

(nstallnodes, heurdata->maxnodes);

959 SCIPdebugMsg

(

"apply variable bounds heuristic at node %lld on %d variable bounds, tighten: %u obj: %d\n"

963 if

( nstallnodes < heurdata->minnodes )

1002#ifdef COLLECTSTATISTICS 1009 if

( skipobj1 !=

)

1010

*skipobj1 = allobj1;

1012 if

( skipobj2 !=

)

1013

*skipobj2 = allobj2;

1021 SCIPdebugMsg

(

"npscands=%d, oldnpscands=%d, heurdata->minintfixingrate=%g\n"

, npscands, oldnpscands, heurdata->minintfixingrate);

1024 if

( npscands > oldnpscands * (1.0 - heurdata->minintfixingrate) )

1026 if

( heurdata->uselockfixings && npscands <= 2.0 * oldnpscands * (1.0 - heurdata->minintfixingrate) )

1040 SCIPdebugMsg

(

"after lockfixings: npscands=%d, oldnpscands=%d, allrowsfulfilled=%u, heurdata->minintfixingrate=%g\n"

1041

npscands, oldnpscands, allrowsfulfilled, heurdata->minintfixingrate);

1043 if

( !allrowsfulfilled && npscands > oldnpscands * (1 - heurdata->minintfixingrate) )

1076 if

( nunfixedcols > 0.5 * ncols )

1079 "Heuristic " HEUR_NAME " solving LP from scratch with %.1f %% unfixed columns (%d of %d) ...\n"

1080

100.0 * (nunfixedcols / (

SCIP_Real

)ncols), nunfixedcols, ncols);

1097 SCIPwarningMessage

(

"Error while solving LP in vbound heuristic; LP solve terminated with code <%d>\n"

1129 SCIPdebugMsg

(

"vbound heuristic found roundable primal solution: obj=%g\n"

1179

&nprevars, &wasfeas, result);

1189#ifdef SCIP_STATISTIC 1191 SCIPstatisticMessage

(

"vbound: tighten=%u obj=%d nvars=%d presolnvars=%d ratio=%.2f infeas=%u found=%d time=%.4f\n"

1192

tighten, obj, nvars, nprevars, (nvars - nprevars) / (

SCIP_Real

)nvars, cutoff,

1217

assert(heur !=

);

1250

assert(heurdata !=

);

1253 for

( v = 0; v < heurdata->nvbvars; ++v )

1279

assert( heur !=

);

1281

assert( result !=

);

1289

assert(heurdata !=

);

1291 if

( !heurdata->initialized )

1296 if

( !heurdata->applicable )

1315

&skipobj1, &skipobj2, result) );

1331

&skipobj1, &skipobj2, result) );

1374

assert(heur !=