Gurobi 5.0.1 (linux64) logging started Sun Nov 18 01:09:58 2012

Optimize a model with 323 rows, 219 columns and 1024 nonzeros
Presolve time: 0.00s
Presolved: 323 rows, 219 columns, 1024 nonzeros
Variable types: 0 continuous, 219 integer (219 binary)
Found heuristic solution: objective 69.0000000

Root relaxation: objective 0.000000e+00, 89 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   58   69.00000    0.00000   100%     -    0s
H    0     0                      58.0000000    0.00000   100%     -    0s
     0     0    0.65909    0   59   58.00000    0.65909  98.9%     -    0s
H    0     0                      56.0000000    0.65909  98.8%     -    0s
     0     0    1.13171    0   60   56.00000    1.13171  98.0%     -    0s
     0     0    1.49483    0   61   56.00000    1.49483  97.3%     -    0s
     0     0    1.57113    0   63   56.00000    1.57113  97.2%     -    0s
     0     0    1.60098    0   63   56.00000    1.60098  97.1%     -    0s
     0     0    1.63115    0   64   56.00000    1.63115  97.1%     -    0s
     0     0    1.63847    0   65   56.00000    1.63847  97.1%     -    0s
     0     2    1.64477    0   65   56.00000    1.64477  97.1%     -    0s
H   32    32                      45.0000000    4.52453  89.9%  42.2    0s
*   39    38              23      44.0000000    4.52453  89.7%  36.7    0s
*   45    35              24      43.0000000    4.52453  89.5%  32.8    0s
*   73    58              16      41.0000000    6.20320  84.9%  33.7    0s
*  109    76              18      39.0000000    8.06919  79.3%  30.7    0s
  6468   690   37.21951   21  101   39.00000   29.33333  24.8%  22.1    5s

Explored 12020 nodes (246730 simplex iterations) in 8.14 seconds
Thread count was 1 (of 16 available processors)

Optimal solution found (tolerance 1.00e-04)
Best objective 3.900000000000e+01, best bound 3.900000000000e+01, gap 0.0%