Presolve eliminates 18 constraints and 42 variables. Adjusted problem: 1002 variables, all binary 2003 constraints, all linear; 5756 nonzeros 1 linear objective; 0 nonzeros. CPLEX 8.1.0: clocktype = 2 timing=1 mipdisplay=2 mipstartvalue=1 Clique table members: 1778 MIP emphasis: balance optimality and feasibility Root relaxation solution time = 0.53 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 6.0000 592 6.0000 777 6.0000 567 Cuts: 162 1079 6.0000 527 Cuts: 71 1403 6.0000 529 Cuts: 4 1420 100 12 6.0000 109 6.0000 6893 200 12 6.0000 190 6.0000 13191 300 21 6.0000 44 6.0000 15747 400 20 infeasible 6.0000 17870 500 12 infeasible 6.0000 19072 600 8 infeasible 6.0000 22015 700 9 6.0000 63 6.0000 24617 800 8 infeasible 6.0000 25923 900 8 infeasible 6.0000 28356 1000 10 6.0000 49 6.0000 31776 Elapsed b&c time = 30.08 sec. (tree size = 0.01 MB) 1100 6 6.0000 112 6.0000 36365 1200 6 6.0000 64 6.0000 39866 1300 10 6.0000 193 6.0000 44679 1400 4 6.0000 120 6.0000 52327 1500 7 infeasible 6.0000 56981 1600 10 infeasible 6.0000 61860 1700 16 infeasible 6.0000 64627 1800 14 infeasible 6.0000 66523 1900 10 infeasible 6.0000 69936 2000 9 infeasible 6.0000 73225 Elapsed b&c time = 69.96 sec. (tree size = 0.01 MB) 2100 7 6.0000 64 6.0000 76475 2200 9 6.0000 36 6.0000 78916 2300 5 6.0000 146 6.0000 81737 2400 17 infeasible 6.0000 84179 2500 5 infeasible 6.0000 87534 2600 5 infeasible 6.0000 91189 2700 9 6.0000 277 6.0000 94575 2800 13 6.0000 243 6.0000 97119 2900 13 infeasible 6.0000 101442 3000 9 infeasible 6.0000 106710 Elapsed b&c time = 106.39 sec. (tree size = 0.01 MB) 3100 11 infeasible 6.0000 113789 3200 13 infeasible 6.0000 118801 3300 11 6.0000 158 6.0000 123655 3400 7 6.0000 243 6.0000 129926 3500 14 infeasible 6.0000 133887 3600 11 6.0000 156 6.0000 137705 3700 7 infeasible 6.0000 143127 3800 9 infeasible 6.0000 146232 3900 7 infeasible 6.0000 150377 4000 15 infeasible 6.0000 153068 Elapsed b&c time = 153.00 sec. (tree size = 0.01 MB) 4100 11 infeasible 6.0000 154938 4200 13 6.0000 44 6.0000 159622 4300 11 infeasible 6.0000 165833 4400 11 infeasible 6.0000 168462 4500 11 infeasible 6.0000 171650 4600 11 6.0000 115 6.0000 174280 4700 8 infeasible 6.0000 177761 4800 6 6.0000 320 6.0000 180167 4900 12 infeasible 6.0000 187346 5000 15 6.0000 57 6.0000 192555 Elapsed b&c time = 194.22 sec. (tree size = 0.01 MB) 5100 15 6.0000 181 6.0000 194802 5200 17 infeasible 6.0000 197394 5300 19 6.0000 50 6.0000 198354 5400 17 infeasible 6.0000 199606 5500 19 infeasible 6.0000 202702 5600 17 infeasible 6.0000 204428 5700 13 infeasible 6.0000 207120 5800 19 6.0000 47 6.0000 207846 5900 17 6.0000 49 6.0000 208370 6000 19 6.0000 34 6.0000 208791 Elapsed b&c time = 209.66 sec. (tree size = 0.01 MB) 6100 19 6.0000 23 6.0000 209197 6200 19 infeasible 6.0000 210944 6300 13 infeasible 6.0000 211882 6400 19 infeasible 6.0000 213702 6500 17 infeasible 6.0000 214611 6600 21 infeasible 6.0000 216396 6700 17 6.0000 19 6.0000 216664 6800 15 infeasible 6.0000 216978 6900 15 6.0000 23 6.0000 217963 7000 17 infeasible 6.0000 219501 Elapsed b&c time = 221.10 sec. (tree size = 0.01 MB) 7100 13 infeasible 6.0000 222065 7200 19 6.0000 19 6.0000 223360 7300 23 infeasible 6.0000 224743 7400 21 infeasible 6.0000 225416 7500 15 6.0000 134 6.0000 226186 7600 13 infeasible 6.0000 227593 7700 17 6.0000 11 6.0000 228725 7800 13 infeasible 6.0000 229292 7900 17 6.0000 15 6.0000 230048 8000 17 6.0000 115 6.0000 230767 Elapsed b&c time = 232.50 sec. (tree size = 0.01 MB) 8100 17 6.0000 137 6.0000 232251 8200 19 infeasible 6.0000 233319 8300 17 6.0000 121 6.0000 234398 8400 20 6.0000 109 6.0000 235191 8500 22 infeasible 6.0000 236373 8600 22 infeasible 6.0000 236833 8700 22 6.0000 19 6.0000 237370 8800 19 infeasible 6.0000 238825 8900 19 infeasible 6.0000 239366 9000 13 6.0000 103 6.0000 240091 Elapsed b&c time = 242.52 sec. (tree size = 0.01 MB) 9100 16 6.0000 32 6.0000 242495 9200 9 6.0000 107 6.0000 247160 9300 8 infeasible 6.0000 252058 9400 14 6.0000 239 6.0000 255475 9500 18 infeasible 6.0000 258503 9600 8 6.0000 233 6.0000 260913 9700 6 infeasible 6.0000 264396 9800 16 infeasible 6.0000 269545 9900 12 infeasible 6.0000 271544 10000 22 6.0000 33 6.0000 273913 Elapsed b&c time = 277.16 sec. (tree size = 0.02 MB) 10100 16 infeasible 6.0000 276091 10200 18 infeasible 6.0000 280039 10300 16 infeasible 6.0000 282390 10400 14 infeasible 6.0000 286126 10500 10 6.0000 211 6.0000 290635 10600 10 infeasible 6.0000 293966 10700 16 infeasible 6.0000 299245 10800 13 infeasible 6.0000 303858 10900 11 6.0000 181 6.0000 306075 11000 9 infeasible 6.0000 308628 Elapsed b&c time = 311.16 sec. (tree size = 0.01 MB) 11100 13 infeasible 6.0000 310833 11200 19 infeasible 6.0000 313582 11300 15 6.0000 82 6.0000 315799 11400 15 6.0000 132 6.0000 319998 11500 15 infeasible 6.0000 323169 11600 9 infeasible 6.0000 327699 11700 15 6.0000 126 6.0000 331714 11800 11 infeasible 6.0000 334463 11900 19 infeasible 6.0000 339978 12000 22 infeasible 6.0000 341742 Elapsed b&c time = 341.87 sec. (tree size = 0.02 MB) 12100 13 infeasible 6.0000 345419 12200 13 6.0000 231 6.0000 350988 12300 16 6.0000 97 6.0000 353359 12400 18 infeasible 6.0000 355915 12500 17 infeasible 6.0000 359020 12600 17 infeasible 6.0000 362259 12700 18 6.0000 152 6.0000 365767 12800 14 6.0000 211 6.0000 367738 12900 12 6.0000 113 6.0000 371318 13000 17 infeasible 6.0000 373408 Elapsed b&c time = 372.26 sec. (tree size = 0.01 MB) 13100 12 infeasible 6.0000 374633 13200 16 6.0000 153 6.0000 376457 13300 12 infeasible 6.0000 378339 13400 17 infeasible 6.0000 380479 13500 13 6.0000 122 6.0000 381898 13600 13 infeasible 6.0000 383485 13700 11 6.0000 144 6.0000 385310 13800 15 6.0000 54 6.0000 388144 13900 11 6.0000 123 6.0000 390455 14000 8 6.0000 263 6.0000 394438 Elapsed b&c time = 391.53 sec. (tree size = 0.01 MB) 14100 14 infeasible 6.0000 395859 14200 14 6.0000 71 6.0000 398286 14300 21 infeasible 6.0000 400283 14400 19 6.0000 131 6.0000 402304 14500 15 infeasible 6.0000 404873 14600 16 6.0000 136 6.0000 406963 14700 18 6.0000 159 6.0000 407841 14800 14 6.0000 200 6.0000 408944 14900 22 infeasible 6.0000 411441 15000 22 infeasible 6.0000 414453 Elapsed b&c time = 409.10 sec. (tree size = 0.02 MB) 15100 14 6.0000 159 6.0000 417393 15200 15 6.0000 93 6.0000 419508 15300 17 infeasible 6.0000 421333 15400 15 infeasible 6.0000 423022 15500 17 infeasible 6.0000 425330 15600 17 infeasible 6.0000 427271 15700 15 infeasible 6.0000 429141 15800 15 infeasible 6.0000 429773 15900 16 6.0000 89 6.0000 432791 16000 13 infeasible 6.0000 437356 Elapsed b&c time = 428.72 sec. (tree size = 0.01 MB) 16100 13 infeasible 6.0000 441356 16200 19 6.0000 118 6.0000 444027 16300 26 infeasible 6.0000 446766 16400 11 6.0000 151 6.0000 449352 16500 21 6.0000 135 6.0000 452037 16600 21 infeasible 6.0000 454838 16700 14 6.0000 211 6.0000 458175 16800 15 6.0000 212 6.0000 461744 16900 18 infeasible 6.0000 464965 17000 12 infeasible 6.0000 469334 Elapsed b&c time = 456.25 sec. (tree size = 0.01 MB) 17100 10 6.0000 162 6.0000 473490 17200 12 6.0000 107 6.0000 475577 17300 16 infeasible 6.0000 478160 17400 14 6.0000 97 6.0000 480639 17500 13 infeasible 6.0000 481483 17600 16 6.0000 69 6.0000 483645 17700 16 infeasible 6.0000 485960 17800 10 6.0000 159 6.0000 488571 17900 14 infeasible 6.0000 491897 18000 12 6.0000 118 6.0000 495037 Elapsed b&c time = 478.61 sec. (tree size = 0.01 MB) 18100 12 6.0000 152 6.0000 497156 18200 13 6.0000 133 6.0000 499581 18300 9 6.0000 239 6.0000 502426 18400 14 infeasible 6.0000 504567 18500 16 infeasible 6.0000 506207 18600 10 6.0000 198 6.0000 507883 18700 11 6.0000 210 6.0000 510139 18800 7 6.0000 292 6.0000 512790 18900 13 6.0000 200 6.0000 514251 19000 11 infeasible 6.0000 515919 Elapsed b&c time = 496.39 sec. (tree size = 0.01 MB) 19100 11 6.0000 212 6.0000 517215 19200 13 infeasible 6.0000 518829 19300 12 infeasible 6.0000 521421 19400 8 6.0000 280 6.0000 524475 19500 6 infeasible 6.0000 527484 19600 12 6.0000 162 6.0000 530860 19700 10 6.0000 192 6.0000 532310 19800 8 infeasible 6.0000 535141 19900 5 6.0000 349 6.0000 539374 20000 19 infeasible 6.0000 542809 Elapsed b&c time = 522.70 sec. (tree size = 0.01 MB) 20100 18 infeasible 6.0000 544044 20200 14 6.0000 37 6.0000 545285 20300 10 6.0000 291 6.0000 548022 20400 14 6.0000 67 6.0000 550765 20500 12 6.0000 37 6.0000 551581 20600 16 infeasible 6.0000 552014 20700 16 infeasible 6.0000 552916 20800 10 6.0000 194 6.0000 557193 20900 15 6.0000 73 6.0000 559128 21000 15 infeasible 6.0000 560592 Elapsed b&c time = 540.33 sec. (tree size = 0.01 MB) 21100 13 6.0000 130 6.0000 561559 21200 13 6.0000 97 6.0000 562274 21300 13 infeasible 6.0000 563012 21400 11 6.0000 48 6.0000 564116 21500 13 6.0000 68 6.0000 565099 21600 14 infeasible 6.0000 566687 21700 11 6.0000 96 6.0000 568290 21800 11 infeasible 6.0000 569924 21900 16 infeasible 6.0000 572409 22000 14 6.0000 126 6.0000 573876 Elapsed b&c time = 552.04 sec. (tree size = 0.01 MB) 22100 12 infeasible 6.0000 574812 22200 8 6.0000 140 6.0000 576286 22300 12 6.0000 66 6.0000 578066 22400 6 infeasible 6.0000 580080 22500 7 infeasible 6.0000 583622 22600 18 infeasible 6.0000 585455 22700 16 6.0000 32 6.0000 586750 22800 16 6.0000 206 6.0000 589229 22900 22 infeasible 6.0000 591175 23000 22 6.0000 99 6.0000 592820 Elapsed b&c time = 570.04 sec. (tree size = 0.02 MB) 23100 14 infeasible 6.0000 595456 23200 12 infeasible 6.0000 598737 23300 15 infeasible 6.0000 601193 23400 17 infeasible 6.0000 604047 23500 16 infeasible 6.0000 606692 23600 17 6.0000 54 6.0000 608789 23700 19 infeasible 6.0000 609850 23800 19 6.0000 85 6.0000 612085 23900 17 infeasible 6.0000 614284 24000 19 6.0000 122 6.0000 617113 Elapsed b&c time = 592.27 sec. (tree size = 0.01 MB) 24100 19 6.0000 132 6.0000 619317 24200 17 6.0000 83 6.0000 621031 24300 13 infeasible 6.0000 623905 24400 11 infeasible 6.0000 626283 24500 9 infeasible 6.0000 628113 24600 13 infeasible 6.0000 633927 24700 7 infeasible 6.0000 636354 24800 11 6.0000 52 6.0000 641394 24900 7 infeasible 6.0000 648047 25000 9 6.0000 139 6.0000 653806 Elapsed b&c time = 630.52 sec. (tree size = 0.01 MB) 25100 8 6.0000 182 6.0000 659669 25200 12 infeasible 6.0000 665049 25300 14 infeasible 6.0000 669162 25400 14 infeasible 6.0000 672015 25500 6 infeasible 6.0000 677385 25600 6 6.0000 135 6.0000 681200 25700 4 6.0000 303 6.0000 684136 25800 14 infeasible 6.0000 686261 25900 4 6.0000 266 6.0000 689010 26000 8 6.0000 192 6.0000 692468 Elapsed b&c time = 669.59 sec. (tree size = 0.01 MB) 26100 8 6.0000 132 6.0000 694682 26200 6 6.0000 123 6.0000 696855 26300 8 infeasible 6.0000 699363 26400 10 infeasible 6.0000 702116 26500 8 6.0000 158 6.0000 704019 26600 10 6.0000 159 6.0000 705780 26700 12 infeasible 6.0000 708043 26800 10 6.0000 194 6.0000 710720 26900 8 6.0000 167 6.0000 714561 27000 4 6.0000 317 6.0000 717274 Elapsed b&c time = 692.84 sec. (tree size = 0.01 MB) 27100 16 6.0000 98 6.0000 719145 27200 14 infeasible 6.0000 721069 27300 14 6.0000 123 6.0000 723641 27400 10 6.0000 205 6.0000 725685 27500 17 infeasible 6.0000 728022 27600 11 infeasible 6.0000 730881 27700 17 6.0000 91 6.0000 732843 27800 13 infeasible 6.0000 734894 27900 14 infeasible 6.0000 738006 28000 12 6.0000 128 6.0000 742012 Elapsed b&c time = 716.80 sec. (tree size = 0.01 MB) 28100 13 6.0000 83 6.0000 744657 28200 15 infeasible 6.0000 747223 28300 13 6.0000 157 6.0000 749623 28400 13 6.0000 137 6.0000 751458 28500 14 6.0000 112 6.0000 753559 28600 14 6.0000 95 6.0000 755677 28700 6 6.0000 180 6.0000 757350 28800 10 infeasible 6.0000 759352 28900 9 6.0000 131 6.0000 761951 GUB cover cuts applied: 22 Clique cuts applied: 24 Cover cuts applied: 7 Gomory fractional cuts applied: 4 Times (seconds): Input = 0.05 Solve = 739.78 Output = 0 CPLEX 8.1.0: integer infeasible or unbounded in presolve. 763322 MIP simplex iterations 28955 branch-and-bound nodes; no basis. The minimum number of monitor units (shapes) is 6 Monitor Unit 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 zero rows: 0, 0, 0, 0, 0, 0, 0, Monitor Unit 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 zero rows: 0, 0, 0, 0, 0, 0, 0, Monitor Unit 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 zero rows: 0, 0, 0, 0, 0, 0, 0, Monitor Unit 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 zero rows: 0, 0, 0, 0, 0, 0, 0, Monitor Unit 5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 zero rows: 0, 0, 0, 0, 0, 0, 0, Monitor Unit 6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 zero rows: 0, 0, 0, 0, 0, 0, 0,