The Pseudo-Boolean Optimization Website

 Medium 0.46

Back Home Up Next

 

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

62,222

75,194

82,025

86,473

85,198

1000 146,557 157,246 168,584 182,673 167,897
1500 229,960 268,278 274,167 273,787 264,473
2000 335,860 359,642 360,844 338,579 346,674
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

61,671

72,111

77,722

81,072

81,137

1000 140,786 173,785 176,634 180,163 170,675
1500 241,423 260,598 278,047 259,635 266,898
2000 322,091 350,737 355,110 348,063 340,797
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

57,591

80,548

82,145

77,764

84,609

1000 154,377 165,514 180,058 174,477 167,835
1500 236,705 264,784 262,651 265,588 260,137
2000 325,663 356,235 360,192 350,280 339,700
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

62,500

70,221

75,596

80,930

89,397

1000 142,497 167,151 169,253 171,760 169,616
1500 241,674 257,187 266,077 273,313 274,089
2000 322,758 353,494 353,275 355,293 342,004
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

63,725

72,388

75,070

81,965

82,104

1000 135,422 157,551 181,099 177,546 175,187
1500 233,731 256,981 255,319 268,170 271,473
2000 308,443 350,753 362,779 350,148 345,302
 

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