| /dports/math/SCIP/scip-7.0.3/src/scip/ |
| H A D | nodesel_estimate.c | 137 SCIPdebugMsg(scip, "perform breadth-first search at depth <%d>\n", SCIPgetDepth(scip)); in SCIP_DECL_NODESELSELECT()
143 … SCIPdebugMsg(scip, " -> selected prio sibling: estimate=%g\n", SCIPnodeGetEstimate(*selnode)); in SCIP_DECL_NODESELSELECT()
151 … SCIPdebugMsg(scip, " -> selected prio child: estimate=%g\n", SCIPnodeGetEstimate(*selnode)); in SCIP_DECL_NODESELSELECT()
169 SCIPdebugMsg(scip, " -> best node : lower=%g\n", in SCIP_DECL_NODESELSELECT()
200 SCIPdebugMsg(scip, " -> best node : lower=%g\n", in SCIP_DECL_NODESELSELECT()
229 SCIPdebugMsg(scip, "plungedepth: [%d,%d], cur: %d, bounds: [%g,%g], maxbound: %g\n", in SCIP_DECL_NODESELSELECT()
240 … SCIPdebugMsg(scip, " -> selected prio child: estimate=%g\n", SCIPnodeGetEstimate(*selnode)); in SCIP_DECL_NODESELSELECT()
248 … SCIPdebugMsg(scip, " -> selected best child: estimate=%g\n", SCIPnodeGetEstimate(*selnode)); in SCIP_DECL_NODESELSELECT()
256 … SCIPdebugMsg(scip, " -> selected prio sibling: estimate=%g\n", SCIPnodeGetEstimate(*selnode)); in SCIP_DECL_NODESELSELECT()
264 … SCIPdebugMsg(scip, " -> selected best sibling: estimate=%g\n", SCIPnodeGetEstimate(*selnode)); in SCIP_DECL_NODESELSELECT()
[all …]
|
| H A D | heur_clique.c | 402 SCIPdebugMsg(scip, "propagate fixings of clique %d: cutoff=%u\n", c, *cutoff); in applyCliqueFixings()
494 SCIPdebugMsg(scip, "fixed %d of %d variables in probing\n", v, SCIPgetNBinVars(scip)); in applyCliqueFixings()
495 SCIPdebugMsg(scip, "applied %d of %d cliques in probing\n", c, ncliques); in applyCliqueFixings()
496 SCIPdebugMsg(scip, "probing was %sfeasible\n", (*cutoff) ? "in" : ""); in applyCliqueFixings()
693 SCIPdebugMsg(scip, "cutoff or timeout in locks fixing\n"); in SCIP_DECL_HEUREXEC()
704 SCIPdebugMsg(scip, "--> too few fixings\n"); in SCIP_DECL_HEUREXEC()
711 SCIPdebugMsg(scip, "--> too few fixings\n"); in SCIP_DECL_HEUREXEC()
754 SCIPdebugMsg(scip, " -> error=%u, status=%d\n", lperror, lpstatus); in SCIP_DECL_HEUREXEC()
776 SCIPdebugMsg(scip, "clique heuristic found roundable primal solution: obj=%g\n", in SCIP_DECL_HEUREXEC()
791 SCIPdebugMsg(scip, "found feasible solution:\n"); in SCIP_DECL_HEUREXEC()
[all …]
|
| H A D | sepa_gauge.c | 141 SCIPdebugMsg(scip, "storing convex nlrows\n"); in storeNonlinearConvexNlrows()
210 SCIPdebugMsg(scip, "Computing interior point\n"); in computeInteriorPoint()
274 SCIPdebugMsg(scip, "skip NLP solve; no time left\n"); in computeInteriorPoint()
292 SCIPdebugMsg(scip, "finish interior point computation\n"); in computeInteriorPoint()
512 SCIPdebugMsg(scip, "starting binary search\n"); in findBoundaryPoint()
527 SCIPdebugMsg(scip, "Done\n"); in findBoundaryPoint()
541 SCIPdebugMsg(scip, "Done\n"); in findBoundaryPoint()
692 SCIPdebugMsg(scip, "gradient: "); in generateCut()
694 SCIPdebugMsg(scip, "gradient dot x_0: %g\n", gradx0); in generateCut()
712 SCIPdebugMsg(scip, "gradient cut: "); in generateCut()
[all …]
|
| H A D | heur_bound.c | 145 SCIPdebugMsg(scip, "fixing %d: variable <%s> to lower bound <%g> (%d pseudo cands)\n", in applyBoundHeur()
152 SCIPdebugMsg(scip, "fixing %d: variable <%s> to upper bound <%g> (%d pseudo cands)\n", in applyBoundHeur()
174 … SCIPdebugMsg(scip, "backtracking ended with %sfeasible problem\n", (infeasible ? "in" : "")); in applyBoundHeur()
182 SCIPdebugMsg(scip, "probing ended with %sfeasible problem\n", infeasible ? "in" : ""); in applyBoundHeur()
193 …SCIPdebugMsg(scip, "starting solving bound-heur LP at time %g, LP iterations: %" SCIP_LONGINT_FORM… in applyBoundHeur()
217 SCIPdebugMsg(scip, "ending solving bound-heur LP at time %g\n", SCIPgetSolvingTime(scip)); in applyBoundHeur()
221 …SCIPdebugMsg(scip, " -> new LP iterations: %" SCIP_LONGINT_FORMAT "\n", SCIPgetNLPIterations(scip)… in applyBoundHeur()
222 SCIPdebugMsg(scip, " -> error=%u, status=%d\n", lperror, lpstatus); in applyBoundHeur()
241 SCIPdebugMsg(scip, "bound heuristic found roundable primal solution: obj=%g\n", in applyBoundHeur()
256 SCIPdebugMsg(scip, "found feasible solution:\n"); in applyBoundHeur()
[all …]
|
| H A D | prop_obbt.c | 284 SCIPdebugMsg(scip, " lp was unbounded\n"); in solveLP()
287 SCIPdebugMsg(scip, " lp was not solved\n"); in solveLP()
454 SCIPdebugMsg(scip, "iterations left: unlimited\n"); in getIterationsLeft()
1178 SCIPdebugMsg(scip, "start filter rounds\n"); in filterBounds()
1337 SCIPdebugMsg(scip, "cut off\n"); in applyBoundChgs()
1473 SCIPdebugMsg(scip, "sort bounds\n"); in sortBounds()
1849 SCIPdebugMsg(scip, "no iterations left\n"); in findNewBounds()
1885 SCIPdebugMsg(scip, "apply obbt\n"); in applyObbt()
1947 SCIPdebugMsg(scip, "start probing\n"); in applyObbt()
2066 SCIPdebugMsg(scip, "end probing!\n"); in applyObbt()
[all …]
|
| H A D | presol_tworowbnd.c | 739 SCIPdebugMsg(scip, "right hand sides: %g and %g\n", in transformAndSolve()
1495 SCIPdebugMsg(scip, "pp\n"); in SCIP_DECL_PRESOLEXEC()
1498 SCIPdebugMsg(scip, "mm\n"); in SCIP_DECL_PRESOLEXEC()
1501 SCIPdebugMsg(scip, "pm\n"); in SCIP_DECL_PRESOLEXEC()
1504 SCIPdebugMsg(scip, "mp\n"); in SCIP_DECL_PRESOLEXEC()
1516 SCIPdebugMsg(scip, "sorted pp\n"); in SCIP_DECL_PRESOLEXEC()
1519 SCIPdebugMsg(scip, "sorted mm\n"); in SCIP_DECL_PRESOLEXEC()
1522 SCIPdebugMsg(scip, "sorted pm\n"); in SCIP_DECL_PRESOLEXEC()
1525 SCIPdebugMsg(scip, "sorted mp\n"); in SCIP_DECL_PRESOLEXEC()
1547 SCIPdebugMsg(scip, "processing pp and mm\n"); in SCIP_DECL_PRESOLEXEC()
[all …]
|
| H A D | nodesel_bfs.c | 148 …SCIPdebugMsg(scip, "plungedepth: [%d,%d], cur: %d -> abort plunging\n", minplungedepth, maxplunged… in SCIP_DECL_NODESELSELECT()
150 SCIPdebugMsg(scip, " -> best node : lower=%g\n", in SCIP_DECL_NODESELSELECT()
162 SCIPdebugMsg(scip, "plungedepth: [%d,%d], cur: %d => maxbound: infinity\n", in SCIP_DECL_NODESELSELECT()
181 SCIPdebugMsg(scip, "plungedepth: [%d,%d], cur: %d, bounds: [%g,%g], maxbound: %g\n", in SCIP_DECL_NODESELSELECT()
193 … SCIPdebugMsg(scip, " -> selected prio child: lower=%g\n", SCIPnodeGetLowerbound(*selnode)); in SCIP_DECL_NODESELSELECT()
201 … SCIPdebugMsg(scip, " -> selected best child: lower=%g\n", SCIPnodeGetLowerbound(*selnode)); in SCIP_DECL_NODESELSELECT()
209 … SCIPdebugMsg(scip, " -> selected prio sibling: lower=%g\n", SCIPnodeGetLowerbound(*selnode)); in SCIP_DECL_NODESELSELECT()
217 … SCIPdebugMsg(scip, " -> selected best sibling: lower=%g\n", SCIPnodeGetLowerbound(*selnode)); in SCIP_DECL_NODESELSELECT()
222 SCIPdebugMsg(scip, " -> selected best leaf: lower=%g\n", in SCIP_DECL_NODESELSELECT()
|
| H A D | heur_rootsoldiving.c | 347 SCIPdebugMsg(scip, " -> solution was feasible and good enough\n"); in SCIP_DECL_HEUREXEC()
392 SCIPdebugMsg(scip, " -> fixing <%s> = %g\n", SCIPvarGetName(var), solval); in SCIP_DECL_HEUREXEC()
409 SCIPdebugMsg(scip, " -> hard rounding <%s>[%g] <= %g\n", in SCIP_DECL_HEUREXEC()
429 SCIPdebugMsg(scip, " -> hard rounding <%s>[%g] >= %g\n", in SCIP_DECL_HEUREXEC()
455 SCIPdebugMsg(scip, " -> i=%d var <%s>, solval=%g, rootsol=%g, oldobj=%g, newobj=%g\n", in SCIP_DECL_HEUREXEC()
470 SCIPdebugMsg(scip, " -> i=%d var <%s>, solval=%g, oldobj=%g, newobj=%g\n", in SCIP_DECL_HEUREXEC()
522 …SCIPdebugMsg(scip, " -> opposite hard rounding <%s> >= %g\n", SCIPvarGetName(var), hardroundingnew… in SCIP_DECL_HEUREXEC()
537 SCIPdebugMsg(scip, " -> lpsolstat=%d, nfrac=%d\n", lpsolstat, nlpcands); in SCIP_DECL_HEUREXEC()
550 …SCIPdebugMsg(scip, "rootsoldiving found primal solution: obj=%g\n", SCIPgetSolOrigObj(scip, heurda… in SCIP_DECL_HEUREXEC()
558 SCIPdebugMsg(scip, " -> solution was feasible and good enough\n"); in SCIP_DECL_HEUREXEC()
[all …]
|
| H A D | heur_oneopt.c | 163 SCIPdebugMsg(scip, " lhs:<%g> <= act:<%g> <= rhs:<%g>, colval:<%g>\n", in calcShiftVal()
572 SCIPdebugMsg(scip, "Starting bound adjustment in 1-opt heuristic\n"); in SCIP_DECL_HEUREXEC()
604 SCIPdebugMsg(scip, "number of bound changes (due to global bounds) = %d\n", nchgbound); in SCIP_DECL_HEUREXEC()
623 SCIPdebugMsg(scip, "Row <%s> has activity %g\n", SCIProwGetName(row), activities[i]); in SCIP_DECL_HEUREXEC()
639 SCIPdebugMsg(scip, "Some global bound changes were not valid in lp rows.\n"); in SCIP_DECL_HEUREXEC()
659 SCIPdebugMsg(scip, "Starting 1-opt heuristic iteration #%d\n", niterations); in SCIP_DECL_HEUREXEC()
721 SCIPdebugMsg(scip, " %d shiftcands found \n", nshiftcands); in SCIP_DECL_HEUREXEC()
781 SCIPdebugMsg(scip, "found feasible shifted solution:\n"); in SCIP_DECL_HEUREXEC()
837 SCIPdebugMsg(scip, " -> error=%u, status=%d\n", lperror, SCIPgetLPSolstat(scip)); in SCIP_DECL_HEUREXEC()
851 SCIPdebugMsg(scip, "found feasible shifted solution:\n"); in SCIP_DECL_HEUREXEC()
[all …]
|
| H A D | heur_trivial.c | 174 SCIPdebugMsg(scip, "try lower bound solution\n"); in SCIP_DECL_HEUREXEC()
179 SCIPdebugMsg(scip, "found feasible lower bound solution:\n"); in SCIP_DECL_HEUREXEC()
186 SCIPdebugMsg(scip, "try upper bound solution\n"); in SCIP_DECL_HEUREXEC()
191 SCIPdebugMsg(scip, "found feasible upper bound solution:\n"); in SCIP_DECL_HEUREXEC()
200 SCIPdebugMsg(scip, "try zero solution\n"); in SCIP_DECL_HEUREXEC()
205 SCIPdebugMsg(scip, "found feasible zero solution:\n"); in SCIP_DECL_HEUREXEC()
213 SCIPdebugMsg(scip, "try lock solution\n"); in SCIP_DECL_HEUREXEC()
218 SCIPdebugMsg(scip, "found feasible lock solution:\n"); in SCIP_DECL_HEUREXEC()
|
| H A D | branch_multaggr.c | 280 SCIPdebugMsg(scip, "PROBING MODE:\n"); in selectVarMultAggrBranching()
303 SCIPdebugMsg(scip, " created down probing node with constraint:\n"); in selectVarMultAggrBranching()
318 … SCIPdebugMsg(scip, "error solving down node probing LP: status=%d\n", solstatdown); in selectVarMultAggrBranching()
366 SCIPdebugMsg(scip, " created up probing node with constraint:\n"); in selectVarMultAggrBranching()
380 SCIPdebugMsg(scip, "error solving up node probing LP: status=%d\n", solstatup); in selectVarMultAggrBranching()
524 SCIPdebugMsg(scip, "\n"); in selectVarMultAggrBranching()
766 SCIPdebugMsg(scip, "Execlp method of mult-aggreg branching\n "); in SCIP_DECL_BRANCHEXECLP()
903 SCIPdebugMsg(scip, "BRANCHING MODE:\n"); in SCIP_DECL_BRANCHEXECLP()
1009 SCIPdebugMsg(scip, "BRANCHED on fractional variable <%s>\n", SCIPvarGetName(bestcand)); in SCIP_DECL_BRANCHEXECLP()
1023 SCIPdebugMsg(scip, " -> up child's lowerbound: %g\n", SCIPnodeGetLowerbound(upchild)); in SCIP_DECL_BRANCHEXECLP()
[all …]
|
| H A D | heur_undercover.c | 2171 SCIPdebugMsg(scip, "fixing variables\n"); in solveSubproblem()
2207 SCIPdebugMsg(scip, "setting subproblem parameters\n"); in solveSubproblem()
2273 SCIPdebugMsg(scip, "solving subproblem started\n"); in solveSubproblem()
2632 SCIPdebugMsg(scip, " --> cutoff detected - backtracking\n"); in fixAndPropagate()
2780 SCIPdebugMsg(scip, "creating covering problem failed, terminating\n"); in SCIPapplyUndercover()
2785 SCIPdebugMsg(scip, "covering problem created successfully\n"); in SCIPapplyUndercover()
2801 SCIPdebugMsg(scip, "time limit hit, terminating\n"); in SCIPapplyUndercover()
2836 SCIPdebugMsg(scip, "solving covering problem\n\n"); in SCIPapplyUndercover()
2916 SCIPdebugMsg(scip, "time limit hit, terminating\n"); in SCIPapplyUndercover()
3056 SCIPdebugMsg(scip, "heuristic terminating unsuccessfully\n"); in SCIPapplyUndercover()
[all …]
|
| H A D | presol_trivial.c | 118 …SCIPdebugMsg(scip, "fixing integral variable <%s>: [%.17f,%.17f] -> [%.17f,%.17f]\n", SCIPvarGetNa… in SCIP_DECL_PRESOLEXEC()
122 SCIPdebugMsg(scip, " -> infeasible fixing\n"); in SCIP_DECL_PRESOLEXEC()
134 …SCIPdebugMsg(scip, "rounding lower bound of integral variable <%s>: [%.17f,%.17f] -> [%.17f,%.17f]… in SCIP_DECL_PRESOLEXEC()
141 …SCIPdebugMsg(scip, "rounding upper bound of integral variable <%s>: [%.17f,%.17f] -> [%.17f,%.17f]… in SCIP_DECL_PRESOLEXEC()
173 …SCIPdebugMsg(scip, "fixing continuous variable <%s>[%.17f,%.17f] to %.17f\n", SCIPvarGetName(vars[… in SCIP_DECL_PRESOLEXEC()
177 SCIPdebugMsg(scip, " -> infeasible fixing\n"); in SCIP_DECL_PRESOLEXEC()
|
| H A D | sepa_eccuts.c | 279 SCIPdebugMsg(scip, " vars: "); in ecaggrPrint()
284 SCIPdebugMsg(scip, " terms: "); in ecaggrPrint()
610 SCIPdebugMsg(scip, "remaining terms: "); in nlrowaggrPrint()
620 SCIPdebugMsg(scip, "print e.c. aggr %d\n", i); in nlrowaggrPrint()
1436 SCIPdebugMsg(scip, "aggregations found:\n"); in doSeachEcAggr()
1636 SCIPdebugMsg(scip, "consider <= rhs\n"); in findAndStoreEcAggregations()
1656 SCIPdebugMsg(scip, "consider >= lhs\n"); in findAndStoreEcAggregations()
2127 SCIPdebugMsg(scip, "facet in orig. space: "); in SCIPcomputeConvexEnvelopeFacet()
2444 SCIPdebugMsg(scip, "current solution:\n"); in computeCut()
2627 SCIPdebugMsg(scip, "separate cuts...\n"); in separateCuts()
[all …]
|
| H A D | prop_genvbounds.c | 491 SCIPdebugMsg(scip, "free starting data\n"); in freeStartingData()
1151 SCIPdebugMsg(scip, " genvbound: "); in applyGenVBound()
1206 SCIPdebugMsg(scip, " cutoff!\n"); in applyGenVBound()
1213 SCIPdebugMsg(scip, " tightened!\n"); in applyGenVBound()
1477 SCIPdebugMsg(scip, "set up events\n"); in setUpEvents()
1735 SCIPdebugMsg(scip, "{\n"); in sortGenVBounds()
1739 SCIPdebugMsg(scip, " [%d] ", j); in sortGenVBounds()
1743 SCIPdebugMsg(scip, "}\n"); in sortGenVBounds()
1854 SCIPdebugMsg(scip, "init propdata\n"); in initPropdata()
2291 SCIPdebugMsg(scip, "added genvbound "); in SCIPgenVBoundAdd()
[all …]
|
| H A D | nodesel_hybridestim.c | 169 …SCIPdebugMsg(scip, "plungedepth: [%d,%d], cur: %d -> abort plunging\n", minplungedepth, maxplunged… in SCIP_DECL_NODESELSELECT()
174 SCIPdebugMsg(scip, " -> best node : lower=%g\n", in SCIP_DECL_NODESELSELECT()
203 SCIPdebugMsg(scip, "plungedepth: [%d,%d], cur: %d, bounds: [%g,%g], maxbound: %g\n", in SCIP_DECL_NODESELSELECT()
214 … SCIPdebugMsg(scip, " -> selected prio child: estimate=%g\n", SCIPnodeGetEstimate(*selnode)); in SCIP_DECL_NODESELSELECT()
222 … SCIPdebugMsg(scip, " -> selected best child: estimate=%g\n", SCIPnodeGetEstimate(*selnode)); in SCIP_DECL_NODESELSELECT()
230 … SCIPdebugMsg(scip, " -> selected prio sibling: estimate=%g\n", SCIPnodeGetEstimate(*selnode)); in SCIP_DECL_NODESELSELECT()
238 … SCIPdebugMsg(scip, " -> selected best sibling: estimate=%g\n", SCIPnodeGetEstimate(*selnode)); in SCIP_DECL_NODESELSELECT()
246 SCIPdebugMsg(scip, " -> selected best leaf: estimate=%g\n", in SCIP_DECL_NODESELSELECT()
|
| H A D | sepa_rapidlearning.c | 257 SCIPdebugMsg(scip, "Copying SCIP was%s valid.\n", valid ? "" : " not"); in setupAndSolveSubscipRapidlearning()
388 SCIPdebugMsg(scip, "Subscip was completely solved, status %d.\n", SCIPgetStatus(subscip)); in setupAndSolveSubscipRapidlearning()
400 SCIPdebugMsg(scip, "proceed solving after the first 20%% of the solution process, since:\n"); in setupAndSolveSubscipRapidlearning()
465 SCIPdebugMsg(scip, "Update old dualbound %g to new dualbound %g.\n", in setupAndSolveSubscipRapidlearning()
706 SCIPdebugMsg(scip, "-> allow local rapid learning due to global zero objective\n"); in checkExec()
714 SCIPdebugMsg(scip, "-> allow local rapid learning due to no solution found so far\n"); in checkExec()
730 SCIPdebugMsg(scip, "-> allow local rapid learning due to equal dualbound\n"); in checkExec()
743 SCIPdebugMsg(scip, "-> allow local rapid learning due to inf/obj leaves ratio\n"); in checkExec()
778 SCIPdebugMsg(scip, "-> allow local rapid learning due to local zero objective\n"); in checkExec()
792 SCIPdebugMsg(scip, "degeneracy: %.2f ratio: %.2f\n", degeneracy, varconsratio); in checkExec()
[all …]
|
| H A D | heur_locks.c | 453 SCIPdebugMsg(scip, "last fixing led to infeasibility trying other bound\n"); in SCIPapplyLockFixings()
496 SCIPdebugMsg(scip, "probing was infeasible\n"); in SCIPapplyLockFixings()
616 SCIPdebugMsg(scip, "found infeasible row, stopping heur\n"); in SCIPapplyLockFixings()
737 SCIPdebugMsg(scip, "--> too few fixings\n"); in SCIP_DECL_HEUREXEC()
761 SCIPdebugMsg(scip, "Fixed %d of %d (%.1f %%) variables after probing -> %s\n", in SCIP_DECL_HEUREXEC()
773 SCIPdebugMsg(scip, "starting solving locks-lp at time %g\n", SCIPgetSolvingTime(scip)); in SCIP_DECL_HEUREXEC()
791 SCIPdebugMsg(scip, "ending solving locks-lp at time %g\n", SCIPgetSolvingTime(scip)); in SCIP_DECL_HEUREXEC()
796 SCIPdebugMsg(scip, " -> error=%u, status=%d\n", lperror, SCIPgetLPSolstat(scip)); in SCIP_DECL_HEUREXEC()
830 SCIPdebugMsg(scip, "found feasible solution:\n"); in SCIP_DECL_HEUREXEC()
976 SCIPdebugMsg(scip, "setting objlimit for subscip to %g\n", cutoffbound); in SCIP_DECL_HEUREXEC()
[all …]
|
| H A D | heur_mpec.c | 353 SCIPdebugMsg(scip, "nbinvars %d\n", nbinvars); in heurExec()
408 SCIPdebugMsg(scip, "skip NLP solve; no time left\n"); in heurExec()
422 SCIPdebugMsg(scip, "error occured during NLP solve -> stop!\n"); in heurExec()
429 SCIPdebugMsg(scip, "nlpcostleft = %e\n", nlpcostleft); in heurExec()
473 SCIPdebugMsg(scip, "result of sub-NLP call: %d\n", subnlpresult); in heurExec()
478 SCIPdebugMsg(scip, "sub-NLP found a feasible solution -> stop!\n"); in heurExec()
505 SCIPdebugMsg(scip, "found a solution (stored = %u)\n", stored); in heurExec()
521 SCIPdebugMsg(scip, "reinit fixed the infeasibility\n"); in heurExec()
530 SCIPdebugMsg(scip, "unfixing binary variables\n"); in heurExec()
587 SCIPdebugMsg(scip, "fixed %d binary variables\n", nfixedvars); in heurExec()
[all …]
|
| H A D | heur_indicator.c | 109 SCIPdebugMsg(scip, "Performing one-opt ...\n"); in tryOneOpt()
190 SCIPdebugMsg(scip, "An LP error occurred.\n"); in tryOneOpt()
203 …SCIPdebugMsg(scip, "One-opt found solution candidate with value %g.\n", SCIPgetSolTransObj(scip, s… in tryOneOpt()
213 … SCIPdebugMsg(scip, "Finished one-opt (tried variables: %d, found sols: %d).\n", cnt, *nfoundsols); in tryOneOpt()
292 SCIPdebugMsg(scip, "Solution candidate reaches cutoff (in propagation).\n"); in trySolCandidate()
306 SCIPdebugMsg(scip, "An LP error occurred.\n"); in trySolCandidate()
310 SCIPdebugMsg(scip, "Solution candidate reaches cutoff (in LP solving).\n"); in trySolCandidate()
325 SCIPdebugMsg(scip, "Found solution candidate with value %g.\n", SCIPgetSolTransObj(scip, sol)); in trySolCandidate()
333 SCIPdebugMsg(scip, "Solution is feasible and stored.\n"); in trySolCandidate()
336 SCIPdebugMsg(scip, "Solution was not stored.\n"); in trySolCandidate()
[all …]
|
| H A D | heur_vbounds.c | 468 SCIPdebugMsg(scip, "initialize variable bound heuristic (%s)\n", SCIPgetProbName(scip)); in initializeCandsLists()
707 SCIPdebugMsg(scip, "probing was infeasible after %d backtracks\n", nbacktracks); in applyVboundsFixings()
713 SCIPdebugMsg(scip, "interrupt probing after %d backtracks\n", nbacktracks); in applyVboundsFixings()
847 SCIPdebugMsg(scip, "setting objlimit for subscip to %g\n", heurdata->cutoffbound); in setupAndSolveSubscip()
881 SCIPdebugMsg(scip, "found feasible solution in sub-MIP\n"); in setupAndSolveSubscip()
1037 SCIPdebugMsg(scip, "cutoff or timeout in locks fixing\n"); in applyVbounds()
1048 SCIPdebugMsg(scip, "--> too few fixings\n"); in applyVbounds()
1055 SCIPdebugMsg(scip, "--> too few fixings\n"); in applyVbounds()
1093 SCIPdebugMsg(scip, "ending solving vbound-lp at time %g\n", SCIPgetSolvingTime(scip)); in applyVbounds()
1098 SCIPdebugMsg(scip, " -> error=%u, status=%d\n", lperror, lpstatus); in applyVbounds()
[all …]
|
| H A D | prop_redcost.c | 151 SCIPdebugMsg(scip, "globally fix binary variable <%s> to 1.0\n", SCIPvarGetName(var)); in propagateRootRedcostBinvar()
172 SCIPdebugMsg(scip, "globally fix binary variable <%s> to 0.0\n", SCIPvarGetName(var)); in propagateRootRedcostBinvar()
265 SCIPdebugMsg(scip, "variable <%s>: fixed 0.0 (requiredredcost <%g>, redcost <%g>)\n", in propagateRedcostBinvar()
286 SCIPdebugMsg(scip, "variable <%s>: fixed 1.0 (requiredredcost <%g>, redcost <%g>)\n", in propagateRedcostBinvar()
335 …SCIPdebugMsg(scip, "variable <%s>: cutoff (requiredredcost <%g>, lbredcost <%g>, ubredcost <%g>)\n… in propagateRedcostBinvar()
342 …SCIPdebugMsg(scip, "variable <%s>: fixed 1.0 (requiredredcost <%g>, redcost <%g>, lbredcost <%g>)\… in propagateRedcostBinvar()
350 …SCIPdebugMsg(scip, "variable <%s>: fixed 0.0 (requiredredcost <%g>, redcost <%g>, ubredcost <%g>)\… in propagateRedcostBinvar()
424 …SCIPdebugMsg(scip, "redcost strengthening upper bound: <%s> [%g,%g] -> [%g,%g] (ub=%g, lb=%g, redc… in propagateRedcostVar()
657 …SCIPdebugMsg(scip, "lpobjval <%g>, cutoffbound <%g>, max reduced <%g>, propgate binary %u, use imp… in SCIP_DECL_PROPEXEC()
695 SCIPdebugMsg(scip, "node %" SCIP_LONGINT_FORMAT ": detected cutoff\n", in SCIP_DECL_PROPEXEC()
[all …]
|
| H A D | branch_allfullstrong.c | 166 … SCIPdebugMsg(scip, " -> down child's lowerbound: %g\n", SCIPnodeGetLowerbound(downchild)); in branch()
171 SCIPdebugMsg(scip, " -> eq child's lowerbound: %g\n", SCIPnodeGetLowerbound(eqchild)); in branch()
176 SCIPdebugMsg(scip, " -> up child's lowerbound: %g\n", SCIPnodeGetLowerbound(upchild)); in branch()
245 SCIPdebugMsg(scip, "Execlp method of allfullstrong branching\n"); in SCIP_DECL_BRANCHEXECLP()
261 SCIPdebugMsg(scip, "Execps method of allfullstrong branching\n"); in SCIP_DECL_BRANCHEXECPS()
392 … SCIPdebugMsg(scip, "applying strong branching on %s variable <%s>[%g,%g] with solution %g\n", in SCIPselectVarPseudoStrongBranching()
454 … SCIPdebugMsg(scip, " -> integral variable <%s> is infeasible in both directions\n", in SCIPselectVarPseudoStrongBranching()
462 … SCIPdebugMsg(scip, " -> fractional variable <%s> is infeasible in both directions\n", in SCIPselectVarPseudoStrongBranching()
477 …SCIPdebugMsg(scip, " -> variable <%s> is infeasible in downward branch\n", SCIPvarGetName(pseudoca… in SCIPselectVarPseudoStrongBranching()
492 …SCIPdebugMsg(scip, " -> variable <%s> is infeasible in upward branch\n", SCIPvarGetName(pseudocand… in SCIPselectVarPseudoStrongBranching()
[all …]
|
| H A D | heur_trivialnegation.c | 149 …SCIPdebugMsg(scip, "check variable <%s> which has %schanged from %g to %g\n", SCIPvarGetName(trans… in SCIP_DECL_HEUREXEC()
167 SCIPdebugMsg(scip, "try solution with all negations\n"); in SCIP_DECL_HEUREXEC()
176 SCIPdebugMsg(scip, "found feasible solution solution:\n"); in SCIP_DECL_HEUREXEC()
188 SCIPdebugMsg(scip, "try solution with feasible negations\n"); in SCIP_DECL_HEUREXEC()
196 SCIPdebugMsg(scip, "found feasible solution solution:\n"); in SCIP_DECL_HEUREXEC()
214 SCIPdebugMsg(scip, "try solution with a single negation\n"); in SCIP_DECL_HEUREXEC()
222 SCIPdebugMsg(scip, "found feasible solution:\n"); in SCIP_DECL_HEUREXEC()
|
| /dports/math/SCIP/scip-7.0.3/examples/LOP/src/ |
| H A D | cons_lop.c | 190 SCIPdebugMsg(scip, "deleting linear ordering constraint <%s>.\n", SCIPconsGetName(cons)); in SCIP_DECL_CONSDELETE()
401 SCIPdebugMsg(scip, "added %d equations.\n", nGen); in SCIP_DECL_CONSINITLP()
445 SCIPdebugMsg(scip, "separated %d cuts.\n", nGen); in SCIP_DECL_CONSSEPALP()
614 SCIPdebugMsg(scip, "all linear ordering constraints are feasible.\n"); in SCIP_DECL_CONSENFOLP()
695 SCIPdebugMsg(scip, "all linear ordering constraints are feasible.\n"); in SCIP_DECL_CONSENFOPS()
793 SCIPdebugMsg(scip, "all linear ordering constraints are feasible.\n"); in SCIP_DECL_CONSCHECK()
852 SCIPdebugMsg(scip, " -> node infeasible.\n"); in SCIP_DECL_CONSPROP()
871 SCIPdebugMsg(scip, " -> node infeasible.\n"); in SCIP_DECL_CONSPROP()
895 SCIPdebugMsg(scip, " -> node infeasible.\n"); in SCIP_DECL_CONSPROP()
915 SCIPdebugMsg(scip, "propagated %d domains.\n", nGen); in SCIP_DECL_CONSPROP()
[all …]
|