Donald E. Knuth 
 The Art of Computer Programming  
 Volume 4: Combinatorial Algorithms 
 Volume 4A: Enumeration and Backtracking 

See http://www-cs-faculty.stanford.edu/~knuth/.
All links to .pdf files are to old, uncorrected versions.
Corresponding .ps files are readily available on archive.org,
and links to these are given in orange below.
Refer to the published versions for up-to-date material.

Notice Knuth's somber new section: Infrequently Asked Questions,
and also his 2002 Letter to Condolezza Rice, Rice Cartoon.

Interviews: 2008-07-01,  2008-04-25,  2005-09-04,  2001-10-05,  2000-01-25,  1993-12-07

Volume 4A, Enumeration and Backtracking
Title Pre-Fascicle Pages Published
Fascicle
.pdf .ps
1.3-4. MMIX 1 1 140 Vol. 1, Fasc 1
(144 pages)
7. Introduction to combinatorial searching 0A 0A 83 Vol. 4, Fasc 0
(240 pages)
7.1. Zeros and Ones
7.1.1. Boolean Basics		 0B 0B 87
7.1.2. Boolean evaluation 0C 0C 67
7.1.3. Bitwise tricks and techniques 1A 1A 122 Vol. 4, Fasc 1
(2 March 2009)
7.1.4. Binary decision diagrams 1B 1B 150
7.2. Generating all possibilities
7.2.1. Combinatorial generators
7.2.1.1. Generating all n-tuples		 2A 2A 72 Vol. 4, Fasc 2
(144 pages)
7.2.1.2. Generating all permutations 2B 2B 66
7.2.1.3. Generating all combinations 3A 3A 65 Vol. 4, Fasc 3
(160 pages)
7.2.1.4-5. Generating all partitions 3B 3B 92
7.2.1.6. Generating all trees 4A 4A 87 Vol. 4, Fasc 4
(128 pages)
7.2.1.7. History of combinatorial generation 4B 4B 42
7.2.2. Basic backtrack  
7.2.3. Efficient backtracking  
7.3. Shortest paths  
Total pages so far, except for 1.3-4. MMIX (140 or 144 pages) 933672
Title Preliminary Pages Published
MMIXware, Springer Verlag MMIXware 550 MMIXware