The Pseudo-Boolean Optimization Website

 Medium 0.06

Back Home Up Next

 

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

4,317

2,927

2,199

1,744

1,752

1000 6,101 3,970 3,070 2,263 1,873
1500 7,400 4,589 3,535 2,611 2,160
2000 8,335 5,150 3,786 2,863 2,365
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

4,505

2,945

2,226

1,708

1,535

1000 6,419 3,901 2,960 2,334 1,942
1500 7,222 4,648 3,481 2,718 2,211
2000 8,292 4,841 3,497 2,687 2,330
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

4,126

2,871

2,308

1,894

1,518

1000 6,097 3,916 2,997 2,406 1,906
1500 7,525 4,548 3,345 2,681 2,182
2000 8,237 4,659 3,708 2,971 2,465
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

4,157

3,225

2,572

1,908

1,520

1000 6,352 4,007 2,972 2,446 1,922
1500 7,317 4,652 3,555 2,815 2,111
2000 8,078 4,850 3,509 2,863 2,307
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

4,391

2,895

2,498

1,867

1,543

1000 6,201 4,155 3,017 2,348 2,084
1500 7,714 4,452 3,221 2,637 2,182
2000 8,392 4,857 3,559 2,736 2,336
 

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