The Pseudo-Boolean Optimization Website

 Medium 0.12

Back Home Up Next

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

6,046

4,480

3,807

3,043

2,584

1000 9,837 6,351 4,979 3,954 3,398
1500 11,386 7,698 5,941 4,574 3,726
2000 12,733 8,326 6,562 5,026 4,367
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

6,199

4,541

3,563

3,064

2,603

1000 9,413 6,505 4,912 4,052 3,473
1500 11,265 7,475 5,744 4,480 3,748
2000 12,988 8,303 6,314 4,838 4,042
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

6,768

4,537

4,136

3,185

2,521

1000 9,566 6,349 4,819 3,895 3,378
1500 11,559 7,608 5,850 4,519 3,832
2000 12,944 8,677 6,498 4,834 3,976
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

6,349

4,334

3,787

2,923

2,710

1000 9,229 6,579 4,863 3,947 3,422
1500 11,455 7,712 5,728 4,510 4,103
2000 12,869 8,156 6,179 4,910 4,169
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

6,601

4,795

3,584

3,111

2,593

1000 9,459 6,122 4,855 3,831 3,459
1500 11,669 7,497 5,681 4,708 3,849
2000 13,137 8,381 6,027 5,240 4,243
 

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