The Pseudo-Boolean Optimization Website

 Medium 0.36

Back Home Up Next

 

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

27,845

24,778

22,376

22,808

19,717

1000 53,102 43,590 38,487 36,096 32,463
1500 73,382 58,647 49,717 44,891 41,583
2000 89,127 70,320 60,146 54,220 46,714
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

26,871

23,799

24,032

20,783

20,555

1000 52,192 42,707 38,092 35,399 32,311
1500 70,749 58,536 50,523 45,263 42,195
2000 90,122 69,659 60,507 54,431 47,064
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

26,923

25,228

24,810

21,149

19,397

1000 52,835 45,186 38,027 36,768 31,963
1500 74,442 59,466 50,638 46,805 41,713
2000 89,102 72,677 61,935 51,301 46,731
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

24,216

24,167

23,533

21,321

21,322

1000 49,870 45,436 41,323 34,499 32,659
1500 69,386 59,315 50,647 45,799 42,239
2000 89,272 68,885 60,096 52,748 47,485
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

27,522

24,427

22,408

22,306

21,420

1000 51,343 42,965 38,703 35,932 32,407
1500 72,227 57,782 50,083 44,398 41,624
2000 87,832 72,201 60,588 52,047 47,406
 

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