The Pseudo-Boolean Optimization Website

 Medium 0.42

Back Home Up Next

 

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

41,974

43,846

48,747

46,883

45,943

1000 95,435 96,011 93,440 87,531 80,867
1500 141,589 142,738 127,427 120,557 111,614
2000 189,774 183,209 162,489 148,662 137,673
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

46,899

43,865

47,320

52,422

45,439

1000 95,566 94,410 88,357 86,585 87,283
1500 144,471 135,533 123,905 120,833 114,238
2000 187,824 177,707 157,964 154,196 137,134
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

41,568

47,777

49,491

44,961

46,742

1000 93,493 97,070 94,357 90,572 82,025
1500 136,883 134,545 130,160 121,116 111,867
2000 181,180 171,510 161,149 147,567 137,626
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

41,600

47,130

50,180

45,726

45,108

1000 95,596 95,480 94,312 88,370 83,333
1500 143,398 142,405 121,396 117,008 116,569
2000 193,124 174,643 164,204 150,982 139,716
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

41,589

51,367

49,118

50,430

44,376

1000 91,518 97,091 92,871 87,252 80,969
1500 143,808 136,009 124,660 116,812 116,777
2000 187,413 172,544 164,751 146,354 140,650
 

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