| C_GRBsvec | |
| CAccessStorage | |
| CAccurateSum< FpNumber > | |
| CAccurateSum< Fractional > | |
| CActivityBoundHelper | |
| CAdaptiveParameterValue | |
| CAdaptiveParameterValue | |
| CAdjustablePriorityQueue< T, Comp > | |
| CAdjustablePriorityQueue< BvaPqElement > | |
| CAdjustablePriorityQueue< Element > | |
| CAdjustablePriorityQueue< Entries > | |
| CAdjustablePriorityQueue< operations_research::BlossomGraph::Edge, std::greater< operations_research::BlossomGraph::Edge > > | |
| CAdjustablePriorityQueue< PQElement > | |
| CAffineExpression | |
| CAffineRelation | |
| CAllSolversRegistry | |
| CAnnotation | |
| CArc | |
| CArcFlowGraph::Arc | |
| CArcFlowGraph | |
| CArcFunctorOrderingByTailAndHead< GraphType > | |
| CArcIndexOrderingByTailNode< GraphType > | |
| ►CArcIterator | |
| CUndirectedAdjacencyListsOfDirectedGraph< Graph >::AdjacencyListIterator | |
| CStarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::ArcIterator | |
| CArgument | |
| CArgumentHolder | Argument Holder: useful when visiting a model |
| CArrowOperatorProxy< T > | |
| CAsciiCaseInsensitiveEq | |
| CAsciiCaseInsensitiveHash | |
| CAsciiCaseInsensitiveLess | |
| CAssignmentAndConstraintFeasibilityMaintainer | |
| CAssignmentContainer< V, E > | |
| CAssignmentContainer< IntervalVar, IntervalVarElement > | |
| CAssignmentContainer< IntVar, IntVarElement > | |
| CAssignmentContainer< SequenceVar, SequenceVarElement > | |
| ►CAssignmentElement | |
| CIntVarElement | |
| CIntervalVarElement | |
| CSequenceVarElement | The SequenceVarElement stores a partial representation of ranked interval variables in the underlying sequence variable |
| CAssignmentInfo | |
| CAssignmentType | |
| CAStarSP | |
| CAtomicConstraintStorage< ConstraintData > | |
| CAtomicConstraintStorage< operations_research::math_opt::IndicatorConstraintData > | |
| CAtomicConstraintStorage< operations_research::math_opt::internal::SosConstraintData > | |
| CAtomicConstraintStorage< operations_research::math_opt::QuadraticConstraintData > | |
| CAtomicConstraintTraits< IdType > | |
| CAtomicConstraintTraits< IndicatorConstraintId > | |
| CAtomicConstraintTraits< QuadraticConstraintId > | |
| CAtomicConstraintTraits< Sos1ConstraintId > | |
| CAtomicConstraintTraits< Sos2ConstraintId > | |
| CRoutingModel::ResourceGroup::Attributes | Attributes for a dimension |
| CAvx512Rounding | |
| CBacktrackableIntegerSet< IntType > | |
| CBacktrackableIntegerSet< ConstraintIndex > | |
| ►CBaseDeleter | |
| CTemplatedElementDeleter< STLContainer > | |
| CTemplatedValueDeleter< STLContainer > | |
| ►CBaseEvent | |
| CCtEvent | |
| CEnergyEvent | |
| CBaseGraph< NodeIndexType, ArcIndexType, HasReverseArcs > | |
| ►CBaseGraph< int, int, true > | |
| CReverseArcListGraph< int, int > | |
| ►CBaseGraph< int32_t, int32_t, false > | |
| CCompleteBipartiteGraph< NodeIndexType, ArcIndexType > | |
| CCompleteGraph< NodeIndexType, ArcIndexType > | |
| CListGraph< NodeIndexType, ArcIndexType > | |
| CStaticGraph< NodeIndexType, ArcIndexType > | |
| ►CBaseGraph< int32_t, int32_t, true > | |
| CReverseArcListGraph< NodeIndexType, ArcIndexType > | |
| CReverseArcMixedGraph< NodeIndexType, ArcIndexType > | |
| CReverseArcStaticGraph< NodeIndexType, ArcIndexType > | |
| ►CBaseKnapsackSolver | |
| CKnapsack64ItemsSolver | |
| CKnapsackBruteForceSolver | |
| CKnapsackDivideAndConquerSolver | |
| CKnapsackDynamicProgrammingSolver | |
| CKnapsackGenericSolver | |
| CKnapsackMIPSolver | |
| ►CBaseObject | A BaseObject is the root of all reversibly allocated objects |
| CArrayWithOffset< T > | |
| CDecision | A Decision represents a choice point in the search tree |
| ►CDecisionBuilder | A DecisionBuilder is responsible for creating the search tree |
| CFindOneNeighbor | |
| CIntVarFilteredDecisionBuilder | Decision builder building a solution using heuristics with local search filters to evaluate its feasibility |
| CProfiledDecisionBuilder | |
| ►CDecisionVisitor | A DecisionVisitor is used to inspect a decision |
| CSymmetryBreaker | A symmetry breaker is an object that will visit a decision and create the 'symmetrical' decision in return |
| ►CDemon | A Demon is the base element of a propagation queue |
| CCallMethod0< T > | Demon proxy to a method on the constraint with no arguments |
| CCallMethod1< T, P > | Demon proxy to a method on the constraint with one argument |
| CCallMethod2< T, P, Q > | Demon proxy to a method on the constraint with two arguments |
| CCallMethod3< T, P, Q, R > | Demon proxy to a method on the constraint with three arguments |
| CDelayedCallMethod0< T > | Low-priority demon proxy to a method on the constraint with no arguments |
| CDelayedCallMethod1< T, P > | Low-priority demon proxy to a method on the constraint with one argument |
| CDelayedCallMethod2< T, P, Q > | Low-priority demon proxy to a method on the constraint with two arguments |
| CDimension | |
| CIntVarIterator | The class Iterator has two direct subclasses |
| ►CLocalSearchFilter | Local Search Filters are used for fast neighbor pruning |
| ►CIntVarLocalSearchFilter | |
| CBasePathFilter | Generic path-based filter class |
| CLocalSearchFilterManager | Filter manager: when a move is made, filters are executed to decide whether the solution is feasible and compute parts of the new cost |
| ►CLocalSearchOperator | The base class for all local search operators |
| ►CIntVarLocalSearchOperator | Specialization of LocalSearchOperator built from an array of IntVars which specifies the scope of the operator |
| CBaseLns | This is the base class for building an Lns operator |
| CChangeValue | Defines operators which change the value of variables; each neighbor corresponds to one modified variable |
| ►CFilteredHeuristicLocalSearchOperator | Class of operators using a RoutingFilteredHeuristic to insert unperformed nodes after changes have been made to the current solution |
| CFilteredHeuristicCloseNodesLNSOperator | Filtered heuristic LNS operator, where the destruction phase consists of removing a node and the 'num_close_nodes' nodes closest to it, along with each of their corresponding sibling pickup/deliveries that are performed |
| CFilteredHeuristicExpensiveChainLNSOperator | Similar to the heuristic path LNS above, but instead of removing one route entirely, the destruction phase consists of removing all nodes on an "expensive" chain from a route |
| CFilteredHeuristicPathLNSOperator | LNS-like operator based on a filtered first solution heuristic to rebuild the solution, after the destruction phase consisting of removing one route |
| CRelocatePathAndHeuristicInsertUnperformedOperator | Heuristic-based local search operator which relocates an entire route to an empty vehicle of different vehicle class and then tries to insert unperformed nodes using the heuristic |
| ►CPathOperator | Base class of the local search operators dedicated to path modifications (a path is a set of nodes linked together by arcs) |
| ►CBaseInactiveNodeToPathOperator | |
| CExtendedSwapActiveOperator | |
| CMakeActiveAndRelocate | |
| CMakeActiveOperator | |
| CRelocateAndMakeActiveOperator | |
| CSwapActiveOperator | |
| CCross | |
| CExchange | |
| CExchangeSubtrip | |
| CGroupPairAndRelocateOperator | Operator which moves a pair of nodes to another position where the first node of the pair is directly before the second node |
| CIndexPairSwapActiveOperator | Operator which inserts inactive nodes into a path and makes a pair of active nodes inactive |
| CLightPairRelocateOperator | 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 |
| CLinKernighan | |
| CMakeChainInactiveOperator | |
| CMakeInactiveOperator | |
| CMakePairActiveOperator | Pair-based neighborhood operators, designed to move nodes by pairs (pairs are static and given) |
| CMakePairInactiveOperator | Operator which makes pairs of active nodes inactive |
| CMakeRelocateNeighborsOperator | Relocate neighborhood which moves chains of neighbors |
| CPairExchangeOperator | 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 |
| CPairExchangeRelocateOperator | Operator which exchanges the paths of two pairs (path have to be different) |
| CPairNodeSwapActiveOperator< swap_first > | Operator which inserts pairs of inactive nodes into a path and makes an active node inactive |
| CPairRelocateOperator | 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 |
| CPathLns | |
| CRelocate | |
| CRelocateAndMakeInactiveOperator | |
| CRelocateExpensiveChain | RelocateExpensiveChain |
| CRelocateSubtrip | Tries to move subtrips after an insertion node |
| CSwapActiveToShortestPathOperator | |
| CTSPLns | |
| CTSPOpt | |
| CTwoOpt | |
| CSwapIndexPairOperator | Operator which iterates through each alternative of a set of pairs |
| CNeighborhoodLimit | |
| CLocalSearchPhaseParameters | |
| ►CModelVisitor | Model visitor |
| CModelParser | Model Parser |
| CRoutingModelInspector | |
| ►CPropagationBaseObject | NOLINT |
| CAssignment | An Assignment is a variable -> domains mapping, used to report solutions to the user |
| ►CConstraint | A constraint is the main modeling object |
| ►CCastConstraint | Cast constraints are special channeling constraints designed to keep a variable in sync with an expression |
| CIfThenElseCt | |
| CDisjunctiveConstraint | |
| CGlobalVehicleBreaksConstraint | GlobalVehicleBreaksConstraint ensures breaks constraints are enforced on all vehicles in the dimension passed to its constructor |
| CLightIntFunctionElementCt< F > | |
| CLightIntIntFunctionElementCt< F > | |
| CPack | |
| CTypeRegulationsConstraint | The following constraint ensures that incompatibilities and requirements between types are respected |
| ►CIntExpr | The class IntExpr is the base of all integer expressions in constraint programming |
| ►CBaseIntExpr | |
| CPiecewiseLinearExpr | |
| ►CIntVar | The class IntVar is a subset of IntExpr |
| CBooleanVar | |
| CIntervalVar | Interval variables are often used in scheduling |
| CSequenceVar | A sequence variable is a variable whose domain is a set of possible orderings of the interval variables |
| CRoutingModelVisitor | Routing model visitor |
| ►CSearchMonitor | A search monitor is a simple set of callbacks to monitor all search events |
| ►CLocalSearchMonitor | |
| CLocalSearchMonitorPrimary | |
| CLocalSearchProfiler | |
| COptimizeVar | This class encapsulates an objective |
| ►CPropagationMonitor | |
| CDemonProfiler | |
| CTrace | |
| ►CSearchLimit | Base class of all search limits |
| CImprovementSearchLimit | |
| CRegularLimit | Usual limit based on wall_time, number of explored branches and number of failures in the search tree |
| CSearchLog | The base class of all search logs that periodically outputs information when the search is running |
| CSolutionCollector | This class is the root class of all solution collectors |
| CSymmetryManager | |
| CSolutionPool | This class is used to manage a pool of solutions |
| CBasicKnapsackSolver | |
| CBasis | |
| CBasisFactorization | |
| CBasisState | |
| CBeginEndReverseIteratorWrapper< Container > | |
| CBeginEndWrapper< Iterator > | |
| ►CBeginEndWrapper< IntegerRangeIterator< IntegerType > > | |
| CIntegerRange< IntegerType > | |
| CBellmanFord | |
| CImpliedBoundsProcessor::BestImpliedBoundInfo | |
| CBinaryClause | |
| CBinaryClauseManager | |
| CBinPacking2dParser | |
| CLinearSumAssignment< GraphType >::BipartiteLeftNodeIterator | |
| ►CBitGenRef | |
| CModelRandomGenerator | |
| CBitmap | |
| CBitQueue64 | |
| CBitset64< IndexType > | |
| CBitset64< ColIndex > | |
| CBitset64< Index > | |
| CBitset64< int64_t > | |
| CBitset64< LiteralIndex > | |
| CBitset64< RowIndex > | |
| CBlockedClauseSimplifier | |
| CBlossomGraph | |
| CBooleanOrIntegerLiteral | |
| CBooleanOrIntegerVariable | |
| CBoolVar | A Boolean variable |
| CBopConstraintTerm | |
| ►CBopOptimizerBase | |
| CBopAdaptiveLNSOptimizer | |
| CBopCompleteLNSOptimizer | |
| CBopRandomFirstSolutionGenerator | |
| CGuidedSatFirstSolutionGenerator | |
| CLinearRelaxation | |
| CLocalSearchOptimizer | |
| CPortfolioOptimizer | |
| CSatCoreBasedOptimizer | |
| CBopSolution | |
| CBopSolver | |
| CBoundCost | A structure meant to store soft bounds and associated violation constants |
| CBoundedLinearExpression | |
| CBoundedQuadraticExpression | |
| CBoundedVariableElimination | |
| CSolutionOutputSpecs::Bounds | |
| CBronKerboschAlgorithm< NodeIndex > | |
| CCachedIntervalData | |
| CCachedLog | |
| CGurobi::CallbackContext | |
| CCallbackData | |
| CCallbackRangeConstraint | |
| CCallbackRegistration | |
| CCallbackResult | |
| CCallbackSetup | |
| CCanonicalBooleanLinearProblem | |
| CCapacityProfile | |
| CCarpParser | |
| CPathState::Chain | |
| CPathState::ChainBounds | |
| CPathState::ChainRange | |
| CChristofidesPathSolver< CostType, ArcIndex, NodeIndex, CostFunction > | |
| CClauseInfo | |
| CClauseWithOneMissingHasher | |
| CCleanup< Callback > | |
| CClosedInterval | Represents a closed interval [start, end] |
| CDoubletonEqualityRowPreprocessor::RestoreInfo::ColChoiceAndStatus | |
| CColumnDeletionHelper | |
| CColumnPriorityQueue | |
| CColumnsSaver | |
| CColumnView | |
| CZeroHalfCutHelper::CombinationOfRows | |
| ►CCompactSparseMatrix | |
| CTriangularMatrix | |
| CCompactSparseMatrixView | |
| CCompactVectorVector< T > | |
| CIndexedInterval::ComparatorByStart | |
| CIndexedInterval::ComparatorByStartThenEndThenIndex | |
| CValueLiteralPair::CompareByLiteral | |
| CValueLiteralPair::CompareByValue | |
| CConcurrentCallsGuard | |
| CConnectedComponentsFinder< T, CompareOrHashT, Eq > | |
| CConnectedComponentsTypeHelper< T, CompareOrHashT, Eq > | |
| CConnectedComponentsTypeHelper< T, std::less< T >, void > | |
| CIdMap< K, V >::const_iterator | |
| CIdSet< K >::const_iterator | |
| CSparseVectorView< T >::const_iterator | |
| CConstantFormatter | |
| CConstraint | |
| ►CConstraint | A constraint |
| CAutomatonConstraint | Specialized automaton constraint |
| CCircuitConstraint | Specialized circuit constraint |
| CCumulativeConstraint | Specialized cumulative constraint |
| CMultipleCircuitConstraint | Specialized circuit constraint |
| CNoOverlap2DConstraint | Specialized no_overlap2D constraint |
| CReservoirConstraint | Specialized reservoir constraint |
| CTableConstraint | Specialized assignment constraint |
| CLinearConstraintManager::ConstraintInfo | |
| COneFlipConstraintRepairer::ConstraintTerm | |
| CBitset64< IndexType >::ConstView | |
| CCompactSparseMatrix::ConstView | |
| CContinuousProber | |
| CCoordinates2< T > | |
| CCoordinates2< double > | |
| CCoordinates2< int64_t > | |
| CCoordinates3< T > | |
| CCoordinates3< double > | |
| CCoreBasedOptimizer | |
| CRoutingModel::CostClass | |
| CCoverCutHelper | |
| CCpModelBuilder | Wrapper class around the cp_model proto |
| CCpModelMapping | |
| CCpModelPresolver | |
| CCpModelProtoWrapper | |
| CCpModelView | |
| CCppBridge | This class performs various C++ initialization |
| CCppFlags | Simple structure that holds useful C++ flags to setup from non-C++ languages |
| CCpSolverResponseStatisticCallbacks | |
| CCumulBoundsPropagator | |
| CCustomFifoQueue | |
| CCutData | |
| CCutDataBuilder | |
| CCutGenerator | |
| CCutTerm | |
| CCVRPToursParser | |
| CCycleTimerBase | |
| CDataWrapper< Data > | |
| CDataWrapper< LinearProgram > | |
| CDataWrapper< MPModelProto > | |
| CDebugSolution | |
| CDebugStringFormatter | |
| CSatSolver::Decision | |
| CDefaultPhaseParameters | This struct holds all parameters for the default search |
| CDelayedRootLevelDeduction | |
| CDenseConnectedComponentsFinder | |
| CDenseDoublyLinkedList | |
| CDenseIntTopologicalSorterTpl< stable_sort > | |
| CDenseIntTopologicalSorterTpl< false > | |
| CDiagonalTrustRegionProblem | |
| CDiagonalTrustRegionProblemFromQp | |
| CAtomicConstraintStorage< ConstraintData >::Diff | |
| CLinearConstraintStorage::Diff | |
| CObjectiveStorage::Diff | |
| CVariableStorage::Diff | |
| CDijkstraSP< S > | |
| CDimensionChecker | |
| CRoutingModel::CostClass::DimensionCost | SUBTLE: The vehicle's fixed cost is skipped on purpose here, because we can afford to do so: |
| CDimensionCumulOptimizerCore | |
| CDiophantineSolution | |
| CDisabledScopedInstructionCounter | |
| CDisabledScopedTimeDistributionUpdater | |
| CDisjunctivePropagator | 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 |
| CDomain | We call domain any subset of Int64 = [kint64min, kint64max] |
| CDomain | |
| CDomainDeductions | |
| CDomain::DomainIterator | Allows to iterate over all values of a domain in order with for (const int64_t v : domain.Values()) { .. |
| CDomain::DomainIteratorBeginEnd | |
| CDomain::DomainIteratorBeginEndWithOwnership | |
| CDoubleLinearExpr | A dedicated container for linear expressions with double coefficients |
| CDoubleOptions | |
| CDratChecker | |
| CDratProofHandler | |
| CDratWriter | |
| CDualBoundStrengthening | |
| CDualEdgeNorms | |
| CDualRay | |
| CDualSolution | |
| CDualTrustRegionProblem | |
| CDump< F > | |
| CDynamicLibrary | |
| CDynamicMaximum< Index > | |
| CDynamicMaximum< ColIndex > | |
| CDynamicMaximum< RowIndex > | |
| CDynamicPartition | |
| CDynamicPermutation | |
| CBlossomGraph::Edge | |
| CEdge | |
| CElementDeleter | |
| CElementIterator< Set > | |
| CEnabledScopedTimeDistributionUpdater | |
| CEncodingNode | |
| CBitset64< IndexType >::EndIterator | |
| CEnteringVariable | |
| CGlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::Entry | |
| CTaskSet::Entry | |
| ►CEntryType | |
| CVectorIterator< EntryType > | |
| CEnum< E > | |
| CEnumLogger< E > | |
| CEnumProto< P > | |
| CEquiv< LessFunc > | |
| CEtaFactorization | |
| CEtaMatrix | |
| CRoutingSolution::Event | |
| CExponentialMovingAverage | |
| CDimensionChecker::ExtendedInterval | |
| ►Cfalse_type | |
| CUnordered< typename, typename, typename > | |
| CUnordered< T, absl::void_t< typename T::hasher >, absl::void_t< typename T::reverse_iterator > > | |
| CFeasibilityPump | |
| CFile | |
| CFileLineIterator | |
| CFileLines | |
| CLocalSearchFilterManager::FilterEvent | |
| ►Cflat_hash_map | |
| CLinearProgrammingDispatcher | |
| CFlatMatrix< T > | |
| CFlatzincSatParameters | |
| CFlowCoverCutHelper | |
| CFlowInfo | |
| CPrecedencesPropagator::FullIntegerPrecedence | |
| CCallbackResult::GeneratedLinearConstraint | |
| CGlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters | |
| CGlobalDimensionCumulOptimizer | |
| CGlpkRay | |
| CGlpkSparseVector | |
| Cgraph_traits< GraphType > | |
| Cgraph_traits< ForwardEbertGraph< NodeIndexType, ArcIndexType > > | |
| Cgraph_traits< ForwardStaticGraph< NodeIndexType, ArcIndexType > > | |
| CGraphBuilderFromArcs< GraphType, is_dynamic > | |
| ►CGraphBuilderFromArcs< GraphType, graph_traits< GraphType >::is_dynamic > | |
| CAnnotatedGraphBuildManager< GraphType > | |
| CGraphBuilderFromArcs< GraphType, true > | |
| CGraphExporter | |
| CGraphs< Graph > | |
| CGraphs< operations_research::StarGraph > | |
| CGraphSymmetryFinder | |
| CGScip | |
| CGScipConstraintOptions | |
| CGScipEventHandler | |
| CGScipEventHandlerContext | |
| CGScipEventHandlerDescription | |
| CGScipIndicatorConstraint | |
| CGScipIndicatorRangeConstraint | |
| CGScipLinearExpr | |
| CGScipLinearRange | |
| CGScipLogicalConstraintData | |
| CGScipQuadraticRange | |
| CGScipResult | |
| CGScipSolverCallbackHandler | |
| CGScipSolverMessageCallbackHandler | |
| CGScipSOSData | |
| CGScipVariableOptions | |
| CGurobi | |
| CGurobiCallbackInput | |
| CGurobiFreeEnv | |
| CGurobiISVKey | |
| CGurobiIsvKey | |
| CGurobiParameters | |
| CHamiltonianPathSolver< CostType, CostFunction > | |
| CHamiltonianPathSolver< int64_t, std::vector< std::vector< int64_t > > > | |
| ►CIntType< IntTypeName, _ValueType >::Hasher | |
| Chash< gtl::IntType< IntTypeName, ValueType > > | |
| ►CStrongIndex< StrongIndexName >::Hasher | |
| Chash< operations_research::StrongIndex< Tag > > | |
| ►CStrongInt64< StrongIntegerName >::Hasher | |
| Chash< operations_research::StrongInt64< Tag > > | |
| ►CStrongInt< StrongIntName, _ValueType >::Hasher | |
| Chash< util_intops::StrongInt< StrongIntName, ValueType > > | |
| CHeldWolfeCrowderEvaluator< CostType, CostFunction > | |
| CHittingSetOptimizer | |
| CHungarianOptimizer | |
| CIdMap< K, V > | |
| CIdMap< BasisStatus > | |
| CIdMap< double > | |
| CIdMap< int32_t > | |
| CIdNameBiMap | |
| CIdSet< K > | |
| CImpliedBoundEntry | |
| CImpliedBounds | |
| CImpliedBoundsProcessor | |
| CInclusionDetector< Storage > | |
| CEbertGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator | |
| CIncrementalAverage | |
| CIncrementalSolver | |
| CIndexedInterval | |
| CIndexReferences | |
| CIndicatorConstraint | |
| CIndicatorConstraintData | |
| CInitAndGetValues | Utility class to encapsulate an IntVarIterator and use it in a range-based loop |
| CSolverInterface::InitArgs | |
| CInitialBasis | |
| CInprocessing | |
| CInsertionGenerator | |
| CSolver::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' |
| CIntegerEncoder | |
| CIntegerLiteral | |
| CPrecedencesPropagator::IntegerPrecedences | |
| CIntegerPriorityQueue< Element, Compare > | |
| CIntegerPriorityQueue< VariableWithPriority > | |
| CIntegerPriorityQueue< WeightedVarQueueElement > | |
| CIntegerRoundingCutHelper | |
| CIntegerSearchHelper | |
| CIntegralSolver | |
| CInterval | |
| CDimensionChecker::Interval | |
| CSortedDisjointIntervalList::IntervalComparator | |
| CIntervalsRepository | |
| CIntervalVar | Represents a Interval variable |
| CIntTupleSet | |
| CIntType< IntTypeName, _ValueType > | |
| CIntVar | An integer variable |
| ►CIntVarFilteredHeuristic | Generic filter-based heuristic applied to IntVars |
| ►CRoutingFilteredHeuristic | Filter-based heuristic dedicated to routing |
| ►CCheapestAdditionFilteredHeuristic | Filtered-base decision builder based on the addition heuristic, extending a path from its start node with the cheapest arc |
| CComparatorCheapestAdditionFilteredHeuristic | A CheapestAdditionFilteredHeuristic where the notion of 'cheapest arc' comes from an arc comparator |
| CEvaluatorCheapestAdditionFilteredHeuristic | A CheapestAdditionFilteredHeuristic where the notion of 'cheapest arc' comes from an arc evaluator |
| ►CCheapestInsertionFilteredHeuristic | |
| CGlobalCheapestInsertionFilteredHeuristic | 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 |
| CLocalCheapestInsertionFilteredHeuristic | Filter-base decision builder which builds a solution by inserting nodes at their cheapest position |
| CChristofidesFilteredHeuristic | Christofides addition heuristic |
| ►CSavingsFilteredHeuristic | Filter-based decision builder which builds a solution by using Clarke & Wright's Savings heuristic |
| CParallelSavingsFilteredHeuristic | |
| CSequentialSavingsFilteredHeuristic | |
| CInvalidIndicators | |
| CInvertedBounds | |
| CDynamicPartition::IterablePart | |
| CIterationCallbackInfo | |
| CPathOperator::IterationParameters | Set of parameters used to configure how the neighnorhood is traversed |
| CBitset64< IndexType >::Iterator | |
| CInitAndGetValues::Iterator | |
| CIdMap< K, V >::iterator | |
| CPathState::Chain::Iterator | |
| CPathState::ChainRange::Iterator | |
| CPathState::NodeRange::Iterator | |
| CSimpleRevFIFO< T >::Iterator | This iterator is not stable with respect to deletion |
| CSparsePermutation::Iterator | |
| ►Citerator | |
| CIntegerRangeIterator< IntegerType > | |
| CMutableVectorIteration< T >::Iterator | |
| Citerator_range< IteratorT > | |
| CJsspParser | |
| CKnapsackAssignment | |
| CKnapsackAssignmentForCuts | |
| CKnapsackItem | |
| CKnapsackItemForCuts | |
| CKnapsackItemWithEfficiency | |
| ►CKnapsackPropagator | |
| CKnapsackCapacityPropagator | |
| CKnapsackPropagatorForCuts | |
| CKnapsackSearchNode | |
| CKnapsackSearchNodeForCuts | |
| CKnapsackSearchPath | |
| CKnapsackSearchPathForCuts | |
| CKnapsackSolver | This library solves knapsack problems |
| CKnapsackSolverForCuts | |
| CKnapsackState | |
| CKnapsackStateForCuts | |
| CLagrangianPart | |
| CLatticeMemoryManager< Set, CostType > | |
| CLatticeMemoryManager< operations_research::Set, CostType > | |
| CLatticeMemoryManager< operations_research::Set, int64_t > | |
| CLazyMutableCopy< T > | |
| CLbTreeSearch | |
| CLeadingCoefficientFormatter | |
| CLearnedInfo | |
| CLevelZeroCallbackHelper | |
| CLexerInfo | |
| CLinearBooleanProblemWrapper | |
| CLinearConstraint | |
| CLinearConstraint | |
| CLinearConstraintBuilder | |
| CLinearConstraintManager | |
| CLinearConstraintStorage | |
| CLinearExpr | LinearExpr models a quantity that is linear in the decision variables (MPVariable) of an optimization problem, i.e |
| CLinearExpr | A dedicated container for linear expressions |
| CSosConstraintData< ConstraintId >::LinearExpression | |
| CLinearExpression | |
| CLinearExpression | |
| CLinearProgram | |
| CLinearRange | An expression of the form: |
| CLinearRelaxation | |
| CLinearSumAssignment< GraphType > | |
| CLinearTerm | |
| Clinked_hash_map< Key, Value, KeyHash, KeyEq, Alloc > | |
| Clinked_hash_map< int64_t, int > | |
| Clinked_hash_map< int64_t, int64_t > | |
| Clinked_hash_map< int64_t, std::string > | |
| Clinked_hash_map< LinearConstraintId, LinearConstraintData > | |
| Clinked_hash_map< operations_research::Arc, int64_t > | |
| Clinked_hash_map< operations_research::Edge, int64_t > | |
| Clinked_hash_map< std::string, std::string > | |
| Clinked_hash_map< VariableId, GurobiVariableIndex > | |
| CLiteral | |
| CLiteralValueValue | |
| CLiteralWithCoeff | |
| CLocalDimensionCumulOptimizer | |
| CLocalizedLagrangianBounds | |
| CLocalSearchAssignmentIterator | |
| CLocalSearchOperatorState | |
| CLocalSearchState | |
| CLocalSearchVariable | |
| CLocationContainer | |
| ►CLogBase | |
| ►CLogLegacyBase | |
| CLogLegacy | |
| CLogLegacyUpTo100 | |
| ►CLogMultilineBase | |
| CLogMultiline | |
| ►CLogMultilineUpToN | |
| CLogMultilineUpTo100 | |
| ►CLogShortBase | |
| CLogShort | |
| ►CLogShortUpToN | |
| CLogShortUpTo100 | |
| CLogCallback | |
| CLowerBoundedLinearExpression | |
| CLowerBoundedQuadraticExpression | |
| CLowerPriorityThan< T, Comparator > | |
| CLowLevelRounding | |
| CLowLevelRoundingScope | |
| CLPDecomposer | |
| CLpScalingHelper | |
| CLPSolveInfo | |
| CLPSolver | |
| CLPVariable | |
| CLPVariables | |
| CLubyAdaptiveParameterValue | |
| CLuFactorization | |
| CMapFilter< KeyType > | |
| CMapFilter< operations_research::math_opt::LinearConstraint > | |
| CMapFilter< operations_research::math_opt::Variable > | |
| CMarkowitz | |
| CMathUtil | |
| CMatrixEntry | |
| CMatrixNonZeroPattern | |
| CMatrixOrFunction< ScalarType, Evaluator, square > | |
| CMatrixOrFunction< CostType, CostFunction, true > | |
| CMatrixOrFunction< int64_t, std::vector< std::vector< int64_t > >, true > | |
| CMatrixOrFunction< ScalarType, std::vector< std::vector< ScalarType > >, square > | |
| CMatrixView | |
| CMaxBoundedSubsetSum | |
| ►CMaxFlowStatusClass | |
| ►CGenericMaxFlow< StarGraph > | |
| CMaxFlow | |
| CGenericMaxFlow< Graph > | |
| CMergingPartition | |
| CMessageCallbackData | |
| ►CMinCostFlowBase | |
| ►CGenericMinCostFlow< StarGraph > | |
| CMinCostFlow | |
| CGenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType > | |
| CSimpleMinCostFlow | |
| CMinCostPerfectMatching | |
| CModel | |
| CModel | |
| CModel | Class that owns everything related to a particular optimization model |
| CModelBuilderHelper | |
| CModelCache | Implements a complete cache for model elements: expressions and constraints |
| CModelCopy | |
| CModelRanges | |
| CModelSolveParameters | |
| CModelSolverHelper | |
| CModelStatistics | |
| CModelStorage | |
| CModelSummary | |
| CMonoidOperationTree< T > | |
| ►CMPCallback | |
| CMPCallbackList | |
| ►CMPCallbackContext | |
| CScipMPCallbackContext | |
| CMPConstraint | The class for constraints of a Mathematical Programming (MP) model |
| CMPModelExportOptions | Export options |
| CMPObjective | A class to express a linear objective |
| CMPSolver | This mathematical programming (MP) solver class is the main class though which users build and solve problems |
| ►CMPSolverInterface | |
| CBopInterface | |
| CCBCInterface | |
| CCLPInterface | |
| CGLOPInterface | |
| CGurobiInterface | |
| CKnapsackInterface | |
| CPdlpInterface | |
| CSCIPInterface | |
| CSatInterface | |
| CMPSolverParameters | This class stores parameter settings for LP and MIP solvers |
| CMPSReaderImpl | |
| CMPVariable | The class for variables of a Mathematical Programming (MP) model |
| CMutableUpperBoundedLinearConstraint | |
| CMutableVectorIteration< T > | |
| CNearestNeighbors | |
| CNearpParser | |
| CNeighborhood | |
| ►CNeighborhoodGenerator | |
| CConstraintBasedNeighborhood | |
| CObjectiveBasedNeighborhood | |
| CRelationGraphBasedNeighborhood | |
| ►CNeighborhoodGenerator | |
| CConstraintGraphNeighborhoodGenerator | |
| CRandomIntervalSchedulingNeighborhoodGenerator | |
| CRandomPrecedenceSchedulingNeighborhoodGenerator | |
| CRelaxObjectiveVariablesGenerator | |
| CRelaxRandomConstraintsGenerator | |
| CRelaxRandomVariablesGenerator | |
| CRelaxationInducedNeighborhoodGenerator | |
| CRoutingFullPathNeighborhoodGenerator | |
| CRoutingPathNeighborhoodGenerator | |
| CRoutingRandomNeighborhoodGenerator | |
| CSchedulingResourceWindowsNeighborhoodGenerator | |
| CSchedulingTimeWindowNeighborhoodGenerator | |
| CVariableGraphNeighborhoodGenerator | |
| CNestedTimeLimit | Provides a way to nest time limits for algorithms where a certain part of the computation is bounded not just by the overall time limit, but also by a stricter time limit specific just for this particular part |
| CBlossomGraph::Node | |
| CGlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue | |
| CCheapestInsertionFilteredHeuristic::NodeInsertion | |
| CStarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::NodeIterator | |
| CRoutingModel::NodeNeighborsByCostClass | |
| CRoutingDimension::NodePrecedence | |
| CPathState::NodeRange | |
| CNonOrderedSetHasher< IntType > | |
| CNonOrderedSetHasher< ConstraintIndexWithDirection > | |
| ►CNonStreamableSolverInitArguments | |
| ►CNonStreamableSolverInitArgumentsHelper< NonStreamableGurobiInitArguments, SOLVER_TYPE_GUROBI > | |
| CNonStreamableGurobiInitArguments | |
| CNonStreamableSolverInitArgumentsHelper< Implementation, impl_solver_type > | |
| CObjectiveDefinition | |
| CObjectiveStorage | |
| COneFlipConstraintRepairer | |
| COpbReader | |
| ►CReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator | |
| CReverseArcListGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator | |
| ►CReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator | |
| CReverseArcMixedGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator | |
| ►CReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator | |
| CReverseArcStaticGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator | |
| COptimizerSelector | |
| CCircuitPropagator::Options | |
| COrToolsVersion | |
| CStarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::OutgoingArcIterator | |
| CCompleteBipartiteGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
| CListGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
| CReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
| CReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
| CReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
| CStaticGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator | |
| CListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator | |
| CReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator | |
| CEbertGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator | |
| CReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator | |
| CReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator | |
| CReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator | |
| CParserContext | |
| CPathsMetadata | |
| CPathState | |
| CPbConstraintsEnqueueHelper | |
| CPdlpBridge | |
| CPdTspParser | |
| CPercentile | |
| CPermutableEvent | |
| CPermutation< IndexType > | |
| CPermutation< ColIndex > | |
| CPermutation< RowIndex > | |
| CPermutationApplier< IndexType > | |
| ►CPermutationCycleHandler< IndexType > | |
| CArrayIndexCycleHandler< DataType, IndexType > | |
| ►CPermutationCycleHandler< ArcIndexType > | |
| ►CArrayIndexCycleHandler< NodeIndexType, ArcIndexType > | |
| CForwardStaticGraph< NodeIndexType, ArcIndexType >::CycleHandlerForAnnotatedArcs | |
| CCostValueCycleHandler< ArcIndexType > | |
| CEbertGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::CycleHandlerForAnnotatedArcs | |
| CPermutationIndexComparisonByArcHead< NodeIndexType, ArcIndexType > | |
| CInsertionGenerator::PickupDeliveryInsertion | |
| CRoutingModel::RouteDimensionTravelInfo::TransitionInfo::PiecewiseLinearFormulation | The following struct defines a piecewise linear formulation, with int64_t values for the "anchor" x and y values, and potential double values for the slope of each linear function |
| CPiecewiseLinearFunction | |
| CPiecewiseSegment | |
| CPolyaUrn | |
| CPostsolveClauses | |
| ►CPreprocessor | |
| CAddSlackVariablesPreprocessor | |
| CDoubletonEqualityRowPreprocessor | |
| CDoubletonFreeColumnPreprocessor | |
| CDualizerPreprocessor | |
| CEmptyColumnPreprocessor | |
| CEmptyConstraintPreprocessor | |
| CFixedVariablePreprocessor | |
| CForcingAndImpliedFreeConstraintPreprocessor | |
| CFreeConstraintPreprocessor | |
| CImpliedFreePreprocessor | |
| CMainLpPreprocessor | |
| CProportionalColumnPreprocessor | |
| CProportionalRowPreprocessor | |
| CRemoveNearZeroEntriesPreprocessor | |
| CScalingPreprocessor | |
| CShiftVariableBoundsPreprocessor | |
| CSingletonColumnSignPreprocessor | |
| CSingletonPreprocessor | |
| CToMinimizationPreprocessor | |
| CUnconstrainedVariablePreprocessor | |
| CPresolveContext | |
| CPresolver | |
| CPrimalAndDualSolution | |
| CPrimalEdgeNorms | |
| CPrimalPrices | |
| CPrimalRay | |
| CPrimalSolution | |
| CPrimalTrustRegionProblem | |
| Cprint_fields | |
| CPriorityQueueWithRestrictedPush< Element, IntegerPriority > | |
| CPriorityQueueWithRestrictedPush< NodeIndex, NodeHeight > | |
| CProber | |
| CProbingOptions | |
| CProblemSolution | |
| CProblemState | |
| CProblemStatus | |
| CProductDetector | |
| CSchedulingConstraintHelper::ProfileEvent | |
| CPropagationGraph | |
| ►CPropagatorInterface | |
| CAllDifferentBoundsPropagator | |
| CAllDifferentConstraint | |
| CBooleanXorPropagator | |
| CCircuitCoveringPropagator | |
| CCircuitPropagator | |
| CCombinedDisjunctive< time_direction > | |
| CCumulativeEnergyConstraint | |
| CCumulativeIsAfterSubsetConstraint | |
| CDisjunctiveDetectablePrecedences | |
| CDisjunctiveEdgeFinding | |
| CDisjunctiveNotLast | |
| CDisjunctiveOverloadChecker | |
| CDisjunctivePrecedences | |
| CDisjunctiveWithTwoItems | |
| CDivisionPropagator | |
| CFixedDivisionPropagator | |
| CFixedModuloPropagator | |
| CGreaterThanAtLeastOneOfPropagator | |
| CIntegerSumLE | |
| CLevelZeroEquality | |
| CLinMinPropagator | |
| CLinearProgrammingConstraint | |
| CLinearPropagator | |
| CMinPropagator | |
| CNoCyclePropagator | |
| CNonOverlappingRectanglesDisjunctivePropagator | |
| CPrecedencesPropagator | |
| CProductPropagator | |
| CReservoirTimeTabling | |
| ►CSchedulingConstraintHelper | |
| CAllIntervalsHelper | |
| CSelectedMinPropagator | |
| CSquarePropagator | |
| CTimeTableEdgeFinding | |
| CTimeTablingPerTask | |
| CPruningHamiltonianSolver< CostType, CostFunction > | |
| CPseudoCosts | |
| CPywrapSolverResult | |
| CQapProblem | |
| CQuadraticConstraint | |
| CQuadraticConstraintData | |
| CQuadraticExpression | |
| CQuadraticProgram | |
| CQuadraticProgramBoundNorms | |
| CQuadraticTerm | |
| CQuadraticTermKey | |
| CQueue | |
| CRandomAccessSparseColumn | |
| CRandomDemand | |
| CRangeIntToIntFunction | |
| CRangeLogger< IteratorT, PolicyT > | |
| CRangeMinimumIndexQuery< T, Compare > | |
| CRangeMinimumQuery< T, Compare > | |
| CRangeMinimumQuery< int, IndexComparator > | |
| CRangeMinMaxIndexFunction | |
| CRankOneUpdateElementaryMatrix | |
| CRankOneUpdateFactorization | |
| CRcpspParser | |
| CPbConstraintsEnqueueHelper::ReasonInfo | |
| CRecordReader | |
| CRecordWriter | |
| CCapacityProfile::Rectangle | |
| CRectangle | |
| CReducedCosts | |
| CRegisteredMemFile | |
| CRegisteredMutableMemFile | |
| CAffineRelation::Relation | |
| CRelativeConvergenceInformation | |
| CReleaseSCIPMessageHandler | |
| CRescalingOptions | |
| CRoutingModel::ResourceGroup::Resource | A Resource sets attributes (costs/constraints) for a set of dimensions |
| CRoutingModel::ResourceGroup | A ResourceGroup defines a set of available Resources with attributes on one or multiple dimensions |
| CRestartPolicy | |
| CBasicKnapsackSolver::Result | |
| ►CRev< T > | This class adds reversibility to a POD type |
| CNumericalRev< int > | |
| CNumericalRev< T > | Subclass of Rev<T> which adds numerical operations |
| CRev< uint64_t > | |
| ►CRevArray< T > | Reversible array of POD types |
| CNumericalRevArray< T > | Subclass of RevArray<T> which adds numerical operations |
| CRevArray< uint64_t > | |
| ►CRevBitSet | This class represents a reversible bitset |
| CRevBitMatrix | Matrix version of the RevBitSet class |
| CReverseView< Container > | |
| ►CReversibleInterface | |
| ►CRevRepository< IntegerValue > | |
| CRevIntegerValueRepository | |
| ►CRevRepository< int > | |
| CRevIntRepository | |
| CRevVector< IdType, int > | |
| CRevGrowingMultiMap< Key, Value > | |
| CRevMap< Map > | |
| CRevRepository< T > | |
| CRevVector< IndexType, T > | |
| CCircuitCoveringPropagator | |
| CCircuitPropagator | |
| CLinearProgrammingConstraint | |
| CLinearPropagator | |
| CNoCyclePropagator | |
| CSchedulingConstraintHelper | |
| CRevGrowingArray< T, C > | This class is a reversible growing array |
| CRevImmutableMultiMap< K, V > | Reversible Immutable MultiMap class |
| CRevIntSet< T > | This is a special class to represent a 'residual' set of T |
| CRevIntSet< int > | |
| CRevisedSimplex | |
| CRevisedSimplexDictionary | |
| CRevPartialSequence | --— RevPartialSequence --— |
| CRevSwitch | A reversible switch that can switch once from false to true |
| CRINSNeighborhood | |
| CRoundingOptions | |
| CRoundToNearestEven | |
| CRoundTripDoubleFormat | |
| CRoutingModel::RouteDimensionTravelInfo | Contains the information needed by the solver to optimize a dimension's cumuls with travel-start dependent transit values |
| CRoutingDimension | Dimensions represent quantities accumulated at nodes along the routes |
| CRoutingIndexManager | Manager for any NodeIndex <-> variable index conversion |
| ►CRoutingLinearSolverWrapper | |
| CRoutingCPSatWrapper | |
| CRoutingGlopWrapper | |
| CRoutingModel | |
| CRoutingSolution | |
| CRowDeletionHelper | |
| CRunningAverage | |
| CRunningMax< Number > | |
| CRunningMax< int64_t > | |
| CSatClause | |
| CSatCnfReader | |
| CSatDecisionPolicy | |
| CSatPostsolver | |
| CSatPresolveOptions | |
| CSatPresolver | |
| ►CSatPropagator | |
| CBinaryImplicationGraph | |
| CEnforcementPropagator | |
| CGenericLiteralWatcher | |
| CIntegerTrail | |
| CLiteralWatchers | |
| CPbConstraints | |
| CPrecedencesPropagator | |
| CSymmetryPropagator | |
| CSatSolver | |
| CSatWrapper | |
| CSavedLiteral | |
| CSavedVariable | |
| CSavingsFilteredHeuristic::SavingsContainer< Saving > | |
| CSavingsFilteredHeuristic::SavingsParameters | |
| CScalingVectors | |
| CScatteredIntegerVector | |
| CScatteredVector< Index, Iterator > | |
| ►CScatteredVector< ColIndex, ScatteredRowIterator > | |
| CScatteredRow | |
| ►CScatteredVector< RowIndex, ScatteredColumnIterator > | |
| CScatteredColumn | |
| CScatteredVectorEntry< IndexType > | |
| ►CScatteredVectorEntry< ColIndex > | |
| CScatteredRowEntry | |
| ►CScatteredVectorEntry< RowIndex > | |
| CScatteredColumnEntry | |
| CSccCounterOutput< NodeIndex > | |
| CSccGraph | |
| CSchedulingDemandHelper | |
| CSCIP_ConsData | |
| CSCIP_ConshdlrData | |
| CSCIP_EventhdlrData | |
| CSCIP_MessagehdlrData | |
| CScipCallbackConstraintOptions | |
| ►CScipCallbackRunner | |
| CScipCallbackRunnerImpl< ConstraintData > | |
| CScipConstraintHandler< Constraint > | |
| CScipConstraintHandler< ConstraintData > | |
| ►CScipConstraintHandler< EmptyStruct > | |
| CScipConstraintHandlerForMPCallback | |
| CScipConstraintHandlerContext | |
| CScipConstraintHandlerDescription | |
| CScopedFloatingPointEnv | |
| CScopedSCIPMessageHandlerDisabler | |
| CScopedSolveInterrupterCallback | |
| CScopedWallTime | |
| CSearch | |
| CSearchHeuristics | |
| CSolver::SearchLogParameters | Creates a search monitor from logging parameters |
| CConnectedComponentsTypeHelper< T, CompareOrHashT, Eq >::SelectContainer< U, V, E > | |
| CConnectedComponentsTypeHelper< T, CompareOrHashT, Eq >::SelectContainer< U, V, absl::enable_if_t< std::is_integral< decltype(std::declval< const U & >()(std::declval< const T & >()))>::value &&!std::is_same_v< V, void > > > | |
| CConnectedComponentsTypeHelper< T, CompareOrHashT, Eq >::SelectContainer< U, V, absl::enable_if_t< std::is_integral< decltype(std::declval< const U & >()(std::declval< const T & >()))>::value &&std::is_same_v< V, void > > > | |
| CServiceTimePlusTransition | |
| CSet< Integer > | |
| CSetRangeIterator< SetRange > | |
| CSetRangeWithCardinality< Set > | |
| CSharder::Shard | |
| CShardedQuadraticProgram | |
| CShardedWeightedAverage | |
| CSharder | |
| CSharedBoundsManager | |
| CSharedClausesManager | |
| CSharedIncompleteSolutionManager | |
| CSharedResponseManager | |
| CSharedSolutionRepository< ValueType > | |
| ►CSharedSolutionRepository< double > | |
| CSharedLPSolutionRepository | |
| ►CSharedSolutionRepository< int64_t > | |
| CSharedRelaxationSolutionRepository | |
| CSharedStatistics | |
| ►CSharedTimeLimit | |
| CModelSharedTimeLimit | |
| CSigintHandler | |
| CSimpleBoundCosts | |
| CSimpleDynamicPartition | |
| CSimpleLinearSumAssignment | |
| CSimpleMaxFlow | |
| CSimpleRevFIFO< T > | This class represent a reversible FIFO structure |
| CSimpleRevFIFO< bool > | |
| CSimpleRevFIFO< operations_research::Decision * > | |
| CSimpleRevFIFO< operations_research::Demon * > | |
| CSimpleRevFIFO< operations_research::IntVar * > | |
| CSimpleTimeWindow< T > | |
| CSimpleTimeWindow< double > | |
| CSimpleTimeWindow< int64_t > | |
| CSingleNodeFlow | |
| CSingletonUndo | |
| CSingularValueAndIterations | |
| CSlopeAndYIntercept | |
| CSmallRevBitSet | This class represents a small reversible bitset (size <= 64) |
| CSolomonParser | |
| CSolution | |
| CSharedSolutionRepository< ValueType >::Solution | |
| CSolutionCollector::SolutionData | |
| CModelSolveParameters::SolutionHint | |
| CSolutionMatcherOptions | |
| CSolutionObservers | |
| CSolutionOutputSpecs | |
| CSolver::SolveArgs | |
| CSolveArguments | |
| CNeighborhoodGenerator::SolveData | |
| CSolveInterrupter | |
| CSolveParameters | |
| CSolver | |
| CSolver | Solver Class |
| CSolveResult | |
| CSolveResultMatcherOptions | |
| CSolverInitArguments | |
| ►CSolverInterface | |
| CCpSatSolver | |
| CGScipSolver | |
| CGlopSolver | |
| CGlpkSolver | |
| CGurobiSolver | |
| CPdlpSolver | |
| CSolverLogger | |
| CSolverResult | |
| CSolveStats | |
| CSortedDisjointIntervalList | This class represents a sorted list of disjoint, closed intervals |
| CSos1Constraint | |
| CSos2Constraint | |
| CSosConstraintData< ConstraintId > | |
| CSourceLocation | |
| CSparseBitset< IntegerType > | |
| CSparseBitset< BooleanVariable > | |
| CSparseBitset< ConstraintIndex > | |
| CSparseBitset< Index > | |
| CSparseBitset< int > | |
| CSparseBitset< int64_t > | |
| CSparseBitset< IntegerVariable > | |
| CSparseBitset< LiteralIndex > | |
| CSparseBitset< SatDecisionLevel > | |
| CSparseCoefficientMap | |
| CGurobi::SparseMat | |
| CSparseMatrix | |
| CSparseMatrix< RowId, ColumnId > | |
| CSparseMatrix< LinearConstraintId, VariableId > | |
| CSparseMatrixScaler | |
| CSparseMatrixWithReusableColumnMemory | |
| CSparsePermutation | |
| CSparseSymmetricMatrix | |
| CSparseVector< IndexType, IteratorType > | |
| CSparseVector< T > | |
| ►CSparseVector< ColIndex, SparseRowIterator > | |
| CSparseRow | |
| ►CSparseVector< RowIndex, SparseColumnIterator > | |
| CSparseColumn | |
| CSparseVectorEntry< IndexType > | |
| ►CSparseVectorEntry< ColIndex > | |
| CSparseRowEntry | |
| ►CSparseVectorEntry< RowIndex > | |
| CSparseColumnEntry | |
| CSparseVectorFilterPredicate | |
| CSparseVectorView< T > | |
| CStampingSimplifier | |
| ►CStarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph > | |
| CEbertGraphBase< NodeIndexType, ArcIndexType, DerivedGraph > | |
| ►CStarGraphBase< NodeIndexType, ArcIndexType, EbertGraph< NodeIndexType, ArcIndexType > > | |
| ►CEbertGraphBase< NodeIndexType, ArcIndexType, EbertGraph< NodeIndexType, ArcIndexType > > | |
| CEbertGraph< NodeIndexType, ArcIndexType > | |
| ►CStarGraphBase< NodeIndexType, ArcIndexType, ForwardEbertGraph< NodeIndexType, ArcIndexType > > | |
| ►CEbertGraphBase< NodeIndexType, ArcIndexType, ForwardEbertGraph< NodeIndexType, ArcIndexType > > | |
| CForwardEbertGraph< NodeIndexType, ArcIndexType > | |
| ►CStarGraphBase< NodeIndexType, ArcIndexType, ForwardStaticGraph< NodeIndexType, ArcIndexType > > | |
| CForwardStaticGraph< NodeIndexType, ArcIndexType > | |
| CCheapestInsertionFilteredHeuristic::StartEndValue | |
| ►CStat | |
| ►CDistributionStat | |
| CDoubleDistribution | |
| CIntegerDistribution | |
| CRatioDistribution | |
| CTimeDistribution | |
| CRoutingModel::StateDependentTransit | What follows is relevant for models with time/state dependent transits |
| CStateInfo | |
| CStateMarker | |
| CStatsGroup | |
| CStatus | |
| CStatusBuilder | |
| CStdRounding | |
| CStdRoundingScope | |
| CSTLElementDeleter< STLContainer > | |
| CSTLValueDeleter< STLContainer > | |
| CStopServiceTimePlusTransition | |
| CStorage< Callback > | |
| CStreamableCpSatInitArguments | |
| CStreamableGlopInitArguments | |
| CStreamableGlpkInitArguments | |
| CStreamableGScipInitArguments | |
| CStreamableGurobiInitArguments | |
| CStreamablePdlpInitArguments | |
| CStreamableSolverInitArguments | |
| CStrictITISpan< IntType, T > | |
| CStrongIndex< StrongIndexName > | |
| CStrongInt< StrongIntName, _ValueType > | |
| CStrongInt64< StrongIntegerName > | |
| CStrongIntRange< IntType > | |
| CStrongIntRange< IntType >::StrongIntRangeIterator | |
| CStronglyConnectedComponentsFinder< NodeIndex, Graph, SccOutput > | |
| CStronglyConnectedComponentsFinder< int, std::vector< std::vector< int > >, std::vector< std::vector< int > > > | |
| ►CStrongVector< IntType, T, Alloc > | |
| CStrictITIVector< EntryIndex, Fractional > | |
| CStrictITIVector< EntryIndex, RowIndex > | |
| CStrictITIVector< Index, Fractional > | |
| CStrictITIVector< ColIndex, bool > | |
| CStrictITIVector< RowIndex, int32_t > | |
| CStrictITIVector< ColIndex, ColIndex > | |
| CStrictITIVector< RowIndex, ConstraintStatus > | |
| CStrictITIVector< ColIndex, VariableType > | |
| CStrictITIVector< RowIndex, ColIndex > | |
| CStrictITIVector< ColIndex, std::string > | |
| CStrictITIVector< ColIndex, VariableStatus > | |
| CStrictITIVector< RowIndex, RowIndex > | |
| CStrictITIVector< ColIndex, int32_t > | |
| CStrictITIVector< RowIndex, Fractional > | |
| CStrictITIVector< ColIndex, operations_research::glop::SparseColumn const * > | |
| CStrictITIVector< RowIndex, std::string > | |
| CStrictITIVector< ColIndex, EntryIndex > | |
| CStrictITIVector< ColIndex, operations_research::glop::SparseColumn > | |
| CStrictITIVector< Index, bool > | |
| CStrictITIVector< ColIndex, Fractional > | |
| CStrictITIVector< IntType, T > | |
| CStrongVector< ArcIndex, ArcInfo > | |
| CStrongVector< ArcIndex, int > | |
| CStrongVector< BooleanVariable, absl::Span< const operations_research::sat::Literal > > | |
| CStrongVector< BooleanVariable, bool > | |
| CStrongVector< BooleanVariable, BooleanVariable > | |
| CStrongVector< BooleanVariable, ClauseIndex > | |
| CStrongVector< BooleanVariable, Coefficient > | |
| CStrongVector< BooleanVariable, double > | |
| CStrongVector< BooleanVariable, int > | |
| CStrongVector< BooleanVariable, int64_t > | |
| CStrongVector< BooleanVariable, operations_research::sat::AssignmentInfo > | |
| CStrongVector< BooleanVariable, PQElement > | |
| CStrongVector< CandidateIndex, NodeIndex > | |
| CStrongVector< ClauseIndex, Clause > | |
| CStrongVector< ClauseIndex, operations_research::sat::SatClause * > | |
| CStrongVector< ColIndex, int > | |
| CStrongVector< ConstraintIndex, absl::StrongVector< TermIndex, operations_research::bop::OneFlipConstraintRepairer::ConstraintTerm > > | |
| CStrongVector< ConstraintIndex, Coefficient > | |
| CStrongVector< ConstraintIndex, int64_t > | |
| CStrongVector< ConstraintIndex, operations_research::sat::LinearConstraintManager::ConstraintInfo > | |
| CStrongVector< ConstraintIndex, TermIndex > | |
| CStrongVector< CostClassIndex, operations_research::RoutingModel::CostClass > | |
| CStrongVector< DimensionIndex, int > | |
| CStrongVector< DimensionIndex, int64_t > | |
| CStrongVector< DimensionIndex, operations_research::RoutingDimension * > | |
| CStrongVector< DimensionIndex, std::vector< int > > | |
| CStrongVector< DisjunctionIndex, Disjunction > | |
| CStrongVector< EdgeIndex, operations_research::BlossomGraph::Edge > | |
| CStrongVector< EnforcementId, EnforcementStatus > | |
| CStrongVector< EnforcementId, int > | |
| CStrongVector< EnforcementId, std::function< void(EnforcementStatus)> > | |
| CStrongVector< glop::ColIndex, bool > | |
| CStrongVector< glop::ColIndex, IntegerValue > | |
| CStrongVector< glop::RowIndex, IntegerValue > | |
| CStrongVector< glop::RowIndex, LinearConstraintInternal > | |
| CStrongVector< Index, std::vector< int > > | |
| CStrongVector< Index, uint64_t > | |
| CStrongVector< IndexType, IndexType > | |
| CStrongVector< IndexType, T > | |
| CStrongVector< IntegerVariable, absl::InlinedVector< ArcIndex, 6 > > | |
| CStrongVector< IntegerVariable, absl::InlinedVector< int, 6 > > | |
| CStrongVector< IntegerVariable, absl::InlinedVector< OptionalArcIndex, 6 > > | |
| CStrongVector< IntegerVariable, bool > | |
| ►CStrongVector< IntegerVariable, double > | |
| CLinearProgrammingConstraintLpSolution | |
| CStrongVector< IntegerVariable, int > | |
| CStrongVector< IntegerVariable, int64_t > | |
| CStrongVector< IntegerVariable, IntegerValue > | |
| CStrongVector< IntegerVariable, IntegerVariableSpan > | |
| CStrongVector< IntegerVariable, LiteralIndex > | |
| CStrongVector< IntegerVariable, operations_research::sat::IncrementalAverage > | |
| CStrongVector< IntegerVariable, std::vector< operations_research::sat::ImpliedBoundEntry > > | |
| CStrongVector< IntegerVariable, std::vector< WatchData > > | |
| CStrongVector< IntegerVariable, uint64_t > | |
| CStrongVector< IntegerVariable, VarInfo > | |
| CStrongVector< IntervalVariable, LiteralIndex > | |
| CStrongVector< IntervalVariable, operations_research::sat::AffineExpression > | |
| CStrongVector< IntType, uint64_t > | |
| CStrongVector< LiteralIndex, absl::InlinedVector< ArcIndex, 6 > > | |
| CStrongVector< LiteralIndex, absl::InlinedVector< EnforcementId, 6 > > | |
| CStrongVector< LiteralIndex, absl::InlinedVector< int32_t, 6 > > | |
| CStrongVector< LiteralIndex, absl::InlinedVector< operations_research::sat::Literal, 6 > > | |
| CStrongVector< LiteralIndex, bool > | |
| CStrongVector< LiteralIndex, InlinedIntegerLiteralVector > | |
| CStrongVector< LiteralIndex, InlinedIntegerValueVector > | |
| CStrongVector< LiteralIndex, int > | |
| CStrongVector< LiteralIndex, IntegerVariable > | |
| CStrongVector< LiteralIndex, LiteralIndex > | |
| CStrongVector< LiteralIndex, operations_research::sat::Literal > | |
| CStrongVector< LiteralIndex, std::vector< ClauseIndex > > | |
| CStrongVector< LiteralIndex, std::vector< ConstraintIndexWithCoeff > > | |
| CStrongVector< LiteralIndex, std::vector< ImageInfo > > | |
| CStrongVector< LiteralIndex, std::vector< operations_research::sat::LiteralWatchers::Watcher > > | |
| CStrongVector< LiteralIndex, std::vector< WatchData > > | |
| CStrongVector< NodeIndex, int64_t > | |
| CStrongVector< NodeIndex, Node > | |
| CStrongVector< NodeIndex, NodeIndex > | |
| CStrongVector< NodeIndex, operations_research::BlossomGraph::Node > | |
| CStrongVector< NodeIndex, std::vector< EdgeIndex > > | |
| CStrongVector< OptimizerIndex, int > | |
| CStrongVector< OptimizerIndex, operations_research::bop::BopOptimizerBase * > | |
| CStrongVector< OptionalArcIndex, ArcInfo > | |
| CStrongVector< PositiveOnlyIndex, absl::btree_map< IntegerValue, operations_research::sat::Literal > > | |
| CStrongVector< PositiveOnlyIndex, absl::InlinedVector< operations_research::sat::ValueLiteralPair, 2 > > | |
| CStrongVector< PositiveOnlyIndex, bool > | |
| ►CStrongVector< PositiveOnlyIndex, Domain > | |
| CIntegerDomains | |
| CStrongVector< RoutingIndexManager::NodeIndex, Location > | |
| CStrongVector< RowIndex, absl::InlinedVector< ColIndex, 6 > > | |
| ►CStrongVector< RowIndex, bool > | |
| CStrictITIVector< RowIndex, bool > | |
| CStrongVector< RowIndex, operations_research::glop::SumWithOneMissing > | |
| CStrongVector< SparseIndex, BopConstraintTerm > | |
| CStrongVector< VariableIndex, absl::StrongVector< EntryIndex, ConstraintEntry > > | |
| CStrongVector< VariableIndex, bool > | |
| CStrongVector< VariableIndex, std::vector< ConstraintIndex > > | |
| CStrongVector< VehicleClassIndex, operations_research::RoutingModel::VehicleClass > | |
| ►CSubSolver | |
| CNeighborhoodGeneratorHelper | |
| CSynchronizationPoint | |
| CSumOfAllDiffLowerBounder | |
| CSumWithOneMissing< supported_infinity_is_positive > | |
| CSupportedProblemStructures | |
| CSVector< T > | |
| CSVector< int > | |
| CSVector< int32_t > | |
| CSweepArranger | Class to arrange indices by their distance and their angle from the depot |
| ►CT | |
| Csmall_map< T > | |
| CTailArrayBuilder< GraphType, has_reverse_arcs > | |
| CTailArrayBuilder< GraphType, false > | |
| CTailArrayManager< GraphType > | |
| CTailArrayReleaser< GraphType, has_reverse_arcs > | |
| CTailArrayReleaser< GraphType, false > | |
| CDisjunctivePropagator::Tasks | A structure to hold tasks described by their features |
| CTaskSet | |
| CTaskTime | |
| CTermination | |
| CTerminationReasonAndPointType | |
| CThetaLambdaTree< IntegerType > | |
| CThetaLambdaTree< int64_t > | |
| CThetaLambdaTree< IntegerValue > | |
| CThreadPool | |
| CTimeLimit | A simple class to enforce both an elapsed time limit and a deterministic time limit in the same thread as a program |
| CTopN< Element > | |
| CTopN< CutCandidate > | |
| CTopNCuts | |
| CTopologicalSorter< T, stable_sort, Hash, KeyEqual > | |
| ►CTopologicalSorter< T, false, typename absl::flat_hash_map< T, int >::hasher, typename absl::flat_hash_map< T, int, typename absl::flat_hash_map< T, int >::hasher >::key_equal > | |
| CTopologicalSorter< T, stable_sort, Hash, KeyEqual > | |
| CConcurrentCallsGuard::Tracker | |
| CTrafficTransitionEvaluator | |
| CTrail | |
| CTrail | |
| CRoutingModel::RouteDimensionTravelInfo::TransitionInfo | Contains the information for a single transition on the route |
| CTransparentLess | |
| CTravelBounds | |
| CTravelingSalesmanLowerBoundParameters | |
| ►Ctrue_type | |
| CUnordered< T, absl::void_t< typename T::hasher > > | |
| CTrustRegionResult | |
| CTspLibParser | |
| CTspLibTourParser | |
| CTspTWParser | |
| CTypeRegulationsChecker::TypePolicyOccurrence | |
| ►CTypeRegulationsChecker | |
| CTypeIncompatibilityChecker | Checker for type incompatibilities |
| CTypeRequirementChecker | Checker for type requirements |
| CUndirectedAdjacencyListsOfDirectedGraph< Graph > | |
| CUnsortedNullableRevBitset | This class represents a reversible bitset |
| CUpdateDataFieldIterator< UpdateData, V, Field, BaseIter > | |
| CLinearConstraintStorage::UpdateResult | |
| CUpdateResult | |
| CVariableStorage::UpdateResult | |
| CUpdateRow | |
| CUpdateTracker | |
| CUpdateTrackers< Data > | |
| CUpdateTrackers< UpdateTrackerData > | |
| CUpperBoundedLinearConstraint | |
| CUpperBoundedLinearExpression | |
| CUpperBoundedQuadraticExpression | |
| CValueDeleter | |
| CValueLiteralPair | |
| CVarDomination | |
| CVariable | |
| CVariable | |
| CInvalidIndicators::VariableAndConstraint | |
| CPseudoCosts::VariableBoundChange | |
| CVariablesAssignment | |
| CVariablesEquality | |
| CVariablesInfo | |
| CVariableStorage | |
| CVariableValues | |
| CVariableWithSameReasonIdentifier | |
| CVarRefOrValue | |
| CVarValue | |
| CVbpParser | |
| ►Cvector< T > | STL class |
| CLinearProgrammingConstraintCollection | |
| CVectorMap< T > | |
| CVectorOrFunction< ScalarType, Evaluator > | |
| CVectorOrFunction< ScalarType, std::vector< ScalarType > > | |
| CRoutingModel::VehicleClass | |
| CRoutingModel::VehicleTypeContainer::VehicleClassEntry | |
| CRoutingModel::VehicleTypeContainer | Struct used to sort and store vehicles by their type |
| CVehicleTypeCurator | Helper class that manages vehicles |
| CVModuleInfo | |
| CVolgenantJonkerEvaluator< CostType > | |
| ►CWallTimer | |
| CCycleTimer | |
| CLiteralWatchers::Watcher | |
| Cyy_buffer_state | |
| Cyy_trans_info | |
| Cyyalloc | |
| Cyyguts_t | |
| Cyypcontext_t | |
| CZeroHalfCutHelper | |
| CZipArchive | |
| CZipFileOptions | |
| CZVector< T > | |
| CZVector< ArcIndex > | |
| CZVector< ArcIndexType > | |
| CZVector< CostValue > | |
| CZVector< FlowQuantity > | |
| CZVector< NodeHeight > | |
| CZVector< NodeIndex > | |
| CZVector< NodeIndexType > | |
1.9.1