1<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
2<area shape="rect" id="node1" href="$classoperations__research_1_1_base_object.html" title="A BaseObject is the root of all reversibly allocated objects." alt="" coords="5,533,101,560"/>
3<area shape="rect" id="node2" href="$classoperations__research_1_1_array_with_offset.html" title=" " alt="" coords="161,152,327,179"/>
4<area shape="rect" id="node3" href="$classoperations__research_1_1_decision.html" title="A Decision represents a choice point in the search tree." alt="" coords="205,203,283,229"/>
5<area shape="rect" id="node4" href="$classoperations__research_1_1_decision_builder.html" title="A DecisionBuilder is responsible for creating the search tree." alt="" coords="182,253,306,280"/>
6<area shape="rect" id="node6" href="$classoperations__research_1_1_decision_visitor.html" title="A DecisionVisitor is used to inspect a decision." alt="" coords="184,304,304,331"/>
7<area shape="rect" id="node8" href="$classoperations__research_1_1_demon.html" title="A Demon is the base element of a propagation queue." alt="" coords="209,355,279,381"/>
8<area shape="rect" id="node16" href="$classoperations__research_1_1_int_var_iterator.html" title="The class Iterator has two direct subclasses." alt="" coords="191,457,297,484"/>
9<area shape="rect" id="node17" href="$classoperations__research_1_1_local_search_filter.html" title="Local Search Filters are used for fast neighbor pruning." alt="" coords="177,508,311,535"/>
10<area shape="rect" id="node19" href="$classoperations__research_1_1_local_search_filter_manager.html" title="Filter manager: when a move is made, filters are executed to decide whether the solution is feasible ..." alt="" coords="149,559,339,585"/>
11<area shape="rect" id="node20" href="$classoperations__research_1_1_local_search_operator.html" title="The base class for all local search operators." alt="" coords="165,609,323,636"/>
12<area shape="rect" id="node46" href="$classoperations__research_1_1_model_visitor.html" title="Model visitor." alt="" coords="193,683,295,709"/>
13<area shape="rect" id="node48" href="$classoperations__research_1_1_propagation_base_object.html" title="NOLINT." alt="" coords="157,807,331,833"/>
14<area shape="rect" id="node62" href="$classoperations__research_1_1_routing_model_visitor.html" title="Routing model visitor." alt="" coords="167,857,321,884"/>
15<area shape="rect" id="node63" href="$classoperations__research_1_1_search_monitor.html" title="A search monitor is a simple set of callbacks to monitor all search events." alt="" coords="187,1085,301,1112"/>
16<area shape="rect" id="node72" href="$classoperations__research_1_1_solution_pool.html" title="This class is used to manage a pool of solutions." alt="" coords="193,1136,295,1163"/>
17<area shape="rect" id="node5" href="$classoperations__research_1_1_profiled_decision_builder.html" title=" " alt="" coords="403,5,577,32"/>
18<area shape="rect" id="node7" href="$classoperations__research_1_1_symmetry_breaker.html" title="A symmetry breaker is an object that will visit a decision and create the &#39;symmetrical&#39; decision in r..." alt="" coords="419,56,561,83"/>
19<area shape="rect" id="node9" href="$classoperations__research_1_1_call_method0.html" title="Demon proxy to a method on the constraint with no arguments." alt="" coords="419,107,561,133"/>
20<area shape="rect" id="node10" href="$classoperations__research_1_1_call_method1.html" title="Demon proxy to a method on the constraint with one argument." alt="" coords="411,157,569,184"/>
21<area shape="rect" id="node11" href="$classoperations__research_1_1_call_method2.html" title="Demon proxy to a method on the constraint with two arguments." alt="" coords="403,208,577,235"/>
22<area shape="rect" id="node12" href="$classoperations__research_1_1_call_method3.html" title="Demon proxy to a method on the constraint with three arguments." alt="" coords="417,259,563,301"/>
23<area shape="rect" id="node13" href="$classoperations__research_1_1_delayed_call_method0.html" title="Low&#45;priority demon proxy to a method on the constraint with no arguments." alt="" coords="393,325,587,352"/>
24<area shape="rect" id="node14" href="$classoperations__research_1_1_delayed_call_method1.html" title="Low&#45;priority demon proxy to a method on the constraint with one argument." alt="" coords="411,377,569,418"/>
25<area shape="rect" id="node15" href="$classoperations__research_1_1_delayed_call_method2.html" title="Low&#45;priority demon proxy to a method on the constraint with two arguments." alt="" coords="411,442,569,483"/>
26<area shape="rect" id="node18" href="$classoperations__research_1_1_int_var_local_search_filter.html" title=" " alt="" coords="405,508,575,535"/>
27<area shape="rect" id="node21" href="$classoperations__research_1_1_var_local_search_operator.html" title=" " alt="" coords="387,559,593,615"/>
28<area shape="rect" id="node44" href="$classoperations__research_1_1_var_local_search_operator.html" title="Base operator class for operators manipulating variables." alt="" coords="401,639,579,681"/>
29<area shape="rect" id="node22" href="$classoperations__research_1_1_int_var_local_search_operator.html" title="Specialization of LocalSearchOperator built from an array of IntVars which specifies the scope of the..." alt="" coords="664,573,859,600"/>
30<area shape="rect" id="node23" href="$classoperations__research_1_1_base_lns.html" title="This is the base class for building an Lns operator." alt="" coords="995,464,1071,491"/>
31<area shape="rect" id="node24" href="$classoperations__research_1_1_change_value.html" title="Defines operators which change the value of variables; each neighbor corresponds to one modified vari..." alt="" coords="979,515,1086,541"/>
32<area shape="rect" id="node25" href="$classoperations__research_1_1_filtered_heuristic_local_search_operator.html" title="Class of operators using a RoutingFilteredHeuristic to insert unperformed nodes after changes have be..." alt="" coords="929,566,1136,607"/>
33<area shape="rect" id="node30" href="$classoperations__research_1_1_path_operator.html" title="Base class of the local search operators dedicated to path modifications (a path is a set of nodes li..." alt="" coords="979,867,1087,893"/>
34<area shape="rect" id="node43" href="$classoperations__research_1_1_swap_index_pair_operator.html" title="Operator which iterates through each alternative of a set of pairs." alt="" coords="945,917,1120,944"/>
35<area shape="rect" id="node26" href="$classoperations__research_1_1_filtered_heuristic_close_nodes_l_n_s_operator.html" title="Filtered heuristic LNS operator, where the destruction phase consists of removing a node and the &#39;num..." alt="" coords="1201,390,1407,431"/>
36<area shape="rect" id="node27" href="$classoperations__research_1_1_filtered_heuristic_expensive_chain_l_n_s_operator.html" title="Similar to the heuristic path LNS above, but instead of removing one route entirely,..." alt="" coords="1206,455,1402,497"/>
37<area shape="rect" id="node28" href="$classoperations__research_1_1_filtered_heuristic_path_l_n_s_operator.html" title="LNS&#45;like operator based on a filtered first solution heuristic to rebuild the solution,..." alt="" coords="1184,521,1424,548"/>
38<area shape="rect" id="node29" href="$classoperations__research_1_1_relocate_path_and_heuristic_insert_unperformed_operator.html" title="Heuristic&#45;based local search operator which relocates an entire route to an empty vehicle of differen..." alt="" coords="1203,573,1405,614"/>
39<area shape="rect" id="node31" href="$classoperations__research_1_1_exchange_subtrip.html" title=" " alt="" coords="1239,639,1369,665"/>
40<area shape="rect" id="node32" href="$classoperations__research_1_1_index_pair_swap_active_operator.html" title="Operator which inserts inactive nodes into a path and makes a pair of active nodes inactive." alt="" coords="1196,689,1412,716"/>
41<area shape="rect" id="node33" href="$classoperations__research_1_1_light_pair_relocate_operator.html" title=" " alt="" coords="1207,740,1401,767"/>
42<area shape="rect" id="node34" href="$classoperations__research_1_1_make_pair_active_operator.html" title="Pair&#45;based neighborhood operators, designed to move nodes by pairs (pairs are static and given)." alt="" coords="1214,791,1394,817"/>
43<area shape="rect" id="node35" href="$classoperations__research_1_1_make_pair_inactive_operator.html" title="Operator which makes pairs of active nodes inactive." alt="" coords="1209,841,1399,868"/>
44<area shape="rect" id="node36" href="$classoperations__research_1_1_make_relocate_neighbors_operator.html" title="Relocate neighborhood which moves chains of neighbors." alt="" coords="1185,892,1423,919"/>
45<area shape="rect" id="node37" href="$classoperations__research_1_1_pair_exchange_operator.html" title="Operator which exchanges the position of two pairs; for both pairs the first node of the pair must be..." alt="" coords="1221,943,1387,969"/>
46<area shape="rect" id="node38" href="$classoperations__research_1_1_pair_exchange_relocate_operator.html" title="Operator which exchanges the paths of two pairs (path have to be different)." alt="" coords="1192,993,1416,1020"/>
47<area shape="rect" id="node39" href="$classoperations__research_1_1_pair_node_swap_active_operator.html" title="Operator which inserts pairs of inactive nodes into a path and makes an active node inactive." alt="" coords="1197,1045,1411,1086"/>
48<area shape="rect" id="node40" href="$classoperations__research_1_1_pair_relocate_operator.html" title="Operator which moves a pair of nodes to another position where the first node of the pair must be bef..." alt="" coords="1223,1111,1385,1137"/>
49<area shape="rect" id="node41" href="$classoperations__research_1_1_relocate_expensive_chain.html" title="RelocateExpensiveChain." alt="" coords="1213,1161,1395,1188"/>
50<area shape="rect" id="node42" href="$classoperations__research_1_1_relocate_subtrip.html" title="Tries to move subtrips after an insertion node." alt="" coords="1241,1212,1367,1239"/>
51<area shape="rect" id="node45" href="$classoperations__research_1_1_sequence_var_local_search_operator.html" title=" " alt="" coords="641,636,881,663"/>
52<area shape="rect" id="node47" href="$classoperations__research_1_1_model_parser.html" title="Model Parser." alt="" coords="439,705,541,732"/>
53<area shape="rect" id="node49" href="$classoperations__research_1_1_assignment.html" title="An Assignment is a variable &#45;&gt; domains mapping, used to report solutions to the user." alt="" coords="441,756,539,783"/>
54<area shape="rect" id="node50" href="$classoperations__research_1_1_constraint.html" title="A constraint is the main modeling object." alt="" coords="445,807,535,833"/>
55<area shape="rect" id="node56" href="$classoperations__research_1_1_int_expr.html" title="The class IntExpr is the base of all integer expressions in constraint programming." alt="" coords="456,857,524,884"/>
56<area shape="rect" id="node60" href="$classoperations__research_1_1_interval_var.html" title="Interval variables are often used in scheduling." alt="" coords="444,908,536,935"/>
57<area shape="rect" id="node61" href="$classoperations__research_1_1_sequence_var.html" title="A sequence variable is a variable whose domain is a set of possible orderings of the interval variabl..." alt="" coords="437,959,543,985"/>
58<area shape="rect" id="node51" href="$classoperations__research_1_1_cast_constraint.html" title="Cast constraints are special channeling constraints designed to keep a variable in sync with an expre..." alt="" coords="702,687,821,713"/>
59<area shape="rect" id="node52" href="$classoperations__research_1_1_disjunctive_constraint.html" title=" " alt="" coords="680,737,843,764"/>
60<area shape="rect" id="node53" href="$classoperations__research_1_1_global_vehicle_breaks_constraint.html" title="GlobalVehicleBreaksConstraint ensures breaks constraints are enforced on all vehicles in the dimensio..." alt="" coords="650,788,873,815"/>
61<area shape="rect" id="node54" href="$classoperations__research_1_1_pack.html" title=" " alt="" coords="735,839,788,865"/>
62<area shape="rect" id="node55" href="$classoperations__research_1_1_type_regulations_constraint.html" title="The following constraint ensures that incompatibilities and requirements between types are respected." alt="" coords="663,889,859,916"/>
63<area shape="rect" id="node57" href="$classoperations__research_1_1_base_int_expr.html" title=" " alt="" coords="711,940,811,967"/>
64<area shape="rect" id="node58" href="$classoperations__research_1_1_int_var.html" title="The class IntVar is a subset of IntExpr." alt="" coords="732,991,791,1017"/>
65<area shape="rect" id="node59" href="$classoperations__research_1_1_boolean_var.html" title=" " alt="" coords="985,991,1080,1017"/>
66<area shape="rect" id="node64" href="$classoperations__research_1_1_local_search_monitor.html" title=" " alt="" coords="415,1009,565,1036"/>
67<area shape="rect" id="node65" href="$classoperations__research_1_1_optimize_var.html" title="This class encapsulates an objective." alt="" coords="439,1060,541,1087"/>
68<area shape="rect" id="node66" href="$classoperations__research_1_1_propagation_monitor.html" title=" " alt="" coords="415,1111,565,1137"/>
69<area shape="rect" id="node67" href="$classoperations__research_1_1_search_limit.html" title="Base class of all search limits." alt="" coords="441,1161,539,1188"/>
70<area shape="rect" id="node70" href="$classoperations__research_1_1_search_log.html" title="The base class of all search logs that periodically outputs information when the search is running." alt="" coords="445,1212,535,1239"/>
71<area shape="rect" id="node71" href="$classoperations__research_1_1_solution_collector.html" title="This class is the root class of all solution collectors." alt="" coords="423,1263,557,1289"/>
72<area shape="rect" id="node68" href="$classoperations__research_1_1_improvement_search_limit.html" title=" " alt="" coords="668,1136,855,1163"/>
73<area shape="rect" id="node69" href="$classoperations__research_1_1_regular_limit.html" title="Usual limit based on wall_time, number of explored branches and number of failures in the search tree..." alt="" coords="709,1187,814,1213"/>
74</map>
75