The Pseudo-Boolean Optimization Website

 Medium 0.14

Back Home Up Next

 

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

7,431

5,165

4,382

3,592

3,023

1000 10,640 7,269 5,841 4,798 3,953
1500 13,318 8,683 6,595 5,605 4,867
2000 15,160 9,943 7,600 5,787 4,960
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

7,416

5,108

4,447

3,456

3,110

1000 10,683 7,634 5,631 4,795 3,985
1500 13,710 8,603 6,970 5,570 4,706
2000 14,757 9,732 7,586 5,829 4,841
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

7,512

5,086

4,180

3,480

3,274

1000 10,962 7,379 5,696 4,714 4,005
1500 13,042 8,667 6,836 5,446 4,791
2000 14,951 9,884 7,155 5,908 5,020
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

7,759

5,145

4,295

3,664

3,286

1000 10,679 7,704 5,718 4,959 4,184
1500 13,315 8,763 6,642 5,377 4,481
2000 15,265 9,946 7,639 5,998 4,808
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

7,160

5,440

4,321

3,646

3,021

1000 10,984 7,307 5,767 4,637 4,050
1500 13,241 8,771 6,715 5,287 4,867
2000 15,160 9,888 7,429 6,110 5,017
 

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