Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 12]
  mets | |
   solution_recorder | The solution recorder is used by search algorithm, at the end of each iteration, to record the best seen solution |
| abstract_search | An abstract search |
| best_ever_solution | The best ever solution recorder can be used as a simple solution recorder that just records the best copyable solution found during its lifetime |
| search_listener | An object that is called back during the search progress |
| iteration_logger | |
| improvement_logger | |
| local_search | Local search algorithm |
| no_moves_error | Exception risen when some algorithm has no more moves to make |
| sequence | A sequence function object useful as an STL generator |
| clonable | An interface for prototype objects |
| hashable | An interface for hashable objects |
| copyable | An interface for copyable objects |
| printable | An interface for printable objects |
| feasible_solution | Interface of a feasible solution space to be searched with tabu search |
| evaluable_solution | A copyable and evaluable solution implementation, |
| permutation_problem | An abstract permutation problem |
| move | Move to be operated on a feasible solution |
| mana_move | A Mana Move is a move that can be automatically made tabu by the mets::simple_tabu_list |
| swap_neighborhood | Generates a stochastic subset of the neighborhood |
| swap_elements | A mets::mana_move that swaps two elements in a mets::permutation_problem |
| invert_subsequence | A mets::mana_move that swaps a subsequence of elements in a mets::permutation_problem |
| move_manager | A neighborhood generator |
| swap_full_neighborhood | Generates a the full swap neighborhood |
| invert_full_neighborhood | Generates a the full subsequence inversion neighborhood |
| mana_move_hash | Functor class to allow hash_set of moves (used by tabu list) |
| dereferenced_equal_to | Functor class to allow hash_set of moves (used by tabu list) |
| observer | Template base class for the observers of some observed_subject |
| subject | Template class for subjects (cfr. Observer Design Pattern) |
| update_observer | Functor class to update observers with a for_each, only intended for internal use |
| abstract_cooling_schedule | Cooling criteria (for Simulated Annealing) |
| simulated_annealing | Search by Simulated Annealing |
| exponential_cooling | Original ECS proposed by Kirkpatrick |
| linear_cooling | Alternative LCS proposed by Randelman and Grest |
| aspiration_criteria_chain | Function object expressing an aspiration criteria |
| tabu_list_chain | An abstract tabu list |
| tabu_search | Tabu Search algorithm |
| simple_tabu_list | Simplistic implementation of a tabu-list |
| best_ever_criteria | Aspiration criteria implementation |
| termination_criteria_chain | Function object expressing a termination criteria |
| iteration_termination_criteria | Termination criteria based on the number of iterations |
| noimprove_termination_criteria | Termination criteria based on the number of iterations without an improvement |
| threshold_termination_criteria | Termination criteria based on cost value |
 forever |