Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 123456]
 C_GRBsvec
 Coperations_research::AccurateSum< FpNumber >
 Coperations_research::AccurateSum< Fractional >
 Coperations_research::sat::ActivityBoundHelper
 Coperations_research::AdaptiveParameterValue
 Coperations_research::bop::AdaptiveParameterValue
 CAdjustableKAryHeap< Priority, Index, Arity, IsMaxHeap >
 CAdjustableKAryHeap< float, SubsetIndex::ValueType, 2, true >
 CAdjustablePriorityQueue< T, Comp >
 CAdjustablePriorityQueue< BvaPqElement >
 CAdjustablePriorityQueue< Entries >
 CAdjustablePriorityQueue< operations_research::BlossomGraph::Edge, std::greater< operations_research::BlossomGraph::Edge > >
 CAdjustablePriorityQueue< PQElement >
 Coperations_research::sat::AffineExpression
 Coperations_research::AffineRelation
 Coperations_research::internal::AlignedBlock< Value, size, alignment >
 ►Cstd::allocator< T >STL class
 Coperations_research::math_opt::AllSolversRegistry
 Coperations_research::fz::Annotation
 Coperations_research::Arc
 Coperations_research::packing::ArcFlowGraph::Arc
 Coperations_research::packing::ArcFlowGraph
 Coperations_research::ArcFunctorOrderingByTailAndHead< GraphType >
 Coperations_research::ArcIndexOrderingByTailNode< GraphType >
 ►CArcIterator
 Coperations_research::StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::ArcIteratorIterator class for traversing the arcs in the graph
 Coperations_research::ArcWithLength
 Coperations_research::ArcWithLengthAndResources
 Coperations_research::sat::ArcWithLpValue
 Coperations_research::fz::Argument
 Coperations_research::ArgumentHolderArgument Holder: useful when visiting a model
 Coperations_research::math_opt::internal::ArrowOperatorProxy< T >
 Cstrings::AsciiCaseInsensitiveEq
 Cstrings::AsciiCaseInsensitiveHash
 Cstrings::AsciiCaseInsensitiveLess
 Coperations_research::bop::AssignmentAndConstraintFeasibilityMaintainer
 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::sat::AssignmentInfoInformation about a variable assignment
 Coperations_research::sat::AssignmentType
 Coperations_research::sat::AssignmentView
 Coperations_research::math_opt::AtomicConstraintStorage< ConstraintData >
 Coperations_research::math_opt::AtomicConstraintTraits< IdType >
 Coperations_research::math_opt::AtomicConstraintTraits< IndicatorConstraintId >
 Coperations_research::math_opt::AtomicConstraintTraits< QuadraticConstraintId >
 Coperations_research::math_opt::AtomicConstraintTraits< SecondOrderConeConstraintId >
 Coperations_research::math_opt::AtomicConstraintTraits< Sos1ConstraintId >
 Coperations_research::math_opt::AtomicConstraintTraits< Sos2ConstraintId >
 Coperations_research::bop::BacktrackableIntegerSet< IntType >
 Coperations_research::bop::BacktrackableIntegerSet< ConstraintIndex >
 ►Cgtl::BaseDeleter
 ►Coperations_research::sat::BaseEventInternal methods and data structures, useful for testing
 Cutil::BaseGraph< NodeIndexType, ArcIndexType, HasReverseArcs >
 ►Cutil::BaseGraph< int32_t, int32_t, false >
 ►Cutil::BaseGraph< int32_t, int32_t, true >
 ►Coperations_research::BaseKnapsackSolver
 ►Coperations_research::BaseObject
 ►Coperations_research::math_opt::BaseSolver
 Coperations_research::sat::BasicKnapsackSolver
 Coperations_research::math_opt::Basis
 Coperations_research::glop::BasisFactorization
 Coperations_research::glop::BasisState
 Cutil::BeginEndReverseIteratorWrapper< Container >
 Cutil::BeginEndWrapper< Iterator >
 ►Cutil::BeginEndWrapper< IntegerRangeIterator< IntegerType > >
 Coperations_research::sat::ImpliedBoundsProcessor::BestImpliedBoundInfo
 Coperations_research::BidirectionalDijkstra< GraphType, DistanceType >
 Coperations_research::sat::BinaryClauseA binary clause. This is used by BinaryClauseManager
 Coperations_research::sat::BinaryClauseManagerA simple class to manage a set of binary clauses
 Coperations_research::BinaryIndexedTree< T >
 Coperations_research::BinCapacities
 Coperations_research::packing::BinPacking2dParser
 Coperations_research::LinearSumAssignment< GraphType >::BipartiteLeftNodeIterator
 ►Cabsl::BitGenRef
 Coperations_research::Bitmap
 Coperations_research::BitQueue64
 Coperations_research::Bitset64< IndexType >
 Coperations_research::Bitset64< BooleanVariable >
 Coperations_research::Bitset64< ColIndex >
 Coperations_research::Bitset64< ConstraintIndex >
 Coperations_research::Bitset64< Index >
 Coperations_research::Bitset64< int >
 Coperations_research::Bitset64< int64_t >
 Coperations_research::Bitset64< IntegerVariable >
 Coperations_research::Bitset64< LiteralIndex >
 Coperations_research::Bitset64< RowIndex >
 Coperations_research::Bitset64< SatDecisionLevel >
 Coperations_research::sat::BlockedClauseSimplifier
 Coperations_research::BlossomGraph
 Coperations_research::sat::BooleanOrIntegerLiteral
 Coperations_research::sat::BooleanOrIntegerVariable
 Coperations_research::sat::BoolRLTCutHelper
 Coperations_research::sat::BoolVar
 Coperations_research::bop::BopConstraintTerm
 ►Coperations_research::bop::BopOptimizerBase
 Coperations_research::bop::BopSolution
 Coperations_research::bop::BopSolverSolver of Boolean Optimization Problems based on Local Search
 Coperations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >
 Coperations_research::math_opt::BoundedLinearExpressionA LinearExpression with upper and lower bounds
 Coperations_research::math_opt::BoundedQuadraticExpressionA QuadraticExpression with upper and lower bounds
 Coperations_research::sat::BoundedVariableElimination
 Coperations_research::fz::SolutionOutputSpecs::Bounds
 Coperations_research::math_opt::ModelSubset::Bounds
 Coperations_research::sat::PseudoCosts::BranchingInfo
 Coperations_research::math_opt::BranchPrioritiesTestParamsParameters for the BranchPrioritiesTest suite below
 Coperations_research::BronKerboschAlgorithm< NodeIndex >
 Coperations_research::sat::BruteForceResult
 Coperations_research::math_opt::BufferedMessageCallback
 Coperations_research::sat::CachedIntervalData
 Coperations_research::CachedLog
 Coperations_research::sat::CachedTaskBounds
 Coperations_research::math_opt::Gurobi::CallbackContext
 Coperations_research::math_opt::CallbackData
 Coperations_research::CallbackRangeConstraint
 Coperations_research::math_opt::CallbackRegistration
 Coperations_research::math_opt::CallbackResultThe value returned by the Callback function
 Coperations_research::CallbackSetup
 Coperations_research::math_opt::CallbackTestParamsParameters for CallbackTest
 Coperations_research::sat::CanonicalBooleanLinearProblem
 Coperations_research::sat::CapacityProfile
 Coperations_research::CarpParser
 Coperations_research::PathState::ChainA Chain is a range of committed nodes
 Coperations_research::PathState::ChainBounds
 Coperations_research::PathState::ChainRangeA ChainRange is a range of Chains, committed or not
 Coperations_research::ChristofidesPathSolver< CostType, ArcIndex, NodeIndex, CostFunction >
 Coperations_research::sat::ClauseInfo
 Coperations_research::sat::ClauseWithOneMissingHasherClass to help detects clauses that differ on a single literal
 Coperations_research::ClosedInterval
 Coperations_research::glop::DoubletonEqualityRowPreprocessor::RestoreInfo::ColChoiceAndStatus
 Coperations_research::glop::ColumnDeletionHelperHelp preprocessors deal with column deletion
 Coperations_research::glop::ColumnPriorityQueue
 Coperations_research::glop::ColumnsSaver
 Coperations_research::glop::ColumnView
 Coperations_research::sat::ZeroHalfCutHelper::CombinationOfRows
 ►Coperations_research::glop::CompactSparseMatrix
 Coperations_research::glop::CompactSparseMatrixView
 Coperations_research::sat::CompactVectorVector< K, V >
 Coperations_research::sat::CompactVectorVector< int, Arc >
 Coperations_research::sat::CompactVectorVector< int, int >
 Coperations_research::sat::CompactVectorVector< LiteralIndex, int >
 Coperations_research::sat::IndexedInterval::ComparatorByStart
 Coperations_research::sat::IndexedInterval::ComparatorByStartThenEndThenIndex
 Coperations_research::sat::ValueLiteralPair::CompareByLiteral
 Coperations_research::sat::ValueLiteralPair::CompareByValue
 ►Coperations_research::sat::CompiledConstraintView of a generic (non linear) constraint for the LsEvaluator
 Coperations_research::sat::CompoundMoveBuilder
 Coperations_research::math_opt::BaseSolver::ComputeInfeasibleSubsystemArgsArguments used when calling ComputeInfeasibleSubsystem()
 Coperations_research::math_opt::ComputeInfeasibleSubsystemArgumentsArguments passed to ComputeInfeasibleSubsystem() to control the solver
 Coperations_research::math_opt::ComputeInfeasibleSubsystemResult
 Coperations_research::math_opt::ConcurrentCallsGuard
 CConnectedComponentsFinder< T, CompareOrHashT, Eq >
 Cinternal::ConnectedComponentsTypeHelper< T, CompareOrHashT, Eq >
 Cinternal::ConnectedComponentsTypeHelper< T, std::less< T >, void >
 Coperations_research::math_opt::SparseVectorView< T >::const_iterator
 Coperations_research::math_opt::ConstantFormatterStreaming formatter for a constant in a linear/quadratic expression
 Coperations_research::ConstrainedShortestPathsOnDagWrapper< GraphType >
 Coperations_research::fz::Constraint
 Coperations_research::lp_format::Constraint
 ►Coperations_research::sat::Constraint
 Coperations_research::sat::LinearConstraintManager::ConstraintInfo
 Coperations_research::sat::ConstraintPropagationOrder
 Coperations_research::bop::OneFlipConstraintRepairer::ConstraintTerm
 Coperations_research::FlatMatrix< T >::ConstRows
 Coperations_research::FlatMatrix< T >::ConstRowsIterator
 Coperations_research::Bitset64< IndexType >::ConstViewWhen speed matter, caching the base pointer helps
 Coperations_research::glop::CompactSparseMatrix::ConstView
 Coperations_research::sat::ContinuousProber
 Coperations_research::Coordinates2< T >Real-world coordinates
 Coperations_research::Coordinates2< double >
 Coperations_research::Coordinates2< int64_t >
 Coperations_research::Coordinates3< T >
 Coperations_research::Coordinates3< double >
 Coperations_research::sat::CoreBasedOptimizer
 Coperations_research::sat::SatSolver::Counters
 Coperations_research::sat::CoverCutHelperHelper to find knapsack cover cuts
 Coperations_research::sat::CpModelBuilder
 Coperations_research::sat::CpModelMapping
 Coperations_research::sat::CpModelPresolver
 Coperations_research::sat::CpModelProtoWrapperThis implement the implicit contract needed by the SatCnfReader class
 Coperations_research::sat::CpModelView
 Coperations_research::CppBridge
 Coperations_research::CppFlags
 Coperations_research::sat::CpSolverResponseStatisticCallbacks
 Coperations_research::sat::IntervalsRepository::CumulativeHelper
 Coperations_research::CumulBoundsPropagator
 Coperations_research::sat::CutDataOur cut are always of the form linear_expression <= rhs
 Coperations_research::sat::CutDataBuilderStores temporaries used to build or manipulate a CutData
 Coperations_research::sat::CutGenerator
 Coperations_research::sat::CutTerm
 Coperations_research::CVRPToursParserClass parsing tours (solution) data in CVRPlib format
 CCycleTimerBaseConversion routines between CycleTimer::GetCycles and actual times
 Coperations_research::glop::DataWrapper< Data >Data templates
 Coperations_research::glop::DataWrapper< LinearProgram >
 Coperations_research::glop::DataWrapper< MPModelProto >
 Coperations_research::sat::DebugSolution
 Coperations_research::DebugStringFormatterHelper to display a object with a DebugString method in a absl::StrJoin
 Coperations_research::sat::SatSolver::Decision
 Coperations_research::DefaultPhaseParameters
 Coperations_research::sat::DelayedRootLevelDeduction
 CDenseConnectedComponentsFinderA connected components finder that only works on dense ints
 Coperations_research::DenseDoublyLinkedList
 Coperations_research::DenseIntDuplicateRemover
 Cutil::internal::DenseIntTopologicalSorterTpl< stable_sort >
 Cutil::internal::DenseIntTopologicalSorterTpl< false >
 Cutil::internal::DenseIntTopologicalSorterTpl< stable_sort >
 Coperations_research::DenseSet< T, auto_resize >
 Coperations_research::DenseSet< int >
 Coperations_research::LocalSearchState::DependencyGraph::Dependency
 Coperations_research::sat::DFFComposedF2F0
 Coperations_research::pdlp::DiagonalTrustRegionProblem
 Coperations_research::math_opt::AtomicConstraintStorage< ConstraintData >::Diff
 Coperations_research::math_opt::LinearConstraintStorage::Diff
 Coperations_research::math_opt::ObjectiveStorage::Diff
 Coperations_research::math_opt::VariableStorage::Diff
 ►Coperations_research::sat::DiffnBaseEventInternal methods and data structures, useful for testing
 Coperations_research::DimensionChecker
 Coperations_research::DimensionCumulOptimizerCore
 Coperations_research::sat::DiophantineSolution
 Coperations_research::DisabledScopedInstructionCounter
 Coperations_research::DisabledScopedTimeDistributionUpdater
 Coperations_research::DistanceAndParentArc< DistanceType >
 Coperations_research::Domain
 Coperations_research::fz::Domain
 Coperations_research::sat::DomainDeductions
 Coperations_research::Domain::DomainIterator
 Coperations_research::Domain::DomainIteratorBeginEnd
 Coperations_research::Domain::DomainIteratorBeginEndWithOwnership
 Coperations_research::sat::DoubleLinearExpr
 Coperations_research::math_opt::DoubleOptions
 Coperations_research::sat::DratChecker
 Coperations_research::sat::DratProofHandler
 Coperations_research::sat::DratWriter
 Coperations_research::sat::DualBoundStrengthening
 Coperations_research::glop::DualEdgeNorms
 Coperations_research::sat::DualFeasibleFunctionF0
 Coperations_research::math_opt::DualRay
 Coperations_research::math_opt::DualSolution
 Coperations_research::pdlp::internal::DualTrustRegionProblem
 Coperations_research::base::internal_dump_vars::Dump< F >
 CDynamicLibrary
 Coperations_research::glop::DynamicMaximum< Index >
 Coperations_research::glop::DynamicMaximum< ColIndex >
 Coperations_research::glop::DynamicMaximum< RowIndex >
 Coperations_research::DynamicPartition
 Coperations_research::DynamicPermutation
 Coperations_research::BlossomGraph::EdgeAn undirected edge between two nodes: tail <-> head
 Coperations_research::Edge
 Coperations_research::ElementDegreeSolutionGenerator
 Cgtl::ElementDeleter
 Coperations_research::sat::ElementEncodings
 Coperations_research::ElementGetter< T >
 Coperations_research::ElementGetter< DistanceType >
 Coperations_research::ElementIterator< Set >
 Coperations_research::EnabledScopedTimeDistributionUpdater
 Coperations_research::sat::EncodingNode
 Coperations_research::glop::EnteringVariable
 Coperations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::Entry
 Coperations_research::sat::TaskSet::Entry
 ►CEntryType
 Coperations_research::math_opt::Enum< E >
 Cgtl::detail::EnumLogger< E >
 Coperations_research::math_opt::EnumProto< P >
 Cgtl::internal::Equiv< LessFunc >
 Coperations_research::glop::EtaFactorization
 Coperations_research::RoutingSolution::Event
 Coperations_research::sat::ExponentialMovingAverage
 Coperations_research::DimensionChecker::ExtendedInterval
 ►Cstd::false_type
 Coperations_research::math_opt::FeasibilityCheckerOptions
 Coperations_research::sat::FeasibilityPump
 CFile
 CFileLineIteratorImplements the minimum interface for a range-based for loop iterator
 CFileLines
 Coperations_research::LocalSearchFilterManager::FilterEvent
 Coperations_research::FinalizerVariables
 Coperations_research::sat::FindRectanglesResult
 Coperations_research::sat::FirstFewValues< n >
 Coperations_research::sat::FirstFewValues< 10 >
 Coperations_research::sat::FixedCapacityVector< T >
 Coperations_research::sat::FixedCapacityVector< int >
 Coperations_research::sat::FixedCapacityVector< IntegerValue >
 Coperations_research::sat::FixedCapacityVector< IntegerVariable >
 Coperations_research::sat::FixedCapacityVector< operations_research::sat::TaskSet::Entry >
 Coperations_research::sat::FixedCapacityVector< operations_research::sat::TaskTime >
 ►Cabsl::flat_hash_map
 Coperations_research::FlatMatrix< T >NOTE(user): T=bool is not yet supported (the [] operator doesn't work)
 Coperations_research::fz::FlatzincSatParameters
 Coperations_research::Source::FlowArc
 Coperations_research::sat::FullIntegerPrecedence
 Coperations_research::math_opt::CallbackResult::GeneratedLinearConstraint
 Coperations_research::math_opt::GenericTestParameters
 Coperations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters
 Coperations_research::GlobalDimensionCumulOptimizer
 Coperations_research::GLPKInformationClass to store information gathered in the callback
 Coperations_research::math_opt::GlpkParameters
 Coperations_research::math_opt::GlpkRay
 Coperations_research::math_opt::GlpkSparseVector
 Coperations_research::graph_traits< GraphType >
 Coperations_research::graph_traits< ForwardEbertGraph< NodeIndexType, ArcIndexType > >
 Coperations_research::graph_traits< ForwardStaticGraph< NodeIndexType, ArcIndexType > >
 Coperations_research::or_internal::GraphBuilderFromArcs< GraphType, is_dynamic >
 ►Coperations_research::or_internal::GraphBuilderFromArcs< GraphType, graph_traits< GraphType >::is_dynamic >
 Coperations_research::or_internal::GraphBuilderFromArcs< GraphType, true >
 Coperations_research::Graphs< Graph >
 Coperations_research::Graphs< operations_research::StarGraph >
 Coperations_research::GraphSymmetryFinder
 Coperations_research::sat::GreaterThanAtLeastOneOfDetector
 Coperations_research::GreedySolutionGenerator
 Coperations_research::GScipCallbackStats
 Coperations_research::GScipConstraintHandler< ConstraintData >
 ►Coperations_research::GScipConstraintHandler< GScipSolverConstraintData >
 ►Coperations_research::GScipConstraintHandler< void * >
 Coperations_research::GScipConstraintHandlerContext
 Coperations_research::GScipConstraintHandlerProperties
 Coperations_research::GScipCutOptionsOptions passed to SCIP when adding a cut
 Coperations_research::GScipEventHandler
 Coperations_research::GScipEventHandlerContext
 Coperations_research::GScipEventHandlerDescription
 Coperations_research::GScipIndicatorRangeConstraint
 Coperations_research::GScipLazyConstraintOptionsOptions passed to SCIP when adding a lazy constraint
 Coperations_research::GScipLinearExpr
 Coperations_research::math_opt::GScipSolverConstraintData
 Coperations_research::GuidedLocalSearch
 Coperations_research::GuidedTabuSearch
 Coperations_research::math_opt::Gurobi
 Coperations_research::math_opt::GurobiCallbackInput
 Coperations_research::math_opt::GurobiFreeEnv
 Coperations_research::math_opt::GurobiISVKey
 Coperations_research::math_opt::GurobiIsvKey
 Coperations_research::math_opt::GurobiParameters
 Coperations_research::HamiltonianPathSolver< CostType, CostFunction >
 Coperations_research::HamiltonianPathSolver< int64_t, std::vector< std::vector< int64_t > > >
 ►Cgtl::IntType< IntTypeName, _ValueType >::Hasher
 ►Coperations_research::StrongIndex< StrongIndexName >::Hasher
 ►Coperations_research::StrongInt64< StrongIntegerName >::Hasher
 ►Cutil_intops::StrongInt< StrongIntName, _ValueType >::Hasher
 Coperations_research::sat::HittingSetOptimizer
 Coperations_research::HungarianOptimizer
 Coperations_research::sat::IdentityMap< T >
 Coperations_research::math_opt::IdNameBiMap
 Coperations_research::sat::ImpliedBoundEntry
 Coperations_research::sat::ImpliedBounds
 Coperations_research::sat::ImpliedBoundsProcessor
 Coperations_research::sat::InclusionDetector< Storage >
 Coperations_research::EbertGraph< NodeIndexType, ArcIndexType >::IncomingArcIteratorIterator class for traversing the incoming arcs associated to a given node
 Coperations_research::sat::IncrementalAverageManages incremental averages
 ►Coperations_research::math_opt::IncrementalSolver
 Coperations_research::sat::IndexedInterval
 Coperations_research::sat::IndexReferences
 Coperations_research::math_opt::IndicatorConstraint
 Coperations_research::math_opt::IndicatorConstraintData
 Coperations_research::math_opt::InfeasibleSubsystemSupport
 Coperations_research::math_opt::InfeasibleSubsystemTestParameters
 Coperations_research::InitAndGetValues
 Coperations_research::math_opt::SolverInterface::InitArgsInitialization arguments
 Coperations_research::glop::InitialBasis
 Coperations_research::sat::Inprocessing
 Coperations_research::InsertionSequenceContainer::Insertion
 Coperations_research::InsertionSequenceContainer::InsertionSequence
 Coperations_research::InsertionSequenceContainer
 Coperations_research::InsertionSequenceGeneratorGenerates insertion positions respecting structural constraints
 Coperations_research::InsertionSequenceContainer::InsertionSequenceIterator
 Coperations_research::Solver::IntegerCastInfo
 Coperations_research::sat::IntegerEncoder
 Coperations_research::sat::IntegerLiteral
 Coperations_research::IntegerPriorityQueue< Element, Compare >
 Coperations_research::IntegerPriorityQueue< VariableWithPriority >
 Coperations_research::IntegerPriorityQueue< WeightedVarQueueElement >
 Coperations_research::sat::IntegerRoundingCutHelper
 Coperations_research::sat::IntegerSearchHelperAn helper class to share the code used by the different kind of search
 Coperations_research::bop::IntegralSolver
 Coperations_research::IntersectingSubsetsIterator
 Coperations_research::DimensionChecker::Interval
 Coperations_research::sat::ItemForPairwiseRestriction::Interval
 Coperations_research::SortedDisjointIntervalList::IntervalComparator
 Coperations_research::sat::IntervalsRepository
 Coperations_research::sat::IntervalVar
 Coperations_research::IntTupleSet--— Main IntTupleSet class --—
 Cgtl::IntType< IntTypeName, _ValueType >
 Coperations_research::sat::IntVar
 ►Coperations_research::IntVarFilteredHeuristicGeneric filter-based heuristic applied to IntVars
 Coperations_research::math_opt::InvalidIndicators
 Coperations_research::math_opt::InvalidInputTestParameters
 Coperations_research::math_opt::InvalidParameterTestParams
 Coperations_research::math_opt::InvertedBounds
 Coperations_research::math_opt::IpMultipleSolutionsTestParams
 Coperations_research::math_opt::IpParameterTestParameters
 Ctesting::status::internal::IsOkAndHoldsMatcher< InnerMatcher >Implements IsOkAndHolds(m) as a polymorphic matcher
 Ctesting::status::internal::IsOkMatcherImplements IsOk() as a polymorphic matcher
 Coperations_research::sat::OrthogonalPackingResult::Item
 Coperations_research::sat::ItemForPairwiseRestriction
 Coperations_research::DynamicPartition::IterablePart
 Coperations_research::pdlp::IterationCallbackInfo
 Coperations_research::PathOperator::IterationParametersSet of parameters used to configure how the neighnorhood is traversed
 Coperations_research::Bitset64< IndexType >::Iterator
 Coperations_research::InitAndGetValues::Iterator
 Coperations_research::PathState::Chain::Iterator
 Coperations_research::PathState::ChainRange::Iterator
 Coperations_research::PathState::NodeRange::Iterator
 Coperations_research::SimpleRevFIFO< T >::IteratorThis iterator is not stable with respect to deletion
 Coperations_research::SparsePermutation::Iterator
 Cutil::MutableVectorIteration< T >::Iterator
 ►Cstd::iterator
 Coperations_research::math_opt::iterator_range< IteratorT >
 Coperations_research::scheduling::jssp::JsspParser
 Coperations_research::sat::JumpTable
 Coperations_research::KnapsackAssignment
 Coperations_research::KnapsackItem
 Coperations_research::KnapsackItemWithEfficiency
 ►Coperations_research::KnapsackPropagator
 Coperations_research::KnapsackSearchNode
 Coperations_research::KnapsackSearchPath
 Coperations_research::KnapsackSolver
 Coperations_research::KnapsackState
 Coperations_research::KShortestPaths
 Coperations_research::KShortestPathsOnDagWrapper< GraphType >
 Coperations_research::pdlp::LagrangianPart
 Coperations_research::math_opt::LargeInstanceTestParams
 Coperations_research::LatticeMemoryManager< Set, CostType >
 Coperations_research::LatticeMemoryManager< operations_research::Set, CostType >
 Coperations_research::LatticeMemoryManager< operations_research::Set, int64_t >
 Coperations_research::math_opt::LazyConstraintsTestParamsParameters for the LazyConstraintsTest suite below
 Coperations_research::LazyMutableCopy< T >
 ►Coperations_research::sat::LazyReasonInterface
 Coperations_research::sat::LbTreeSearch
 Coperations_research::math_opt::LeadingCoefficientFormatter
 Coperations_research::bop::LearnedInfo
 Coperations_research::sat::LevelZeroCallbackHelper
 Coperations_research::fz::LexerInfo
 Coperations_research::LiLimParserLi&Lim parser class
 Coperations_research::sat::LinearBooleanProblemWrapperThis implement the implicit contract needed by the SatCnfReader class
 Coperations_research::math_opt::LinearConstraint
 Coperations_research::sat::LinearConstraint
 Coperations_research::sat::LinearConstraintBuilder
 Coperations_research::sat::LinearConstraintManager
 Coperations_research::math_opt::LinearConstraintStorage
 Coperations_research::LinearExpr
 Coperations_research::sat::LinearExpr
 Coperations_research::math_opt::LinearExpression
 Coperations_research::sat::LinearExpression
 Coperations_research::math_opt::LinearExpressionData
 Coperations_research::sat::LinearIncrementalEvaluator
 Coperations_research::sat::LinearModel
 Coperations_research::glop::LinearProgram
 Coperations_research::LinearRange
 Coperations_research::sat::LinearRelaxation
 Coperations_research::LinearSumAssignment< GraphType >This class does not take ownership of its underlying graph
 Coperations_research::math_opt::LinearTermA term in an sum of variables multiplied by coefficients
 Coperations_research::sat::LinearTerm
 Cgtl::linked_hash_map< Key, Value, KeyHash, KeyEq, Alloc >
 Cgtl::linked_hash_map< int64_t, int >
 Cgtl::linked_hash_map< int64_t, int64_t >
 Cgtl::linked_hash_map< int64_t, SCIP_VAR * >
 Cgtl::linked_hash_map< int64_t, std::string >
 Cgtl::linked_hash_map< LinearConstraintId, LinearConstraintData >
 Cgtl::linked_hash_map< operations_research::Arc, int64_t >
 Cgtl::linked_hash_map< operations_research::Edge, int64_t >
 Cgtl::linked_hash_map< std::string, std::string >
 Cgtl::linked_hash_map< VariableId, GurobiVariableIndex >
 Coperations_research::sat::Literal
 Coperations_research::sat::LiteralValueValue
 Coperations_research::sat::LiteralWithCoeffRepresents a term in a pseudo-Boolean formula
 Coperations_research::BinCapacities::LoadLimit
 Coperations_research::LocalDimensionCumulOptimizer
 Coperations_research::pdlp::LocalizedLagrangianBounds
 Coperations_research::bop::LocalSearchAssignmentIterator
 Coperations_research::LocalSearchOperatorState
 Coperations_research::LocalSearchState
 Coperations_research::LocationContainer
 ►Cgtl::internal::LogBase
 Coperations_research::math_opt::LogicalConstraintTestParameters
 Coperations_research::math_opt::LowerBoundedLinearExpressionA LinearExpression with a lower bound
 Coperations_research::math_opt::LowerBoundedQuadraticExpressionA QuadraticExpression with a lower bound
 CLowerPriorityThan< T, Comparator >
 Coperations_research::glop::LPDecomposer
 Coperations_research::math_opt::LpIncompleteSolveTestParamsParameters for the LpIncompleteSolveTest suite below
 Coperations_research::lp_format::LpModel
 Coperations_research::math_opt::LpModelSolveParametersTestParameters
 Coperations_research::math_opt::LpParameterTestParamsParameters for the LpParameterTest suite below
 Coperations_research::glop::LpScalingHelper
 Coperations_research::glop::LPSolverA full-fledged linear programming solver
 Coperations_research::sat::LsCounters
 Coperations_research::sat::LsEvaluator
 Coperations_research::sat::LsOptionsThe parameters used by the local search code
 Coperations_research::sat::LsState
 Coperations_research::bop::LubyAdaptiveParameterValue
 Coperations_research::glop::LuFactorization
 ►Cstd::make_unsigned
 Coperations_research::math_opt::MapFilter< KeyType >
 Coperations_research::math_opt::MapFilter< operations_research::math_opt::LinearConstraint >
 Coperations_research::math_opt::MapFilter< operations_research::math_opt::QuadraticConstraint >
 Coperations_research::math_opt::MapFilter< operations_research::math_opt::Variable >
 Coperations_research::glop::Markowitz
 ►Ctesting::MatcherInterface
 CMathOptInterrupter
 Coperations_research::MathUtil
 Coperations_research::glop::MatrixEntryHolds a triplet (row, col, coefficient)
 Coperations_research::glop::MatrixNonZeroPattern
 Coperations_research::MatrixOrFunction< ScalarType, Evaluator, square >
 Coperations_research::MatrixOrFunction< CostType, CostFunction, true >
 Coperations_research::MatrixOrFunction< int64_t, std::vector< std::vector< int64_t > >, true >
 Coperations_research::MatrixOrFunction< ScalarType, std::vector< std::vector< ScalarType > >, square >Specialization for vector-based matrices
 Coperations_research::glop::MatrixView
 Coperations_research::sat::MaxBoundedSubsetSum
 ►Coperations_research::MaxFlowStatusClass
 Coperations_research::MbLogCallbackSimple director class for C#
 Coperations_research::MergingPartition
 Coperations_research::math_opt::MessageCallbackData
 Coperations_research::math_opt::MessageCallbackTestParamsParameters for the MessageCallbackTest suite below
 ►Coperations_research::MinCostFlowBase
 Coperations_research::MinCostPerfectMatching
 Coperations_research::fz::Model
 Coperations_research::math_opt::Model
 Coperations_research::sat::Model
 Coperations_research::ModelBuilderHelper
 Coperations_research::ModelCache
 Coperations_research::sat::ModelCopy
 Coperations_research::math_opt::ModelRanges
 Coperations_research::math_opt::ModelSolveParameters
 Coperations_research::ModelSolverHelper
 Coperations_research::fz::ModelStatistics
 Coperations_research::math_opt::ModelSubset
 Coperations_research::math_opt::ModelSummary
 Coperations_research::MonoidOperationTree< T >
 Coperations_research::math_opt::MoveVariablesToTheirBestFeasibleValueOptionsOptions for MoveVariablesToTheirBestFeasibleValue
 ►Coperations_research::MPCallback
 ►Coperations_research::MPCallbackContext
 Coperations_research::MPCallbackWrapperWraps the MPCallback in order to catch and store exceptions
 Coperations_research::MPConstraint
 Coperations_research::MPModelExportOptionsExport options
 Coperations_research::MPObjectiveA class to express a linear objective
 Coperations_research::MPSolver
 ►Coperations_research::MPSolverInterface
 Coperations_research::MPSolverParameters
 CMPSReaderTemplate< DataWrapper >
 Coperations_research::MPVariableThe class for variables of a Mathematical Programming (MP) model
 Coperations_research::math_opt::MultiObjectiveTestParameters
 Coperations_research::sat::MutableUpperBoundedLinearConstraint
 Cutil::MutableVectorIteration< T >Allow iterating over a vector<T> as a mutable vector<T*>
 Coperations_research::NearestNeighbors--— Lin Kernighan --—
 Coperations_research::NearpParser
 Coperations_research::NeighborAcceptanceCriterionNeighbor acceptance criterion interface
 Coperations_research::sat::NeighborhoodNeighborhood returned by Neighborhood generators
 ►Coperations_research::bop::NeighborhoodGenerator
 ►Coperations_research::sat::NeighborhoodGeneratorBase class for a CpModelProto neighborhood generator
 Coperations_research::NestedTimeLimit
 Coperations_research::BlossomGraph::Node
 Coperations_research::BidirectionalDijkstra< GraphType, DistanceType >::NodeDistance
 Coperations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue
 Coperations_research::CheapestInsertionFilteredHeuristic::NodeInsertion
 Coperations_research::StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::NodeIteratorIterator class for traversing all the nodes in the graph
 Coperations_research::PathState::NodeRange
 Coperations_research::bop::NonOrderedSetHasher< IntType >
 Coperations_research::bop::NonOrderedSetHasher< ConstraintIndexWithDirection >
 ►Coperations_research::math_opt::NonStreamableSolverInitArguments
 Coperations_research::math_opt::NonStreamableSolverInitArgumentsValue
 Coperations_research::math_opt::NontrivialInfeasibleIp
 Cstd::numeric_limits< operations_research::StrongIndex< Tag > >
 Cstd::numeric_limits< operations_research::StrongInt64< Tag > >
 Coperations_research::math_opt::Objective
 Coperations_research::math_opt::ObjectiveBoundsBounds on the optimal objective value
 Coperations_research::sat::ObjectiveDefinition
 Coperations_research::sat::ObjectiveEncoder
 Coperations_research::math_opt::ModelSolveParameters::ObjectiveParametersParameters for an individual objective in a multi-objective model
 Coperations_research::math_opt::ObjectiveStorageIn memory representation of the objective of an optimization model
 Coperations_research::bop::OneFlipConstraintRepairer
 Coperations_research::sat::OpbReader
 ►Cutil::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
 ►Cutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
 ►Cutil::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
 Coperations_research::bop::OptimizerSelector
 Coptional
 Coperations_research::sat::CircuitPropagator::Options
 Coperations_research::sat::OrthogonalPackingInfeasibilityDetector
 Coperations_research::sat::OrthogonalPackingOptions
 Coperations_research::sat::OrthogonalPackingResult
 Coperations_research::OrToolsVersion
 Coperations_research::StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::OutgoingArcIteratorIterator class for traversing the outgoing arcs associated to a given node
 Cutil::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
 Cutil::ListGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
 Cutil::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
 Cutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
 Cutil::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
 Cutil::StaticGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
 Cutil::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
 Cutil::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
 Coperations_research::EbertGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator
 Cutil::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator
 Cutil::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator
 Cutil::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator
 Coperations_research::sat::PairwiseRestriction
 Coperations_research::math_opt::ParameterSupport
 Coperations_research::math_opt::ParamName
 Coperations_research::fz::ParserContextThis is the context used during parsing
 Coperations_research::BidirectionalDijkstra< GraphType, DistanceType >::Path
 Coperations_research::PathContainer
 Coperations_research::PathContainerImpl
 Coperations_research::PathEnergyCostChecker
 Coperations_research::Solver::PathEnergyCostConstraintSpecification
 Coperations_research::PathState
 Coperations_research::PathWithLength
 Coperations_research::internal::PathWithPriority
 Coperations_research::sat::PbConstraintsEnqueueHelper
 Coperations_research::math_opt::PdlpBridge
 Coperations_research::PdTspParser
 Coperations_research::sat::Percentile
 Coperations_research::sat::PermutableEvent
 Coperations_research::sat::PermutableItem
 Coperations_research::glop::Permutation< IndexType >
 Coperations_research::glop::Permutation< ColIndex >
 Coperations_research::glop::Permutation< RowIndex >
 Coperations_research::PermutationApplier< IndexType >
 ►Coperations_research::PermutationCycleHandler< IndexType >
 ►Coperations_research::PermutationCycleHandler< ArcIndexType >
 Coperations_research::PermutationIndexComparisonByArcHead< NodeIndexType, ArcIndexType >
 Coperations_research::PickupAndDeliveryDataA utility class to maintain pickup and delivery information of nodes
 Coperations_research::PickupDeliveryInsertion
 Coperations_research::PickupDeliveryPair
 Coperations_research::PiecewiseLinearFunction
 Coperations_research::PiecewiseSegment
 Coperations_research::sat::PostsolveClauses
 Coperations_research::sat::PrecedenceRelations::PrecedenceData
 ►Coperations_research::glop::Preprocessor
 Coperations_research::Preprocessor
 Coperations_research::sat::PresolveContext
 Coperations_research::fz::Presolver
 Coperations_research::sat::PresolveTimer
 Coperations_research::pdlp::PrimalAndDualSolution
 Coperations_research::glop::PrimalEdgeNorms
 Coperations_research::glop::PrimalPrices
 Coperations_research::math_opt::PrimalRay
 Coperations_research::math_opt::PrimalSolution
 Coperations_research::pdlp::internal::PrimalTrustRegionProblem
 Coperations_research::base::internal_dump_vars::print_fields
 Coperations_research::PriorityQueueWithRestrictedPush< Element, IntegerPriority >
 Coperations_research::PriorityQueueWithRestrictedPush< NodeIndex, NodeHeight >
 Coperations_research::sat::Prober
 Coperations_research::sat::ProbingOptions
 Coperations_research::sat::ProbingRectangle
 Coperations_research::glop::ProblemSolutionContains the solution of a LinearProgram as returned by a preprocessor
 Coperations_research::bop::ProblemState
 Coperations_research::math_opt::ProblemStatus
 Coperations_research::sat::ProductDecomposerHelper class to express a product as a linear constraint
 Coperations_research::sat::ProductDetector
 Coperations_research::sat::SchedulingConstraintHelper::ProfileEvent
 Coperations_research::sat::PropagationGraph
 Coperations_research::sat::PropagationStatisticsSimple class to display statistics at the end if –v=1
 ►Coperations_research::sat::PropagatorInterfaceBase class for CP like propagators
 Ctesting::internal::ProtoComparisonOptions for comparing two protobufs
 Coperations_research::sat::ProtoLiteral
 Ctesting::internal::ProtoMatcher
 Coperations_research::sat::ProtoTrail
 Coperations_research::PruningHamiltonianSolver< CostType, CostFunction >
 Coperations_research::sat::PseudoCosts
 Coperations_research::QapProblem
 Coperations_research::math_opt::QcTestParameters
 Coperations_research::math_opt::QpTestParameters
 Coperations_research::math_opt::QuadraticConstraint
 Coperations_research::math_opt::QuadraticConstraintData
 Coperations_research::math_opt::QuadraticExpression
 Coperations_research::pdlp::QuadraticProgram
 Coperations_research::pdlp::QuadraticProgramBoundNorms
 Coperations_research::math_opt::QuadraticTerm
 Coperations_research::math_opt::QuadraticTermKey
 Coperations_research::Queue
 Coperations_research::sat::QuickSmallDivision
 Coperations_research::glop::RandomAccessSparseColumn
 Coperations_research::RandomDemandRandom demand
 Coperations_research::RandomSolutionGenerator
 Coperations_research::RangeIntToIntFunction
 Cgtl::detail::RangeLogger< IteratorT, PolicyT >
 Coperations_research::RangeMinimumIndexQuery< T, Compare >
 Coperations_research::RangeMinimumQuery< T, Compare >
 Coperations_research::RangeMinimumQuery< int, IndexComparator >
 Coperations_research::RangeMinMaxIndexFunction
 Coperations_research::glop::RankOneUpdateElementaryMatrix
 Coperations_research::glop::RankOneUpdateFactorization
 Coperations_research::scheduling::rcpsp::RcpspParser
 Coperations_research::sat::PbConstraintsEnqueueHelper::ReasonInfo
 Coperations_research::internal::AllocatorWithAlignment< T, alignment_bytes, misalignment_bytes >::rebind< U >
 Crecordio::RecordReader
 Crecordio::RecordWriter
 Coperations_research::sat::CapacityProfile::Rectangle
 Coperations_research::sat::Rectangle
 Coperations_research::sat::RectangleInRange
 Coperations_research::glop::ReducedCosts
 Coperations_research::sat::ReducedDomainNeighborhood
 CRegisteredMemFile
 CRegisteredMutableMemFile
 Coperations_research::AffineRelation::Relation
 Coperations_research::pdlp::RelativeConvergenceInformation
 Coperations_research::internal::ReleaseSCIPMessageHandler
 Coperations_research::pdlp::RescalingOptions
 Coperations_research::sat::RestartPolicyContain the logic to decide when to restart a SAT tree search
 Coperations_research::sat::BasicKnapsackSolver::Result
 ►Coperations_research::Rev< T >
 ►Coperations_research::Rev< int >
 Coperations_research::Rev< uint64_t >
 ►Coperations_research::RevArray< T >
 Coperations_research::RevArray< uint64_t >
 ►Coperations_research::RevBitSet
 Cgtl::ReverseView< Container >
 ►Coperations_research::ReversibleInterface
 Coperations_research::RevGrowingArray< T, C >
 Coperations_research::RevImmutableMultiMap< K, V >
 Coperations_research::RevIntSet< T >
 Coperations_research::RevIntSet< int >
 Coperations_research::glop::RevisedSimplexEntry point of the revised simplex algorithm implementation
 Coperations_research::glop::RevisedSimplexDictionary
 Coperations_research::RevPartialSequence--— RevPartialSequence --—
 Coperations_research::RevSwitchA reversible switch that can switch once from false to true
 Coperations_research::RootedTree< NodeType >
 Coperations_research::sat::RoundingDualFeasibleFunction
 Coperations_research::sat::RoundingDualFeasibleFunctionPowerOfTwoSame as above for k = 2^log2_k
 Coperations_research::sat::RoundingOptions
 Coperations_research::RoundTripDoubleFormat
 Coperations_research::RoutingIndexManager
 ►Coperations_research::RoutingLinearSolverWrapper
 Coperations_research::RoutingSolution
 Coperations_research::glop::RowDeletionHelperHelp preprocessors deal with row deletion
 ►Coperations_research::RuinProcedureRuin interface
 Coperations_research::RunningAverage
 Coperations_research::RunningMax< Number >
 Coperations_research::RunningMax< int64_t >
 Coperations_research::sat::SatClause
 Coperations_research::sat::SatCnfReader
 Coperations_research::sat::SatDecisionPolicy
 Coperations_research::sat::SatPostsolver
 Coperations_research::sat::SatPresolveOptions
 Coperations_research::sat::SatPresolver
 ►Coperations_research::sat::SatPropagatorBase class for all the SAT constraints
 Coperations_research::sat::SatSolver
 Coperations_research::bop::SatWrapper
 Coperations_research::sat::SavedLiteral
 Coperations_research::sat::SavedVariable
 Coperations_research::SavingsFilteredHeuristic::Saving
 Coperations_research::SavingsFilteredHeuristic::SavingsContainer< S >
 Coperations_research::SavingsFilteredHeuristic::SavingsContainer< operations_research::SavingsFilteredHeuristic::Saving >
 Coperations_research::SavingsFilteredHeuristic::SavingsParameters
 Coperations_research::pdlp::ScalingVectors
 Coperations_research::sat::ScatteredIntegerVector
 Coperations_research::glop::ScatteredVector< Index, Iterator >
 ►Coperations_research::glop::ScatteredVector< ColIndex, ScatteredRowIterator >
 ►Coperations_research::glop::ScatteredVector< RowIndex, ScatteredColumnIterator >
 Coperations_research::glop::ScatteredVectorEntry< IndexType >
 ►Coperations_research::glop::ScatteredVectorEntry< ColIndex >
 ►Coperations_research::glop::ScatteredVectorEntry< RowIndex >
 CSccCounterOutput< NodeIndex >
 Coperations_research::sat::SccGraph
 Coperations_research::pdlp::SchedulerThread scheduling interface
 Coperations_research::sat::SchedulingDemandHelper
 CSCIP_ConsData
 CSCIP_ConshdlrData
 CSCIP_EventhdlrData
 CSCIP_MessagehdlrDataThis is an incomplete SCIP struct meant to be fully defined by SCIP users
 Coperations_research::ScipCallbackConstraintOptions
 ►Coperations_research::internal::ScipCallbackRunner
 Coperations_research::ScipConstraintHandler< Constraint >
 Coperations_research::ScipConstraintHandler< ConstraintData >
 ►Coperations_research::ScipConstraintHandler< EmptyStruct >
 Coperations_research::ScipConstraintHandlerContext
 Coperations_research::ScipConstraintHandlerDescription
 Coperations_research::ScopedFloatingPointEnv
 Coperations_research::ScopedLocale
 Coperations_research::internal::ScopedSCIPMessageHandlerDisabler
 Coperations_research::ScopedSolveInterrupterCallback
 CScopedWallTime
 Coperations_research::Search---------------— Search class --------------—
 Coperations_research::sat::SearchHeuristics
 Coperations_research::Solver::SearchLogParametersCreates a search monitor from logging parameters
 Coperations_research::math_opt::SecondOrderConeConstraint
 Coperations_research::math_opt::SecondOrderConeConstraintData
 Coperations_research::math_opt::SecondOrderConeTestParameters
 Coperations_research::CheapestInsertionFilteredHeuristic::Seed
 Coperations_research::CheapestInsertionFilteredHeuristic::SeedQueueClang-format off
 Cinternal::ConnectedComponentsTypeHelper< T, CompareOrHashT, Eq >::SelectContainer< U, V, E >
 Cinternal::ConnectedComponentsTypeHelper< 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 > > >Specialization for when U is a hash functor and Eq is provided (not void)
 Cinternal::ConnectedComponentsTypeHelper< 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 > > >
 Coperations_research::ServiceTimePlusTransitionService time (proportional to demand) + transition time callback
 Coperations_research::Set< Integer >
 Coperations_research::SetCoverDecisionA helper class used to store the decisions made during a search
 Coperations_research::SetCoverInvariant
 Coperations_research::SetCoverLagrangian
 Coperations_research::SetCoverMip
 Coperations_research::SetCoverModelMain class for describing a weighted set-covering problem
 Coperations_research::SetCoverReader
 Coperations_research::SetRangeIterator< SetRange >
 Coperations_research::SetRangeWithCardinality< Set >
 Coperations_research::pdlp::Sharder::Shard
 Coperations_research::pdlp::ShardedQuadraticProgram
 Coperations_research::pdlp::ShardedWeightedAverage
 Coperations_research::pdlp::Sharder
 Coperations_research::sat::SharedBoundsManager
 Coperations_research::sat::SharedClasses
 Coperations_research::sat::SharedClausesManager
 Coperations_research::sat::SharedIncompleteSolutionManager
 Coperations_research::sat::SharedLsStatesShared set of local search states that we work on
 Coperations_research::sat::SharedResponseManager
 Coperations_research::sat::SharedSolutionRepository< ValueType >
 ►Coperations_research::sat::SharedSolutionRepository< double >
 Coperations_research::sat::SharedSolutionRepository< int64_t >
 Coperations_research::sat::SharedStatisticsSimple class to add statistics by name and print them at the end
 Coperations_research::sat::SharedStatTablesContains the table we display after the solver is done
 ►Coperations_research::SharedTimeLimitWrapper around TimeLimit to make it thread safe and add Stop() support
 Coperations_research::sat::SharedTreeManager
 Coperations_research::sat::SharedTreeWorker
 Coperations_research::ShortestPathsOnDagWrapper< GraphType >
 Coperations_research::SigintHandler
 Coperations_research::SimpleDynamicPartition
 Coperations_research::SimpleLinearSumAssignment
 Coperations_research::math_opt::SimpleLpTestParameters
 Coperations_research::SimpleMaxFlow
 Coperations_research::math_opt::SimpleMipTestParameters
 Coperations_research::SimpleRevFIFO< T >
 Coperations_research::SimpleRevFIFO< bool >
 Coperations_research::SimpleRevFIFO< operations_research::Decision * >
 Coperations_research::SimpleRevFIFO< operations_research::Demon * >
 Coperations_research::SimpleRevFIFO< operations_research::IntVar * >
 Coperations_research::SimpleTimeWindow< T >
 Coperations_research::SimpleTimeWindow< double >
 Coperations_research::SimpleTimeWindow< int64_t >
 Coperations_research::math_opt::ObjectiveStorage::Diff::SingleObjective
 Coperations_research::glop::SingletonUndoStores the information needed to undo a singleton row/column deletion
 Coperations_research::pdlp::SingularValueAndIterations
 Coperations_research::SlopeAndYInterceptStructure to store the slope and y_intercept of a segment
 Coperations_research::SmallRevBitSet
 Coperations_research::SolomonParserSolomon parser class
 Coperations_research::math_opt::Solution
 Coperations_research::sat::SharedSolutionRepository< ValueType >::SolutionThe solution format used by this class
 Coperations_research::SolutionCollector::SolutionData
 Coperations_research::math_opt::ModelSolveParameters::SolutionHint
 Coperations_research::math_opt::SolutionHintTestParamsParameters for the MipSolutionHintTest suite below
 Coperations_research::math_opt::SolutionMatcherOptionsOptions for IsNear(Solution)
 Coperations_research::fz::SolutionOutputSpecs
 Coperations_research::math_opt::BaseSolver::SolveArgsArguments used when calling Solve() to solve the problem
 Coperations_research::math_opt::SolveArguments
 Coperations_research::sat::NeighborhoodGenerator::SolveDataAdds solve data about one "solved" neighborhood
 Coperations_research::math_opt::SolvedModel
 Coperations_research::SolveInterrupter
 Coperations_research::math_opt::SolveParameters
 Coperations_research::SolverFor the time being, Solver is neither MT_SAFE nor MT_HOT
 Coperations_research::math_opt::SolveResultMatcherOptionsConfigures SolveResult matcher IsConsistentWith() below
 Coperations_research::math_opt::SolveResultSupport
 Coperations_research::math_opt::SolverInitArguments
 ►Coperations_research::math_opt::SolverInterface
 Coperations_research::SolverLogger
 Coperations_research::math_opt::SolverResources
 Coperations_research::pdlp::SolverResult
 Coperations_research::math_opt::SolveStats
 Coperations_research::SortedDisjointIntervalList
 Coperations_research::math_opt::Sos1Constraint
 Coperations_research::math_opt::Sos2Constraint
 Coperations_research::math_opt::internal::SosConstraintData< ConstraintId >
 Cabsl::SourceLocation
 Coperations_research::SparseBitset< IntegerType >
 Coperations_research::SparseBitset< BooleanVariable >
 Coperations_research::SparseBitset< ConstraintIndex >
 Coperations_research::SparseBitset< Index >
 Coperations_research::SparseBitset< int >
 Coperations_research::SparseBitset< int64_t >
 Coperations_research::SparseBitset< IntegerVariable >
 Coperations_research::SparseBitset< LiteralIndex >
 Coperations_research::SparseBitset< SatDecisionLevel >
 Coperations_research::math_opt::SparseCoefficientMap
 Coperations_research::math_opt::Gurobi::SparseMat
 Coperations_research::glop::SparseMatrix
 Coperations_research::math_opt::SparseMatrix< RowId, ColumnId >
 Coperations_research::math_opt::SparseMatrix< LinearConstraintId, VariableId >
 Coperations_research::glop::SparseMatrixScaler
 Coperations_research::glop::SparseMatrixWithReusableColumnMemory
 Coperations_research::SparsePermutation
 Coperations_research::math_opt::SparseSymmetricMatrix
 Coperations_research::glop::SparseVector< IndexType, IteratorType >
 Coperations_research::math_opt::SparseVector< T >
 ►Coperations_research::glop::SparseVector< ColIndex, SparseRowIterator >
 ►Coperations_research::glop::SparseVector< RowIndex, SparseColumnIterator >
 Coperations_research::glop::SparseVectorEntry< IndexType >
 ►Coperations_research::glop::SparseVectorEntry< ColIndex >
 ►Coperations_research::glop::SparseVectorEntry< RowIndex >
 Coperations_research::math_opt::SparseVectorFilterPredicate
 Coperations_research::math_opt::SparseVectorView< T >
 Coperations_research::sat::StampingSimplifier
 ►Coperations_research::StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >
 ►Coperations_research::StarGraphBase< NodeIndexType, ArcIndexType, EbertGraph< NodeIndexType, ArcIndexType > >
 ►Coperations_research::StarGraphBase< NodeIndexType, ArcIndexType, ForwardEbertGraph< NodeIndexType, ArcIndexType > >
 ►Coperations_research::StarGraphBase< NodeIndexType, ArcIndexType, ForwardStaticGraph< NodeIndexType, ArcIndexType > >
 Coperations_research::CheapestInsertionFilteredHeuristic::StartEndValue
 ►Coperations_research::StatBase class for a statistic that can be pretty-printed
 Coperations_research::sat::VariablesShavingSolver::State
 Coperations_research::StateInfo---------------— StateMarker / StateInfo struct --------—
 Coperations_research::StateMarker
 Coperations_research::SetCoverModel::Stats
 Coperations_research::StatsGroupBase class to print a nice summary of a group of statistics
 Coperations_research::glop::Status
 Cutil::StatusBuilder
 Ctesting::status::internal::StatusIsMatcherImplements StatusIs() as a polymorphic matcher
 Ctesting::status::internal::StatusIsMatcherCommonImpl
 Coperations_research::math_opt::StatusTestParameters
 Coperations_research::SteepestSearch
 Cgtl::STLElementDeleter< STLContainer >
 Cgtl::STLValueDeleter< STLContainer >
 Coperations_research::StopServiceTimePlusTransitionStop service time + transition time callback
 Coperations_research::math_opt::StreamableCpSatInitArgumentsStreamable CpSat specific parameters for solver instantiation
 Coperations_research::math_opt::StreamableGlopInitArgumentsStreamable Glop specific parameters for solver instantiation
 Coperations_research::math_opt::StreamableGlpkInitArgumentsStreamable Glpk specific parameters for solver instantiation
 Coperations_research::math_opt::StreamableGScipInitArgumentsStreamable GScip specific parameters for solver instantiation
 Coperations_research::math_opt::StreamableGurobiInitArgumentsStreamable Gurobi specific parameters for solver instantiation
 Coperations_research::math_opt::StreamablePdlpInitArgumentsStreamable Pdlp specific parameters for solver instantiation
 Coperations_research::math_opt::StreamableSolverInitArguments
 Coperations_research::glop::StrictITISpan< IntType, T >
 Coperations_research::StrongIndex< StrongIndexName >
 Cutil_intops::StrongInt< StrongIntName, _ValueType >
 Coperations_research::StrongInt64< StrongIntegerName >
 Cutil_intops::StrongIntRange< IntType >
 Cutil_intops::StrongIntRange< IntType >::StrongIntRangeIteratorIterator over the indices
 CStronglyConnectedComponentsFinder< NodeIndex, Graph, SccOutput >
 CStronglyConnectedComponentsFinder< int, std::vector< operations_research::DenseSet< int > >, SccOutput >
 CStronglyConnectedComponentsFinder< int, std::vector< std::vector< int > >, std::vector< std::vector< int > > >
 Coperations_research::SubDagComputer
 Coperations_research::SubsetIndexWithPriorityPriority aggregate for the subset priority queue
 ►Coperations_research::sat::SubSolver
 Coperations_research::sat::SubsolverNameFilterSimple class used to filter executed subsolver names
 Coperations_research::sat::SumOfAllDiffLowerBounderUtility class for the AllDiff cut generator
 Coperations_research::glop::SumWithOneMissing< supported_infinity_is_positive >
 Coperations_research::math_opt::SupportedProblemStructures
 Cutil::SVector< T >Forward declaration
 Cutil::SVector< int32_t >
 Coperations_research::SweepArranger
 ►CT
 Coperations_research::TabuList< T >
 Coperations_research::TabuList< SubsetIndex >
 Coperations_research::or_internal::TailArrayBuilder< GraphType, has_reverse_arcs >
 Coperations_research::or_internal::TailArrayBuilder< GraphType, false >
 Coperations_research::TailArrayManager< GraphType >
 Coperations_research::or_internal::TailArrayReleaser< GraphType, has_reverse_arcs >
 Coperations_research::or_internal::TailArrayReleaser< GraphType, false >
 Coperations_research::sat::TaskSet
 Coperations_research::sat::TaskTime
 CTempPath
 Coperations_research::math_opt::TerminationAll information regarding why a call to Solve() terminated
 Coperations_research::pdlp::TerminationReasonAndPointType
 ►Ctesting::TestWithParam
 Coperations_research::sat::ThetaLambdaTree< IntegerType >
 Coperations_research::sat::ThetaLambdaTree< IntegerValue >
 Coperations_research::ThreadPool
 Coperations_research::TimeLimit
 Coperations_research::math_opt::TimeLimitTestParameters
 Coperations_research::gtl::TopN< T, Cmp >
 Coperations_research::sat::TopN< Element, Score >
 Coperations_research::sat::TopN< CutCandidate, double >
 Coperations_research::sat::TopNCuts
 ►Cutil::TopologicalSorter< T, stable_sort, Hash, KeyEqual >
 Cutil::TopologicalSorter< 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 >
 Coperations_research::internal::ToUInt< double >
 Coperations_research::internal::ToUInt< float >
 Coperations_research::math_opt::ConcurrentCallsGuard::TrackerTracker for pending calls
 Coperations_research::sat::Trail
 Coperations_research::Trail
 Cgtl::stl_util_internal::TransparentLessLike std::less, but allows heterogeneous arguments
 Coperations_research::TrivialSolutionGenerator
 ►Cstd::true_type
 Coperations_research::pdlp::TrustRegionResult
 Coperations_research::TspLibParser
 Coperations_research::TspLibTourParserClass parsing tour (solution) data in TSLIB95 format
 Coperations_research::TspTWParser
 Coperations_research::internal::UnderlyingContainerAdapter< Container >
 Cutil::UndirectedAdjacencyListsOfDirectedGraph< Graph >
 Coperations_research::sat::UniqueClauseStream
 Coperations_research::UnsortedNullableRevBitset
 Coperations_research::math_opt::UpdateDataFieldIterator< UpdateData, V, Field, BaseIter >
 Coperations_research::math_opt::LinearConstraintStorage::UpdateResult
 Coperations_research::math_opt::UpdateResultResult of the Update() on an incremental solver
 Coperations_research::math_opt::VariableStorage::UpdateResult
 Coperations_research::glop::UpdateRow
 Coperations_research::math_opt::UpdateTracker
 Coperations_research::math_opt::UpdateTrackers< Data >
 Coperations_research::sat::UpperBoundedLinearConstraint
 Coperations_research::math_opt::UpperBoundedLinearExpressionA LinearExpression with an upper bound
 Coperations_research::math_opt::UpperBoundedQuadraticExpressionA QuadraticExpression with an upper bound
 Cgtl::ValueDeleter
 Coperations_research::sat::ValueLiteralPairA value and a literal
 Coperations_research::sat::VarDomainWrapper
 Coperations_research::sat::VarDomination
 Coperations_research::fz::Variable
 Coperations_research::LocalSearchState::Variable
 Coperations_research::math_opt::Variable
 Coperations_research::math_opt::InvalidIndicators::VariableAndConstraint
 Coperations_research::sat::PseudoCosts::VariableBoundChange
 Coperations_research::sat::VariablesAssignment
 Coperations_research::math_opt::internal::VariablesEquality
 Coperations_research::glop::VariablesInfo
 Coperations_research::math_opt::VariableStorage
 Coperations_research::glop::VariableValues
 Coperations_research::sat::VariableWithSameReasonIdentifier
 Coperations_research::fz::VarRefOrValue
 Coperations_research::sat::VarValueStores one variable and its strategy value
 Coperations_research::packing::vbp::VbpParser
 ►Cstd::vector< T >STL class
 ►Cstd::vector< absl::btree_map< IntegerValue, operations_research::sat::Literal >, std::allocator< absl::btree_map< IntegerValue, operations_research::sat::Literal > > >
 ►Cstd::vector< absl::InlinedVector< ArcIndex, 6 >, std::allocator< absl::InlinedVector< ArcIndex, 6 > > >
 ►Cstd::vector< absl::InlinedVector< ColIndex, 6 >, std::allocator< absl::InlinedVector< ColIndex, 6 > > >
 ►Cstd::vector< absl::InlinedVector< EnforcementId, 6 >, std::allocator< absl::InlinedVector< EnforcementId, 6 > > >
 ►Cstd::vector< absl::InlinedVector< int, 6 >, std::allocator< absl::InlinedVector< int, 6 > > >
 ►Cstd::vector< absl::InlinedVector< int32_t, 6 >, std::allocator< absl::InlinedVector< int32_t, 6 > > >
 ►Cstd::vector< absl::InlinedVector< operations_research::sat::Literal, 6 >, std::allocator< absl::InlinedVector< operations_research::sat::Literal, 6 > > >
 ►Cstd::vector< absl::InlinedVector< operations_research::sat::ValueLiteralPair, 2 >, std::allocator< absl::InlinedVector< operations_research::sat::ValueLiteralPair, 2 > > >
 ►Cstd::vector< absl::InlinedVector< OptionalArcIndex, 6 >, std::allocator< absl::InlinedVector< OptionalArcIndex, 6 > > >
 ►Cstd::vector< absl::Span< const operations_research::sat::Literal >, std::allocator< absl::Span< const operations_research::sat::Literal > > >
 ►Cstd::vector< NativeType, std::allocator< std::vector< ClauseIndex > > >
 ►Cstd::vector< NativeType, std::allocator< std::vector< ConstraintIndex > > >
 ►Cstd::vector< NativeType, std::allocator< std::vector< ConstraintIndexWithCoeff > > >
 ►Cstd::vector< NativeType, std::allocator< std::vector< EdgeIndex > > >
 ►Cstd::vector< NativeType, std::allocator< std::vector< ImageInfo > > >
 ►Cstd::vector< NativeType, std::allocator< std::vector< int > > >
 ►Cstd::vector< NativeType, std::allocator< std::vector< IntegerVariable > > >
 ►Cstd::vector< NativeType, std::allocator< std::vector< operations_research::sat::ClauseManager::Watcher > > >
 ►Cstd::vector< NativeType, std::allocator< std::vector< operations_research::sat::ImpliedBoundEntry > > >
 ►Cstd::vector< NativeType, std::allocator< std::vector< WatchData > > >
 ►Cstd::vector< std::function< void(EnforcementId, EnforcementStatus)>, std::allocator< std::function< void(EnforcementId, EnforcementStatus)> > >
 ►Cstd::vector< std::unique_ptr< Constraint >, std::allocator< std::unique_ptr< Constraint > > >
 ►Cstd::vector< util_intops::StrongVector< EntryIndex, ConstraintEntry >, std::allocator< util_intops::StrongVector< EntryIndex, ConstraintEntry > > >
 ►Cstd::vector< util_intops::StrongVector< TermIndex, operations_research::bop::OneFlipConstraintRepairer::ConstraintTerm >, std::allocator< util_intops::StrongVector< TermIndex, operations_research::bop::OneFlipConstraintRepairer::ConstraintTerm > > >
 Coperations_research::VectorOrFunction< ScalarType, Evaluator >Template to abstract the access to STL functions or vector values
 Coperations_research::VectorOrFunction< ScalarType, std::vector< ScalarType > >Specialization for vectors
 Coperations_research::VehicleTypeCurator
 Coperations_research::Bitset64< IndexType >::View
 ►CWallTimer
 Coperations_research::sat::ClauseManager::Watcher
 Cyy_buffer_state
 Cyy_trans_info
 Cyyalloc
 Cyyguts_t
 Cyypcontext_t
 Coperations_research::sat::ZeroHalfCutHelper
 Czipfile::ZipArchive
 Czipfile::ZipFileOptions
 Coperations_research::ZVector< T >
 Coperations_research::ZVector< ArcIndex >
 Coperations_research::ZVector< ArcIndexType >
 Coperations_research::ZVector< CostValue >
 Coperations_research::ZVector< FlowQuantity >
 Coperations_research::ZVector< NodeHeight >
 Coperations_research::ZVector< NodeIndex >
 Coperations_research::ZVector< NodeIndexType >