Abstract
We propose a new algorithmic technique for constructing combinatorial designs such as t-designs and packings. The algorithm is based on polyhedral theory and employs the well-known branch-and-cut approach. Several properties of the designs are studied and used in the design of our algorithm. A polynomialtime separation algorithm for clique facets is developed for a class of designs, and an isomorph rejection algorithm is employed in pruning tree branches. Our implementation is described and experimental results are analysed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Caprara, A., and Fischetti, M.: Branch-and-Cut Algorithms. In Annotated Bibliographies in Combinatorial Optimization, M. Dell’Amico, et al, Eds., JohnWiley & Sons, 1997, ch. 4.
Colbourn, C., and van Oorschot, P.: Applications of Combinatorial Designs in Computer Science. ACM Computing Surveys 21 (1989), 223–250.
Godsil, C.: Linear Algebra and Designs. Manuscript (229 p.), 1995.
Hoffman, K., and Padberg, M.: Solving Airline Crew-Scheduling Problems by Branch-and-Cut. Manag. Sci. 39 (1993), 657–682.
Kocay, W.: On Writing Isomorphism Programs. In Wallis [17], 1996, pp. 135–175.
Lenstra, J., and Rinnooy Kan, A.: Complexity of Packing, Covering and Partitioning. In Packing and Covering in Combinatorics, A. Schrijver, Ed. Mathematical Centre Trats 106, 1979, pp. 275–291.
Mathon, R.: Computational Methods in Design Theory. InWallis [17], 1996, pp. 29–48.
McKay, B.: Nauty User’s Guide (version 1.5). Tech. Rep. TR-CS-90-02, Dept. Computer Science, Austral. Nat. Univ., 1990.
Mills, W., and Mullin, R.: Coverings and Packings. In Contemporary Design Theory: a Collection of Surveys, J. Dinitz and D. Stinson, Eds.,Wiley, 1992, pp. 371–399.
Moura, L.: Polyhedral Methods in Design Theory. In Wallis [17], 1996, pp. 227–254.
Moura, L.: Polyhedral Aspects of Combinatorial Designs. PhD thesis, University of Toronto, 1999.
Moura, L.: Maximal s-Wise t-Intersecting Families of Sets: Kernels, Generating Sets, and Enumeration. To appear in J. Combin. Theory. Ser. A (July 1999), 22 pages.
Nemhauser, G., and Sigismondi, G.: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing. J. Opl. Res. Soc. 43 (1992), 443–457.
Nemhauser, G., and Trotter Jr., L.: Properties of Vertex Packing and Independence System Polyhedra. Math. Programming 6 (1974), 48–61.
Stefan, N., and Mehlhorn, K.: LEDA-Manual Version 3.0. Tech. Rep. MPI-I-93109, Max-Planck-Institute für Informatik, 1993.
Wallis, W. (Ed.): Computational and Constructive Design Theory. Kluwer Academic Publishers, 1996.
Wengrzik, D.: Schnittebenenverfahren für Blockdesign-Probleme. Master’s thesis, Universit ät Berlin, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moura, L. (1999). A Polyhedral Algorithm for Packings and Designs. In: Nešetřil, J. (eds) Algorithms - ESA’ 99. ESA 1999. Lecture Notes in Computer Science, vol 1643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_40
Download citation
DOI: https://doi.org/10.1007/3-540-48481-7_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66251-8
Online ISBN: 978-3-540-48481-3
eBook Packages: Springer Book Archive