The Pseudo-Boolean Optimization Website

 Medium 0.48

Back Home Up Next

 

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

72,050

89,836

110,523

122,322

127,011

1000 190,099 226,957 273,144 280,662 309,573
1500 323,464 394,196 437,564 456,257 466,424
2000 469,235 574,441 596,520 650,644 654,353
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

73,235

91,733

103,604

113,142

120,309

1000 179,834 222,126 259,741 276,958 296,741
1500 309,735 377,902 406,494 460,974 468,297
2000 464,314 547,975 623,485 654,781 672,317
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

68,999

95,121

107,871

129,540

121,082

1000 189,405 235,000 266,198 266,081 297,354
1500 319,570 408,158 407,687 447,953 471,926
2000 467,568 589,020 606,800 627,643 662,802
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

68,550

96,928

111,227

119,335

122,025

1000 185,815 221,319 260,775 280,937 305,018
1500 323,671 370,091 412,748 453,938 466,433
2000 460,597 541,380 597,749 653,448 642,665
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

73,287

94,621

117,106

116,886

126,779

1000 184,656 234,204 262,005 289,191 291,260
1500 338,513 406,411 431,842 464,809 484,237
2000 469,485 560,428 609,825 639,557 652,578
 

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