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 RAN10X26 MINTO: Problem statistics: Number of constraints: 296 Number of variables: 520 (0) Number of nonzero's: 1040 Number of continuous variables: 260 Number of binary variables: 260 Number of integer variables: 0 MINTO: Row structure analysis (after preprocessing): Number of constraints of type NOBINEQ: 36 Number of constraints of type VARUB: 260 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: ... evaluated 1000 nodes ... (best bound -4040.940432, queue 997) MINTO: Updating primal (MINTO heuristic) Value: -5039.00 Elapsed time: 4.28 Node: 1400 MINTO: ... evaluated 2000 nodes ... (best bound -4040.940432, queue 1989) MINTO: Updating primal (MINTO heuristic) Value: -4916.00 Elapsed time: 9.58 Node: 2900 MINTO: ... evaluated 3000 nodes ... (best bound -4049.963042, queue 2987) MINTO: Updating primal (Integral solution) Value: -4287.00 Elapsed time: 10.28 Node: 3094 MINTO: ... evaluated 4000 nodes ... (best bound -4049.963042, queue 2571) MINTO: ... evaluated 5000 nodes ... (best bound -4049.963042, queue 2391) MINTO: ... evaluated 6000 nodes ... (best bound -4049.963042, queue 2129) MINTO: ... evaluated 7000 nodes ... (best bound -4049.963042, queue 1893) MINTO: Updating primal (Integral solution) Value: -4276.00 Elapsed time: 18.58 Node: 7253 MINTO: ... evaluated 8000 nodes ... (best bound -4049.963042, queue 1505) MINTO: ... evaluated 9000 nodes ... (best bound -4049.963042, queue 1387) MINTO: ... evaluated 10000 nodes ... (best bound -4049.963042, queue 1147) MINTO: ... evaluated 11000 nodes ... (best bound -4049.963042, queue 921) MINTO: ... evaluated 12000 nodes ... (best bound -4049.963042, queue 903) MINTO: ... evaluated 13000 nodes ... (best bound -4049.963042, queue 901) MINTO: Updating primal (Integral solution) Value: -4270.00 Elapsed time: 30.27 Node: 13634 MINTO: ... evaluated 14000 nodes ... (best bound -4049.963042, queue 552) MINTO: ... evaluated 15000 nodes ... (best bound -4049.963042, queue 322) MINTO: ... evaluated 16000 nodes ... (best bound -4049.963042, queue 230) MINTO: ... evaluated 17000 nodes ... (best bound -4049.963042, queue 136) MINTO: ... evaluated 18000 nodes ... (best bound -4049.963042, queue 180) MINTO: ... evaluated 19000 nodes ... (best bound -4049.963042, queue 20) MINTO: Value of solution: 4270.000000 MINTO: Non-zero variables in the solution: xopt[4] = 11.000000 (X4) xopt[9] = 7.000000 (X9) xopt[16] = 2.000000 (X16) xopt[18] = 30.000000 (X18) xopt[22] = 8.000000 (X22) xopt[26] = 21.000000 (X26) xopt[29] = 10.000000 (X29) xopt[54] = 14.000000 (X54) xopt[58] = 3.000000 (X58) xopt[65] = 6.000000 (X65) xopt[76] = 6.000000 (X76) xopt[100] = 25.000000 (X100) xopt[109] = 19.000000 (X109) xopt[112] = 2.000000 (X112) xopt[144] = 27.000000 (X144) xopt[151] = 16.000000 (X151) xopt[171] = 2.000000 (X171) xopt[176] = 6.000000 (X176) xopt[181] = 3.000000 (X181) xopt[192] = 29.000000 (X192) xopt[198] = 6.000000 (X198) xopt[199] = 8.000000 (X199) xopt[201] = 11.000000 (X201) xopt[209] = 8.000000 (X209) xopt[215] = 6.000000 (X215) xopt[231] = 4.000000 (X231) xopt[245] = 56.000000 (X245) xopt[246] = 4.000000 (X246) xopt[264] = 1.000000 (Y4) xopt[269] = 1.000000 (Y9) xopt[276] = 1.000000 (Y16) xopt[278] = 1.000000 (Y18) xopt[282] = 1.000000 (Y22) xopt[286] = 1.000000 (Y26) xopt[289] = 1.000000 (Y29) xopt[314] = 1.000000 (Y54) xopt[318] = 1.000000 (Y58) xopt[325] = 1.000000 (Y65) xopt[336] = 1.000000 (Y76) xopt[360] = 1.000000 (Y100) xopt[369] = 1.000000 (Y109) xopt[372] = 1.000000 (Y112) xopt[404] = 1.000000 (Y144) xopt[411] = 1.000000 (Y151) xopt[431] = 1.000000 (Y171) xopt[436] = 1.000000 (Y176) xopt[441] = 1.000000 (Y181) xopt[452] = 1.000000 (Y192) xopt[458] = 1.000000 (Y198) xopt[459] = 1.000000 (Y199) xopt[461] = 1.000000 (Y201) xopt[469] = 1.000000 (Y209) xopt[475] = 1.000000 (Y215) xopt[491] = 1.000000 (Y231) xopt[505] = 1.000000 (Y245) xopt[506] = 1.000000 (Y246) zopt = 4270.000000 zroot = 4040.940432 zinit = 3857.022783 MINTO: Branch and bound statistics Maximum number of unevaluated nodes = 752 Number of evaluated nodes = 19162 Depth of the tree = 92 Number of linear programs solved = 21157 Maximum number of rows in active LP = 832 (296) MINTO: Cut generation statistics Number of generated clique inequalities = 0 Number of generated implication inequalities = 0 Number of generated lifted knapsack covers = 246 Knapsack covers = 0 Knapsack covers with GUBs = 0 Surrogate knapsack covers = 246 Number of generated generalized flow covers = 767 APPL: Timing statistics (in seconds) appl_bounds: 0.00 appl_constraints: 0.00 appl_delconstraints: 0.01 appl_divide: 0.00 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.00 appl_preprocessing: 0.00 appl_primal: 0.00 appl_rank: 0.00 appl_terminatelp: 0.01 appl_terminatenode: 0.00 appl_variables: 0.00 MINTO: Timing statistics (in seconds) Reading MPS file: 0.00 Restart: 0.00 Preprocessing and probing: 0.04 Primal heuristic: 1.87 Bound improvement: 37.16 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.05 Flow cover generation: 0.13 Cut pool search: 0.44 Cut Management: 0.00 Branching: 0.49 Time LP solving: 0.00 Total elapsed time: 43.39 Command exited with non-zero status 161 43.20user 0.19system 0:43.41elapsed 99%CPU (0avgtext+0avgdata 0maxresident)k 0inputs+0outputs (0major+5984minor)pagefaults 0swaps