The Pseudo-Boolean Optimization Website

 Medium 0.44

Back Home Up Next

 

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

53,875

58,025

62,173

63,574

63,510

1000 112,903 115,932 123,775 125,940 118,412
1500 186,748 181,922 181,684 170,941 165,939
2000 243,981 245,541 228,645 214,164 203,073
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

49,097

60,390

60,608

58,071

64,594

1000 115,147 121,568 120,842 120,529 119,945
1500 172,987 179,162 176,345 180,606 167,846
2000 239,672 231,846 232,898 220,966 201,840
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

51,921

55,081

66,888

62,841

62,323

1000 116,414 130,559 122,045 123,208 123,094
1500 175,072 180,033 186,773 177,869 163,704
2000 248,402 239,833 231,950 226,457 209,111
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

51,918

58,188

56,796

61,216

57,110

1000 113,217 120,336 121,119 118,635 113,537
1500 174,335 187,579 184,289 171,531 169,149
2000 232,639 246,034 227,140 216,689 204,488
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

51,017

58,562

58,503

57,672

57,449

1000 110,333 118,912 122,580 123,124 123,555
1500 184,750 187,147 172,456 176,934 165,526
2000 234,410 252,021 230,334 217,712 207,090
 

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