The Pseudo-Boolean Optimization Website

 Medium 0.24

Back Home Up Next

 

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

12,941

10,303

8,741

7,815

6,822

1000 20,868 15,297 12,595 10,632 9,396
1500 25,664 18,869 14,889 12,555 10,886
2000 30,756 21,984 16,860 14,442 12,539
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

13,401

10,498

8,652

7,288

6,761

1000 20,663 15,244 12,459 10,763 9,810
1500 27,173 19,093 14,807 12,619 11,059
2000 30,593 21,285 17,025 14,425 12,356
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

13,541

10,286

8,494

7,175

6,594

1000 20,672 15,401 12,510 10,482 9,173
1500 26,465 19,320 15,248 12,661 11,021
2000 31,003 21,645 17,263 14,074 12,252
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

13,104

10,248

8,678

7,448

6,923

1000 20,828 14,834 12,829 10,437 9,177
1500 25,885 18,821 15,201 13,269 10,824
2000 30,953 22,131 17,037 14,044 12,400
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

12,902

11,111

8,536

7,504

6,429

1000 20,871 15,769 12,709 10,579 9,211
1500 26,022 18,983 15,124 12,679 11,225
2000 29,723 21,524 16,894 13,888 12,131
 

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