Here is a list of all class members with links to the classes they belong to:

- i -

• i_ : ScatteredVectorEntry< IndexType > , SparseVectorEntry< IndexType >
• id : Annotation , KnapsackItem , KnapsackItemForCuts , KnapsackItemWithEfficiency , PROTOBUF_FINAL , Neighborhood
• IDENTIFIER : Annotation
• Identifier() : Annotation
• IfThenElseCt() : IfThenElseCt
• ignore_path_vars_ : PathOperator
• IgnoreDisjunctionsAlreadyForcedToZero() : RoutingModel
• IgnoreElement() : NonOrderedSetHasher< IntType >
• IgnoreFromClassSize() : AffineRelation
• IgnoreUpdatePosition() : UpdateRow
• ImageOf() : DynamicPermutation
• Implication : SccGraph
• ImplicationIsInTree() : StampingSimplifier
• Implications() : BinaryImplicationGraph
• implicitconv : SwigPyClientData
• ImpliedBoundEntry() : ImpliedBoundEntry
• ImpliedBounds() : ImpliedBounds
• ImpliedBoundsProcessor() : ImpliedBoundsProcessor
• ImpliedFreePreprocessor() : ImpliedFreePreprocessor
• ImportOtherReasons() : SchedulingConstraintHelper
• in_mip_context_ : Preprocessor
• IN_ORDER : PROTOBUF_FINAL
• IN_RANDOM_ORDER : PROTOBUF_FINAL
• IN_REVERSE_ORDER : PROTOBUF_FINAL
• inactive_count : LinearConstraintManager::ConstraintInfo
• Includes() : Set< Integer >
• IncomingArcIterator() : EbertGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator , GenericMaxFlow< Graph > , ReverseArcListGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator , ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator , ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator
• IncomingArcs() : ReverseArcListGraph< NodeIndexType, ArcIndexType > , ReverseArcMixedGraph< NodeIndexType, ArcIndexType > , ReverseArcStaticGraph< NodeIndexType, ArcIndexType >
• IncomingArcsStartingFrom() : ReverseArcListGraph< NodeIndexType, ArcIndexType > , ReverseArcMixedGraph< NodeIndexType, ArcIndexType > , ReverseArcStaticGraph< NodeIndexType, ArcIndexType >
• Increase() : AdaptiveParameterValue
• increase_stamp() : Queue
• IncreaseCurrentUB() : EncodingNode
• IncreaseNumVariables() : SatDecisionPolicy
• IncreaseParameter() : LubyAdaptiveParameterValue
• IncreasePriority() : IntegerPriorityQueue< Element, Compare >
• IncreaseSize() : BitQueue64
• IncreaseStartMin() : SchedulingConstraintHelper
• IncrementalAverage() : IncrementalAverage
• INCREMENTALITY : MPSolverParameters
• INCREMENTALITY_OFF : MPSolverParameters
• INCREMENTALITY_ON : MPSolverParameters
• IncrementalityValues : MPSolverParameters
• IncrementalPropagate() : CircuitCoveringPropagator , CircuitPropagator , LinearProgrammingConstraint , PropagatorInterface
• IncrementSolutionCounter() : Search
• IncrementUncheckedSolutionCounter() : Search
• InDegree() : ReverseArcListGraph< NodeIndexType, ArcIndexType > , ReverseArcMixedGraph< NodeIndexType, ArcIndexType > , ReverseArcStaticGraph< NodeIndexType, ArcIndexType >
• Index() : Bitset64< IndexType >::Iterator , EbertGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator , EbertGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator
• index() : ScatteredVectorEntry< IndexType >
• Index : ScatteredVectorEntry< IndexType > , SparseVector< IndexType, IteratorType >
• index() : SparseVectorEntry< IndexType >
• Index : SparseVectorEntry< IndexType > , VectorIterator< EntryType > , LinearSumAssignment< GraphType >::BipartiteLeftNodeIterator
• index() : MPConstraint , MPVariable , BoolVar
• Index() : IntegerTrail
• index() : IntervalVar , IntVar
• Index() : Literal
• index : PrecedencesPropagator::IntegerPrecedences , PROTOBUF_FINAL
• Index() : Trail , StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::ArcIterator , StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::NodeIterator , StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::OutgoingArcIterator
• index : SweepIndex
• Index() : VectorMap< T > , CompleteBipartiteGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator , ListGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator , ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator , ReverseArcListGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator , ReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator , ReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator , ReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator , ReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator , ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator , ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator , ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator , ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator , ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator , ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator , ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator , ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator , StaticGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
• index_ : ScatteredVectorEntry< IndexType > , SparseVector< IndexType, IteratorType > , SparseVectorEntry< IndexType > , ReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator , ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator , ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
• IndexOrDie() : VectorMap< T >
• IndexPair : RoutingModel
• IndexPairs : RoutingModel
• IndexPairSwapActiveOperator() : IndexPairSwapActiveOperator
• IndexPermutation : SparseVector< IndexType, IteratorType >
• IndexToNode() : RoutingIndexManager
• IndexType : ITIVector< IntType, T, Alloc > , StrictITIVector< IntType, T >
• indicator_constraint() : _Internal , PROTOBUF_FINAL
• indicator_constraint_ : MPGeneralConstraintProtoDefaultTypeInternal
• indicator_value() : MPConstraint
• indicator_variable() : MPConstraint
• IndicesToNodes() : RoutingIndexManager
• InDomain() : PiecewiseLinearFunction
• INFEASIBLE : BopOptimizerBase , MinCostFlowBase , MinCostPerfectMatching , MPSolver , SatSolver , SimpleLinearSumAssignment
• Infinite() : TimeLimit
• infinite_time_limit_ : Preprocessor
• infinity() : MPSolver
• Info() : Trail
• INFORMATION_FOUND : BopOptimizerBase
• InfoString() : RestartPolicy
• Init() : File , BaseKnapsackSolver , CachedLog , ConnectedComponents< NodeIndex, ArcIndex > , SparseMatrixScaler , Knapsack64ItemsSolver , KnapsackBruteForceSolver , KnapsackDynamicProgrammingSolver , KnapsackGenericSolver , KnapsackMIPSolver , KnapsackPropagator , KnapsackPropagatorForCuts , KnapsackSearchPath , KnapsackSearchPathForCuts , KnapsackSolver , KnapsackSolverForCuts , KnapsackState , KnapsackStateForCuts , LatticeMemoryManager< Set, CostType >
• INIT : ScpParser
• Init() : UnsortedNullableRevBitset , SwigDirector_RegularLimit , SwigDirector_SearchLimit
• InitAsDefaultInstance() : PROTOBUF_FINAL
• InitFragments() : BaseLns , SwigDirector_BaseLns
• initial_basis() : PROTOBUF_FINAL
• initial_best_objective : NeighborhoodGenerator::SolveData
• initial_best_objective_bound : NeighborhoodGenerator::SolveData
• initial_condition_number_threshold() : PROTOBUF_FINAL
• initial_polarity() : PROTOBUF_FINAL
• initial_propagation_end_time() : PROTOBUF_FINAL
• initial_propagation_end_time_size() : PROTOBUF_FINAL
• initial_propagation_start_time() : PROTOBUF_FINAL
• initial_propagation_start_time_size() : PROTOBUF_FINAL
• initial_variables_activity() : PROTOBUF_FINAL
• InitialBasis() : InitialBasis
• InitialBasisHeuristic : PROTOBUF_FINAL
• InitialBasisHeuristic_ARRAYSIZE : PROTOBUF_FINAL
• InitialBasisHeuristic_descriptor() : PROTOBUF_FINAL
• InitialBasisHeuristic_IsValid() : PROTOBUF_FINAL
• InitialBasisHeuristic_MAX : PROTOBUF_FINAL
• InitialBasisHeuristic_MIN : PROTOBUF_FINAL
• InitialBasisHeuristic_Name() : PROTOBUF_FINAL
• InitialBasisHeuristic_Parse() : PROTOBUF_FINAL
• Initialize() : BlossomGraph , NonOrderedSetHasher< IntType > , EbertGraphBase< NodeIndexType, ArcIndexType, DerivedGraph > , BasisFactorization , NearestNeighbors
• initialize_devex_with_column_norms() : PROTOBUF_FINAL
• InitializeActiveNodeContainer() : GenericMaxFlow< Graph >
• InitializeAndComputeType() : VariablesInfo
• InitializeBreaks() : RoutingDimension
• InitializeCheck() : TypeRegulationsChecker
• InitializeContainer() : SavingsFilteredHeuristic::SavingsContainer< Saving >
• InitializeFromMatrixSubset() : MatrixNonZeroPattern
• InitializeFullNode() : EncodingNode
• InitializeLazyNode() : EncodingNode
• InitializeNewDomains() : PresolveContext
• InitializePreflow() : GenericMaxFlow< Graph >
• InitializePriorityQueue() : CheapestInsertionFilteredHeuristic
• InitializeRhs() : UpperBoundedLinearConstraint
• InitializeSolution() : IntVarFilteredHeuristic
• InitialPropagate() : Dimension , GlobalVehicleBreaksConstraint , IfThenElseCt , TypeRegulationsConstraint , SwigDirector_Constraint
• InitialPropagateUnassigned() : Dimension
• InitialSupply() : GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
• InitialVariableDomain() : IntegerTrail
• InitPosition() : PathOperator , SwigDirector_PathOperator
• InitPositionSwigPublic() : SwigDirector_PathOperator
• InitPropagator() : KnapsackCapacityPropagator , KnapsackPropagator , KnapsackPropagatorForCuts
• Inprocessing() : Inprocessing
• InprocessingAddClause() : LiteralWatchers
• InprocessingFixLiteral() : LiteralWatchers
• InprocessingRemoveClause() : LiteralWatchers
• InprocessingRewriteClause() : LiteralWatchers
• InprocessingRound() : Inprocessing
• insert() : ITIVector< IntType, T, Alloc >
• Insert() : IntTupleSet , RevImmutableMultiMap< K, V > , RevIntSet< T >
• Insert2() : IntTupleSet
• Insert3() : IntTupleSet
• Insert4() : IntTupleSet
• insert_after() : GlobalCheapestInsertionFilteredHeuristic::NodeEntry
• InsertAll() : IntTupleSet
• InsertBetween() : CheapestInsertionFilteredHeuristic
• InsertExprConstantExpression() : ModelCache
• InsertExprExprConstantExpression() : ModelCache
• InsertExprExprConstraint() : ModelCache
• InsertExprExpression() : ModelCache
• InsertExprExprExpression() : ModelCache
• InsertInterval() : SortedDisjointIntervalList
• InsertIntervals() : SortedDisjointIntervalList
• InsertVarArrayConstantArrayExpression() : ModelCache
• InsertVarArrayConstantExpression() : ModelCache
• InsertVarArrayExpression() : ModelCache
• InsertVarConstantArrayExpression() : ModelCache
• InsertVarConstantConstantConstraint() : ModelCache
• InsertVarConstantConstantExpression() : ModelCache
• InsertVarConstantConstraint() : ModelCache
• InsertVarValueEncoding() : PresolveContext
• InsertVoidConstraint() : ModelCache
• Install() : DemonProfiler , LocalSearchMonitor , LocalSearchMonitorMaster , LocalSearchProfiler , PropagationMonitor , Trace , SwigDirector_OptimizeVar , SwigDirector_RegularLimit , SwigDirector_SearchLimit , SwigDirector_SearchMonitor , SwigDirector_SolutionCollector
• instantiate_all_variables() : PROTOBUF_FINAL
• int_div() : _Internal , PROTOBUF_FINAL
• int_div_ : ConstraintProtoDefaultTypeInternal
• int_info : StateInfo
• INT_INTERVAL : Argument
• INT_LIST : Argument
• int_max() : _Internal , PROTOBUF_FINAL
• int_max_ : ConstraintProtoDefaultTypeInternal
• int_min() : _Internal , PROTOBUF_FINAL
• int_min_ : ConstraintProtoDefaultTypeInternal
• int_mod() : _Internal , PROTOBUF_FINAL
• int_mod_ : ConstraintProtoDefaultTypeInternal
• INT_OVERFLOW : MaxFlowStatusClass
• int_prod() : _Internal , PROTOBUF_FINAL
• int_prod_ : ConstraintProtoDefaultTypeInternal
• INT_TYPE_ASSIGNMENT_OP() : IntType< IntTypeName, _ValueType >
• INT_VALUE : Annotation , Argument
• int_var : BooleanOrIntegerVariable
• int_var_assignment() : PROTOBUF_FINAL
• int_var_assignment_size() : PROTOBUF_FINAL
• INT_VAR_REF : Annotation , Argument
• INT_VAR_REF_ARRAY : Annotation , Argument
• Integer : HamiltonianPathSolver< CostType, CostFunction >
• integer() : MPVariable
• Integer : PruningHamiltonianSolver< CostType, CostFunction > , CpModelMapping
• integer_array_map : ParserContext
• integer_map : ParserContext
• INTEGER_OVERFLOW : MinCostPerfectMatching
• integer_value : LexerInfo
• integer_variables() : LinearProgrammingConstraint
• IntegerArgumentProto() : PROTOBUF_FINAL
• IntegerDistribution() : IntegerDistribution
• IntegerDomains() : IntegerDomains
• IntegerEncoder() : IntegerEncoder
• IntegerList() : Argument , Domain
• IntegerLiteral() : IntegerLiteral
• IntegerLiteralIsFalse() : IntegerTrail
• IntegerLiteralIsTrue() : IntegerTrail
• IntegerParam : MPSolverParameters
• IntegerPriorityQueue() : IntegerPriorityQueue< Element, Compare >
• IntegerRange() : IntegerRange< IntegerType >
• IntegerRangeIterator() : IntegerRangeIterator< IntegerType >
• integers : LexerInfo
• Integers() : CpModelMapping
• IntegerSolutionIsFeasible() : FeasibilityPump
• IntegerSolutionObjectiveValue() : FeasibilityPump
• IntegerSumLE() : IntegerSumLE
• IntegerTrail() : IntegerTrail
• IntegerType : Set< Integer > , SetRangeIterator< SetRange >
• IntegerValue() : Annotation , Argument , Domain
• IntegerVariableProto() : PROTOBUF_FINAL
• IntegerVariablesList() : LinearProgram
• IntegralSolver() : IntegralSolver
• interleave_batch_size() : PROTOBUF_FINAL
• interleave_search() : PROTOBUF_FINAL
• internal_default_instance() : PROTOBUF_FINAL , MPModelDeltaProto_ConstraintOverridesEntry_DoNotUse , MPModelDeltaProto_VariableOverridesEntry_DoNotUse , PROTOBUF_FINAL
• InterruptSolve() : BopInterface , GLOPInterface , GurobiInterface , MPSolver , MPSolverInterface , SatInterface , SCIPInterface
• IntersectDomainWith() : PresolveContext
• Intersection() : Bitset64< IndexType >
• intersection_y() : PiecewiseSegment
• IntersectionWith() : Domain
• Intersects() : UnsortedNullableRevBitset
• IntersectWithDomain() : Domain
• IntersectWithInterval() : Domain
• IntersectWithListOfIntegers() : Domain
• IntersectWithSingleton() : Domain
• Interval() : Annotation
• INTERVAL : Annotation
• Interval() : Argument , Domain
• interval() : _Internal
• Interval() : CpModelMapping
• interval() : PROTOBUF_FINAL
• interval_ : ConstraintProtoDefaultTypeInternal
• interval_max : Annotation
• interval_min : Annotation
• interval_var_assignment() : PROTOBUF_FINAL
• interval_var_assignment_size() : PROTOBUF_FINAL
• IntervalConstraintProto() : PROTOBUF_FINAL
• intervals() : Domain
• Intervals() : CpModelMapping
• intervals() : PROTOBUF_FINAL
• intervals_size() : PROTOBUF_FINAL
• IntervalSet : SortedDisjointIntervalList
• IntervalsRepository() : IntervalsRepository
• IntervalUsage() : PresolveContext
• IntervalVar : BoolVar , IntervalVar , IntVar
• IntervalVarAssignment() : PROTOBUF_FINAL
• IntTupleSet() : IntTupleSet
• IntType() : IntType< IntTypeName, _ValueType >
• IntVar : BoolVar , IntVar
• IntVarAssignment() : PROTOBUF_FINAL
• IntVarFilteredDecisionBuilder() : IntVarFilteredDecisionBuilder
• IntVarFilteredHeuristic() : IntVarFilteredHeuristic
• IntVarLocalSearchFilter() : IntVarLocalSearchFilter
• IntVarLocalSearchHandler() : IntVarLocalSearchHandler , IntVarLocalSearchOperator
• IntVarLocalSearchOperator() : IntVarLocalSearchOperator
• IntVarRef() : Argument
• IntVarRefArray() : Argument
• INVALID : DratChecker
• Invalidate() : UpdateRow
• InvalidateSolutionSynchronization() : MPSolverInterface
• inverse() : _Internal , PROTOBUF_FINAL
• inverse_ : ConstraintProtoDefaultTypeInternal
• inverse_col_perm() : LuFactorization
• InverseConstraintProto() : PROTOBUF_FINAL
• InverseMultiplicationBy() : Domain
• InverseValue() : IntVarLocalSearchOperator
• InvokeCallback() : Storage< Callback >
• IPow() : MathUtil
• is_a_set : Domain
• is_bound() : KnapsackState , KnapsackStateForCuts
• is_consumer_producer() : PROTOBUF_FINAL
• is_deletable : LinearConstraintManager::ConstraintInfo
• is_dynamic : graph_traits< GraphType > , graph_traits< ForwardEbertGraph< NodeIndexType, ArcIndexType > > , graph_traits< ForwardStaticGraph< NodeIndexType, ArcIndexType > >
• is_fixed() : ProblemState
• is_generated : Neighborhood
• is_in : KnapsackAssignment , KnapsackAssignmentForCuts , KnapsackState , KnapsackStateForCuts
• is_in_lp : LinearConstraintManager::ConstraintInfo
• is_integer() : PROTOBUF_FINAL
• is_internal : BlossomGraph::Node
• is_interval : Domain
• is_lazy() : MPConstraint , PROTOBUF_FINAL
• is_learned() : UpperBoundedLinearConstraint
• is_marked_for_deletion() : UpperBoundedLinearConstraint
• is_non_zero : ScatteredVector< Index, Iterator >
• is_positive : ImpliedBoundEntry , ImpliedBoundsProcessor::BestImpliedBoundInfo
• is_preemptible : DisjunctivePropagator::Tasks
• is_rcpsp_max() : PROTOBUF_FINAL
• is_reduced : Neighborhood
• is_released() : Cleanup< Callback >
• is_resource_investment() : PROTOBUF_FINAL
• is_sequential : GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters
• is_set_partitioning() : ScpData
• is_used_as_a_reason() : UpperBoundedLinearConstraint
• is_valid() : PROTOBUF_FINAL
• IsAbsent() : SchedulingConstraintHelper
• IsActive() : GenericMaxFlow< Graph > , NeighborhoodGeneratorHelper
• IsAdmissible() : GenericMaxFlow< Graph >
• IsAllInt64() : Domain
• IsArcCallback : BronKerboschAlgorithm< NodeIndex >
• IsArcDirect() : GenericMaxFlow< Graph >
• IsArcValid() : GenericMaxFlow< Graph > , Graphs< Graph > , Graphs< operations_research::StarGraph > , BaseGraph< NodeIndexType, ArcIndexType, HasReverseArcs >
• IsArrayOfValues() : Argument
• IsAssignedStatusKnown() : Dimension
• IsAttached() : SatClause
• IsBlossom() : BlossomGraph::Node
• IsBoolean() : CpModelMapping
• IsCardinalityOne() : RevBitMatrix , RevBitSet , SmallRevBitSet
• IsCardinalityZero() : RevBitMatrix , RevBitSet , SmallRevBitSet
• IsCleanedUp() : LinearProgram , SparseMatrix , SparseVector< IndexType, IteratorType >
• IsColumnDeleted() : MatrixNonZeroPattern
• IsColumnMarked() : ColumnDeletionHelper
• IsContinuous() : BopInterface , CBCInterface , CLPInterface , GLOPInterface , GurobiInterface , MPSolverInterface , SatInterface , SCIPInterface
• IsConvex() : PiecewiseLinearFunction
• IsCPSATSolver() : RoutingCPSatWrapper , RoutingGlopWrapper , RoutingLinearSolverWrapper
• IsCurrentlyIgnored() : IntegerTrail
• IsDag() : BinaryImplicationGraph
• IsDifferent() : BooleanVar
• IsDirect() : EbertGraph< NodeIndexType, ArcIndexType >
• IsDisabled() : BasePathFilter
• IsEmpty() : AdjustablePriorityQueue< T, Comp > , Domain , BasisState , ColumnDeletionHelper , ColumnView , CompactSparseMatrix , CompactSparseMatrixView , MatrixView , RowDeletionHelper , SparseMatrix , SparseVector< IndexType, IteratorType > , TriangularMatrix , IntegerPriorityQueue< Element, Compare > , PriorityQueueWithRestrictedPush< Element, IntegerPriority > , BinaryImplicationGraph
• IsEmptyActiveNodeContainer() : GenericMaxFlow< Graph >
• IsEnd() : RoutingModel
• IsEqual() : BooleanVar
• IsEqualTo() : SparseVector< IndexType, IteratorType >
• IsFeasible() : AssignmentAndConstraintFeasibilityMaintainer , BopSolution , GlobalDimensionCumulOptimizer
• IsFixed() : Domain , IntegerTrail , PresolveContext
• IsFree() : BlossomGraph::Node
• IsFunctionCallWithIdentifier() : Annotation
• IsGraphAutomorphism() : GraphSymmetryFinder
• IsGreaterOrEqual() : BooleanVar
• IsHalfEncodingConstraint() : CpModelMapping
• IsIdentityFactorization() : LuFactorization
• IsIgnoredLiteral() : IntegerTrail
• IsInactive() : PathOperator
• IsIncludedIn() : Domain
• IsIncoming() : EbertGraph< NodeIndexType, ArcIndexType > , ForwardEbertGraph< NodeIndexType, ArcIndexType > , ForwardStaticGraph< NodeIndexType, ArcIndexType >
• IsInconsistent() : Model
• IsIncremental() : LocalSearchFilter , TwoOpt , VarLocalSearchOperator< V, Val, Handler > , SwigDirector_BaseLns , SwigDirector_ChangeValue , SwigDirector_IntVarLocalSearchFilter , SwigDirector_IntVarLocalSearchOperator , SwigDirector_LocalSearchFilter , SwigDirector_PathOperator , SwigDirector_SequenceVarLocalSearchOperator
• IsInEquationForm() : LinearProgram
• IsInfeasible() : ProblemState
• IsInitialized() : NonOrderedSetHasher< IntType > , PROTOBUF_FINAL
• IsInteger() : CpModelMapping
• IsInternal() : BlossomGraph::Node
• IsInverseValue() : IntVarLocalSearchOperator
• IsLessOrEqual() : BooleanVar
• IsLowerTriangular() : TriangularMatrix
• IsLP() : BopInterface , CBCInterface , CLPInterface , GLOPInterface , GurobiInterface , MPSolverInterface , SatInterface , SCIPInterface
• IsMatchingModel() : RoutingModel
• IsMaximizationProblem() : LinearProgram
• IsMinus() : BlossomGraph::Node
• IsMIP() : BopInterface , CBCInterface , CLPInterface , GLOPInterface , GurobiInterface , MPSolver , MPSolverInterface , SatInterface , SCIPInterface
• IsModelUnsat() : SatWrapper , SatSolver
• IsNegative() : Literal
• IsNodeValid() : StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph > , BaseGraph< NodeIndexType, ArcIndexType, HasReverseArcs >
• IsNonDecreasing() : PiecewiseLinearFunction
• IsNonIncreasing() : PiecewiseLinearFunction
• IsOptimal() : ProblemState
• IsOptional() : IntegerTrail , IntervalsRepository , SchedulingConstraintHelper
• IsOutgoing() : EbertGraph< NodeIndexType, ArcIndexType >
• IsOutgoingOrOppositeIncoming() : EbertGraph< NodeIndexType, ArcIndexType >
• IsPathEnd() : PathOperator
• IsPathStart() : PathOperator
• IsPlus() : BlossomGraph::Node
• IsPositive() : Literal
• IsPossible() : Dimension
• IsPresent() : SchedulingConstraintHelper
• IsPresentLiteral() : IntervalsRepository
• IsRanked() : RevPartialSequence
• IsRedundant() : BinaryImplicationGraph
• IsRefactorized() : BasisFactorization
• IsRelaxationGenerator() : ConsecutiveConstraintsRelaxationNeighborhoodGenerator , NeighborhoodGenerator , WeightedRandomRelaxationNeighborhoodGenerator
• IsRemovable() : LiteralWatchers
• IsRemoved() : BinaryImplicationGraph
• IsReverse() : EbertGraph< NodeIndexType, ArcIndexType >
• IsRobust() : HamiltonianPathSolver< CostType, CostFunction >
• IsRowMarked() : RowDeletionHelper
• IsSatisfied() : SatClause
• IsSet() : Bitset64< IndexType > , RevBitMatrix , RevBitSet
• IsSingular() : RankOneUpdateElementaryMatrix
• IsSmallerWithinFeasibilityTolerance() : Preprocessor
• IsSmallerWithinPreprocessorZeroTolerance() : Preprocessor
• IsSolutionOptimal() : KnapsackSolver
• IsStart() : RoutingModel
• IsUncheckedSolutionLimitReached() : Search , SwigDirector_OptimizeVar , SwigDirector_RegularLimit , SwigDirector_SearchLimit , SwigDirector_SearchMonitor , SwigDirector_SolutionCollector
• IsUndecided() : Dimension
• IsUpperTriangular() : TriangularMatrix
• IsValid() : LinearProgram
• IsValidPrimalEnteringCandidate() : ReducedCosts
• IsVariable() : Argument
• IsVariableBinary() : LinearProgram
• IsVariableFixed() : ProblemState
• IsVariableInteger() : LinearProgram
• IsVarSynced() : IntVarLocalSearchFilter
• IsVehicleAllowedForIndex() : RoutingModel
• IsVehicleUsed() : RoutingModel
• IsWindowFull() : RunningAverage
• item_id : KnapsackAssignment , KnapsackAssignmentForCuts
• items() : KnapsackPropagator , KnapsackPropagatorForCuts
• IterablePart() : DynamicPartition::IterablePart
• iterations() : BopInterface , CBCInterface , CLPInterface , GLOPInterface , GurobiInterface , MPSolver , MPSolverInterface , SatInterface , SCIPInterface
• iterator : ITIVector< IntType, T, Alloc >
• Iterator() : Bitset64< IndexType >::Iterator , ColumnView , SparseVector< IndexType, IteratorType > , SimpleRevFIFO< T >::Iterator , SortedDisjointIntervalList , SparsePermutation::Iterator , MutableVectorIteration< T >::Iterator
• iterator_category : ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
• ITIVector() : ITIVector< IntType, T, Alloc >