Definition at line 546 of file knapsack_solver.cc.
|
| | KnapsackBruteForceSolver (const std::string &solver_name) |
| |
| void | Init (const std::vector< int64_t > &profits, const std::vector< std::vector< int64_t >> &weights, const std::vector< int64_t > &capacities) override |
| |
| int64_t | Solve (TimeLimit *time_limit, bool *is_solution_optimal) override |
| |
| bool | best_solution (int item_id) const override |
| |
| virtual void | Init (const std::vector< int64_t > &profits, const std::vector< std::vector< int64_t > > &weights, const std::vector< int64_t > &capacities)=0 |
| |
| virtual void | GetLowerAndUpperBoundWhenItem (int item_id, bool is_item_in, int64_t *lower_bound, int64_t *upper_bound) |
| |
| virtual std::string | GetName () const |
| |
◆ KnapsackBruteForceSolver()
◆ best_solution()
| bool best_solution |
( |
int |
item_id | ) |
const |
|
inlineoverridevirtual |
◆ GetLowerAndUpperBoundWhenItem()
| void GetLowerAndUpperBoundWhenItem |
( |
int |
item_id, |
|
|
bool |
is_item_in, |
|
|
int64_t * |
lower_bound, |
|
|
int64_t * |
upper_bound |
|
) |
| |
|
virtualinherited |
◆ GetName()
| virtual std::string GetName |
( |
| ) |
const |
|
inlinevirtualinherited |
◆ Init() [1/2]
| virtual void Init |
( |
const std::vector< int64_t > & |
profits, |
|
|
const std::vector< std::vector< int64_t > > & |
weights, |
|
|
const std::vector< int64_t > & |
capacities |
|
) |
| |
|
pure virtualinherited |
◆ Init() [2/2]
| void Init |
( |
const std::vector< int64_t > & |
profits, |
|
|
const std::vector< std::vector< int64_t >> & |
weights, |
|
|
const std::vector< int64_t > & |
capacities |
|
) |
| |
|
override |
◆ Solve()
| int64_t Solve |
( |
TimeLimit * |
time_limit, |
|
|
bool * |
is_solution_optimal |
|
) |
| |
|
overridevirtual |
The documentation for this class was generated from the following file: