The Pseudo-Boolean Optimization Website

 Medium 0.26

Back Home Up Next

 

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

14,234

11,564

9,448

8,617

7,519

1000 22,295 18,747 14,171 12,247 10,950
1500 29,690 21,659 17,580 14,978 12,708
2000 35,615 25,238 19,852 17,207 14,565
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

13,984

11,187

9,192

8,300

7,919

1000 23,887 17,190 15,196 12,620 10,930
1500 30,072 21,558 17,598 14,912 12,727
2000 35,354 24,940 20,290 16,837 14,254
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

13,805

11,342

9,567

8,996

7,777

1000 24,211 17,706 14,546 12,056 10,840
1500 30,065 21,299 17,324 14,808 12,736
2000 35,753 24,617 19,827 16,681 14,186
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

14,044

12,543

9,539

8,737

7,908

1000 23,147 17,503 14,079 12,422 11,083
1500 29,469 21,917 17,588 14,478 12,802
2000 35,454 25,357 20,347 16,969 14,402
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

13,506

10,827

9,626

8,194

7,914

1000 23,109 17,464 14,673 12,177 10,905
1500 29,971 22,144 17,347 14,984 13,187
2000 35,531 24,569 20,134 16,761 14,278
 

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