The Pseudo-Boolean Optimization Website

 Medium 0.50

Back Home Up Next

 

  Best Known Lower Bound to the Maximum
Problem Set #1
n/d 20% 40% 60% 80% 100%
500

82,164

112,217

141,214

172,073

214,322

1000 229,347 325,362 415,489 497,868 551,868
1500 457,276 663,776 772,924 922,818 1,070,934
2000 691,740 970,379 1,168,396 1,324,771 1,570,582
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

88,010

125,466

156,365

153,095

197,269

1000 246,233 348,107 410,045 482,300 568,184
1500 440,530 645,655 752,067 929,444 984,566
2000 709,971 1,009,028 1,235,697 1,414,988 1,586,734
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

83,145

125,155

150,164

179,327

171,775

1000 237,238 368,750 418,080 481,489 545,780
1500 456,313 629,887 794,870 869,193 1,021,348
2000 656,037 984,455 1,217,447 1,421,431 1,559,670
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

92,048

124,591

145,362

192,073

185,512

1000 233,177 342,519 430,890 504,294 553,490
1500 440,962 639,618 767,403 905,469 1,041,373
2000 713,790 947,935 1,211,402 1,400,354 1,587,921
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

86,270

128,388

148,100

187,056

174,463

1000 250,973 372,139 427,026 492,297 566,478
1500 458,484 633,179 768,843 905,612 1,030,427
2000 700,781 987,201 1,197,573 1,378,113 1,524,232
 

Copyright © 2003 RUTCOR.
For problems or questions regarding the PBO website contact pbo@rutcor.rutgers.edu.
Last updated: February 12, 2005.