The Pseudo-Boolean Optimization Website

 Medium 0.22

Back Home Up Next

 

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

11,935

8,776

7,441

5,976

5,331

1000 17,866 13,226 10,170 9,082 7,814
1500 22,362 15,715 12,343 10,522 8,860
2000 25,888 17,826 13,949 11,684 10,011
Problem Set #2
n/d 20% 40% 60% 80% 100%
500

10,977

8,560

7,439

6,284

5,653

1000 17,817 12,633 10,355 8,968 7,858
1500 22,346 15,773 12,484 10,510 9,021
2000 25,960 17,862 13,818 11,247 9,919
Problem Set #3
n/d 20% 40% 60% 80% 100%
500

11,085

8,651

7,145

6,468

5,267

1000 17,708 12,793 10,988 8,618 7,579
1500 21,880 15,897 12,307 10,463 9,076
2000 26,211 17,635 14,134 11,544 9,768
Problem Set #4
n/d 20% 40% 60% 80% 100%
500

11,290

8,955

6,940

6,139

5,653

1000 17,720 12,680 10,417 8,640 7,889
1500 23,149 16,081 12,532 10,120 8,891
2000 25,544 17,651 13,808 11,800 9,852
Problem Set #5
n/d 20% 40% 60% 80% 100%
500

11,048

8,756

7,113

6,082

5,337

1000 18,277 12,799 10,488 8,810 7,539
1500 22,398 16,027 12,669 10,318 8,924
2000 25,508 17,996 13,840 11,543 9,821
 

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