The Pseudo-Boolean Optimization Website

 Medium 0.08

Back Home Up Next

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

4,857

3,469

2,808

2,260

2,026

1000 7,102 4,614 3,544 3,092 2,322
1500 8,618 5,497 4,132 3,243 2,714
2000 9,614 6,186 4,209 3,243 3,022
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

5,300

3,471

2,552

2,152

1,960

1000 7,149 4,602 3,537 2,839 2,552
1500 8,682 5,364 4,058 3,109 2,644
2000 9,634 6,000 4,408 3,537 3,056
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

5,081

3,453

2,770

2,188

1,891

1000 7,449 4,892 3,554 2,743 2,395
1500 8,525 5,632 4,059 3,409 2,533
2000 9,492 6,057 4,444 3,471 2,741
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

4,875

3,553

2,595

2,461

2,005

1000 7,052 4,656 4,027 2,747 2,386
1500 8,540 5,366 4,184 3,178 2,748
2000 9,617 6,082 4,331 3,473 2,789
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

4,956

3,649

2,668

2,173

1,773

1000 7,215 4,499 3,691 3,119 2,502
1500 8,560 5,634 3,930 3,106 2,727
2000 9,578 5,853 4,182 3,744 2,810
 

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