Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
This is the complete list of members for operations_research::KnapsackDivideAndConquerSolver, including all inherited members.
BaseKnapsackSolver(absl::string_view solver_name) | operations_research::BaseKnapsackSolver | inlineexplicit |
best_solution(int item_id) const override | operations_research::KnapsackDivideAndConquerSolver | inlinevirtual |
GetLowerAndUpperBoundWhenItem(int item_id, bool is_item_in, int64_t *lower_bound, int64_t *upper_bound) | operations_research::BaseKnapsackSolver | virtual |
GetName() const | operations_research::BaseKnapsackSolver | inlinevirtual |
Init(const std::vector< int64_t > &profits, const std::vector< std::vector< int64_t > > &weights, const std::vector< int64_t > &capacities) override | operations_research::KnapsackDivideAndConquerSolver | virtual |
KnapsackDivideAndConquerSolver(absl::string_view solver_name) | operations_research::KnapsackDivideAndConquerSolver | explicit |
Solve(TimeLimit *time_limit, double time_limit_in_second, bool *is_solution_optimal) override | operations_research::KnapsackDivideAndConquerSolver | virtual |
~BaseKnapsackSolver()=default | operations_research::BaseKnapsackSolver | virtual |