- b -

• b : BinaryClause
• barrier_iterations : SolveStats
• barrier_stats : CallbackData
• base_objective : NeighborhoodGenerator::SolveData
• basic_dual_feasibility : Basis
• basis : Solution
• begin_ : DynamicPartition::IterablePart , SparsePermutation::Iterator
• begin_index : PathState::ChainBounds
• begins : Gurobi::SparseMat
• best_ : OptimizeVar
• best_bound_limit : SolveParameters
• best_dual_bound : SolveStats
• best_known_solution : QapProblem
• best_objective_bound_ : MPSolverInterface
• best_primal_bound : SolveStats
• bfs_queue_ : GenericMaxFlow< Graph >
• binary_clauses : LearnedInfo
• blocking_literal : LiteralWatchers::Watcher
• blossom : BlossomGraph::Node
• bool : CallbackRangeConstraint , GScipConstraintOptions , ScipCallbackConstraintOptions
• bool_expr : FlowInfo
• bool_lp_value : FlowInfo , ImpliedBoundsProcessor::BestImpliedBoundInfo
• bool_var : BooleanOrIntegerVariable , ImpliedBoundsProcessor::BestImpliedBoundInfo
• boolean_literal_index : BooleanOrIntegerLiteral
• bound : BoundCost , IntegerLiteral
• bound_demons_ : BooleanVar
• bound_diff : CutTerm
• bound_norms : IterationCallbackInfo
• bounds : SolutionOutputSpecs
• branch_period : Solver::SearchLogParameters
• branches : SolutionCollector::SolutionData
• branching_priorities : ModelSolveParameters
• bucket : GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::Entry
• buffer_ : SparseVector< IndexType, IteratorType >