Reading in ALPS parameters ... Reading in BLIS parameters ... Alps0110I ALPS version 1.0 (Parallel, MPI) Alps0050I Launched 2 processes Alps0030I Data file: p0033.mps Coin0001I At line 15 NAME P0033 Coin0001I At line 16 ROWS Coin0001I At line 34 COLUMNS Coin0001I At line 109 RHS Coin0001I At line 118 BOUNDS Coin0001I At line 152 ENDATA Coin0002I Problem P0033 has 16 rows, 33 columns and 98 elements Bcps0001I BiCePS version 0.9 Blis0001I BLIS version 0.9 Blis0043I Objective coefficients are multiples of 1 Alps0035I Using 1 hub Alps0106I The memory size of a node is about 5328 bytes Alps0165I Starting spiral initialization Alps0148I Master[0] is creating nodes (2) for its hubs during rampup Blis0030I Processing the root node (16 rows, 33 columns) Clp0006I 0 Obj 0 Primal inf 18.4925 (10) Clp0006I 19 Obj 2520.57 Clp0000I Optimal - objective value 2520.57 Blis0035I Processing the first root relaxation took CPU time 0.0010 seconds Blis0055I Node 0, called Clique cut generator 20 times, generated 0 cuts, CPU time 0.0000 seconds, current strategy 1 Blis0055I Node 0, called Flow Cover cut generator 20 times, generated 0 cuts, CPU time 0.0000 seconds, current strategy 2 Blis0055I Node 0, called Knapsack cut generator 20 times, generated 56 cuts, CPU time 0.0090 seconds, current strategy 1 Blis0055I Node 0, called Gomory cut generator 20 times, generated 240 cuts, CPU time 0.0050 seconds, current strategy 1 Blis0065I Node 0, called Rounding heuristic 21 times, found 0 solutions, CPU time 0.0000 seconds, current strategy 2 Alps0166I Completed spiral initialization Alps0076I Master[0] initially balances the hubs every 0.0335 seconds Node BestFeasible BestBound Gap Time Left 31 3089 0.00% 0 0 Alps0190I Master[0] is doing termination check Alps0192I Master[0] asked other processes to stop searching Blis0058I Relative optimality gap is 0.00% Alps0208I Found an optimal solution. 31 nodes processed, 0 nodes left =================== SEARCH RESULTS ================== Number of nodes processed = 31 Number of nodes left = 0 Max number of nodes processed by a worker = 30 Min number of nodes processed by a worker = 30 Std Dev of number of nodes processed by a worker = 0 ---------------------------------- Average tree depth = 10 Max tree depth on workers = 10 Min tree depth on workers = 10 Std Dev of tree depth on workers = 0 ---------------------------------- Average RampUp = 0.049704 Max RampUp = 0.049793 Min RampUp = 0.0496149 Std Dev of RampUp = 8.90493e-05 ---------------------------------- Average Idle = 0 Max Idle = 0 Min Idle = 0 Std Dev of Idle = 0 ---------------------------------- Average MsgTime = 0.0432222 Max MsgTime = 0.0432222 Min MsgTime = 0.0432222 Std Dev of MsgTime = 0 ---------------------------------- Average RampDown = 0.0799811 Max RampDown = 0.0799811 Min RampDown = 0.0799811 Std Dev of RampDown = 0 ---------------------------------- Quality balance = 0 Quantity balance = 0 Inter-balance = 0 Intra-balance = 0 Worker asked workload = 1 Worker donate success = 0 Worker donate fail = 1 Subtree split = 0 Subtree whole = 0 Subtree change = 0 ---------------------------------- Search CPU time = 0.077988 seconds, max = 0.077988, min = 0.06699, total CPU time = 0.144978 Search wallclock = 0.2236 seconds, max = 0.182772, min = 0.182633, total wallclock = 0.365405 Best solution quality = 3089 ; node required to find this solution = 0 ===================================================== ================= OPTIMAL SOLUTION ================== Cost = 3089 x[0] = 1 x[6] = 1 x[7] = 1 x[9] = 1 x[13] = 1 x[17] = 1 x[18] = 1 x[21] = 1 x[23] = 1 x[24] = 1 x[25] = 1 x[26] = 1 x[27] = 1 x[28] = 1 x[29] = 1 =====================================================