Problem 'netcode.lp' read. Read time = 0.00 sec. CPLEX> opt Tried aggregator 1 time. MIP Presolve eliminated 2 rows and 61 columns. MIP Presolve modified 3 coefficients. Reduced MIP has 41 rows, 128 columns, and 890 nonzeros. Presolve time = 0.00 sec. Clique table members: 41. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 2 threads. Root relaxation solution time = 0.00 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap * 0+ 0 30.0000 381.0000 95 --- * 0+ 0 210.0000 381.0000 95 81.43% 0 0 381.0000 47 210.0000 Cuts: 56 159 81.43% * 0+ 0 219.0000 381.0000 159 73.97% 0 0 381.0000 57 219.0000 Cliques: 57 257 73.97% * 0+ 0 252.0000 381.0000 257 51.19% * 0+ 0 273.0000 381.0000 257 39.56% 0 2 381.0000 43 273.0000 381.0000 257 39.56% 100 29 315.7159 19 273.0000 381.0000 2799 39.56% 200 66 cutoff 273.0000 381.0000 5502 39.56% 300 104 307.6667 16 273.0000 345.0000 8027 26.37% 400 120 cutoff 273.0000 334.5000 10636 22.53% 500 23 298.5000 15 273.0000 296.0000 16645 8.42% 600 72 296.6357 27 273.0000 296.0000 19569 8.42% 700 61 323.4667 40 273.0000 296.0000 24067 8.42% 800 1 cutoff 273.0000 275.2500 26480 0.82% Clique cuts applied: 57 Gomory fractional cuts applied: 1 Root node processing (before b&c): Real time = 0.14 Parallel b&c, 2 threads: Real time = 2.22 Sync time (average) = 0.15 Wait time (average) = 0.34 ------- Total (root+branch&cut) = 2.36 sec. Solution pool: 5 solutions saved. MIP - Integer optimal solution: Objective = 2.7300000000e+02 Solution time = 2.38 sec. Iterations = 26480 Nodes = 802 CPLEX> dis sol var - Incumbent solution Variable Name Solution Value x38 -0.000000 x42 0.000000 x44 1.000000 x101 -0.000000 x118 0.000000 x124 1.000000 x134 1.000000 x148 1.000000 x179 1.000000 All other variables in the range 1-189 are 0.