<trid="row_0_"class="even"><tdclass="entry"><spanstyle="width:0px;display:inline-block;"> </span><spanid="arr_0_"class="arrow"onclick="toggleFolder('0_')">►</span><spanclass="icona"><spanclass="icon">N</span></span><aclass="el"href="namespaceoperations__research.html"target="_self">operations_research</a></td><tdclass="desc">Collection of objects used to extend the <aclass="el"href="classoperations__research_1_1_constraint.html"title="A constraint is the main modeling object.">Constraint</a><aclass="el"href="classoperations__research_1_1_solver.html"title="Solver Class.">Solver</a> library </td></tr>
<trid="row_0_0_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_argument_holder.html"target="_self">ArgumentHolder</a></td><tdclass="desc">Argument Holder: useful when visiting a model </td></tr>
<trid="row_0_2_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_assignment.html"target="_self">Assignment</a></td><tdclass="desc">An <aclass="el"href="classoperations__research_1_1_assignment.html"title="An Assignment is a variable -> domains mapping, used to report solutions to the user.">Assignment</a> is a variable -> domains mapping, used to report solutions to the user </td></tr>
<trid="row_0_7_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_base_lns.html"target="_self">BaseLns</a></td><tdclass="desc">This is the base class for building an Lns operator </td></tr>
<trid="row_0_8_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_base_object.html"target="_self">BaseObject</a></td><tdclass="desc">A <aclass="el"href="classoperations__research_1_1_base_object.html"title="A BaseObject is the root of all reversibly allocated objects.">BaseObject</a> is the root of all reversibly allocated objects </td></tr>
<trid="row_0_10_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_call_method0.html"target="_self">CallMethod0</a></td><tdclass="desc"><aclass="el"href="classoperations__research_1_1_demon.html"title="A Demon is the base element of a propagation queue.">Demon</a> proxy to a method on the constraint with no arguments </td></tr>
<trid="row_0_11_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_call_method1.html"target="_self">CallMethod1</a></td><tdclass="desc"><aclass="el"href="classoperations__research_1_1_demon.html"title="A Demon is the base element of a propagation queue.">Demon</a> proxy to a method on the constraint with one argument </td></tr>
<trid="row_0_12_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_call_method2.html"target="_self">CallMethod2</a></td><tdclass="desc"><aclass="el"href="classoperations__research_1_1_demon.html"title="A Demon is the base element of a propagation queue.">Demon</a> proxy to a method on the constraint with two arguments </td></tr>
<trid="row_0_13_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_call_method3.html"target="_self">CallMethod3</a></td><tdclass="desc"><aclass="el"href="classoperations__research_1_1_demon.html"title="A Demon is the base element of a propagation queue.">Demon</a> proxy to a method on the constraint with three arguments </td></tr>
<trid="row_0_14_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_cast_constraint.html"target="_self">CastConstraint</a></td><tdclass="desc">Cast constraints are special channeling constraints designed to keep a variable in sync with an expression </td></tr>
<trid="row_0_15_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_change_value.html"target="_self">ChangeValue</a></td><tdclass="desc">Defines operators which change the value of variables; each neighbor corresponds to <em>one</em> modified variable </td></tr>
<trid="row_0_16_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_constraint.html"target="_self">Constraint</a></td><tdclass="desc">A constraint is the main modeling object </td></tr>
<trid="row_0_20_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_decision.html"target="_self">Decision</a></td><tdclass="desc">A <aclass="el"href="classoperations__research_1_1_decision.html"title="A Decision represents a choice point in the search tree.">Decision</a> represents a choice point in the search tree </td></tr>
<trid="row_0_21_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_decision_builder.html"target="_self">DecisionBuilder</a></td><tdclass="desc">A <aclass="el"href="classoperations__research_1_1_decision_builder.html"title="A DecisionBuilder is responsible for creating the search tree.">DecisionBuilder</a> is responsible for creating the search tree </td></tr>
<trid="row_0_22_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_decision_visitor.html"target="_self">DecisionVisitor</a></td><tdclass="desc">A <aclass="el"href="classoperations__research_1_1_decision_visitor.html"title="A DecisionVisitor is used to inspect a decision.">DecisionVisitor</a> is used to inspect a decision </td></tr>
<trid="row_0_23_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1_default_phase_parameters.html"target="_self">DefaultPhaseParameters</a></td><tdclass="desc">This struct holds all parameters for the default search </td></tr>
<trid="row_0_24_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_delayed_call_method0.html"target="_self">DelayedCallMethod0</a></td><tdclass="desc">Low-priority demon proxy to a method on the constraint with no arguments </td></tr>
<trid="row_0_25_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_delayed_call_method1.html"target="_self">DelayedCallMethod1</a></td><tdclass="desc">Low-priority demon proxy to a method on the constraint with one argument </td></tr>
<trid="row_0_26_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_delayed_call_method2.html"target="_self">DelayedCallMethod2</a></td><tdclass="desc">Low-priority demon proxy to a method on the constraint with two arguments </td></tr>
<trid="row_0_27_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_demon.html"target="_self">Demon</a></td><tdclass="desc">A <aclass="el"href="classoperations__research_1_1_demon.html"title="A Demon is the base element of a propagation queue.">Demon</a> is the base element of a propagation queue </td></tr>
<trid="row_0_31_"style="display:none;"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_0_31_"class="arrow"onclick="toggleFolder('0_31_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_disjunctive_propagator.html"target="_self">DisjunctivePropagator</a></td><tdclass="desc">This class acts like a CP propagator: it takes a set of tasks given by their start/duration/end features, and reduces the range of possible values </td></tr>
<trid="row_0_31_0_"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html"target="_self">Tasks</a></td><tdclass="desc">A structure to hold tasks described by their features </td></tr>
<trid="row_0_33_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_filtered_heuristic_close_nodes_l_n_s_operator.html"target="_self">FilteredHeuristicCloseNodesLNSOperator</a></td><tdclass="desc">Filtered heuristic LNS operator, where the destruction phase consists of removing a node and the 'num_close_nodes' nodes closest to it, along with each of their corresponding sibling pickup/deliveries that are performed </td></tr>
<trid="row_0_34_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_filtered_heuristic_expensive_chain_l_n_s_operator.html"target="_self">FilteredHeuristicExpensiveChainLNSOperator</a></td><tdclass="desc">Similar to the heuristic path LNS above, but instead of removing one route entirely, the destruction phase consists of removing all nodes on an "expensive" chain from a route </td></tr>
<trid="row_0_35_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html"target="_self">FilteredHeuristicLocalSearchOperator</a></td><tdclass="desc">Class of operators using a RoutingFilteredHeuristic to insert unperformed nodes after changes have been made to the current solution </td></tr>
<trid="row_0_36_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_filtered_heuristic_path_l_n_s_operator.html"target="_self">FilteredHeuristicPathLNSOperator</a></td><tdclass="desc">LNS-like operator based on a filtered first solution heuristic to rebuild the solution, after the destruction phase consisting of removing one route </td></tr>
<trid="row_0_39_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_global_vehicle_breaks_constraint.html"target="_self">GlobalVehicleBreaksConstraint</a></td><tdclass="desc"><aclass="el"href="classoperations__research_1_1_global_vehicle_breaks_constraint.html"title="GlobalVehicleBreaksConstraint ensures breaks constraints are enforced on all vehicles in the dimensio...">GlobalVehicleBreaksConstraint</a> ensures breaks constraints are enforced on all vehicles in the dimension passed to its constructor </td></tr>
<trid="row_0_41_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_index_pair_swap_active_operator.html"target="_self">IndexPairSwapActiveOperator</a></td><tdclass="desc">Operator which inserts inactive nodes into a path and makes a pair of active nodes inactive </td></tr>
<trid="row_0_42_"style="display:none;"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_0_42_"class="arrow"onclick="toggleFolder('0_42_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_init_and_get_values.html"target="_self">InitAndGetValues</a></td><tdclass="desc">Utility class to encapsulate an <aclass="el"href="classoperations__research_1_1_int_var_iterator.html"title="The class Iterator has two direct subclasses.">IntVarIterator</a> and use it in a range-based loop </td></tr>
<trid="row_0_43_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_interval_var.html"target="_self">IntervalVar</a></td><tdclass="desc">Interval variables are often used in scheduling </td></tr>
<trid="row_0_46_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_int_expr.html"target="_self">IntExpr</a></td><tdclass="desc">The class <aclass="el"href="classoperations__research_1_1_int_expr.html"title="The class IntExpr is the base of all integer expressions in constraint programming.">IntExpr</a> is the base of all integer expressions in constraint programming </td></tr>
<trid="row_0_47_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_int_var.html"target="_self">IntVar</a></td><tdclass="desc">The class <aclass="el"href="classoperations__research_1_1_int_var.html"title="The class IntVar is a subset of IntExpr.">IntVar</a> is a subset of <aclass="el"href="classoperations__research_1_1_int_expr.html"title="The class IntExpr is the base of all integer expressions in constraint programming.">IntExpr</a></td></tr>
<trid="row_0_50_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_int_var_iterator.html"target="_self">IntVarIterator</a></td><tdclass="desc">The class Iterator has two direct subclasses </td></tr>
<trid="row_0_53_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_int_var_local_search_operator.html"target="_self">IntVarLocalSearchOperator</a></td><tdclass="desc">Specialization of <aclass="el"href="classoperations__research_1_1_local_search_operator.html"title="The base class for all local search operators.">LocalSearchOperator</a> built from an array of IntVars which specifies the scope of the operator </td></tr>
<trid="row_0_56_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_local_search_filter.html"target="_self">LocalSearchFilter</a></td><tdclass="desc">Local Search Filters are used for fast neighbor pruning </td></tr>
<trid="row_0_57_"style="display:none;"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_0_57_"class="arrow"onclick="toggleFolder('0_57_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_local_search_filter_manager.html"target="_self">LocalSearchFilterManager</a></td><tdclass="desc">Filter manager: when a move is made, filters are executed to decide whether the solution is feasible and compute parts of the new cost </td></tr>
<trid="row_0_60_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_local_search_operator.html"target="_self">LocalSearchOperator</a></td><tdclass="desc">The base class for all local search operators </td></tr>
<trid="row_0_63_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_make_pair_active_operator.html"target="_self">MakePairActiveOperator</a></td><tdclass="desc">Pair-based neighborhood operators, designed to move nodes by pairs (pairs are static and given) </td></tr>
<trid="row_0_64_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_make_pair_inactive_operator.html"target="_self">MakePairInactiveOperator</a></td><tdclass="desc">Operator which makes pairs of active nodes inactive </td></tr>
<trid="row_0_65_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_make_relocate_neighbors_operator.html"target="_self">MakeRelocateNeighborsOperator</a></td><tdclass="desc">Relocate neighborhood which moves chains of neighbors </td></tr>
<trid="row_0_66_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_model_cache.html"target="_self">ModelCache</a></td><tdclass="desc">Implements a complete cache for model elements: expressions and constraints </td></tr>
<trid="row_0_69_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_numerical_rev.html"target="_self">NumericalRev</a></td><tdclass="desc">Subclass of Rev<T> which adds numerical operations </td></tr>
<trid="row_0_70_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_numerical_rev_array.html"target="_self">NumericalRevArray</a></td><tdclass="desc">Subclass of RevArray<T> which adds numerical operations </td></tr>
<trid="row_0_71_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_optimize_var.html"target="_self">OptimizeVar</a></td><tdclass="desc">This class encapsulates an objective </td></tr>
<trid="row_0_73_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_pair_exchange_operator.html"target="_self">PairExchangeOperator</a></td><tdclass="desc">Operator which exchanges the position of two pairs; for both pairs the first node of the pair must be before the second node on the same path </td></tr>
<trid="row_0_74_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_pair_exchange_relocate_operator.html"target="_self">PairExchangeRelocateOperator</a></td><tdclass="desc">Operator which exchanges the paths of two pairs (path have to be different) </td></tr>
<trid="row_0_75_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_pair_node_swap_active_operator.html"target="_self">PairNodeSwapActiveOperator</a></td><tdclass="desc">Operator which inserts pairs of inactive nodes into a path and makes an active node inactive </td></tr>
<trid="row_0_76_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_pair_relocate_operator.html"target="_self">PairRelocateOperator</a></td><tdclass="desc">Operator which moves a pair of nodes to another position where the first node of the pair must be before the second node on the same path </td></tr>
<trid="row_0_77_"style="display:none;"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_0_77_"class="arrow"onclick="toggleFolder('0_77_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_path_operator.html"target="_self">PathOperator</a></td><tdclass="desc">Base class of the local search operators dedicated to path modifications (a path is a set of nodes linked together by arcs) </td></tr>
<trid="row_0_77_0_"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1_path_operator_1_1_iteration_parameters.html"target="_self">IterationParameters</a></td><tdclass="desc">Set of parameters used to configure how the neighnorhood is traversed </td></tr>
<trid="row_0_82_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_regular_limit.html"target="_self">RegularLimit</a></td><tdclass="desc">Usual limit based on wall_time, number of explored branches and number of failures in the search tree </td></tr>
<trid="row_0_85_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_relocate_path_and_heuristic_insert_unperformed_operator.html"target="_self">RelocatePathAndHeuristicInsertUnperformedOperator</a></td><tdclass="desc">Heuristic-based local search operator which relocates an entire route to an empty vehicle of different vehicle class and then tries to insert unperformed nodes using the heuristic </td></tr>
<trid="row_0_86_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_relocate_subtrip.html"target="_self">RelocateSubtrip</a></td><tdclass="desc">Tries to move subtrips after an insertion node </td></tr>
<trid="row_0_88_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_rev.html"target="_self">Rev</a></td><tdclass="desc">This class adds reversibility to a POD type </td></tr>
<trid="row_0_89_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_rev_array.html"target="_self">RevArray</a></td><tdclass="desc">Reversible array of POD types </td></tr>
<trid="row_0_90_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_rev_bit_matrix.html"target="_self">RevBitMatrix</a></td><tdclass="desc">Matrix version of the <aclass="el"href="classoperations__research_1_1_rev_bit_set.html"title="This class represents a reversible bitset.">RevBitSet</a> class </td></tr>
<trid="row_0_91_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_rev_bit_set.html"target="_self">RevBitSet</a></td><tdclass="desc">This class represents a reversible bitset </td></tr>
<trid="row_0_92_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_rev_growing_array.html"target="_self">RevGrowingArray</a></td><tdclass="desc">This class is a reversible growing array </td></tr>
<trid="row_0_93_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_rev_immutable_multi_map.html"target="_self">RevImmutableMultiMap</a></td><tdclass="desc">Reversible Immutable MultiMap class </td></tr>
<trid="row_0_94_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_rev_int_set.html"target="_self">RevIntSet</a></td><tdclass="desc">This is a special class to represent a 'residual' set of T </td></tr>
<trid="row_0_96_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_rev_switch.html"target="_self">RevSwitch</a></td><tdclass="desc">A reversible switch that can switch once from false to true </td></tr>
<trid="row_0_98_"style="display:none;"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_0_98_"class="arrow"onclick="toggleFolder('0_98_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_routing_dimension.html"target="_self">RoutingDimension</a></td><tdclass="desc">Dimensions represent quantities accumulated at nodes along the routes </td></tr>
<trid="row_0_100_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_routing_index_manager.html"target="_self">RoutingIndexManager</a></td><tdclass="desc">Manager for any NodeIndex <-> variable index conversion </td></tr>
<trid="row_0_102_0_0_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1_routing_model_1_1_cost_class_1_1_dimension_cost.html"target="_self">DimensionCost</a></td><tdclass="desc">SUBTLE: The vehicle's fixed cost is skipped on purpose here, because we can afford to do so: </td></tr>
<trid="row_0_102_1_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanid="arr_0_102_1_"class="arrow"onclick="toggleFolder('0_102_1_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_routing_model_1_1_resource_group.html"target="_self">ResourceGroup</a></td><tdclass="desc">A <aclass="el"href="classoperations__research_1_1_routing_model_1_1_resource_group.html"title="A ResourceGroup defines a set of available Resources with attributes on one or multiple dimensions.">ResourceGroup</a> defines a set of available Resources with attributes on one or multiple dimensions </td></tr>
<trid="row_0_102_1_0_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_routing_model_1_1_resource_group_1_1_attributes.html"target="_self">Attributes</a></td><tdclass="desc"><aclass="el"href="classoperations__research_1_1_routing_model_1_1_resource_group_1_1_attributes.html"title="Attributes for a dimension.">Attributes</a> for a dimension </td></tr>
<trid="row_0_102_1_1_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_routing_model_1_1_resource_group_1_1_resource.html"target="_self">Resource</a></td><tdclass="desc">A <aclass="el"href="classoperations__research_1_1_routing_model_1_1_resource_group_1_1_resource.html"title="A Resource sets attributes (costs/constraints) for a set of dimensions.">Resource</a> sets attributes (costs/constraints) for a set of dimensions </td></tr>
<trid="row_0_102_2_"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1_routing_model_1_1_state_dependent_transit.html"target="_self">StateDependentTransit</a></td><tdclass="desc">What follows is relevant for models with time/state dependent transits </td></tr>
<trid="row_0_102_4_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanid="arr_0_102_4_"class="arrow"onclick="toggleFolder('0_102_4_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html"target="_self">VehicleTypeContainer</a></td><tdclass="desc">Struct used to sort and store vehicles by their type </td></tr>
<trid="row_0_104_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_routing_model_visitor.html"target="_self">RoutingModelVisitor</a></td><tdclass="desc">Routing model visitor </td></tr>
<trid="row_0_108_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_search_limit.html"target="_self">SearchLimit</a></td><tdclass="desc">Base class of all search limits </td></tr>
<trid="row_0_109_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_search_log.html"target="_self">SearchLog</a></td><tdclass="desc">The base class of all search logs that periodically outputs information when the search is running </td></tr>
<trid="row_0_110_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_search_monitor.html"target="_self">SearchMonitor</a></td><tdclass="desc">A search monitor is a simple set of callbacks to monitor all search events </td></tr>
<trid="row_0_111_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_sequence_var.html"target="_self">SequenceVar</a></td><tdclass="desc">A sequence variable is a variable whose domain is a set of possible orderings of the interval variables </td></tr>
<trid="row_0_113_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_sequence_var_element.html"target="_self">SequenceVarElement</a></td><tdclass="desc">The <aclass="el"href="classoperations__research_1_1_sequence_var_element.html"title="The SequenceVarElement stores a partial representation of ranked interval variables in the underlying...">SequenceVarElement</a> stores a partial representation of ranked interval variables in the underlying sequence variable </td></tr>
<trid="row_0_116_"style="display:none;"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_0_116_"class="arrow"onclick="toggleFolder('0_116_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_simple_bound_costs.html"target="_self">SimpleBoundCosts</a></td><tdclass="desc">A structure meant to store soft bounds and associated violation constants </td></tr>
<trid="row_0_117_"style="display:none;"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_0_117_"class="arrow"onclick="toggleFolder('0_117_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_simple_rev_f_i_f_o.html"target="_self">SimpleRevFIFO</a></td><tdclass="desc">This class represent a reversible FIFO structure </td></tr>
<trid="row_0_117_0_"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_simple_rev_f_i_f_o_1_1_iterator.html"target="_self">Iterator</a></td><tdclass="desc">This iterator is not stable with respect to deletion </td></tr>
<trid="row_0_118_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_small_rev_bit_set.html"target="_self">SmallRevBitSet</a></td><tdclass="desc">This class represents a small reversible bitset (size <= 64) </td></tr>
<trid="row_0_119_"style="display:none;"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_0_119_"class="arrow"onclick="toggleFolder('0_119_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_solution_collector.html"target="_self">SolutionCollector</a></td><tdclass="desc">This class is the root class of all solution collectors </td></tr>
<trid="row_0_120_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_solution_pool.html"target="_self">SolutionPool</a></td><tdclass="desc">This class is used to manage a pool of solutions </td></tr>
<trid="row_0_121_"style="display:none;"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_0_121_"class="arrow"onclick="toggleFolder('0_121_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_solver.html"target="_self">Solver</a></td><tdclass="desc"><aclass="el"href="classoperations__research_1_1_solver.html"title="Solver Class.">Solver</a> Class </td></tr>
<trid="row_0_121_0_"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1_solver_1_1_integer_cast_info.html"target="_self">IntegerCastInfo</a></td><tdclass="desc">Holds semantic information stating that the 'expression' has been cast into 'variable' using the Var() method, and that 'maintainer' is responsible for maintaining the equality between 'variable' and 'expression' </td></tr>
<trid="row_0_121_1_"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1_solver_1_1_search_log_parameters.html"target="_self">SearchLogParameters</a></td><tdclass="desc">Creates a search monitor from logging parameters </td></tr>
<trid="row_0_122_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_swap_index_pair_operator.html"target="_self">SwapIndexPairOperator</a></td><tdclass="desc">Operator which iterates through each alternative of a set of pairs </td></tr>
<trid="row_0_123_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_symmetry_breaker.html"target="_self">SymmetryBreaker</a></td><tdclass="desc">A symmetry breaker is an object that will visit a decision and create the 'symmetrical' decision in return </td></tr>
<trid="row_0_125_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_type_incompatibility_checker.html"target="_self">TypeIncompatibilityChecker</a></td><tdclass="desc">Checker for type incompatibilities </td></tr>
<trid="row_0_127_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_type_regulations_constraint.html"target="_self">TypeRegulationsConstraint</a></td><tdclass="desc">The following constraint ensures that incompatibilities and requirements between types are respected </td></tr>
<trid="row_0_128_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_type_requirement_checker.html"target="_self">TypeRequirementChecker</a></td><tdclass="desc">Checker for type requirements </td></tr>
<trid="row_0_130_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_unsorted_nullable_rev_bitset.html"target="_self">UnsortedNullableRevBitset</a></td><tdclass="desc">This class represents a reversible bitset </td></tr>
<trid="row_0_131_"style="display:none;"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1_var_local_search_operator.html"target="_self">VarLocalSearchOperator</a></td><tdclass="desc">Base operator class for operators manipulating variables </td></tr>
