Postcript for Entire Survey (2.1 MB)

- Preliminaries
- Circuit Representations
- Bipartitioning Formulations
- Multi-Way Partitioning Formulations
- Constraint-Driven (Satisficing) Formulations
- Replication Formulations
- Iterative Improvement
- Simulated Annealing
- Tabu Search
- Genetic Algorithms
- Adaptations of Move-Based Approaches
- Hall's Quadratic Placement
- Mapping k Clusters to k Eigenvectors
- Proves in Multi-Dimensional Vector Space
- Vector Partitioning
- From Orderings to Partitionings
- Min-Delay Clustering by Graph Labeling
- Network Flows
- Mathematical Programming
- Fuzzy Partitioning
- Boolean Set Covering
- Motivations for Clustering
- Agglomerative Clustering
- Hierarchical Strategies
- Intuitive Cluster Properties
- Clustering of Boolean Networks
- Integration of Clustering into a Bipartitioning Heuristic
- Benchmarking
- Perspectives

1. Introduction (83K)

2. Partitioning Formulations (256K)

3. Move-Based Approaches (454K)

4. Geometric Representations (942K)

5. Combinatorial Formulations (404K)

6. Clustering Approaches (164K)

7. Conclusions (and Bibliography) (154K)