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