always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
b7ed2f5355709ffbe75934a57e82c88bbacf7314
ortools-clone/docs/java/KnapsackSolver_8java_source.html

117 lines
38 KiB
HTML
Raw Normal View History

C++ doc for CP-SAT; Java doc for all libraries
2019-06-13 13:08:49 +02:00
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
build java doc
2019-06-13 02:45:44 +02:00
<html xmlns="http://www.w3.org/1999/xhtml">
C++ doc for CP-SAT; Java doc for all libraries
2019-06-13 13:08:49 +02:00
<head>
<title>OR-Tools</title>
<meta http-equiv="Content-Type" content="text/html;"/>
<meta charset="utf-8"/>
<!--<link rel='stylesheet' type='text/css' href="https://fonts.googleapis.com/css?family=Ubuntu:400,700,400italic"/>-->
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
Update generated doc
2020-09-01 16:00:33 +02:00
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
C++ doc for CP-SAT; Java doc for all libraries
2019-06-13 13:08:49 +02:00
</head>
<body>
<div id="banner-container">
<div id="banner">
docs: Update to v9.2
2021-12-14 13:41:01 +01:00
<span id="sfml">Google OR-Tools 9.2</span>
C++ doc for CP-SAT; Java doc for all libraries
2019-06-13 13:08:49 +02:00
</div>
</div>
revamp refman generation
2019-08-07 18:01:08 -07:00
<div id="content" style="width: 100%; overflow: hidden;">
<div style="margin-left: 15px; margin-top: 5px; float: left; color: #145A32;">
update doc
2019-08-12 09:16:03 -07:00
<h2>Java Reference</h2>
revamp refman generation
2019-08-07 18:01:08 -07:00
<ul>
<li><a href="../java/namespacecom_1_1google_1_1ortools_1_1sat.html">CP-SAT</a></li>
<li><a href="../java/namespacecom_1_1google_1_1ortools_1_1graph.html">Graph</a></li>
<li><a href="../java/namespacecom_1_1google_1_1ortools_1_1algorithms.html">Knapsack solver</a></li>
<li><a href="../java/namespacecom_1_1google_1_1ortools_1_1linearsolver.html">Linear solver</a></li>
<li><a href="../java/namespacecom_1_1google_1_1ortools_1_1constraintsolver.html">Routing</a></li>
<li><a href="../java/namespacecom_1_1google_1_1ortools_1_1util.html">Util</a></li>
</ul>
</div>
C++ doc for CP-SAT; Java doc for all libraries
2019-06-13 13:08:49 +02:00
<div id="content">
revamp refman generation
2019-08-07 18:01:08 -07:00
<div align="center">
<h1 style="color: #145A32;">Java Reference</h1>
</div>
regenerate doc
2022-01-16 18:02:36 +01:00
<!-- Generated by Doxygen 1.8.15 -->
Update generated doc
2020-09-01 16:00:33 +02:00
<script type="text/javascript">
regenerate doc
2022-01-16 18:02:36 +01:00
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
Update generated doc
2020-09-01 16:00:33 +02:00
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
regenerate doc
2022-01-16 18:02:36 +01:00
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
Update generated doc
2020-09-01 16:00:33 +02:00
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
regenerate doc
2022-01-16 18:02:36 +01:00
/* @license-end */</script>
Update generated doc
2020-09-01 16:00:33 +02:00
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
build java doc
2019-06-13 02:45:44 +02:00
</div>
</div>
Update generated doc
2020-09-01 16:00:33 +02:00
<script type="text/javascript">
regenerate doc
2022-01-16 18:02:36 +01:00
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('KnapsackSolver_8java_source.html','');});
Update generated doc
2020-09-01 16:00:33 +02:00
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
build java doc
2019-06-13 02:45:44 +02:00
<div class="header">
regenerate doc
2022-01-16 18:02:36 +01:00
<div class="headertitle">
<div class="title">KnapsackSolver.java</div> </div>
build java doc
2019-06-13 02:45:44 +02:00
</div><!--header-->
<div class="contents">
regenerate doc
2022-01-16 18:02:36 +01:00
<a href="KnapsackSolver_8java.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span>&#160;<span class="comment">/* ----------------------------------------------------------------------------</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment"> * This file was automatically generated by SWIG (http://www.swig.org).</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<span class="comment"> * Version 4.0.1</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span>&#160;<span class="comment"> *</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span>&#160;<span class="comment"> * Do not make changes to this file unless you know what you are doing--modify</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<span class="comment"> * the SWIG interface file instead.</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span>&#160;<span class="comment"> * ----------------------------------------------------------------------------- */</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;</div><div class="line"><a name="l00009"></a><span class="lineno"><a class="line" href="namespacecom_1_1google_1_1ortools_1_1algorithms.html"> 9</a></span>&#160;<span class="keyword">package </span>com.google.ortools.algorithms;</div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;</div><div class="line"><a name="l00094"></a><span class="lineno"><a class="line" href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html"> 94</a></span>&#160;<span class="keyword">public</span> <span class="keyword">class </span><a class="code" href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html">KnapsackSolver</a> {</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; <span class="keyword">private</span> <span class="keyword">transient</span> <span class="keywordtype">long</span> swigCPtr;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; <span class="keyword">protected</span> <span class="keyword">transient</span> <span class="keywordtype">boolean</span> swigCMemOwn;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160;</div><div class="line"><a name="l00098"></a><span class="lineno"><a class="line" href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a5a34e5c7e57b5b97108c0ca319a9e532"> 98</a></span>&#160; <span class="keyword">protected</span> <a class="code" href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a5a34e5c7e57b5b97108c0ca319a9e532">KnapsackSolver</a>(<span class="keywordtype">long</span> cPtr, <span class="keywordtype">boolean</span> cMemoryOwn) {</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; swigCMemOwn = cMemoryOwn;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; swigCPtr = cPtr;</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; }</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; <span class="keyword">protected</span> <span class="keyword">static</span> <span class="keywordtype">long</span> getCPtr(<a class="code" href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html">KnapsackSolver</a> obj) {</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; <span class="keywordflow">return</span> (obj == <span class="keyword">null</span>) ? 0 : obj.swigCPtr;</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; }</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160;</div><div cla
<div class="ttc" id="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_a1b60fff25fee921a74e7c882486d573b"><div class="ttname"><a href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a1b60fff25fee921a74e7c882486d573b">com.google.ortools.algorithms.KnapsackSolver.KnapsackSolver</a></div><div class="ttdeci">KnapsackSolver(String solver_name)</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00122">KnapsackSolver.java:122</a></div></div>
<div class="ttc" id="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_a3df739a2d84a936adba6bd1421a705b6"><div class="ttname"><a href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a3df739a2d84a936adba6bd1421a705b6">com.google.ortools.algorithms.KnapsackSolver.isSolutionOptimal</a></div><div class="ttdeci">boolean isSolutionOptimal()</div><div class="ttdoc">Returns true if the solution was proven optimal.</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00154">KnapsackSolver.java:154</a></div></div>
<div class="ttc" id="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html_a937cac4cf730d006d544209fa2e161f8"><div class="ttname"><a href="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType.html#a937cac4cf730d006d544209fa2e161f8">com.google.ortools.algorithms.KnapsackSolver.SolverType.KNAPSACK_64ITEMS_SOLVER</a></div><div class="ttdeci">KNAPSACK_64ITEMS_SOLVER</div><div class="ttdoc">Optimized method for single dimension small problems Limited to 64 items and one dimension,...</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00203">KnapsackSolver.java:203</a></div></div>
<div class="ttc" id="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html_ac8a2a25d2eb059cf0edd14d351bff019"><div class="ttname"><a href="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><div class="ttdeci">KNAPSACK_BRUTE_FORCE_SOLVER</div><div class="ttdoc">Brute force method.</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00195">KnapsackSolver.java:195</a></div></div>
<div class="ttc" id="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html_a89153f5268eda524c9221a919c3bc486"><div class="ttname"><a href="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><div class="ttdeci">KNAPSACK_MULTIDIMENSION_CBC_MIP_SOLVER</div><div class="ttdoc">CBC Based Solver This solver can deal with both large number of items and several dimensions.</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00218">KnapsackSolver.java:218</a></div></div>
<div class="ttc" id="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_a1990a3432b2dda788b57013d9c9385f6"><div class="ttname"><a href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a1990a3432b2dda788b57013d9c9385f6">com.google.ortools.algorithms.KnapsackSolver.init</a></div><div class="ttdeci">void init(long[] profits, long[][] weights, long[] capacities)</div><div class="ttdoc">Initializes the solver and enters the problem to be solved.</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00133">KnapsackSolver.java:133</a></div></div>
<div class="ttc" id="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html_a5a46e9523106e952654fdb6f0cf1c958"><div class="ttname"><a href="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType.html#a5a46e9523106e952654fdb6f0cf1c958">com.google.ortools.algorithms.KnapsackSolver.SolverType.swigToEnum</a></div><div class="ttdeci">static SolverType swigToEnum(int swigValue)</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00231">KnapsackSolver.java:231</a></div></div>
<div class="ttc" id="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_a9f6a41ed1718d61764c2a965b2e6a6a3"><div class="ttname"><a href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a9f6a41ed1718d61764c2a965b2e6a6a3">com.google.ortools.algorithms.KnapsackSolver.setTimeLimit</a></div><div class="ttdeci">void setTimeLimit(double time_limit_seconds)</div><div class="ttdoc">Time limit in seconds.</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00176">KnapsackSolver.java:176</a></div></div>
<div class="ttc" id="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_a5a34e5c7e57b5b97108c0ca319a9e532"><div class="ttname"><a href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a5a34e5c7e57b5b97108c0ca319a9e532">com.google.ortools.algorithms.KnapsackSolver.KnapsackSolver</a></div><div class="ttdeci">KnapsackSolver(long cPtr, boolean cMemoryOwn)</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00098">KnapsackSolver.java:98</a></div></div>
<div class="ttc" id="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html"><div class="ttname"><a href="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType.html">com.google.ortools.algorithms.KnapsackSolver.SolverType</a></div><div class="ttdoc">Enum controlling which underlying algorithm is used.</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00186">KnapsackSolver.java:186</a></div></div>
<div class="ttc" id="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html"><div class="ttname"><a href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html">com.google.ortools.algorithms.KnapsackSolver</a></div><div class="ttdoc">This library solves knapsack problems.</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00094">KnapsackSolver.java:94</a></div></div>
<div class="ttc" id="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_a1a149fcd68c2a4e370f7b9d171a1ca48"><div class="ttname"><a href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a1a149fcd68c2a4e370f7b9d171a1ca48">com.google.ortools.algorithms.KnapsackSolver.solve</a></div><div class="ttdeci">long solve()</div><div class="ttdoc">Solves the problem and returns the profit of the optimal solution.</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00140">KnapsackSolver.java:140</a></div></div>
<div class="ttc" id="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html_ab43b8ea551128c58807e93b368cf5547"><div class="ttname"><a href="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType.html#ab43b8ea551128c58807e93b368cf5547">com.google.ortools.algorithms.KnapsackSolver.SolverType.swigValue</a></div><div class="ttdeci">final int swigValue()</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00227">KnapsackSolver.java:227</a></div></div>
<div class="ttc" id="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_a78ee178b6a73658d65ca60da4d1e6683"><div class="ttname"><a href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#a78ee178b6a73658d65ca60da4d1e6683">com.google.ortools.algorithms.KnapsackSolver.getName</a></div><div class="ttdeci">String getName()</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00158">KnapsackSolver.java:158</a></div></div>
<div class="ttc" id="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html_ab4681ad1cf2eb38d5ae7c8bc05f04bb2"><div class="ttname"><a href="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><div class="ttdeci">KNAPSACK_DYNAMIC_PROGRAMMING_SOLVER</div><div class="ttdoc">Dynamic Programming approach for single dimension problems Limited to one dimension,...</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00211">KnapsackSolver.java:211</a></div></div>
<div class="ttc" id="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_ae3fb2037c22db362ab3349139ce19ba5"><div class="ttname"><a href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#ae3fb2037c22db362ab3349139ce19ba5">com.google.ortools.algorithms.KnapsackSolver.useReduction</a></div><div class="ttdeci">boolean useReduction()</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00162">KnapsackSolver.java:162</a></div></div>
<div class="ttc" id="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_af6b9045f4a2d184e82f4695176b1db0d"><div class="ttname"><a href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#af6b9045f4a2d184e82f4695176b1db0d">com.google.ortools.algorithms.KnapsackSolver.setUseReduction</a></div><div class="ttdeci">void setUseReduction(boolean use_reduction)</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00166">KnapsackSolver.java:166</a></div></div>
<div class="ttc" id="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType_html_ab2e039228749cc14e88c43d7ebf2d31d"><div class="ttname"><a href="enumcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_1_1SolverType.html#ab2e039228749cc14e88c43d7ebf2d31d">com.google.ortools.algorithms.KnapsackSolver.SolverType.KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER</a></div><div class="ttdeci">KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER</div><div class="ttdoc">Generic Solver.</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00225">KnapsackSolver.java:225</a></div></div>
<div class="ttc" id="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver_html_ab197dcc4afcd5c74285ed4b70ed0a16e"><div class="ttname"><a href="classcom_1_1google_1_1ortools_1_1algorithms_1_1KnapsackSolver.html#ab197dcc4afcd5c74285ed4b70ed0a16e">com.google.ortools.algorithms.KnapsackSolver.bestSolutionContains</a></div><div class="ttdeci">boolean bestSolutionContains(int item_id)</div><div class="ttdoc">Returns true if the item 'item_id' is packed in the optimal knapsack.</div><div class="ttdef"><b>Definition:</b> <a href="KnapsackSolver_8java_source.html#l00147">KnapsackSolver.java:147</a></div></div>
Bump version 8.1 -> 8.2
2021-01-26 11:28:50 +01:00
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
revamp refman generation
2019-08-07 18:01:08 -07:00
</div>
C++ doc for CP-SAT; Java doc for all libraries
2019-06-13 13:08:49 +02:00
</div>
<div id="footer-container">
<div id="footer">
</div>
</div>
</body>
build java doc
2019-06-13 02:45:44 +02:00
</html>
Reference in New Issue Copy Permalink