Structures and AlgorithmsWhat are Combinatorial Algorithms?What are Combinatorial Structures?What are Combinatorial Problems?O-NotationAnalysis of AlgorithmsComplexity ClassesData StructuresAlgorithm Design TechniquesGenerating Elementary Combinatorial ObjectsCombinatorial GenerationSubsetsk-Element SubsetsPermutationsMore Topics in Combinatorial GenerationInteger PartitionsSet Partitions, Bell and Stirling NumbersLabeled TreesCatalan FamiliesBacktracking AlgorithmsIntroductionA General Backtrack AlgorithmGenerating All CliquesEstimating the Size of a Backtrack TreeExact CoverBounding FunctionsBranch-and-BoundHeuristic SearchIntroduction to Heuristic AlgorithmsDesign Strategies for Heuristic AlgorithmsA Steepest-Ascent Algorithm for Uniform Graph PartitionA Hill-Climbing Algorithm for Steiner Triple SystemsTwo Heuristic Algorithms for the Knapsack ProblemA Genetic Algorithm for the Traveling Salesman ProblemGroups and SymmetryGroupsPermutation GroupsOrbits of SubsetsCoset RepresentativesOrbits of k-tuplesGenerating Objects Having AutomorphismsComputing IsomorphismIntroductionInvariantsComputing CertificatesIsomorphism of Other StructuresBasis ReductionIntroductionTheoretical DevelopmentA Reduced Basis AlgorithmSolving Systems of Integer EquationsThe Merkle-Hellman Knapsack SystemBibliographyAlgorithm IndexProblem IndexIndex

"Very clear exposition. I jumped right into [the] heuristic methods chapter and understood it almost instantly..." - Dean H. Judson, Ph.D., Nevada State Demographer"…book serves as an introduction to the basic problems and methods…style is clear, transparent…The algorithmic problems are always considered and they are in the center of the discussion…has a fresh approach to combinatorics that is available for readers, students in computer science, electrical engineering without any background in mathematics." - Péter Hajnal, Acta Science Math