The Pseudo-Boolean Optimization Website

 Medium 0.18

Back Home Up Next

 

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

8,986

7,022

5,797

4,680

4,175

1000 13,585 10,066 7,971 6,592 5,517
1500 17,428 12,017 9,513 7,680 6,399
2000 19,817 13,477 10,322 8,714 7,368
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

9,129

7,098

5,334

4,576

4,161

1000 13,521 9,714 7,658 6,423 5,584
1500 16,997 11,829 9,317 7,564 6,496
2000 19,917 13,422 10,406 8,577 7,016
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

9,000

7,067

5,482

4,469

4,197

1000 13,864 10,068 7,723 6,343 5,379
1500 17,161 12,187 9,076 7,506 6,402
2000 19,927 13,518 10,173 8,440 7,327
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

8,968

6,964

5,168

4,610

4,016

1000 14,551 9,998 7,773 6,473 5,586
1500 17,460 12,024 9,260 8,073 6,601
2000 19,698 13,164 9,968 8,293 7,346
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

8,887

6,838

5,621

4,622

3,930

1000 13,726 9,652 7,601 6,307 5,532
1500 17,908 11,757 9,076 7,646 6,553
2000 19,643 13,388 10,019 8,349 7,355
 

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