<trid="row_1_0_0_0_0_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Algorithms_1_1KInt64Vector_1_1KInt64VectorEnumerator.html"target="_self">KInt64VectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_0_1_0_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Algorithms_1_1KInt64VectorVector_1_1KInt64VectorVectorEnumerator.html"target="_self">KInt64VectorVectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_1_15_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1ConstraintSolverParameters_1_1Types.html"target="_self">Types</a></td><tdclass="desc">Container for nested types declared in the <aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1ConstraintSolverParameters.html"title="Solver parameters.">ConstraintSolverParameters</a> message type </td></tr>
<trid="row_1_0_1_17_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1CpInt64Vector_1_1CpInt64VectorEnumerator.html"target="_self">CpInt64VectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_1_18_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1CpInt64VectorVector_1_1CpInt64VectorVectorEnumerator.html"target="_self">CpInt64VectorVectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_1_19_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1CpIntVector_1_1CpIntVectorEnumerator.html"target="_self">CpIntVectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_1_20_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1CpIntVectorVector_1_1CpIntVectorVectorEnumerator.html"target="_self">CpIntVectorVectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_1_23_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1DecisionBuilderVector_1_1DecisionBuilderVectorEnumerator.html"target="_self">DecisionBuilderVectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_1_28_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanid="arr_1_0_1_28_"class="arrow"onclick="toggleFolder('1_0_1_28_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1FirstSolutionStrategy.html"target="_self">FirstSolutionStrategy</a></td><tdclass="desc">First solution strategies, used as starting point of local search </td></tr>
<trid="row_1_0_1_28_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1FirstSolutionStrategy_1_1Types.html"target="_self">Types</a></td><tdclass="desc">Container for nested types declared in the <aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1FirstSolutionStrategy.html"title="First solution strategies, used as starting point of local search.">FirstSolutionStrategy</a> message type </td></tr>
<trid="row_1_0_1_35_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1IntervalVarVector_1_1IntervalVarVectorEnumerator.html"target="_self">IntervalVarVectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_1_47_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1IntVarVector_1_1IntVarVectorEnumerator.html"target="_self">IntVarVectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_1_49_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1LocalSearchFilterVector_1_1LocalSearchFilterVectorEnumerator.html"target="_self">LocalSearchFilterVectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_1_50_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanid="arr_1_0_1_50_"class="arrow"onclick="toggleFolder('1_0_1_50_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1LocalSearchMetaheuristic.html"target="_self">LocalSearchMetaheuristic</a></td><tdclass="desc">Local search metaheuristics used to guide the search </td></tr>
<trid="row_1_0_1_50_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1LocalSearchMetaheuristic_1_1Types.html"target="_self">Types</a></td><tdclass="desc">Container for nested types declared in the <aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1LocalSearchMetaheuristic.html"title="Local search metaheuristics used to guide the search.">LocalSearchMetaheuristic</a> message type </td></tr>
<trid="row_1_0_1_53_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1LocalSearchOperatorVector_1_1LocalSearchOperatorVectorEnumerator.html"target="_self">LocalSearchOperatorVectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_1_58_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1NetDecision.html"target="_self">NetDecision</a></td><tdclass="desc">This class acts as a intermediate step between a c++ decision and a .Net one </td></tr>
<trid="row_1_0_1_59_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1NetDecisionBuilder.html"target="_self">NetDecisionBuilder</a></td><tdclass="desc">This class acts as a intermediate step between a c++ decision builder and a .Net one </td></tr>
<trid="row_1_0_1_69_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1RegularLimitParameters.html"target="_self">RegularLimitParameters</a></td><tdclass="desc">A search limit The default values for int64 fields is the maxima value, i.e., 2^63-1 </td></tr>
<trid="row_1_0_1_74_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1RoutingEnumsReflection.html"target="_self">RoutingEnumsReflection</a></td><tdclass="desc">Holder for reflection information generated from ortools/constraint_solver/routing_enums.proto </td></tr>
<trid="row_1_0_1_77_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1RoutingModelParameters.html"target="_self">RoutingModelParameters</a></td><tdclass="desc">Parameters which have to be set when creating a <aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1RoutingModel.html">RoutingModel</a></td></tr>
<trid="row_1_0_1_79_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1RoutingParametersReflection.html"target="_self">RoutingParametersReflection</a></td><tdclass="desc">Holder for reflection information generated from ortools/constraint_solver/routing_parameters.proto </td></tr>
<trid="row_1_0_1_80_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanid="arr_1_0_1_80_"class="arrow"onclick="toggleFolder('1_0_1_80_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1RoutingSearchParameters.html"target="_self">RoutingSearchParameters</a></td><tdclass="desc">Parameters defining the search used to solve vehicle routing problems </td></tr>
<trid="row_1_0_1_80_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanid="arr_1_0_1_80_0_"class="arrow"onclick="toggleFolder('1_0_1_80_0_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1RoutingSearchParameters_1_1Types.html"target="_self">Types</a></td><tdclass="desc">Container for nested types declared in the <aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1RoutingSearchParameters.html"title="Parameters defining the search used to solve vehicle routing problems.">RoutingSearchParameters</a> message type </td></tr>
<trid="row_1_0_1_80_0_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:96px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1RoutingSearchParameters_1_1Types_1_1LocalSearchNeighborhoodOperators.html"target="_self">LocalSearchNeighborhoodOperators</a></td><tdclass="desc">Local search neighborhood operators used to build a solutions neighborhood </td></tr>
<trid="row_1_0_1_82_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1SearchLimitReflection.html"target="_self">SearchLimitReflection</a></td><tdclass="desc">Holder for reflection information generated from ortools/constraint_solver/search_limit.proto </td></tr>
<trid="row_1_0_1_85_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1SearchMonitorVector_1_1SearchMonitorVectorEnumerator.html"target="_self">SearchMonitorVectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_1_90_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1SequenceVarVector_1_1SequenceVarVectorEnumerator.html"target="_self">SequenceVarVectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_1_94_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1SolverParametersReflection.html"target="_self">SolverParametersReflection</a></td><tdclass="desc">Holder for reflection information generated from ortools/constraint_solver/solver_parameters.proto </td></tr>
<trid="row_1_0_1_96_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1ConstraintSolver_1_1SymmetryBreakerVector_1_1SymmetryBreakerVectorEnumerator.html"target="_self">SymmetryBreakerVectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_3_5_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1LinearSolver_1_1MPConstraintVector_1_1MPConstraintVectorEnumerator.html"target="_self">MPConstraintVectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_3_6_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1LinearSolver_1_1MpDoubleVector_1_1MpDoubleVectorEnumerator.html"target="_self">MpDoubleVectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_3_8_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1LinearSolver_1_1MPVariableVector_1_1MPVariableVectorEnumerator.html"target="_self">MPVariableVectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_4_0_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1AllDifferentConstraintProto.html"target="_self">AllDifferentConstraintProto</a></td><tdclass="desc">All variables must take different values </td></tr>
<trid="row_1_0_4_1_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1AutomatonConstraintProto.html"target="_self">AutomatonConstraintProto</a></td><tdclass="desc">This constraint forces a sequence of variables to be accepted by an automaton </td></tr>
<trid="row_1_0_4_2_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1BoolArgumentProto.html"target="_self">BoolArgumentProto</a></td><tdclass="desc">Argument of the constraints of the form OP(literals) </td></tr>
<trid="row_1_0_4_4_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1CircuitConstraintProto.html"target="_self">CircuitConstraintProto</a></td><tdclass="desc">The circuit constraint is defined on a graph where the arc presence are controlled by literals </td></tr>
<trid="row_1_0_4_8_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1CpModel.html"target="_self">CpModel</a></td><tdclass="desc">Wrapper class around the cp_model proto </td></tr>
<trid="row_1_0_4_9_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1CpModelProto.html"target="_self">CpModelProto</a></td><tdclass="desc">A constraint programming problem </td></tr>
<trid="row_1_0_4_10_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1CpModelReflection.html"target="_self">CpModelReflection</a></td><tdclass="desc">Holder for reflection information generated from ortools/sat/cp_model.proto </td></tr>
<trid="row_1_0_4_13_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1CpSolverResponse.html"target="_self">CpSolverResponse</a></td><tdclass="desc">The response returned by a solver trying to solve a <aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1CpModelProto.html"title="A constraint programming problem.">CpModelProto</a></td></tr>
<trid="row_1_0_4_15_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1CumulativeConstraintProto.html"target="_self">CumulativeConstraintProto</a></td><tdclass="desc">The sum of the demands of the intervals at each interval point cannot exceed a capacity </td></tr>
<trid="row_1_0_4_16_"style="display:none;"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanid="arr_1_0_4_16_"class="arrow"onclick="toggleFolder('1_0_4_16_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1DecisionStrategyProto.html"target="_self">DecisionStrategyProto</a></td><tdclass="desc">Define the strategy to follow when the solver needs to take a new decision </td></tr>
<trid="row_1_0_4_16_0_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanid="arr_1_0_4_16_0_"class="arrow"onclick="toggleFolder('1_0_4_16_0_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1DecisionStrategyProto_1_1Types.html"target="_self">Types</a></td><tdclass="desc">Container for nested types declared in the <aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1DecisionStrategyProto.html"title="Define the strategy to follow when the solver needs to take a new decision.">DecisionStrategyProto</a> message type </td></tr>
<trid="row_1_0_4_19_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1IntegerArgumentProto.html"target="_self">IntegerArgumentProto</a></td><tdclass="desc">Argument of the constraints of the form target_var = OP(vars) </td></tr>
<trid="row_1_0_4_21_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1IntervalConstraintProto.html"target="_self">IntervalConstraintProto</a></td><tdclass="desc">This "special" constraint not only enforces (start + size == end) but can also be referred by other constraints using this "interval" concept </td></tr>
<trid="row_1_0_4_25_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1InverseConstraintProto.html"target="_self">InverseConstraintProto</a></td><tdclass="desc">The two arrays of variable each represent a function, the second is the inverse of the first: f_direct[i] == j <=> f_inverse[j] == i </td></tr>
<trid="row_1_0_4_27_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1LinearConstraintProto.html"target="_self">LinearConstraintProto</a></td><tdclass="desc">The linear sum vars[i] * coeffs[i] must fall in the given domain </td></tr>
<trid="row_1_0_4_30_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1NoOverlap2DConstraintProto.html"target="_self">NoOverlap2DConstraintProto</a></td><tdclass="desc">The boxes defined by [start_x, end_x) * [start_y, end_y) cannot overlap </td></tr>
<trid="row_1_0_4_31_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1NoOverlapConstraintProto.html"target="_self">NoOverlapConstraintProto</a></td><tdclass="desc">All the intervals (index of <aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1IntervalConstraintProto.html"title="This "special" constraint not only enforces (start + size == end) but can also be referred by other c...">IntervalConstraintProto</a>) must be disjoint </td></tr>
<trid="row_1_0_4_36_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1PartialVariableAssignment.html"target="_self">PartialVariableAssignment</a></td><tdclass="desc">This message encodes a partial (or full) assignment of the variables of a <aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1CpModelProto.html"title="A constraint programming problem.">CpModelProto</a></td></tr>
<trid="row_1_0_4_38_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1ReservoirConstraintProto.html"target="_self">ReservoirConstraintProto</a></td><tdclass="desc">Maintain a reservoir level within bounds </td></tr>
<trid="row_1_0_4_43_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Sat_1_1TableConstraintProto.html"target="_self">TableConstraintProto</a></td><tdclass="desc">The values of the n-tuple formed by the given variables can only be one of the listed n-tuples in values </td></tr>
<trid="row_1_0_5_3_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Util_1_1OptionalBooleanReflection.html"target="_self">OptionalBooleanReflection</a></td><tdclass="desc">Holder for reflection information generated from ortools/util/optional_boolean.proto </td></tr>
<trid="row_1_0_5_4_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Util_1_1UtilInt64Vector_1_1UtilInt64VectorEnumerator.html"target="_self">UtilInt64VectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_1_0_5_5_0_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classGoogle_1_1OrTools_1_1Util_1_1UtilInt64VectorVector_1_1UtilInt64VectorVectorEnumerator.html"target="_self">UtilInt64VectorVectorEnumerator</a></td><tdclass="desc">Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified </td></tr>
<trid="row_7_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classInitialRoutes.html"target="_self">InitialRoutes</a></td><tdclass="desc">VRP with initial routes </td></tr>
<trid="row_19_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classSimpleCpProgram.html"target="_self">SimpleCpProgram</a></td><tdclass="desc">This is a simple CP program </td></tr>
<trid="row_24_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classSimpleRoutingProgram.html"target="_self">SimpleRoutingProgram</a></td><tdclass="desc">This is a sample using the routing library .Net wrapper </td></tr>
<trid="row_38_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classVrp.html"target="_self">Vrp</a></td><tdclass="desc">Minimal TSP using distance matrix </td></tr>
<trid="row_39_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classVrpCapacity.html"target="_self">VrpCapacity</a></td><tdclass="desc">Minimal TSP using distance matrix </td></tr>
<trid="row_40_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classVrpDropNodes.html"target="_self">VrpDropNodes</a></td><tdclass="desc">Minimal <aclass="el"href="classVrp.html"title="Minimal TSP using distance matrix.">Vrp</a> with drop nodes </td></tr>
<trid="row_41_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classVrpGlobalSpan.html"target="_self">VrpGlobalSpan</a></td><tdclass="desc">Minimal TSP using distance matrix </td></tr>
<trid="row_42_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classVrpPickupDelivery.html"target="_self">VrpPickupDelivery</a></td><tdclass="desc">Minimal Pickup & Delivery Problem (PDP) </td></tr>
<trid="row_43_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classVrpPickupDeliveryFifo.html"target="_self">VrpPickupDeliveryFifo</a></td><tdclass="desc">Minimal Pickup & Delivery Problem (PDP) </td></tr>
<trid="row_44_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classVrpPickupDeliveryLifo.html"target="_self">VrpPickupDeliveryLifo</a></td><tdclass="desc">Minimal Pickup & Delivery Problem (PDP) </td></tr>
<trid="row_45_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classVrpResources.html"target="_self">VrpResources</a></td><tdclass="desc">Vehicles Routing Problem (VRP) with Resource Constraints </td></tr>
<trid="row_46_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classVrpStartsEnds.html"target="_self">VrpStartsEnds</a></td><tdclass="desc">Minimal TSP using distance matrix </td></tr>
<trid="row_47_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classVrpTimeWindows.html"target="_self">VrpTimeWindows</a></td><tdclass="desc">Vehicles Routing Problem (VRP) with Time Windows </td></tr>
