The Pseudo-Boolean Optimization Website

 Medium 0.32

Back Home Up Next

 

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

21,432

18,489

17,022

14,260

13,139

1000 36,387 29,843 25,198 23,266 20,663
1500 49,710 38,106 32,742 28,475 24,914
2000 59,304 44,834 38,094 32,007 29,376
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

20,181

18,875

17,133

15,446

14,135

1000 37,690 29,525 26,774 22,588 20,470
1500 49,229 40,674 34,071 28,297 25,100
2000 60,568 46,894 38,362 32,390 29,215
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

18,858

17,700

17,126

14,716

13,931

1000 35,786 29,721 26,038 23,329 19,760
1500 49,813 37,142 31,913 28,428 24,693
2000 58,679 46,975 36,829 32,214 28,468
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

21,306

17,346

16,435

14,806

14,427

1000 36,711 30,457 26,179 22,418 20,646
1500 51,305 37,480 32,052 28,896 24,824
2000 60,361 45,747 37,328 32,679 29,068
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

18,696

18,924

16,658

14,783

13,841

1000 36,191 28,462 25,841 23,318 21,481
1500 50,310 37,792 32,217 27,903 24,730
2000 59,922 46,241 36,904 32,234 28,903
 

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