The Pseudo-Boolean Optimization Website

 Medium 0.10

Back Home Up Next

 

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

5,638

4,080

3,187

2,482

2,255

1000 8,261 5,440 4,174 3,509 2,818
1500 10,172 6,489 5,017 3,954 3,070
2000 11,198 7,115 5,147 4,277 3,447
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

5,468

4,106

3,059

2,717

2,273

1000 8,349 5,407 4,336 3,190 2,739
1500 10,624 6,591 4,790 4,184 3,309
2000 11,467 6,985 5,547 4,149 3,629
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

5,708

4,015

3,118

2,823

2,225

1000 8,130 5,496 4,247 3,302 2,853
1500 9,864 6,335 4,799 3,901 3,151
2000 11,105 7,071 5,655 4,080 3,393
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

5,780

3,915

3,262

2,493

2,244

1000 8,150 5,546 4,143 3,249 2,862
1500 9,907 6,154 4,787 3,751 3,153
2000 11,203 7,215 5,124 4,152 3,610
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

5,792

4,015

3,061

2,716

2,239

1000 8,251 5,543 4,011 3,339 2,935
1500 9,916 6,321 4,816 3,907 3,138
2000 11,123 7,000 5,062 4,255 3,505
 

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