<ahref="KnapsackSolver_8java.html">Go to the documentation of this file.</a><divclass="fragment"><divclass="line"><aname="l00001"></a><spanclass="lineno"> 1</span> <spanclass="comment">/* ----------------------------------------------------------------------------</span></div><divclass="line"><aname="l00002"></a><spanclass="lineno"> 2</span> <spanclass="comment"> * This file was automatically generated by SWIG (http://www.swig.org).</span></div><divclass="line"><aname="l00003"></a><spanclass="lineno"> 3</span> <spanclass="comment"> * Version 4.0.0</span></div><divclass="line"><aname="l00004"></a><spanclass="lineno"> 4</span> <spanclass="comment"> *</span></div><divclass="line"><aname="l00005"></a><spanclass="lineno"> 5</span> <spanclass="comment"> * Do not make changes to this file unless you know what you are doing--modify</span></div><divclass="line"><aname="l00006"></a><spanclass="lineno"> 6</span> <spanclass="comment"> * the SWIG interface file instead.</span></div><divclass="line"><aname="l00007"></a><spanclass="lineno"> 7</span> <spanclass="comment"> * ----------------------------------------------------------------------------- */</span></div><divclass="line"><aname="l00008"></a><spanclass="lineno"> 8</span> </div><divclass="line"><aname="l00009"></a><spanclass="lineno"><aclass="line"href="namespacecom_1_1google_1_1ortools_1_1algorithms.html"> 9</a></span> <spanclass="keyword">package </span>com.google.ortools.algorithms;</div><divclass="line"><aname="l00010"></a><spanclass="lineno"> 10</span> </div><divclass="line"><aname="l00097"></a><spanclass="lineno"><aclass="line"href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html"> 97</a></span> <spanclass="keyword">public</span><spanclass="keyword">class </span><aclass="code"href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html">KnapsackSolver</a> {</div><divclass="line"><aname="l00098"></a><spanclass="lineno"> 98</span> <spanclass="keyword">private</span><spanclass="keyword">transient</span><spanclass="keywordtype">long</span> swigCPtr;</div><divclass="line"><aname="l00099"></a><spanclass="lineno"> 99</span> <spanclass="keyword">protected</span><spanclass="keyword">transient</span><spanclass="keywordtype">boolean</span> swigCMemOwn;</div><divclass="line"><aname="l00100"></a><spanclass="lineno"> 100</span> </div><divclass="line"><aname="l00101"></a><spanclass="lineno"><aclass="line"href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a4af9744830d1c4b8a1428f6987a83848"> 101</a></span> <spanclass="keyword">protected</span><aclass="code"href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a4af9744830d1c4b8a1428f6987a83848">KnapsackSolver</a>(<spanclass="keywordtype">long</span> cPtr, <spanclass="keywordtype">boolean</span> cMemoryOwn) {</div><divclass="line"><aname="l00102"></a><spanclass="lineno"> 102</span>  swigCMemOwn = cMemoryOwn;</div><divclass="line"><aname="l00103"></a><spanclass="lineno"> 103</span>  swigCPtr = cPtr;</div><divclass="line"><aname="l00104"></a><spanclass="lineno"> 104</span>  }</div><divclass="line"><aname="l00105"></a><spanclass="lineno"> 105</span> </div><divclass="line"><aname="l00106"></a><spanclass="lineno"> 106</span> <spanclass="keyword">protected</span><spanclass="keyword">static</span><spanclass="keywordtype">long</span> getCPtr(<aclass="code"href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html">KnapsackSolver</a> obj) {</div><divclass="line"><aname="l00107"></a><spanclass="lineno"> 107</span> <spanclass="keywordflow">return</span> (obj == <spanclass="keyword">null</span>) ? 0 : obj.swigCPtr;</div><divclass="line"><aname="l00108"></a><spanclass="lineno"> 108</span>  }</div><divclass="line"><aname="l00109"></a><spanclass="lineno"> 109</span> </div><divcla
<divclass="ttc"id="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_a4c448eb5e9b767c402d9c3b55ead64f3"><divclass="ttname"><ahref="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a4c448eb5e9b767c402d9c3b55ead64f3">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="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_a5b08123bb36b0d7294f2630cbfeb9121"><divclass="ttname"><ahref="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a5b08123bb36b0d7294f2630cbfeb9121">com.google.ortools.algorithms.KnapsackSolver.setTimeLimit</a></div><divclass="ttdeci">void setTimeLimit(double time_limit_seconds)</div><divclass="ttdoc">Time limit in seconds.</div><divclass="ttdef"><b>Definition:</b><ahref="KnapsackSolver_8java_source.html#l00179">KnapsackSolver.java:179</a></div></div>
<divclass="ttc"id="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html_acabadf68ecf9fc0cf8d6536fb3c9849b"><divclass="ttname"><ahref="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType.html#acabadf68ecf9fc0cf8d6536fb3c9849b">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="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html_a0f4f9a731e7b06b97363d3db5e7242b2"><divclass="ttname"><ahref="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType.html#a0f4f9a731e7b06b97363d3db5e7242b2">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_ad42ed19878d99f727cfb897963df6fe5"><divclass="ttname"><ahref="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType.html#ad42ed19878d99f727cfb897963df6fe5">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="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_a4289dd15929df6a7b20acbac3f6eae55"><divclass="ttname"><ahref="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a4289dd15929df6a7b20acbac3f6eae55">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>
<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="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html_ad51bb5a93f6c00dbdb8f2dce5d4bc0ba"><divclass="ttname"><ahref="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType.html#ad51bb5a93f6c00dbdb8f2dce5d4bc0ba">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="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html_a70d82302e63947eaa0c6611bc374a1d7"><divclass="ttname"><ahref="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType.html#a70d82302e63947eaa0c6611bc374a1d7">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="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_a4739782e483a17d41c93850f372f22e4"><divclass="ttname"><ahref="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a4739782e483a17d41c93850f372f22e4">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>
