The Pseudo-Boolean Optimization Website

 Medium 0.34

Back Home Up Next

 

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

22,490

21,752

19,889

17,182

16,027

1000 40,512 36,918 31,046 28,236 25,733
1500 60,235 47,595 39,072 35,421 30,996
2000 72,211 55,794 46,417 40,964 36,803
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

22,913

21,867

20,233

18,414

16,830

1000 42,912 35,088 31,490 27,187 25,206
1500 59,251 48,210 41,335 35,699 31,504
2000 72,459 55,412 46,634 40,709 35,568
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

24,721

23,673

18,890

17,993

16,367

1000 41,183 35,980 29,854 27,567 26,390
1500 60,248 46,348 39,315 34,497 31,173
2000 70,551 55,868 45,548 41,051 36,283
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

22,371

21,718

19,260

18,753

15,962

1000 42,767 35,360 32,574 27,075 24,807
1500 59,661 47,822 38,730 34,854 31,322
2000 70,390 54,748 46,814 40,709 36,722
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

22,766

19,790

19,532

17,974

17,285

1000 43,313 37,441 31,322 29,032 25,213
1500 58,556 48,306 39,091 34,292 30,823
2000 71,914 56,283 47,451 39,649 35,740
 

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