Home
last modified time | relevance | path

Searched refs:SCIPdebugMsg (Results 151 – 175 of 206) sorted by relevance

123456789

/dports/math/SCIP/scip-7.0.3/src/scip/
H A Devent_globalbnd.c105 SCIPdebugMsg(scip, "catching events in " EVENTHDLR_NAME " eventhdlr\n"); in SCIP_DECL_EVENTINIT()
156 SCIPdebugMsg(scip, "exec method of eventhdlr " EVENTHDLR_NAME "\n"); in SCIP_DECL_EVENTEXEC()
H A Dsepa_aggregation.c231 …SCIPdebugMsg(scip, " -> found potential %s cut <%s>: rhs=%f, eff=%f\n", cutclassname, cutname, cut… in addCut()
257 …SCIPdebugMsg(scip, " -> %s cut <%s> no longer efficacious: rhs=%f, eff=%f\n", cutclassname, cutnam… in addCut()
266 … SCIPdebugMsg(scip, " -> found %s cut <%s>: rhs=%f, eff=%f, rank=%d, min=%f, max=%f (range=%g)\n", in addCut()
823 …SCIPdebugMsg(scip, "start c-MIR aggregation with row <%s> (%d/%d)\n", SCIProwGetName(rows[startrow… in aggregation()
933 SCIPdebugMsg(scip, " -> abort aggregation: cut found\n"); in aggregation()
944 SCIPdebugMsg(scip, " -> abort aggregation: maximal number of aggregations reached\n"); in aggregation()
957 SCIPdebugMsg(scip, " -> current aggregation has %d/%d nonzeros and consists of %d/%d rows\n", in aggregation()
1091 SCIPdebugMsg(scip, "separating c-MIR cuts\n"); in separateCuts()
1265 …SCIPdebugMsg(scip, " -> row %d <%s>: lhsscore=%g rhsscore=%g maxscore=%g\n", r, SCIProwGetName(row… in separateCuts()
H A Dheur_dualval.c2074 SCIPdebugMsg(scip, "return13 : gap is less than mingap\n"); in SCIPapplyHeurDualval()
2091 SCIPdebugMsg(scip, "return1 : already found solution \n"); in SCIPapplyHeurDualval()
2100 SCIPdebugMsg(scip, "return2 : subscip is NULL\n"); in SCIPapplyHeurDualval()
2124 SCIPdebugMsg(scip, "return 4 : subscip is infeasible\n"); in SCIPapplyHeurDualval()
2259 SCIPdebugMsg(scip, "return4 : the subscip is infeasible\n"); in SCIPapplyHeurDualval()
2304 SCIPdebugMsg(scip, "return11 : solution did not improve\n"); in SCIPapplyHeurDualval()
2349 SCIPdebugMsg(scip, "return12 : equal maxranks\n"); in SCIPapplyHeurDualval()
2456 SCIPdebugMsg(scip, "return5 : reached iteration limit\n"); in SCIPapplyHeurDualval()
2474 SCIPdebugMsg(scip, "return6 : go up\n"); in SCIPapplyHeurDualval()
2503 SCIPdebugMsg(scip, "return7 : subscip was set NULL\n"); in SCIPapplyHeurDualval()
[all …]
H A Devent_estim.c760 SCIPdebugMsg(scip, "Maximum depth increased to %d\n", treeprofile->stats.maxdepth); in updateTreeProfile()
767 SCIPdebugMsg(scip, "Updating depth of tree waist: %d (%" SCIP_LONGINT_FORMAT " nodes)\n", in updateTreeProfile()
807 SCIPdebugMsg(scip, "Reusing previous estimation result %g\n", treeprofile->lastestimate); in predictTotalSizeTreeProfile()
1014 SCIPdebugMsg(scip, "Inserting label %d for node number %" SCIP_LONGINT_FORMAT " (%p)\n", in subtreeSumGapStoreNode()
1068 SCIPdebugMsg(scip, "Splitting tree into %d subtrees\n", ssg->nsubtrees); in subtreeSumGapSplit()
1203 SCIPdebugMsg(scip, "Removed node %" SCIP_LONGINT_FORMAT " from open nodes of SSG\n", in subtreeSumGapRemoveNode()
1263 SCIPdebugMsg(scip, in subtreeSumGapInsertChildren()
1482 … SCIPdebugMsg(scip, "Keep split into %d subtrees from %" SCIP_LONGINT_FORMAT " nodes ago\n", in subtreeSumGapUpdate()
1773 SCIPdebugMsg(scip, "Finished creation of time series '%s'\n", timeseriesptr->name); in timeSeriesCreate()
2516 SCIPdebugMsg(scip, in updateTimeseries()
[all …]
H A Dnodesel_breadthfirst.c80 …SCIPdebugMsg(scip, "Selecting next node number %" SCIP_LONGINT_FORMAT " at depth %d\n", SCIPnodeGe… in SCIP_DECL_NODESELSELECT()
H A Dcons_or.c683 SCIPdebugMsg(scip, "after fixings: "); in applyFixings()
1048 …SCIPdebugMsg(scip, "constraint <%s>: operator var <%s> fixed to 1.0 -> fix resultant <%s> to 1.0\n… in propagateCons()
1080 …SCIPdebugMsg(scip, "constraint <%s>: resultant var <%s> fixed to 0.0 -> fix operator var <%s> to 0… in propagateCons()
1166 …SCIPdebugMsg(scip, "constraint <%s>: all operator vars fixed to 0.0 -> fix resultant <%s> to 0.0\n… in propagateCons()
1196 …SCIPdebugMsg(scip, "constraint <%s>: resultant <%s> fixed to 1.0, only one unfixed operand -> fix … in propagateCons()
1340 …SCIPdebugMsg(scip, "upgrading or constraint <%s> into equivalent and constraint on negated variabl… in upgradeCons()
1729 …SCIPdebugMsg(scip, "or constraint <%s> has only one variable not fixed to 0.0\n", SCIPconsGetName(… in SCIP_DECL_CONSPRESOL()
1908 SCIPdebugMsg(scip, "parse <%s> as or constraint\n", str); in SCIP_DECL_CONSPARSE()
1921 SCIPdebugMsg(scip, "resultant variable %s does not exist \n", token); in SCIP_DECL_CONSPARSE()
H A Dcuts.c6356 SCIPdebugMsg(scip, "0. Fix some variables in advance:\n"); in getFlowCover()
6393 SCIPdebugMsg(scip, " <%d>: in N1-C1\n", j); in getFlowCover()
6401 SCIPdebugMsg(scip, " <%d>: in C1\n", j); in getFlowCover()
6409 SCIPdebugMsg(scip, " <%d>: in C2\n", j); in getFlowCover()
6417 SCIPdebugMsg(scip, " <%d>: in N2-C2\n", j); in getFlowCover()
6722 SCIPdebugMsg(scip, "0. Fix some variables in advance:\n"); in getFlowCover()
6759 SCIPdebugMsg(scip, " <%d>: in N1-C1\n", j); in getFlowCover()
6767 SCIPdebugMsg(scip, " <%d>: in C1\n", j); in getFlowCover()
6775 SCIPdebugMsg(scip, " <%d>: in C2\n", j); in getFlowCover()
6783 SCIPdebugMsg(scip, " <%d>: in N2-C2\n", j); in getFlowCover()
[all …]
H A Dcons_benders.c193 SCIPdebugMsg(scip, "Creating solution was successful.\n"); in constructValidSolution()
198 SCIPdebugMsg(scip, "Creating solution was not successful.\n"); in constructValidSolution()
663 …SCIPdebugMsg(scip, "Tightened lower bound of <%s> to %g\n", SCIPvarGetName(auxiliaryvar), lowerbou… in SCIP_DECL_CONSPRESOL()
H A Dpresol_convertinttobin.c204 …SCIPdebugMsg(scip, "integer variable <%s> [%g,%g], domainsize %" SCIP_LONGINT_FORMAT "\n, <uplocks… in SCIP_DECL_PRESOLEXEC()
228 …SCIPdebugMsg(scip, "creating for <%s>[%g,%g] %d. binary variable\n", SCIPvarGetName(vars[v]), lb, … in SCIP_DECL_PRESOLEXEC()
H A Dscip_solve.c892 SCIPdebugMsg(scip, "starting presolving round %d (%d/%d/%d), timing = %u\n", in presolveRound()
935 SCIPdebugMsg(scip, "executing presolver <%s>\n", SCIPpresolGetName(scip->set->presols[i])); in presolveRound()
975 SCIPdebugMsg(scip, "presolving callback returned result <%d>\n", result); in presolveRound()
1001 SCIPdebugMsg(scip, "executing presolve method of constraint handler <%s>\n", in presolveRound()
1032 SCIPdebugMsg(scip, "presolving callback returned with result <%d>\n", result); in presolveRound()
1122 SCIPdebugMsg(scip, "presolving callback return with result <%d>\n", result); in presolveRound()
1165 SCIPdebugMsg(scip, "calling primal heuristics during presolving\n"); in presolveRound()
1312 SCIPdebugMsg(scip, "calling primal heuristics before presolving\n"); in presolve()
1628 SCIPdebugMsg(scip, "constructing empty NLP\n"); in initSolve()
2781 SCIPdebugMsg(scip, "try to add solution to the solution tree:\n"); in SCIPsolve()
[all …]
H A Dcons_pseudoboolean.c3573 SCIPdebugMsg(scip, "linear activity = %g\n", activity); in checkOrigPbCons()
6001 SCIPdebugMsg(scip, "old -> "); in tryUpgradingXor()
6003 SCIPdebugMsg(scip, "new -> "); in tryUpgradingXor()
6174 SCIPdebugMsg(scip, "old -> "); in tryUpgradingLogicor()
6176 SCIPdebugMsg(scip, "new -> "); in tryUpgradingLogicor()
6349 SCIPdebugMsg(scip, " -> infeasible fixing\n"); in tryUpgradingLogicor()
6519 SCIPdebugMsg(scip, "old -> "); in tryUpgradingLogicor()
6521 SCIPdebugMsg(scip, "new -> "); in tryUpgradingLogicor()
6865 SCIPdebugMsg(scip, " -> infeasible fixing\n"); in tryUpgradingSetppc()
6988 SCIPdebugMsg(scip, "old -> "); in tryUpgradingSetppc()
[all …]
H A Dpresol_domcol.c1247 …SCIPdebugMsg(scip, "[ub]\tupper bound for dominating variable <%s> changed: [%.17f,%.17f] -> [%.17… in predBndStr()
1275 …SCIPdebugMsg(scip, "[lb]\tlower bound of dominating variable <%s> changed: [%.17f,%.17f] -> [%.17f… in predBndStr()
1304 …SCIPdebugMsg(scip, "[wcub]\tlower bound of dominating variable <%s> changed: [%.17f,%.17f] -> [%.1… in predBndStr()
1331 …SCIPdebugMsg(scip, "[ub]\tupper bound of dominated variable <%s> changed: [%.17f,%.17f] -> [%.17f,… in predBndStr()
1360 …SCIPdebugMsg(scip, "[wclb]\tupper bound of dominated variable <%s> changed: [%.17f,%.17f] -> [%.17… in predBndStr()
1384 …SCIPdebugMsg(scip, "[lb]\tlower bound of dominated variable <%s> changed: [%.17f,%.17f] -> [%.17f,… in predBndStr()
2339 SCIPdebugMsg(scip, " -> infeasible fixing\n"); in SCIP_DECL_PRESOLEXEC()
2367 SCIPdebugMsg(scip, " -> infeasible fixing\n"); in SCIP_DECL_PRESOLEXEC()
2404 …SCIPdebugMsg(scip, "### %d vars [%" SCIP_LONGINT_FORMAT " dom] => fixed [cont: %d, int: %d, bin: %… in SCIP_DECL_PRESOLEXEC()
H A Dnodesel_uct.c349 …SCIPdebugMsg(scip, "Resizing node visits array, old capacity: %d new capacity : %d\n", nodeseldata… in ensureMemorySize()
500 …SCIPdebugMsg(scip, "updating node visits from node number %" SCIP_LONGINT_FORMAT "\n", SCIPnodeGet… in SCIP_DECL_NODESELSELECT()
H A Dpresol_inttobinary.c116 …SCIPdebugMsg(scip, "converting <%s>[%g,%g] into binary variable\n", SCIPvarGetName(vars[v]), lb, u… in SCIP_DECL_PRESOLEXEC()
H A Dpresol_dualsparsify.c594 SCIPdebugMsg(scip, "remove column bounds of column %d\n", colidx2); in aggregation()
657 …SCIPdebugMsg(scip, "set debug solution value of %s to %g\n", SCIPvarGetName(newvar), weight1 * val… in aggregation()
679 …SCIPdebugMsg(scip, "create a linear constraint to ensure %g <= %g %s + %g %s <= %g\n", lhs, coefs[… in aggregation()
1067 …SCIPdebugMsg(scip, "cancelcol %d (%s) candidate column %d (%s) (bestcancelrate = %g, bestscale = %… in cancelCol()
1277 …SCIPdebugMsg(scip, "skipping dualsparsify: nfailures=%d, nwaitingcalls=%d\n", presoldata->nfailure… in SCIP_DECL_PRESOLEXEC()
1282 SCIPdebugMsg(scip, "starting dualsparsify. . .\n"); in SCIP_DECL_PRESOLEXEC()
H A Devent_softtimelimit.c152 SCIPdebugMsg(scip, "exec method of event handler for soft time limit\n"); in SCIP_DECL_EVENTEXEC()
H A Dpresol_qpkktref.c1826 …SCIPdebugMsg(scip, "tries to add the KKT conditions for constraint <%s>\n", SCIPconsGetName(cons)); in SCIP_DECL_PRESOLEXEC()
1837 …SCIPdebugMsg(scip, "quadratic constraint update failed, since matrix associated to quadratic const… in SCIP_DECL_PRESOLEXEC()
1892 …SCIPdebugMsg(scip, "failed adding the KKT conditions, since not all variables to quadratic constra… in SCIP_DECL_PRESOLEXEC()
1909 …SCIPdebugMsg(scip, "failed adding the KKT conditions, since not all variables to quadratic constra… in SCIP_DECL_PRESOLEXEC()
1925 …SCIPdebugMsg(scip, "failed adding the KKT conditions, since not all variables to quadratic constra… in SCIP_DECL_PRESOLEXEC()
2016 SCIPdebugMsg(scip, "added the KKT conditions to the mixed-binary quadratic program\n"); in SCIP_DECL_PRESOLEXEC()
2018 SCIPdebugMsg(scip, "added the KKT conditions to the quadratic program\n"); in SCIP_DECL_PRESOLEXEC()
H A Dpresol_gateextraction.c1020 SCIPdebugMsg(scip, "Following constraints form a set-partitioning constraint.\n"); in extractGates()
1024 SCIPdebugMsg(scip, "Following constraints form an and-constraint.\n"); in extractGates()
1078 SCIPdebugMsg(scip, "-------------->\n"); in extractGates()
1102 SCIPdebugMsg(scip, "-------------->\n"); in extractGates()
1639 … SCIPdebugMsg(scip, "Following logicor is redundant to the set-partitioning constraint.\n"); in SCIP_DECL_PRESOLEXEC()
1650 …SCIPdebugMsg(scip, "Following logicor and set-packing constraints form a set-partitioning constrai… in SCIP_DECL_PRESOLEXEC()
1661 SCIPdebugMsg(scip, "-------------->\n"); in SCIP_DECL_PRESOLEXEC()
H A Dsepa_zerohalf.c1673 …SCIPdebugMsg(scip, "using transformed row %i of length %i with slack %f and rhs %f for cut\n", row… in generateZerohalfCut()
2205 SCIPdebugMsg(scip, "built mod2 matrix (%i rows, %i cols)\n", mod2matrix.nrows, mod2matrix.ncols); in doSeparation()
2219 …SCIPdebugMsg(scip, "preprocessed rows (%i rows, %i cols, %i cuts) \n", mod2matrix.nrows, mod2matri… in doSeparation()
2227 …SCIPdebugMsg(scip, "enough cuts, stopping (%i rows, %i cols)\n", mod2matrix.nrows, mod2matrix.ncol… in doSeparation()
2233 …SCIPdebugMsg(scip, "preprocessed columns (%i rows, %i cols)\n", mod2matrix.nrows, mod2matrix.ncols… in doSeparation()
2259 …SCIPdebugMsg(scip, "processing row %i/%i (%i/%i cuts)\n", i, mod2matrix.nrows, sepadata->ncuts, se… in doSeparation()
2304 …SCIPdebugMsg(scip, "applied proposition five (%i rows, %i cols)\n", mod2matrix.nrows, mod2matrix.n… in doSeparation()
2308 …SCIPdebugMsg(scip, "no change, stopping (%i rows, %i cols)\n", mod2matrix.nrows, mod2matrix.ncols); in doSeparation()
2326 SCIPdebugMsg(scip, "total number of cuts found: %i\n", sepadata->ncuts); in doSeparation()
H A Dcons_components.c276 …SCIPdebugMsg(scip, "freeing component %d of problem <%s>\n", component->number, component->problem… in freeComponent()
391 … SCIPdebugMsg(scip, "%d locally fixed variables have been copied, objective contribution: %g\n", in componentSetupWorkingSol()
1101 SCIPdebugMsg(scip, "solve sub-SCIP for component <%s> (ncalls=%d, absgap=%16.9g)\n", in solveComponent()
1149 SCIPdebugMsg(scip, "--> (status=%d, nodes=%lld, time=%.2f): gap: %12.5g%% absgap: %16.9g\n", in solveComponent()
1635 …SCIPdebugMsg(scip, "component %d at node %lld, depth %d (%d): %d vars (%d bin, %d int, %d cont), %… in createAndSplitProblem()
1642 SCIPdebugMsg(scip, "build sub-SCIP for component %d of problem <%s>: %d vars, %d conss\n", in createAndSplitProblem()
2179 …SCIPdebugMsg(scip, "found %d components (%d fulfulling the minsize requirement) at node %lld at de… in SCIP_DECL_CONSPROP()
2343 …SCIPdebugMsg(scip, "found %d components (%d with small size) during presolving; overall problem si… in SCIP_DECL_CONSPRESOL()
2402 SCIPdebugMsg(scip, "solve component %d: %d vars (%d bin, %d int, %d cont), %d conss\n", in SCIP_DECL_CONSPRESOL()
H A Dsepa_impliedbounds.c113 SCIPdebugMsg(scip, " -> found cut (activity = %g): ", activity); in addCut()
157 SCIPdebugMsg(scip, "searching for implied bound cuts\n"); in separateCuts()
H A Ddebug.c268 SCIPdebugMsg(set->scip, "found variable <%s>: value <%g>\n", (*names)[i], val); in readSolfile()
293 SCIPdebugMsg(set->scip, "Debug Solution value is %g.\n", debugsolval); in readSolfile()
801 …SCIPdebugMsg(scip, " -> checking of constraint %s returned result <%d>\n", SCIPconsGetName(conss[c… in SCIPdebugCheckConss()
954 …SCIPdebugMsg(scip, "debugging solution on lower bound of <%s>[%g] >= %g\n", SCIPvarGetName(var), v… in SCIPdebugCheckLbGlobal()
999 …SCIPdebugMsg(scip, "debugging solution on upper bound of <%s>[%g] <= %g\n", SCIPvarGetName(var), v… in SCIPdebugCheckUbGlobal()
2019 …SCIPdebugMsg(scip, "already have stored debugging solution value %g for variable <%s>, do not stor… in SCIPdebugAddSolVal()
2031 SCIPdebugMsg(scip, "add variable <%s>: value <%g>\n", debugsoldata->solnames[i], val); in SCIPdebugAddSolVal()
2037 SCIPdebugMsg(scip, "Debug Solution value is now %g.\n", debugsoldata->debugsolval); in SCIPdebugAddSolVal()
H A Dheur_mutation.c331 SCIPdebugMsg(scip, "Solve Mutation subMIP\n"); in setupAndSolveSubscipMutation()
523 SCIPdebugMsg(scip, "Could not create the subproblem -> skip call\n"); in SCIP_DECL_HEUREXEC()
/dports/math/SCIP/scip-7.0.3/pclint/
H A Dscip.lnt75 -emacro(506,SCIPdebugMsg)
118 -emacro(681,SCIPdebugMsg)
151 -emacro(774,SCIPdebugMsg)
/dports/math/SCIP/scip-7.0.3/examples/Eventhdlr/src/
H A Devent_bestsol.c86 SCIPdebugMsg(scip, "exec method of event handler for best solution found\n"); in SCIP_DECL_EVENTEXEC()

123456789