Pruning by isomorphism in branch-and-cut

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2081, Issue , 2001, Pages 304-317

  Margot, FranÇois ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION;

BRANCH AND CUT; ENUMERATION TREES; ERROR CORRECTING CODE; FEASIBLE SOLUTION; INTEGER LINEAR PROGRAMS; OPTIMAL VALUES; SYMMETRY GROUPS;

INTEGER PROGRAMMING;

EID: 84947204236     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45535-3_24     Document Type: Conference Paper

References (18)

1. Butler G. "Computing in Permutation and Matrix Groups II: Backtrack Algorithm", Mathematics of Computation 39 (1982), 671-680.
2. Butler G., Fundamental Algorithms for Permutation Groups, Lecture Notes in Computer Science 559, Springer (1991).
3. Butler G., Cannon J.J., "Computing in Permutation and Matrix Groups I: Normal Closure, Commutator Subgroups, Series", Mathematics of Computation 39 (1982), 663-670.
4. Butler G., Lam W.H., "A General Backtrack Algorithm for the Isomorphism Problem of Combinatorial Objects", J. Symbolic Computation 1 (1985), 363-381.
5. Conway J.H., Sloane N.J.A., Sphere Packings, Lattices and Groups, Springer (1993).
6. Etzion T., Wei V., Zhang Z., "Bounds on the Sizes of Constant Weight Covering Codes", Designs, Codes and Cryptography 5 (1995), 217-239.
7. Gibbons P.B., "Computational Methods in Design Theory", in: The CRC Handbook of Combinatorial Designs, Colbourn C.J., Dinitz J.H (eds.), CRC Press (1996), 718-740.
8. Ivanov A.V., "Constructive Enumeration of Incidence Systems", Annals ofDiscrete Mathematics 26 (1985), 227-246.
9. Junger M., Thienel S., "Introduction to ABACUS - A Branch-And-CUt System", Operations Research Letters 22 (1998), 83-95.
10. Kreher D.L., Stinson D.R., Combinatorial Algorithms, Generation, Enumeration, and Search, CRC Press (1999).
11. Leon J.S., "On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations", Mathematics ofComputation 35 (1980), 941-974.
12. Leon J.S., "Computing Automorphism Groups of Combinatorial Objects", in Computational Group Theory, Atkinson M.D. (ed.), Academic Press (1984), 321-335.
13. Luetolf C., Margot F., "A Catalog of Minimally Nonideal Matrices", Mathematical Methods ofOperations Research 47 (1998), 221-241.
14. Margot F., "Small Covering Designs by Branch-and-Cut", Research report 200027, Department of Mathematics, University of Kentucky.
15. McKay D., "Isomorph-free Exhaustive Generation", Journal of Algorithms 26 (1998), 306-324.
16. Mills W.H., Mullin R.C., "Coverings and Packings", in: Contemporary Design Theory: A collection of Surveys, Dinitz H., Stinson D.R. (eds.), Wiley (1992), 371-399.
17. Read R.C., "Every One a Winner or How to Avoid Isomorphism Search When Cataloguing Combinatorial Configurations", Annals of Discrete Mathematics 2 (1978), 107-120.
18. Seah E., Stinson D.R., "An Enumeration of Non-isomorphic One-factorizations and Howell Designs for the Graph K10 minus a One-factor", Ars Combinatorica 21 (1986), 145-161.