/dports/math/SCIP/scip-7.0.3/src/scip/ |
H A D | branch_cloud.c | 197 int nlpcands; in SCIP_DECL_BRANCHEXECLP() local 226 assert(nlpcands > 0); in SCIP_DECL_BRANCHEXECLP() 336 for( i = 0; i < nlpcands; ++i ) in SCIP_DECL_BRANCHEXECLP() 396 for( i = 0; i < nlpcands; ++i) in SCIP_DECL_BRANCHEXECLP() 437 ncomplete = nlpcands; in SCIP_DECL_BRANCHEXECLP() 447 for( i = 0; i < nlpcands; ++i) in SCIP_DECL_BRANCHEXECLP() 460 assert(nlpcands - counter > 0); in SCIP_DECL_BRANCHEXECLP() 469 assert(counter < nlpcands); in SCIP_DECL_BRANCHEXECLP() 488 counter = nlpcands; in SCIP_DECL_BRANCHEXECLP() 509 SCIPdebugMsg(scip, "saved %d of %d LPs\n", 2*(nlpcands - ncomplete), 2*nlpcands); in SCIP_DECL_BRANCHEXECLP() [all …]
|
H A D | heuristics.c | 125 for( c = 0; c < nlpcands; ++c ) in selectNextDiving() 260 int nlpcands; in SCIPperformGenericDivingAlgorithm() local 325 if( onlylpbranchcands && nlpcands == 0 ) in SCIPperformGenericDivingAlgorithm() 384 startndivecands = nlpcands; in SCIPperformGenericDivingAlgorithm() 399 lpcandsscoressize = nlpcands; in SCIPperformGenericDivingAlgorithm() 434 SCIPdivesetGetName(diveset), lastlpdepth, nlpcands); in SCIPperformGenericDivingAlgorithm() 439 while( allroundable && c < nlpcands ) in SCIPperformGenericDivingAlgorithm() 486 leafsol = (nlpcands == 0); in SCIPperformGenericDivingAlgorithm() 512 assert(nlpcands > 0); in SCIPperformGenericDivingAlgorithm() 519 lpcandsscoressize = nlpcands; in SCIPperformGenericDivingAlgorithm() [all …]
|
H A D | branch_fullstrong.c | 230 assert(nlpcands > 0); in SCIPselectVarStrongBranching() 257 if( (!forcestrongbranch && nlpcands == 1) || SCIPisStopped(scip) ) in SCIPselectVarStrongBranching() 299 for( i = 0, c = *start; i < nlpcands && (!bothgains || i < ncomplete); ++i, ++c ) in SCIPselectVarStrongBranching() 301 c = c % nlpcands; in SCIPselectVarStrongBranching() 549 int nlpcands; in SCIP_DECL_BRANCHEXECLP() local 568 assert(nlpcands > 0); in SCIP_DECL_BRANCHEXECLP() 574 SCIP_CALL( SCIPduplicateBufferArray(scip, &lpcands, tmplpcands, nlpcands) ); in SCIP_DECL_BRANCHEXECLP() 575 SCIP_CALL( SCIPduplicateBufferArray(scip, &lpcandssol, tmplpcandssol, nlpcands) ); in SCIP_DECL_BRANCHEXECLP() 576 SCIP_CALL( SCIPduplicateBufferArray(scip, &lpcandsfrac, tmplpcandsfrac, nlpcands) ); in SCIP_DECL_BRANCHEXECLP() 590 branchruledata->skipup, nlpcands, npriolpcands, nlpcands, &branchruledata->lastcand, in SCIP_DECL_BRANCHEXECLP() [all …]
|
H A D | heur_objpscostdiving.c | 280 int nlpcands; in SCIP_DECL_HEUREXEC() local 349 …SCIP_CALL( SCIPgetLPBranchCands(scip, &lpcands, &lpcandssol, &lpcandsfrac, &nlpcands, NULL, NULL) … in SCIP_DECL_HEUREXEC() 352 if( nlpcands == 0 ) in SCIP_DECL_HEUREXEC() 383 startnlpcands = nlpcands; in SCIP_DECL_HEUREXEC() 384 while( !lperror && lpsolstat == SCIP_LPSOLSTAT_OPTIMAL && nlpcands > 0 in SCIP_DECL_HEUREXEC() 386 || nlpcands <= startnlpcands - divedepth/2 in SCIP_DECL_HEUREXEC() 387 || (divedepth < maxdivedepth && nlpcands <= startnlpcands - divedepth/10 in SCIP_DECL_HEUREXEC() 405 for( c = 0; c < nlpcands; ++c ) in SCIP_DECL_HEUREXEC() 586 …SCIP_CALL( SCIPgetLPBranchCands(scip, &lpcands, &lpcandssol, &lpcandsfrac, &nlpcands, NULL, NULL) … in SCIP_DECL_HEUREXEC() 588 SCIPdebugMsg(scip, " -> lpsolstat=%d, nfrac=%d\n", lpsolstat, nlpcands); in SCIP_DECL_HEUREXEC() [all …]
|
H A D | heur_nlpdiving.c | 174 assert(nlpcands != NULL); in getNLPFracVars() 206 (*nlpcands)[c] = (*nlpcands)[*nnlpcands]; in getNLPFracVars() 259 assert(nlpcands != NULL); in chooseFracVar() 282 var = nlpcands[c]; in chooseFracVar() 432 assert(nlpcands != NULL); in chooseVeclenVar() 456 var = nlpcands[c]; in chooseVeclenVar() 529 assert(nlpcands != NULL); in chooseCoefVar() 555 var = nlpcands[c]; in chooseCoefVar() 816 var = nlpcands[c]; in choosePscostVar() 942 var = nlpcands[c]; in chooseGuidedVar() [all …]
|
H A D | heur_rootsoldiving.c | 184 int nlpcands; in SCIP_DECL_HEUREXEC() local 265 nlpcands = SCIPgetNLPBranchCands(scip); in SCIP_DECL_HEUREXEC() 268 if( nlpcands == 0 ) in SCIP_DECL_HEUREXEC() 308 …SCIPgetNNodes(scip), SCIPgetDepth(scip), nlpcands, SCIPgetDualbound(scip), maxnlpiterations, maxdi… in SCIP_DECL_HEUREXEC() 317 startnlpcands = nlpcands; in SCIP_DECL_HEUREXEC() 318 while( !lperror && lpsolstat == SCIP_LPSOLSTAT_OPTIMAL && nlpcands > 0 && ncycles < 10 in SCIP_DECL_HEUREXEC() 320 || nlpcands <= startnlpcands - divedepth/2 in SCIP_DECL_HEUREXEC() 536 nlpcands = SCIPgetNLPBranchCands(scip); in SCIP_DECL_HEUREXEC() 537 SCIPdebugMsg(scip, " -> lpsolstat=%d, nfrac=%d\n", lpsolstat, nlpcands); in SCIP_DECL_HEUREXEC() 544 if( nlpcands == 0 && !lperror && lpsolstat == SCIP_LPSOLSTAT_OPTIMAL ) in SCIP_DECL_HEUREXEC()
|
H A D | heur_zirounding.c | 481 int nlpcands; in SCIP_DECL_HEUREXEC() local 527 …SCIP_CALL( SCIPgetLPBranchCands(scip, &lpcands, &lpcandssol, NULL, &nlpcands, NULL, &nimplfracs) ); in SCIP_DECL_HEUREXEC() 528 nlpcands = nlpcands + nimplfracs; in SCIP_DECL_HEUREXEC() 530 if( nlpcands == 0 ) in SCIP_DECL_HEUREXEC() 533 assert(nlpcands > 0); in SCIP_DECL_HEUREXEC() 559 SCIP_CALL( SCIPallocBufferArray(scip, &solarray, nlpcands) ); in SCIP_DECL_HEUREXEC() 560 SCIP_CALL( SCIPallocBufferArray(scip, &zilpcands, nlpcands) ); in SCIP_DECL_HEUREXEC() 563 BMScopyMemoryArray(solarray, lpcandssol, nlpcands); in SCIP_DECL_HEUREXEC() 564 BMScopyMemoryArray(zilpcands, lpcands, nlpcands); in SCIP_DECL_HEUREXEC() 582 for( c = 0; c < nlpcands; ++c ) in SCIP_DECL_HEUREXEC() [all …]
|
H A D | heur_simplerounding.c | 188 int nlpcands; in performLPSimpleRounding() local 200 …SCIP_CALL( SCIPgetLPBranchCands(scip, &lpcands, &lpcandssol, NULL, &nlpcands, NULL, &nfracimplvars… in performLPSimpleRounding() 205 if ( nlpcands == 0 && heurtiming != SCIP_HEURTIMING_DURINGPRICINGLOOP ) in performLPSimpleRounding() 212 if ( nlpcands > heurdata->nroundablevars ) in performLPSimpleRounding() 229 …SCIPdebugMsg(scip, "executing simple LP-rounding heuristic, fractionals: %d + %d\n", nlpcands, nfr… in performLPSimpleRounding() 230 …SCIP_CALL( performSimpleRounding(scip, sol, lpcands, lpcandssol, nlpcands + nfracimplvars, result)… in performLPSimpleRounding()
|
H A D | branch_random.c | 202 int nlpcands; in SCIP_DECL_BRANCHEXECLP() local 216 SCIP_CALL( SCIPgetLPBranchCands(scip, &lpcands, NULL, NULL, NULL, &nlpcands, NULL) ); in SCIP_DECL_BRANCHEXECLP() 217 assert(nlpcands > 0); in SCIP_DECL_BRANCHEXECLP() 220 bestcand = SCIPrandomGetInt(branchruledata->randnumgen, 0, nlpcands-1); in SCIP_DECL_BRANCHEXECLP() 224 nlpcands, bestcand, SCIPvarGetName(lpcands[bestcand])); in SCIP_DECL_BRANCHEXECLP()
|
H A D | branch_mostinf.c | 232 int nlpcands; in SCIP_DECL_BRANCHEXECLP() local 249 SCIP_CALL( SCIPgetLPBranchCands(scip, &lpcands, NULL, &lpcandsfrac, NULL, &nlpcands, NULL) ); in SCIP_DECL_BRANCHEXECLP() 250 assert(nlpcands > 0); in SCIP_DECL_BRANCHEXECLP() 256 for( i = 0; i < nlpcands; ++i ) in SCIP_DECL_BRANCHEXECLP() 277 nlpcands, bestcand, SCIPvarGetName(lpcands[bestcand]), lpcandsfrac[bestcand], bestobj, in SCIP_DECL_BRANCHEXECLP()
|
H A D | branch_leastinf.c | 232 int nlpcands; in SCIP_DECL_BRANCHEXECLP() local 249 SCIP_CALL( SCIPgetLPBranchCands(scip, &lpcands, NULL, &lpcandsfrac, NULL, &nlpcands, NULL) ); in SCIP_DECL_BRANCHEXECLP() 250 assert(nlpcands > 0); in SCIP_DECL_BRANCHEXECLP() 256 for( i = 0; i < nlpcands; ++i ) in SCIP_DECL_BRANCHEXECLP() 277 nlpcands, bestcand, SCIPvarGetName(lpcands[bestcand]), lpcandsfrac[bestcand], bestobj, in SCIP_DECL_BRANCHEXECLP()
|
H A D | branch.c | 62 assert(branchcand->nlpcands <= branchcand->lpcandssize); in ensureLpcandsSize() 149 (*branchcand)->nlpcands = 0; in SCIPbranchcandCreate() 224 branchcand->nlpcands = 0; in branchcandCalcLPCands() 257 branchcand->nlpcands = 0; in branchcandCalcLPCands() 306 insertpos = branchcand->nlpcands + branchcand->nimpllpfracs; in branchcandCalcLPCands() 316 assert(branchcand->lpcands[branchcand->nlpcands] != NULL in branchcandCalcLPCands() 323 insertpos = branchcand->nlpcands; in branchcandCalcLPCands() 375 branchcand->nlpcands++; in branchcandCalcLPCands() 428 if( nlpcands != NULL ) in SCIPbranchcandGetLPCands() 429 *nlpcands = branchcand->nlpcands; in SCIPbranchcandGetLPCands() [all …]
|
H A D | heur_randrounding.c | 305 int nlpcands; in performLPRandRounding() local 315 SCIP_CALL( SCIPgetLPBranchCands(scip, &lpcands, NULL, NULL, &nlpcands, NULL, NULL) ); in performLPRandRounding() 319 if ( nlpcands == 0 && heurtiming != SCIP_HEURTIMING_DURINGPRICINGLOOP ) in performLPRandRounding() 338 SCIPdebugMsg(scip, "executing rand LP-rounding heuristic: %d fractionals\n", nlpcands); in performLPRandRounding() 339 SCIP_CALL( performRandRounding(scip, heurdata, sol, lpcands, nlpcands, propagate, result) ); in performLPRandRounding()
|
H A D | heur_rounding.c | 344 int nlpcands, /**< number of fractional variables in LP */ in selectEssentialRounding() argument 368 for( v = 0; v < nlpcands; ++v ) in selectEssentialRounding() 532 int nlpcands; in SCIP_DECL_HEUREXEC() local 576 SCIP_CALL( SCIPgetLPBranchCands(scip, &lpcands, &lpcandssol, NULL, &nlpcands, NULL, NULL) ); in SCIP_DECL_HEUREXEC() 577 nfrac = nlpcands; in SCIP_DECL_HEUREXEC() 631 for( c = 0; c < nlpcands; ++c ) in SCIP_DECL_HEUREXEC() 683 …SCIP_CALL( selectEssentialRounding(scip, sol, minobj, lpcands, nlpcands, &roundvar, &oldsolval, &n… in SCIP_DECL_HEUREXEC()
|
H A D | heur_shifting.c | 424 int nlpcands, /**< number of fractional variables in LP */ in selectEssentialRounding() argument 448 for( v = 0; v < nlpcands; ++v ) in selectEssentialRounding() 679 int nlpcands; in SCIP_DECL_HEUREXEC() local 729 SCIP_CALL( SCIPgetLPBranchCands(scip, &lpcands, &lpcandssol, NULL, &nlpcands, NULL, NULL) ); in SCIP_DECL_HEUREXEC() 730 nfrac = nlpcands; in SCIP_DECL_HEUREXEC() 785 for( c = 0; c < nlpcands; ++c ) in SCIP_DECL_HEUREXEC() 798 for( c = 0; c < nlpcands; ++c ) in SCIP_DECL_HEUREXEC() 871 …SCIP_CALL( selectEssentialRounding(scip, sol, minobj, lpcands, nlpcands, &shiftvar, &oldsolval, &n… in SCIP_DECL_HEUREXEC()
|
H A D | heur_intshifting.c | 440 int nlpcands, /**< number of fractional variables in LP */ in selectEssentialRounding() argument 464 for( v = 0; v < nlpcands; ++v ) in selectEssentialRounding() 699 int nlpcands; in SCIP_DECL_HEUREXEC() local 759 SCIP_CALL( SCIPgetLPBranchCands(scip, &lpcands, &lpcandssol, NULL, &nlpcands, NULL, NULL) ); in SCIP_DECL_HEUREXEC() 760 nfrac = nlpcands; in SCIP_DECL_HEUREXEC() 882 for( c = 0; c < nlpcands; ++c ) in SCIP_DECL_HEUREXEC() 895 for( c = 0; c < nlpcands; ++c ) in SCIP_DECL_HEUREXEC() 967 …SCIP_CALL( selectEssentialRounding(scip, sol, minobj, lpcands, nlpcands, &shiftvar, &oldsolval, &n… in SCIP_DECL_HEUREXEC()
|
H A D | branch_pscost.c | 607 int nlpcands; in SCIP_DECL_BRANCHEXECLP() local 619 SCIP_CALL( SCIPgetLPBranchCands(scip, &lpcands, &lpcandssol, NULL, NULL, &nlpcands, NULL) ); in SCIP_DECL_BRANCHEXECLP() 620 assert(nlpcands > 0); in SCIP_DECL_BRANCHEXECLP() 625 for( c = 0; c < nlpcands; ++c ) in SCIP_DECL_BRANCHEXECLP() 641 assert(0 <= bestcand && bestcand < nlpcands); in SCIP_DECL_BRANCHEXECLP() 647 nlpcands, bestcand, SCIPvarGetName(lpcands[bestcand]), lpcandssol[bestcand], bestscore); in SCIP_DECL_BRANCHEXECLP()
|
H A D | branch_multaggr.c | 754 int nlpcands; in SCIP_DECL_BRANCHEXECLP() local 807 …SCIP_CALL( SCIPgetLPBranchCands(scip, &tmplpcands, &tmplpcandssol, &tmplpcandsfrac, &nlpcands, &np… in SCIP_DECL_BRANCHEXECLP() 808 assert(nlpcands > 0); in SCIP_DECL_BRANCHEXECLP() 814 SCIP_CALL( SCIPduplicateBufferArray(scip, &lpcands, tmplpcands, nlpcands) ); in SCIP_DECL_BRANCHEXECLP() 815 SCIP_CALL( SCIPduplicateBufferArray(scip, &lpcandssol, tmplpcandssol, nlpcands) ); in SCIP_DECL_BRANCHEXECLP() 816 SCIP_CALL( SCIPduplicateBufferArray(scip, &lpcandsfrac, tmplpcandsfrac, nlpcands) ); in SCIP_DECL_BRANCHEXECLP() 836 branchruledata->skipup, nlpcands, npriolpcands, nlpcands, &branchruledata->lastcand, in SCIP_DECL_BRANCHEXECLP()
|
H A D | branch_fullstrong.h | 85 …int nlpcands, /**< number of branching candidates …
|
H A D | struct_branch.h | 48 …int nlpcands; /**< number of candidates for branching on LP solution */ member
|
H A D | branch_relpscost.c | 1962 int nlpcands; in SCIP_DECL_BRANCHEXECLP() local 1980 …SCIP_CALL( SCIPgetLPBranchCands(scip, &lpcands, &lpcandssol, &lpcandsfrac, NULL, &nlpcands, NULL) … in SCIP_DECL_BRANCHEXECLP() 1981 assert(nlpcands > 0); in SCIP_DECL_BRANCHEXECLP() 1998 SCIP_CALL( SCIPallocBufferArray(scip, &filteredlpcands, nlpcands) ); in SCIP_DECL_BRANCHEXECLP() 1999 SCIP_CALL( SCIPallocBufferArray(scip, &filteredlpcandssol, nlpcands) ); in SCIP_DECL_BRANCHEXECLP() 2000 SCIP_CALL( SCIPallocBufferArray(scip, &filteredlpcandsfrac, nlpcands) ); in SCIP_DECL_BRANCHEXECLP() 2001 SCIP_CALL( SCIPallocBufferArray(scip, &filteredlpcandsorbitidx, nlpcands) ); in SCIP_DECL_BRANCHEXECLP() 2010 SCIP_CALL( SCIPduplicateBufferArray(scip, &filteredlpcands, lpcands, nlpcands) ); in SCIP_DECL_BRANCHEXECLP() 2011 SCIP_CALL( SCIPduplicateBufferArray(scip, &filteredlpcandssol, lpcandssol, nlpcands) ); in SCIP_DECL_BRANCHEXECLP() 2012 SCIP_CALL( SCIPduplicateBufferArray(scip, &filteredlpcandsfrac, lpcandsfrac, nlpcands) ); in SCIP_DECL_BRANCHEXECLP() [all …]
|
H A D | visual.c | 392 int nlpcands = 0; in SCIPvisualUpdateChild() local 419 … SCIP_CALL( SCIPgetLPBranchCands(set->scip, NULL, NULL, &lpcandsfrac, &nlpcands, NULL, NULL) ); in SCIPvisualUpdateChild() 420 for( j = 0; j < nlpcands; ++j ) in SCIPvisualUpdateChild() 432 lowerbound, sum, nlpcands); in SCIPvisualUpdateChild()
|
/dports/math/SCIP/scip-7.0.3/examples/Binpacking/src/ |
H A D | branch_ryanfoster.c | 102 int nlpcands; in SCIP_DECL_BRANCHEXECLP() local 145 SCIP_CALL( SCIPgetLPBranchCands(scip, &lpcands, NULL, &lpcandsfrac, NULL, &nlpcands, NULL) ); in SCIP_DECL_BRANCHEXECLP() 146 assert(nlpcands > 0); in SCIP_DECL_BRANCHEXECLP() 149 for( v = 0; v < nlpcands; ++v ) in SCIP_DECL_BRANCHEXECLP()
|
/dports/math/SCIP/scip-7.0.3/applications/Coloring/src/ |
H A D | branch_coloring.c | 76 int nlpcands; in SCIP_DECL_BRANCHEXECLP() local 120 SCIP_CALL( SCIPgetLPBranchCands(scip, &lpcands, NULL, &lpcandsfrac, NULL, &nlpcands, NULL) ); in SCIP_DECL_BRANCHEXECLP() 121 assert(nlpcands > 0); in SCIP_DECL_BRANCHEXECLP() 127 for( i = 0; i < nlpcands; ++i ) in SCIP_DECL_BRANCHEXECLP()
|
H A D | branch_strongcoloring.c | 205 int nlpcands; in computeBranchingPriorities() local 220 SCIP_CALL( SCIPgetLPBranchCands(scip, &lpcands, NULL, &lpcandsfrac, &nlpcands, NULL, NULL) ); in computeBranchingPriorities() 244 for ( i = 0; i < nlpcands; i++ ) in computeBranchingPriorities()
|