bbad098cba
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@25 331e1502-861f-0410-8da2-ba01fb791d7f
31 lines
4.6 KiB
TeX
31 lines
4.6 KiB
TeX
\section{PARADISEO-MO Class List}
|
|
Here are the classes, structs, unions and interfaces with brief descriptions:\begin{CompactList}
|
|
\item\contentsline{section}{{\bf Empty\-Selection} (Special class that describes the case of no selection )}{\pageref{class_empty_selection}}{}
|
|
\item\contentsline{section}{{\bf mo\-Algo$<$ EOT $>$} (Description of an algorithm of the mo library )}{\pageref{classmo_algo}}{}
|
|
\item\contentsline{section}{{\bf mo\-Aspir\-Crit$<$ M $>$} (Description of the conditions in which a tabu move could be accepted )}{\pageref{classmo_aspir_crit}}{}
|
|
\item\contentsline{section}{{\bf mo\-Best\-Impr\-Select$<$ M $>$} (One of the possible {\bf mo\-Move\-Select}{\rm (p.\,\pageref{classmo_move_select})} )}{\pageref{classmo_best_impr_select}}{}
|
|
\item\contentsline{section}{{\bf mo\-Cool\-Sched} (This class gives the description of a cooling schedule )}{\pageref{classmo_cool_sched}}{}
|
|
\item\contentsline{section}{{\bf mo\-Easy\-Cool\-Sched} (One of the possible {\bf mo\-Cool\-Sched}{\rm (p.\,\pageref{classmo_cool_sched})} )}{\pageref{classmo_easy_cool_sched}}{}
|
|
\item\contentsline{section}{{\bf mo\-First\-Impr\-Select$<$ M $>$} (One possible {\bf mo\-Move\-Select}{\rm (p.\,\pageref{classmo_move_select})} )}{\pageref{classmo_first_impr_select}}{}
|
|
\item\contentsline{section}{{\bf mo\-Gen\-Sol\-Continue$<$ EOT $>$} (One possible stop criterion for a solution-based heuristic )}{\pageref{classmo_gen_sol_continue}}{}
|
|
\item\contentsline{section}{{\bf mo\-HC$<$ M $>$} (Hill Climbing (HC) )}{\pageref{classmo_h_c}}{}
|
|
\item\contentsline{section}{{\bf mo\-HCMove\-Loop\-Expl$<$ M $>$} (Iterative explorer used by a {\bf mo\-HC}{\rm (p.\,\pageref{classmo_h_c})} )}{\pageref{classmo_h_c_move_loop_expl}}{}
|
|
\item\contentsline{section}{{\bf mo\-Impr\-Best\-Fit\-Aspir\-Crit$<$ M $>$} (One of the possible {\bf mo\-Aspir\-Crit}{\rm (p.\,\pageref{classmo_aspir_crit})} )}{\pageref{classmo_impr_best_fit_aspir_crit}}{}
|
|
\item\contentsline{section}{{\bf mo\-It\-Rand\-Next\-Move$<$ M $>$} (One of the possible {\bf mo\-Next\-Move}{\rm (p.\,\pageref{classmo_next_move})} )}{\pageref{classmo_it_rand_next_move}}{}
|
|
\item\contentsline{section}{{\bf mo\-LSCheck\-Point$<$ M $>$} (Class which allows a checkpointing system )}{\pageref{classmo_l_s_check_point}}{}
|
|
\item\contentsline{section}{{\bf mo\-Move$<$ EOT $>$} (Definition of a move )}{\pageref{classmo_move}}{}
|
|
\item\contentsline{section}{{\bf mo\-Move\-Expl$<$ M $>$} (Description of a move ({\bf mo\-Move}{\rm (p.\,\pageref{classmo_move})}) explorer )}{\pageref{classmo_move_expl}}{}
|
|
\item\contentsline{section}{{\bf mo\-Move\-Incr\-Eval$<$ M $>$} ((generally) Efficient evaluation function based a move and a solution )}{\pageref{classmo_move_incr_eval}}{}
|
|
\item\contentsline{section}{{\bf mo\-Move\-Init$<$ M $>$} (Move ({\bf mo\-Move}{\rm (p.\,\pageref{classmo_move})}) initializer )}{\pageref{classmo_move_init}}{}
|
|
\item\contentsline{section}{{\bf mo\-Move\-Loop\-Expl$<$ M $>$} (Class which describes an iterative explorer )}{\pageref{classmo_move_loop_expl}}{}
|
|
\item\contentsline{section}{{\bf mo\-Move\-Select$<$ M $>$} (Class that describes a move selector ({\bf mo\-Move}{\rm (p.\,\pageref{classmo_move})}) )}{\pageref{classmo_move_select}}{}
|
|
\item\contentsline{section}{{\bf mo\-Next\-Move$<$ M $>$} (Class which allows to generate a new move ({\bf mo\-Move}{\rm (p.\,\pageref{classmo_move})}) )}{\pageref{classmo_next_move}}{}
|
|
\item\contentsline{section}{{\bf mo\-No\-Aspir\-Crit$<$ M $>$} (One of the possible aspiration criterion ({\bf mo\-Aspir\-Crit}{\rm (p.\,\pageref{classmo_aspir_crit})}) )}{\pageref{classmo_no_aspir_crit}}{}
|
|
\item\contentsline{section}{{\bf mo\-Rand\-Impr\-Select$<$ M $>$} (One of the possible {\bf mo\-Move}{\rm (p.\,\pageref{classmo_move})} selector ({\bf mo\-Move\-Select}{\rm (p.\,\pageref{classmo_move_select})}) )}{\pageref{classmo_rand_impr_select}}{}
|
|
\item\contentsline{section}{{\bf mo\-Rand\-Move$<$ M $>$} (Random move generator )}{\pageref{classmo_rand_move}}{}
|
|
\item\contentsline{section}{{\bf mo\-SA$<$ M $>$} (Simulated Annealing (SA) )}{\pageref{classmo_s_a}}{}
|
|
\item\contentsline{section}{{\bf mo\-Sol\-Continue$<$ EOT $>$} (Class that describes a stop criterion for a solution-based heuristic )}{\pageref{classmo_sol_continue}}{}
|
|
\item\contentsline{section}{{\bf mo\-Tabu\-List$<$ M $>$} (Class describing a tabu list that a {\bf mo\-TS}{\rm (p.\,\pageref{classmo_t_s})} uses )}{\pageref{classmo_tabu_list}}{}
|
|
\item\contentsline{section}{{\bf mo\-TS$<$ M $>$} (Tabu Search (TS) )}{\pageref{classmo_t_s}}{}
|
|
\item\contentsline{section}{{\bf mo\-TSMove\-Loop\-Expl$<$ M $>$} (Explorer for a Tabu Search algorithm )}{\pageref{classmo_t_s_move_loop_expl}}{}
|
|
\end{CompactList}
|