The Pseudo-Boolean Optimization Website

 Medium 0.38

Back Home Up Next

 

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

31,547

32,388

27,925

25,513

26,184
1000 61,398 57,071 50,464 50,688 46,319
1500 89,603 76,939 67,452 62,381 56,005
2000 115,771 93,575 82,120 72,427 67,215
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

32,539

32,854

33,145

28,743

27,291
1000 66,586 55,745 51,637 47,694 43,064
1500 91,484 78,236 69,341 60,982 56,849
2000 114,265 92,595 82,292 75,111 65,593
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

32,591

30,269

30,267

28,983

26,318
1000 63,466 57,943 52,385 45,194 45,782
1500 87,735 77,627 67,358 62,772 54,363
2000 109,930 92,818 82,326 72,823 65,566
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

31,192

30,720

29,332

28,474

27,141
1000 62,898 56,097 49,652 46,402 43,460
1500 87,656 78,749 66,455 61,661 58,366
2000 110,739 96,031 80,872 72,210 65,951
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

32,716

33,860

29,902

27,932

27,515
1000 60,395 54,159 51,103 44,123 43,694
1500 88,273 77,189 67,141 60,197 57,346
2000 109,427 95,684 78,937 74,712 66,427
 

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