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 neso11 MINTO: Problem statistics: Number of constraints: 2706 Number of variables: 1220 (0) Number of nonzero's: 9360 Number of continuous variables: 320 Number of binary variables: 900 Number of integer variables: 0 MINTO: Presolve eliminated 0 constraints and 60 variables Presolve made 0 coefficient changes MINTO: Row structure analysis (after preprocessing): Number of constraints of type MIXUB: 700 Number of constraints of type MIXEQ: 40 Number of constraints of type NOBINUB: 300 Number of constraints of type NOBINEQ: 56 Number of constraints of type ALLBINEQ: 140 Number of constraints of type VARLB: 750 Number of constraints of type BINSUM1UB: 720 MINTO control parameters: Objective sense : minimization Output level : 1 Maximum cpu time : 1000001 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: -10.00 Elapsed time: 0.71 Node: 1 MINTO: Updating primal (Integral solution) Value: -9.00 Elapsed time: 17.87 Node: 193 MINTO: ... evaluated 1000 nodes ... (best bound -6.000000, queue 639) MINTO: ... evaluated 2000 nodes ... (best bound -6.000000, queue 855) MINTO: ... evaluated 3000 nodes ... (best bound -6.000000, queue 809) MINTO: ... evaluated 4000 nodes ... (best bound -6.000000, queue 671) MINTO: ... evaluated 5000 nodes ... (best bound -6.000000, queue 575) MINTO: ... evaluated 6000 nodes ... (best bound -6.000000, queue 455) MINTO: ... evaluated 7000 nodes ... (best bound -6.000000, queue 351) MINTO: ... evaluated 8000 nodes ... (best bound -6.000000, queue 235) MINTO: ... evaluated 9000 nodes ... (best bound -6.000000, queue 139) MINTO: ... evaluated 10000 nodes ... (best bound -6.000000, queue 21) MINTO: Value of solution: 9.000000 MINTO: Non-zero variables in the solution: xopt[10] = 1.000000 (C0011) xopt[13] = 1.000000 (C0014) xopt[15] = 1.000000 (C0016) xopt[18] = 1.000000 (C0019) xopt[19] = 1.000000 (C0020) xopt[20] = 1.000000 (C0021) xopt[21] = 1.000000 (C0022) xopt[23] = 1.000000 (C0024) xopt[24] = 1.000000 (C0025) xopt[25] = 1.000000 (C0026) xopt[26] = 1.000000 (C0027) xopt[27] = 1.000000 (C0028) xopt[28] = 1.000000 (C0029) xopt[29] = 1.000000 (C0030) xopt[30] = 1.000000 (C0031) xopt[33] = 1.000000 (C0034) xopt[35] = 1.000000 (C0036) xopt[38] = 1.000000 (C0039) xopt[39] = 1.000000 (C0040) xopt[40] = 1.000000 (C0041) xopt[41] = 1.000000 (C0042) xopt[43] = 1.000000 (C0044) xopt[44] = 1.000000 (C0045) xopt[50] = 1.000000 (C0051) xopt[53] = 1.000000 (C0054) xopt[55] = 1.000000 (C0056) xopt[58] = 1.000000 (C0059) xopt[59] = 1.000000 (C0060) xopt[95] = 1.000000 (C0096) xopt[99] = 1.000000 (C0100) xopt[100] = 3.000000 (C0101) xopt[103] = 2.000000 (C0104) xopt[104] = 1.000000 (C0105) xopt[105] = 5.000000 (C0106) xopt[106] = 2.000000 (C0107) xopt[107] = 1.000000 (C0108) xopt[108] = 4.000000 (C0109) xopt[109] = 3.000000 (C0110) xopt[110] = 4.000000 (C0111) xopt[111] = 1.000000 (C0112) xopt[113] = 3.000000 (C0114) xopt[114] = 2.000000 (C0115) xopt[115] = 1.000000 (C0116) xopt[120] = 2.000000 (C0121) xopt[124] = 1.000000 (C0125) xopt[128] = 1.000000 (C0129) xopt[130] = 1.000000 (C0131) xopt[133] = 1.000000 (C0134) xopt[134] = 1.000000 (C0135) xopt[139] = 1.000000 (C0140) xopt[149] = 1.000000 (C0150) xopt[160] = 1.000000 (C0161) xopt[169] = 1.000000 (C0170) xopt[181] = 1.000000 (C0182) xopt[242] = 1.000000 (C0243) xopt[269] = 1.000000 (C0270) xopt[271] = 1.000000 (C0272) xopt[277] = 1.000000 (C0278) xopt[289] = 1.000000 (C0290) xopt[476] = 1.000000 (C0477) xopt[479] = 1.000000 (C0480) xopt[481] = 1.000000 (C0482) xopt[490] = 1.000000 (C0491) xopt[499] = 1.000000 (C0500) xopt[566] = 1.000000 (C0567) xopt[569] = 1.000000 (C0570) xopt[571] = 1.000000 (C0572) xopt[589] = 1.000000 (C0590) xopt[599] = 1.000000 (C0600) xopt[629] = 1.000000 (C0630) xopt[631] = 1.000000 (C0632) xopt[632] = 1.000000 (C0633) xopt[637] = 1.000000 (C0638) xopt[640] = 1.000000 (C0641) xopt[649] = 1.000000 (C0650) xopt[661] = 1.000000 (C0662) xopt[662] = 1.000000 (C0663) xopt[667] = 1.000000 (C0668) xopt[692] = 1.000000 (C0693) xopt[719] = 1.000000 (C0720) xopt[721] = 1.000000 (C0722) xopt[722] = 1.000000 (C0723) xopt[727] = 1.000000 (C0728) xopt[739] = 1.000000 (C0740) xopt[749] = 1.000000 (C0750) xopt[751] = 1.000000 (C0752) xopt[752] = 1.000000 (C0753) xopt[757] = 1.000000 (C0758) xopt[779] = 1.000000 (C0780) xopt[781] = 1.000000 (C0782) xopt[787] = 1.000000 (C0788) xopt[790] = 1.000000 (C0791) xopt[799] = 1.000000 (C0800) xopt[811] = 1.000000 (C0812) xopt[817] = 1.000000 (C0818) xopt[869] = 1.000000 (C0870) xopt[871] = 1.000000 (C0872) xopt[877] = 1.000000 (C0878) xopt[889] = 1.000000 (C0890) xopt[899] = 1.000000 (C0900) xopt[901] = 1.000000 (C0902) xopt[907] = 1.000000 (C0908) xopt[940] = 1.000000 (C0941) xopt[1090] = 1.000000 (C1091) xopt[1099] = 1.000000 (C1100) xopt[1219] = 1.000000 (C1220) zopt = 9.000000 zroot = 6.000000 zinit = 6.000000 MINTO: Branch and bound statistics Maximum number of unevaluated nodes = 894 Number of evaluated nodes = 10263 Depth of the tree = 65 Number of linear programs solved = 10263 Maximum number of rows in active LP = 2706 (2706) MINTO: Cut generation statistics Number of generated clique inequalities = 0 Number of generated implication inequalities = 0 Number of generated lifted knapsack covers = 0 Knapsack covers = 0 Knapsack covers with GUBs = 0 Surrogate knapsack covers = 0 Number of generated generalized flow covers = 0 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.01 appl_primal: 0.00 appl_rank: 0.00 appl_terminatelp: 0.00 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.12 Primal heuristic: 7.82 Bound improvement: 718.11 Clique cut generation: 0.09 Implication cut generation: 0.00 Knapsack cover generation: 0.00 GUB cover generation: 0.00 Surrogate knapsack cover generation: 0.01 Flow cover generation: 0.01 Cut pool search: 0.01 Cut Management: 0.00 Branching: 1.77 Time LP solving: 0.00 Total elapsed time: 737.56 Command exited with non-zero status 161 737.39user 0.17system 12:17.60elapsed 99%CPU (0avgtext+0avgdata 0maxresident)k 0inputs+0outputs (0major+15970minor)pagefaults 0swaps