The Pseudo-Boolean Optimization Website

 Medium 0.16

Back Home Up Next

 

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

8,457

5,874

4,458

4,184

3,531

1000 11,902 8,307 6,914 5,353 4,549
1500 14,897 10,162 7,786 6,372 5,411
2000 17,119 11,533 8,655 7,236 5,866
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

8,099

6,513

4,724

4,064

3,481

1000 12,333 8,661 6,719 5,664 4,632
1500 15,040 9,989 7,900 6,101 5,590
2000 17,381 11,170 8,672 7,014 5,964
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

8,075

5,979

4,716

4,228

3,525

1000 12,004 8,381 6,482 5,726 4,802
1500 14,784 9,987 7,745 6,372 5,832
2000 17,185 11,231 8,602 7,190 6,145
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

7,801

6,033

4,916

4,118

3,488

1000 11,979 8,786 6,750 5,444 4,659
1500 15,048 9,992 8,018 6,469 5,337
2000 17,006 11,251 8,744 6,974 5,867
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

8,646

6,014

4,616

4,036

3,963

1000 12,231 8,368 6,310 5,412 4,857
1500 14,996 10,197 7,809 6,561 5,433
2000 17,427 11,285 8,550 6,798 6,063
 

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