The Algorithm Design Manual
About the Book
Programming Challenges

The Stony Brook Algorithm Repository

Steven Skiena
Stony Brook University
Dept. of Computer Science

C.A.G.E.S.

The textbook COMBINATORIAL ALGORITHMS Generation, Enumeration, and Search by Donald L. Kreher and Douglas Stinson is written in c++. It covers the following combinatorial problems: clique, the traveling salesman problem, Knapsack, Exact Cover, Uniform Graph Partition, A hilclimbing for Steiner triple systems, A simulated anealing "for the Knapsack (optimzation) problem.", tabu search, Groups, Permutation Groups, Orbits of Subsets, Coset representatives, Orbits 0f k-tuples, and Generating objects having automorphisms.
  • Download Files (local site)
  • Offical Site

    Problem Links
    Generating Partitions (10)
    Generating Subsets (10)
    Generating Permutations (9)
    Clique (8)
    Generating Graphs (8)
    Graph Isomorphism (8)


    This page last modified on 2008-07-10 .
    www.algorist.com