Skip to content

Q
qgroundcontrol
Switch branch/tag
Find file
Normal viewHistoryPermalink
annotated.html 72.4 KB
Newer Older
Valentin Platzgummer's avatar
temp
29514d84
 
Valentin Platzgummer committed
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
    <head>
        <title>OR-Tools</title>
        <meta http-equiv="Content-Type" content="text/html;"/>
        <meta charset="utf-8"/>
        <!--<link rel='stylesheet' type='text/css' href="https://fonts.googleapis.com/css?family=Ubuntu:400,700,400italic"/>-->
        <script type="text/javascript" src="jquery.js"></script>
        <script type="text/javascript" src="dynsections.js"></script>
        <link href="doxygen.css" rel="stylesheet" type="text/css" />
        <link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
    </head>
    <body>
        <div id="banner-container">
            <div id="banner">
                <span id="sfml">Google OR-Tools 8.1</span>
            </div>
        </div>
        <div id="content" style="width: 100%; overflow: hidden;">
        <div style="margin-left: 15px; margin-top: 5px; float: left; color: #145A32;">
        <h2>C++ Reference</h2>
        <ul>
          <li><a href="../cpp_algorithms/annotated.html">Algorithms</a></li>
          <li><a href="../cpp_sat/annotated.html">CP-SAT</a></li>
          <li><a href="../cpp_graph/annotated.html">Graph</a></li>
          <li><a href="../cpp_routing/annotated.html">Routing</a></li>
          <li><a href="../cpp_linear/annotated.html">Linear solver</a></li>
        </ul>
        </div>
        <div id="content">
            <div align="center">
                <h1 style="color: #145A32;">C++ Reference: Routing</h1>
            </div>
<!-- Generated by Doxygen 1.8.20 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
  initMenu('',true,false,'search.php','Search');
  $(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('annotated.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">Class List</div>  </div>
</div><!--header-->
<div class="contents">
<div class="textblock">Here are the classes, structs, unions and interfaces with brief descriptions:</div><div class="directory">
<div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span><span onclick="javascript:toggleLevel(3);">3</span><span onclick="javascript:toggleLevel(4);">4</span>]</div><table class="directory">
<tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespaceoperations__research.html" target="_self">operations_research</a></td><td class="desc">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from the Traveling Salesman Problem to more complex problems such as the Capacitated Vehicle Routing Problem with Time Windows </td></tr>
<tr id="row_0_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_argument_holder.html" target="_self">ArgumentHolder</a></td><td class="desc">Argument Holder: useful when visiting a model </td></tr>
<tr id="row_0_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_array_with_offset.html" target="_self">ArrayWithOffset</a></td><td class="desc"></td></tr>
<tr id="row_0_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_assignment.html" target="_self">Assignment</a></td><td class="desc">An <a class="el" href="classoperations__research_1_1_assignment.html" title="An Assignment is a variable -&gt; domains mapping, used to report solutions to the user.">Assignment</a> is a variable -&gt; domains mapping, used to report solutions to the user </td></tr>
<tr id="row_0_3_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_assignment_container.html" target="_self">AssignmentContainer</a></td><td class="desc"></td></tr>
<tr id="row_0_4_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_assignment_element.html" target="_self">AssignmentElement</a></td><td class="desc"></td></tr>
<tr id="row_0_5_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_base_int_expr.html" target="_self">BaseIntExpr</a></td><td class="desc">This is the base class for all expressions that are not variables </td></tr>
<tr id="row_0_6_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_base_lns.html" target="_self">BaseLns</a></td><td class="desc">This is the base class for building an Lns operator </td></tr>
<tr id="row_0_7_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_base_object.html" target="_self">BaseObject</a></td><td class="desc">A <a class="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>
<tr id="row_0_8_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_base_path_filter.html" target="_self">BasePathFilter</a></td><td class="desc">Generic path-based filter class </td></tr>
<tr id="row_0_9_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_boolean_var.html" target="_self">BooleanVar</a></td><td class="desc"></td></tr>
<tr id="row_0_10_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_call_method0.html" target="_self">CallMethod0</a></td><td class="desc"><a class="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>
<tr id="row_0_11_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_call_method1.html" target="_self">CallMethod1</a></td><td class="desc"><a class="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>
<tr id="row_0_12_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_call_method2.html" target="_self">CallMethod2</a></td><td class="desc"><a class="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>
<tr id="row_0_13_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_call_method3.html" target="_self">CallMethod3</a></td><td class="desc"><a class="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>
<tr id="row_0_14_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_cast_constraint.html" target="_self">CastConstraint</a></td><td class="desc">Cast constraints are special channeling constraints designed to keep a variable in sync with an expression </td></tr>
<tr id="row_0_15_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_change_value.html" target="_self">ChangeValue</a></td><td class="desc">Defines operators which change the value of variables; each neighbor corresponds to <em>one</em> modified variable </td></tr>
<tr id="row_0_16_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html" target="_self">CheapestAdditionFilteredHeuristic</a></td><td class="desc">Filtered-base decision builder based on the addition heuristic, extending a path from its start node with the cheapest arc </td></tr>
<tr id="row_0_17_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_17_" class="arrow" onclick="toggleFolder('0_17_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html" target="_self">CheapestInsertionFilteredHeuristic</a></td><td class="desc"></td></tr>
<tr id="row_0_17_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html" target="_self">StartEndValue</a></td><td class="desc"></td></tr>
<tr id="row_0_18_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_christofides_filtered_heuristic.html" target="_self">ChristofidesFilteredHeuristic</a></td><td class="desc">Christofides addition heuristic </td></tr>
<tr id="row_0_19_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html" target="_self">ComparatorCheapestAdditionFilteredHeuristic</a></td><td class="desc">A <a class="el" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html" title="Filtered-base decision builder based on the addition heuristic, extending a path from its start node ...">CheapestAdditionFilteredHeuristic</a> where the notion of 'cheapest arc' comes from an arc comparator </td></tr>
<tr id="row_0_20_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_constraint.html" target="_self">Constraint</a></td><td class="desc">A constraint is the main modeling object </td></tr>
<tr id="row_0_21_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_c_p_feasibility_filter.html" target="_self">CPFeasibilityFilter</a></td><td class="desc">This filter accepts deltas for which the assignment satisfies the constraints of the <a class="el" href="classoperations__research_1_1_solver.html" title="Solver Class.">Solver</a> </td></tr>
<tr id="row_0_22_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_cumul_bounds_propagator.html" target="_self">CumulBoundsPropagator</a></td><td class="desc"></td></tr>
<tr id="row_0_23_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_decision.html" target="_self">Decision</a></td><td class="desc">A <a class="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>
<tr id="row_0_24_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_decision_builder.html" target="_self">DecisionBuilder</a></td><td class="desc">A <a class="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>
<tr id="row_0_25_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_decision_visitor.html" target="_self">DecisionVisitor</a></td><td class="desc">A <a class="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>
<tr id="row_0_26_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_default_phase_parameters.html" target="_self">DefaultPhaseParameters</a></td><td class="desc">This struct holds all parameters for the default search </td></tr>
<tr id="row_0_27_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_delayed_call_method0.html" target="_self">DelayedCallMethod0</a></td><td class="desc">Low-priority demon proxy to a method on the constraint with no arguments </td></tr>
<tr id="row_0_28_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_delayed_call_method1.html" target="_self">DelayedCallMethod1</a></td><td class="desc">Low-priority demon proxy to a method on the constraint with one argument </td></tr>
<tr id="row_0_29_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_delayed_call_method2.html" target="_self">DelayedCallMethod2</a></td><td class="desc">Low-priority demon proxy to a method on the constraint with two arguments </td></tr>
<tr id="row_0_30_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_demon.html" target="_self">Demon</a></td><td class="desc">A <a class="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>
<tr id="row_0_31_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html" target="_self">DimensionCumulOptimizerCore</a></td><td class="desc"></td></tr>
<tr id="row_0_32_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_disjunctive_constraint.html" target="_self">DisjunctiveConstraint</a></td><td class="desc"></td></tr>
<tr id="row_0_33_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_33_" class="arrow" onclick="toggleFolder('0_33_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_disjunctive_propagator.html" target="_self">DisjunctivePropagator</a></td><td class="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>
<tr id="row_0_33_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html" target="_self">Tasks</a></td><td class="desc">A structure to hold tasks described by their features </td></tr>
<tr id="row_0_34_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html" target="_self">EvaluatorCheapestAdditionFilteredHeuristic</a></td><td class="desc">A <a class="el" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html" title="Filtered-base decision builder based on the addition heuristic, extending a path from its start node ...">CheapestAdditionFilteredHeuristic</a> where the notion of 'cheapest arc' comes from an arc evaluator </td></tr>
<tr id="row_0_35_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_exchange_subtrip.html" target="_self">ExchangeSubtrip</a></td><td class="desc"></td></tr>
<tr id="row_0_36_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_filtered_heuristic_close_nodes_l_n_s_operator.html" target="_self">FilteredHeuristicCloseNodesLNSOperator</a></td><td class="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>
<tr id="row_0_37_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_filtered_heuristic_expensive_chain_l_n_s_operator.html" target="_self">FilteredHeuristicExpensiveChainLNSOperator</a></td><td class="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>
<tr id="row_0_38_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html" target="_self">FilteredHeuristicLocalSearchOperator</a></td><td class="desc">Class of operators using a <a class="el" href="classoperations__research_1_1_routing_filtered_heuristic.html" title="Filter-based heuristic dedicated to routing.">RoutingFilteredHeuristic</a> to insert unperformed nodes after changes have been made to the current solution </td></tr>
<tr id="row_0_39_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_filtered_heuristic_path_l_n_s_operator.html" target="_self">FilteredHeuristicPathLNSOperator</a></td><td class="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>
<tr id="row_0_40_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_40_" class="arrow" onclick="toggleFolder('0_40_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html" target="_self">GlobalCheapestInsertionFilteredHeuristic</a></td><td class="desc">Filter-based decision builder which builds a solution by inserting nodes at their cheapest position on any route; potentially several routes can be built in parallel </td></tr>
<tr id="row_0_40_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html" target="_self">GlobalCheapestInsertionParameters</a></td><td class="desc"></td></tr>
<tr id="row_0_41_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html" target="_self">GlobalDimensionCumulOptimizer</a></td><td class="desc"></td></tr>
<tr id="row_0_42_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_global_vehicle_breaks_constraint.html" target="_self">GlobalVehicleBreaksConstraint</a></td><td class="desc"><a class="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>
<tr id="row_0_43_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_improvement_search_limit.html" target="_self">ImprovementSearchLimit</a></td><td class="desc"></td></tr>
<tr id="row_0_44_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_index_pair_swap_active_operator.html" target="_self">IndexPairSwapActiveOperator</a></td><td class="desc">Operator which inserts inactive nodes into a path and makes a pair of active nodes inactive </td></tr>
<tr id="row_0_45_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_45_" class="arrow" onclick="toggleFolder('0_45_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_init_and_get_values.html" target="_self">InitAndGetValues</a></td><td class="desc">Utility class to encapsulate an <a class="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>
<tr id="row_0_45_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_init_and_get_values_1_1_iterator.html" target="_self">Iterator</a></td><td class="desc"></td></tr>
<tr id="row_0_46_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_interval_var.html" target="_self">IntervalVar</a></td><td class="desc">Interval variables are often used in scheduling </td></tr>
<tr id="row_0_47_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_interval_var_element.html" target="_self">IntervalVarElement</a></td><td class="desc"></td></tr>
<tr id="row_0_48_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_int_expr.html" target="_self">IntExpr</a></td><td class="desc">The class <a class="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>
<tr id="row_0_49_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_int_var.html" target="_self">IntVar</a></td><td class="desc">The class <a class="el" href="classoperations__research_1_1_int_var.html" title="The class IntVar is a subset of IntExpr.">IntVar</a> is a subset of <a class="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>
<tr id="row_0_50_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_int_var_element.html" target="_self">IntVarElement</a></td><td class="desc"></td></tr>
<tr id="row_0_51_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_int_var_filtered_decision_builder.html" target="_self">IntVarFilteredDecisionBuilder</a></td><td class="desc"><a class="el" href="classoperations__research_1_1_decision.html" title="A Decision represents a choice point in the search tree.">Decision</a> builder building a solution using heuristics with local search filters to evaluate its feasibility </td></tr>
<tr id="row_0_52_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_int_var_filtered_heuristic.html" target="_self">IntVarFilteredHeuristic</a></td><td class="desc">Generic filter-based heuristic applied to IntVars </td></tr>
<tr id="row_0_53_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_int_var_iterator.html" target="_self">IntVarIterator</a></td><td class="desc">The class Iterator has two direct subclasses </td></tr>
<tr id="row_0_54_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_int_var_local_search_filter.html" target="_self">IntVarLocalSearchFilter</a></td><td class="desc"></td></tr>
<tr id="row_0_55_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_int_var_local_search_handler.html" target="_self">IntVarLocalSearchHandler</a></td><td class="desc"></td></tr>
<tr id="row_0_56_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_int_var_local_search_operator.html" target="_self">IntVarLocalSearchOperator</a></td><td class="desc">Specialization of <a class="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>
<tr id="row_0_57_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_light_pair_relocate_operator.html" target="_self">LightPairRelocateOperator</a></td><td class="desc"></td></tr>
<tr id="row_0_58_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html" target="_self">LocalCheapestInsertionFilteredHeuristic</a></td><td class="desc">Filter-base decision builder which builds a solution by inserting nodes at their cheapest position </td></tr>
<tr id="row_0_59_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html" target="_self">LocalDimensionCumulOptimizer</a></td><td class="desc"></td></tr>
<tr id="row_0_60_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_local_search_filter.html" target="_self">LocalSearchFilter</a></td><td class="desc">Local Search Filters are used for fast neighbor pruning </td></tr>
<tr id="row_0_61_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_61_" class="arrow" onclick="toggleFolder('0_61_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_local_search_filter_manager.html" target="_self">LocalSearchFilterManager</a></td><td class="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>
<tr id="row_0_61_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_local_search_filter_manager_1_1_filter_event.html" target="_self">FilterEvent</a></td><td class="desc"></td></tr>
<tr id="row_0_62_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_local_search_monitor.html" target="_self">LocalSearchMonitor</a></td><td class="desc"></td></tr>
<tr id="row_0_63_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_local_search_operator.html" target="_self">LocalSearchOperator</a></td><td class="desc">The base class for all local search operators </td></tr>
<tr id="row_0_64_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_local_search_state.html" target="_self">LocalSearchState</a></td><td class="desc"></td></tr>
<tr id="row_0_65_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_local_search_variable.html" target="_self">LocalSearchVariable</a></td><td class="desc"></td></tr>
<tr id="row_0_66_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_make_pair_active_operator.html" target="_self">MakePairActiveOperator</a></td><td class="desc">Pair-based neighborhood operators, designed to move nodes by pairs (pairs are static and given) </td></tr>
<tr id="row_0_67_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_make_pair_inactive_operator.html" target="_self">MakePairInactiveOperator</a></td><td class="desc">Operator which makes pairs of active nodes inactive </td></tr>
<tr id="row_0_68_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_make_relocate_neighbors_operator.html" target="_self">MakeRelocateNeighborsOperator</a></td><td class="desc">Relocate neighborhood which moves chains of neighbors </td></tr>
<tr id="row_0_69_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_model_cache.html" target="_self">ModelCache</a></td><td class="desc">Implements a complete cache for model elements: expressions and constraints </td></tr>
<tr id="row_0_70_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_model_parser.html" target="_self">ModelParser</a></td><td class="desc">Model Parser </td></tr>
<tr id="row_0_71_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_model_visitor.html" target="_self">ModelVisitor</a></td><td class="desc">Model visitor </td></tr>
<tr id="row_0_72_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_numerical_rev.html" target="_self">NumericalRev</a></td><td class="desc">Subclass of Rev&lt;T&gt; which adds numerical operations </td></tr>
<tr id="row_0_73_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_numerical_rev_array.html" target="_self">NumericalRevArray</a></td><td class="desc">Subclass of RevArray&lt;T&gt; which adds numerical operations </td></tr>
<tr id="row_0_74_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_optimize_var.html" target="_self">OptimizeVar</a></td><td class="desc">This class encapsulates an objective </td></tr>
<tr id="row_0_75_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_pack.html" target="_self">Pack</a></td><td class="desc"></td></tr>
<tr id="row_0_76_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_pair_exchange_operator.html" target="_self">PairExchangeOperator</a></td><td class="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>
<tr id="row_0_77_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_pair_exchange_relocate_operator.html" target="_self">PairExchangeRelocateOperator</a></td><td class="desc">Operator which exchanges the paths of two pairs (path have to be different) </td></tr>
<tr id="row_0_78_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_pair_node_swap_active_operator.html" target="_self">PairNodeSwapActiveOperator</a></td><td class="desc">Operator which inserts pairs of inactive nodes into a path and makes an active node inactive </td></tr>
<tr id="row_0_79_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_pair_relocate_operator.html" target="_self">PairRelocateOperator</a></td><td class="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>
<tr id="row_0_80_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_parallel_savings_filtered_heuristic.html" target="_self">ParallelSavingsFilteredHeuristic</a></td><td class="desc"></td></tr>
<tr id="row_0_81_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_path_operator.html" target="_self">PathOperator</a></td><td class="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>
<tr id="row_0_82_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_82_" class="arrow" onclick="toggleFolder('0_82_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_path_state.html" target="_self">PathState</a></td><td class="desc"></td></tr>
<tr id="row_0_82_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_0_82_0_" class="arrow" onclick="toggleFolder('0_82_0_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_path_state_1_1_chain.html" target="_self">Chain</a></td><td class="desc"></td></tr>
<tr id="row_0_82_0_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_path_state_1_1_chain_1_1_iterator.html" target="_self">Iterator</a></td><td class="desc"></td></tr>
<tr id="row_0_82_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_0_82_1_" class="arrow" onclick="toggleFolder('0_82_1_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_path_state_1_1_chain_range.html" target="_self">ChainRange</a></td><td class="desc"></td></tr>
<tr id="row_0_82_1_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_path_state_1_1_chain_range_1_1_iterator.html" target="_self">Iterator</a></td><td class="desc"></td></tr>
<tr id="row_0_82_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_0_82_2_" class="arrow" onclick="toggleFolder('0_82_2_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_path_state_1_1_node_range.html" target="_self">NodeRange</a></td><td class="desc"></td></tr>
<tr id="row_0_82_2_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_path_state_1_1_node_range_1_1_iterator.html" target="_self">Iterator</a></td><td class="desc"></td></tr>
<tr id="row_0_83_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_propagation_base_object.html" target="_self">PropagationBaseObject</a></td><td class="desc">NOLINT </td></tr>
<tr id="row_0_84_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_propagation_monitor.html" target="_self">PropagationMonitor</a></td><td class="desc"></td></tr>
<tr id="row_0_85_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_p_r_o_t_o_b_u_f___f_i_n_a_l.html" target="_self">PROTOBUF_FINAL</a></td><td class="desc"></td></tr>
<tr id="row_0_86_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_regular_limit.html" target="_self">RegularLimit</a></td><td class="desc">Usual limit based on wall_time, number of explored branches and number of failures in the search tree </td></tr>
<tr id="row_0_87_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_relocate_expensive_chain.html" target="_self">RelocateExpensiveChain</a></td><td class="desc"><a class="el" href="classoperations__research_1_1_relocate_expensive_chain.html" title="RelocateExpensiveChain.">RelocateExpensiveChain</a> </td></tr>
<tr id="row_0_88_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_relocate_path_and_heuristic_insert_unperformed_operator.html" target="_self">RelocatePathAndHeuristicInsertUnperformedOperator</a></td><td class="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>
<tr id="row_0_89_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_relocate_subtrip.html" target="_self">RelocateSubtrip</a></td><td class="desc">Tries to move subtrips after an insertion node </td></tr>
<tr id="row_0_90_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_rev.html" target="_self">Rev</a></td><td class="desc">This class adds reversibility to a POD type </td></tr>
<tr id="row_0_91_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_rev_array.html" target="_self">RevArray</a></td><td class="desc">Reversible array of POD types </td></tr>
<tr id="row_0_92_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_rev_bit_matrix.html" target="_self">RevBitMatrix</a></td><td class="desc">Matrix version of the <a class="el" href="classoperations__research_1_1_rev_bit_set.html" title="This class represents a reversible bitset.">RevBitSet</a> class </td></tr>
<tr id="row_0_93_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_rev_bit_set.html" target="_self">RevBitSet</a></td><td class="desc">This class represents a reversible bitset </td></tr>
<tr id="row_0_94_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_rev_growing_array.html" target="_self">RevGrowingArray</a></td><td class="desc">This class is a reversible growing array </td></tr>
<tr id="row_0_95_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_rev_immutable_multi_map.html" target="_self">RevImmutableMultiMap</a></td><td class="desc">Reversible Immutable MultiMap class </td></tr>
<tr id="row_0_96_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_rev_int_set.html" target="_self">RevIntSet</a></td><td class="desc">This is a special class to represent a 'residual' set of T </td></tr>
<tr id="row_0_97_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_rev_partial_sequence.html" target="_self">RevPartialSequence</a></td><td class="desc">--&mdash; <a class="el" href="classoperations__research_1_1_rev_partial_sequence.html" title="--— RevPartialSequence --—">RevPartialSequence</a> --&mdash; </td></tr>
<tr id="row_0_98_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_rev_switch.html" target="_self">RevSwitch</a></td><td class="desc">A reversible switch that can switch once from false to true </td></tr>
<tr id="row_0_99_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html" target="_self">RoutingCPSatWrapper</a></td><td class="desc"></td></tr>
<tr id="row_0_100_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_100_" class="arrow" onclick="toggleFolder('0_100_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_routing_dimension.html" target="_self">RoutingDimension</a></td><td class="desc">Dimensions represent quantities accumulated at nodes along the routes </td></tr>
<tr id="row_0_100_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_routing_dimension_1_1_node_precedence.html" target="_self">NodePrecedence</a></td><td class="desc"></td></tr>
<tr id="row_0_101_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_routing_filtered_heuristic.html" target="_self">RoutingFilteredHeuristic</a></td><td class="desc">Filter-based heuristic dedicated to routing </td></tr>
<tr id="row_0_102_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_routing_glop_wrapper.html" target="_self">RoutingGlopWrapper</a></td><td class="desc"></td></tr>
<tr id="row_0_103_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_routing_index_manager.html" target="_self">RoutingIndexManager</a></td><td class="desc">Manager for any NodeIndex &lt;-&gt; variable index conversion </td></tr>
<tr id="row_0_104_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_routing_linear_solver_wrapper.html" target="_self">RoutingLinearSolverWrapper</a></td><td class="desc"></td></tr>
<tr id="row_0_105_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_105_" class="arrow" onclick="toggleFolder('0_105_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_routing_model.html" target="_self">RoutingModel</a></td><td class="desc"></td></tr>
<tr id="row_0_105_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_0_105_0_" class="arrow" onclick="toggleFolder('0_105_0_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_routing_model_1_1_cost_class.html" target="_self">CostClass</a></td><td class="desc"></td></tr>
<tr id="row_0_105_0_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_routing_model_1_1_cost_class_1_1_dimension_cost.html" target="_self">DimensionCost</a></td><td class="desc">SUBTLE: The vehicle's fixed cost is skipped on purpose here, because we can afford to do so: </td></tr>
<tr id="row_0_105_1_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_routing_model_1_1_state_dependent_transit.html" target="_self">StateDependentTransit</a></td><td class="desc">What follows is relevant for models with time/state dependent transits </td></tr>
<tr id="row_0_105_2_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_routing_model_1_1_vehicle_class.html" target="_self">VehicleClass</a></td><td class="desc"></td></tr>
<tr id="row_0_105_3_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_0_105_3_" class="arrow" onclick="toggleFolder('0_105_3_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html" target="_self">VehicleTypeContainer</a></td><td class="desc">Struct used to sort and store vehicles by their type </td></tr>
<tr id="row_0_105_3_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container_1_1_vehicle_class_entry.html" target="_self">VehicleClassEntry</a></td><td class="desc"></td></tr>
<tr id="row_0_106_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_routing_model_visitor.html" target="_self">RoutingModelVisitor</a></td><td class="desc">Routing model visitor </td></tr>
<tr id="row_0_107_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_107_" class="arrow" onclick="toggleFolder('0_107_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_savings_filtered_heuristic.html" target="_self">SavingsFilteredHeuristic</a></td><td class="desc">Filter-based decision builder which builds a solution by using Clarke &amp; Wright's Savings heuristic </td></tr>
<tr id="row_0_107_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html" target="_self">SavingsContainer</a></td><td class="desc"></td></tr>
<tr id="row_0_107_1_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html" target="_self">SavingsParameters</a></td><td class="desc"></td></tr>
<tr id="row_0_108_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_search_limit.html" target="_self">SearchLimit</a></td><td class="desc">Base class of all search limits </td></tr>
<tr id="row_0_109_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_search_log.html" target="_self">SearchLog</a></td><td class="desc">The base class of all search logs that periodically outputs information when the search is running </td></tr>
<tr id="row_0_110_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_search_monitor.html" target="_self">SearchMonitor</a></td><td class="desc">A search monitor is a simple set of callbacks to monitor all search events </td></tr>
<tr id="row_0_111_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_sequence_var.html" target="_self">SequenceVar</a></td><td class="desc">A sequence variable is a variable whose domain is a set of possible orderings of the interval variables </td></tr>
<tr id="row_0_112_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_sequence_var_element.html" target="_self">SequenceVarElement</a></td><td class="desc">The <a class="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>
<tr id="row_0_113_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_sequence_var_local_search_handler.html" target="_self">SequenceVarLocalSearchHandler</a></td><td class="desc"></td></tr>
<tr id="row_0_114_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_sequence_var_local_search_operator.html" target="_self">SequenceVarLocalSearchOperator</a></td><td class="desc"></td></tr>
<tr id="row_0_115_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_sequential_savings_filtered_heuristic.html" target="_self">SequentialSavingsFilteredHeuristic</a></td><td class="desc"></td></tr>
<tr id="row_0_116_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_116_" class="arrow" onclick="toggleFolder('0_116_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_simple_bound_costs.html" target="_self">SimpleBoundCosts</a></td><td class="desc">A structure meant to store soft bounds and associated violation constants </td></tr>
<tr id="row_0_116_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_simple_bound_costs_1_1_bound_cost.html" target="_self">BoundCost</a></td><td class="desc"></td></tr>
<tr id="row_0_117_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_117_" class="arrow" onclick="toggleFolder('0_117_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_simple_rev_f_i_f_o.html" target="_self">SimpleRevFIFO</a></td><td class="desc">This class represent a reversible FIFO structure </td></tr>
<tr id="row_0_117_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_simple_rev_f_i_f_o_1_1_iterator.html" target="_self">Iterator</a></td><td class="desc">This iterator is not stable with respect to deletion </td></tr>
<tr id="row_0_118_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_small_rev_bit_set.html" target="_self">SmallRevBitSet</a></td><td class="desc">This class represents a small reversible bitset (size &lt;= 64) </td></tr>
<tr id="row_0_119_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_119_" class="arrow" onclick="toggleFolder('0_119_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_solution_collector.html" target="_self">SolutionCollector</a></td><td class="desc">This class is the root class of all solution collectors </td></tr>
<tr id="row_0_119_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_solution_collector_1_1_solution_data.html" target="_self">SolutionData</a></td><td class="desc"></td></tr>
<tr id="row_0_120_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_solution_pool.html" target="_self">SolutionPool</a></td><td class="desc">This class is used to manage a pool of solutions </td></tr>
<tr id="row_0_121_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_121_" class="arrow" onclick="toggleFolder('0_121_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_solver.html" target="_self">Solver</a></td><td class="desc"><a class="el" href="classoperations__research_1_1_solver.html" title="Solver Class.">Solver</a> Class </td></tr>
<tr id="row_0_121_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_solver_1_1_integer_cast_info.html" target="_self">IntegerCastInfo</a></td><td class="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>
<tr id="row_0_121_1_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_solver_1_1_search_log_parameters.html" target="_self">SearchLogParameters</a></td><td class="desc">Creates a search monitor from logging parameters </td></tr>
<tr id="row_0_122_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_swap_index_pair_operator.html" target="_self">SwapIndexPairOperator</a></td><td class="desc">Operator which iterates through each alternative of a set of pairs </td></tr>
<tr id="row_0_123_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_sweep_arranger.html" target="_self">SweepArranger</a></td><td class="desc">Class to arrange indices by by their distance and their angles from the depot </td></tr>
<tr id="row_0_124_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_symmetry_breaker.html" target="_self">SymmetryBreaker</a></td><td class="desc">A symmetry breaker is an object that will visit a decision and create the 'symmetrical' decision in return </td></tr>
<tr id="row_0_125_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_travel_bounds.html" target="_self">TravelBounds</a></td><td class="desc"></td></tr>
<tr id="row_0_126_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_type_incompatibility_checker.html" target="_self">TypeIncompatibilityChecker</a></td><td class="desc">Checker for type incompatibilities </td></tr>
<tr id="row_0_127_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_127_" class="arrow" onclick="toggleFolder('0_127_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_type_regulations_checker.html" target="_self">TypeRegulationsChecker</a></td><td class="desc"></td></tr>
<tr id="row_0_127_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_type_regulations_checker_1_1_type_policy_occurrence.html" target="_self">TypePolicyOccurrence</a></td><td class="desc"></td></tr>
<tr id="row_0_128_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_type_regulations_constraint.html" target="_self">TypeRegulationsConstraint</a></td><td class="desc">The following constraint ensures that incompatibilities and requirements between types are respected </td></tr>
<tr id="row_0_129_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_type_requirement_checker.html" target="_self">TypeRequirementChecker</a></td><td class="desc">Checker for type requirements </td></tr>
<tr id="row_0_130_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_130_" class="arrow" onclick="toggleFolder('0_130_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_unary_dimension_checker.html" target="_self">UnaryDimensionChecker</a></td><td class="desc"></td></tr>
<tr id="row_0_130_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1_unary_dimension_checker_1_1_interval.html" target="_self">Interval</a></td><td class="desc"></td></tr>
<tr id="row_0_131_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_unsorted_nullable_rev_bitset.html" target="_self">UnsortedNullableRevBitset</a></td><td class="desc">This class represents a reversible bitset </td></tr>
<tr id="row_0_132_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_var_local_search_operator.html" target="_self">VarLocalSearchOperator</a></td><td class="desc">Base operator class for operators manipulating variables </td></tr>
<tr id="row_0_133_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1_vehicle_type_curator.html" target="_self">VehicleTypeCurator</a></td><td class="desc"></td></tr>
<tr id="row_1_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structis__proto__enum_3_01_1_1operations__research_1_1_constraint_solver_parameters___trail_compression_01_4.html" target="_self">is_proto_enum&lt; ::operations_research::ConstraintSolverParameters_TrailCompression &gt;</a></td><td class="desc"></td></tr>
<tr id="row_2_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structis__proto__enum_3_01_1_1operations__research_1_1_first_solution_strategy___value_01_4.html" target="_self">is_proto_enum&lt; ::operations_research::FirstSolutionStrategy_Value &gt;</a></td><td class="desc"></td></tr>
<tr id="row_3_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structis__proto__enum_3_01_1_1operations__research_1_1_local_search_metaheuristic___value_01_4.html" target="_self">is_proto_enum&lt; ::operations_research::LocalSearchMetaheuristic_Value &gt;</a></td><td class="desc"></td></tr>
<tr id="row_4_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structis__proto__enum_3_01_1_1operations__research_1_1_routing_search_parameters___scheduling_solver_01_4.html" target="_self">is_proto_enum&lt; ::operations_research::RoutingSearchParameters_SchedulingSolver &gt;</a></td><td class="desc"></td></tr>
<tr id="row_5_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="struct_table_struct__ortools__2fconstraint__5fsolver__2fassignment__2eproto.html" target="_self">TableStruct_ortools_2fconstraint_5fsolver_2fassignment_2eproto</a></td><td class="desc"></td></tr>
<tr id="row_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="struct_table_struct__ortools__2fconstraint__5fsolver__2fdemon__5fprofiler__2eproto.html" target="_self">TableStruct_ortools_2fconstraint_5fsolver_2fdemon_5fprofiler_2eproto</a></td><td class="desc"></td></tr>
<tr id="row_7_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="struct_table_struct__ortools__2fconstraint__5fsolver__2frouting__5fenums__2eproto.html" target="_self">TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fenums_2eproto</a></td><td class="desc"></td></tr>
<tr id="row_8_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="struct_table_struct__ortools__2fconstraint__5fsolver__2frouting__5fparameters__2eproto.html" target="_self">TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto</a></td><td class="desc"></td></tr>
<tr id="row_9_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="struct_table_struct__ortools__2fconstraint__5fsolver__2fsearch__5flimit__2eproto.html" target="_self">TableStruct_ortools_2fconstraint_5fsolver_2fsearch_5flimit_2eproto</a></td><td class="desc"></td></tr>
<tr id="row_10_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="struct_table_struct__ortools__2fconstraint__5fsolver__2fsolver__5fparameters__2eproto.html" target="_self">TableStruct_ortools_2fconstraint_5fsolver_2fsolver_5fparameters_2eproto</a></td><td class="desc"></td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->
</div><!-- doc-content -->
        </div>
        </div>
        <div id="footer-container">
            <div id="footer">
            </div>
        </div>
    </body>
</html>