MINTO, a Mixed INTeger Optimizer -- version 3.1.0 (LINUX/CPLEX 8.1) Copyright (C) 1992-2004 -- M.W.P. Savelsbergh ILOG CPLEX 9.000, licensed to "arizona-tempe, az", options: e m b q p=4 MINTO: Solving problem RAN12X21 MINTO: Problem statistics: Number of constraints: 285 Number of variables: 504 (0) Number of nonzero's: 1008 Number of continuous variables: 252 Number of binary variables: 252 Number of integer variables: 0 MINTO: Row structure analysis (after preprocessing): Number of constraints of type NOBINEQ: 33 Number of constraints of type VARUB: 252 MINTO control parameters: Objective sense : minimization Output level : 1 Maximum cpu time : 1000000 Maximum #nodes : 1000000 MINTO system function activity levels: Bound improvement : active Branching type : 3 Node selection type : 5 Preprocessing level : 2 Primal heuristic : active Clique cuts : active Implication cuts : active Knapsack covers : active GUB covers : active Flow covers : active Row management : active Restarts : active Force branching : 1 Advanced basis : not active Names mode level : 0 MINTO: Updating primal (MINTO heuristic) Value: -3904.00 Elapsed time: 1.66 Node: 600 MINTO: ... evaluated 1000 nodes ... (best bound -3432.167131, queue 999) MINTO: ... evaluated 2000 nodes ... (best bound -3432.167131, queue 1999) MINTO: Updating primal (Integral solution) Value: -3768.00 Elapsed time: 5.87 Node: 2158 MINTO: ... evaluated 3000 nodes ... (best bound -3432.167131, queue 2979) MINTO: ... evaluated 4000 nodes ... (best bound -3432.167131, queue 3945) MINTO: ... evaluated 5000 nodes ... (best bound -3432.167131, queue 4815) MINTO: Updating primal (Integral solution) Value: -3744.00 Elapsed time: 14.79 Node: 5372 MINTO: ... evaluated 6000 nodes ... (best bound -3432.167131, queue 5559) MINTO: Updating primal (Integral solution) Value: -3728.00 Elapsed time: 16.73 Node: 6067 MINTO: ... evaluated 7000 nodes ... (best bound -3432.167131, queue 5098) MINTO: ... evaluated 8000 nodes ... (best bound -3432.167131, queue 4866) MINTO: Updating primal (Integral solution) Value: -3712.00 Elapsed time: 20.17 Node: 8275 MINTO: ... evaluated 9000 nodes ... (best bound -3432.167131, queue 4005) MINTO: ... evaluated 10000 nodes ... (best bound -3432.167131, queue 3737) MINTO: Updating primal (Integral solution) Value: -3710.00 Elapsed time: 23.70 Node: 10431 MINTO: ... evaluated 11000 nodes ... (best bound -3432.167131, queue 3268) MINTO: ... evaluated 12000 nodes ... (best bound -3432.167131, queue 3260) MINTO: ... evaluated 13000 nodes ... (best bound -3432.167131, queue 3264) MINTO: ... evaluated 14000 nodes ... (best bound -3432.167131, queue 3186) MINTO: ... evaluated 15000 nodes ... (best bound -3432.167131, queue 3106) MINTO: ... evaluated 16000 nodes ... (best bound -3432.167131, queue 3100) MINTO: ... evaluated 17000 nodes ... (best bound -3432.167131, queue 3148) MINTO: ... evaluated 18000 nodes ... (best bound -3432.167131, queue 3100) MINTO: ... evaluated 19000 nodes ... (best bound -3432.167131, queue 3112) MINTO: ... evaluated 20000 nodes ... (best bound -3432.167131, queue 3116) MINTO: ... evaluated 21000 nodes ... (best bound -3432.167131, queue 3140) MINTO: ... evaluated 22000 nodes ... (best bound -3432.167131, queue 3098) MINTO: ... evaluated 23000 nodes ... (best bound -3432.167131, queue 3092) MINTO: ... evaluated 24000 nodes ... (best bound -3432.167131, queue 3108) MINTO: ... evaluated 25000 nodes ... (best bound -3432.167131, queue 3112) MINTO: ... evaluated 26000 nodes ... (best bound -3432.167131, queue 3106) MINTO: ... evaluated 27000 nodes ... (best bound -3432.167131, queue 3100) MINTO: ... evaluated 28000 nodes ... (best bound -3432.167131, queue 3104) MINTO: ... evaluated 29000 nodes ... (best bound -3432.167131, queue 3102) MINTO: ... evaluated 30000 nodes ... (best bound -3432.167131, queue 3106) MINTO: ... evaluated 31000 nodes ... (best bound -3432.167131, queue 3122) MINTO: ... evaluated 32000 nodes ... (best bound -3432.167131, queue 3110) MINTO: ... evaluated 33000 nodes ... (best bound -3432.167131, queue 3106) MINTO: ... evaluated 34000 nodes ... (best bound -3432.167131, queue 3114) MINTO: ... evaluated 35000 nodes ... (best bound -3432.167131, queue 3098) MINTO: ... evaluated 36000 nodes ... (best bound -3432.167131, queue 3102) MINTO: ... evaluated 37000 nodes ... (best bound -3432.167131, queue 3128) MINTO: ... evaluated 38000 nodes ... (best bound -3432.167131, queue 3124) MINTO: ... evaluated 39000 nodes ... (best bound -3432.167131, queue 3100) MINTO: ... evaluated 40000 nodes ... (best bound -3432.167131, queue 3112) MINTO: ... evaluated 41000 nodes ... (best bound -3432.167131, queue 3112) MINTO: ... evaluated 42000 nodes ... (best bound -3432.167131, queue 3100) MINTO: ... evaluated 43000 nodes ... (best bound -3432.167131, queue 3094) MINTO: ... evaluated 44000 nodes ... (best bound -3432.167131, queue 3098) MINTO: ... evaluated 45000 nodes ... (best bound -3432.167131, queue 3092) MINTO: ... evaluated 46000 nodes ... (best bound -3432.167131, queue 2848) MINTO: ... evaluated 47000 nodes ... (best bound -3432.167131, queue 2648) MINTO: ... evaluated 48000 nodes ... (best bound -3432.167131, queue 2240) MINTO: ... evaluated 49000 nodes ... (best bound -3432.167131, queue 2010) MINTO: ... evaluated 50000 nodes ... (best bound -3432.167131, queue 1618) MINTO: ... evaluated 51000 nodes ... (best bound -3432.167131, queue 1444) MINTO: ... evaluated 52000 nodes ... (best bound -3432.167131, queue 1436) MINTO: ... evaluated 53000 nodes ... (best bound -3432.167131, queue 1466) MINTO: ... evaluated 54000 nodes ... (best bound -3432.167131, queue 1468) MINTO: Updating primal (Integral solution) Value: -3675.00 Elapsed time: 117.54 Node: 54748 MINTO: ... evaluated 55000 nodes ... (best bound -3432.167131, queue 1157) MINTO: ... evaluated 56000 nodes ... (best bound -3432.167131, queue 1189) MINTO: ... evaluated 57000 nodes ... (best bound -3432.167131, queue 1149) MINTO: ... evaluated 58000 nodes ... (best bound -3432.167131, queue 1135) MINTO: ... evaluated 59000 nodes ... (best bound -3432.167131, queue 1155) MINTO: ... evaluated 60000 nodes ... (best bound -3432.167131, queue 1139) MINTO: ... evaluated 61000 nodes ... (best bound -3432.167131, queue 1163) MINTO: ... evaluated 62000 nodes ... (best bound -3432.167131, queue 1221) MINTO: Updating primal (Integral solution) Value: -3664.00 Elapsed time: 135.36 Node: 62067 MINTO: ... evaluated 63000 nodes ... (best bound -3432.167131, queue 897) MINTO: ... evaluated 64000 nodes ... (best bound -3432.167131, queue 925) MINTO: ... evaluated 65000 nodes ... (best bound -3432.167131, queue 897) MINTO: ... evaluated 66000 nodes ... (best bound -3432.167131, queue 899) MINTO: ... evaluated 67000 nodes ... (best bound -3432.167131, queue 867) MINTO: ... evaluated 68000 nodes ... (best bound -3432.167131, queue 515) MINTO: ... evaluated 69000 nodes ... (best bound -3432.167131, queue 495) MINTO: ... evaluated 70000 nodes ... (best bound -3432.167131, queue 213) MINTO: ... evaluated 71000 nodes ... (best bound -3432.167131, queue 29) MINTO: ... evaluated 72000 nodes ... (best bound -3462.163711, queue 43) MINTO: ... evaluated 73000 nodes ... (best bound -3462.163711, queue 45) MINTO: ... evaluated 74000 nodes ... (best bound -3462.163711, queue 11) MINTO: ... evaluated 75000 nodes ... (best bound -3462.163711, queue 59) MINTO: ... evaluated 76000 nodes ... (best bound -3462.163711, queue 27) MINTO: ... evaluated 77000 nodes ... (best bound -3462.163711, queue 75) MINTO: ... evaluated 78000 nodes ... (best bound -3462.163711, queue 11) MINTO: ... evaluated 79000 nodes ... (best bound -3462.163711, queue 85) MINTO: ... evaluated 80000 nodes ... (best bound -3462.163711, queue 37) MINTO: ... evaluated 81000 nodes ... (best bound -3462.163711, queue 31) MINTO: ... evaluated 82000 nodes ... (best bound -3462.163711, queue 17) MINTO: ... evaluated 83000 nodes ... (best bound -3462.163711, queue 35) MINTO: ... evaluated 84000 nodes ... (best bound -3462.163711, queue 11) MINTO: ... evaluated 85000 nodes ... (best bound -3462.163711, queue 15) MINTO: ... evaluated 86000 nodes ... (best bound -3462.163711, queue 23) MINTO: ... evaluated 87000 nodes ... (best bound -3462.163711, queue 17) MINTO: ... evaluated 88000 nodes ... (best bound -3475.058941, queue 31) MINTO: ... evaluated 89000 nodes ... (best bound -3475.058941, queue 25) MINTO: ... evaluated 90000 nodes ... (best bound -3475.058941, queue 29) MINTO: ... evaluated 91000 nodes ... (best bound -3475.058941, queue 17) MINTO: ... evaluated 92000 nodes ... (best bound -3475.058941, queue 15) MINTO: ... evaluated 93000 nodes ... (best bound -3475.058941, queue 35) MINTO: ... evaluated 94000 nodes ... (best bound -3475.058941, queue 11) MINTO: ... evaluated 95000 nodes ... (best bound -3475.058941, queue 5) MINTO: ... evaluated 96000 nodes ... (best bound -3475.058941, queue 21) MINTO: ... evaluated 97000 nodes ... (best bound -3475.058941, queue 7) MINTO: ... evaluated 98000 nodes ... (best bound -3475.058941, queue 9) MINTO: Value of solution: 3664.000000 MINTO: Non-zero variables in the solution: xopt[1] = 8.000000 (X1) xopt[15] = 7.000000 (X15) xopt[16] = 9.000000 (X16) xopt[25] = 19.000000 (X25) xopt[54] = 2.000000 (X54) xopt[55] = 29.000000 (X55) xopt[68] = 1.000000 (X68) xopt[73] = 3.000000 (X73) xopt[74] = 21.000000 (X74) xopt[77] = 5.000000 (X77) xopt[84] = 2.000000 (X84) xopt[91] = 13.000000 (X91) xopt[102] = 11.000000 (X102) xopt[111] = 14.000000 (X111) xopt[144] = 16.000000 (X144) xopt[145] = 7.000000 (X145) xopt[152] = 4.000000 (X152) xopt[156] = 9.000000 (X156) xopt[164] = 7.000000 (X164) xopt[171] = 3.000000 (X171) xopt[174] = 1.000000 (X174) xopt[176] = 32.000000 (X176) xopt[188] = 27.000000 (X188) xopt[191] = 2.000000 (X191) xopt[204] = 11.000000 (X204) xopt[225] = 32.000000 (X225) xopt[238] = 25.000000 (X238) xopt[253] = 1.000000 (Y1) xopt[267] = 1.000000 (Y15) xopt[268] = 1.000000 (Y16) xopt[277] = 1.000000 (Y25) xopt[306] = 1.000000 (Y54) xopt[307] = 1.000000 (Y55) xopt[320] = 1.000000 (Y68) xopt[325] = 1.000000 (Y73) xopt[326] = 1.000000 (Y74) xopt[329] = 1.000000 (Y77) xopt[336] = 1.000000 (Y84) xopt[343] = 1.000000 (Y91) xopt[354] = 1.000000 (Y102) xopt[363] = 1.000000 (Y111) xopt[396] = 1.000000 (Y144) xopt[397] = 1.000000 (Y145) xopt[404] = 1.000000 (Y152) xopt[408] = 1.000000 (Y156) xopt[416] = 1.000000 (Y164) xopt[423] = 1.000000 (Y171) xopt[426] = 1.000000 (Y174) xopt[428] = 1.000000 (Y176) xopt[440] = 1.000000 (Y188) xopt[443] = 1.000000 (Y191) xopt[456] = 1.000000 (Y204) xopt[477] = 1.000000 (Y225) xopt[490] = 1.000000 (Y238) zopt = 3664.000000 zroot = 3432.167131 zinit = 3157.377442 MINTO: Branch and bound statistics Maximum number of unevaluated nodes = 944 Number of evaluated nodes = 98173 Depth of the tree = 104 Number of linear programs solved = 107062 Maximum number of rows in active LP = 950 (285) MINTO: Cut generation statistics Number of generated clique inequalities = 0 Number of generated implication inequalities = 0 Number of generated lifted knapsack covers = 247 Knapsack covers = 0 Knapsack covers with GUBs = 0 Surrogate knapsack covers = 247 Number of generated generalized flow covers = 1343 APPL: Timing statistics (in seconds) appl_bounds: 0.02 appl_constraints: 0.04 appl_delconstraints: 0.01 appl_divide: 0.02 appl_exit: 0.00 appl_fathom: 0.01 appl_feasible: 0.00 appl_init: 0.00 appl_initlp: 0.00 appl_mps: 0.00 appl_node: 0.07 appl_preprocessing: 0.04 appl_primal: 0.00 appl_rank: 0.00 appl_terminatelp: 0.03 appl_terminatenode: 0.01 appl_variables: 0.06 MINTO: Timing statistics (in seconds) Reading MPS file: 0.00 Restart: 0.00 Preprocessing and probing: 0.07 Primal heuristic: 4.50 Bound improvement: 200.27 Clique cut generation: 0.00 Implication cut generation: 0.00 Knapsack cover generation: 0.01 GUB cover generation: 0.00 Surrogate knapsack cover generation: 0.20 Flow cover generation: 0.55 Cut pool search: 3.41 Cut Management: 0.02 Branching: 0.73 Time LP solving: 0.00 Total elapsed time: 227.58 Command exited with non-zero status 161 226.78user 0.80system 3:47.63elapsed 99%CPU (0avgtext+0avgdata 0maxresident)k 0inputs+0outputs (0major+6299minor)pagefaults 0swaps