![]() |
OR-Tools
8.2
|
This is the complete list of members for KnapsackSolverForCuts, including all inherited members.
| best_solution(int item_id) const | KnapsackSolverForCuts | inline |
| GetLowerAndUpperBoundWhenItem(int item_id, bool is_item_in, double *lower_bound, double *upper_bound) | KnapsackSolverForCuts | |
| GetName() const | KnapsackSolverForCuts | inline |
| GetNumberOfItems() const | KnapsackSolverForCuts | inline |
| GetUpperBound() | KnapsackSolverForCuts | inline |
| Init(const std::vector< double > &profits, const std::vector< double > &weights, const double capacity) | KnapsackSolverForCuts | |
| KnapsackSolverForCuts(std::string solver_name) | KnapsackSolverForCuts | explicit |
| KnapsackSolverForCuts(const KnapsackSolverForCuts &)=delete | KnapsackSolverForCuts | |
| operator=(const KnapsackSolverForCuts &)=delete | KnapsackSolverForCuts | |
| set_node_limit(const int64 node_limit) | KnapsackSolverForCuts | inline |
| set_solution_lower_bound_threshold(const double solution_lower_bound_threshold) | KnapsackSolverForCuts | inline |
| set_solution_upper_bound_threshold(const double solution_upper_bound_threshold) | KnapsackSolverForCuts | inline |
| Solve(TimeLimit *time_limit, bool *is_solution_optimal) | KnapsackSolverForCuts |