|
virtual void | Dispose (bool disposing) |
|
Definition at line 15 of file KnapsackSolver.cs.
◆ SolverType
Enumerator |
---|
KNAPSACK_BRUTE_FORCE_SOLVER | |
KNAPSACK_64ITEMS_SOLVER | |
KNAPSACK_DYNAMIC_PROGRAMMING_SOLVER | |
KNAPSACK_MULTIDIMENSION_CBC_MIP_SOLVER | |
KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER | |
KNAPSACK_MULTIDIMENSION_SCIP_MIP_SOLVER | |
KNAPSACK_DIVIDE_AND_CONQUER_SOLVER | |
KNAPSACK_MULTIDIMENSION_CP_SAT_SOLVER | |
Definition at line 111 of file KnapsackSolver.cs.
◆ KnapsackSolver() [1/2]
Google.OrTools.Algorithms.KnapsackSolver.KnapsackSolver |
( |
string | solver_name | ) |
|
|
inline |
◆ KnapsackSolver() [2/2]
◆ BestSolutionContains()
bool Google.OrTools.Algorithms.KnapsackSolver.BestSolutionContains |
( |
int | item_id | ) |
|
|
inline |
◆ Dispose() [1/2]
void Google.OrTools.Algorithms.KnapsackSolver.Dispose |
( |
| ) |
|
|
inline |
◆ Dispose() [2/2]
virtual void Google.OrTools.Algorithms.KnapsackSolver.Dispose |
( |
bool | disposing | ) |
|
|
inlineprotectedvirtual |
◆ GetName()
string Google.OrTools.Algorithms.KnapsackSolver.GetName |
( |
| ) |
|
|
inline |
◆ Init()
void Google.OrTools.Algorithms.KnapsackSolver.Init |
( |
long[] | profits, |
|
|
long | weights[,], |
|
|
long[] | capacities ) |
|
inline |
◆ IsSolutionOptimal()
bool Google.OrTools.Algorithms.KnapsackSolver.IsSolutionOptimal |
( |
| ) |
|
|
inline |
◆ set_time_limit()
void Google.OrTools.Algorithms.KnapsackSolver.set_time_limit |
( |
double | time_limit_seconds | ) |
|
|
inline |
◆ SetUseReduction()
void Google.OrTools.Algorithms.KnapsackSolver.SetUseReduction |
( |
bool | use_reduction | ) |
|
|
inline |
◆ Solve()
long Google.OrTools.Algorithms.KnapsackSolver.Solve |
( |
| ) |
|
|
inline |
◆ UseReduction()
bool Google.OrTools.Algorithms.KnapsackSolver.UseReduction |
( |
| ) |
|
|
inline |
◆ swigCMemOwn
bool Google.OrTools.Algorithms.KnapsackSolver.swigCMemOwn |
|
protected |
The documentation for this class was generated from the following file: