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 neosxxx MINTO: Problem statistics: Number of constraints: 1085 Number of variables: 614 (0) Number of nonzero's: 12503 Number of continuous variables: 1 Number of binary variables: 613 Number of integer variables: 0 MINTO: Row structure analysis (after preprocessing): Number of constraints of type MIXEQ: 1 Number of constraints of type ALLBINUB: 80 Number of constraints of type BINSUM1UB: 1004 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: -9.00 Elapsed time: 7.02 Node: 600 MINTO: Updating primal (Integral solution) Value: -8.00 Elapsed time: 9.41 Node: 943 MINTO: ... evaluated 1000 nodes ... (best bound -3.132154, queue 997) MINTO: Updating primal (Integral solution) Value: -7.00 Elapsed time: 14.25 Node: 1591 MINTO: ... evaluated 2000 nodes ... (best bound -3.132154, queue 1015) MINTO: ... evaluated 3000 nodes ... (best bound -3.132154, queue 823) MINTO: ... evaluated 4000 nodes ... (best bound -3.132154, queue 597) MINTO: ... evaluated 5000 nodes ... (best bound -3.132154, queue 439) MINTO: ... evaluated 6000 nodes ... (best bound -3.132154, queue 267) MINTO: ... evaluated 7000 nodes ... (best bound -3.132154, queue 145) MINTO: ... evaluated 8000 nodes ... (best bound -3.132154, queue 89) MINTO: ... evaluated 9000 nodes ... (best bound -3.132154, queue 55) MINTO: ... evaluated 10000 nodes ... (best bound -3.132154, queue 53) MINTO: ... evaluated 11000 nodes ... (best bound -3.351978, queue 45) MINTO: ... evaluated 12000 nodes ... (best bound -3.351978, queue 33) MINTO: ... evaluated 13000 nodes ... (best bound -4.175767, queue 33) MINTO: Value of solution: 7.000000 MINTO: Non-zero variables in the solution: xopt[0] = 7.000000 (C0001) xopt[56] = 1.000000 (C0057) xopt[77] = 1.000000 (C0078) xopt[86] = 1.000000 (C0087) xopt[163] = 1.000000 (C0164) xopt[209] = 1.000000 (C0210) xopt[236] = 1.000000 (C0237) xopt[262] = 1.000000 (C0263) xopt[263] = 1.000000 (C0264) xopt[264] = 1.000000 (C0265) xopt[274] = 1.000000 (C0275) xopt[340] = 1.000000 (C0341) xopt[347] = 1.000000 (C0348) xopt[396] = 1.000000 (C0397) xopt[418] = 1.000000 (C0419) xopt[423] = 1.000000 (C0424) xopt[453] = 1.000000 (C0454) xopt[456] = 1.000000 (C0457) xopt[471] = 1.000000 (C0472) xopt[493] = 1.000000 (C0494) xopt[519] = 1.000000 (C0520) xopt[542] = 1.000000 (C0543) xopt[549] = 1.000000 (C0550) xopt[550] = 1.000000 (C0551) xopt[561] = 1.000000 (C0562) xopt[575] = 1.000000 (C0576) xopt[611] = 1.000000 (C0612) zopt = 7.000000 zroot = 2.216484 zinit = 2.216484 MINTO: Branch and bound statistics Maximum number of unevaluated nodes = 1159 Number of evaluated nodes = 13431 Depth of the tree = 67 Number of linear programs solved = 13431 Maximum number of rows in active LP = 1085 (1085) 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.01 appl_exit: 0.00 appl_fathom: 0.00 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.02 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.10 Primal heuristic: 2.44 Bound improvement: 79.31 Clique cut generation: 0.02 Implication cut generation: 0.00 Knapsack cover generation: 0.00 GUB cover generation: 0.00 Surrogate knapsack cover generation: 0.00 Flow cover generation: 0.00 Cut pool search: 0.01 Cut Management: 0.00 Branching: 0.66 Time LP solving: 0.00 Total elapsed time: 85.24 Command exited with non-zero status 161 85.14user 0.10system 1:25.30elapsed 99%CPU (0avgtext+0avgdata 0maxresident)k 0inputs+0outputs (0major+9931minor)pagefaults 0swaps