Polyhedral Methods in Design Theory

  • Lucia Moura


This chapter is devoted to the relation between polyhedral theory and combinatorial designs. The polyhedral aspects of constructing packings, coverings and t-designs are emphasized. Classical results and algorithms in polyhedral theory are summarized, integer programming formulation of design construction problems are presented, and polyhedra associated to these formulations and related algorithms are discussed.


Valid Inequality Integer Programming Problem Integer Programming Formulation Incidence Vector Clique Inequality 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    D. Applegate, R. Bixby, V. Chvátal and W. Cook, Finding cuts in the TSP, preliminary report, August 1994.Google Scholar
  2. [2]
    A. Bachem and M. Grötschel, New aspects of polyhedral theory, in Modern Applied Mathematics, Optimization and Operations Research, North-Holland Publishing Company, 1982, 51–106.Google Scholar
  3. [3]
    E. Balas and S.M. Ng, On the set covering polytope: I. all the facets with coefficients in {0, 1, 2}, Mathematical Programming 43 (1989), 57–69.MathSciNetCrossRefzbMATHGoogle Scholar
  4. [4]
    E. Balas and M.W. Padberg, Set partitioning: a survey, SIAM Review 18 (1976), 710–760.MathSciNetCrossRefzbMATHGoogle Scholar
  5. [5]
    V. Chvátal, Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Mathematics 4 (1973), 305–337.MathSciNetCrossRefzbMATHGoogle Scholar
  6. [6]
    V. Chvátal, On certain polytopes associated with graphs, Journal of Combinatorial Theory(B) 18(1975),138–154.Google Scholar
  7. [7]
    M. Conforti, D.G. Corneil and A.R. Mahjoub, Ki-covers I: complexity and polytopes, Discrete Mathematics 58 (1986), 121–142.MathSciNetCrossRefzbMATHGoogle Scholar
  8. [8]
    G. Cornuéjols and A. Sassano, On the 0,1 facets of the set covering polytope, Mathematical Programming 43 (1989), 45–55.MathSciNetCrossRefzbMATHGoogle Scholar
  9. [9]
    D.R. Fulkerson, Blocking and anti-blocking pairs of polyhedra, Mathematical programming 1 (1971), 168–194.MathSciNetCrossRefzbMATHGoogle Scholar
  10. [10]
    C.D. Godsil, Linear algebra and designs, preprint, 1994.Google Scholar
  11. [11]
    E.S. Kramer, D.W. Leavitt and S.S. Magliveras, Construction procedures for t-designs and the existence of new simple 6-designs, Annals of Discrete Mathematics 26 (1985), 247–274.MathSciNetGoogle Scholar
  12. [12]
    E.S. Kramer and D.M. Mesner, t-designs on hypergraphs, Discrete Mathematics 15 (1976), 263–296.MathSciNetCrossRefzbMATHGoogle Scholar
  13. [13]
    D.L. Kreher and S.P. Radziszowski, Finding simple t-designs by using basis reduction, Congressus Numerantium 55 (1986), 235–244.MathSciNetGoogle Scholar
  14. [14]
    J.K. Lenstra AND A.H.G. Rinnooy Kan, Complexity of packing, covering and partitioning, in Packing and Covering in Combinatorics, A. Schrijver, ed., Mathematical Centre Trats 106, 1979, 275–291.Google Scholar
  15. [15]
    W.H. Mills and R.C. Mullin, Coverings and Packings, in Contemporary Design Theory: a collection of surveys, J.H. Dinitz and D.R. Stinson, eds., Wiley, 1992, 371–399.Google Scholar
  16. [16]
    G.L. Nemhauser and L.E. Trotter,JR., Properties of vertex packing and independence system polyhedra, Mathematical Programming 6 (1974), 48–61.MathSciNetCrossRefzbMATHGoogle Scholar
  17. [17]
    G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, 1988, 83–113.Google Scholar
  18. [18]
    M.W. Padberg, On the facial structure of set packing polyhedra, Mathematical Programming 5 (1973), 199–215.MathSciNetCrossRefzbMATHGoogle Scholar
  19. [19]
    M.W. Padberg and G. Rinaldi, A branch-and-cut algorithm for the solution of large-scale traveling salesman problems, SIAM Review 33 (1991), 60–100.MathSciNetCrossRefzbMATHGoogle Scholar
  20. [20]
    W.R. Pulleyblank, Polyhedral Combinatorics, in Handbooks in OR & MS, vol.1, N.L. Nemhauser et al., eds., North-Holland, 1989, 371–446.Google Scholar
  21. [21]
    A. Sassano, On the facial structure of the set covering polytope, Mathematical Programming 44 (1989). 181–202.MathSciNetCrossRefzbMATHGoogle Scholar
  22. [22]
    B. Schmalz, The t-designs with prescribed automorphism group, new simple 6-designs, Journal of Combinatorial Designs 1 (1993), 125–170.MathSciNetCrossRefzbMATHGoogle Scholar
  23. [23]
    A. Schrijver, On cutting planes, in Combinatorics 79 Part II, Annals of Discrete Mathematics 9(1980), 291–296.Google Scholar
  24. [24]
    L.E. Trotter, Jr., A class of facet producing graphs for vertex packing polyhedra, Discrete Mathematics 12 (1975), 373–388.MathSciNetCrossRefzbMATHGoogle Scholar
  25. [25]
    R.M. Wilson, On the theory of t-designs, in Enumeration and Designs, D.M. Jackson and S.A. Vanstone, eds., Academic Press, Toronto, 1984, 19–49.Google Scholar
  26. [26]
    R.M. Wilson, The exact bound on the Erdös-Ko-Rado theorem, Combinatorica 4 (1984), 247–257.MathSciNetCrossRefzbMATHGoogle Scholar
  27. [27]
    E. Zehendner, Methoden der Polyedertheorie zur Herleitung von oberen Schranken für die Mächtigkeit von Blockcodes, PhD thesis, Universität Augsburg, 1986.zbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1996

Authors and Affiliations

  • Lucia Moura
    • 1
  1. 1.Department of Computer ScienceUniversity of TorontoTorontoCanada

Personalised recommendations