| Coperations_research::ArgumentHolder | Argument Holder: useful when visiting a model |
| Coperations_research::AssignmentContainer< V, E > | --— Assignment element container --— |
| Coperations_research::AssignmentContainer< IntervalVar, IntervalVarElement > | |
| Coperations_research::AssignmentContainer< IntVar, IntVarElement > | |
| Coperations_research::AssignmentContainer< SequenceVar, SequenceVarElement > | |
| ▼Coperations_research::AssignmentElement | ------— Assignments -------------------------— |
| Coperations_research::IntervalVarElement | --— IntervalVarElement --— |
| Coperations_research::IntVarElement | --— IntVarElement --— |
| Coperations_research::SequenceVarElement | --— SequenceVarElement --— |
| ▼Coperations_research::BaseObject | Useful Search and Modeling Objects |
| Coperations_research::ArrayWithOffset< T > | --— Utility Class for Callbacks --— |
| 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::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 ---— |
| Coperations_research::IntVarLocalSearchFilter | --— IntVarLocalSearchFilter --— |
| 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 | -------— 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 | --— Base Large Neighborhood Search operator class -— |
| Coperations_research::ChangeValue | --— ChangeValue Operators --— |
| ►Coperations_research::PathOperator | --— Path-based Operators --— |
| 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 --— Operator which relocates the most expensive subchains (given a cost callback) in a path to a different position |
| 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 | The PropagationBaseObject is a subclass of BaseObject that is also friend to the Solver class |
| Coperations_research::Assignment | --— Assignment --— |
| ►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 | --— Disjunctive Constraint --— |
| Coperations_research::Pack | -------— Pack Constraint -------— |
| Coperations_research::IntervalVar | -------— Interval Var -------— |
| ►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 | --— Boolean Variable --— |
| Coperations_research::SequenceVar | --— SequenceVar --— |
| ▼Coperations_research::SearchMonitor | A search monitor is a simple set of callbacks to monitor all search events |
| Coperations_research::LocalSearchMonitor | -------— LocalSearchMonitor -------— |
| Coperations_research::OptimizeVar | -------— Objective Management -------— |
| Coperations_research::PropagationMonitor | -------— PropagationMonitor -------— |
| ►Coperations_research::SearchLimit | -------— Search Limits -------— |
| Coperations_research::RegularLimit | --— Regular Limit --— |
| Coperations_research::SearchLog | -------— Search Log ------— |
| Coperations_research::SolutionCollector | -------— Solution Collectors -------— |
| Coperations_research::SolutionPool | --— SolutionPool --— |
| CSimpleBoundCosts::BoundCost | |
| Coperations_research::DefaultPhaseParameters | This struct holds all parameters for the default search |
| Coperations_research::DimensionCumulOptimizerCore | Classes to solve dimension cumul placement (aka scheduling) problems using linear programming |
| 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 | Class used to compute optimal values for dimension cumuls of routes, minimizing cumul soft lower and upper bound costs, and vehicle span costs of a route |
| ▼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 |
| CTypeRegulationsChecker::NodeCount | |
| CRoutingDimension::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 > | --— Immutable Multi Map --— |
| Coperations_research::RevIntSet< T > | --— RevIntSet --— |
| Coperations_research::RevIntSet< int > | |
| Coperations_research::RevPartialSequence | --— RevPartialSequence --— |
| Coperations_research::RevSwitch | A reversible switch that can switch once from false to true |
| CSavingsFilteredDecisionBuilder::SavingsContainer< S > | |
| CSavingsFilteredDecisionBuilder::SavingsParameters | |
| Coperations_research::Solver::SearchLogParameters | Creates a search monitor from logging parameters |
| Coperations_research::SequenceVarLocalSearchHandler | |
| Coperations_research::SimpleRevFIFO< T > | --— utility classes --— |
| 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 |
| CCheapestInsertionFilteredDecisionBuilder::StartEndValue | |
| CTableStruct_ortools_2fconstraint_5fsolver_2frouting_5fenums_2eproto | Internal implementation detail – do not use these members |
| CTableStruct_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto | Internal implementation detail – do not use these members |
| CDisjunctivePropagator::Tasks | A structure to hold tasks described by their features |
| ▼Ctrue_type | |
| Cgoogle::protobuf::is_proto_enum< ::operations_research::FirstSolutionStrategy_Value > | |
| Cgoogle::protobuf::is_proto_enum< ::operations_research::LocalSearchMetaheuristic_Value > | |
| Coperations_research::UnsortedNullableRevBitset | This class represents a reversible bitset |
| CSavingsFilteredDecisionBuilder::VehicleClassEntry | |