Improving bounds on the football pool problem by integer programming and high-throughput computing

INFORMS Journal on Computing

Volumn 21, Issue 3, 2009, Pages 445-457

  Linderoth, Jeff ^a   Margot, François ^b   Thain, Greg ^c  

^a University of Wisconsin Madison   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c University of Wisconsin Madison   (United States)

Author keywords

Branch and bound; Condor; Football pool problem; High throughput computing; Master worker

Indexed keywords

EID: 68749084702     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1090.0334     Document Type: Article

References (36)

1. Anstreicher K., N. Brixius, J.-P. Goux, J. T. Linderoth. 2002. Solving large quadratic assignment problems on computational grids. Math. Programming Ser. B 91(3) 563-588.
2. Applegate D. L., R. E. Bixby, V. Chvátal, W. J. Cook. 2006. The Traveling Salesman Problem. Princeton University Press, Princeton, NJ.
3. Barnhart C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vance. 1998. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3) 316-329.
4. Bazaraa M. S., O. Kirca. 1983. A branch-and-bound-based heuristic for solving the quadratic assignment problem. Naval Res. Logist. Quart. 30(2) 287-304.
5. Bradley D. 2006. Schedd on the side. Presentation, Condor Week 2006, April 25, University of Wisconsin-Madison, Madison.
6. Butler G., C. W. H. Lam. 1985. A general backtrack algorithm for the isomorphism problem of combinatorial objects. J. Symbolic Comput. 1(4) 363-381.
7. Chen Q., M. C. Ferris, J. T. Linderoth. 2001. FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver. Ann. Oper. Res. 103 17-32.
8. Epema D. H. J., M. Livny, R. van Dantzig, X. Evers, J. Pruyne. 1996. A worldwide flock of Condors: Load sharing among workstation clusters. J. Future Generation Comput. Systems 12(1) 53-65.
9. Foster I., C. Kesselman. 1997. Globus: A metacomputing infrastructure toolkit. Internat. J. Supercomputer Appl. 11(2) 115-128.
10. Foster I., C. Kesselman. 1999. Computational grids. I. Foster, C. Kesselman, eds. The Grid: Blueprint for a New Computing Infrastructure, Chapter 2. Morgan Kaufmann, San Francisco, 15-52.
11. Frey J., T. Tannenbaum, M. Livny, I. Foster, S. Tuecke. 2002. Condor-G: A computation management agent for multiinstitutional grids. Cluster Comput. 5(3) 237-246.
12. Glankwamdee W., J. Linderoth. 2006. MW: A software framework for combinatorial optimization on computational grids. E. Talbi, ed. Parallel Combinatorial Optimization. John Wiley & Sons, New York, 239-261.
13. Goux J.-P., S. Leyffer. 2003. Solving large MINLPs on computational grids. Optim. Engrg. 3(3) 327-346.
14. Goux J.-P., S. Kulkarni, M. Yoder, J. T. Linderoth. 2001. Masterworker: An enabling framework for master-worker applications on the computational grid. Cluster Comput. 4(1) 63-70.
15. Hämäläinen H., I. Honkala, S. Litsyn, P. Östergård. 1995. Football pools-A game for mathematicians. Amer. Math. Monthly 102(7) 579-588.
16. Holm S., M. M. Sørensen. 1993. The optimal graph partitioning problem: Solution method based on reducing symmetric nature and combinatorial cuts. OR Spectrum 15(1) 1-8.
17. Ivanov A. V. 1985. Constructive enumeration of incidence systems. Ann. Discrete Math. 114(26) 227-246.
18. Kaibel V., M. Pfetsch. 2008. Packing and partitioning orbitopes. Math. Programming 114(1) 1-36.
19. Kreher D. L., D. R. Stinson. 1999. Combinatorial Algorithms, Generation, Enumeration, and Search. CRC Press, Boca Raton, FL.
20. Lenstra A. K., H. W. Lenstra, L. Lovász. 1982. Factoring polynomials with rational coefficients. Mathematische Annalen 261(4) 515-534.
21. Linderoth J., G. Thain, S. J. Wright. 2007. User's Guide to MW. University of Wisconsin-Madison, Madison. http://www.cs.wisc.edu/condor/mw.
22. Litzkow M. J., M. Livny, M. W. Mutka. 1998. Condor-A hunter of idle workstations. Proc. 8th Internat. Conf. Distributed Comput. Systems, San Jose, CA. IEEE Press, Los Alamitos, CA, 104-111.
23. Macambira E. M., N. Maculan, C. C. de Souza. 2004. Reducing symmetry of the SONET ring assignment problem using hierarchical inequalities. Technical Report ES-636/04, Programa de Engenharia de Sistemas e Computação, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil.
24. Margot F. 2002. Pruning by isomorphism in branch-and-cut. Math. Programming 94(1) 71-90.
25. Margot F. 2003. Small covering designs by branch-and-cut. Math. Programming 94(2-3) 207-220.
26. McKay B. 1996. autoson-A distributed batch system for UNIX workstation networks (version 1.3). Technical report, Computer Sciences Department, Australian National University, Canberra, ACT, Australia.
27. McKay B. D. 1998. Isomorph-free exhaustive generation. J. Algorithms 26(2) 306-324.
28. Méndez-Díaz I., P. Zabala. 2006. A branch-and-cut algorithm for graph coloring. Discrete Appl. Math. 154(5) 826-847.
29. Mezmaz M., N. Melab, E.-G. Talbi. 2006. A grid-enabled branch and bound algorithm for solving challenging combinatorial optimization problems. Research Report 5945, INRIA, Lille, France.
30. Östergård P. R. J., W. Blass. 2001. On the size of optimal binary codes of length 9 and covering radius 1. IEEE Trans. Inform. Theory 47(6) 2556-2557.
31. Östergård P. R. J., A. Wassermann. 2002. A new lower bound for the football pool problem for six matches. J. Combinatorial Theory Ser. A 99(1) 175-179.
32. Ostrowski J., J. Linderoth, F. Rossi, S. Smriglio. 2008. Constraint orbital branching. IPCO 2008: 13th Conf. Integer Programming and Combinatorial Optim. Lecture Notes in Computer Science, Vol. 5035. Springer, Berlin, 225-239.
33. Read R. C. 1978. Every one a winner, or how to avoid isomorphism search when cataloguing combinatorial configurations. B. Alspach, P. Hell, D. J. Miller, eds. Algorithmic Aspects of Combinatorics. Annals of Discrete Mathematics, Vol. 2. North-Holland, Amsterdam, 107-120.
34. Sherali H. D., J. C. Smith. 2001. Improving zero-one model representations via symmetry considerations. Management Sci. 47(10) 1396-1407.
35. Wille L. T. 1987. The football pool problem for 6 matches: A new upper bound obtained by simulated annealing. J. Combinatorial Theory Ser. A 45(2) 171-177.
36. Xu Y., T. K. Ralphs, L. Ladányi, M. J. Saltzman. 2005. ALPS: A framework for implementing parallel search algorithms. Proc. Ninth INFORMS Comput. Soc. Conf., Annapolis, MD. INFORMS, Hanover, MD, 319-334.