<areashape="rect"href="classoperations__research_1_1ArgumentHolder.html"title="Argument Holder: useful when visiting a model."alt=""coords="5,5,124,31"/>
<areashape="rect"href="classoperations__research_1_1SequenceVarElement.html"title="The SequenceVarElement stores a partial representation of ranked interval variables in the underlying..."alt=""coords="193,104,343,129"/>
<areashape="rect"href="classoperations__research_1_1BaseObject.html"title="A BaseObject is the root of all reversibly allocated objects."alt=""coords="5,559,96,585"/>
<areashape="rect"href="classoperations__research_1_1Decision.html"title="A Decision represents a choice point in the search tree."alt=""coords="187,203,260,229"/>
<areashape="rect"href="classoperations__research_1_1DecisionBuilder.html"title="A DecisionBuilder is responsible for creating the search tree."alt=""coords="167,253,280,280"/>
<areashape="rect"href="classoperations__research_1_1DecisionVisitor.html"title="A DecisionVisitor is used to inspect a decision."alt=""coords="168,304,279,331"/>
<areashape="rect"href="classoperations__research_1_1Demon.html"title="A Demon is the base element of a propagation queue."alt=""coords="191,355,255,381"/>
<areashape="rect"href="classoperations__research_1_1IntVarIterator.html"title="The class Iterator has two direct subclasses."alt=""coords="174,508,273,535"/>
<areashape="rect"href="classoperations__research_1_1LocalSearchFilter.html"title="Local Search Filters are used for fast neighbor pruning."alt=""coords="162,559,285,585"/>
<areashape="rect"href="classoperations__research_1_1LocalSearchOperator.html"title="The base class for all local search operators."alt=""coords="151,617,295,644"/>
<areashape="rect"href="classoperations__research_1_1RoutingModelVisitor.html"title="Routing model visitor."alt=""coords="154,908,293,935"/>
<areashape="rect"href="classoperations__research_1_1SearchMonitor.html"title="A search monitor is a simple set of callbacks to monitor all search events."alt=""coords="170,1136,277,1163"/>
<areashape="rect"href="classoperations__research_1_1SolutionPool.html"title="This class is used to manage a pool of solutions."alt=""coords="176,1187,271,1213"/>
<areashape="rect"href="classoperations__research_1_1IntVarFilteredDecisionBuilder.html"title="Decision builder building a solution using heuristics with local search filters to evaluate its feasi..."alt=""coords="351,5,541,32"/>
<areashape="rect"href="classoperations__research_1_1SymmetryBreaker.html"title="A symmetry breaker is an object that will visit a decision and create the 'symmetrical' decision in r..."alt=""coords="383,56,509,83"/>
<areashape="rect"href="classoperations__research_1_1CallMethod0.html"title="Demon proxy to a method on the constraint with no arguments."alt=""coords="383,107,509,133"/>
<areashape="rect"href="classoperations__research_1_1CallMethod1.html"title="Demon proxy to a method on the constraint with one argument."alt=""coords="374,157,518,184"/>
<areashape="rect"href="classoperations__research_1_1CallMethod2.html"title="Demon proxy to a method on the constraint with two arguments."alt=""coords="365,208,527,235"/>
<areashape="rect"href="classoperations__research_1_1CallMethod3.html"title="Demon proxy to a method on the constraint with three arguments."alt=""coords="378,259,514,301"/>
<areashape="rect"href="classoperations__research_1_1DelayedCallMethod0.html"title="Low-priority demon proxy to a method on the constraint with no arguments."alt=""coords="359,325,533,352"/>
<areashape="rect"href="classoperations__research_1_1DelayedCallMethod1.html"title="Low-priority demon proxy to a method on the constraint with one argument."alt=""coords="375,377,517,418"/>
<areashape="rect"href="classoperations__research_1_1DelayedCallMethod2.html"title="Low-priority demon proxy to a method on the constraint with two arguments."alt=""coords="375,442,517,483"/>
<areashape="rect"href="classoperations__research_1_1LocalSearchFilterManager.html"title="Filter manager: when a move is made, filters are executed to decide whether the solution is feasible ..."alt=""coords="359,559,533,585"/>
<areashape="rect"href="classoperations__research_1_1CPFeasibilityFilter.html"title="This filter accepts deltas for which the assignment satisfies the constraints of the Solver."alt=""coords="636,533,765,560"/>
<areashape="rect"href="classoperations__research_1_1VarLocalSearchOperator.html"title="Base operator class for operators manipulating variables."alt=""coords="364,610,528,651"/>
<areashape="rect"href="classoperations__research_1_1IntVarLocalSearchOperator.html"title="Specialization of LocalSearchOperator built from an array of IntVars which specifies the scope of the..."alt=""coords="611,680,790,707"/>
<areashape="rect"href="classoperations__research_1_1BaseLns.html"title="This is the base class for building an Lns operator."alt=""coords="933,541,1007,568"/>
<areashape="rect"href="classoperations__research_1_1ChangeValue.html"title="Defines operators which change the value of variables; each neighbor corresponds to one modified vari..."alt=""coords="920,592,1020,619"/>
<areashape="rect"href="classoperations__research_1_1FilteredHeuristicExpensiveChainLNSOperator.html"title="Similar to the move above, but instead of removing one route entirely, the destruction phase consists..."alt=""coords="881,643,1059,685"/>
<areashape="rect"href="classoperations__research_1_1FilteredHeuristicPathLNSOperator.html"title="LNS-like operator based on a filtered first solution heuristic to rebuild the solution,..."alt=""coords="860,709,1080,736"/>
<areashape="rect"href="classoperations__research_1_1PathOperator.html"title="Base class of the local search operators dedicated to path modifications (a path is a set of nodes li..."alt=""coords="921,760,1019,787"/>
<areashape="rect"href="classoperations__research_1_1SwapIndexPairOperator.html"title="Operator which iterates through each alternative of a set of pairs."alt=""coords="890,811,1050,837"/>
<areashape="rect"href="classoperations__research_1_1IndexPairSwapActiveOperator.html"title="Operator which inserts inactive nodes into a path and makes a pair of active nodes inactive."alt=""coords="1137,532,1334,559"/>
<areashape="rect"href="classoperations__research_1_1MakePairActiveOperator.html"title="Pair-based neighborhood operators, designed to move nodes by pairs (pairs are static and given)."alt=""coords="1153,633,1317,660"/>
<areashape="rect"href="classoperations__research_1_1MakePairInactiveOperator.html"title="Operator which makes pairs of active nodes inactive."alt=""coords="1149,684,1322,711"/>
<areashape="rect"href="classoperations__research_1_1MakeRelocateNeighborsOperator.html"title="Relocate neighborhood which moves chains of neighbors."alt=""coords="1128,735,1343,761"/>
<areashape="rect"href="classoperations__research_1_1PairExchangeOperator.html"title="Operator which exchanges the position of two pairs; for both pairs the first node of the pair must be..."alt=""coords="1159,785,1312,812"/>
<areashape="rect"href="classoperations__research_1_1PairExchangeRelocateOperator.html"title="Operator which exchanges the paths of two pairs (path have to be different)."alt=""coords="1133,836,1338,863"/>
<areashape="rect"href="classoperations__research_1_1PairNodeSwapActiveOperator.html"title="Operator which inserts pairs of inactive nodes into a path and makes an active node inactive."alt=""coords="1137,887,1333,929"/>
<areashape="rect"href="classoperations__research_1_1PairRelocateOperator.html"title="Operator which moves a pair of nodes to another position where the first node of the pair must be bef..."alt=""coords="1162,953,1309,980"/>
<areashape="rect"href="classoperations__research_1_1RelocateSubtrip.html"title="Tries to move subtrips after an insertion node."alt=""coords="1178,1055,1293,1081"/>
<areashape="rect"href="classoperations__research_1_1Assignment.html"title="An Assignment is a variable -> domains mapping, used to report solutions to the user."alt=""coords="401,807,491,833"/>
<areashape="rect"href="classoperations__research_1_1Constraint.html"title="A constraint is the main modeling object."alt=""coords="405,857,487,884"/>
<areashape="rect"href="classoperations__research_1_1IntervalVar.html"title="Interval variables are often used in scheduling."alt=""coords="403,908,489,935"/>
<areashape="rect"href="classoperations__research_1_1IntExpr.html"title="The class IntExpr is the base of all integer expressions in constraint programming."alt=""coords="414,959,478,985"/>
<areashape="rect"href="classoperations__research_1_1SequenceVar.html"title="A sequence variable is a variable whose domain is a set of possible orderings of the interval variabl..."alt=""coords="396,1009,496,1036"/>
<areashape="rect"href="classoperations__research_1_1CastConstraint.html"title="Cast constraints are special channeling constraints designed to keep a variable in sync with an expre..."alt=""coords="645,731,756,757"/>
<areashape="rect"href="classoperations__research_1_1GlobalVehicleBreaksConstraint.html"title="GlobalVehicleBreaksConstraint ensures breaks constraints are enforced on all vehicles in the dimensio..."alt=""coords="599,832,802,859"/>
<areashape="rect"href="classoperations__research_1_1TypeRegulationsConstraint.html"title="The following constraint ensures that incompatibilities and requirements between types are respected."alt=""coords="611,933,791,960"/>
<areashape="rect"href="classoperations__research_1_1BaseIntExpr.html"title="This is the base class for all expressions that are not variables."alt=""coords="653,984,748,1011"/>
<areashape="rect"href="classoperations__research_1_1IntVar.html"title="The class IntVar is a subset of IntExpr."alt=""coords="672,1035,729,1061"/>
<areashape="rect"href="classoperations__research_1_1SearchLimit.html"title="Base class of all search limits."alt=""coords="401,1212,491,1239"/>
<areashape="rect"href="classoperations__research_1_1SearchLog.html"title="The base class of all search logs that periodically outputs information when the search is running."alt=""coords="404,1263,488,1289"/>
<areashape="rect"href="classoperations__research_1_1SolutionCollector.html"title="This class is the root class of all solution collectors."alt=""coords="385,1313,507,1340"/>
<areashape="rect"href="classoperations__research_1_1RegularLimit.html"title="Usual limit based on wall_time, number of explored branches and number of failures in the search tree..."alt=""coords="653,1212,748,1239"/>
<areashape="rect"href="structoperations__research_1_1DefaultPhaseParameters.html"title="This struct holds all parameters for the default search."alt=""coords="5,5,173,32"/>
<areashape="rect"href="classoperations__research_1_1DisjunctivePropagator.html"title="This class acts like a CP propagator: it takes a set of tasks given by their start/duration/end featu..."alt=""coords="5,5,156,32"/>
<areashape="rect"href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html"title="A structure to hold tasks described by their features."alt=""coords="5,5,156,47"/>
<areashape="rect"href="classoperations__research_1_1InitAndGetValues.html"title="Utility class to encapsulate an IntVarIterator and use it in a range-based loop."alt=""coords="5,5,129,32"/>
<areashape="rect"href="classoperations__research_1_1IntVarFilteredHeuristic.html"title="Generic filter-based heuristic applied to IntVars."alt=""coords="5,179,157,206"/>
<areashape="rect"href="classoperations__research_1_1RoutingFilteredHeuristic.html"title="Filter-based heuristic dedicated to routing."alt=""coords="205,179,368,206"/>
<areashape="rect"href="classoperations__research_1_1CheapestAdditionFilteredHeuristic.html"title="Filtered-base decision builder based on the addition heuristic, extending a path from its start node ..."alt=""coords="425,71,593,112"/>
<areashape="rect"href="classoperations__research_1_1SavingsFilteredHeuristic.html"title="Filter-based decision builder which builds a solution by using Clarke & Wright's Savings heuristic."alt=""coords="427,267,591,294"/>
<areashape="rect"href="classoperations__research_1_1ComparatorCheapestAdditionFilteredHeuristic.html"title="A CheapestAdditionFilteredHeuristic where the notion of 'cheapest arc' comes from an arc comparator."alt=""coords="658,5,851,47"/>
<areashape="rect"href="classoperations__research_1_1EvaluatorCheapestAdditionFilteredHeuristic.html"title="A CheapestAdditionFilteredHeuristic where the notion of 'cheapest arc' comes from an arc evaluator."alt=""coords="665,71,845,112"/>
<areashape="rect"href="classoperations__research_1_1GlobalCheapestInsertionFilteredHeuristic.html"title="Filter-based decision builder which builds a solution by inserting nodes at their cheapest position o..."alt=""coords="651,136,859,177"/>
<areashape="rect"href="classoperations__research_1_1LocalCheapestInsertionFilteredHeuristic.html"title="Filter-base decision builder which builds a solution by inserting nodes at their cheapest position."alt=""coords="653,201,856,243"/>
<areashape="rect"href="classoperations__research_1_1ModelCache.html"title="Implements a complete cache for model elements: expressions and constraints."alt=""coords="5,5,100,32"/>
<areashape="rect"href="classoperations__research_1_1Rev.html"title="This class adds reversibility to a POD type."alt=""coords="5,5,84,32"/>
<areashape="rect"href="classoperations__research_1_1NumericalRev.html"title="Subclass of Rev<T> which adds numerical operations."alt=""coords="132,5,269,32"/>
<areashape="rect"href="classoperations__research_1_1RevArray.html"title="Reversible array of POD types."alt=""coords="5,5,115,32"/>
<areashape="rect"href="classoperations__research_1_1NumericalRevArray.html"title="Subclass of RevArray<T> which adds numerical operations."alt=""coords="163,5,331,32"/>
<areashape="rect"href="classoperations__research_1_1RevIntSet.html"title="This is a special class to represent a 'residual' set of T."alt=""coords="5,5,119,32"/>
<areashape="rect"href="classoperations__research_1_1RevSwitch.html"title="A reversible switch that can switch once from false to true."alt=""coords="5,5,92,32"/>
<areashape="rect"href="classoperations__research_1_1RoutingDimension.html"title="Dimensions represent quantities accumulated at nodes along the routes."alt=""coords="5,5,135,32"/>
<areashape="rect"href="classoperations__research_1_1RoutingIndexManager.html"title="Manager for any NodeIndex <-> variable index conversion."alt=""coords="5,5,155,32"/>
<areashape="rect"href="structoperations__research_1_1RoutingModel_1_1CostClass_1_1DimensionCost.html"title="SUBTLE: The vehicle's fixed cost is skipped on purpose here, because we can afford to do so:"alt=""coords="5,5,177,47"/>
<areashape="rect"href="structoperations__research_1_1RoutingModel_1_1StateDependentTransit.html"title="What follows is relevant for models with time/state dependent transits."alt=""coords="5,5,209,47"/>
<areashape="rect"href="classoperations__research_1_1SimpleBoundCosts.html"title="A structure meant to store soft bounds and associated violation constants."alt=""coords="5,5,140,32"/>
<areashape="rect"href="classoperations__research_1_1SimpleRevFIFO.html"title="This class represent a reversible FIFO structure."alt=""coords="5,5,153,32"/>
<areashape="rect"href="classoperations__research_1_1SimpleRevFIFO_1_1Iterator.html"title="This iterator is not stable with respect to deletion."alt=""coords="5,5,153,47"/>
<areashape="rect"href="classoperations__research_1_1SmallRevBitSet.html"title="This class represents a small reversible bitset (size <= 64)."alt=""coords="5,5,120,32"/>
<areashape="rect"href="structoperations__research_1_1Solver_1_1IntegerCastInfo.html"title="Holds semantic information stating that the 'expression' has been cast into 'variable' using the Var(..."alt=""coords="5,5,163,32"/>
<areashape="rect"href="structoperations__research_1_1Solver_1_1SearchLogParameters.html"title="Creates a search monitor from logging parameters."alt=""coords="5,5,201,32"/>
<areashape="rect"href="classoperations__research_1_1SweepArranger.html"title="Class to arrange indices by by their distance and their angles from the depot."alt=""coords="5,5,116,32"/>
<areashape="rect"href="classoperations__research_1_1TypeIncompatibilityChecker.html"title="Checker for type incompatibilities."alt=""coords="223,5,407,32"/>
<areashape="rect"href="classoperations__research_1_1TypeRequirementChecker.html"title="Checker for type requirements."alt=""coords="227,56,402,83"/>
<areashape="rect"href="classoperations__research_1_1UnsortedNullableRevBitset.html"title="This class represents a reversible bitset."alt=""coords="5,5,185,32"/>
