current bounds on the number of colors: 0 -- 35 Gurobi 5.0.1 (linux64) logging started Thu Dec 13 17:57:39 2012 Optimize a model with 5373 rows, 909 columns and 16609 nonzeros Presolve time: 0.02s Presolved: 5373 rows, 909 columns, 16609 nonzeros Variable types: 0 continuous, 909 integer (909 binary) Root relaxation: objective 0.000000e+00, 92 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 0.0000000 0.00000 0.0% - 0s Explored 0 nodes (288 simplex iterations) in 0.04 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0% current bounds on the number of colors: 0 -- 17 Gurobi 5.0.1 (linux64) logging started Thu Dec 13 17:57:39 2012 Optimize a model with 2547 rows, 594 columns and 7816 nonzeros Presolve time: 0.01s Presolved: 2547 rows, 594 columns, 7816 nonzeros Variable types: 0 continuous, 594 integer (594 binary) Root relaxation: objective 0.000000e+00, 72 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 34 - 0.00000 - - 0s H 0 0 0.0000000 0.00000 0.0% - 0s Explored 0 nodes (828 simplex iterations) in 0.04 seconds Thread count was 1 (of 16 available processors) Optimal solution found (tolerance 1.00e-04) Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0% current bounds on the number of colors: 0 -- 8 Gurobi 5.0.1 (linux64) logging started Thu Dec 13 17:57:39 2012 Optimize a model with 1291 rows, 454 columns and 3908 nonzeros Presolve time: 0.00s Presolved: 1291 rows, 454 columns, 3908 nonzeros Variable types: 0 continuous, 454 integer (454 binary) Root relaxation: objective 0.000000e+00, 73 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 50 - 0.00000 - - 0s 0 0 0.00000 0 50 - 0.00000 - - 0s 0 0 infeasible 0 - 0.10000 - - 0s Explored 0 nodes (1199 simplex iterations) in 0.10 seconds Thread count was 1 (of 16 available processors) Model objective exceeds cutoff Best objective -, best bound 1.000000000000e+00, gap - current bounds on the number of colors: 4 -- 8 Gurobi 5.0.1 (linux64) logging started Thu Dec 13 17:57:39 2012 Optimize a model with 1919 rows, 524 columns and 5862 nonzeros Presolve time: 0.00s Presolved: 1919 rows, 524 columns, 5862 nonzeros Variable types: 0 continuous, 524 integer (524 binary) Root relaxation: objective 0.000000e+00, 71 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 42 - 0.00000 - - 0s 0 0 0.00000 0 54 - 0.00000 - - 0s 0 0 infeasible 0 - 0.10000 - - 0s Explored 0 nodes (1358 simplex iterations) in 0.10 seconds Thread count was 1 (of 16 available processors) Model objective exceeds cutoff Best objective -, best bound 1.000000000000e+00, gap - current bounds on the number of colors: 6 -- 8 Gurobi 5.0.1 (linux64) logging started Thu Dec 13 17:57:40 2012 Optimize a model with 2233 rows, 559 columns and 6839 nonzeros Presolve time: 0.01s Presolved: 2233 rows, 559 columns, 6839 nonzeros Variable types: 0 continuous, 559 integer (559 binary) Root relaxation: objective 0.000000e+00, 71 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 28 - 0.00000 - - 0s 0 0 0.00000 0 47 - 0.00000 - - 0s 0 0 0.00000 0 94 - 0.00000 - - 0s 0 0 0.00000 0 134 - 0.00000 - - 0s 0 0 0.00000 0 58 - 0.00000 - - 0s 0 0 0.00000 0 96 - 0.00000 - - 0s 0 0 0.00000 0 102 - 0.00000 - - 0s 0 0 0.00000 0 107 - 0.00000 - - 0s 0 0 0.00000 0 107 - 0.00000 - - 0s 0 2 0.00000 0 107 - 0.00000 - - 0s Cutting planes: Clique: 24 Zero half: 4 Explored 13 nodes (11264 simplex iterations) in 0.92 seconds Thread count was 1 (of 16 available processors) Model objective exceeds cutoff Best objective -, best bound -, gap - optimal solution found: number of colors: 8