- b -

• b : BinaryClause
• backward_values_ : SequenceVarLocalSearchOperator
• barrier_stats : CallbackData
• base_objective : NeighborhoodGenerator::SolveData
• basename_ : LogMessage::LogMessageData
• basis : IndexedSolutions , Result
• begin_ : DynamicPartition::IterablePart , SparsePermutation::Iterator
• best_ : OptimizeVar
• BEST_INSERTION : FirstSolutionStrategy
• best_objective_bound_ : MPSolverInterface
• BEST_SOL_LIMIT : GScipOutput
• bfs_queue_ : GenericMaxFlow< Graph >
• binary_clauses : LearnedInfo
• BINARY_MINIMIZATION_FIRST : SatParameters
• BINARY_MINIMIZATION_FIRST_WITH_TRANSITIVE_REDUCTION : SatParameters
• BINARY_MINIMIZATION_WITH_REACHABILITY : SatParameters
• BinaryMinizationAlgorithm_ARRAYSIZE : SatParameters
• BinaryMinizationAlgorithm_MAX : SatParameters
• BinaryMinizationAlgorithm_MIN : SatParameters
• BIXBY : GlopParameters
• blocking_literal : LiteralWatchers::Watcher
• blossom : BlossomGraph::Node
• bool : CallbackRangeConstraint , GScipConstraintOptions , ScipCallbackConstraintOptions
• bool_lp_value : ImpliedBoundsProcessor::BestImpliedBoundInfo
• bool_var : BooleanOrIntegerVariable , ImpliedBoundsProcessor::BestImpliedBoundInfo
• boolean_literal_index : BooleanOrIntegerLiteral
• BOP_INTEGER_PROGRAMMING : MPModelRequest
• bound : IntegerLiteral , SimpleBoundCosts::BoundCost
• bound_demons_ : BooleanVar
• bound_diff : ImpliedBoundsProcessor::BestImpliedBoundInfo
• bounds : SolutionOutputSpecs
• branch_period : Solver::SearchLogParameters
• branches : SolutionCollector::SolutionData
• bucket_size : hash< std::array< T, N > >
• buffer_ : SparseVector< IndexType, IteratorType >