The Pseudo-Boolean Optimization Website

 Medium 0.40

Back Home Up Next

 

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

35,668

36,749

34,645

34,340

35,628
1000 72,532 69,180 60,576 61,765 52,613
1500 104,224 97,770 86,103 78,014 72,721
2000 141,259 116,477 104,318 95,323 86,056
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

33,978

35,713

32,685

33,907

32,063
1000 70,132 65,691 61,331 57,810 56,914
1500 105,538 94,458 83,726 79,826 73,205
2000 134,189 117,534 102,329 90,969 86,177
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

37,937

36,239

35,805

34,210

33,502
1000 72,405 66,749 61,468 56,248 55,607
1500 102,956 95,634 85,071 77,475 76,246
2000 139,340 120,887 105,995 96,751 87,670
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

37,834

32,407

37,061

35,903

33,725
1000 71,109 67,424 63,301 56,413 57,335
1500 105,777 93,805 89,659 78,388 73,398
2000 136,886 125,280 102,970 92,256 86,948
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

34,522

36,158

37,574

34,652

32,646
1000 71,429 68,797 64,572 60,495 54,679
1500 107,277 96,266 84,727 76,471 72,585
2000 136,285 120,428 102,826 93,648 89,074
 

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