/dports/math/SCIP/scip-7.0.3/src/scip/ |
H A D | struct_heur.h | 45 SCIP_Longint nsolsfound; /**< the total number of solutions found */ member 91 …SCIP_Longint nsolsfound; /**< number of feasible primal solutions found so far by… member
|
H A D | heur_feaspump.c | 684 SCIP_Longint nsolsfound, /**< total number of solutions found so far by SCIP */ in adjustedMaxNLPIterations() argument 690 if( nsolsfound == 0 ) in adjustedMaxNLPIterations() 730 SCIP_Longint nsolsfound; /* number of solutions found by this heuristic */ in SCIP_DECL_HEUREXEC() local 817 nsolsfound = 10*SCIPheurGetNBestSolsFound(heur) + heurdata->nsuccess; in SCIP_DECL_HEUREXEC() 818 …maxnlpiterations = (SCIP_Longint)((1.0 + 10.0*(nsolsfound+1.0)/(ncalls+1.0)) * heurdata->maxlpiter… in SCIP_DECL_HEUREXEC() 937 nsolsfound = SCIPgetNBestSolsFound(scip); in SCIP_DECL_HEUREXEC() 939 objfactor = MIN(1.0 - 0.1 / (SCIP_Real)(1 + nsolsfound), 0.999); in SCIP_DECL_HEUREXEC() 958 … && heurdata->nlpiterations < adjustedMaxNLPIterations(maxnlpiterations, nsolsfound, nstallloops) in SCIP_DECL_HEUREXEC() 1141 …nlpiterationsleft = adjustedMaxNLPIterations(maxnlpiterations, nsolsfound, nstallloops) - heurdata… in SCIP_DECL_HEUREXEC() 1171 …heurdata->nlpiterations, adjustedMaxNLPIterations(maxnlpiterations, nsolsfound, nstallloops), lper… in SCIP_DECL_HEUREXEC() [all …]
|
H A D | heur.c | 104 divesetstats->nsolsfound = 0; in resetDivesetStats() 141 SCIP_Longint nsolsfound, /**< number of new solutions found this time */ in updateDivesetstats() argument 163 divesetstats->nsolsfound += nsolsfound; in updateDivesetstats() 207 nbacktracks, nsolsfound, nbestsolsfound, nconflictsfound, leavesol); in SCIPdivesetUpdateStats() 461 return 10 * divesetstats->nbestsolsfound + divesetstats->nsolsfound; in SCIPdivesetGetSolSuccess() 630 return divesetstats->nsolsfound; in SCIPdivesetGetNSols() 939 (*heur)->nsolsfound = 0; in doHeurCreate() 1065 heur->nsolsfound = 0; in SCIPheurInit() 1284 oldnsolsfound = primal->nsolsfound; in SCIPheurExec() 1309 heur->nsolsfound += primal->nsolsfound - oldnsolsfound; in SCIPheurExec() [all …]
|
H A D | struct_primal.h | 39 SCIP_Longint nsolsfound; /**< number of primal CIP solutions found up to now */ member
|
H A D | heur_rootsoldiving.c | 193 SCIP_Longint nsolsfound; in SCIP_DECL_HEUREXEC() local 253 nsolsfound = 10*SCIPheurGetNBestSolsFound(heur) + heurdata->nsuccess; in SCIP_DECL_HEUREXEC() 254 …maxnlpiterations = (SCIP_Longint)((1.0 + 10.0*(nsolsfound+1.0)/(ncalls+1.0)) * heurdata->maxlpiter… in SCIP_DECL_HEUREXEC()
|
H A D | heur_objpscostdiving.c | 274 SCIP_Longint nsolsfound; in SCIP_DECL_HEUREXEC() local 337 nsolsfound = 10*SCIPheurGetNBestSolsFound(heur) + heurdata->nsuccess; in SCIP_DECL_HEUREXEC() 338 …maxnlpiterations = (SCIP_Longint)((1.0 + 10.0*(nsolsfound+1.0)/(ncalls+1.0)) * heurdata->maxlpiter… in SCIP_DECL_HEUREXEC()
|
H A D | heur_dins.c | 215 SCIP_Longint nsolsfound; in determineVariableFixings() local 234 nsolsfound = SCIPgetNSolsFound(scip); in determineVariableFixings() 278 …if( nsols > 1 && heurdata->lastnsolsfound != nsolsfound && delta[i] ) /* no need to update delta[i… in determineVariableFixings() 302 heurdata->lastnsolsfound = nsolsfound; in determineVariableFixings()
|
H A D | heur_intdiving.c | 200 SCIP_Longint nsolsfound; in SCIP_DECL_HEUREXEC() local 256 nsolsfound = 10*SCIPheurGetNBestSolsFound(heur) + heurdata->nsuccess; in SCIP_DECL_HEUREXEC() 257 …maxnlpiterations = (SCIP_Longint)((1.0 + 10.0*(nsolsfound+1.0)/(ncalls+1.0)) * heurdata->maxlpiter… in SCIP_DECL_HEUREXEC()
|
H A D | heur_rounding.c | 540 SCIP_Longint nsolsfound; in SCIP_DECL_HEUREXEC() local 570 nsolsfound = 10*SCIPheurGetNBestSolsFound(heur) + SCIPheurGetNSolsFound(heur); in SCIP_DECL_HEUREXEC() 572 if( nnodes % ((ncalls/heurdata->successfactor)/(nsolsfound+1)+1) != 0 ) in SCIP_DECL_HEUREXEC()
|
H A D | scip_probing.h | 448 SCIP_Longint nsolsfound, /**< the number of solutions found */
|
H A D | heur.h | 85 SCIP_Longint nsolsfound, /**< number of new solutions found this time */
|
H A D | primal.c | 139 (*primal)->nsolsfound = 0; in SCIPprimalCreate() 225 (*primal)->nsolsfound = 0; in SCIPprimalClear() 745 primal->nsolsfound++; in primalAddSol() 753 if( primal->nsolsfound == 1 ) in primalAddSol() 772 insertpos, primal->nsols, primal->nsolsfound); in primalAddSol() 864 primal->nsolsfound++; in primalAddOrigSol() 871 insertpos, primal->nsols, primal->nsolsfound); in primalAddOrigSol()
|
H A D | heur_adaptivediving.c | 286 …SCIP_Real nsolsfound = SCIPheurGetNSolsFound(heur) + heurdata->bestsolweight * SCIPheurGetNBestSol… in getLPIterlimit() local 305 …lpiterlimit = (SCIP_Longint)(heurdata->maxlpiterquot * (nsolsfound+1.0)/(ncalls+1.0) * nlpiteratio… in getLPIterlimit()
|
H A D | heur_shifting.c | 692 SCIP_Longint nsolsfound; in SCIP_DECL_HEUREXEC() local 722 nsolsfound = 10*SCIPheurGetNBestSolsFound(heur) + SCIPheurGetNSolsFound(heur); in SCIP_DECL_HEUREXEC() 724 if( nnodes % ((ncalls/100)/(nsolsfound+1)+1) != 0 ) in SCIP_DECL_HEUREXEC()
|
H A D | concurrent.c | 561 heurs[i]->nsolsfound += heur->nsolsfound; in SCIPcopyConcurrentSolvingStats() 671 target->primal->nsolsfound = source->primal->nsolsfound; in SCIPcopyConcurrentSolvingStats()
|
H A D | heur_intshifting.c | 712 SCIP_Longint nsolsfound; in SCIP_DECL_HEUREXEC() local 752 nsolsfound = 10*SCIPheurGetNBestSolsFound(heur) + SCIPheurGetNSolsFound(heur); in SCIP_DECL_HEUREXEC() 754 if( nnodes % (ncalls/(nsolsfound+1)+1) != 0 ) /*?????????? ncalls/100 */ in SCIP_DECL_HEUREXEC()
|
H A D | heur_alns.c | 328 SCIP_Longint nsolsfound; /**< the total number of solutions found */ member 752 stats->nsolsfound = 0; in neighborhoodStatsReset() 939 runstats->nsolsfound++; in transferSolution() 953 runstats->nsolsfound++; in transferSolution() 1013 stats->nsolsfound = 0; in initRunStats() 1090 SCIPinfoMessage(scip, file, " %10" SCIP_LONGINT_FORMAT, neighborhood->stats.nsolsfound); in printNeighborhoodStatistics() 1142 stats->nsolsfound += runstats->nsolsfound; in updateNeighborhoodStats() 1148 else if( runstats->nsolsfound > 0 ) in updateNeighborhoodStats()
|
H A D | scip_solve.c | 435 oldnsolsfound = scip->primal->nsolsfound; in SCIPtransformProb() 486 scip->stat->nexternalsolsfound += scip->primal->nsolsfound - oldnsolsfound; in SCIPtransformProb() 1536 oldnsolsfound = scip->primal->nsolsfound; in transformSols() 1582 scip->stat->nexternalsolsfound += scip->primal->nsolsfound - oldnsolsfound; in transformSols() 2156 SCIPgetPrimalbound(scip), scip->primal->nsolsfound); in displayRelevantStats() 2157 if( scip->primal->nsolsfound > 0 ) in displayRelevantStats() 2166 if( scip->primal->nsolsfound != scip->primal->nlimsolsfound ) in displayRelevantStats() 2172 SCIPgetPrimalbound(scip), scip->primal->nsolsfound, limsolstring); in displayRelevantStats()
|
H A D | scip_probing.c | 1154 SCIP_Longint nsolsfound, /**< the number of solutions found */ in SCIPupdateDivesetStats() argument 1165 …divesetUpdateStats(diveset, scip->stat, SCIPgetDepth(scip), nprobingnodes, nbacktracks, nsolsfound, in SCIPupdateDivesetStats()
|
H A D | heur_nlpdiving.c | 1660 SCIP_Longint nsolsfound; in SCIP_DECL_HEUREXEC() local 1739 nsolsfound = 10*SCIPheurGetNBestSolsFound(heur) + heurdata->nsuccess; in SCIP_DECL_HEUREXEC() 1741 maxnnlpiterations += (int)((1.0 + 10.0*(nsolsfound+1.0)/(ncalls+1.0)) * heurdata->maxnlpiterrel); in SCIP_DECL_HEUREXEC()
|
H A D | scip_solvingstats.c | 1727 return scip->primal->nsolsfound; in SCIPgetNSolsFound() 3457 if( scip->primal->nsolsfound != scip->primal->nlimsolsfound ) in SCIPprintSolutionStatistics() 3464 scip->primal->nsolsfound, scip->primal->nbestsolsfound, limsolstring); in SCIPprintSolutionStatistics() 3503 if( scip->primal->nsolsfound > 0 ) in SCIPprintSolutionStatistics()
|