Next:
Introduction
Programming Search Methods in ECLiPSe
Joachim Schimpf - Kish Shen - Mark Wallace
© Imperial College London 2001
Introduction
Overview of Search Methods
Optimisation and Search
Heuristics
Complete Tree Search with Heuristics
Search Trees
Variable Selection
Value Selection
Example
Counting Backtracks
Incomplete Tree Search
Bounded Backtrack Search
Credit Search
Timeout
Limited Discrepancy Search
Introduction
Limited Discrepancy Search using a Static Heuristic
Limited Discrepancy Search using a Dynamic Heuristic
LDS and BBS Combined
Local Search Methods
The Knapsack Example
Search Code Schema
Random walk
Hill Climbing
Simulated Annealing
Tabu Search
Hybrid Search Methods
Weak-commitment Search
Introduction
Using the WCS
Implementation of WCS
Improving Implementation of Nogoods
About this document ...
Warwick Harvey
2002-05-15
