SCIP Doxygen Documentation
Loading...
Searching...
No Matches
Tutorial: the interactive shell

If you are using SCIP as a black box solver, here you will find some tips and tricks what you can do.

Read and optimize a problem instance

"Prerequisites"

First of all, we need a SCIP binary and an example problem file to work with. For installation we refer you to the Installing SCIP section.

Therefore, you can either download the SCIP standard distribution (which includes problem files) and compile it on your own or you can download a precompiled binary and an example problem separately. SCIP can read files in LP, MPS, ZPL, WBO, FZN, PIP, OSiL, and other formats (see File Readers).

If you want to download the source code of the SCIP standard distribution, we recommend to go to the SCIP download section, download the latest release, inflate the tarball (e.g., with "tar xzf scipoptsuite-[version].tgz"), and follow the instructions in the INSTALL file. The instance stein27, which will serve as an example in this tutorial, can be found under scipoptsuite-[version]/scip-[version]/check/instances/MIP/stein27.fzn. Alternatively you can download an instance file from the MIPLIB 2017 page.

If you want to download a precompiled binary, go to the SCIP download section and download an appropriate binary for your operating system. The SCIP source code distribution already comes with the example instance used throughout this tutorial. To follow this tutorial with a precompiled binary, we recommend downloading the instance stein27 from the MIPLIB 3.0 homepage.

"After installation"

Now start your binary, without any arguments. This opens the interactive shell, which should look somehow like this:

SCIP version 10.0.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 7.1.6] [GitHash: b8eaf989f9]
Copyright (c) 2002-2026 Zuse Institute Berlin (ZIB)
External libraries:
Readline 8.3 GNU library for command line editing (gnu.org/s/readline)
SoPlex 7.1.6 Linear programming solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInf]
ZLIB 1.3.2 General purpose compression library by J. Gailly and M. Adler (zlib.net)
TinyCThread 1.2 small portable implementation of the C11 threads API (tinycthread.github.io)
GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org)
ZIMPL 3.7.0 Zuse Institute Mathematical Programming Language developed by T. Koch (zimpl.zib.de)
PaPILO 2.4.4 parallel presolve for integer and linear optimization (github.com/scipopt/papilo) (built with TBB)
Nauty 2.9.3 Computing Graph Automorphism Groups by Brendan D. McKay (https://users.cecs.anu.edu.au/~bdm/nauty/)
Ipopt 3.14.19 Interior Point Optimizer developed by A. Waechter et.al. (github.com/coin-or/Ipopt)
user parameter file <scip.set> not found - using default parameters

First of all "help" shows you a list of all available shell commands. Brackets indicate a submenu with further options.

SCIP> help
<change> change the problem
<display> display information
<fix> fix/unfix parameters
<set> load/save/change parameters
<write> write information to file
checksol double checks best solution w.r.t. original problem
concurrentopt solve the problem using concurrent solvers
count count number of feasible solutions
countpresolve presolve instance before counting number of feasible solutions
free free current problem from memory
help display this help (add <command> to show information on specific command)
iis compute an (I)IS for an infeasible problem, i.e., an (irreducible) infeasible set.
newstart reset branch and bound tree to start again from root
optimize solve the problem
presolve solve the problem, but stop after presolving stage
quit leave SCIP (<exit> works as well)
read read a problem
validatesolve validate the solution against external objective reference interval
Press 'Return' or enter '..' to navigate back in the menu.

Okay, let's solve the example instance... use "read check/instances/MIP/stein27.fzn" (or the problem file of your choice) to parse the instance file, "optimize" to solve it and "display solution" to show the nonzero variables of the best found solution.

SCIP> read check/instances/MIP/stein27.fzn
read problem <check/instances/MIP/stein27.fzn>
============
original problem has 29 variables (29 bin, 0 int, 0 cont) and 118 constraints
SCIP> optimize
feasible solution found by trivial heuristic after 0.0 seconds, objective value 2.700000e+01
presolving:
(round 1, fast) 2 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs, 0 implints
(0.0s) running MILP presolver
(0.0s) MILP presolver found nothing
(round 2, exhaustive) 2 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 118 upgd conss, 0 impls, 0 clqs, 0 implints
(0.0s) probing cycle finished: starting next cycle
(0.0s) symmetry computation started: requiring (bin +, int +, cont +), (fixed: bin -, int -, cont -)
(0.0s) symmetry computation finished: 6 generators found (max: 1500, log10 of symmetry group size: 5.48) (symcode time: 0.00)
dynamic symmetry handling statistics:
orbitopal reduction: no components
orbital reduction: 1 components of sizes 13
lexicographic reduction: 13 permutations with support sizes 18, 18, 18, 18, 18, 18, 18, 24, 18, 18, 18, 24, 18
handled 1 out of 1 symmetry components
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
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.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%
SCIP Status : problem is solved [optimal solution found]
Solving Time (sec) : 0.44
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)
x0001 1 (obj:1)
x0003 1 (obj:1)
x0007 1 (obj:1)
x0008 1 (obj:1)
x0009 1 (obj:1)
x0010 1 (obj:1)
x0012 1 (obj:1)
x0013 1 (obj:1)
x0014 1 (obj:1)
x0016 1 (obj:1)
x0019 1 (obj:1)
x0020 1 (obj:1)
x0021 1 (obj:1)
x0022 1 (obj:1)
x0023 1 (obj:1)
x0024 1 (obj:1)
x0025 1 (obj:1)
x0026 1 (obj:1)

What do we see here? After "optimize", SCIP first goes into presolving. Not much is happening for this instance, just the linear constraints get upgraded to more specific types. Each round of presolving will be displayed in a single line, with a short summary at the end. Then, we see the actual solving process. The table output of the branch-and-cut solving process is very detailed during the root node. Afterwards, a new line is displayed every 100th node. Furthermore, every new incumbent solution triggers a new table row, starting with a character to indicate the heuristic that found the solution. Which letter represents which heuristic can be seen with the "display heuristics" command, see Displaying detailed solving statistics for an example.

After some lines the root node processing is finished. From now on, we will see an output line every hundredth node or whenever a new incumbent is found. After some more nodes, the "dualbound" starts moving, too. At one point, both will be the same, and the solving process terminates, showing us some wrap-up information.

The exact performance may of course vary among different architectures and operating systems. Do not be worried if your installation needs more or less time or nodes to solve. Also, this instance has more than 2000 different optimal solutions. The optimal objective value always has to be 18, but the solution vector may differ. If you are interested in this behavior, which is called "performance variability", you may have a look at the MIPLIB2010 paper.

Writing problems and solutions to a file

SCIP can also write information to files. E.g., we could store the incumbent solution to a file, or output the problem instance in another file format (the LP format is much more human readable than the MPS format, for example). Since stein27.fzn has many constraints with the same name, which would result in an unusable LP file, we write out the problem with generic variable and constraint names (x1, x2, x3, ...; c1, c2, c3, ...) here.

SCIP> write solution stein27.sol
written solution information to file <stein27.sol>
SCIP> write genproblem stein27.lp
written original problem to file <stein27.lp>

Passing starting solutions can increase the solving performance so that SCIP does not need to construct an initial feasible solution by itself. After reading the problem instance, use the "read" command again, this time with a file containing solution information. Solutions can be specified in a raw or xml-format and must have the file extension ".sol", see the documentation of the solution reader of SCIP for further information.

Customized settings are not written or read with the "write" and "read" commands, but with the three commands

SCIP> set save settingsfile.set
saved parameter file <settingsfile.set>
SCIP> set diffsave settingsfile.set
saved non-default parameter settings to file <settingsfile.set>
SCIP> set load settingsfile.set
loaded parameter file <settingsfile.set>

See the section on parameters Changing parameters from the interactive shell for more information.

Displaying detailed solving statistics

We might want to have some more information now. Which of the heuristics found solutions? Which plugins were called during the solutions process and how much time did they spend? Information on certain plugin types (e.g., heuristics, branching rules, separators) is displayed via "display <plugin-type>", information on the solution process via "display statistics", and "display problem" shows the current instance.

SCIP> display heuristics
primal heuristic c priority freq ofs description
---------------- - -------- ---- --- -----------
dps L 75000 -1 0 primal heuristic for decomposable MIPs
padm L 70000 0 0 penalty alternating direction method primal heuristic
ofins L 60000 0 0 primal heuristic for reoptimization, objective function induced neighborhood search
reoptsols p 40000 0 0 primal heuristic updating solutions found in a previous optimization round
trivialnegation p 39990 0 0 negate solution entries if an objective coefficient changes the sign, enters or leaves the objective.
trivial t 10000 0 0 start heuristic which tries some trivial solutions
clique p 5000 0 0 LNS heuristic using a clique partition to restrict the search neighborhood
locks p 3000 0 0 heuristic that fixes variables based on their rounding locks
vbounds p 2500 0 0 LNS heuristic uses the variable lower and upper bounds to determine the search neighborhood
shiftandpropagate p 1000 0 0 Pre-root heuristic to expand an auxiliary branch-and-bound tree and apply propagation techniques
zeroobj L 100 -1 0 heuristic trying to solve the problem without objective
completesol L 0 0 0 primal heuristic trying to complete given partial solutions
dualval L -10 -1 0 primal heuristic using dual values
repair L -20 -1 0 tries to repair a primal infeasible solution
simplerounding r -30 1 0 simple and fast LP rounding heuristic
randrounding r -200 10 0 fast LP rounding heuristic
zirounding r -500 1 0 LP rounding heuristic as suggested by C. Wallace taking row slacks and bounds into account
rounding r -1000 1 0 LP rounding heuristic with infeasibility recovering
shifting r -5000 5 0 LP rounding heuristic with infeasibility recovering also using continuous variables
intshifting r -10000 10 0 LP rounding heuristic with infeasibility recovering and final LP solving
oneopt i -20000 1 0 1-opt heuristic which tries to improve setting of single integer variables
twoopt i -20100 -1 0 primal heuristic to improve incumbent solution by flipping pairs of variables
indicator L -20200 1 0 indicator heuristic to create feasible solutions from values for indicator variables
scheduler L -30000 -1 0 Adaptive heuristic to schedule LNS and diving heuristics
adaptivediving d -70000 5 3 diving heuristic that selects adaptively between the existing, public divesets
indicatordiving I -150000 0 0 LP diving heuristic that fixes indicator variables controlling semicontinuous variables
fixandinfer p -500000 -1 0 iteratively fixes variables and propagates inferences
farkasdiving d -900000 10 0 LP diving heuristic that tries to construct a Farkas-proof
feaspump o -1000000 20 0 objective feasibility pump 2.0
conflictdiving d -1000100 10 0 LP diving heuristic that chooses fixings w.r.t. conflict locks
coefdiving d -1001000 -1 1 LP diving heuristic that chooses fixings w.r.t. the matrix coefficients
pscostdiving d -1002000 10 2 LP diving heuristic that chooses fixings w.r.t. the pseudo cost values
fracdiving d -1003000 10 3 LP diving heuristic that chooses fixings w.r.t. the fractionalities
nlpdiving d -1003010 10 3 NLP diving heuristic that chooses fixings w.r.t. the fractionalities
veclendiving d -1003100 10 4 LP diving heuristic that rounds variables with long column vectors
distributiondiving d -1003300 10 3 Diving heuristic that chooses fixings w.r.t. changes in the solution density
intdiving d -1003500 -1 9 LP diving heuristic that fixes binary variables with large LP value to one
actconsdiving d -1003700 -1 5 LP diving heuristic that chooses fixings w.r.t. the active constraints
objpscostdiving o -1004000 20 4 LP diving heuristic that changes variable's objective values instead of bounds, using pseudo costs as guide
rootsoldiving o -1005000 20 5 LP diving heuristic that changes variable's objective values using root LP solution as guide
linesearchdiving d -1006000 10 6 LP diving heuristic that chooses fixings following the line from root solution to current solution
guideddiving d -1007000 10 7 LP diving heuristic that chooses fixings in direction of incumbent solutions
octane r -1008000 -1 0 octane primal heuristic for pure {0;1}-problems based on Balas et al.
rens L -1100000 0 0 LNS exploring fractional neighborhood of relaxation's optimum
alns L -1100500 20 0 Large neighborhood search heuristic that orchestrates the popular neighborhoods Local Branching, RINS, RENS, DINS etc.
rins L -1101000 15 0 relaxation induced neighborhood search by Danna, Rothberg, and Le Pape
localbranching L -1102000 -1 0 local branching heuristic by Fischetti and Lodi
trustregion L -1102010 -1 0 LNS heuristic for Benders' decomposition based on trust region methods
dks D -1102500 -1 0 decomposition kernel search
gins L -1103000 10 8 gins works on k-neighborhood in a variable-constraint graph
mutation L -1103010 -1 8 mutation heuristic randomly fixing variables
crossover L -1104000 15 0 LNS heuristic that fixes all variables that are identic in a couple of solutions
lpface L -1104010 15 0 LNS heuristic that searches the optimal LP face inside a sub-MIP
dins L -1105000 -1 0 distance induced neighborhood search by Ghosh
bound p -1107000 -1 0 heuristic which fixes all integer variables to a bound and solves the remaining LP
undercover L -1110000 0 0 solves a sub-CIP determined by a set covering approach
proximity L -2000000 -1 0 heuristic trying to improve the incumbent by an auxiliary proximity objective function
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.45
solving : 0.44
presolving : 0.01 (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
Objective : minimize, 27 non-zeros (abs.min = 1, abs.max = 1)
Presolved Problem :
Problem name : t_check/instances/MIP/stein27.fzn
Variables : 27 (27 binary, 0 integer, 0 continuous)
Implied int vars : 0 (0 binary, 0 integer, 0 continuous)
Constraints : 118 initial, 119 maximal
Objective : minimize, 27 non-zeros (abs.min = 1, abs.max = 1)
Nonzeros : 378 constraint, 0 clique table
Presolvers : ExecTime SetupTime Calls FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
domcol : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
dualagg : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
dualcomp : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
dualinfer : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
dualsparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
implics : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
implint : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
milp : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
qpkktref : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
redvub : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
sparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
stuffing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
trivial : 0.00 0.00 3 2 0 0 0 0 0 0 0 0
tworowbnd : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
dualfix : 0.00 0.00 3 0 0 0 0 0 0 0 0 0
genvbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
probing : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
pseudoobj : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
symmetry : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
vbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
knapsack : 0.00 0.00 3 0 0 0 0 0 0 0 0 0
linear : 0.00 0.00 3 0 0 0 0 0 0 0 0 0
logicor : 0.00 0.00 3 0 0 0 0 0 0 0 0 0
components : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
root node : - - - 14 - - 14 - - - - -
Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoRelax #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Applied Conss Children
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
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
genvbounds : 0 0 0 0
nlobbt : 0 0 0 0
obbt : 0 0 0 0
probing : 0 0 0 0
pseudoobj : 412 6 3 10
redcost : 21 0 0 0
rootredcost : 0 0 0 0
symmetry : 658 0 21 136
vbounds : 0 0 0 0
Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp SB-Prop
dualfix : 0.00 0.00 0.00 0.00 0.00 0.00
genvbounds : 0.00 0.00 0.00 0.00 0.00 0.00
nlobbt : 0.00 0.00 0.00 0.00 0.00 0.00
obbt : 0.00 0.00 0.00 0.00 0.00 0.00
probing : 0.00 0.00 0.00 0.00 0.00 0.00
pseudoobj : 0.00 0.00 0.00 0.00 0.00 0.00
redcost : 0.00 0.00 0.00 0.00 0.00 0.00
rootredcost : 0.00 0.00 0.00 0.00 0.00 0.00
symmetry : 0.01 0.00 0.00 0.00 0.00 0.00
vbounds : 0.00 0.00 0.00 0.00 0.00 0.00
Symmetry :
#affected vars : 27 (27 bin, 0 int, 0 cont)
orbitopal red. : 0 reductions applied, 0 cutoffs
orbital reduction: 75 reductions applied, 8 cutoffs
lexicographic red: 147 reductions applied, 13 cutoffs
shadow tree time : 0.00 s
Conflict Analysis : Time Calls Success DomReds Conflicts Literals Reconvs ReconvLits Dualrays Nonzeros LP Iters (pool size: [10000,10000])
propagation : 0.00 10 3 - 6 11.7 0 0.0 - - -
infeasible LP : 0.00 0 0 - 0 0.0 0 0.0 0 0.0 0
bound exceed. LP : 0.00 42 6 - 8 7.4 0 0.0 0 0.0 18
strong branching : 0.00 0 0 - 0 0.0 0 0.0 - - 0
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
> 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
> 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
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
problem variables: 0.00 - 0 0
Branching Rules : ExecTime SetupTime BranchLP BranchExt BranchPS Cutoffs DomReds Cuts Conss Children
allfullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
cloud : 0.00 0.00 0 0 0 0 0 0 0 0
distribution : 0.00 0.00 0 0 0 0 0 0 0 0
fullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
gomory : 0.00 0.00 0 0 0 0 0 0 0 0
inference : 0.00 0.00 0 0 0 0 0 0 0 0
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
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
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
distributiondivin: 0.00 0.00 0 0 0
dks : 0.00 0.00 0 0 0
dps : 0.00 0.00 0 0 0
dualval : 0.00 0.00 0 0 0
farkasdiving : 0.00 0.00 0 0 0
feaspump : 0.00 0.00 0 0 0
fixandinfer : 0.00 0.00 0 0 0
fracdiving : 0.00 0.00 1 0 0
gins : 0.00 0.00 0 0 0
guideddiving : 0.00 0.00 0 0 0
indicator : 0.00 0.00 0 0 0
indicatordiving : 0.00 0.00 0 0 0
intdiving : 0.00 0.00 0 0 0
intshifting : 0.00 0.00 0 0 0
linesearchdiving : 0.00 0.00 0 0 0
localbranching : 0.00 0.00 0 0 0
locks : 0.00 0.00 1 0 0
lpface : 0.00 0.00 0 0 0
mpec : 0.00 0.00 0 0 0
multistart : 0.00 0.00 0 0 0
mutation : 0.00 0.00 0 0 0
nlpdiving : 0.00 0.00 0 0 0
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
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
shiftandpropagate: 0.00 0.00 0 0 0
shifting : 0.00 0.00 99 14 0
simplerounding : 0.00 0.00 173 24 0
subnlp : 0.00 0.00 0 0 0
trivial : 0.00 0.00 2 1 1
trivialnegation : 0.00 0.00 0 0 0
trustregion : 0.00 0.00 0 0 0
trysol : 0.00 0.00 0 0 0
twoopt : 0.00 0.00 0 0 0
undercover : 0.00 0.00 0 0 0
vbounds : 0.00 0.00 0 0 0
veclendiving : 0.00 0.00 0 0 0
zeroobj : 0.00 0.00 0 0 0
zirounding : 0.00 0.00 77 62 0
other solutions : - - - 0 -
LNS (Scheduler) : Calls SetupTime SolveTime SolveNodes Sols Best Exp3 Exp3-IX EpsGreedy UCB TgtFixRate Opt Inf Node Stal Sol Usr Othr Actv
rens : 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
rins : 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
mutation : 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
localbranching : 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
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 47424.67 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 53995.22 - - 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)
feasible leaves : 0
infeas. leaves : 21
objective leaves : 57
nodes (total) : 155 (77 internal, 78 leaves)
nodes left : 0
max depth