The Pseudo-Boolean Optimization Website

 Medium 0.02

Home Up Next

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

2,891

1,892

1,513

1,134

952

1000 4,039 2,489 1,755 1,356 1,322
1500 4,562 2,782 1,981 1,751 1,182
2000 4,994 2,884 2,257 1,811 1,407
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

3,001

1,934

1,362

1,168

880

1000 3,861 2,287 1,953 1,324 1,158
1500 4,594 2,609 2,052 1,770 1,230
2000 5,005 2,887 2,033 1,730 1,300
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

2,960

1,780

1,307

1,093

861

1000 4,191 2,288 1,730 1,413 1,223
1500 4,568 2,610 2,156 1,501 1,225
2000 5,239 2,776 2,276 1,634 1,233
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

3,117

1,938

1,400

1,041

922

1000 4,025 2,347 2,005 1,306 1,219
1500 4,345 2,672 1,897 1,583 1,265
2000 5,241 2,798 2,116 1,631 1,366
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

2,701

1,923

1,395

1,129

933

1000 3,726 2,432 1,735 1,554 1,351
1500 4,682 2,643 2,035 1,562 1,270
2000 4,983 2,894 2,157 1,606 1,383
 

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