<trid="row_0_0_0_0_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="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType.html"target="_self">SolverType</a></td><tdclass="desc">Enum controlling which underlying algorithm is used </td></tr>
<trid="row_0_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="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1Assignment.html"target="_self">Assignment</a></td><tdclass="desc">An <aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1Assignment.html"title="An Assignment is a variable -> domains mapping, used to report solutions to the user.">Assignment</a> is a variable -> domains mapping, used to report solutions to the user </td></tr>
<trid="row_0_0_0_1_5_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1BaseIntExpr.html"target="_self">BaseIntExpr</a></td><tdclass="desc">This is the base class for all expressions that are not variables </td></tr>
<trid="row_0_0_0_1_6_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1BaseLns.html"target="_self">BaseLns</a></td><tdclass="desc">This is the base class for building an Lns operator </td></tr>
<trid="row_0_0_0_1_7_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1BaseObject.html"target="_self">BaseObject</a></td><tdclass="desc">A <aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1BaseObject.html"title="A BaseObject is the root of all reversibly allocated objects.">BaseObject</a> is the root of all reversibly allocated objects </td></tr>
<trid="row_0_0_0_1_8_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1BasePathFilter.html"target="_self">BasePathFilter</a></td><tdclass="desc">Generic path-based filter class </td></tr>
<trid="row_0_0_0_1_10_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1CastConstraint.html"target="_self">CastConstraint</a></td><tdclass="desc">Cast constraints are special channeling constraints designed to keep a variable in sync with an expression </td></tr>
<trid="row_0_0_0_1_11_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1ChangeValue.html"target="_self">ChangeValue</a></td><tdclass="desc">Defines operators which change the value of variables; each neighbor corresponds to <em>one</em> modified variable </td></tr>
<trid="row_0_0_0_1_12_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1CheapestAdditionFilteredDecisionBuilder.html"target="_self">CheapestAdditionFilteredDecisionBuilder</a></td><tdclass="desc">Filtered-base decision builder based on the addition heuristic, extending a path from its start node with the cheapest arc </td></tr>
<trid="row_0_0_0_1_15_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1ComparatorCheapestAdditionFilteredDecisionBuilder.html"target="_self">ComparatorCheapestAdditionFilteredDecisionBuilder</a></td><tdclass="desc">A <aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1CheapestAdditionFilteredDecisionBuilder.html"title="Filtered-base decision builder based on the addition heuristic, extending a path from its start node ...">CheapestAdditionFilteredDecisionBuilder</a> where the notion of 'cheapest arc' comes from an arc comparator </td></tr>
<trid="row_0_0_0_1_16_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1Constraint.html"target="_self">Constraint</a></td><tdclass="desc">A constraint is the main modeling object </td></tr>
<trid="row_0_0_0_1_19_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1CPFeasibilityFilter.html"target="_self">CPFeasibilityFilter</a></td><tdclass="desc">This filter accepts deltas for which the assignment satisfies the constraints of the <aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1Solver.html"title="Solver Class A solver represents the main computation engine.">Solver</a></td></tr>
<trid="row_0_0_0_1_20_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1Decision.html"target="_self">Decision</a></td><tdclass="desc">A <aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1Decision.html"title="A Decision represents a choice point in the search tree.">Decision</a> represents a choice point in the search tree </td></tr>
<trid="row_0_0_0_1_21_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1DecisionBuilder.html"target="_self">DecisionBuilder</a></td><tdclass="desc">A <aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1DecisionBuilder.html"title="A DecisionBuilder is responsible for creating the search tree.">DecisionBuilder</a> is responsible for creating the search tree </td></tr>
<trid="row_0_0_0_1_22_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1DecisionVisitor.html"target="_self">DecisionVisitor</a></td><tdclass="desc">A <aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1DecisionVisitor.html"title="A DecisionVisitor is used to inspect a decision.">DecisionVisitor</a> is used to inspect a decision </td></tr>
<trid="row_0_0_0_1_23_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1DefaultPhaseParameters.html"target="_self">DefaultPhaseParameters</a></td><tdclass="desc">This struct holds all parameters for the default search </td></tr>
<trid="row_0_0_0_1_24_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1Demon.html"target="_self">Demon</a></td><tdclass="desc">A <aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1Demon.html"title="A Demon is the base element of a propagation queue.">Demon</a> is the base element of a propagation queue </td></tr>
<trid="row_0_0_0_1_26_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1EvaluatorCheapestAdditionFilteredDecisionBuilder.html"target="_self">EvaluatorCheapestAdditionFilteredDecisionBuilder</a></td><tdclass="desc">A <aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1CheapestAdditionFilteredDecisionBuilder.html"title="Filtered-base decision builder based on the addition heuristic, extending a path from its start node ...">CheapestAdditionFilteredDecisionBuilder</a> where the notion of 'cheapest arc' comes from an arc evaluator </td></tr>
<trid="row_0_0_0_1_29_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1GlobalCheapestInsertionFilteredDecisionBuilder.html"target="_self">GlobalCheapestInsertionFilteredDecisionBuilder</a></td><tdclass="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>
<trid="row_0_0_0_1_30_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1GlobalVehicleBreaksConstraint.html"target="_self">GlobalVehicleBreaksConstraint</a></td><tdclass="desc"><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1GlobalVehicleBreaksConstraint.html"title="GlobalVehicleBreaksConstraint ensures breaks constraints are enforced on all vehicles in the dimensio...">GlobalVehicleBreaksConstraint</a> ensures breaks constraints are enforced on all vehicles in the dimension passed to its constructor </td></tr>
<trid="row_0_0_0_1_31_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1IntervalVar.html"target="_self">IntervalVar</a></td><tdclass="desc">Interval variables are often used in scheduling </td></tr>
<trid="row_0_0_0_1_33_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1IntExpr.html"target="_self">IntExpr</a></td><tdclass="desc">The class <aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1IntExpr.html"title="The class IntExpr is the base of all integer expressions in constraint programming.">IntExpr</a> is the base of all integer expressions in constraint programming </td></tr>
<trid="row_0_0_0_1_34_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="interfacecom_1_1google_1_1ortools_1_1constraintsolver_1_1IntIntToLongFunction.html"target="_self">IntIntToLongFunction</a></td><tdclass="desc">Represents a function that accepts two int-valued arguments and produces a long-valued result </td></tr>
<trid="row_0_0_0_1_36_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1IntVar.html"target="_self">IntVar</a></td><tdclass="desc">The class <aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1IntVar.html"title="The class IntVar is a subset of IntExpr.">IntVar</a> is a subset of <aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1IntExpr.html"title="The class IntExpr is the base of all integer expressions in constraint programming.">IntExpr</a></td></tr>
<trid="row_0_0_0_1_38_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1IntVarFilteredDecisionBuilder.html"target="_self">IntVarFilteredDecisionBuilder</a></td><tdclass="desc"><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1Decision.html"title="A Decision represents a choice point in the search tree.">Decision</a> builders building a solution using local search filters to evaluate its feasibility </td></tr>
<trid="row_0_0_0_1_39_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1IntVarIterator.html"target="_self">IntVarIterator</a></td><tdclass="desc">The class Iterator has two direct subclasses </td></tr>
<trid="row_0_0_0_1_41_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1IntVarLocalSearchHandler.html"target="_self">IntVarLocalSearchHandler</a></td><tdclass="desc">Base operator class for operators manipulating IntVars </td></tr>
<trid="row_0_0_0_1_43_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1IntVarLocalSearchOperatorTemplate.html"target="_self">IntVarLocalSearchOperatorTemplate</a></td><tdclass="desc">Base operator class for operators manipulating variables </td></tr>
<trid="row_0_0_0_1_44_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1JavaDecisionBuilder.html"target="_self">JavaDecisionBuilder</a></td><tdclass="desc">This class acts as a intermediate step between a c++ decision builder and a java one </td></tr>
<trid="row_0_0_0_1_45_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1LocalCheapestInsertionFilteredDecisionBuilder.html"target="_self">LocalCheapestInsertionFilteredDecisionBuilder</a></td><tdclass="desc">Filter-base decision builder which builds a solution by inserting nodes at their cheapest position </td></tr>
<trid="row_0_0_0_1_46_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1LocalSearchFilter.html"target="_self">LocalSearchFilter</a></td><tdclass="desc">Local Search Filters are used for fast neighbor pruning </td></tr>
<trid="row_0_0_0_1_50_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1LocalSearchOperator.html"target="_self">LocalSearchOperator</a></td><tdclass="desc">This class represent a reversible FIFO structure </td></tr>
<trid="row_0_0_0_1_52_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="interfacecom_1_1google_1_1ortools_1_1constraintsolver_1_1LongTernaryOperator.html"target="_self">LongTernaryOperator</a></td><tdclass="desc">Represents an operation upon three </td></tr>
<trid="row_0_0_0_1_53_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="interfacecom_1_1google_1_1ortools_1_1constraintsolver_1_1LongTernaryPredicate.html"target="_self">LongTernaryPredicate</a></td><tdclass="desc">Represents a predicate (boolean-valued function) uppon three </td></tr>
<trid="row_0_0_0_1_55_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1ModelCache.html"target="_self">ModelCache</a></td><tdclass="desc">Implements a complete cache for model elements: expressions and constraints </td></tr>
<trid="row_0_0_0_1_57_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1OptimizeVar.html"target="_self">OptimizeVar</a></td><tdclass="desc">This class encapsulates an objective </td></tr>
<trid="row_0_0_0_1_60_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1PathOperator.html"target="_self">PathOperator</a></td><tdclass="desc">Base class of the local search operators dedicated to path modifications (a path is a set of nodes linked together by arcs) </td></tr>
<trid="row_0_0_0_1_61_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1PathWithPreviousNodesOperator.html"target="_self">PathWithPreviousNodesOperator</a></td><tdclass="desc">Simple <aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1PathOperator.html"title="Base class of the local search operators dedicated to path modifications (a path is a set of nodes li...">PathOperator</a> wrapper that also stores the current previous nodes, and is thus able to provide the "Prev" and "IsPathStart" functions </td></tr>
<trid="row_0_0_0_1_62_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1PropagationBaseObject.html"target="_self">PropagationBaseObject</a></td><tdclass="desc">NOLINT The <aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1PropagationBaseObject.html"title="NOLINT The PropagationBaseObject is a subclass of BaseObject that is also friend to the Solver class.">PropagationBaseObject</a> is a subclass of <aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1BaseObject.html"title="A BaseObject is the root of all reversibly allocated objects.">BaseObject</a> that is also friend to the <aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1Solver.html"title="Solver Class A solver represents the main computation engine.">Solver</a> class </td></tr>
<trid="row_0_0_0_1_64_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1RegularLimit.html"target="_self">RegularLimit</a></td><tdclass="desc">Usual limit based on wall_time, number of explored branches and number of failures in the search tree </td></tr>
<trid="row_0_0_0_1_67_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1RevBool.html"target="_self">RevBool</a></td><tdclass="desc">This class adds reversibility to a POD type </td></tr>
<trid="row_0_0_0_1_68_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1RevInteger.html"target="_self">RevInteger</a></td><tdclass="desc">This class adds reversibility to a POD type </td></tr>
<trid="row_0_0_0_1_69_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1RevLong.html"target="_self">RevLong</a></td><tdclass="desc">This class adds reversibility to a POD type </td></tr>
<trid="row_0_0_0_1_71_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1RoutingDimension.html"target="_self">RoutingDimension</a></td><tdclass="desc">Dimensions represent quantities accumulated at nodes along the routes </td></tr>
<trid="row_0_0_0_1_74_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1RoutingIndexManager.html"target="_self">RoutingIndexManager</a></td><tdclass="desc">Manager for any NodeIndex <-> variable index conversion </td></tr>
<trid="row_0_0_0_1_78_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1RoutingModelVisitor.html"target="_self">RoutingModelVisitor</a></td><tdclass="desc">Routing model visitor </td></tr>
<trid="row_0_0_0_1_82_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanid="arr_0_0_0_1_82_"class="arrow"onclick="toggleFolder('0_0_0_1_82_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1SavingsFilteredDecisionBuilder.html"target="_self">SavingsFilteredDecisionBuilder</a></td><tdclass="desc">Filter-based decision builder which builds a solution by using Clarke & Wright's Savings heuristic </td></tr>
<trid="row_0_0_0_1_83_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1SearchLimit.html"target="_self">SearchLimit</a></td><tdclass="desc">Base class of all search limits </td></tr>
<trid="row_0_0_0_1_85_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1SearchLog.html"target="_self">SearchLog</a></td><tdclass="desc">The base class of all search logs that periodically outputs information when the search is running </td></tr>
<trid="row_0_0_0_1_86_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1SearchMonitor.html"target="_self">SearchMonitor</a></td><tdclass="desc">A search monitor is a simple set of callbacks to monitor all search events </td></tr>
<trid="row_0_0_0_1_87_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1SequenceVar.html"target="_self">SequenceVar</a></td><tdclass="desc">A sequence variable is a variable whose domain is a set of possible orderings of the interval variables </td></tr>
<trid="row_0_0_0_1_88_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1SequenceVarElement.html"target="_self">SequenceVarElement</a></td><tdclass="desc">The <aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1SequenceVarElement.html"title="The SequenceVarElement stores a partial representation of ranked interval variables in the underlying...">SequenceVarElement</a> stores a partial representation of ranked interval variables in the underlying sequence variable </td></tr>
<trid="row_0_0_0_1_91_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1SequenceVarLocalSearchOperatorTemplate.html"target="_self">SequenceVarLocalSearchOperatorTemplate</a></td><tdclass="desc">Base operator class for operators manipulating variables </td></tr>
<trid="row_0_0_0_1_93_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1SolutionCollector.html"target="_self">SolutionCollector</a></td><tdclass="desc">This class is the root class of all solution collectors </td></tr>
<trid="row_0_0_0_1_94_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1SolutionPool.html"target="_self">SolutionPool</a></td><tdclass="desc">This class is used to manage a pool of solutions </td></tr>
<trid="row_0_0_0_1_95_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanid="arr_0_0_0_1_95_"class="arrow"onclick="toggleFolder('0_0_0_1_95_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1Solver.html"target="_self">Solver</a></td><tdclass="desc"><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1Solver.html"title="Solver Class A solver represents the main computation engine.">Solver</a> Class A solver represents the main computation engine </td></tr>
<trid="row_0_0_0_1_95_0_"style="display:none;"><tdclass="entry"><spanstyle="width:96px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1Solver_1_1FailException.html"target="_self">FailException</a></td><tdclass="desc">This exceptions signal that a failure has been raised in the C++ world </td></tr>
<trid="row_0_0_0_1_95_1_"style="display:none;"><tdclass="entry"><spanstyle="width:96px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1Solver_1_1IntegerCastInfo.html"target="_self">IntegerCastInfo</a></td><tdclass="desc">Holds semantic information stating that the 'expression' has been cast into 'variable' using the Var() method, and that 'maintainer' is responsible for maintaining the equality between 'variable' and 'expression' </td></tr>
<trid="row_0_0_0_1_97_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1SymmetryBreaker.html"target="_self">SymmetryBreaker</a></td><tdclass="desc">A symmetry breaker is an object that will visit a decision and create the 'symmetrical' decision in return </td></tr>
<trid="row_0_0_0_1_98_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1TypeIncompatibilityChecker.html"target="_self">TypeIncompatibilityChecker</a></td><tdclass="desc">Checker for type incompatibilities </td></tr>
<trid="row_0_0_0_1_100_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1TypeRegulationsConstraint.html"target="_self">TypeRegulationsConstraint</a></td><tdclass="desc">The following constraint ensures that incompatibilities and requirements between types are respected </td></tr>
<trid="row_0_0_0_1_101_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1constraintsolver_1_1TypeRequirementChecker.html"target="_self">TypeRequirementChecker</a></td><tdclass="desc">Checker for type requirements </td></tr>
<trid="row_0_0_0_3_3_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1linearsolver_1_1MPConstraint.html"target="_self">MPConstraint</a></td><tdclass="desc">The class for constraints of a Mathematical Programming (MP) model </td></tr>
<trid="row_0_0_0_3_13_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanid="arr_0_0_0_3_13_"class="arrow"onclick="toggleFolder('0_0_0_3_13_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1linearsolver_1_1MPModelRequest.html"target="_self">MPModelRequest</a></td><tdclass="desc">Protobuf type </td></tr>
<trid="row_0_0_0_3_13_0_"style="display:none;"><tdclass="entry"><spanstyle="width:96px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1linearsolver_1_1MPModelRequest_1_1Builder.html"target="_self">Builder</a></td><tdclass="desc">Protobuf type </td></tr>
<trid="row_0_0_0_3_15_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1linearsolver_1_1MPObjective.html"target="_self">MPObjective</a></td><tdclass="desc">A class to express a linear objective </td></tr>
<trid="row_0_0_0_3_16_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanid="arr_0_0_0_3_16_"class="arrow"onclick="toggleFolder('0_0_0_3_16_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1linearsolver_1_1MPSolutionResponse.html"target="_self">MPSolutionResponse</a></td><tdclass="desc">Protobuf type </td></tr>
<trid="row_0_0_0_3_16_0_"style="display:none;"><tdclass="entry"><spanstyle="width:96px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1linearsolver_1_1MPSolutionResponse_1_1Builder.html"target="_self">Builder</a></td><tdclass="desc">Protobuf type </td></tr>
<trid="row_0_0_0_3_18_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanid="arr_0_0_0_3_18_"class="arrow"onclick="toggleFolder('0_0_0_3_18_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1linearsolver_1_1MPSolver.html"target="_self">MPSolver</a></td><tdclass="desc">This mathematical programming (MP) solver class is the main class<br/>
though which users build and solve problems </td></tr>
<trid="row_0_0_0_3_18_0_"style="display:none;"><tdclass="entry"><spanstyle="width:96px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="enumcom_1_1google_1_1ortools_1_1linearsolver_1_1MPSolver_1_1BasisStatus.html"target="_self">BasisStatus</a></td><tdclass="desc">Advanced usage: possible basis status values for a variable and the slack<br/>
variable of a linear constraint </td></tr>
<trid="row_0_0_0_3_18_1_"style="display:none;"><tdclass="entry"><spanstyle="width:96px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="enumcom_1_1google_1_1ortools_1_1linearsolver_1_1MPSolver_1_1OptimizationProblemType.html"target="_self">OptimizationProblemType</a></td><tdclass="desc">The type of problems (LP or MIP) that will be solved and the underlying<br/>
solver (GLOP, GLPK, CLP, CBC or SCIP) that will solve them </td></tr>
<trid="row_0_0_0_3_18_2_"style="display:none;"><tdclass="entry"><spanstyle="width:96px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="enumcom_1_1google_1_1ortools_1_1linearsolver_1_1MPSolver_1_1ResultStatus.html"target="_self">ResultStatus</a></td><tdclass="desc">The status of solving the problem </td></tr>
<trid="row_0_0_0_3_21_"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanid="arr_0_0_0_3_21_"class="arrow"onclick="toggleFolder('0_0_0_3_21_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1linearsolver_1_1MPSolverParameters.html"target="_self">MPSolverParameters</a></td><tdclass="desc">This class stores parameter settings for LP and MIP solvers </td></tr>
<trid="row_0_0_0_3_21_0_"style="display:none;"><tdclass="entry"><spanstyle="width:96px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="enumcom_1_1google_1_1ortools_1_1linearsolver_1_1MPSolverParameters_1_1DoubleParam.html"target="_self">DoubleParam</a></td><tdclass="desc">Enumeration of parameters that take continuous values </td></tr>
<trid="row_0_0_0_3_21_2_"style="display:none;"><tdclass="entry"><spanstyle="width:96px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="enumcom_1_1google_1_1ortools_1_1linearsolver_1_1MPSolverParameters_1_1IntegerParam.html"target="_self">IntegerParam</a></td><tdclass="desc">Enumeration of parameters that take integer or categorical values </td></tr>
<trid="row_0_0_0_3_21_3_"style="display:none;"><tdclass="entry"><spanstyle="width:96px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="enumcom_1_1google_1_1ortools_1_1linearsolver_1_1MPSolverParameters_1_1LpAlgorithmValues.html"target="_self">LpAlgorithmValues</a></td><tdclass="desc">LP algorithm to use </td></tr>
<trid="row_0_0_0_3_21_4_"style="display:none;"><tdclass="entry"><spanstyle="width:96px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="enumcom_1_1google_1_1ortools_1_1linearsolver_1_1MPSolverParameters_1_1PresolveValues.html"target="_self">PresolveValues</a></td><tdclass="desc">For each categorical parameter, enumeration of possible values </td></tr>
<trid="row_0_0_0_3_25_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1linearsolver_1_1MPVariable.html"target="_self">MPVariable</a></td><tdclass="desc">The class for variables of a Mathematical Programming (MP) model </td></tr>
<trid="row_0_0_0_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="classcom_1_1google_1_1ortools_1_1sat_1_1Constraint.html"target="_self">Constraint</a></td><tdclass="desc">Wrapper around a ConstraintProto </td></tr>
<trid="row_0_0_0_4_1_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:64px;display:inline-block;"> </span><spanid="arr_0_0_0_4_1_"class="arrow"onclick="toggleFolder('0_0_0_4_1_')">►</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1sat_1_1CpModel.html"target="_self">CpModel</a></td><tdclass="desc">Main modeling class </td></tr>
<trid="row_0_0_0_4_1_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="classcom_1_1google_1_1ortools_1_1sat_1_1CpModel_1_1MismatchedArrayLengths.html"target="_self">MismatchedArrayLengths</a></td><tdclass="desc">Exception thrown when parallel arrays have mismatched lengths </td></tr>
<trid="row_0_0_0_4_1_1_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:96px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1sat_1_1CpModel_1_1WrongLength.html"target="_self">WrongLength</a></td><tdclass="desc">Exception thrown when an array has a wrong length </td></tr>
<trid="row_0_0_0_4_3_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1sat_1_1CpSolver.html"target="_self">CpSolver</a></td><tdclass="desc">Wrapper around the SAT solver </td></tr>
<trid="row_0_0_0_4_4_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1sat_1_1CpSolverSolutionCallback.html"target="_self">CpSolverSolutionCallback</a></td><tdclass="desc">Parent class to create a callback called at each solution </td></tr>
<trid="row_0_0_0_4_7_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="interfacecom_1_1google_1_1ortools_1_1sat_1_1LinearExpr.html"target="_self">LinearExpr</a></td><tdclass="desc">A linear expression interface that can be parsed </td></tr>
<trid="row_0_0_0_4_8_"class="even"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="interfacecom_1_1google_1_1ortools_1_1sat_1_1Literal.html"target="_self">Literal</a></td><tdclass="desc">Interface to describe a boolean variable or its negation </td></tr>
<trid="row_0_0_0_5_3_"style="display:none;"><tdclass="entry"><spanstyle="width:80px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classcom_1_1google_1_1ortools_1_1util_1_1SortedDisjointIntervalList.html"target="_self">SortedDisjointIntervalList</a></td><tdclass="desc">This class represents a sorted list of disjoint, closed intervals </td></tr>
