120 SCIP_Longint* nchecknonzeros,
121 SCIP_Longint* nactivenonzeros,
122 SCIP_Bool* approxchecknonzeros,
125 SCIP_Bool* approxactivenonzeros
138 *nchecknonzeros = 0LL;
139 *nactivenonzeros = 0LL;
140 *approxchecknonzeros =
FALSE;
141 *approxactivenonzeros =
FALSE;
144 for(
h =
scip->set->nconshdlrs - 1;
h >= 0; --
h )
153 for(
c = nconss - 1;
c >= 0; --
c )
160 *approxactivenonzeros =
TRUE;
162 *approxchecknonzeros =
TRUE;
166 *nactivenonzeros +=
nvars;
168 *nchecknonzeros +=
nvars;
179 for(
c = nconss - 1;
c >= 0; --
c )
186 *approxchecknonzeros =
TRUE;
188 *nchecknonzeros +=
nvars;
226 SCIP_Longint oldnsolsfound;
232 SCIP_CALL(
SCIPcheckStage(
scip,
"SCIPtransformProb",
FALSE,
TRUE,
FALSE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE) );
291 ncandsols =
scip->origprimal->nsols;
299 if( !
scip->set->reopt_enable &&
scip->set->nactivebenders == 0 )
301 oldnsolsfound =
scip->primal->nsolsfound;
302 for( s =
scip->origprimal->nsols - 1; s >= 0; --s )
307 sol =
scip->origprimal->sols[s];
346 scip->origprimal->nsols--;
352 scip->stat->nexternalsolsfound +=
scip->primal->nsolsfound - oldnsolsfound;
357 "%d/%d feasible solution%s given by solution candidate storage, new primal bound %.6e\n\n",
360 else if( ncandsols > 0 && !
scip->set->reopt_enable )
363 "all %d solutions given by solution candidate storage are infeasible\n\n", ncandsols);
368 "transformed problem has %d variables (%d bin, %d int, %d impl, %d cont) and %d constraints\n",
369 scip->transprob->nvars,
scip->transprob->nbinvars,
scip->transprob->nintvars,
scip->transprob->nimplvars,
370 scip->transprob->ncontvars,
scip->transprob->nconss);
372 for(
h = 0;
h <
scip->set->nconshdlrs; ++
h )
377 if( nactiveconss > 0 )
386 SCIP_Real maxnonzeros;
387 SCIP_Longint nchecknonzeros;
388 SCIP_Longint nactivenonzeros;
389 SCIP_Bool approxchecknonzeros;
390 SCIP_Bool approxactivenonzeros;
394 maxnonzeros =
MAX(maxnonzeros, 1.0);
396 scip->stat->nnz = nactivenonzeros;
401 approxactivenonzeros ?
"more than " :
"", nactivenonzeros, nactivenonzeros/maxnonzeros * 100,
402 approxchecknonzeros ?
"more than " :
"", nchecknonzeros, nchecknonzeros/maxnonzeros * 100);
410 if(
scip->set->random_permutationseed > 0 )
412 SCIP_Bool permuteconss;
413 SCIP_Bool permutevars;
416 permuteconss =
scip->set->random_permuteconss;
417 permutevars =
scip->set->random_permutevars;
418 permutationseed =
scip->set->random_permutationseed;
423 if(
scip->set->misc_estimexternmem )
441 size_t nusedcleanbuffers;
464 scip->stat->prevrunnvars =
scip->transprob->nvars;
472 scip->conflictstore,
scip->eventfilter,
scip->eventqueue,
scip->cliquetable) );
502 SCIP_Bool* infeasible
507 size_t nusedcleanbuffers;
534 for( v =
nvars - 1; v >= 0; --v )
578 int nlocalbdchgs = 0;
588 "clique table cleanup detected %d bound changes%s\n", nlocalbdchgs, *infeasible ?
" and infeasibility" :
"");
611 if(
scip->set->misc_calcintegral )
620 scip->conflictstore,
scip->eventfilter,
scip->eventqueue,
scip->cliquetable) );
655 SCIP_Bool* unbounded,
656 SCIP_Bool* infeasible,
672 SCIP_Bool lastranpresol;
674 int oldpresolstart = 0;
675 int oldpropstart = 0;
676 int oldconsstart = 0;
685 size_t nusedcleanbuffers;
696 assert((presolend ==
scip->set->npresols && propend ==
scip->set->nprops && consend ==
scip->set->nconshdlrs)
697 || (*presolstart == 0 && *propstart == 0 && *consstart == 0));
728 if(
i >= presolend && j >= propend && k >= consend )
731 if(
i == 0 && j == 0 && k == 0 )
732 ++(
scip->stat->npresolroundsext);
746 ++(
scip->stat->npresolroundsfast);
748 ++(
scip->stat->npresolroundsmed);
751 SCIPdebugMsg(
scip,
"starting presolving round %d (%d/%d/%d), timing = %u\n",
752 scip->stat->npresolrounds,
scip->stat->npresolroundsfast,
scip->stat->npresolroundsmed,
753 scip->stat->npresolroundsext, *timing);
756 while( !(*unbounded) && !(*infeasible) && !aborted && (
i < presolend || j < propend) )
769 if( prioprop >= priopresol )
777 &
scip->stat->npresolfixedvars, &
scip->stat->npresolaggrvars, &
scip->stat->npresolchgvartypes,
778 &
scip->stat->npresolchgbds, &
scip->stat->npresoladdholes, &
scip->stat->npresoldelconss,
779 &
scip->stat->npresoladdconss, &
scip->stat->npresolupgdconss, &
scip->stat->npresolchgcoefs,
784 lastranpresol =
FALSE;
796 &
scip->stat->npresolfixedvars, &
scip->stat->npresolaggrvars, &
scip->stat->npresolchgvartypes,
797 &
scip->stat->npresolchgbds, &
scip->stat->npresoladdholes, &
scip->stat->npresoldelconss,
798 &
scip->stat->npresoladdconss, &
scip->stat->npresolupgdconss, &
scip->stat->npresolchgcoefs,
803 lastranpresol =
TRUE;
816 "propagator <%s> detected infeasibility\n",
SCIPpropGetName(
scip->set->props_presol[j-1]));
824 "presolver <%s> detected unboundedness (or infeasibility)\n",
SCIPpresolGetName(
scip->set->presols[
i-1]));
827 "propagator <%s> detected unboundedness (or infeasibility)\n",
SCIPpropGetName(
scip->set->props_presol[j-1]));
843 *presolstart =
i + 1;
858 while( k < consend && !(*unbounded) && !(*infeasible) && !aborted )
860 SCIPdebugMsg(
scip,
"executing presolve method of constraint handler <%s>\n",
863 *timing,
scip->stat->npresolrounds,
864 &
scip->stat->npresolfixedvars, &
scip->stat->npresolaggrvars, &
scip->stat->npresolchgvartypes,
865 &
scip->stat->npresolchgbds, &
scip->stat->npresoladdholes, &
scip->stat->npresoldelconss,
866 &
scip->stat->npresoladdconss, &
scip->stat->npresolupgdconss, &
scip->stat->npresolchgcoefs,
883 "constraint handler <%s> detected unboundedness (or infeasibility)\n",
908 while( !(*unbounded) && !(*infeasible) && !aborted && (
i < presolend || j < propend) )
913 priopresol = -INT_MAX;
915 if( j < scip->
set->nprops )
921 if( prioprop >= priopresol )
927 &
scip->stat->npresolfixedvars, &
scip->stat->npresolaggrvars, &
scip->stat->npresolchgvartypes,
928 &
scip->stat->npresolchgbds, &
scip->stat->npresoladdholes, &
scip->stat->npresoldelconss,
929 &
scip->stat->npresoladdconss, &
scip->stat->npresolupgdconss, &
scip->stat->npresolchgcoefs,
934 lastranpresol =
FALSE;
943 &
scip->stat->npresolfixedvars, &
scip->stat->npresolaggrvars, &
scip->stat->npresolchgvartypes,
944 &
scip->stat->npresolchgbds, &
scip->stat->npresoladdholes, &
scip->stat->npresoldelconss,
945 &
scip->stat->npresoladdconss, &
scip->stat->npresolupgdconss, &
scip->stat->npresolchgcoefs,
950 lastranpresol =
TRUE;
963 "propagator <%s> detected infeasibility\n",
SCIPpropGetName(
scip->set->props_presol[j-1]));
971 "presolver <%s> detected unboundedness (or infeasibility)\n",
SCIPpresolGetName(
scip->set->presols[
i-1]));
974 "propagator <%s> detected unboundedness (or infeasibility)\n",
SCIPpropGetName(
scip->set->props_presol[j-1]));
990 *presolstart =
i + 1;
1005 if( !(*unbounded) && !(*infeasible) )
1007 int nlocalbdchgs = 0;
1013 if( nlocalbdchgs > 0 || *infeasible )
1015 "clique table cleanup detected %d bound changes%s\n", nlocalbdchgs, *infeasible ?
" and infeasibility" :
"");
1017 scip->stat->npresolfixedvars += nlocalbdchgs;
1022 if( !*infeasible &&
scip->set->nheurs > 0 &&
scip->set->nactivebenders == 0 )
1044 "feasible solution found by %s heuristic after %.1f seconds, objective value %.6e\n",
1050 if( !(*unbounded) && !(*infeasible) )
1059 SCIPdebugMsg(
scip,
"not enough reductions in %s presolving, running %s presolving now...\n",
1076 propstart, propend, consstart, consend) );
1080 else if( (oldpresolstart > 0 || oldpropstart > 0 || oldconsstart > 0) && presolend ==
scip->set->npresols
1081 && propend ==
scip->set->nprops && consend ==
scip->set->nconshdlrs )
1083 int newpresolstart = 0;
1084 int newpropstart = 0;
1085 int newconsstart = 0;
1087 SCIPdebugMsg(
scip,
"reached end of exhaustive presolving loop, starting from the beginning...\n");
1090 oldpresolstart, &newpropstart, oldpropstart, &newconsstart, oldconsstart) );
1092 *presolstart = newpresolstart;
1093 *propstart = newpropstart;
1094 *consstart = newconsstart;
1112 SCIP_Bool* unbounded,
1113 SCIP_Bool* infeasible,
1120 SCIP_Bool lastround;
1121 int presolstart = 0;
1125 size_t nusedbuffers;
1126 size_t nusedcleanbuffers;
1172 if(
scip->set->nheurs > 0 &&
scip->set->nactivebenders == 0 )
1193 "feasible solution found by %s heuristic after %.1f seconds, objective value %.6e\n",
1200 *infeasible =
FALSE;
1202 *vanished =
scip->transprob->nvars == 0 &&
scip->transprob->nconss == 0 &&
scip->set->nactivepricers == 0;
1204 finished = (
scip->set->presol_maxrounds != -1 &&
scip->stat->npresolrounds >=
scip->set->presol_maxrounds)
1205 || (*unbounded) || (*vanished) || (
scip->set->reopt_enable &&
scip->stat->nreoptruns >= 1);
1211 while( !finished && !stopped )
1214 scip->stat->lastnpresolfixedvars =
scip->stat->npresolfixedvars;
1215 scip->stat->lastnpresolaggrvars =
scip->stat->npresolaggrvars;
1216 scip->stat->lastnpresolchgvartypes =
scip->stat->npresolchgvartypes;
1217 scip->stat->lastnpresolchgbds =
scip->stat->npresolchgbds;
1218 scip->stat->lastnpresoladdholes =
scip->stat->npresoladdholes;
1219 scip->stat->lastnpresoldelconss =
scip->stat->npresoldelconss;
1220 scip->stat->lastnpresoladdconss =
scip->stat->npresoladdconss;
1221 scip->stat->lastnpresolupgdconss =
scip->stat->npresolupgdconss;
1222 scip->stat->lastnpresolchgcoefs =
scip->stat->npresolchgcoefs;
1223 scip->stat->lastnpresolchgsides =
scip->stat->npresolchgsides;
1224#ifdef SCIP_DISABLED_CODE
1225 scip->stat->lastnpresolimplications =
scip->stat->nimplications;
1239 lastround = (
scip->set->presol_maxrounds == -1 ?
FALSE : (
scip->stat->npresolrounds + 1 >=
scip->set->presol_maxrounds));
1247 &presolstart,
scip->set->npresols, &propstart,
scip->set->nprops, &consstart,
scip->set->nconshdlrs) );
1252 SCIPdebugMsg(
scip,
"presolving round %d returned with unbounded = %u, infeasible = %u, finished = %u\n",
scip->stat->npresolrounds, *unbounded, *infeasible, finished);
1255 *vanished =
scip->transprob->nvars == 0 &&
scip->transprob->nconss == 0 &&
scip->set->nactivepricers == 0;
1256 finished = finished || *unbounded || *infeasible || *vanished;
1259 scip->stat->npresolrounds++;
1265 "(round %d, %-11s %d del vars, %d del conss, %d add conss, %d chg bounds, %d chg sides, %d chg coeffs, %d upgd conss, %d impls, %d clqs\n",
1270 scip->stat->npresolfixedvars +
scip->stat->npresolaggrvars,
1271 scip->stat->npresoldelconss,
scip->stat->npresoladdconss,
1272 scip->stat->npresolchgbds,
scip->stat->npresolchgsides,
1273 scip->stat->npresolchgcoefs,
scip->stat->npresolupgdconss,
1285 if(
scip->primal->nlimsolsfound > 0 )
1292 else if( *unbounded )
1294 if(
scip->primal->nsols >= 1 )
1302 else if(
scip->transprob->nvars == 0 &&
scip->transprob->nconss == 0 )
1310 if(
scip->set->nactivepricers == 0 )
1314 if(
scip->primal->nlimsolsfound > 0 )
1322 if( finished && (!stopped || *unbounded || *infeasible || *vanished) )
1324 SCIP_Real maxnonzeros;
1325 SCIP_Longint nchecknonzeros;
1326 SCIP_Longint nactivenonzeros;
1327 SCIP_Bool approxchecknonzeros;
1328 SCIP_Bool approxactivenonzeros;
1333 for( j = 0; j <
scip->transprob->nfixedvars; ++j )
1342 *infeasible = *infeasible || infeas;
1347 if( !
scip->set->random_permutevars && !(*infeasible) && !(*unbounded) && !(*vanished) )
1360 maxnonzeros =
MAX(maxnonzeros, 1.0);
1362 scip->stat->nnz = nactivenonzeros;
1367 approxactivenonzeros ?
"more than " :
"", nactivenonzeros, nactivenonzeros/maxnonzeros * 100,
1368 approxchecknonzeros ?
"more than " :
"", nchecknonzeros, nchecknonzeros/maxnonzeros * 100);
1380 "presolving (%d rounds: %d fast, %d medium, %d exhaustive):\n",
scip->stat->npresolrounds,
1381 scip->stat->npresolroundsfast,
scip->stat->npresolroundsmed,
scip->stat->npresolroundsext);
1383 " %d deleted vars, %d deleted constraints, %d added constraints, %d tightened bounds, %d added holes, %d changed sides, %d changed coefficients\n",
1384 scip->stat->npresolfixedvars +
scip->stat->npresolaggrvars,
scip->stat->npresoldelconss,
scip->stat->npresoladdconss,
1385 scip->stat->npresolchgbds,
scip->stat->npresoladdholes,
scip->stat->npresolchgsides,
scip->stat->npresolchgcoefs);
1405 SCIP_Bool* solvalset;
1407 SCIP_Longint oldnsolsfound;
1414 oldnsolsfound =
scip->primal->nsolsfound;
1420 SCIPdebugMsg(
scip,
"try to transfer %d original solutions into the transformed problem space\n", nsols);
1422 ntransvars =
scip->transprob->nvars;
1435 for( s = nsols-1; s >= 0; --s )
1448 solvalset, ntransvars, &added) );
1454 if( naddedsols > 0 )
1457 "transformed %d/%d original solutions to the transformed problem space\n",
1460 scip->stat->nexternalsolsfound +=
scip->primal->nsolsfound - oldnsolsfound;
1504 if(
scip->transprob->nlpenabled && !
scip->set->nlp_disable )
1515 if(
scip->set->misc_estimexternmem &&
scip->stat->nruns <= 1 )
1517 scip->stat->externmemestim *= 2;
1539 scip->stat->lastlowerbound = internobjval;
1542 scip->origprob, internobjval);
1546 if(
scip->set->misc_transorigsols )
1564 if(
scip->set->nactivepricers == 0 )
1575 var =
scip->transprob->vars[v];
1583 objbound +=
obj * bd;
1704 assert( ! restart ||
scip->stat->inrestart );
1804 if(
scip->set->reopt_enable )
1813 if(
scip->set->misc_resetstat )
1836 SCIP_Bool reducedfree;
1859 if( !
scip->set->reopt_enable &&
scip->set->limit_maxorigsol > 0 &&
scip->set->misc_transsolsorig &&
scip->set->nactivebenders == 0 )
1862 SCIP_Bool hasinfval;
1869 nsols =
scip->primal->nsols;
1870 maxsols =
scip->set->limit_maxorigsol;
1875 while( s < nsols && scip->origprimal->nsols < maxsols )
1891 if( !
scip->set->misc_finitesolstore )
1907 if( newsol !=
NULL )
1922 if(
scip->origprimal->nsols > 1 )
1925 "stored the %d best primal solutions in the original solution candidate list\n",
scip->origprimal->nsols);
1927 else if(
scip->origprimal->nsols == 1 )
1930 "stored the best primal solution in the original solution candidate list\n");
1974 if(
scip->set->misc_resetstat && !reducedfree )
2027 if(
scip->set->misc_resetstat )
2055 SCIP_Bool objlimitreached =
FALSE;
2062 objlimitreached =
TRUE;
2068 if(
scip->set->reopt_enable )
2072 if(
scip->stat->nruns > 1 )
2074 scip->stat->nnodes,
scip->stat->ntotalnodes,
scip->stat->nruns);
2075 else if(
scip->set->reopt_enable )
2088 if( objlimitreached )
2092 if(
scip->primal->nsolsfound > 0 )
2101 if(
scip->primal->nsolsfound !=
scip->primal->nlimsolsfound )
2129 SCIP_Real checkfeastolfac;
2130 SCIP_Real oldfeastol;
2131 SCIP_Bool dispallviols;
2179 if( noldnodes <= 1 )
2183 if(
scip->transprob->nintvars > 0 ||
scip->transprob->nimplvars > 0 )
2187 "tree compression:\n");
2189 " given tree has %d nodes.\n", noldnodes);
2194 for(
c = 0;
c <
scip->set->ncomprs;
c++)
2205 " <%s> compressed the search tree to %d nodes (rate %g).\n",
SCIPcomprGetName(
scip->set->comprs[
c]),
2206 nnewnodes, ((SCIP_Real)nnewnodes)/noldnodes);
2216 " search tree could not be compressed.\n");
2228 SCIP_Bool reoptrestart;
2236 ++
scip->stat->nreoptruns;
2240 scip->origprob->nvars,
scip->set->limit_maxsol) );
2243 if(
scip->set->reopt_sepaglbinfsubtrees ||
scip->set->reopt_sepabestsol )
2251 if(
scip->stat->nreoptruns == 1 )
2278 scip->transprob->nvars, &reoptrestart) );
2285 scip->eventqueue,
scip->cliquetable,
scip->mem->probmem) );
2301 if(
scip->set->compr_enable )
2332 SCIP_Bool unbounded;
2333 SCIP_Bool infeasible;
2337 SCIP_CALL(
SCIPcheckStage(
scip,
"SCIPpresolve",
FALSE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
FALSE,
FALSE,
TRUE,
FALSE,
FALSE,
FALSE) );
2344 if(
scip->set->misc_catchctrlc )
2351 switch(
scip->set->stage )
2372 if( infeasible || unbounded || vanished )
2383 switch(
scip->stat->status )
2392 "presolving detected infeasibility\n");
2397 "presolving detected unboundedness\n");
2402 "presolving detected unboundedness (or infeasibility)\n");
2418 "presolved problem has %d variables (%d bin, %d int, %d impl, %d cont) and %d constraints\n",
2419 scip->transprob->nvars,
scip->transprob->nbinvars,
scip->transprob->nintvars,
scip->transprob->nimplvars,
2420 scip->transprob->ncontvars,
scip->transprob->nconss);
2422 for(
h = 0;
h <
scip->set->nconshdlrs; ++
h )
2427 if( nactiveconss > 0 )
2437 "transformed objective value is always integral (scale: %.15g)\n",
scip->transprob->objscale);
2461 if(
scip->set->misc_catchctrlc )
2502 SCIP_Longint cutpoolncutsfoundbeforerestart = 0;
2503 SCIP_Longint cutpoolncutsaddedbeforerestart = 0;
2504 SCIP_Longint cutpoolncallsbeforerestart = 0;
2505 SCIP_Longint cutpoolnrootcallsbeforerestart = 0;
2506 SCIP_Longint cutpoolmaxncutsbeforerestart = 0;
2507 SCIP_Real cutpooltimebeforerestart = 0;
2508 SCIP_Bool statsprinted =
FALSE;
2510 SCIP_Bool transferstatistics =
FALSE;
2512 SCIP_CALL(
SCIPcheckStage(
scip,
"SCIPsolve",
FALSE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
TRUE,
FALSE,
FALSE,
FALSE) );
2544 int decompindex = 0;
2555 if(
scip->set->misc_catchctrlc )
2563 restart =
scip->stat->userrestart;
2569 transferstatistics =
TRUE;
2579 if(
scip->stat->userrestart )
2582 scip->stat->nruns,
scip->stat->nnodes);
2585 "(run %d, node %" SCIP_LONGINT_FORMAT ") restarting after %d global fixings of integer variables\n",
2586 scip->stat->nruns,
scip->stat->nnodes,
scip->stat->nrootintfixingsrun);
2600 switch(
scip->set->stage )
2610 statsprinted =
TRUE;
2614 if (
scip->set->reopt_enable )
2629 if(
scip->set->reopt_enable )
2646 if( transferstatistics )
2660 scip->eventfilter,
scip->eventqueue,
scip->cliquetable, &restart) );
2716 children, nchildren, siblings, nsiblings) );
2721 if(
scip->set->misc_catchctrlc )
2724 if(
scip->set->reopt_enable )
2730 nsols =
scip->set->reopt_savesols == -1 ? INT_MAX :
MAX(
scip->set->reopt_savesols, 1);
2731 nsols =
MIN(
scip->primal->nsols, nsols);
2733 for( s = 0; s < nsols; s++ )
2743 SCIP_Bool hasinfval;
2752 if( s == 0 &&
scip->set->reopt_sepabestsol )
2755 scip->origprob->vars,
scip->origprob->nvars) );
2765 sol, s == 0, &added,
scip->origprob->vars,
scip->origprob->nvars,
scip->stat->nreoptruns) );
2773 if(
scip->set->reopt_storevarhistory )
2776 scip->origprob->vars,
scip->origprob->nvars) );
2785 if(
scip->set->reopt_enable &&
scip->set->reopt_commontimelimit )
2787 SCIP_Real timelimit;
2792 timelimit = timelimit - usedtime;
2793 timelimit =
MAX(0, timelimit);
2834 SCIP_CALL(
SCIPcheckStage(
scip,
"SCIPsolveParallel",
FALSE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
TRUE,
FALSE,
FALSE,
FALSE) );
2865 SCIPinfoMessage(
scip,
NULL,
"SCIP was compiled without task processing interface. Parallel solve not possible\n");
2874 SCIP_CALL(
SCIPcheckStage(
scip,
"SCIPsolveConcurrent",
FALSE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
TRUE,
FALSE,
FALSE,
FALSE) );
2878 minnthreads =
scip->set->parallel_minnthreads;
2879 maxnthreads =
scip->set->parallel_maxnthreads;
2881 if( minnthreads > maxnthreads )
2883 SCIPerrorMessage(
"minimum number of threads greater than maximum number of threads\n");
2888 int nconcsolvertypes;
2890 SCIP_Longint nthreads;
2891 SCIP_Real memorylimit;
2893 SCIP_Longint* weights;
2895 int ncandsolvertypes;
2896 SCIP_Real prefpriosum;
2901 if(
scip->set->concurrent_presolvebefore )
2928 memorylimit =
scip->set->limit_memory;
2934 if( !
scip->set->misc_avoidmemout )
2941 nthreads = minnthreads;
2948 if( minnthreads > nthreads )
2953 SCIPwarningMessage(
scip,
"requested minimum number of threads could not be satisfied with given memory limit\n");
2964 nthreads =
MIN(nthreads, maxnthreads);
2971 for(
i = 0;
i < nconcsolvertypes; ++
i )
2974 ncandsolvertypes = 0;
2978 for(
i = 0;
i < nconcsolvertypes; ++
i )
2985 j = ncandsolvertypes++;
2989 prios[j] =
MIN(1.0, prio);
3002 for(
i = 0;
i < nthreads; ++
i )
3051 if( (enable &&
scip->set->reopt_enable &&
scip->reopt !=
NULL)
3052 || (!enable && !
scip->set->reopt_enable &&
scip->reopt ==
NULL) )
3065 SCIPerrorMessage(
"Reoptimization cannot be %s after starting the (pre)solving process.\n", enable ?
"enabled" :
"disabled");
3073 if( enable &&
scip->reopt ==
NULL )
3076 scip->set->reopt_enable = enable;
3082 else if( (!enable &&
scip->reopt !=
NULL) || (!enable &&
scip->set->reopt_enable &&
scip->reopt ==
NULL) )
3085 scip->set->reopt_enable = enable;
3098 scip->set->reopt_enable = enable;
3121 SCIP_CALL(
SCIPcheckStage(
scip,
"SCIPaddReoptDualBndchg",
FALSE,
FALSE,
FALSE,
FALSE,
FALSE,
FALSE,
FALSE,
FALSE,
FALSE,
TRUE,
TRUE,
FALSE,
FALSE,
FALSE) );
3141 if(
scip->set->reopt_enable &&
scip->stat->nreoptruns > 1 )
3167 assert(0 < run && run <= scip->stat->nreoptruns);
3169 SCIP_CALL(
SCIPcheckStage(
scip,
"SCIPgetReoptOldObjCoef",
FALSE,
FALSE,
FALSE,
FALSE,
FALSE,
TRUE,
FALSE,
FALSE,
FALSE,
TRUE,
FALSE,
FALSE,
FALSE,
FALSE) );
3219 SCIP_CALL(
SCIPcheckStage(
scip,
"SCIPfreeSolve",
TRUE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
TRUE,
FALSE,
FALSE,
FALSE) );
3221 switch(
scip->set->stage )
3230 SCIP_Bool infeasible;
3285 SCIP_CALL(
SCIPcheckStage(
scip,
"SCIPfreeReoptSolve",
TRUE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
TRUE,
FALSE,
FALSE,
FALSE) );
3287 switch(
scip->set->stage )
3297 SCIP_Bool infeasible;
3350 SCIP_CALL(
SCIPcheckStage(
scip,
"SCIPfreeTransform",
TRUE,
TRUE,
TRUE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
FALSE,
TRUE,
TRUE,
FALSE,
FALSE,
FALSE) );
3358 switch(
scip->set->stage )
3366 SCIP_Bool infeasible;
3434 SCIP_CALL(
SCIPcheckStage(
scip,
"SCIPinterruptSolve",
FALSE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
FALSE,
TRUE,
TRUE,
TRUE,
TRUE,
FALSE) );
3466 SCIP_CALL_ABORT(
SCIPcheckStage(
scip,
"SCIPisSolveInterrupted",
FALSE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
FALSE,
TRUE,
TRUE,
TRUE,
TRUE,
FALSE) );
3468 return scip->stat->userinterrupt;
3489 SCIP_CALL(
SCIPcheckStage(
scip,
"SCIPrestartSolve",
FALSE,
FALSE,
FALSE,
FALSE,
TRUE,
TRUE,
TRUE,
FALSE,
FALSE,
TRUE,
FALSE,
FALSE,
FALSE,
FALSE) );
3504 return scip->set->reopt_enable;
3520 if(
scip->set->reopt_enable )
3522 assert(run > 0 && run <= scip->stat->nreoptruns);
3542 if(
scip->set->reopt_enable )
3568 SCIP_CALL(
SCIPcheckStage(
scip,
"SCIPcheckReoptRestart",
FALSE,
FALSE,
FALSE,
TRUE,
FALSE,
FALSE,
FALSE,
FALSE,
FALSE,
TRUE,
FALSE,
FALSE,
FALSE,
FALSE) );
3571 scip->transprob->nvars, restart) );
3595 SCIP_CALL_ABORT(
SCIPcheckStage(
scip,
"SCIPisInRestart",
FALSE,
FALSE,
FALSE,
FALSE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
TRUE,
FALSE) );
3598 return scip->stat->inrestart;
SCIP_RETCODE SCIPbranchcandCreate(SCIP_BRANCHCAND **branchcand)
void SCIPbranchcandInvalidate(SCIP_BRANCHCAND *branchcand)
SCIP_RETCODE SCIPbranchcandFree(SCIP_BRANCHCAND **branchcand)
internal methods for branching rules and branching candidate storage
void SCIPclockStop(SCIP_CLOCK *clck, SCIP_SET *set)
void SCIPclockStart(SCIP_CLOCK *clck, SCIP_SET *set)
SCIP_Real SCIPclockGetTime(SCIP_CLOCK *clck)
internal methods for clocks and timing issues
SCIP_RETCODE SCIPcomprExec(SCIP_COMPR *compr, SCIP_SET *set, SCIP_REOPT *reopt, SCIP_RESULT *result)
internal methods for tree compressions
SCIP_RETCODE SCIPconcsolverCreateInstance(SCIP_SET *set, SCIP_CONCSOLVERTYPE *concsolvertype, SCIP_CONCSOLVER **concsolver)
SCIP_RETCODE SCIPconcsolverInitSeeds(SCIP_CONCSOLVER *concsolver, unsigned int seed)
SCIP_Real SCIPconcsolverTypeGetPrefPrio(SCIP_CONCSOLVERTYPE *concsolvertype)
datastructures for concurrent solvers
SCIP_RETCODE SCIPconcurrentSolve(SCIP *scip)
SCIP_RETCODE SCIPfreeConcurrent(SCIP *scip)
int SCIPgetNConcurrentSolvers(SCIP *scip)
helper functions for concurrent scip solvers
internal methods for conflict analysis
SCIP_RETCODE SCIPconflictCreate(SCIP_CONFLICT **conflict, BMS_BLKMEM *blkmem, SCIP_SET *set)
SCIP_RETCODE SCIPconflictFree(SCIP_CONFLICT **conflict, BMS_BLKMEM *blkmem)
SCIP_RETCODE SCIPconflictstoreClear(SCIP_CONFLICTSTORE *conflictstore, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_REOPT *reopt)
SCIP_RETCODE SCIPconflictstoreClean(SCIP_CONFLICTSTORE *conflictstore, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_REOPT *reopt)
internal methods for storing conflicts
SCIP_RETCODE SCIPconsGetNVars(SCIP_CONS *cons, SCIP_SET *set, int *nvars, SCIP_Bool *success)
SCIP_RETCODE SCIPconshdlrPresolve(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PRESOLTIMING timing, int nrounds, int *nfixedvars, int *naggrvars, int *nchgvartypes, int *nchgbds, int *naddholes, int *ndelconss, int *naddconss, int *nupgdconss, int *nchgcoefs, int *nchgsides, SCIP_RESULT *result)
internal methods for constraints and constraint handlers
void SCIPcutpoolAddNCutsFound(SCIP_CUTPOOL *cutpool, SCIP_Longint ncutsfound)
void SCIPcutpoolSetTime(SCIP_CUTPOOL *cutpool, SCIP_Real time)
SCIP_RETCODE SCIPcutpoolCreate(SCIP_CUTPOOL **cutpool, BMS_BLKMEM *blkmem, SCIP_SET *set, int agelimit, SCIP_Bool globalcutpool)
SCIP_RETCODE SCIPcutpoolFree(SCIP_CUTPOOL **cutpool, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_LP *lp)
void SCIPcutpoolAddNCalls(SCIP_CUTPOOL *cutpool, SCIP_Longint ncalls)
void SCIPcutpoolAddMaxNCuts(SCIP_CUTPOOL *cutpool, SCIP_Longint ncuts)
void SCIPcutpoolAddNCutsAdded(SCIP_CUTPOOL *cutpool, SCIP_Longint ncutsadded)
void SCIPcutpoolAddNRootCalls(SCIP_CUTPOOL *cutpool, SCIP_Longint nrootcalls)
SCIP_RETCODE SCIPcutpoolClear(SCIP_CUTPOOL *cutpool, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_LP *lp)
internal methods for storing cuts in a cut pool
void SCIPexitSolveDecompstore(SCIP *scip)
int SCIPdecompstoreGetNOrigDecomps(SCIP_DECOMPSTORE *decompstore)
SCIP_RETCODE SCIPtransformDecompstore(SCIP *scip)
internal methods for decompositions and the decomposition store
SCIP_RETCODE SCIPcheckStage(SCIP *scip, const char *method, SCIP_Bool init, SCIP_Bool problem, SCIP_Bool transforming, SCIP_Bool transformed, SCIP_Bool initpresolve, SCIP_Bool presolving, SCIP_Bool exitpresolve, SCIP_Bool presolved, SCIP_Bool initsolve, SCIP_Bool solving, SCIP_Bool solved, SCIP_Bool exitsolve, SCIP_Bool freetrans, SCIP_Bool freescip)
#define SCIPdebugFreeSol(set)
#define SCIPdebugReset(set)
#define SCIP_CALL_ABORT(x)
#define SCIP_LONGINT_FORMAT
SCIP_RETCODE SCIPeventqueueFree(SCIP_EVENTQUEUE **eventqueue)
SCIP_RETCODE SCIPeventfilterFree(SCIP_EVENTFILTER **eventfilter, BMS_BLKMEM *blkmem, SCIP_SET *set)
SCIP_RETCODE SCIPeventfilterCreate(SCIP_EVENTFILTER **eventfilter, BMS_BLKMEM *blkmem)
SCIP_RETCODE SCIPeventProcess(SCIP_EVENT *event, SCIP_SET *set, SCIP_PRIMAL *primal, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTFILTER *eventfilter)
SCIP_RETCODE SCIPeventChgType(SCIP_EVENT *event, SCIP_EVENTTYPE eventtype)
SCIP_RETCODE SCIPeventqueueCreate(SCIP_EVENTQUEUE **eventqueue)
internal methods for managing events
SCIP_RETCODE SCIPprintStage(SCIP *scip, FILE *file)
SCIP_Bool SCIPisPresolveFinished(SCIP *scip)
SCIP_STATUS SCIPgetStatus(SCIP *scip)
SCIP_STAGE SCIPgetStage(SCIP *scip)
SCIP_RETCODE SCIPpermuteProb(SCIP *scip, unsigned int randseed, SCIP_Bool permuteconss, SCIP_Bool permutebinvars, SCIP_Bool permuteintvars, SCIP_Bool permuteimplvars, SCIP_Bool permutecontvars)
int SCIPgetNIntVars(SCIP *scip)
SCIP_RETCODE SCIPsetObjlimit(SCIP *scip, SCIP_Real objlimit)
int SCIPgetNVars(SCIP *scip)
int SCIPgetNConss(SCIP *scip)
int SCIPgetNFixedVars(SCIP *scip)
int SCIPgetNBinVars(SCIP *scip)
SCIP_VAR ** SCIPgetFixedVars(SCIP *scip)
void SCIPinfoMessage(SCIP *scip, FILE *file, const char *formatstr,...)
void SCIPverbMessage(SCIP *scip, SCIP_VERBLEVEL msgverblevel, FILE *file, const char *formatstr,...)
void SCIPwarningMessage(SCIP *scip, const char *formatstr,...)
SCIP_Real SCIPnextafter(SCIP_Real from, SCIP_Real to)
SCIP_RETCODE SCIPgetBoolParam(SCIP *scip, const char *name, SCIP_Bool *value)
SCIP_RETCODE SCIPsetIntParam(SCIP *scip, const char *name, int value)
SCIP_RETCODE SCIPgetRealParam(SCIP *scip, const char *name, SCIP_Real *value)
SCIP_RETCODE SCIPsetRealParam(SCIP *scip, const char *name, SCIP_Real value)
int SCIPgetNActiveBenders(SCIP *scip)
SCIP_RETCODE SCIPapplyBendersDecomposition(SCIP *scip, int decompindex)
SCIP_BRANCHRULE * SCIPfindBranchrule(SCIP *scip, const char *name)
SCIP_Longint SCIPbranchruleGetNChildren(SCIP_BRANCHRULE *branchrule)
const char * SCIPcomprGetName(SCIP_COMPR *compr)
SCIP_CONCSOLVERTYPE ** SCIPgetConcsolverTypes(SCIP *scip)
int SCIPgetNConcsolverTypes(SCIP *scip)
int SCIPconshdlrGetNCheckConss(SCIP_CONSHDLR *conshdlr)
SCIP_CONS ** SCIPconshdlrGetCheckConss(SCIP_CONSHDLR *conshdlr)
const char * SCIPconshdlrGetName(SCIP_CONSHDLR *conshdlr)
SCIP_CONSHDLR * SCIPfindConshdlr(SCIP *scip, const char *name)
int SCIPconshdlrGetNActiveConss(SCIP_CONSHDLR *conshdlr)
SCIP_CONS ** SCIPconshdlrGetConss(SCIP_CONSHDLR *conshdlr)
SCIP_Bool SCIPconsIsChecked(SCIP_CONS *cons)
SCIP_Bool SCIPconsIsActive(SCIP_CONS *cons)
SCIP_Longint SCIPcutpoolGetNRootCalls(SCIP_CUTPOOL *cutpool)
SCIP_Longint SCIPcutpoolGetNCutsFound(SCIP_CUTPOOL *cutpool)
SCIP_Real SCIPcutpoolGetTime(SCIP_CUTPOOL *cutpool)
SCIP_Longint SCIPcutpoolGetMaxNCuts(SCIP_CUTPOOL *cutpool)
SCIP_Longint SCIPcutpoolGetNCalls(SCIP_CUTPOOL *cutpool)
SCIP_Longint SCIPcutpoolGetNCutsAdded(SCIP_CUTPOOL *cutpool)
const char * SCIPheurGetName(SCIP_HEUR *heur)
SCIP_RETCODE SCIPinterruptLP(SCIP *scip, SCIP_Bool interrupt)
SCIP_Longint SCIPgetMemExternEstim(SCIP *scip)
BMS_BUFMEM * SCIPcleanbuffer(SCIP *scip)
SCIP_Longint SCIPgetMemUsed(SCIP *scip)
BMS_BUFMEM * SCIPbuffer(SCIP *scip)
#define SCIPallocBufferArray(scip, ptr, num)
#define SCIPfreeBufferArray(scip, ptr)
#define SCIPduplicateBufferArray(scip, ptr, source, num)
SCIP_SYNCSTORE * SCIPgetSyncstore(SCIP *scip)
int SCIPpresolGetPriority(SCIP_PRESOL *presol)
const char * SCIPpresolGetName(SCIP_PRESOL *presol)
int SCIPpropGetPresolPriority(SCIP_PROP *prop)
const char * SCIPpropGetName(SCIP_PROP *prop)
SCIP_SOL * SCIPgetReoptLastOptSol(SCIP *scip)
void SCIPresetReoptSolMarks(SCIP *scip)
SCIP_RETCODE SCIPgetReoptOldObjCoef(SCIP *scip, SCIP_VAR *var, int run, SCIP_Real *objcoef)
SCIP_RETCODE SCIPcheckReoptRestart(SCIP *scip, SCIP_NODE *node, SCIP_Bool *restart)
SCIP_RETCODE SCIPaddReoptDualBndchg(SCIP *scip, SCIP_NODE *node, SCIP_VAR *var, SCIP_Real newbound, SCIP_Real oldbound)
SCIP_Bool SCIPisReoptEnabled(SCIP *scip)
SCIP_RETCODE SCIPenableReoptimization(SCIP *scip, SCIP_Bool enable)
SCIP_RETCODE SCIPgetReoptSolsRun(SCIP *scip, int run, SCIP_SOL **sols, int solssize, int *nsols)
SCIP_RETCODE SCIPfreeReoptSolve(SCIP *scip)
SCIP_RETCODE SCIPcheckSolOrig(SCIP *scip, SCIP_SOL *sol, SCIP_Bool *feasible, SCIP_Bool printreason, SCIP_Bool completely)
SCIP_SOL * SCIPgetBestSol(SCIP *scip)
SCIP_Longint SCIPsolGetNodenum(SCIP_SOL *sol)
int SCIPgetNSols(SCIP *scip)
SCIP_HEUR * SCIPsolGetHeur(SCIP_SOL *sol)
SCIP_RETCODE SCIPcreateFiniteSolCopy(SCIP *scip, SCIP_SOL **sol, SCIP_SOL *sourcesol, SCIP_Bool *success)
SCIP_Bool SCIPsolIsOriginal(SCIP_SOL *sol)
SCIP_SOL ** SCIPgetSols(SCIP *scip)
SCIP_RETCODE SCIPtrySolFree(SCIP *scip, SCIP_SOL **sol, SCIP_Bool printreason, SCIP_Bool completely, SCIP_Bool checkbounds, SCIP_Bool checkintegrality, SCIP_Bool checklprows, SCIP_Bool *stored)
SCIP_Real SCIPgetSolOrigObj(SCIP *scip, SCIP_SOL *sol)
SCIP_RETCODE SCIPtransformProb(SCIP *scip)
SCIP_RETCODE SCIPrestartSolve(SCIP *scip)
SCIP_RETCODE SCIPsolveParallel(SCIP *scip)
SCIP_RETCODE SCIPpresolve(SCIP *scip)
SCIP_RETCODE SCIPsolveConcurrent(SCIP *scip)
SCIP_Bool SCIPisSolveInterrupted(SCIP *scip)
SCIP_RETCODE SCIPfreeTransform(SCIP *scip)
SCIP_RETCODE SCIPinterruptSolve(SCIP *scip)
SCIP_RETCODE SCIPfreeSolve(SCIP *scip, SCIP_Bool restart)
SCIP_Bool SCIPisInRestart(SCIP *scip)
SCIP_RETCODE SCIPsolve(SCIP *scip)
SCIP_Real SCIPgetPrimalbound(SCIP *scip)
SCIP_Real SCIPgetUpperbound(SCIP *scip)
SCIP_Real SCIPgetGap(SCIP *scip)
SCIP_Real SCIPgetDualbound(SCIP *scip)
SCIP_Real SCIPgetLowerbound(SCIP *scip)
void SCIPstoreSolutionGap(SCIP *scip)
SCIP_Real SCIPgetSolvingTime(SCIP *scip)
SCIP_Bool SCIPisInfinity(SCIP *scip, SCIP_Real val)
SCIP_RETCODE SCIPchgFeastol(SCIP *scip, SCIP_Real feastol)
SCIP_Real SCIPfeastol(SCIP *scip)
SCIP_Bool SCIPisEQ(SCIP *scip, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPgetChildren(SCIP *scip, SCIP_NODE ***children, int *nchildren)
int SCIPgetNNodesLeft(SCIP *scip)
SCIP_RETCODE SCIPgetLeaves(SCIP *scip, SCIP_NODE ***leaves, int *nleaves)
SCIP_RETCODE SCIPgetSiblings(SCIP *scip, SCIP_NODE ***siblings, int *nsiblings)
SCIP_RETCODE SCIPvarGetOrigvarSum(SCIP_VAR **var, SCIP_Real *scalar, SCIP_Real *constant)
SCIP_Bool SCIPvarIsActive(SCIP_VAR *var)
SCIP_VARSTATUS SCIPvarGetStatus(SCIP_VAR *var)
SCIP_Real SCIPvarGetObj(SCIP_VAR *var)
int SCIPvarGetIndex(SCIP_VAR *var)
SCIP_Real SCIPvarGetWorstBoundGlobal(SCIP_VAR *var)
SCIP_RETCODE SCIPflattenVarAggregationGraph(SCIP *scip, SCIP_VAR *var)
SCIP_VAR ** SCIPvarGetMultaggrVars(SCIP_VAR *var)
int SCIPvarGetMultaggrNVars(SCIP_VAR *var)
SCIP_Bool SCIPvarIsOriginal(SCIP_VAR *var)
SCIP_RETCODE SCIPclearRelaxSolVals(SCIP *scip, SCIP_RELAX *relax)
int SCIPrandomGetInt(SCIP_RANDNUMGEN *randnumgen, int minrandval, int maxrandval)
void SCIPselectDownRealInt(SCIP_Real *realarray, int *intarray, int k, int len)
int SCIPsnprintf(char *t, int len, const char *s,...)
SCIPcreateSol(scip, &heurdata->sol, heur))
SCIPfreeRandom(scip, &heurdata->randnumgen)
SCIPcreateRandom(scip, &heurdata->randnumgen, DEFAULT_RANDSEED, TRUE))
assert(minobj< SCIPgetCutoffbound(scip))
SCIP_RETCODE SCIPcliquetableFree(SCIP_CLIQUETABLE **cliquetable, BMS_BLKMEM *blkmem)
SCIP_RETCODE SCIPcliquetableCreate(SCIP_CLIQUETABLE **cliquetable, SCIP_SET *set, BMS_BLKMEM *blkmem)
int SCIPcliquetableGetNCliques(SCIP_CLIQUETABLE *cliquetable)
SCIP_RETCODE SCIPcliquetableCleanup(SCIP_CLIQUETABLE *cliquetable, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, int *nchgbds, SCIP_Bool *infeasible)
methods for implications, variable bounds, and cliques
void SCIPinterruptRelease(SCIP_INTERRUPT *interrupt)
void SCIPinterruptCapture(SCIP_INTERRUPT *interrupt)
methods for catching the user CTRL-C interrupt
void SCIPlpRecomputeLocalAndGlobalPseudoObjval(SCIP_LP *lp, SCIP_SET *set, SCIP_PROB *prob)
SCIP_RETCODE SCIPlpFree(SCIP_LP **lp, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter)
SCIP_RETCODE SCIPlpCreate(SCIP_LP **lp, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_STAT *stat, const char *name)
SCIP_RETCODE SCIPlpReset(SCIP_LP *lp, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_PROB *prob, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter)
void SCIPlpInvalidateRootObjval(SCIP_LP *lp)
internal methods for LP management
size_t BMSgetNUsedBufferMemory(BMS_BUFMEM *buffer)
memory allocation routines
#define BMSgarbagecollectBlockMemory(mem)
void SCIPmessagePrintInfo(SCIP_MESSAGEHDLR *messagehdlr, const char *formatstr,...)
void SCIPmessagePrintVerbInfo(SCIP_MESSAGEHDLR *messagehdlr, SCIP_VERBLEVEL verblevel, SCIP_VERBLEVEL msgverblevel, const char *formatstr,...)
SCIP_RETCODE SCIPnlpFree(SCIP_NLP **nlp, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp)
SCIP_RETCODE SCIPnlpAddVars(SCIP_NLP *nlp, BMS_BLKMEM *blkmem, SCIP_SET *set, int nvars, SCIP_VAR **vars)
SCIP_RETCODE SCIPnlpCreate(SCIP_NLP **nlp, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, const char *name, int nvars_estimate)
internal methods for NLP management
SCIP_RETCODE SCIPpresolExec(SCIP_PRESOL *presol, SCIP_SET *set, SCIP_PRESOLTIMING timing, int nrounds, int *nfixedvars, int *naggrvars, int *nchgvartypes, int *nchgbds, int *naddholes, int *ndelconss, int *naddconss, int *nupgdconss, int *nchgcoefs, int *nchgsides, SCIP_RESULT *result)
internal methods for presolvers
SCIP_RETCODE SCIPpricestoreCreate(SCIP_PRICESTORE **pricestore)
SCIP_RETCODE SCIPpricestoreFree(SCIP_PRICESTORE **pricestore)
internal methods for storing priced variables
SCIP_RETCODE SCIPprimalClear(SCIP_PRIMAL **primal, BMS_BLKMEM *blkmem)
SCIP_RETCODE SCIPprimalFree(SCIP_PRIMAL **primal, BMS_BLKMEM *blkmem)
SCIP_RETCODE SCIPprimalAddOrigSol(SCIP_PRIMAL *primal, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *prob, SCIP_SOL *sol, SCIP_Bool *stored)
SCIP_RETCODE SCIPprimalCreate(SCIP_PRIMAL **primal)
SCIP_RETCODE SCIPprimalTransformSol(SCIP_PRIMAL *primal, SCIP_SOL *sol, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_STAT *stat, SCIP_PROB *origprob, SCIP_PROB *transprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter, SCIP_Real *solvals, SCIP_Bool *solvalset, int solvalssize, SCIP_Bool *added)
SCIP_RETCODE SCIPprimalUpdateObjlimit(SCIP_PRIMAL *primal, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp)
SCIP_RETCODE SCIPprimalAddSol(SCIP_PRIMAL *primal, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_STAT *stat, SCIP_PROB *origprob, SCIP_PROB *transprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_EVENTQUEUE *eventqueue, SCIP_EVENTFILTER *eventfilter, SCIP_SOL *sol, SCIP_Bool *stored)
SCIP_RETCODE SCIPprimalSetCutoffbound(SCIP_PRIMAL *primal, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_Real cutoffbound, SCIP_Bool useforobjlimit)
SCIP_RETCODE SCIPprimalRetransformSolutions(SCIP_PRIMAL *primal, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_PROB *origprob, SCIP_PROB *transprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp)
internal methods for collecting primal CIP solutions and primal informations
SCIP_RETCODE SCIPprobScaleObj(SCIP_PROB *transprob, SCIP_PROB *origprob, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PRIMAL *primal, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue)
SCIP_RETCODE SCIPprobExitPresolve(SCIP_PROB *prob, SCIP_SET *set)
void SCIPprobInvalidateDualbound(SCIP_PROB *prob)
const char * SCIPprobGetName(SCIP_PROB *prob)
SCIP_RETCODE SCIPprobPerformVarDeletions(SCIP_PROB *prob, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand)
void SCIPprobUpdateDualbound(SCIP_PROB *prob, SCIP_Real newbound)
SCIP_RETCODE SCIPprobInitSolve(SCIP_PROB *prob, SCIP_SET *set)
void SCIPprobMarkNConss(SCIP_PROB *prob)
SCIP_RETCODE SCIPprobTransform(SCIP_PROB *source, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PRIMAL *primal, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_CONFLICTSTORE *conflictstore, SCIP_PROB **target)
SCIP_RETCODE SCIPprobCheckObjIntegral(SCIP_PROB *transprob, SCIP_PROB *origprob, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PRIMAL *primal, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue)
SCIP_RETCODE SCIPprobExitSolve(SCIP_PROB *prob, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp, SCIP_Bool restart)
SCIP_Bool SCIPprobIsObjIntegral(SCIP_PROB *prob)
void SCIPprobResortVars(SCIP_PROB *prob)
SCIP_RETCODE SCIPprobFree(SCIP_PROB **prob, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp)
SCIP_RETCODE SCIPprobResetBounds(SCIP_PROB *prob, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat)
SCIP_Real SCIPprobInternObjval(SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_SET *set, SCIP_Real objval)
internal methods for storing and manipulating the main problem
SCIP_RETCODE SCIPpropPresol(SCIP_PROP *prop, SCIP_SET *set, SCIP_PRESOLTIMING timing, int nrounds, int *nfixedvars, int *naggrvars, int *nchgvartypes, int *nchgbds, int *naddholes, int *ndelconss, int *naddconss, int *nupgdconss, int *nchgcoefs, int *nchgsides, SCIP_RESULT *result)
internal methods for propagators
public methods for branching rules
public methods for tree compressions
public methods for managing constraints
public methods for primal heuristics
public methods for message output
public data structures and miscellaneous methods
methods for selecting (weighted) k-medians
public methods for presolvers
public methods for propagators
public methods for primal CIP solutions
public methods for problem variables
SCIP_RETCODE SCIPrelaxationFree(SCIP_RELAXATION **relaxation)
SCIP_RETCODE SCIPrelaxationCreate(SCIP_RELAXATION **relaxation, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PRIMAL *primal, SCIP_TREE *tree)
internal methods for relaxators
SCIP_RETCODE SCIPreoptUpdateVarHistory(SCIP_REOPT *reopt, SCIP_SET *set, SCIP_STAT *stat, BMS_BLKMEM *blkmem, SCIP_VAR **vars, int nvars)
SCIP_RETCODE SCIPreoptSaveActiveConss(SCIP_REOPT *reopt, SCIP_SET *set, SCIP_PROB *transprob, BMS_BLKMEM *blkmem)
SCIP_RETCODE SCIPreoptAddRun(SCIP_REOPT *reopt, SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_VAR **origvars, int norigvars, int size)
SCIP_RETCODE SCIPreoptAddSol(SCIP_REOPT *reopt, SCIP_SET *set, SCIP_STAT *stat, SCIP_PRIMAL *origprimal, BMS_BLKMEM *blkmem, SCIP_SOL *sol, SCIP_Bool bestsol, SCIP_Bool *added, SCIP_VAR **vars, int nvars, int run)
SCIP_SOL * SCIPreoptGetLastBestSol(SCIP_REOPT *reopt)
SCIP_RETCODE SCIPreoptGetSolsRun(SCIP_REOPT *reopt, int run, SCIP_SOL **sols, int solssize, int *nsols)
SCIP_RETCODE SCIPreoptReleaseData(SCIP_REOPT *reopt, SCIP_SET *set, BMS_BLKMEM *blkmem)
void SCIPreoptResetSolMarks(SCIP_REOPT *reopt)
SCIP_Real SCIPreoptGetOldObjCoef(SCIP_REOPT *reopt, int run, int idx)
SCIP_RETCODE SCIPreoptFree(SCIP_REOPT **reopt, SCIP_SET *set, SCIP_PRIMAL *origprimal, BMS_BLKMEM *blkmem)
SCIP_RETCODE SCIPreoptAddOptSol(SCIP_REOPT *reopt, SCIP_SOL *sol, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PRIMAL *origprimal, SCIP_VAR **vars, int nvars)
int SCIPreoptGetNNodes(SCIP_REOPT *reopt, SCIP_NODE *node)
SCIP_RETCODE SCIPreoptResetActiveConss(SCIP_REOPT *reopt, SCIP_SET *set, SCIP_STAT *stat)
SCIP_RETCODE SCIPreoptCreate(SCIP_REOPT **reopt, SCIP_SET *set, BMS_BLKMEM *blkmem)
SCIP_RETCODE SCIPreoptAddDualBndchg(SCIP_REOPT *reopt, SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_NODE *node, SCIP_VAR *var, SCIP_Real newval, SCIP_Real oldval)
SCIP_RETCODE SCIPreoptMergeVarHistory(SCIP_REOPT *reopt, SCIP_SET *set, SCIP_STAT *stat, SCIP_VAR **vars, int nvars)
SCIP_RETCODE SCIPreoptSaveGlobalBounds(SCIP_REOPT *reopt, SCIP_PROB *transprob, BMS_BLKMEM *blkmem)
SCIP_RETCODE SCIPreoptCheckRestart(SCIP_REOPT *reopt, SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_NODE *node, SCIP_VAR **transvars, int ntransvars, SCIP_Bool *restart)
SCIP_RETCODE SCIPreoptInstallBounds(SCIP_REOPT *reopt, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, BMS_BLKMEM *blkmem)
SCIP_RETCODE SCIPreoptApplyGlbConss(SCIP *scip, SCIP_REOPT *reopt, SCIP_SET *set, SCIP_STAT *stat, BMS_BLKMEM *blkmem)
SCIP_RETCODE SCIPreoptReset(SCIP_REOPT *reopt, SCIP_SET *set, BMS_BLKMEM *blkmem)
SCIP_RETCODE SCIPreoptSaveOpenNodes(SCIP_REOPT *reopt, SCIP_SET *set, SCIP_LP *lp, BMS_BLKMEM *blkmem, SCIP_NODE **leaves, int nleaves, SCIP_NODE **childs, int nchilds, SCIP_NODE **siblings, int nsiblings)
data structures and methods for collecting reoptimization information
public methods for Benders decomposition
public methods for branching rule plugins and branching
public methods for concurrent solving mode
public methods for constraint handler plugins and constraints
public methods for the LP relaxation, rows and columns
public methods for memory management
public methods for message handling
public methods for numerical tolerances
public methods for SCIP parameter handling
public methods for global and local (sub)problems
public methods for random numbers
public methods for solutions
static SCIP_RETCODE prepareReoptimization(SCIP *scip)
static SCIP_RETCODE freeTransforming(SCIP *scip)
static SCIP_RETCODE freeReoptSolve(SCIP *scip)
static SCIP_RETCODE displayRelevantStats(SCIP *scip)
static SCIP_RETCODE initSolve(SCIP *scip, SCIP_Bool solved)
static SCIP_RETCODE exitPresolve(SCIP *scip, SCIP_Bool solved, SCIP_Bool *infeasible)
static SCIP_RETCODE freeTransform(SCIP *scip)
static SCIP_RETCODE calcNonZeros(SCIP *scip, SCIP_Longint *nchecknonzeros, SCIP_Longint *nactivenonzeros, SCIP_Bool *approxchecknonzeros, SCIP_Bool *approxactivenonzeros)
static SCIP_RETCODE initPresolve(SCIP *scip)
static SCIP_RETCODE freeSolve(SCIP *scip, SCIP_Bool restart)
static SCIP_RETCODE compressReoptTree(SCIP *scip)
static SCIP_RETCODE presolve(SCIP *scip, SCIP_Bool *unbounded, SCIP_Bool *infeasible, SCIP_Bool *vanished)
static SCIP_RETCODE transformSols(SCIP *scip)
static SCIP_RETCODE presolveRound(SCIP *scip, SCIP_PRESOLTIMING *timing, SCIP_Bool *unbounded, SCIP_Bool *infeasible, SCIP_Bool lastround, int *presolstart, int presolend, int *propstart, int propend, int *consstart, int consend)
public methods for querying solving statistics
public methods for timing
public methods for the branch-and-bound tree
public methods for SCIP variables
SCIP_RETCODE SCIPsepastoreCreate(SCIP_SEPASTORE **sepastore, BMS_BLKMEM *blkmem, SCIP_SET *set)
SCIP_RETCODE SCIPsepastoreFree(SCIP_SEPASTORE **sepastore, BMS_BLKMEM *blkmem)
internal methods for storing separated cuts
void SCIPsetSortPresols(SCIP_SET *set)
SCIP_RETCODE SCIPsetInitsolPlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)
SCIP_RETCODE SCIPsetInitPlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)
SCIP_RETCODE SCIPsetSetReoptimizationParams(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr)
SCIP_Bool SCIPsetIsFeasGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
void SCIPsetSortPropsPresol(SCIP_SET *set)
void SCIPsetSortComprs(SCIP_SET *set)
SCIP_RETCODE SCIPsetExitprePlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)
SCIP_Bool SCIPsetIsFeasLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_Real SCIPsetInfinity(SCIP_SET *set)
SCIP_Bool SCIPsetIsLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_Bool SCIPsetIsInfinity(SCIP_SET *set, SCIP_Real val)
SCIP_RETCODE SCIPsetExitsolPlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat, SCIP_Bool restart)
SCIP_Bool SCIPsetIsZero(SCIP_SET *set, SCIP_Real val)
SCIP_Real SCIPsetCutoffbounddelta(SCIP_SET *set)
SCIP_RETCODE SCIPsetExitPlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)
SCIP_RETCODE SCIPsetInitprePlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)
SCIP_NODESEL * SCIPsetGetNodesel(SCIP_SET *set, SCIP_STAT *stat)
internal methods for global SCIP settings
SCIP_RETCODE SCIPsolFree(SCIP_SOL **sol, BMS_BLKMEM *blkmem, SCIP_PRIMAL *primal)
void SCIPsolRecomputeObj(SCIP_SOL *sol, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *origprob)
SCIP_RETCODE SCIPsolRetransform(SCIP_SOL *sol, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *origprob, SCIP_PROB *transprob, SCIP_Bool *hasinfval)
SCIP_Real SCIPsolGetObj(SCIP_SOL *sol, SCIP_SET *set, SCIP_PROB *transprob, SCIP_PROB *origprob)
SCIP_RETCODE SCIPsolPrint(SCIP_SOL *sol, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_STAT *stat, SCIP_PROB *prob, SCIP_PROB *transprob, FILE *file, SCIP_Bool mipstart, SCIP_Bool printzeros)
SCIP_RETCODE SCIPsolCheckOrig(SCIP_SOL *sol, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, SCIP_STAT *stat, SCIP_PROB *prob, SCIP_PRIMAL *primal, SCIP_Bool printreason, SCIP_Bool completely, SCIP_Bool checkbounds, SCIP_Bool checkintegrality, SCIP_Bool checklprows, SCIP_Bool checkmodifiable, SCIP_Bool *feasible)
internal methods for storing primal CIP solutions
SCIP_RETCODE SCIPsolveCIP(BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_STAT *stat, SCIP_MEM *mem, SCIP_PROB *origprob, SCIP_PROB *transprob, SCIP_PRIMAL *primal, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_RELAXATION *relaxation, SCIP_PRICESTORE *pricestore, SCIP_SEPASTORE *sepastore, SCIP_CUTPOOL *cutpool, SCIP_CUTPOOL *delayedcutpool, SCIP_BRANCHCAND *branchcand, SCIP_CONFLICT *conflict, SCIP_CONFLICTSTORE *conflictstore, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_Bool *restart)
SCIP_Bool SCIPsolveIsStopped(SCIP_SET *set, SCIP_STAT *stat, SCIP_Bool checknodelimits)
SCIP_RETCODE SCIPprimalHeuristics(SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *prob, SCIP_PRIMAL *primal, SCIP_TREE *tree, SCIP_LP *lp, SCIP_NODE *nextnode, SCIP_HEURTIMING heurtiming, SCIP_Bool nodeinfeasible, SCIP_Bool *foundsol, SCIP_Bool *unbounded)
internal methods for main solving loop and node processing
void SCIPstatUpdatePrimalDualIntegrals(SCIP_STAT *stat, SCIP_SET *set, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_Real upperbound, SCIP_Real lowerbound)
void SCIPstatMark(SCIP_STAT *stat)
void SCIPstatResetDisplay(SCIP_STAT *stat)
void SCIPstatResetPrimalDualIntegrals(SCIP_STAT *stat, SCIP_SET *set, SCIP_Bool partialreset)
void SCIPstatResetPresolving(SCIP_STAT *stat, SCIP_SET *set, SCIP_PROB *transprob, SCIP_PROB *origprob)
void SCIPstatReset(SCIP_STAT *stat, SCIP_SET *set, SCIP_PROB *transprob, SCIP_PROB *origprob)
void SCIPstatEnforceLPUpdates(SCIP_STAT *stat)
void SCIPstatResetCurrentRun(SCIP_STAT *stat, SCIP_SET *set, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_Bool solved)
internal methods for problem statistics
datastructures for managing events
datastructures for block memory pools and memory buffers
datastructures for collecting primal CIP solutions and primal informations
datastructures for storing and manipulating the main problem
SCIP main data structure.
datastructures for global SCIP settings
datastructures for problem statistics
data structures for branch and bound tree
void SCIPsyncstoreSetSolveIsStopped(SCIP_SYNCSTORE *syncstore, SCIP_Bool stopped)
SCIP_RETCODE SCIPsyncstoreInit(SCIP *scip)
the function declarations for the synchronization store
void SCIPnodeUpdateLowerbound(SCIP_NODE *node, SCIP_STAT *stat, SCIP_SET *set, SCIP_TREE *tree, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_Real newbound)
SCIP_NODE * SCIPtreeGetFocusNode(SCIP_TREE *tree)
SCIP_RETCODE SCIPtreeFree(SCIP_TREE **tree, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp)
SCIP_NODE * SCIPtreeGetCurrentNode(SCIP_TREE *tree)
SCIP_NODE * SCIPtreeGetRootNode(SCIP_TREE *tree)
SCIP_RETCODE SCIPtreeCreatePresolvingRoot(SCIP_TREE *tree, SCIP_REOPT *reopt, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_PRIMAL *primal, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_CONFLICT *conflict, SCIP_CONFLICTSTORE *conflictstore, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable)
int SCIPtreeGetNNodes(SCIP_TREE *tree)
SCIP_RETCODE SCIPtreeClear(SCIP_TREE *tree, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp)
SCIP_RETCODE SCIPnodeFocus(SCIP_NODE **node, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_PRIMAL *primal, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_CONFLICT *conflict, SCIP_CONFLICTSTORE *conflictstore, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_Bool *cutoff, SCIP_Bool postponed, SCIP_Bool exitsolve)
SCIP_RETCODE SCIPtreeCreate(SCIP_TREE **tree, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_NODESEL *nodesel)
SCIP_RETCODE SCIPtreeCreateRoot(SCIP_TREE *tree, SCIP_REOPT *reopt, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp)
SCIP_RETCODE SCIPtreeFreePresolvingRoot(SCIP_TREE *tree, SCIP_REOPT *reopt, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_PRIMAL *primal, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_CONFLICT *conflict, SCIP_CONFLICTSTORE *conflictstore, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable)
internal methods for branch and bound tree
#define SCIP_EVENTTYPE_PRESOLVEROUND
enum SCIP_Result SCIP_RESULT
enum SCIP_Retcode SCIP_RETCODE
@ SCIP_STAGE_INITPRESOLVE
@ SCIP_STAGE_EXITPRESOLVE
@ SCIP_STAGE_TRANSFORMING
#define SCIP_HEURTIMING_BEFOREPRESOL
#define SCIP_PRESOLTIMING_FINAL
#define SCIP_PRESOLTIMING_MEDIUM
unsigned int SCIP_PRESOLTIMING
#define SCIP_HEURTIMING_DURINGPRESOLLOOP
#define SCIP_PRESOLTIMING_FAST
#define SCIP_PRESOLTIMING_EXHAUSTIVE
@ SCIP_VARSTATUS_MULTAGGR
SCIP_RETCODE SCIPvarFlattenAggregationGraph(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue)
internal methods for problem variables
SCIP_RETCODE SCIPvisualInit(SCIP_VISUAL *visual, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr)
void SCIPvisualExit(SCIP_VISUAL *visual, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr)
methods for creating output for visualization tools (VBC, BAK)