 | TABU SEARCH BACKGROUND
 | General Tenets
 | Use of Memory
 | Intensification and Diversification
 | Adaptive Memory Programming
 | Is Memory Really a Good Idea?
 | Points of Departure
 | Elements of Adaptive Memory
 | Historical Note on Tabu Search
 | Historical Note on Meta-Heuristics
 | Discussion Questions and Exercises
| | | | | | | | | |
 | TS FOUNDATIONS: SHORT TERM MEMORY
 | Memory and Tabu Classifications
 | Recency-Based Memory
 | A First Level Tabu Search Approach
 | Recency-Based Memory for Add/Drop Moves
 | Tabu Tenure
 | Discussion Questions and Exercises
| | | | | |
 | TS FOUNDATIONS: ADDITIONAL ASPECTS OF SHORT TERM MEMORY
 | Tabu Search and Candidate List Strategies
 | Some General Classes of Candidate List Strategies
 | Connections Between Candidate Lists, Tabu Status and Aspiration Criteria
 | Logical Restructuring
 | Special Cases and Extensions of Recency-Based Implementations
 | Discussion Questions and Exercises
| | | | | |
 | TS FOUNDATIONS: LONGER TERM MEMORY
 | Frequency-Based Approach
 | Intensification Strategies
 | Diversification Strategies
 | Strategic Oscillation
 | Path Relinking
 | The Intensification / Diversification Distinction
 | Some Basic Memory Structures for Longer Term Strategies
 | Discussion Questions and Exercises
| | | | | | | |
 | TABU SEARCH PRINCIPLES
 | Influence and Measures of Distance and Diversity
 | The Principle of Persistent Attractiveness
 | The Principle of Persistent Voting
 | Compound Moves, Variable Depth and Ejection Chains
 | The Proximate Optimality Principle
 | The Principle of Congenial Structures
 | The Pyramid Principle
 | The Space/Time Principle
 | Discussion Questions and Exercises
| | | | | | | | |
 | TABU SEARCH IN INTEGER PROGRAMMING
 | A Tabu Branching Method
 | Tabu Search and Cut Search
 | Cut Search
 | Star Paths for Integer Programs
 | Branching on Created Variables
 | Discussion Questions and Exercises
| | | | | |
 | SPECIAL TABU SEARCH TOPICS
 | Probabilistic Tabu Search
 | Tabu Thresholding
 | Special Dynamic Tabu Tenure Strategies
 | Hash Functions
 | Ejection Chains
 | Vocabulary Building
 | Parallel Processing
 | Discussion Questions and Exercises
| | | | | | | |
 | TABU SEARCH APPLICATIONS
 | Planning and Scheduling
 | Telecommunications
 | Parallel Computing
 | Transportation, Routing and Network Design
 | Optimization on Structures
 | Optimization on Graphs
 | Neural Networks and Learning
 | Continuous and Stochastic Optimzation
 | Manufacturing
 | Financial Analysis
 | Specialized Techniques and General Zero-One Solvers
 | Constraint Satisfaction and Satisfiability
| | | | | | | | | | | |
 | CONNECTIONS, HYBRID APPROACHES AND LEARNING
 | Simulated Annealing
 | Genetic Algorithms
 | Scatter Search
 | Greedy Randomized Adaptive Search Procedures
 | Neural Networks
 | Target Analysis
 | Discussion Questions and Exercises
 | Appendix: Illustrative Version of Nonlinear Scatter Search
| | | | | | | |
 | NEGLECTED TABU SEARCH STRATEGIES
 | Candidate List Strategies
 | Probabilistic Tabu Search
 | Intensification Approaches
 | Diversification Approaches
 | Clustering and Conditional Analysis
 | Referent-Domain Optimization
 | Discussion Questions and Exercises
| | | | | | |
 | REFERENCES
 | INDEX
| | | | | | | | | | | |