RetroSearch Browse

);

145

propdata->sortedvars =

;

146

propdata->nprobed =

;

147

propdata->noldtotalvars = 0;

148

propdata->nsortedvars = 0;

149

propdata->nsortedbinvars = 0;

150

propdata->startidx = 0;

151

propdata->lastsortstartidx = -1;

152

propdata->nfixings = 0;

153

propdata->naggregations = 0;

154

propdata->nimplications = 0;

155

propdata->nbdchgs = 0;

156

propdata->nuseless = 0;

157

propdata->ntotaluseless = 0;

158

propdata->nsumuseless = 0;

159

propdata->lastnode = -2;

160

propdata->randnumgen =

;

172

assert(propdata !=

);

174 if

( propdata->sortedvars !=

)

179 for

( i = 0; i < propdata->nsortedvars; ++i )

184

propdata->nsortedvars = 0;

185

propdata->nsortedbinvars = 0;

189

propdata->noldtotalvars = 0;

217

assert(propdata !=

);

218

assert(propdata->nprobed !=

);

220

assert(vars !=

|| nvars == 0);

222

nsortedvars = nvars - firstidx;

223 if

( nsortedvars <= 0 )

226

assert(vars !=

);

228

sortedvars = &(vars[firstidx]);

230 SCIPdebugMsg

(

"resorting probing variables %d to %d\n"

, firstidx, nvars-1);

236

minnprobings = INT_MAX;

239 for

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

260

tmp = -

(nlocksdown, nlocksup)

261

+ 10.0 *

(nimplzero, nimplone)

262

+ 100.0 *

(nclqzero, nclqone);

264

tmp = -

ABS

(nlocksdown - nlocksup)

265

(nlocksdown, nlocksup)

266

+ 500.0 * nimplzero + 50.0 * nimplone

267

+ 50000.0 * nclqzero + 5000.0 * nclqone;

270 if

( tmp > maxscore )

278 if

( minnprobings > 0 )

280 for

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

291 for

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

317

(nlocksdown, nlocksup)

318

+ 10.0 *

(nimplzero, nimplone)

319

+ 100.0 *

(nclqzero, nclqone)

323

ABS

(nlocksdown - nlocksup)

324

(nlocksdown, nlocksup)

325

+ 500.0 * nimplzero + 50.0 * nimplone

326

+ 50000.0 * nclqzero + 5000.0 * nclqone

370 int

localnimplications;

380

assert(vars !=

);

381

assert(nbinvars > 0);

383

maxfixings = (propdata->maxfixings > 0 ? propdata->maxfixings : INT_MAX);

384

maxuseless = (propdata->maxuseless > 0 ? propdata->maxuseless : INT_MAX);

385

maxtotaluseless = (propdata->maxtotaluseless > 0 ? propdata->maxtotaluseless : INT_MAX);

386

maxsumuseless = (propdata->maxsumuseless > 0 ? propdata->maxsumuseless : INT_MAX);

389

oldstartidx = *startidx;

407 for

( ; i < nbinvars && !(*cutoff); ++i )

414 if

( propdata->nuseless >= maxuseless || propdata->ntotaluseless >= maxtotaluseless || propdata->nsumuseless >= maxsumuseless ||

SCIPisStopped

(

) )

417 " (%.1fs) probing: %d/%d (%.1f%%) - %d fixings, %d aggregations, %d implications, %d bound changes\n"

419

propdata->nfixings, propdata->naggregations, propdata->nimplications, propdata->nbdchgs);

423 if

( propdata->nuseless >= maxuseless )

427

propdata->nuseless, maxuseless);

429 else if

( propdata->ntotaluseless >= maxtotaluseless )

433

propdata->ntotaluseless, maxtotaluseless);

435 else if

( propdata->nsumuseless >= maxsumuseless )

439

propdata->nsumuseless, maxsumuseless);

451 if

( *nfixedvars - oldnfixedvars + *naggrvars - oldnaggrvars >= maxfixings || (looped && oldstartidx == i) )

453 if

( *nfixedvars - oldnfixedvars + *naggrvars - oldnaggrvars > 0 )

467 " (%.1fs) probing: %d/%d (%.1f%%) - %d fixings, %d aggregations, %d implications, %d bound changes\n"

469

propdata->nfixings, propdata->naggregations, propdata->nimplications, propdata->nbdchgs);

477 if

( propdata->nuseless > 0 )

478

propdata->nsumuseless++;

480

propdata->nsumuseless =

(propdata->nsumuseless-1, 0);

481

propdata->nuseless++;

482

propdata->ntotaluseless++;

493

oneimpllbs, oneimplubs, oneproplbs, onepropubs, &localcutoff) );

512 SCIPdebugMsg

(

"fixed probing variable <%s> to 0.0, nlocks=(%d/%d)\n"

516

propdata->nfixings++;

517

propdata->nuseless = 0;

518

propdata->ntotaluseless = 0;

522 SCIPdebugMsg

(

"tightening upper bound of probing variable <%s> to 0.0 led to a cutoff\n"

539

probingzero =

FALSE

;

545

zeroimpllbs, zeroimplubs, zeroproplbs, zeropropubs, &localcutoff) );

563 SCIPdebugMsg

(

"fixed probing variable <%s> to 1.0, nlocks=(%d/%d)\n"

567

propdata->nfixings++;

568

propdata->nuseless = 0;

569

propdata->ntotaluseless = 0;

573 SCIPdebugMsg

(

"tightening lower bound of probing variable <%s> to 1.0 led to a cutoff\n"

581 if

( !probingzero || !probingone )

592

localnimplications = 0;

595

nvars, vars, zeroimpllbs, zeroimplubs, zeroproplbs, zeropropubs, oneimpllbs, oneimplubs, oneproplbs, onepropubs,

596

&localnfixedvars, &localnaggrvars, &localnimplications, &localnchgbds, cutoff) );

598

*nfixedvars += localnfixedvars;

599

*naggrvars += localnaggrvars;

600

*nchgbds += localnchgbds;

601

propdata->nfixings += localnfixedvars;

602

propdata->naggregations += localnaggrvars;

603

propdata->nbdchgs += localnchgbds;

604

propdata->nimplications += localnimplications;

606 if

( localnfixedvars > 0 || localnaggrvars > 0 )

609

localnfixedvars, localnaggrvars);

610

propdata->nuseless = 0;

611

propdata->ntotaluseless = 0;

613 if

( localnimplications > 0 || localnchgbds > 0 )

614

propdata->ntotaluseless = 0;

620 if

( i == nbinvars && !(*cutoff) && !(*delay) && !aborted )

636

assert(vars == propdata->sortedvars);

637

assert(nbinvars == propdata->nsortedbinvars);

640 for

( v = propdata->nsortedvars - 1; v >= 0; --v )

645

propdata->nsortedvars = 0;

646

propdata->nsortedbinvars = 0;

652

propdata->nsortedvars = nnewvars;

659

lastidx = nnewbinvars + nnewintvars + nnewimplvars;

660 for

( v = nnewbinvars; v < lastidx; ++v )

664 SCIPswapPointers

((

void

**) &(propdata->sortedvars[nnewbinvars]), (

void

**) &(propdata->sortedvars[v]));

668

propdata->nsortedbinvars = nnewbinvars;

670

nbinvars = nnewbinvars;

671

vars = propdata->sortedvars;

672

nvars = propdata->nsortedvars;

684 if

( oldstartidx >= nbinvars )

685

oldstartidx = nbinvars - 1;

688 for

( v = propdata->nsortedvars - 1; v >= 0; --v )

693 if

( nnewbinvars == 0 )

696

propdata->lastsortstartidx = -1;

697

propdata->nuseless = 0;

698

propdata->ntotaluseless = 0;

705

propdata->lastsortstartidx = 0;

709 while

( i == 0 && !(*cutoff) && !(*delay) && !aborted );

737

assert(prop !=

);

755

assert(propdata !=

);

756

assert(propdata->sortedvars ==

);

757

assert(propdata->nsortedvars == 0);

758

assert(propdata->nsortedbinvars == 0);

774

assert(propdata !=

);

793

assert(propdata !=

);

796

assert(propdata->sortedvars ==

);

797

assert(propdata->nsortedvars == 0);

798

assert(propdata->nsortedbinvars == 0);

813

assert(propdata !=

);

815

propdata->lastnode = -2;

828

assert(propdata !=

);

834

assert(propdata->sortedvars ==

);

835

assert(propdata->nsortedvars == 0);

836

assert(propdata->nsortedbinvars == 0);

851

assert(propdata !=

);

854

propdata->nuseless = 0;

855

propdata->ntotaluseless = 0;

856

propdata->nsumuseless = 0;

874 int

oldnimplications;

879

assert(result !=

);

888 if

( nbinvars + nintvars + nimplvars == 0 )

893

assert(propdata !=

);

900 if

( propdata->lastnode == -1 && nnewfixedvars == 0 && nnewaggrvars == 0 && nnewchgbds == 0 && nnewholes == 0 )

908

propdata->nuseless -= propdata->nuseless/10;

909

propdata->ntotaluseless -= propdata->ntotaluseless/10;

912 if

( propdata->sortedvars ==

)

918

assert(propdata->startidx == 0);

923

propdata->nsortedvars = nvars;

926

lastidx = nbinvars + nintvars + nimplvars;

927 for

( v = nbinvars; v < lastidx; ++v )

931 SCIPswapPointers

((

void

**) &(propdata->sortedvars[nbinvars]), (

void

**) &(propdata->sortedvars[v]));

935

propdata->nsortedbinvars = nbinvars;

938 for

( v = propdata->nsortedvars - 1; v >= 0 ; --v )

944 if

( propdata->nsortedbinvars == 0 )

951 if

( propdata->noldtotalvars < ntotalvars )

954 BMSclearMemoryArray

(&(propdata->nprobed[propdata->noldtotalvars]), ntotalvars - propdata->noldtotalvars);

955

propdata->noldtotalvars = ntotalvars;

958

propdata->lastnode = -1;

961 if

( propdata->lastsortstartidx < 0 || propdata->startidx - propdata->lastsortstartidx >= 100 )

964

propdata->lastsortstartidx = propdata->startidx;

967

oldnfixedvars = *nfixedvars;

968

oldnaggrvars = *naggrvars;

969

oldnchgbds = *nchgbds;

970

oldnimplications = propdata->nimplications;

974

&(propdata->startidx), nfixedvars, naggrvars, nchgbds, oldnfixedvars, oldnaggrvars, &delay, &cutoff) );

984

propdata->lastnode = -2;

987 if

( *nfixedvars > oldnfixedvars || *naggrvars > oldnaggrvars || *nchgbds > oldnchgbds

988

|| propdata->nimplications > oldnimplications )

1018

assert(result !=

);

1032

assert(propdata !=

);

1039 if

( propdata->maxdepth >= 0 && propdata->maxdepth <

SCIPgetDepth

(

) )

1053 for

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

1058

assert(var !=

);

1064

binvars[nbinvars] = var;

1070 if

( nbinvars == 0 )

1080 if

( propdata->noldtotalvars < ntotalvars )

1083 BMSclearMemoryArray

(&(propdata->nprobed[propdata->noldtotalvars]), ntotalvars - propdata->noldtotalvars);

1084

propdata->noldtotalvars = ntotalvars;

1097 SCIPdebug

( oldnimplications = propdata->nimplications; )

1100 SCIP_CALL

(

applyProbing

(

, propdata, binvars, nbinvars, nbinvars, &startidx, &nfixedvars, &naggrvars, &nchgbds, oldnfixedvars, oldnaggrvars, &delay, &cutoff) );

1101 SCIPdebug

(

SCIPdebugMsg

(

"probing propagation found %d fixings, %d aggregation, %d nchgbds, and %d implications\n"

1102

nfixedvars, naggrvars, nchgbds, (propdata->nimplications) - oldnimplications); )

1107

propdata->lastnode = -2;

1113 else if

( nfixedvars > oldnfixedvars || naggrvars > oldnaggrvars || nchgbds > oldnchgbds )

1151

propExecProbing, propdata) );

1153

assert(prop !=

);

1170 "maximal number of runs, probing participates in (-1: no limit)"

1173 "propagating/" PROP_NAME "/proprounds"

1174 "maximal number of propagation rounds in probing subproblems (-1: no limit, 0: auto)"

1177 "propagating/" PROP_NAME "/maxfixings"

1178 "maximal number of fixings found, until probing is interrupted (0: don't iterrupt)"

1181 "propagating/" PROP_NAME "/maxuseless"

1182 "maximal number of successive probings without fixings, until probing is aborted (0: don't abort)"

1185 "propagating/" PROP_NAME "/maxtotaluseless"

1186 "maximal number of successive probings without fixings, bound changes, and implications, until probing is aborted (0: don't abort)"

1189 "propagating/" PROP_NAME "/maxsumuseless"

1190 "maximal number of probings without fixings, until probing is aborted (0: don't abort)"

1194 "maximal depth until propagation is executed(-1: no limit)"

1217

assert(impllbs !=

);

1218

assert(implubs !=

);

1219

assert(proplbs !=

);

1220

assert(propubs !=

);

1221

assert(cutoff !=

);

1222

assert(0 <= probingpos && probingpos < nvars);

1226 SCIPdebugMsg

(

"applying probing on variable <%s> %s %g (nlocks=%d/%d, impls=%d/%d, clqs=%d/%d)\n"

1271 for

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

1282 SCIPdebugMsg

(

"propagating probing implications after <%s> to %g led to a cutoff\n"

1291 for

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

1330 int

* nimplications,

1342

assert(probingvar !=

);

1345

assert(vars !=

|| nvars == 0);

1346

assert(leftproplbs !=

);

1347

assert(leftpropubs !=

);

1348

assert(rightproplbs !=

);

1349

assert(rightpropubs !=

);

1350

assert(nfixedvars !=

);

1351

assert(naggrvars !=

);

1352

assert(nimplications !=

);

1353

assert(nchgbds !=

);

1354

assert(cutoff !=

);

1363

probingvarisinteger =

TRUE

;

1370

probingvarisbinary =

FALSE

;

1371

probingvarisinteger =

FALSE

;

1380 for

( j = 0; j < nvars && !*cutoff; ++j )

1387

assert(vars !=

);

1390

assert(var !=

);

1399 if

( var == probingvar && probingvarisbinary )

1403

newlb =

(leftproplbs[j], rightproplbs[j]);

1404

newub =

(leftpropubs[j], rightpropubs[j]);

1413 if

( !varisinteger )

1441 SCIPdebugMsg

(

"fixed variable <%s> to %g due to probing on <%s> with nlocks=(%d/%d)\n"

1449 SCIPdebugMsg

(

"analyzing probing deduction of <%s> led to an infeasible fixing of variable <%s> to %g\n"

1471

tightenlb = (newlb > oldlb + 0.5);

1472

tightenub = (newub < oldub - 0.5);

1487 SCIPdebugMsg

(

"tightened lower bound of variable <%s>[%g,%g] to %g due to probing on <%s> with nlocks=(%d/%d)\n"

1495 SCIPdebugMsg

(

"analyzing probing deduction of <%s> led to an infeasible new lower bound of variable <%s> to %g\n"

1500 if

( tightenub && !*cutoff )

1506 SCIPdebugMsg

(

"tightened upper bound of variable <%s>[%g,%g] to %g due to probing on <%s> with nlocks=(%d/%d)\n"

1514 SCIPdebugMsg

(

"analyzing probing deduction of <%s> led to an infeasible new lower bound of variable <%s> to %g\n"

1525 if

( var == probingvar )

1529 if

( fixedleft && fixedright &&

1550

rightlb - leftub, -(rightproplbs[j] - leftproplbs[j]), leftproplbs[j] * rightlb - rightproplbs[j] * leftub,

1551

cutoff, &redundant, &aggregated) );

1555 SCIPdebugMsg

(

"aggregated variables %g<%s> - %g<%s> == %g, nlocks=(%d/%d)\n"

1558

leftproplbs[j] * rightlb - rightproplbs[j] * leftub,

1565 SCIPdebugMsg

(

"analyzing probing deduction of <%s> led to an infeasible aggregation: %g<%s> - %g<%s> == %g\n"

1568

leftproplbs[j] * rightlb - rightproplbs[j] * leftub);

1581 SCIP_CALL

(

SCIPaddVarVlb

(

, var, probingvar, (rightproplbs[j] - leftproplbs[j]) / (rightlb - leftub), (leftproplbs[j] * rightlb - rightproplbs[j] * leftub) / (rightlb - leftub), cutoff, &nboundchanges) );

1582

(*nchgbds) += nboundchanges;

1586 SCIPdebugMsg

(

"analyzing probing deduction of <%s> led to an infeasible vlb: %g<%s> - %g<%s> == %g\n"

1589

leftproplbs[j] * rightlb - rightproplbs[j] * leftub);

1593 SCIP_CALL

(

SCIPaddVarVub

(

, var, probingvar, (rightproplbs[j] - leftproplbs[j]) / (rightlb - leftub), (leftproplbs[j] * rightlb - rightproplbs[j] * leftub) / (rightlb - leftub), cutoff, &nboundchanges) );

1594

(*nchgbds) += nboundchanges;

1598 SCIPdebugMsg

(

"analyzing probing deduction of <%s> led to an infeasible vub: %g<%s> - %g<%s> == %g\n"

1601

leftproplbs[j] * rightlb - rightproplbs[j] * leftub);

1624 if

(

(

, newlb, leftpropubs[j]) && (leftimplubs ==

|| leftimplubs[j] > leftpropubs[j]) )

1633

cutoff, &nboundchanges) );

1635

(*nchgbds) += nboundchanges;

1639 SCIPdebugMsg

(

"analyzing probing deduction of <%s> led to an infeasible implication <%s> == 0 => <%s> == %g\n"

1643 else if

(

(

, newub, leftproplbs[j]) && (leftimpllbs ==

|| leftimpllbs[j] < leftproplbs[j]) )

1652

cutoff, &nboundchanges) );

1654

(*nchgbds) += nboundchanges;

1658 SCIPdebugMsg

(

"analyzing probing deduction of <%s> led to an infeasible implication <%s> == 0 => <%s> == %g\n"

1663 else if

(

(

, newlb, rightpropubs[j]) && (rightimplubs ==

|| rightimplubs[j] > rightpropubs[j]) )

1672

cutoff, &nboundchanges) );

1674

(*nchgbds) += nboundchanges;

1678 SCIPdebugMsg

(

"analyzing probing deduction of <%s> led to an infeasible implication <%s> == 1 => <%s> == %g\n"

1682 else if

(

(

, newub, rightproplbs[j]) && (rightimpllbs ==

|| rightimpllbs[j] < rightproplbs[j]) )

1691

cutoff, &nboundchanges) );

1693

(*nchgbds) += nboundchanges;

1697 SCIPdebugMsg

(

"analyzing probing deduction of <%s> led to an infeasible implication <%s> == 1 => <%s> == %g\n"

1706 if

( leftpropubs[j] < newub - 0.5 && (leftimplubs ==

|| leftpropubs[j] < leftimplubs[j]) )

1712

cutoff, &nboundchanges) );

1714

(*nchgbds) += nboundchanges;

1718 SCIPdebugMsg

(

"analyzing probing deduction of <%s> led to an infeasible implication <%s> == 0 => <%s> <= %g\n"

1722 if

( leftproplbs[j] > newlb + 0.5 && (leftimpllbs ==

|| leftproplbs[j] > leftimpllbs[j]) && !*cutoff )

1728

cutoff, &nboundchanges) );

1730

(*nchgbds) += nboundchanges;

1734 SCIPdebugMsg

(

"analyzing probing deduction of <%s> led to an infeasible implication <%s> == 0 => <%s> >= %g\n"

1738 if

( rightpropubs[j] < newub - 0.5 && (rightimplubs ==

|| rightpropubs[j] < rightimplubs[j]) && !*cutoff )

1744

cutoff, &nboundchanges) );

1746

(*nchgbds) += nboundchanges;

1750 SCIPdebugMsg

(

"analyzing probing deduction of <%s> led to an infeasible implication <%s> == 1 => <%s> <= %g\n"

1754 if

( rightproplbs[j] > newlb + 0.5 && (rightimpllbs ==

|| rightproplbs[j] > rightimpllbs[j]) && !*cutoff )

1760

cutoff, &nboundchanges) );

1762

(*nchgbds) += nboundchanges;

1766 SCIPdebugMsg

(