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 AIR05 MINTO: Problem statistics: Number of constraints: 426 Number of variables: 7195 (0) Number of nonzero's: 52121 Number of continuous variables: 0 Number of binary variables: 7195 Number of integer variables: 0 MINTO: Presolve eliminated 0 constraints and 982 variables Presolve made 0 coefficient changes MINTO: Row structure analysis (after preprocessing): Number of constraints of type BINSUM1EQ: 426 MINTO control parameters: Objective sense : minimization Output level : 1 Maximum cpu time : 1000002 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: -26588.00 Elapsed time: 1.90 Node: 1 MINTO: Updating primal (Integral solution) Value: -26583.00 Elapsed time: 56.10 Node: 547 MINTO: Updating primal (Integral solution) Value: -26533.00 Elapsed time: 73.26 Node: 732 MINTO: Updating primal (Integral solution) Value: -26439.00 Elapsed time: 75.86 Node: 767 MINTO: Updating primal (Integral solution) Value: -26374.00 Elapsed time: 79.55 Node: 806 MINTO: Value of solution: 26374.000000 MINTO: Non-zero variables in the solution: xopt[2] = 1.000000 (CL000003) xopt[4] = 1.000000 (CL000005) xopt[5] = 1.000000 (CL000006) xopt[6] = 1.000000 (CL000007) xopt[7] = 1.000000 (CL000008) xopt[8] = 1.000000 (CL000009) xopt[9] = 1.000000 (CL000010) xopt[10] = 1.000000 (CL000011) xopt[14] = 1.000000 (CL000015) xopt[15] = 1.000000 (CL000016) xopt[19] = 1.000000 (CL000020) xopt[20] = 1.000000 (CL000021) xopt[25] = 1.000000 (CL000026) xopt[34] = 1.000000 (CL000035) xopt[35] = 1.000000 (CL000036) xopt[37] = 1.000000 (CL000038) xopt[39] = 1.000000 (CL000040) xopt[40] = 1.000000 (CL000041) xopt[41] = 1.000000 (CL000042) xopt[42] = 1.000000 (CL000043) xopt[43] = 1.000000 (CL000044) xopt[44] = 1.000000 (CL000045) xopt[45] = 1.000000 (CL000046) xopt[47] = 1.000000 (CL000048) xopt[48] = 1.000000 (CL000049) xopt[50] = 1.000000 (CL000051) xopt[52] = 1.000000 (CL000053) xopt[55] = 1.000000 (CL000056) xopt[57] = 1.000000 (CL000058) xopt[58] = 1.000000 (CL000059) xopt[66] = 1.000000 (CL000067) xopt[72] = 1.000000 (CL000073) xopt[105] = 1.000000 (CL000106) xopt[218] = 1.000000 (CL000219) xopt[254] = 1.000000 (CL000255) xopt[293] = 1.000000 (CL000294) xopt[381] = 1.000000 (CL000382) xopt[695] = 1.000000 (CL000696) xopt[1091] = 1.000000 (CL001092) xopt[1209] = 1.000000 (CL001210) xopt[1294] = 1.000000 (CL001295) xopt[1323] = 1.000000 (CL001324) xopt[1348] = 1.000000 (CL001349) xopt[1580] = 1.000000 (CL001581) xopt[1769] = 1.000000 (CL001770) xopt[2067] = 1.000000 (CL002068) xopt[2156] = 1.000000 (CL002157) xopt[2162] = 1.000000 (CL002163) xopt[2714] = 1.000000 (CL002715) xopt[2732] = 1.000000 (CL002733) xopt[3113] = 1.000000 (CL003114) xopt[3131] = 1.000000 (CL003132) xopt[3145] = 1.000000 (CL003146) xopt[3323] = 1.000000 (CL003324) xopt[3398] = 1.000000 (CL003399) xopt[3520] = 1.000000 (CL003521) xopt[3579] = 1.000000 (CL003580) xopt[4295] = 1.000000 (CL004296) xopt[5025] = 1.000000 (CL005026) xopt[5175] = 1.000000 (CL005176) xopt[5317] = 1.000000 (CL005318) xopt[5340] = 1.000000 (CL005341) xopt[6324] = 1.000000 (CL006325) xopt[6504] = 1.000000 (CL006505) xopt[6645] = 1.000000 (CL006646) xopt[6809] = 1.000000 (CL006810) zopt = 26374.000000 zroot = 25974.483618 zinit = 25877.609268 MINTO: Branch and bound statistics Maximum number of unevaluated nodes = 15 Number of evaluated nodes = 905 Depth of the tree = 24 Number of linear programs solved = 1069 Maximum number of rows in active LP = 508 (426) MINTO: Cut generation statistics Number of generated clique inequalities = 518 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.01 appl_constraints: 0.00 appl_delconstraints: 0.00 appl_divide: 0.00 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.00 appl_primal: 0.01 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: 1.75 Preprocessing and probing: 0.77 Primal heuristic: 0.51 Bound improvement: 77.17 Clique cut generation: 2.37 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.00 Cut Management: 0.00 Branching: 4.84 Time LP solving: 0.00 Total elapsed time: 89.03 Command exited with non-zero status 161 88.85user 0.18system 1:29.11elapsed 99%CPU (0avgtext+0avgdata 0maxresident)k 0inputs+0outputs (0major+5494minor)pagefaults 0swaps