The Pseudo-Boolean Optimization Website

 Medium 0.28

Back Home Up Next

 

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

16,022

13,525

11,221

10,003

8,941

1000 27,071 20,243 16,514 14,921 13,122
1500 34,325 25,434 21,098 17,379 15,566
2000 41,958 29,016 24,174 20,201 17,574
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

15,533

12,610

11,607

9,725

9,360

1000 25,839 20,241 16,486 14,299 13,100
1500 33,745 26,421 21,406 17,748 15,615
2000 41,058 30,257 24,047 19,910 18,192
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

16,102

13,159

10,902

9,710

9,705

1000 25,973 20,640 16,789 14,663 12,750
1500 35,329 25,494 21,129 18,218 15,687
2000 41,563 29,754 23,972 20,166 17,583
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

17,007

13,017

11,146

10,003

8,981

1000 25,805 20,905 17,557 14,176 13,099
1500 34,622 24,844 20,982 18,035 15,551
2000 42,001 29,805 23,439 20,314 17,329
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

14,627

13,298

11,145

9,723

9,887

1000 25,921 20,166 17,080 14,625 13,161
1500 35,355 25,294 20,675 17,812 15,664
2000 41,341 29,487 23,840 19,867 17,230
 

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