- b -

• b : BinaryClause
• backward_values_ : SequenceVarLocalSearchOperator
• base_objective : NeighborhoodGenerator::SolveData
• begin_ : DynamicPartition::IterablePart , SparsePermutation::Iterator
• BEST_INSERTION : PROTOBUF_FINAL
• bfs_queue_ : GenericMaxFlow< Graph >
• binary_clauses : LearnedInfo
• BINARY_MINIMIZATION_FIRST : PROTOBUF_FINAL
• BINARY_MINIMIZATION_FIRST_WITH_TRANSITIVE_REDUCTION : PROTOBUF_FINAL
• BINARY_MINIMIZATION_WITH_REACHABILITY : PROTOBUF_FINAL
• BinaryMinizationAlgorithm_ARRAYSIZE : PROTOBUF_FINAL
• BinaryMinizationAlgorithm_MAX : PROTOBUF_FINAL
• BinaryMinizationAlgorithm_MIN : PROTOBUF_FINAL
• BIXBY : PROTOBUF_FINAL
• blocking_literal : LiteralWatchers::Watcher
• blossom : BlossomGraph::Node
• bool_and_ : ConstraintProtoDefaultTypeInternal
• bool_lp_value : ImpliedBoundsProcessor::BestImpliedBoundInfo
• bool_or_ : ConstraintProtoDefaultTypeInternal
• bool_var : BooleanOrIntegerVariable , ImpliedBoundsProcessor::BestImpliedBoundInfo
• bool_xor_ : ConstraintProtoDefaultTypeInternal
• BOP_INTEGER_PROGRAMMING : PROTOBUF_FINAL
• bound : IntegerLiteral , SimpleBoundCosts::BoundCost
• bound_demons_ : BooleanVar
• bound_diff : ImpliedBoundsProcessor::BestImpliedBoundInfo
• bounds : SolutionOutputSpecs
• bucket_size : hash< std::array< T, N > >
• buffer_ : SparseVector< IndexType, IteratorType >