The Pseudo-Boolean Optimization Website

 Medium 0.20

Back Home Up Next

 

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

10,260

7,823

6,257

5,468

4,698

1000 15,351 11,186 8,602 7,208 6,453
1500 19,711 13,488 10,422 9,161 7,675
2000 22,355 15,144 11,867 9,981 8,306
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

9,533

7,228

6,252

5,085

4,896

1000 15,751 11,124 8,910 7,420 6,191
1500 19,591 13,794 10,370 8,800 7,370
2000 22,548 15,345 11,778 9,807 8,116
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

10,210

7,499

6,768

5,386

4,852

1000 15,364 11,056 8,808 7,287 6,697
1500 19,290 13,191 10,704 8,985 7,450
2000 22,350 15,196 11,650 9,643 8,400
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

9,949

7,861

5,889

5,554

4,623

1000 15,927 10,705 8,844 7,568 6,474
1500 19,052 13,566 10,517 8,609 7,543
2000 22,340 15,327 11,856 9,521 8,401
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

10,041

7,492

6,059

5,141

4,655

1000 15,198 11,301 8,991 7,224 6,165
1500 19,127 13,884 10,668 8,628 7,423
2000 22,105 15,383 11,579 9,955 8,118
 

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