<divclass="ttc"id="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_a3df739a2d84a936adba6bd1421a705b6"><divclass="ttname"><ahref="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a3df739a2d84a936adba6bd1421a705b6">com.google.ortools.algorithms.KnapsackSolver.isSolutionOptimal</a></div><divclass="ttdeci">boolean isSolutionOptimal()</div><divclass="ttdoc">Returns true if the solution was proven optimal.</div><divclass="ttdef"><b>Definition:</b><ahref="KnapsackSolver_8java_source.html#l00157">KnapsackSolver.java:157</a></div></div>
<divclass="ttc"id="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html_a937cac4cf730d006d544209fa2e161f8"><divclass="ttname"><ahref="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType.html#a937cac4cf730d006d544209fa2e161f8">com.google.ortools.algorithms.KnapsackSolver.SolverType.KNAPSACK_64ITEMS_SOLVER</a></div><divclass="ttdeci">KNAPSACK_64ITEMS_SOLVER</div><divclass="ttdoc">Optimized method for single dimension small problems Limited to 64 items and one dimension,...</div><divclass="ttdef"><b>Definition:</b><ahref="KnapsackSolver_8java_source.html#l00206">KnapsackSolver.java:206</a></div></div>
<divclass="ttc"id="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html_ac8a2a25d2eb059cf0edd14d351bff019"><divclass="ttname"><ahref="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType.html#ac8a2a25d2eb059cf0edd14d351bff019">com.google.ortools.algorithms.KnapsackSolver.SolverType.KNAPSACK_BRUTE_FORCE_SOLVER</a></div><divclass="ttdeci">KNAPSACK_BRUTE_FORCE_SOLVER</div><divclass="ttdoc">Brute force method.</div><divclass="ttdef"><b>Definition:</b><ahref="KnapsackSolver_8java_source.html#l00198">KnapsackSolver.java:198</a></div></div>
<divclass="ttc"id="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html_a89153f5268eda524c9221a919c3bc486"><divclass="ttname"><ahref="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType.html#a89153f5268eda524c9221a919c3bc486">com.google.ortools.algorithms.KnapsackSolver.SolverType.KNAPSACK_MULTIDIMENSION_CBC_MIP_SOLVER</a></div><divclass="ttdeci">KNAPSACK_MULTIDIMENSION_CBC_MIP_SOLVER</div><divclass="ttdoc">CBC Based Solver This solver can deal with both large number of items and several dimensions.</div><divclass="ttdef"><b>Definition:</b><ahref="KnapsackSolver_8java_source.html#l00221">KnapsackSolver.java:221</a></div></div>
<divclass="ttc"id="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_a1990a3432b2dda788b57013d9c9385f6"><divclass="ttname"><ahref="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a1990a3432b2dda788b57013d9c9385f6">com.google.ortools.algorithms.KnapsackSolver.init</a></div><divclass="ttdeci">void init(long[] profits, long[][] weights, long[] capacities)</div><divclass="ttdoc">Initializes the solver and enters the problem to be solved.</div><divclass="ttdef"><b>Definition:</b><ahref="KnapsackSolver_8java_source.html#l00136">KnapsackSolver.java:136</a></div></div>
<divclass="ttc"id="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html"><divclass="ttname"><ahref="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType.html">com.google.ortools.algorithms.KnapsackSolver.SolverType</a></div><divclass="ttdoc">Enum controlling which underlying algorithm is used.</div><divclass="ttdef"><b>Definition:</b><ahref="KnapsackSolver_8java_source.html#l00189">KnapsackSolver.java:189</a></div></div>
<divclass="ttc"id="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_a1a149fcd68c2a4e370f7b9d171a1ca48"><divclass="ttname"><ahref="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a1a149fcd68c2a4e370f7b9d171a1ca48">com.google.ortools.algorithms.KnapsackSolver.solve</a></div><divclass="ttdeci">long solve()</div><divclass="ttdoc">Solves the problem and returns the profit of the optimal solution.</div><divclass="ttdef"><b>Definition:</b><ahref="KnapsackSolver_8java_source.html#l00143">KnapsackSolver.java:143</a></div></div>
<divclass="ttc"id="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html_ab43b8ea551128c58807e93b368cf5547"><divclass="ttname"><ahref="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType.html#ab43b8ea551128c58807e93b368cf5547">com.google.ortools.algorithms.KnapsackSolver.SolverType.swigValue</a></div><divclass="ttdeci">final int swigValue()</div><divclass="ttdef"><b>Definition:</b><ahref="KnapsackSolver_8java_source.html#l00230">KnapsackSolver.java:230</a></div></div>
<divclass="ttc"id="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html_ab4681ad1cf2eb38d5ae7c8bc05f04bb2"><divclass="ttname"><ahref="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType.html#ab4681ad1cf2eb38d5ae7c8bc05f04bb2">com.google.ortools.algorithms.KnapsackSolver.SolverType.KNAPSACK_DYNAMIC_PROGRAMMING_SOLVER</a></div><divclass="ttdeci">KNAPSACK_DYNAMIC_PROGRAMMING_SOLVER</div><divclass="ttdoc">Dynamic Programming approach for single dimension problems Limited to one dimension,...</div><divclass="ttdef"><b>Definition:</b><ahref="KnapsackSolver_8java_source.html#l00214">KnapsackSolver.java:214</a></div></div>
<divclass="ttc"id="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_ab197dcc4afcd5c74285ed4b70ed0a16e"><divclass="ttname"><ahref="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#ab197dcc4afcd5c74285ed4b70ed0a16e">com.google.ortools.algorithms.KnapsackSolver.bestSolutionContains</a></div><divclass="ttdeci">boolean bestSolutionContains(int item_id)</div><divclass="ttdoc">Returns true if the item 'item_id' is packed in the optimal knapsack.</div><divclass="ttdef"><b>Definition:</b><ahref="KnapsackSolver_8java_source.html#l00150">KnapsackSolver.java:150</a></div></div>
