| Coperations_research::ArgumentHolder | Argument Holder: useful when visiting a model |
| Coperations_research::AssignmentContainer< V, E > | |
| Coperations_research::AssignmentContainer< IntervalVar, IntervalVarElement > | |
| Coperations_research::AssignmentContainer< IntVar, IntVarElement > | |
| Coperations_research::AssignmentContainer< SequenceVar, SequenceVarElement > | |
| ▼Coperations_research::AssignmentElement | |
| Coperations_research::IntervalVarElement | |
| Coperations_research::IntVarElement | |
| Coperations_research::SequenceVarElement | The SequenceVarElement stores a partial representation of ranked interval variables in the underlying sequence variable |
| ▼Coperations_research::BaseObject | A BaseObject is the root of all reversibly allocated objects |
| Coperations_research::ArrayWithOffset< T > | |
| Coperations_research::Decision | A Decision represents a choice point in the search tree |
| ►Coperations_research::DecisionBuilder | A DecisionBuilder is responsible for creating the search tree |
| ►Coperations_research::IntVarFilteredDecisionBuilder | Decision builders building a solution using local search filters to evaluate its feasibility |
| ►Coperations_research::RoutingFilteredDecisionBuilder | Filter-based decision builder dedicated to routing |
| ►Coperations_research::CheapestAdditionFilteredDecisionBuilder | Filtered-base decision builder based on the addition heuristic, extending a path from its start node with the cheapest arc |
| Coperations_research::ComparatorCheapestAdditionFilteredDecisionBuilder | A CheapestAdditionFilteredDecisionBuilder where the notion of 'cheapest arc' comes from an arc comparator |
| Coperations_research::EvaluatorCheapestAdditionFilteredDecisionBuilder | A CheapestAdditionFilteredDecisionBuilder where the notion of 'cheapest arc' comes from an arc evaluator |
| ►Coperations_research::CheapestInsertionFilteredDecisionBuilder | |
| Coperations_research::GlobalCheapestInsertionFilteredDecisionBuilder | 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 |
| Coperations_research::LocalCheapestInsertionFilteredDecisionBuilder | Filter-base decision builder which builds a solution by inserting nodes at their cheapest position |
| Coperations_research::ChristofidesFilteredDecisionBuilder | Christofides addition heuristic |
| ►Coperations_research::SavingsFilteredDecisionBuilder | Filter-based decision builder which builds a solution by using Clarke & Wright's Savings heuristic |
| Coperations_research::ParallelSavingsFilteredDecisionBuilder | |
| Coperations_research::SequentialSavingsFilteredDecisionBuilder | |
| ►Coperations_research::DecisionVisitor | A DecisionVisitor is used to inspect a decision |
| Coperations_research::SymmetryBreaker | A symmetry breaker is an object that will visit a decision and create the 'symmetrical' decision in return |
| ►Coperations_research::Demon | A Demon is the base element of a propagation queue |
| Coperations_research::CallMethod0< T > | Demon proxy to a method on the constraint with no arguments |
| Coperations_research::CallMethod1< T, P > | Demon proxy to a method on the constraint with one argument |
| Coperations_research::CallMethod2< T, P, Q > | Demon proxy to a method on the constraint with two arguments |
| Coperations_research::CallMethod3< T, P, Q, R > | Demon proxy to a method on the constraint with three arguments |
| Coperations_research::DelayedCallMethod0< T > | Low-priority demon proxy to a method on the constraint with no arguments |
| Coperations_research::DelayedCallMethod1< T, P > | Low-priority demon proxy to a method on the constraint with one argument |
| Coperations_research::DelayedCallMethod2< T, P, Q > | Low-priority demon proxy to a method on the constraint with two arguments |
| Coperations_research::IntVarIterator | The class Iterator has two direct subclasses |
| ►Coperations_research::LocalSearchFilter | Local Search Filters are used for fast neighbor pruning |
| ►Coperations_research::IntVarLocalSearchFilter | |
| Coperations_research::BasePathFilter | Generic path-based filter class |
| Coperations_research::CPFeasibilityFilter | This filter accepts deltas for which the assignment satisfies the constraints of the Solver |
| Coperations_research::LocalSearchFilterManager | Filter manager: when a move is made, filters are executed to decide whether the solution is feasible and compute parts of the new cost |
| ►Coperations_research::LocalSearchOperator | The base class for all local search operators |
| ►Coperations_research::VarLocalSearchOperator< V, Val, Handler > | Base operator class for operators manipulating variables |
| Coperations_research::SequenceVarLocalSearchOperator | |
| ►Coperations_research::VarLocalSearchOperator< IntVar, int64, IntVarLocalSearchHandler > | |
| ►Coperations_research::IntVarLocalSearchOperator | Specialization of LocalSearchOperator built from an array of IntVars which specifies the scope of the operator |
| Coperations_research::BaseLns | This is the base class for building an Lns operator |
| Coperations_research::ChangeValue | Defines operators which change the value of variables; each neighbor corresponds to one modified variable |
| ►Coperations_research::PathOperator | Base class of the local search operators dedicated to path modifications (a path is a set of nodes linked together by arcs) |
| Coperations_research::MakePairActiveOperator | Pair-based neighborhood operators, designed to move nodes by pairs (pairs are static and given) |
| Coperations_research::PairNodeSwapActiveOperator< swap_first > | Operator which inserts pairs of inactive nodes into a path and makes an active node inactive |
| ►Coperations_research::PathWithPreviousNodesOperator | Simple PathOperator wrapper that also stores the current previous nodes, and is thus able to provide the "Prev" and "IsPathStart" functions |
| Coperations_research::ExchangeSubtrip | |
| Coperations_research::IndexPairSwapActiveOperator | Operator which inserts inactive nodes into a path and makes a pair of active nodes inactive |
| Coperations_research::LightPairRelocateOperator | |
| Coperations_research::MakePairInactiveOperator | Operator which makes pairs of active nodes inactive |
| Coperations_research::MakeRelocateNeighborsOperator | Relocate neighborhood which moves chains of neighbors |
| Coperations_research::PairExchangeOperator | 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 |
| Coperations_research::PairExchangeRelocateOperator | Operator which exchanges the paths of two pairs (path have to be different) |
| Coperations_research::PairRelocateOperator | 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 |
| Coperations_research::RelocateSubtrip | Tries to move subtrips after an insertion node |
| Coperations_research::RelocateExpensiveChain | RelocateExpensiveChain |
| Coperations_research::SwapIndexPairOperator | Operator which iterates through each alternative of a set of pairs |
| ►Coperations_research::ModelVisitor | Model visitor |
| Coperations_research::ModelParser | Model Parser |
| ►Coperations_research::PropagationBaseObject | NOLINT |
| Coperations_research::Assignment | An Assignment is a variable -> domains mapping, used to report solutions to the user |
| ►Coperations_research::Constraint | A constraint is the main modeling object |
| Coperations_research::CastConstraint | Cast constraints are special channeling constraints designed to keep a variable in sync with an expression |
| Coperations_research::DisjunctiveConstraint | |
| Coperations_research::GlobalVehicleBreaksConstraint | GlobalVehicleBreaksConstraint ensures breaks constraints are enforced on all vehicles in the dimension passed to its constructor |
| Coperations_research::Pack | |
| Coperations_research::TypeRegulationsConstraint | The following constraint ensures that incompatibilities and requirements between types are respected |
| Coperations_research::IntervalVar | Interval variables are often used in scheduling |
| ►Coperations_research::IntExpr | The class IntExpr is the base of all integer expressions in constraint programming |
| Coperations_research::BaseIntExpr | This is the base class for all expressions that are not variables |
| ►Coperations_research::IntVar | The class IntVar is a subset of IntExpr |
| Coperations_research::BooleanVar | |
| Coperations_research::SequenceVar | A sequence variable is a variable whose domain is a set of possible orderings of the interval variables |
| Coperations_research::RoutingModelVisitor | Routing model visitor |
| ►Coperations_research::SearchMonitor | A search monitor is a simple set of callbacks to monitor all search events |
| Coperations_research::LocalSearchMonitor | |
| Coperations_research::OptimizeVar | This class encapsulates an objective |
| Coperations_research::PropagationMonitor | |
| ►Coperations_research::SearchLimit | Base class of all search limits |
| Coperations_research::RegularLimit | Usual limit based on wall_time, number of explored branches and number of failures in the search tree |
| Coperations_research::SearchLog | The base class of all search logs that periodically outputs information when the search is running |
| Coperations_research::SolutionCollector | This class is the root class of all solution collectors |
| Coperations_research::SolutionPool | This class is used to manage a pool of solutions |
| Coperations_research::SimpleBoundCosts::BoundCost | |
| Coperations_research::RoutingModel::CostClass | |
| Coperations_research::DefaultPhaseParameters | This struct holds all parameters for the default search |
| Coperations_research::RoutingModel::CostClass::DimensionCost | SUBTLE: The vehicle's fixed cost is skipped on purpose here, because we can afford to do so: |
| Coperations_research::DimensionCumulOptimizerCore | |
| Coperations_research::DisjunctivePropagator | 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 |
| Coperations_research::GlobalDimensionCumulOptimizer | |
| Coperations_research::InitAndGetValues | Utility class to encapsulate an IntVarIterator and use it in a range-based loop |
| Coperations_research::Solver::IntegerCastInfo | 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' |
| Coperations_research::IntVarLocalSearchHandler | Base operator class for operators manipulating IntVars |
| Coperations_research::SimpleRevFIFO< T >::Iterator | This iterator is not stable with respect to deletion |
| Coperations_research::InitAndGetValues::Iterator | |
| Coperations_research::LocalDimensionCumulOptimizer | |
| ▼CMessage | |
| Coperations_research::FirstSolutionStrategy | |
| Coperations_research::LocalSearchMetaheuristic | |
| Coperations_research::RoutingModelParameters | |
| Coperations_research::RoutingSearchParameters | |
| Coperations_research::RoutingSearchParameters_LocalSearchNeighborhoodOperators | |
| Coperations_research::ModelCache | Implements a complete cache for model elements: expressions and constraints |
| Coperations_research::TypeRegulationsChecker::NodeCount | |
| Coperations_research::RoutingDimension::NodePrecedence | |
| ▼Coperations_research::Rev< T > | This class adds reversibility to a POD type |
| Coperations_research::NumericalRev< T > | Subclass of Rev<T> which adds numerical operations |
| ▼Coperations_research::Rev< int > | |
| Coperations_research::NumericalRev< int > | |
| Coperations_research::Rev< uint64 > | |
| ▼Coperations_research::RevArray< T > | Reversible array of POD types |
| Coperations_research::NumericalRevArray< T > | Subclass of RevArray<T> which adds numerical operations |
| Coperations_research::RevArray< uint64 > | |
| ▼Coperations_research::RevBitSet | This class represents a reversible bitset |
| Coperations_research::RevBitMatrix | Matrix version of the RevBitSet class |
| Coperations_research::RevGrowingArray< T, C > | This class is a reversible growing array |
| Coperations_research::RevImmutableMultiMap< K, V > | Reversible Immutable MultiMap class |
| Coperations_research::RevIntSet< T > | This is a special class to represent a 'residual' set of T |
| Coperations_research::RevIntSet< int > | |
| Coperations_research::RevPartialSequence | --— RevPartialSequence --— |
| Coperations_research::RevSwitch | A reversible switch that can switch once from false to true |
| Coperations_research::RoutingDimension | Dimensions represent quantities accumulated at nodes along the routes |
| Coperations_research::RoutingIndexManager | Manager for any NodeIndex <-> variable index conversion |
| Coperations_research::RoutingModel | |
| Coperations_research::SavingsFilteredDecisionBuilder::SavingsContainer< S > | |
| Coperations_research::SavingsFilteredDecisionBuilder::SavingsParameters | |
| Coperations_research::Solver::SearchLogParameters | Creates a search monitor from logging parameters |
| Coperations_research::SequenceVarLocalSearchHandler | |
| Coperations_research::SimpleBoundCosts | A structure meant to store soft bounds and associated violation constants |
| Coperations_research::SimpleRevFIFO< T > | This class represent a reversible FIFO structure |
| Coperations_research::SimpleRevFIFO< operations_research::Demon * > | |
| Coperations_research::SmallRevBitSet | This class represents a small reversible bitset (size <= 64) |
| Coperations_research::SolutionCollector::SolutionData | |
| Coperations_research::Solver | Solver Class |
| Coperations_research::CheapestInsertionFilteredDecisionBuilder::StartEndValue | |
| Coperations_research::RoutingModel::StateDependentTransit | What follows is relevant for models with time/state dependent transits |
| Coperations_research::SweepArranger | Class to arrange indices by by their distance and their angles from the depot |
| CTableStruct_ortools_2fconstraint_5fsolver_2frouting_5fenums_2eproto | |
| CTableStruct_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto | |
| Coperations_research::DisjunctivePropagator::Tasks | A structure to hold tasks described by their features |
| ▼Ctrue_type | |
| Cis_proto_enum< ::operations_research::FirstSolutionStrategy_Value > | |
| Cis_proto_enum< ::operations_research::LocalSearchMetaheuristic_Value > | |
| ▼Coperations_research::TypeRegulationsChecker | |
| Coperations_research::TypeIncompatibilityChecker | Checker for type incompatibilities |
| Coperations_research::TypeRequirementChecker | Checker for type requirements |
| Coperations_research::UnsortedNullableRevBitset | This class represents a reversible bitset |
| Coperations_research::RoutingModel::VehicleClass | |
| Coperations_research::SavingsFilteredDecisionBuilder::VehicleClassEntry | |