Definition at line 299 of file knapsack_solver_for_cuts.h.
◆ KnapsackSolverForCuts() [1/2]
◆ KnapsackSolverForCuts() [2/2]
◆ best_solution()
bool best_solution |
( |
int |
item_id | ) |
const |
|
inline |
◆ GetLowerAndUpperBoundWhenItem()
void GetLowerAndUpperBoundWhenItem |
( |
int |
item_id, |
|
|
bool |
is_item_in, |
|
|
double * |
lower_bound, |
|
|
double * |
upper_bound |
|
) |
| |
◆ GetName()
const std::string & GetName |
( |
| ) |
const |
|
inline |
◆ GetNumberOfItems()
int GetNumberOfItems |
( |
| ) |
const |
|
inline |
◆ GetUpperBound()
◆ Init()
void Init |
( |
const std::vector< double > & |
profits, |
|
|
const std::vector< double > & |
weights, |
|
|
const double |
capacity |
|
) |
| |
◆ operator=()
◆ set_node_limit()
void set_node_limit |
( |
const int64 |
node_limit | ) |
|
|
inline |
◆ set_solution_lower_bound_threshold()
void set_solution_lower_bound_threshold |
( |
const double |
solution_lower_bound_threshold | ) |
|
|
inline |
◆ set_solution_upper_bound_threshold()
void set_solution_upper_bound_threshold |
( |
const double |
solution_upper_bound_threshold | ) |
|
|
inline |
◆ Solve()
double Solve |
( |
TimeLimit * |
time_limit, |
|
|
bool * |
is_solution_optimal |
|
) |
| |
The documentation for this class was generated from the following files: