The Pseudo-Boolean Optimization Website

 Medium 0.04

Back Home Up Next

 

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

3,608

2,589

1,886

1,461

1,313

1000 4,990 3,270 2,612 1,847 1,601
1500 6,091 3,837 2,722 2,075 1,770
2000 6,743 3,909 2,840 2,216 1,860
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

3,668

2,481

1,826

1,497

1,273

1000 5,280 3,348 2,465 1,957 1,646
1500 6,167 3,687 2,657 2,149 1,845
2000 6,782 3,998 2,746 2,244 1,973
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

3,704

2,428

1,990

1,713

1,165

1000 5,068 3,054 2,350 1,945 1,587
1500 6,105 3,797 2,557 2,015 1,681
2000 6,730 4,022 2,836 2,151 1,824
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

3,645

2,394

1,915

1,458

1,315

1000 5,129 3,266 2,439 1,925 1,525
1500 6,150 3,603 2,765 2,178 1,830
2000 6,593 3,917 2,848 2,379 1,904
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

3,772

2,336

2,028

1,549

1,231

1000 5,039 3,339 2,639 1,997 1,683
1500 6,003 3,688 2,737 2,094 1,767
2000 6,803 3,904 2,968 2,233 1,750
 

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