--- /srv/rebuilderd/tmp/rebuilderdA70WR8/inputs/scip-doc_10.0.1+ds-1_all.deb
+++ /srv/rebuilderd/tmp/rebuilderdA70WR8/out/scip-doc_10.0.1+ds-1_all.deb
├── file list
│ @@ -1,3 +1,3 @@
│ -rw-r--r-- 0 0 0 4 2026-02-26 03:45:19.000000 debian-binary
│ --rw-r--r-- 0 0 0 82512 2026-02-26 03:45:19.000000 control.tar.xz
│ --rw-r--r-- 0 0 0 21895160 2026-02-26 03:45:19.000000 data.tar.xz
│ +-rw-r--r-- 0 0 0 82456 2026-02-26 03:45:19.000000 control.tar.xz
│ +-rw-r--r-- 0 0 0 21895208 2026-02-26 03:45:19.000000 data.tar.xz
├── control.tar.xz
│ ├── control.tar
│ │ ├── ./md5sums
│ │ │ ├── ./md5sums
│ │ │ │┄ Files differ
├── data.tar.xz
│ ├── data.tar
│ │ ├── ./usr/share/doc/scip/html/SHELL.html
│ │ │ @@ -183,49 +183,49 @@
│ │ │ presolving (3 rounds: 3 fast, 2 medium, 2 exhaustive):
│ │ │ 2 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
│ │ │ 0 implications, 0 cliques, 0 implied integral variables (0 bin, 0 int, 0 cont)
│ │ │ presolved problem has 27 variables (27 bin, 0 int, 0 cont) and 118 constraints
│ │ │ 1 constraints of type <knapsack>
│ │ │ 117 constraints of type <logicor>
│ │ │ transformed objective value is always integral (scale: 1)
│ │ │ -Presolving Time: 0.01
│ │ │ +Presolving Time: 0.00
│ │ │ transformed 1/1 original solutions to the transformed problem space
│ │ │
│ │ │ time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
│ │ │ i 0.0s| 1 | 0 | 0 | - | oneopt| 0 | 27 | 118 | 117 | 0 | 0 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ 0.0s| 1 | 0 | 27 | - | 2093k | 0 | 27 | 118 | 117 | 0 | 0 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ r 0.0s| 1 | 0 | 27 | - |randroun| 0 | 27 | 118 | 117 | 0 | 0 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ 0.0s| 1 | 0 | 56 | - | 2337k | 0 | 27 | 118 | 120 | 3 | 1 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ 0.0s| 1 | 0 | 97 | - | 2476k | 0 | 27 | 118 | 122 | 5 | 2 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ 0.0s| 1 | 0 | 109 | - | 2840k | 0 | 27 | 118 | 123 | 6 | 3 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ 0.0s| 1 | 0 | 113 | - | 3413k | 0 | 27 | 118 | 125 | 8 | 4 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ r 0.0s| 1 | 0 | 113 | - |randroun| 0 | 27 | 118 | 125 | 0 | 4 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ 0.0s| 1 | 0 | 122 | - | 3738k | 0 | 27 | 118 | 126 | 9 | 5 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ 0.0s| 1 | 0 | 143 | - | 4458k | 0 | 27 | 118 | 128 | 11 | 6 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ r 0.0s| 1 | 0 | 143 | - |rounding| 0 | 27 | 118 | 128 | 11 | 6 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ - 0.1s| 1 | 0 | 157 | - | 5515k | 0 | 27 | 118 | 130 | 13 | 7 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ - 0.1s| 1 | 0 | 166 | - | 6034k | 0 | 27 | 118 | 131 | 14 | 8 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ + 0.0s| 1 | 0 | 157 | - | 5515k | 0 | 27 | 118 | 130 | 13 | 7 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ + 0.0s| 1 | 0 | 166 | - | 6034k | 0 | 27 | 118 | 131 | 14 | 8 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 181 | - | 7103k | 0 | 27 | 118 | 132 | 15 | 9 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 197 | - | 7932k | 0 | 27 | 118 | 133 | 16 | 10 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
│ │ │ 0.1s| 1 | 0 | 207 | - | 7947k | 0 | 27 | 118 | 134 | 18 | 11 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 214 | - | 7960k | 0 | 27 | 118 | 137 | 21 | 12 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 220 | - | 7974k | 0 | 27 | 118 | 139 | 23 | 13 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ r 0.1s| 1 | 0 | 220 | - |randroun| 0 | 27 | 118 | 139 | 0 | 13 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 227 | - | 7990k | 0 | 27 | 118 | 140 | 24 | 14 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 238 | - | 8005k | 0 | 27 | 118 | 141 | 25 | 15 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 247 | - | 8020k | 0 | 27 | 118 | 142 | 26 | 16 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 250 | - | 8035k | 0 | 27 | 118 | 142 | 27 | 17 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 254 | - | 8035k | 0 | 27 | 118 | 143 | 28 | 18 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 2 | 254 | - | 8037k | 0 | 27 | 118 | 143 | 28 | 18 | 0 | 11 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ r 0.3s| 88 | 13 | 1138 | 10.2 |shifting| 12 | 27 | 118 | 134 | 76 | 1 | 7 | 129 | 1.538095e+01 | 1.800000e+01 | 17.03%| 82.91%
│ │ │ - 0.4s| 100 | 13 | 1311 | 10.7 | 14M | 13 | 27 | 118 | 137 | 97 | 0 | 8 | 130 | 1.538095e+01 | 1.800000e+01 | 17.03%| 83.10%
│ │ │ + 0.3s| 100 | 13 | 1311 | 10.7 | 14M | 13 | 27 | 118 | 137 | 97 | 0 | 8 | 130 | 1.538095e+01 | 1.800000e+01 | 17.03%| 83.10%
│ │ │
│ │ │ SCIP Status : problem is solved [optimal solution found]
│ │ │ -Solving Time (sec) : 0.45
│ │ │ +Solving Time (sec) : 0.35
│ │ │ Solving Nodes : 155
│ │ │ Primal Bound : +1.80000000000000e+01 (213 solutions)
│ │ │ Dual Bound : +1.80000000000000e+01
│ │ │ Gap : 0.00 %
│ │ │
│ │ │ SCIP> display solution
│ │ │
│ │ │ @@ -339,17 +339,17 @@
│ │ │ mpec d -2050000 50 0 regularization heuristic for convex and nonconvex MINLPs
│ │ │ multistart L -2100000 0 0 multistart heuristic for convex and nonconvex MINLPs
│ │ │ trysol t -3000010 1 0 try solution heuristic
│ │ │
│ │ │ SCIP> display statistics
│ │ │
│ │ │ SCIP Status : problem is solved [optimal solution found]
│ │ │ -Total Time : 0.46
│ │ │ - solving : 0.45
│ │ │ - presolving : 0.01 (included in solving)
│ │ │ +Total Time : 0.35
│ │ │ + solving : 0.35
│ │ │ + presolving : 0.00 (included in solving)
│ │ │ reading : 0.00
│ │ │ copying : 0.01 (2 #copies) (minimal 0.00, maximal 0.00, average 0.00)
│ │ │ Original Problem :
│ │ │ Problem name : check/instances/MIP/stein27.fzn
│ │ │ Variables : 29 (29 binary, 0 integer, 0 continuous)
│ │ │ Implied int vars : 0 (0 binary, 0 integer, 0 continuous)
│ │ │ Constraints : 118 initial, 118 maximal
│ │ │ @@ -395,15 +395,15 @@
│ │ │ integral : 0 0 0 0 91 0 0 292 0 0 38 0 0 1 154
│ │ │ knapsack : 1 1 0 890 0 0 0 288 0 1 0 0 0 0 0
│ │ │ logicor : 117+ 119 18 671 0 0 0 286 26 10 202 0 0 0 0
│ │ │ fixedvar : 0 0 0 0 0 0 0 215 0 0 0 0 0 0 0
│ │ │ countsols : 0 0 0 0 0 0 0 215 0 0 0 0 0 0 0
│ │ │ components : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
│ │ │ Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS EnfoRelax Check ResProp SB-Prop
│ │ │ - integral : 0.06 0.00 0.00 0.00 0.06 0.00 0.00 0.00 0.00 0.00
│ │ │ + integral : 0.05 0.00 0.00 0.00 0.05 0.00 0.00 0.00 0.00 0.00
│ │ │ knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
│ │ │ logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
│ │ │ fixedvar : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
│ │ │ countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
│ │ │ components : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
│ │ │ Propagators : #Propagate #ResProp Cutoffs DomReds
│ │ │ dualfix : 2 0 0 0
│ │ │ @@ -441,38 +441,38 @@
│ │ │ pseudo solution : 0.00 0 0 - 0 0.0 0 0.0 - - -
│ │ │ applied globally : 0.00 - - 0 1 3.0 - - 0 - -
│ │ │ applied locally : - - - 0 8 8.5 - - 0 - -
│ │ │ Gen. Resolution CA : Time Calls Success Conflicts LargeCoef LongConfs Length
│ │ │ propagation : 0.00 0 0 0 0 0 0.0
│ │ │ Separators : ExecTime SetupTime Calls RootCalls Cutoffs DomReds FoundCuts ViaPoolAdd DirectAdd Applied ViaPoolApp DirectApp Conss
│ │ │ cut pool : 0.01 - 161 35 - - 2427 4123 - - - - - (maximal pool size: 2414)
│ │ │ - aggregation : 0.04 0.00 82 18 0 0 1 1 0 0 0 0 0
│ │ │ + aggregation : 0.03 0.00 82 18 0 0 1 1 0 0 0 0 0
│ │ │ > cmir : - - - - - - - 1 0 0 0 0 -
│ │ │ > flowcover : - - - - - - - 0 0 0 0 0 -
│ │ │ > knapsackcover : - - - - - - - 0 0 0 0 0 -
│ │ │ cgmip : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ clique : 0.00 0.00 1 1 0 0 0 0 0 0 0 0 0
│ │ │ closecuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ convexproj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ disjunctive : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ eccuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ flower : 0.00 0.00 21 18 0 0 0 0 0 0 0 0 0
│ │ │ gauge : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ - gomory : 0.21 0.00 72 10 0 0 2345 3978 0 85 85 0 0
│ │ │ + gomory : 0.14 0.00 72 10 0 0 2345 3978 0 85 85 0 0
│ │ │ > gomorymi : - - - - - - - 1786 0 51 51 0 -
│ │ │ > strongcg : - - - - - - - 2192 0 34 34 0 -
│ │ │ impliedbounds : 0.00 0.00 82 18 0 0 0 0 0 0 0 0 0
│ │ │ interminor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ intobj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ lagromory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ mcf : 0.00 0.00 1 1 0 0 0 0 0 0 0 0 0
│ │ │ minor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ mixing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ oddcycle : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ - rapidlearning : 0.03 0.00 1 1 0 0 0 0 0 0 0 0 0
│ │ │ + rapidlearning : 0.02 0.00 1 1 0 0 0 0 0 0 0 0 0
│ │ │ rlt : 0.00 0.00 10 10 0 0 0 0 0 0 0 0 0
│ │ │ zerohalf : 0.01 0.00 80 18 0 0 80 144 0 19 19 0 0
│ │ │ Cutselectors : ExecTime SetupTime Calls RootCalls Selected Forced Filtered RootSelec RootForc RootFilt
│ │ │ hybrid : 0.00 0.00 82 18 104 0 4019 28 0 2057
│ │ │ ensemble : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ dynamic : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ Pricers : ExecTime SetupTime Calls Vars
│ │ │ @@ -487,24 +487,24 @@
│ │ │ leastinf : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ lookahead : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ mostinf : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ multaggr : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ nodereopt : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ pscost : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ random : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ - relpscost : 0.06 0.00 91 0 0 0 38 0 1 154
│ │ │ + relpscost : 0.05 0.00 91 0 0 0 38 0 1 154
│ │ │ vanillafullstrong: 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ Primal Heuristics : ExecTime SetupTime Calls Found Best
│ │ │ LP solutions : 0.00 - - 0 0
│ │ │ relax solutions : 0.00 - - 0 0
│ │ │ pseudo solutions : 0.00 - - 0 0
│ │ │ strong branching : 0.00 - - 89 0
│ │ │ actconsdiving : 0.00 0.00 0 0 0
│ │ │ adaptivediving : 0.00 0.00 1 0 0
│ │ │ - alns : 0.01 0.00 1 0 0
│ │ │ + alns : 0.00 0.00 1 0 0
│ │ │ bound : 0.00 0.00 0 0 0
│ │ │ clique : 0.00 0.00 0 0 0
│ │ │ coefdiving : 0.00 0.00 0 0 0
│ │ │ completesol : 0.00 0.00 0 0 0
│ │ │ conflictdiving : 0.00 0.00 1 0 0
│ │ │ crossover : 0.00 0.00 0 0 0
│ │ │ dins : 0.00 0.00 0 0 0
│ │ │ @@ -533,15 +533,15 @@
│ │ │ objpscostdiving : 0.00 0.00 0 0 0
│ │ │ octane : 0.00 0.00 0 0 0
│ │ │ ofins : 0.00 0.00 0 0 0
│ │ │ oneopt : 0.00 0.00 6 1 1
│ │ │ padm : 0.00 0.00 0 0 0
│ │ │ proximity : 0.00 0.00 0 0 0
│ │ │ pscostdiving : 0.00 0.00 1 0 0
│ │ │ - randrounding : 0.00 0.00 95 21 0
│ │ │ + randrounding : 0.01 0.00 95 21 0
│ │ │ rens : 0.00 0.00 0 0 0
│ │ │ reoptsols : 0.00 0.00 0 0 0
│ │ │ repair : 0.00 0.00 0 0 0
│ │ │ rins : 0.00 0.00 0 0 0
│ │ │ rootsoldiving : 0.00 0.00 0 0 0
│ │ │ rounding : 0.00 0.00 173 1 1
│ │ │ scheduler : 0.00 0.00 0 0 0
│ │ │ @@ -568,20 +568,20 @@
│ │ │ crossover : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
│ │ │ proximity : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
│ │ │ zeroobjective : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
│ │ │ dins : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
│ │ │ trustregion : 0 0.00 0.00 0 0 0 0.00000 0.00000 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 0
│ │ │ LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
│ │ │ primal LP : 0.00 32 0 0.00 - 0.00 32
│ │ │ - dual LP : 0.03 230 1522 6.62 45790.96 0.00 0
│ │ │ + dual LP : 0.03 230 1522 6.62 54163.70 0.00 0
│ │ │ lex dual LP : 0.00 0 0 0.00 -
│ │ │ barrier LP : 0.00 0 0 0.00 - 0.00 0
│ │ │ resolve instable : 0.00 0 0 0.00 -
│ │ │ diving/probing LP: 0.00 15 67 4.47 -
│ │ │ - strong branching : 0.04 130 2034 15.65 53936.52 - - 0
│ │ │ + strong branching : 0.03 130 2034 15.65 62490.40 - - 0
│ │ │ (at root node) : - 11 471 42.82 -
│ │ │ conflict analysis: 0.00 5 18 3.60 -
│ │ │ Relaxators : Time Calls Cutoffs ImprBounds ImprTime ReducedDom Separated AddedConss
│ │ │ benders : 0.00 0 0 0 0.00 0 0 0
│ │ │ B&B Tree :
│ │ │ number of runs : 1
│ │ │ nodes : 155 (77 internal, 78 leaves)
│ │ │ @@ -597,29 +597,29 @@
│ │ │ nodes exc. ref. : 0 (0.0%)
│ │ │ delayed cutoffs : 0
│ │ │ repropagations : 2 (4 domain reductions, 0 cutoffs)
│ │ │ avg switch length: 4.45
│ │ │ switching time : 0.00
│ │ │ Root Node :
│ │ │ First LP value : +1.30000000000000e+01
│ │ │ - First LP Iters : 27 (76487.25 Iter/sec)
│ │ │ + First LP Iters : 27 (88815.79 Iter/sec)
│ │ │ First LP Time : 0.00
│ │ │ Final Dual Bound : +1.30000000000000e+01
│ │ │ Final Root Iters : 254
│ │ │ Root LP Estimate : +1.78374113302465e+01
│ │ │ Solution :
│ │ │ Solutions found : 213 (3 improvements)
│ │ │ First Solution : +2.70000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
│ │ │ Gap First Sol. : infinite
│ │ │ Gap Last Sol. : 17.03 %
│ │ │ - Primal Bound : +1.80000000000000e+01 (in run 1, after 88 nodes, 0.35 seconds, depth 10, found by <shifting>)
│ │ │ + Primal Bound : +1.80000000000000e+01 (in run 1, after 88 nodes, 0.27 seconds, depth 10, found by <shifting>)
│ │ │ Dual Bound : +1.80000000000000e+01
│ │ │ Gap : 0.00 %
│ │ │ Integrals : Total Avg%
│ │ │ - primal-dual : 10.08 22.17
│ │ │ + primal-dual : 7.76 22.48
│ │ │ primal-ref : - - (not evaluated)
│ │ │ dual-ref : - - (not evaluated)
│ │ │
│ │ │ The statistics obtained via "display statistics" are quite comprehensive, thus, we just explain a few lines here. Information is grouped by the plugin type. For the primal heuristics, the execution time in seconds is shown as well as the number of calls to the heuristic, and its success regarding the number of (best) solutions found by that heuristic. Appropriate statistics are also shown for presolvers, constraint handlers, separators, propagators, the search tree, etc. User-written plugins will appear automatically in these statistics, after they were included into SCIP.
│ │ │
│ │ │ Changing parameters from the interactive shell
│ │ │ Now, we can start playing around with parameters. The primal heuristics Rounding and shifting seem to be quite successful on this instance, wondering what happens if we disable them? Or what happens, if we are even more rigorous and disable all heuristics? Or if we do the opposite and use aggressive heuristics?
│ │ │ @@ -788,31 +788,31 @@
│ │ │ 0.0s| 1 | 0 | 97 | - | 15M | 0 | 27 | 118 | 122 | 5 | 2 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ 0.0s| 1 | 0 | 109 | - | 15M | 0 | 27 | 118 | 123 | 6 | 3 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ 0.0s| 1 | 0 | 113 | - | 15M | 0 | 27 | 118 | 125 | 8 | 4 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ r 0.0s| 1 | 0 | 113 | - |randroun| 0 | 27 | 118 | 125 | 0 | 4 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ 0.0s| 1 | 0 | 122 | - | 15M | 0 | 27 | 118 | 126 | 9 | 5 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ 0.0s| 1 | 0 | 143 | - | 15M | 0 | 27 | 118 | 128 | 11 | 6 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ 0.0s| 1 | 0 | 157 | - | 15M | 0 | 27 | 118 | 130 | 13 | 7 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ - 0.1s| 1 | 0 | 166 | - | 15M | 0 | 27 | 118 | 131 | 14 | 8 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ + 0.0s| 1 | 0 | 166 | - | 15M | 0 | 27 | 118 | 131 | 14 | 8 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ * 0.1s| 1 | 0 | 166 | - | LP | 0 | 27 | 118 | 131 | 14 | 8 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 181 | - | 15M | 0 | 27 | 318 | 132 | 15 | 9 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 197 | - | 15M | 0 | 27 | 318 | 133 | 16 | 10 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
│ │ │ 0.1s| 1 | 0 | 207 | - | 15M | 0 | 27 | 318 | 134 | 18 | 11 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 214 | - | 15M | 0 | 27 | 318 | 137 | 21 | 12 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 220 | - | 15M | 0 | 27 | 318 | 139 | 23 | 13 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 227 | - | 15M | 0 | 27 | 318 | 140 | 24 | 14 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 238 | - | 15M | 0 | 27 | 318 | 141 | 25 | 15 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 247 | - | 15M | 0 | 27 | 318 | 142 | 26 | 16 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 250 | - | 15M | 0 | 27 | 318 | 142 | 27 | 17 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 254 | - | 15M | 0 | 27 | 318 | 143 | 28 | 18 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ - 0.2s| 1 | 2 | 254 | - | 15M | 0 | 27 | 318 | 143 | 28 | 18 | 0 | 13 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ + 0.1s| 1 | 2 | 254 | - | 15M | 0 | 27 | 318 | 143 | 28 | 18 | 0 | 13 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │
│ │ │ SCIP Status : problem is solved [optimal solution found]
│ │ │ -Solving Time (sec) : 0.39
│ │ │ +Solving Time (sec) : 0.30
│ │ │ Solving Nodes : 99
│ │ │ Primal Bound : +1.80000000000000e+01 (174 solutions)
│ │ │ Dual Bound : +1.80000000000000e+01
│ │ │ Gap : 0.00 %
│ │ │
│ │ │ We can navigate through the menus step-by-step and get a list of available options and submenus. Therefore, we select "set" to change settings, "heuristics" to change settings of primal heuristics, and "shifting" for that particular heuristic. Then we see a list of parameters (and yet another submenu for advanced parameters), and disable this heuristic by setting its calling frequency to -1. If we already know the path to a certain setting, we can directly type it (as for the rounding heuristic in the above example). Note that we do not have to use the full names, but we may use short versions, as long as they are unique.
│ │ │ To solve a problem a second time, we have to read it in again before starting the optimization process.
│ │ │ @@ -957,33 +957,33 @@
│ │ │ 0.0s| 1 | 0 | 109 | - | 15M | 0 | 27 | 118 | 123 | 6 | 3 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ 0.0s| 1 | 0 | 113 | - | 15M | 0 | 27 | 118 | 125 | 8 | 4 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ r 0.0s| 1 | 0 | 113 | - |randroun| 0 | 27 | 118 | 125 | 0 | 4 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ 0.0s| 1 | 0 | 122 | - | 15M | 0 | 27 | 118 | 126 | 9 | 5 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ 0.0s| 1 | 0 | 143 | - | 15M | 0 | 27 | 118 | 128 | 11 | 6 | 0 | 0 | 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ r 0.0s| 1 | 0 | 143 | - |rounding| 0 | 27 | 118 | 128 | 11 | 6 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.0s| 1 | 0 | 157 | - | 15M | 0 | 27 | 118 | 130 | 13 | 7 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ - 0.1s| 1 | 0 | 166 | - | 15M | 0 | 27 | 118 | 131 | 14 | 8 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ + 0.0s| 1 | 0 | 166 | - | 15M | 0 | 27 | 118 | 131 | 14 | 8 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 181 | - | 15M | 0 | 27 | 318 | 132 | 15 | 9 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 197 | - | 15M | 0 | 27 | 318 | 133 | 16 | 10 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
│ │ │ 0.1s| 1 | 0 | 207 | - | 15M | 0 | 27 | 318 | 134 | 18 | 11 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 214 | - | 15M | 0 | 27 | 318 | 137 | 21 | 12 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 220 | - | 15M | 0 | 27 | 318 | 139 | 23 | 13 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ r 0.1s| 1 | 0 | 220 | - |randroun| 0 | 27 | 318 | 139 | 0 | 13 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 227 | - | 15M | 0 | 27 | 318 | 140 | 24 | 14 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 238 | - | 15M | 0 | 27 | 318 | 141 | 25 | 15 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 247 | - | 15M | 0 | 27 | 318 | 142 | 26 | 16 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 250 | - | 15M | 0 | 27 | 318 | 142 | 27 | 17 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.1s| 1 | 0 | 254 | - | 15M | 0 | 27 | 318 | 143 | 28 | 18 | 0 | 0 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ 0.2s| 1 | 2 | 254 | - | 15M | 0 | 27 | 318 | 143 | 28 | 18 | 0 | 12 | 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ - 0.5s| 100 | 7 | 1084 | 8.4 | 15M | 12 | 27 | 259 | 138 | 59 | 0 | 12 | 136 | 1.480952e+01 | 1.800000e+01 | 21.54%| 79.34%
│ │ │ -r 0.5s| 114 | 5 | 1202 | 8.4 |shifting| 15 | 27 | 259 | 135 | 63 | 0 | 12 | 136 | 1.547619e+01 | 1.800000e+01 | 16.31%| 81.26%
│ │ │ + 0.4s| 100 | 7 | 1084 | 8.4 | 15M | 12 | 27 | 259 | 138 | 59 | 0 | 12 | 136 | 1.480952e+01 | 1.800000e+01 | 21.54%| 79.34%
│ │ │ +r 0.4s| 114 | 5 | 1202 | 8.4 |shifting| 15 | 27 | 259 | 135 | 63 | 0 | 12 | 136 | 1.547619e+01 | 1.800000e+01 | 16.31%| 81.26%
│ │ │
│ │ │ SCIP Status : problem is solved [optimal solution found]
│ │ │ -Solving Time (sec) : 0.64
│ │ │ +Solving Time (sec) : 0.53
│ │ │ Solving Nodes : 171
│ │ │ Primal Bound : +1.80000000000000e+01 (358 solutions)
│ │ │ Dual Bound : +1.80000000000000e+01
│ │ │ Gap : 0.00 %
│ │ │
│ │ │ Okay, what happened here? First, we reset all parameters to their default values, using "set default". Next, we loaded some meta-parameter settings (also see the FAQ), to apply primal heuristics more aggressively. SCIP shows us, which single parameters it changed therefore. Additionally, for pedagogical purposes, we set the node limit to 200. Now, the optimal solution is already found at the root node, by a heuristic which is deactivated by default. Then, after node 200, the user defined node limit is reached which interrupts the solving process, We see that now in the short status report, primal and dual bound are different, thus, the problem is not solved yet. Nevertheless, we could access statistics, see the current incumbent solution, change parameters and so on. Entering "optimize" we continue the solving process from the point on at which it has been interrupted.
│ │ │ Once you found a non-default parameter setting that you wish to save and use in the future, use either the command
│ │ │ ├── html2text {}
│ │ │ │ @@ -107,15 +107,15 @@
│ │ │ │ 2 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds,
│ │ │ │ 0 added holes, 0 changed sides, 0 changed coefficients
│ │ │ │ 0 implications, 0 cliques, 0 implied integral variables (0 bin, 0 int, 0 cont)
│ │ │ │ presolved problem has 27 variables (27 bin, 0 int, 0 cont) and 118 constraints
│ │ │ │ 1 constraints of type
│ │ │ │ 117 constraints of type
│ │ │ │ transformed objective value is always integral (scale: 1)
│ │ │ │ -Presolving Time: 0.01
│ │ │ │ +Presolving Time: 0.00
│ │ │ │ transformed 1/1 original solutions to the transformed problem space
│ │ │ │ time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts
│ │ │ │ |sepa|confs|strbr| dualbound | primalbound | gap | compl.
│ │ │ │ i 0.0s| 1 | 0 | 0 | - | oneopt| 0 | 27 | 118 | 117 | 0 | 0 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ │ 0.0s| 1 | 0 | 27 | - | 2093k | 0 | 27 | 118 | 117 | 0 | 0 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ │ @@ -133,17 +133,17 @@
│ │ │ │ 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ │ 0.0s| 1 | 0 | 122 | - | 3738k | 0 | 27 | 118 | 126 | 9 | 5 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ │ 0.0s| 1 | 0 | 143 | - | 4458k | 0 | 27 | 118 | 128 | 11 | 6 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ │ r 0.0s| 1 | 0 | 143 | - |rounding| 0 | 27 | 118 | 128 | 11 | 6 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ -0.1s| 1 | 0 | 157 | - | 5515k | 0 | 27 | 118 | 130 | 13 | 7 | 0 | 0 |
│ │ │ │ +0.0s| 1 | 0 | 157 | - | 5515k | 0 | 27 | 118 | 130 | 13 | 7 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ -0.1s| 1 | 0 | 166 | - | 6034k | 0 | 27 | 118 | 131 | 14 | 8 | 0 | 0 |
│ │ │ │ +0.0s| 1 | 0 | 166 | - | 6034k | 0 | 27 | 118 | 131 | 14 | 8 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ 0.1s| 1 | 0 | 181 | - | 7103k | 0 | 27 | 118 | 132 | 15 | 9 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ 0.1s| 1 | 0 | 197 | - | 7932k | 0 | 27 | 118 | 133 | 16 | 10 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts
│ │ │ │ |sepa|confs|strbr| dualbound | primalbound | gap | compl.
│ │ │ │ @@ -165,18 +165,18 @@
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ 0.1s| 1 | 0 | 254 | - | 8035k | 0 | 27 | 118 | 143 | 28 | 18 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ 0.1s| 1 | 2 | 254 | - | 8037k | 0 | 27 | 118 | 143 | 28 | 18 | 0 | 11 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ r 0.3s| 88 | 13 | 1138 | 10.2 |shifting| 12 | 27 | 118 | 134 | 76 | 1 | 7 | 129
│ │ │ │ | 1.538095e+01 | 1.800000e+01 | 17.03%| 82.91%
│ │ │ │ -0.4s| 100 | 13 | 1311 | 10.7 | 14M | 13 | 27 | 118 | 137 | 97 | 0 | 8 | 130 |
│ │ │ │ +0.3s| 100 | 13 | 1311 | 10.7 | 14M | 13 | 27 | 118 | 137 | 97 | 0 | 8 | 130 |
│ │ │ │ 1.538095e+01 | 1.800000e+01 | 17.03%| 83.10%
│ │ │ │ SCIP Status : problem is solved [optimal solution found]
│ │ │ │ -Solving Time (sec) : 0.45
│ │ │ │ +Solving Time (sec) : 0.35
│ │ │ │ Solving Nodes : 155
│ │ │ │ Primal Bound : +1.80000000000000e+01 (213 solutions)
│ │ │ │ Dual Bound : +1.80000000000000e+01
│ │ │ │ Gap : 0.00 %
│ │ │ │ SCIP> display solution
│ │ │ │ objective value: 18
│ │ │ │ true 1 (obj:0)
│ │ │ │ @@ -357,17 +357,17 @@
│ │ │ │ subnlp L -2000010 1 0 primal heuristic that performs a local search in an NLP
│ │ │ │ after fixing integer variables and presolving
│ │ │ │ mpec d -2050000 50 0 regularization heuristic for convex and nonconvex MINLPs
│ │ │ │ multistart L -2100000 0 0 multistart heuristic for convex and nonconvex MINLPs
│ │ │ │ trysol t -3000010 1 0 try solution heuristic
│ │ │ │ SCIP> display statistics
│ │ │ │ SCIP Status : problem is solved [optimal solution found]
│ │ │ │ -Total Time : 0.46
│ │ │ │ -solving : 0.45
│ │ │ │ -presolving : 0.01 (included in solving)
│ │ │ │ +Total Time : 0.35
│ │ │ │ +solving : 0.35
│ │ │ │ +presolving : 0.00 (included in solving)
│ │ │ │ reading : 0.00
│ │ │ │ copying : 0.01 (2 #copies) (minimal 0.00, maximal 0.00, average 0.00)
│ │ │ │ Original Problem :
│ │ │ │ Problem name : check/instances/MIP/stein27.fzn
│ │ │ │ Variables : 29 (29 binary, 0 integer, 0 continuous)
│ │ │ │ Implied int vars : 0 (0 binary, 0 integer, 0 continuous)
│ │ │ │ Constraints : 118 initial, 118 maximal
│ │ │ │ @@ -416,15 +416,15 @@
│ │ │ │ knapsack : 1 1 0 890 0 0 0 288 0 1 0 0 0 0 0
│ │ │ │ logicor : 117+ 119 18 671 0 0 0 286 26 10 202 0 0 0 0
│ │ │ │ fixedvar : 0 0 0 0 0 0 0 215 0 0 0 0 0 0 0
│ │ │ │ countsols : 0 0 0 0 0 0 0 215 0 0 0 0 0 0 0
│ │ │ │ components : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
│ │ │ │ Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS
│ │ │ │ EnfoRelax Check ResProp SB-Prop
│ │ │ │ -integral : 0.06 0.00 0.00 0.00 0.06 0.00 0.00 0.00 0.00 0.00
│ │ │ │ +integral : 0.05 0.00 0.00 0.00 0.05 0.00 0.00 0.00 0.00 0.00
│ │ │ │ knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
│ │ │ │ logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
│ │ │ │ fixedvar : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
│ │ │ │ countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
│ │ │ │ components : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
│ │ │ │ Propagators : #Propagate #ResProp Cutoffs DomReds
│ │ │ │ dualfix : 2 0 0 0
│ │ │ │ @@ -464,38 +464,38 @@
│ │ │ │ applied globally : 0.00 - - 0 1 3.0 - - 0 - -
│ │ │ │ applied locally : - - - 0 8 8.5 - - 0 - -
│ │ │ │ Gen. Resolution CA : Time Calls Success Conflicts LargeCoef LongConfs Length
│ │ │ │ propagation : 0.00 0 0 0 0 0 0.0
│ │ │ │ Separators : ExecTime SetupTime Calls RootCalls Cutoffs DomReds FoundCuts
│ │ │ │ ViaPoolAdd DirectAdd Applied ViaPoolApp DirectApp Conss
│ │ │ │ cut pool : 0.01 - 161 35 - - 2427 4123 - - - - - (maximal pool size: 2414)
│ │ │ │ -aggregation : 0.04 0.00 82 18 0 0 1 1 0 0 0 0 0
│ │ │ │ +aggregation : 0.03 0.00 82 18 0 0 1 1 0 0 0 0 0
│ │ │ │ > cmir : - - - - - - - 1 0 0 0 0 -
│ │ │ │ > flowcover : - - - - - - - 0 0 0 0 0 -
│ │ │ │ > knapsackcover : - - - - - - - 0 0 0 0 0 -
│ │ │ │ cgmip : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ │ clique : 0.00 0.00 1 1 0 0 0 0 0 0 0 0 0
│ │ │ │ closecuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ │ convexproj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ │ disjunctive : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ │ eccuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ │ flower : 0.00 0.00 21 18 0 0 0 0 0 0 0 0 0
│ │ │ │ gauge : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ │ -gomory : 0.21 0.00 72 10 0 0 2345 3978 0 85 85 0 0
│ │ │ │ +gomory : 0.14 0.00 72 10 0 0 2345 3978 0 85 85 0 0
│ │ │ │ > gomorymi : - - - - - - - 1786 0 51 51 0 -
│ │ │ │ > strongcg : - - - - - - - 2192 0 34 34 0 -
│ │ │ │ impliedbounds : 0.00 0.00 82 18 0 0 0 0 0 0 0 0 0
│ │ │ │ interminor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ │ intobj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ │ lagromory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ │ mcf : 0.00 0.00 1 1 0 0 0 0 0 0 0 0 0
│ │ │ │ minor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ │ mixing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ │ oddcycle : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
│ │ │ │ -rapidlearning : 0.03 0.00 1 1 0 0 0 0 0 0 0 0 0
│ │ │ │ +rapidlearning : 0.02 0.00 1 1 0 0 0 0 0 0 0 0 0
│ │ │ │ rlt : 0.00 0.00 10 10 0 0 0 0 0 0 0 0 0
│ │ │ │ zerohalf : 0.01 0.00 80 18 0 0 80 144 0 19 19 0 0
│ │ │ │ Cutselectors : ExecTime SetupTime Calls RootCalls Selected Forced Filtered
│ │ │ │ RootSelec RootForc RootFilt
│ │ │ │ hybrid : 0.00 0.00 82 18 104 0 4019 28 0 2057
│ │ │ │ ensemble : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ │ dynamic : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ │ @@ -512,24 +512,24 @@
│ │ │ │ leastinf : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ │ lookahead : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ │ mostinf : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ │ multaggr : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ │ nodereopt : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ │ pscost : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ │ random : 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ │ -relpscost : 0.06 0.00 91 0 0 0 38 0 1 154
│ │ │ │ +relpscost : 0.05 0.00 91 0 0 0 38 0 1 154
│ │ │ │ vanillafullstrong: 0.00 0.00 0 0 0 0 0 0 0 0
│ │ │ │ Primal Heuristics : ExecTime SetupTime Calls Found Best
│ │ │ │ LP solutions : 0.00 - - 0 0
│ │ │ │ relax solutions : 0.00 - - 0 0
│ │ │ │ pseudo solutions : 0.00 - - 0 0
│ │ │ │ strong branching : 0.00 - - 89 0
│ │ │ │ actconsdiving : 0.00 0.00 0 0 0
│ │ │ │ adaptivediving : 0.00 0.00 1 0 0
│ │ │ │ -alns : 0.01 0.00 1 0 0
│ │ │ │ +alns : 0.00 0.00 1 0 0
│ │ │ │ bound : 0.00 0.00 0 0 0
│ │ │ │ clique : 0.00 0.00 0 0 0
│ │ │ │ coefdiving : 0.00 0.00 0 0 0
│ │ │ │ completesol : 0.00 0.00 0 0 0
│ │ │ │ conflictdiving : 0.00 0.00 1 0 0
│ │ │ │ crossover : 0.00 0.00 0 0 0
│ │ │ │ dins : 0.00 0.00 0 0 0
│ │ │ │ @@ -558,15 +558,15 @@
│ │ │ │ objpscostdiving : 0.00 0.00 0 0 0
│ │ │ │ octane : 0.00 0.00 0 0 0
│ │ │ │ ofins : 0.00 0.00 0 0 0
│ │ │ │ oneopt : 0.00 0.00 6 1 1
│ │ │ │ padm : 0.00 0.00 0 0 0
│ │ │ │ proximity : 0.00 0.00 0 0 0
│ │ │ │ pscostdiving : 0.00 0.00 1 0 0
│ │ │ │ -randrounding : 0.00 0.00 95 21 0
│ │ │ │ +randrounding : 0.01 0.00 95 21 0
│ │ │ │ rens : 0.00 0.00 0 0 0
│ │ │ │ reoptsols : 0.00 0.00 0 0 0
│ │ │ │ repair : 0.00 0.00 0 0 0
│ │ │ │ rins : 0.00 0.00 0 0 0
│ │ │ │ rootsoldiving : 0.00 0.00 0 0 0
│ │ │ │ rounding : 0.00 0.00 173 1 1
│ │ │ │ scheduler : 0.00 0.00 0 0 0
│ │ │ │ @@ -600,20 +600,20 @@
│ │ │ │ zeroobjective : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0
│ │ │ │ 0 0 0 0 1
│ │ │ │ dins : 0 0.00 0.00 0 0 0 0.00000 0.12500 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
│ │ │ │ trustregion : 0 0.00 0.00 0 0 0 0.00000 0.00000 -1.00000 1.00000 0.900 0 0 0 0
│ │ │ │ 0 0 0 0
│ │ │ │ LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
│ │ │ │ primal LP : 0.00 32 0 0.00 - 0.00 32
│ │ │ │ -dual LP : 0.03 230 1522 6.62 45790.96 0.00 0
│ │ │ │ +dual LP : 0.03 230 1522 6.62 54163.70 0.00 0
│ │ │ │ lex dual LP : 0.00 0 0 0.00 -
│ │ │ │ barrier LP : 0.00 0 0 0.00 - 0.00 0
│ │ │ │ resolve instable : 0.00 0 0 0.00 -
│ │ │ │ diving/probing LP: 0.00 15 67 4.47 -
│ │ │ │ -strong branching : 0.04 130 2034 15.65 53936.52 - - 0
│ │ │ │ +strong branching : 0.03 130 2034 15.65 62490.40 - - 0
│ │ │ │ (at root node) : - 11 471 42.82 -
│ │ │ │ conflict analysis: 0.00 5 18 3.60 -
│ │ │ │ Relaxators : Time Calls Cutoffs ImprBounds ImprTime ReducedDom Separated
│ │ │ │ AddedConss
│ │ │ │ benders : 0.00 0 0 0 0.00 0 0 0
│ │ │ │ B&B Tree :
│ │ │ │ number of runs : 1
│ │ │ │ @@ -630,31 +630,31 @@
│ │ │ │ nodes exc. ref. : 0 (0.0%)
│ │ │ │ delayed cutoffs : 0
│ │ │ │ repropagations : 2 (4 domain reductions, 0 cutoffs)
│ │ │ │ avg switch length: 4.45
│ │ │ │ switching time : 0.00
│ │ │ │ Root Node :
│ │ │ │ First LP value : +1.30000000000000e+01
│ │ │ │ -First LP Iters : 27 (76487.25 Iter/sec)
│ │ │ │ +First LP Iters : 27 (88815.79 Iter/sec)
│ │ │ │ First LP Time : 0.00
│ │ │ │ Final Dual Bound : +1.30000000000000e+01
│ │ │ │ Final Root Iters : 254
│ │ │ │ Root LP Estimate : +1.78374113302465e+01
│ │ │ │ Solution :
│ │ │ │ Solutions found : 213 (3 improvements)
│ │ │ │ First Solution : +2.70000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds,
│ │ │ │ depth 0, found by )
│ │ │ │ Gap First Sol. : infinite
│ │ │ │ Gap Last Sol. : 17.03 %
│ │ │ │ -Primal Bound : +1.80000000000000e+01 (in run 1, after 88 nodes, 0.35 seconds,
│ │ │ │ +Primal Bound : +1.80000000000000e+01 (in run 1, after 88 nodes, 0.27 seconds,
│ │ │ │ depth 10, found by )
│ │ │ │ Dual Bound : +1.80000000000000e+01
│ │ │ │ Gap : 0.00 %
│ │ │ │ Integrals : Total Avg%
│ │ │ │ -primal-dual : 10.08 22.17
│ │ │ │ +primal-dual : 7.76 22.48
│ │ │ │ primal-ref : - - (not evaluated)
│ │ │ │ dual-ref : - - (not evaluated)
│ │ │ │ The statistics obtained via "display statistics" are quite comprehensive, thus,
│ │ │ │ we just explain a few lines here. Information is grouped by the plugin type.
│ │ │ │ For the primal heuristics, the execution time in seconds is shown as well as
│ │ │ │ the number of calls to the heuristic, and its success regarding the number of
│ │ │ │ (best) solutions found by that heuristic. Appropriate statistics are also shown
│ │ │ │ @@ -874,15 +874,15 @@
│ │ │ │ 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ │ 0.0s| 1 | 0 | 122 | - | 15M | 0 | 27 | 118 | 126 | 9 | 5 | 0 | 0 | 1.300000e+01
│ │ │ │ | 1.900000e+01 | 46.15%| unknown
│ │ │ │ 0.0s| 1 | 0 | 143 | - | 15M | 0 | 27 | 118 | 128 | 11 | 6 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ │ 0.0s| 1 | 0 | 157 | - | 15M | 0 | 27 | 118 | 130 | 13 | 7 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ │ -0.1s| 1 | 0 | 166 | - | 15M | 0 | 27 | 118 | 131 | 14 | 8 | 0 | 0 |
│ │ │ │ +0.0s| 1 | 0 | 166 | - | 15M | 0 | 27 | 118 | 131 | 14 | 8 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ │ * 0.1s| 1 | 0 | 166 | - | LP | 0 | 27 | 118 | 131 | 14 | 8 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ 0.1s| 1 | 0 | 181 | - | 15M | 0 | 27 | 318 | 132 | 15 | 9 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ 0.1s| 1 | 0 | 197 | - | 15M | 0 | 27 | 318 | 133 | 16 | 10 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ @@ -900,18 +900,18 @@
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ 0.1s| 1 | 0 | 247 | - | 15M | 0 | 27 | 318 | 142 | 26 | 16 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ 0.1s| 1 | 0 | 250 | - | 15M | 0 | 27 | 318 | 142 | 27 | 17 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ 0.1s| 1 | 0 | 254 | - | 15M | 0 | 27 | 318 | 143 | 28 | 18 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ -0.2s| 1 | 2 | 254 | - | 15M | 0 | 27 | 318 | 143 | 28 | 18 | 0 | 13 |
│ │ │ │ +0.1s| 1 | 2 | 254 | - | 15M | 0 | 27 | 318 | 143 | 28 | 18 | 0 | 13 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ SCIP Status : problem is solved [optimal solution found]
│ │ │ │ -Solving Time (sec) : 0.39
│ │ │ │ +Solving Time (sec) : 0.30
│ │ │ │ Solving Nodes : 99
│ │ │ │ Primal Bound : +1.80000000000000e+01 (174 solutions)
│ │ │ │ Dual Bound : +1.80000000000000e+01
│ │ │ │ Gap : 0.00 %
│ │ │ │ We can navigate through the menus step-by-step and get a list of available
│ │ │ │ options and submenus. Therefore, we select "set" to change settings,
│ │ │ │ "heuristics" to change settings of primal heuristics, and "shifting" for that
│ │ │ │ @@ -1078,15 +1078,15 @@
│ │ │ │ | 1.900000e+01 | 46.15%| unknown
│ │ │ │ 0.0s| 1 | 0 | 143 | - | 15M | 0 | 27 | 118 | 128 | 11 | 6 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.900000e+01 | 46.15%| unknown
│ │ │ │ r 0.0s| 1 | 0 | 143 | - |rounding| 0 | 27 | 118 | 128 | 11 | 6 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ 0.0s| 1 | 0 | 157 | - | 15M | 0 | 27 | 118 | 130 | 13 | 7 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ -0.1s| 1 | 0 | 166 | - | 15M | 0 | 27 | 118 | 131 | 14 | 8 | 0 | 0 |
│ │ │ │ +0.0s| 1 | 0 | 166 | - | 15M | 0 | 27 | 118 | 131 | 14 | 8 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ 0.1s| 1 | 0 | 181 | - | 15M | 0 | 27 | 318 | 132 | 15 | 9 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ 0.1s| 1 | 0 | 197 | - | 15M | 0 | 27 | 318 | 133 | 16 | 10 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts
│ │ │ │ |sepa|confs|strbr| dualbound | primalbound | gap | compl.
│ │ │ │ @@ -1106,20 +1106,20 @@
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ 0.1s| 1 | 0 | 250 | - | 15M | 0 | 27 | 318 | 142 | 27 | 17 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ 0.1s| 1 | 0 | 254 | - | 15M | 0 | 27 | 318 | 143 | 28 | 18 | 0 | 0 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ 0.2s| 1 | 2 | 254 | - | 15M | 0 | 27 | 318 | 143 | 28 | 18 | 0 | 12 |
│ │ │ │ 1.300000e+01 | 1.800000e+01 | 38.46%| unknown
│ │ │ │ -0.5s| 100 | 7 | 1084 | 8.4 | 15M | 12 | 27 | 259 | 138 | 59 | 0 | 12 | 136 |
│ │ │ │ +0.4s| 100 | 7 | 1084 | 8.4 | 15M | 12 | 27 | 259 | 138 | 59 | 0 | 12 | 136 |
│ │ │ │ 1.480952e+01 | 1.800000e+01 | 21.54%| 79.34%
│ │ │ │ -r 0.5s| 114 | 5 | 1202 | 8.4 |shifting| 15 | 27 | 259 | 135 | 63 | 0 | 12 | 136
│ │ │ │ +r 0.4s| 114 | 5 | 1202 | 8.4 |shifting| 15 | 27 | 259 | 135 | 63 | 0 | 12 | 136
│ │ │ │ | 1.547619e+01 | 1.800000e+01 | 16.31%| 81.26%
│ │ │ │ SCIP Status : problem is solved [optimal solution found]
│ │ │ │ -Solving Time (sec) : 0.64
│ │ │ │ +Solving Time (sec) : 0.53
│ │ │ │ Solving Nodes : 171
│ │ │ │ Primal Bound : +1.80000000000000e+01 (358 solutions)
│ │ │ │ Dual Bound : +1.80000000000000e+01
│ │ │ │ Gap : 0.00 %
│ │ │ │ Okay, what happened here? First, we reset all parameters to their default
│ │ │ │ values, using "set default". Next, we loaded some meta-parameter settings (also
│ │ │ │ see _t_h_e_ _F_A_Q), to apply primal heuristics more aggressively. _SS_CC_II_PP shows us,