<areashape="rect"href="classoperations__research_1_1_argument_holder.html"title="Argument Holder: useful when visiting a model."alt=""coords="5,5,135,32"/>
<areashape="rect"href="classoperations__research_1_1_sequence_var_element.html"title="The SequenceVarElement stores a partial representation of ranked interval variables in the underlying..."alt=""coords="207,107,368,133"/>
<areashape="rect"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"/>
<areashape="rect"href="classoperations__research_1_1_decision.html"title="A Decision represents a choice point in the search tree."alt=""coords="205,203,283,229"/>
<areashape="rect"href="classoperations__research_1_1_decision_builder.html"title="A DecisionBuilder is responsible for creating the search tree."alt=""coords="182,253,306,280"/>
<areashape="rect"href="classoperations__research_1_1_decision_visitor.html"title="A DecisionVisitor is used to inspect a decision."alt=""coords="184,304,304,331"/>
<areashape="rect"href="classoperations__research_1_1_demon.html"title="A Demon is the base element of a propagation queue."alt=""coords="209,355,279,381"/>
<areashape="rect"href="classoperations__research_1_1_int_var_iterator.html"title="The class Iterator has two direct subclasses."alt=""coords="189,457,299,484"/>
<areashape="rect"href="classoperations__research_1_1_local_search_filter.html"title="Local Search Filters are used for fast neighbor pruning."alt=""coords="178,508,310,535"/>
<areashape="rect"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"/>
<areashape="rect"href="classoperations__research_1_1_local_search_operator.html"title="The base class for all local search operators."alt=""coords="165,609,323,636"/>
<areashape="rect"href="classoperations__research_1_1_routing_model_visitor.html"title="Routing model visitor."alt=""coords="167,857,321,884"/>
<areashape="rect"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="186,1085,302,1112"/>
<areashape="rect"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"/>
<areashape="rect"href="classoperations__research_1_1_symmetry_breaker.html"title="A symmetry breaker is an object that will visit a decision and create the 'symmetrical' decision in r..."alt=""coords="422,56,562,83"/>
<areashape="rect"href="classoperations__research_1_1_call_method0.html"title="Demon proxy to a method on the constraint with no arguments."alt=""coords="421,107,563,133"/>
<areashape="rect"href="classoperations__research_1_1_call_method1.html"title="Demon proxy to a method on the constraint with one argument."alt=""coords="413,157,571,184"/>
<areashape="rect"href="classoperations__research_1_1_call_method2.html"title="Demon proxy to a method on the constraint with two arguments."alt=""coords="404,208,580,235"/>
<areashape="rect"href="classoperations__research_1_1_call_method3.html"title="Demon proxy to a method on the constraint with three arguments."alt=""coords="419,259,565,301"/>
<areashape="rect"href="classoperations__research_1_1_delayed_call_method0.html"title="Low-priority demon proxy to a method on the constraint with no arguments."alt=""coords="394,325,590,352"/>
<areashape="rect"href="classoperations__research_1_1_delayed_call_method1.html"title="Low-priority demon proxy to a method on the constraint with one argument."alt=""coords="413,377,571,418"/>
<areashape="rect"href="classoperations__research_1_1_delayed_call_method2.html"title="Low-priority demon proxy to a method on the constraint with two arguments."alt=""coords="413,442,571,483"/>
<areashape="rect"href="classoperations__research_1_1_var_local_search_operator.html"title="Base operator class for operators manipulating variables."alt=""coords="403,639,581,681"/>
<areashape="rect"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="669,573,865,600"/>
<areashape="rect"href="classoperations__research_1_1_base_lns.html"title="This is the base class for building an Lns operator."alt=""coords="1001,464,1077,491"/>
<areashape="rect"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="985,515,1093,541"/>
<areashape="rect"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="936,566,1143,607"/>
<areashape="rect"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="985,867,1093,893"/>
<areashape="rect"href="classoperations__research_1_1_swap_index_pair_operator.html"title="Operator which iterates through each alternative of a set of pairs."alt=""coords="952,917,1127,944"/>
<areashape="rect"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 'num..."alt=""coords="1207,390,1413,431"/>
<areashape="rect"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="1213,455,1407,497"/>
<areashape="rect"href="classoperations__research_1_1_filtered_heuristic_path_l_n_s_operator.html"title="LNS-like operator based on a filtered first solution heuristic to rebuild the solution,..."alt=""coords="1191,521,1429,548"/>
<areashape="rect"href="classoperations__research_1_1_relocate_path_and_heuristic_insert_unperformed_operator.html"title="Heuristic-based local search operator which relocates an entire route to an empty vehicle of differen..."alt=""coords="1209,573,1411,614"/>
<areashape="rect"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="1202,689,1418,716"/>
<areashape="rect"href="classoperations__research_1_1_make_pair_active_operator.html"title="Pair-based neighborhood operators, designed to move nodes by pairs (pairs are static and given)."alt=""coords="1220,791,1400,817"/>
<areashape="rect"href="classoperations__research_1_1_make_pair_inactive_operator.html"title="Operator which makes pairs of active nodes inactive."alt=""coords="1215,841,1405,868"/>
<areashape="rect"href="classoperations__research_1_1_make_relocate_neighbors_operator.html"title="Relocate neighborhood which moves chains of neighbors."alt=""coords="1191,892,1429,919"/>
<areashape="rect"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="1227,943,1393,969"/>
<areashape="rect"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="1198,993,1422,1020"/>
<areashape="rect"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="1203,1045,1417,1086"/>
<areashape="rect"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="1229,1111,1391,1137"/>
<areashape="rect"href="classoperations__research_1_1_relocate_subtrip.html"title="Tries to move subtrips after an insertion node."alt=""coords="1247,1212,1373,1239"/>
<areashape="rect"href="classoperations__research_1_1_assignment.html"title="An Assignment is a variable -> domains mapping, used to report solutions to the user."alt=""coords="443,756,541,783"/>
<areashape="rect"href="classoperations__research_1_1_constraint.html"title="A constraint is the main modeling object."alt=""coords="447,807,537,833"/>
<areashape="rect"href="classoperations__research_1_1_int_expr.html"title="The class IntExpr is the base of all integer expressions in constraint programming."alt=""coords="458,857,526,884"/>
<areashape="rect"href="classoperations__research_1_1_interval_var.html"title="Interval variables are often used in scheduling."alt=""coords="445,908,539,935"/>
<areashape="rect"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="439,959,545,985"/>
<areashape="rect"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="707,687,826,713"/>
<areashape="rect"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="655,788,879,815"/>
<areashape="rect"href="classoperations__research_1_1_type_regulations_constraint.html"title="The following constraint ensures that incompatibilities and requirements between types are respected."alt=""coords="669,889,865,916"/>
<areashape="rect"href="classoperations__research_1_1_search_limit.html"title="Base class of all search limits."alt=""coords="443,1161,541,1188"/>
<areashape="rect"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="447,1212,537,1239"/>
<areashape="rect"href="classoperations__research_1_1_solution_collector.html"title="This class is the root class of all solution collectors."alt=""coords="425,1263,559,1289"/>
<areashape="rect"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="714,1187,819,1213"/>
<areashape="rect"href="structoperations__research_1_1_default_phase_parameters.html"title="This struct holds all parameters for the default search."alt=""coords="5,5,189,32"/>
<areashape="rect"href="classoperations__research_1_1_disjunctive_propagator.html"title="This class acts like a CP propagator: it takes a set of tasks given by their start/duration/end featu..."alt=""coords="5,5,172,32"/>
<areashape="rect"href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html"title="A structure to hold tasks described by their features."alt=""coords="5,5,172,47"/>
<areashape="rect"href="classoperations__research_1_1_init_and_get_values.html"title="Utility class to encapsulate an IntVarIterator and use it in a range-based loop."alt=""coords="5,5,140,32"/>
<areashape="rect"href="classoperations__research_1_1_model_cache.html"title="Implements a complete cache for model elements: expressions and constraints."alt=""coords="5,5,108,32"/>
<areashape="rect"href="structoperations__research_1_1_path_operator_1_1_iteration_parameters.html"title="Set of parameters used to configure how the neighnorhood is traversed."alt=""coords="5,5,252,32"/>
<areashape="rect"href="classoperations__research_1_1_rev.html"title="This class adds reversibility to a POD type."alt=""coords="5,5,91,32"/>
<areashape="rect"href="classoperations__research_1_1_numerical_rev.html"title="Subclass of Rev<T> which adds numerical operations."alt=""coords="139,5,291,32"/>
<areashape="rect"href="classoperations__research_1_1_rev_array.html"title="Reversible array of POD types."alt=""coords="5,5,125,32"/>
<areashape="rect"href="classoperations__research_1_1_numerical_rev_array.html"title="Subclass of RevArray<T> which adds numerical operations."alt=""coords="173,5,360,32"/>
<areashape="rect"href="classoperations__research_1_1_rev_growing_array.html"title="This class is a reversible growing array."alt=""coords="5,5,196,32"/>
<areashape="rect"href="classoperations__research_1_1_rev_int_set.html"title="This is a special class to represent a 'residual' set of T."alt=""coords="5,5,128,32"/>
<areashape="rect"href="classoperations__research_1_1_rev_switch.html"title="A reversible switch that can switch once from false to true."alt=""coords="5,5,96,32"/>
<areashape="rect"href="classoperations__research_1_1_routing_dimension.html"title="Dimensions represent quantities accumulated at nodes along the routes."alt=""coords="5,5,148,32"/>
<areashape="rect"href="classoperations__research_1_1_routing_index_manager.html"title="Manager for any NodeIndex <-> variable index conversion."alt=""coords="5,5,171,32"/>
<areashape="rect"href="structoperations__research_1_1_routing_model_1_1_cost_class_1_1_dimension_cost.html"title="SUBTLE: The vehicle's fixed cost is skipped on purpose here, because we can afford to do so:"alt=""coords="5,5,189,47"/>
<areashape="rect"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."alt=""coords="5,5,224,32"/>
<areashape="rect"href="classoperations__research_1_1_routing_model_1_1_resource_group_1_1_attributes.html"title="Attributes for a dimension."alt=""coords="5,5,224,47"/>
<areashape="rect"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."alt=""coords="5,5,224,47"/>
<areashape="rect"href="structoperations__research_1_1_routing_model_1_1_state_dependent_transit.html"title="What follows is relevant for models with time/state dependent transits."alt=""coords="5,5,231,47"/>
<areashape="rect"href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html"title="Struct used to sort and store vehicles by their type."alt=""coords="5,5,204,47"/>
<areashape="rect"href="classoperations__research_1_1_simple_bound_costs.html"title="A structure meant to store soft bounds and associated violation constants."alt=""coords="5,5,149,32"/>
<areashape="rect"href="classoperations__research_1_1_simple_rev_f_i_f_o.html"title="This class represent a reversible FIFO structure."alt=""coords="5,5,165,32"/>
<areashape="rect"href="classoperations__research_1_1_simple_rev_f_i_f_o_1_1_iterator.html"title="This iterator is not stable with respect to deletion."alt=""coords="5,5,165,47"/>
<areashape="rect"href="classoperations__research_1_1_small_rev_bit_set.html"title="This class represents a small reversible bitset (size <= 64)."alt=""coords="5,5,128,32"/>
<areashape="rect"href="structoperations__research_1_1_solver_1_1_integer_cast_info.html"title="Holds semantic information stating that the 'expression' has been cast into 'variable' using the Var(..."alt=""coords="5,5,176,32"/>
<areashape="rect"href="structoperations__research_1_1_solver_1_1_search_log_parameters.html"title="Creates a search monitor from logging parameters."alt=""coords="5,5,219,32"/>
<areashape="rect"href="classoperations__research_1_1_type_incompatibility_checker.html"title="Checker for type incompatibilities."alt=""coords="235,5,437,32"/>
<areashape="rect"href="classoperations__research_1_1_type_requirement_checker.html"title="Checker for type requirements."alt=""coords="242,56,430,83"/>
<areashape="rect"href="classoperations__research_1_1_unsorted_nullable_rev_bitset.html"title="This class represents a reversible bitset."alt=""coords="5,5,204,32"/>
