The Pseudo-Boolean Optimization Website

 Medium 0.30

Back Home Up Next

 

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

17,073

14,632

13,968

11,630

10,647

1000 31,770 23,995 20,151 18,053 15,911
1500 42,650 30,760 25,828 22,062 19,190
2000 49,286 35,971 29,904 25,241 21,724
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

17,457

16,103

13,753

11,942

10,908

1000 31,903 25,459 21,243 17,661 16,044
1500 39,739 29,834 25,854 21,760 19,090
2000 49,330 35,964 28,720 25,186 21,579
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

17,047

16,109

13,734

11,474

11,230

1000 30,520 24,013 20,912 17,675 16,322
1500 41,859 30,885 25,631 22,129 19,694
2000 49,130 35,957 29,157 24,943 21,827
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

20,168

15,302

13,393

12,739

11,688

1000 31,879 24,708 20,239 17,803 16,499
1500 40,809 30,744 25,418 23,220 19,172
2000 49,294 36,311 29,886 24,719 22,349
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

18,768

14,637

13,723

12,421

11,025

1000 31,292 23,922 20,452 17,562 16,342
1500 41,171 31,651 25,815 22,141 19,214
2000 48,534 35,519 29,009 25,545 21,600
 

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