1636 lines
306 KiB
HTML
1636 lines
306 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: knapsack_solver.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">8.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<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">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('knapsack__solver_8cc_source.html',''); initResizable(); });
|
|
/* @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>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">knapsack_solver.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="knapsack__solver_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="knapsack__solver_8h.html">ortools/algorithms/knapsack_solver.h</a>"</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  </div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <queue></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>  </div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "absl/memory/memory.h"</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="stl__util_8h.html">ortools/base/stl_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="linear__solver_8h.html">ortools/linear_solver/linear_solver.h</a>"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="bitset_8h.html">ortools/util/bitset.h</a>"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="time__limit_8h.html">ortools/util/time_limit.h</a>"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  </div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  </div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="keyword">const</span> <span class="keywordtype">int</span> kNoSelection = -1;</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">const</span> <span class="keywordtype">int</span> kMasterPropagatorId = 0;</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">const</span> <span class="keywordtype">int</span> kMaxNumberOfBruteForceItems = 30;</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">const</span> <span class="keywordtype">int</span> kMaxNumberOf64Items = 64;</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  </div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// Comparator used to sort item in decreasing efficiency order</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// (see KnapsackCapacityPropagator).</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="keyword">struct </span>CompareKnapsackItemsInDecreasingEfficiencyOrder {</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keyword">explicit</span> CompareKnapsackItemsInDecreasingEfficiencyOrder(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> _profit_max)</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  : <a class="code" href="knapsack__solver_8cc.html#a6f2f9756946f8553d52c633b7acb44f3">profit_max</a>(_profit_max) {}</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ada7d9b46f657c6053a197273a85043a7">KnapsackItemPtr</a>& item1,</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ada7d9b46f657c6053a197273a85043a7">KnapsackItemPtr</a>& item2)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keywordflow">return</span> item1->GetEfficiency(<a class="code" href="knapsack__solver_8cc.html#a6f2f9756946f8553d52c633b7acb44f3">profit_max</a>) > item2->GetEfficiency(<a class="code" href="knapsack__solver_8cc.html#a6f2f9756946f8553d52c633b7acb44f3">profit_max</a>);</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  }</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="knapsack__solver_8cc.html#a6f2f9756946f8553d52c633b7acb44f3"> 44</a></span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="knapsack__solver_8cc.html#a6f2f9756946f8553d52c633b7acb44f3">profit_max</a>;</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> };</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  </div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// Comparator used to sort search nodes in the priority queue in order</span></div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// to pop first the node with the highest profit upper bound</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// (see KnapsackSearchNode). When two nodes have the same upper bound, we</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// prefer the one with the highest current profit, ie. usually the one closer</span></div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// to a leaf. In practice, the main advantage is to have smaller path.</span></div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="keyword">struct </span>CompareKnapsackSearchNodePtrInDecreasingUpperBoundOrder {</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> KnapsackSearchNode* node_1,</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">const</span> KnapsackSearchNode* node_2)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> profit_upper_bound_1 = node_1->profit_upper_bound();</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> profit_upper_bound_2 = node_2->profit_upper_bound();</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">if</span> (profit_upper_bound_1 == profit_upper_bound_2) {</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordflow">return</span> node_1->current_profit() < node_2->current_profit();</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  }</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">return</span> profit_upper_bound_1 < profit_upper_bound_2;</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  }</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> };</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  </div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="keyword">typedef</span> std::priority_queue<</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  KnapsackSearchNode*, std::vector<KnapsackSearchNode*>,</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  CompareKnapsackSearchNodePtrInDecreasingUpperBoundOrder></div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  SearchQueue;</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  </div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// Returns true when value_1 * value_2 may overflow int64.</span></div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> WillProductOverflow(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> value_1, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> value_2) {</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> MostSignificantBitPosition1 = <a class="code" href="namespaceoperations__research.html#a2f9ef253c023106392eb1495a277616b">MostSignificantBitPosition64</a>(value_1);</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> MostSignificantBitPosition2 = <a class="code" href="namespaceoperations__research.html#a2f9ef253c023106392eb1495a277616b">MostSignificantBitPosition64</a>(value_2);</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// The sum should be less than 61 to be safe as we are only considering the</span></div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// most significant bit and dealing with int64 instead of uint64.</span></div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> kOverflow = 61;</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordflow">return</span> MostSignificantBitPosition1 + MostSignificantBitPosition2 > kOverflow;</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> }</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  </div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment">// Returns an upper bound of (numerator_1 * numerator_2) / denominator</span></div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> UpperBoundOfRatio(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> numerator_1, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> numerator_2,</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> denominator) {</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(denominator, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>{0});</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">if</span> (!WillProductOverflow(numerator_1, numerator_2)) {</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> numerator = numerator_1 * numerator_2;</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">// Round to zero.</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> result = numerator / denominator;</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code" href="revised__simplex_8cc.html#af01c50e388647c921aa7d9c77f2b72b2">ratio</a> =</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  (<span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(numerator_1) * <span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(numerator_2)) /</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(denominator);</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">// Round near.</span></div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> result = <span class="keyword">static_cast<</span><a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a><span class="keyword">></span>(floor(<a class="code" href="revised__simplex_8cc.html#af01c50e388647c921aa7d9c77f2b72b2">ratio</a> + 0.5));</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  }</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> }</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  </div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  </div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment">// ----- KnapsackSearchNode -----</span></div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_search_node.html#ad17e46a2afcf393a4ec9159162c969f2"> 101</a></span> <a class="code" href="classoperations__research_1_1_knapsack_search_node.html#ad17e46a2afcf393a4ec9159162c969f2">KnapsackSearchNode::KnapsackSearchNode</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_knapsack_search_node.html">KnapsackSearchNode</a>* <span class="keyword">const</span> parent,</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_knapsack_assignment.html">KnapsackAssignment</a>& assignment)</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  : depth_((parent == nullptr) ? 0 : parent->depth() + 1),</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  parent_(parent),</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  assignment_(assignment),</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  current_profit_(0),</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  profit_upper_bound_(<a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>),</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  next_item_id_(kNoSelection) {}</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  </div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment">// ----- KnapsackSearchPath -----</span></div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_search_path.html#a3dc3602e1a640bc986956e0ce5e88d04"> 111</a></span> <a class="code" href="classoperations__research_1_1_knapsack_search_path.html#a3dc3602e1a640bc986956e0ce5e88d04">KnapsackSearchPath::KnapsackSearchPath</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_knapsack_search_node.html">KnapsackSearchNode</a>& from,</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_knapsack_search_node.html">KnapsackSearchNode</a>& to)</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  : from_(from), via_(nullptr), to_(to) {}</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  </div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_search_path.html#a1e3b6d38df0786ccf7f938d60e386aae"> 115</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack_search_path.html#a1e3b6d38df0786ccf7f938d60e386aae">KnapsackSearchPath::Init</a>() {</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_knapsack_search_node.html">KnapsackSearchNode</a>* node_from = <a class="code" href="classoperations__research_1_1_knapsack_search_path.html#a09f219a2226f7c0de0f50b6f00c099e3">MoveUpToDepth</a>(from_, to_.<a class="code" href="classoperations__research_1_1_knapsack_search_node.html#a6fdd73f8011695b97659f2bea29325cb">depth</a>());</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_knapsack_search_node.html">KnapsackSearchNode</a>* node_to = <a class="code" href="classoperations__research_1_1_knapsack_search_path.html#a09f219a2226f7c0de0f50b6f00c099e3">MoveUpToDepth</a>(to_, from_.<a class="code" href="classoperations__research_1_1_knapsack_search_node.html#a6fdd73f8011695b97659f2bea29325cb">depth</a>());</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(node_from-><a class="code" href="classoperations__research_1_1_knapsack_search_node.html#a6fdd73f8011695b97659f2bea29325cb">depth</a>(), node_to-><a class="code" href="classoperations__research_1_1_knapsack_search_node.html#a6fdd73f8011695b97659f2bea29325cb">depth</a>());</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  </div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// Find common parent.</span></div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">while</span> (node_from != node_to) {</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  node_from = node_from-><a class="code" href="classoperations__research_1_1_knapsack_search_node.html#afe9938cf4bbeb06ed8985c37646433fd">parent</a>();</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  node_to = node_to-><a class="code" href="classoperations__research_1_1_knapsack_search_node.html#afe9938cf4bbeb06ed8985c37646433fd">parent</a>();</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  }</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  via_ = node_from;</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span> }</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  </div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_search_path.html#a09f219a2226f7c0de0f50b6f00c099e3"> 128</a></span> <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_knapsack_search_node.html">KnapsackSearchNode</a>* <a class="code" href="classoperations__research_1_1_knapsack_search_path.html#a09f219a2226f7c0de0f50b6f00c099e3">KnapsackSearchPath::MoveUpToDepth</a>(</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_knapsack_search_node.html">KnapsackSearchNode</a>& node, <span class="keywordtype">int</span> depth)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_knapsack_search_node.html">KnapsackSearchNode</a>* current_node = &node;</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordflow">while</span> (current_node-><a class="code" href="classoperations__research_1_1_knapsack_search_node.html#a6fdd73f8011695b97659f2bea29325cb">depth</a>() > depth) {</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  current_node = current_node-><a class="code" href="classoperations__research_1_1_knapsack_search_node.html#afe9938cf4bbeb06ed8985c37646433fd">parent</a>();</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  }</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">return</span> current_node;</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> }</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  </div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment">// ----- KnapsackState -----</span></div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_state.html#a41f9430cc0090383e7797a88c1dbacbc"> 138</a></span> <a class="code" href="classoperations__research_1_1_knapsack_state.html#a41f9430cc0090383e7797a88c1dbacbc">KnapsackState::KnapsackState</a>() : is_bound_(), is_in_() {}</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  </div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_state.html#a6308c7a97200f84f6ebf5b2c487b0362"> 140</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack_state.html#a6308c7a97200f84f6ebf5b2c487b0362">KnapsackState::Init</a>(<span class="keywordtype">int</span> number_of_items) {</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  is_bound_.assign(number_of_items, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  is_in_.assign(number_of_items, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> }</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  </div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// Returns false when the state is invalid.</span></div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_state.html#ab771ac0e538f991b73b011ee3ba11f05"> 146</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_knapsack_state.html#ab771ac0e538f991b73b011ee3ba11f05">KnapsackState::UpdateState</a>(<span class="keywordtype">bool</span> revert,</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_knapsack_assignment.html">KnapsackAssignment</a>& assignment) {</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">if</span> (revert) {</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  is_bound_[assignment.<a class="code" href="structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32">item_id</a>] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">if</span> (is_bound_[assignment.<a class="code" href="structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32">item_id</a>] &&</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  is_in_[assignment.<a class="code" href="structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32">item_id</a>] != assignment.<a class="code" href="structoperations__research_1_1_knapsack_assignment.html#a922620900c7a18d22de686d47e25d4ed">is_in</a>) {</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  }</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  is_bound_[assignment.<a class="code" href="structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32">item_id</a>] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  is_in_[assignment.<a class="code" href="structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32">item_id</a>] = assignment.<a class="code" href="structoperations__research_1_1_knapsack_assignment.html#a922620900c7a18d22de686d47e25d4ed">is_in</a>;</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  }</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> }</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  </div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment">// ----- KnapsackPropagator -----</span></div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_propagator.html#af28391017c090a638200c57b4c8a2ac1"> 162</a></span> <a class="code" href="classoperations__research_1_1_knapsack_propagator.html#af28391017c090a638200c57b4c8a2ac1">KnapsackPropagator::KnapsackPropagator</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_knapsack_state.html">KnapsackState</a>& state)</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  : items_(),</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  current_profit_(0),</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  profit_lower_bound_(0),</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  profit_upper_bound_(<a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>),</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  state_(state) {}</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  </div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_propagator.html#af15d878d664ee8a07cf3b710f8047cba"> 169</a></span> <a class="code" href="classoperations__research_1_1_knapsack_propagator.html#af15d878d664ee8a07cf3b710f8047cba">KnapsackPropagator::~KnapsackPropagator</a>() { <a class="code" href="namespacegtl.html#a4ee3db0c4acaa0f277a0d7006f5ad1e6">gtl::STLDeleteElements</a>(&items_); }</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  </div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_propagator.html#a9fdde4d0e47bfb9ca54f16554a69ce1b"> 171</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack_propagator.html#a9fdde4d0e47bfb9ca54f16554a69ce1b">KnapsackPropagator::Init</a>(<span class="keyword">const</span> std::vector<int64>& profits,</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keyword">const</span> std::vector<int64>& weights) {</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> number_of_items = profits.size();</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  items_.assign(number_of_items, <span class="keyword">static_cast<</span><a class="code" href="structoperations__research_1_1_knapsack_item.html">KnapsackItemPtr</a><span class="keyword">></span>(<span class="keyword">nullptr</span>));</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < number_of_items; ++i) {</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  items_[i] = <span class="keyword">new</span> <a class="code" href="structoperations__research_1_1_knapsack_item.html">KnapsackItem</a>(i, weights[i], profits[i]);</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  }</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  current_profit_ = 0;</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  profit_lower_bound_ = <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>;</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  profit_upper_bound_ = <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <a class="code" href="classoperations__research_1_1_knapsack_propagator.html#a883cd053b1e7322727eb9e19940f69f6">InitPropagator</a>();</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span> }</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  </div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_propagator.html#af4b38123d3654471f0868774c5ff877d"> 184</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_knapsack_propagator.html#af4b38123d3654471f0868774c5ff877d">KnapsackPropagator::Update</a>(<span class="keywordtype">bool</span> revert,</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_knapsack_assignment.html">KnapsackAssignment</a>& assignment) {</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">if</span> (assignment.<a class="code" href="structoperations__research_1_1_knapsack_assignment.html#a922620900c7a18d22de686d47e25d4ed">is_in</a>) {</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">if</span> (revert) {</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  current_profit_ -= items_[assignment.<a class="code" href="structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32">item_id</a>]->profit;</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  current_profit_ += items_[assignment.<a class="code" href="structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32">item_id</a>]->profit;</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  }</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  }</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_knapsack_propagator.html#a5a0d11be6f0d5b521477226fb7573db8">UpdatePropagator</a>(revert, assignment);</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span> }</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  </div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_propagator.html#a1fa45af1bf0d6aa9d5f86e2ed9ae5323"> 196</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack_propagator.html#a1fa45af1bf0d6aa9d5f86e2ed9ae5323">KnapsackPropagator::CopyCurrentStateToSolution</a>(</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordtype">bool</span> has_one_propagator, std::vector<bool>* solution)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(solution != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_knapsack_item.html">KnapsackItem</a>* <span class="keyword">const</span> item : items_) {</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> item_id = item->id;</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  (*solution)[item_id] = state_.<a class="code" href="classoperations__research_1_1_knapsack_state.html#a89aa280d2321c1316aa1305106f1bb49">is_bound</a>(item_id) && state_.<a class="code" href="classoperations__research_1_1_knapsack_state.html#a862bf4e908cd82ea44f72e98558016ad">is_in</a>(item_id);</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  }</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">if</span> (has_one_propagator) {</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <a class="code" href="classoperations__research_1_1_knapsack_propagator.html#ab803770e8e21bb448a2f3d940ab125f8">CopyCurrentStateToSolutionPropagator</a>(solution);</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  }</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span> }</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  </div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment">// ----- KnapsackCapacityPropagator -----</span></div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_capacity_propagator.html#a0884060c60d64130c91ee7300cd3c4b0"> 209</a></span> <a class="code" href="classoperations__research_1_1_knapsack_capacity_propagator.html#a0884060c60d64130c91ee7300cd3c4b0">KnapsackCapacityPropagator::KnapsackCapacityPropagator</a>(</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_knapsack_state.html">KnapsackState</a>& state, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>)</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  : <a class="code" href="classoperations__research_1_1_knapsack_propagator.html">KnapsackPropagator</a>(state),</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  capacity_(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>),</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  consumed_capacity_(0),</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  break_item_id_(kNoSelection),</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  sorted_items_(),</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  profit_max_(0) {}</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  </div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_capacity_propagator.html#aa14e63156675c18c06073ac1cb8aa170"> 218</a></span> <a class="code" href="classoperations__research_1_1_knapsack_capacity_propagator.html#aa14e63156675c18c06073ac1cb8aa170">KnapsackCapacityPropagator::~KnapsackCapacityPropagator</a>() {}</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  </div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="comment">// TODO(user): Make it more incremental, by saving the break item in a</span></div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span> <span class="comment">// search node for instance.</span></div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_capacity_propagator.html#a9921c39ed90a9cd32301ee0fee9491cb"> 222</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack_capacity_propagator.html#a9921c39ed90a9cd32301ee0fee9491cb">KnapsackCapacityPropagator::ComputeProfitBounds</a>() {</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <a class="code" href="classoperations__research_1_1_knapsack_propagator.html#a69d95c916b31aeb94a63596cabb507dd">set_profit_lower_bound</a>(<a class="code" href="classoperations__research_1_1_knapsack_propagator.html#af41d4ebb02ec2b735851141b01f4769a">current_profit</a>());</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  break_item_id_ = kNoSelection;</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  </div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> remaining_capacity = capacity_ - consumed_capacity_;</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordtype">int</span> break_sorted_item_id = kNoSelection;</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> number_of_sorted_items = sorted_items_.size();</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> sorted_id = 0; sorted_id < number_of_sorted_items; ++sorted_id) {</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_knapsack_item.html">KnapsackItem</a>* <span class="keyword">const</span> item = sorted_items_[sorted_id];</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_knapsack_propagator.html#a9b748c5fb5e1da5da53026ffb91db51f">state</a>().is_bound(item-><a class="code" href="structoperations__research_1_1_knapsack_item.html#a64ae40793ade89d800a8c5646d2980fc">id</a>)) {</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  break_item_id_ = item-><a class="code" href="structoperations__research_1_1_knapsack_item.html#a64ae40793ade89d800a8c5646d2980fc">id</a>;</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  </div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keywordflow">if</span> (remaining_capacity >= item-><a class="code" href="structoperations__research_1_1_knapsack_item.html#a965717cd1b82709b7fc2d04aa3f8796d">weight</a>) {</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  remaining_capacity -= item-><a class="code" href="structoperations__research_1_1_knapsack_item.html#a965717cd1b82709b7fc2d04aa3f8796d">weight</a>;</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <a class="code" href="classoperations__research_1_1_knapsack_propagator.html#a69d95c916b31aeb94a63596cabb507dd">set_profit_lower_bound</a>(<a class="code" href="classoperations__research_1_1_knapsack_propagator.html#a0dbb4d48acf17b899ecf83ea7e38fdc6">profit_lower_bound</a>() + item-><a class="code" href="structoperations__research_1_1_knapsack_item.html#a7a9c8a0c92aa590e21fcb9006e4dc004">profit</a>);</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  break_sorted_item_id = sorted_id;</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  }</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  }</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  }</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  </div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <a class="code" href="classoperations__research_1_1_knapsack_propagator.html#ab7f8c7e53d1f8f72cb6b1a2bffae2407">set_profit_upper_bound</a>(<a class="code" href="classoperations__research_1_1_knapsack_propagator.html#a0dbb4d48acf17b899ecf83ea7e38fdc6">profit_lower_bound</a>());</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  </div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordflow">if</span> (break_sorted_item_id != kNoSelection) {</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> additional_profit =</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  GetAdditionalProfit(remaining_capacity, break_sorted_item_id);</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <a class="code" href="classoperations__research_1_1_knapsack_propagator.html#ab7f8c7e53d1f8f72cb6b1a2bffae2407">set_profit_upper_bound</a>(<a class="code" href="classoperations__research_1_1_knapsack_propagator.html#ade05a213d54a2045bab20c41e56a2144">profit_upper_bound</a>() + additional_profit);</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  }</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span> }</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  </div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_capacity_propagator.html#ae2545020be753ee6a66c277daac41784"> 253</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack_capacity_propagator.html#ae2545020be753ee6a66c277daac41784">KnapsackCapacityPropagator::InitPropagator</a>() {</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  consumed_capacity_ = 0;</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  break_item_id_ = kNoSelection;</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  sorted_items_ = <a class="code" href="classoperations__research_1_1_knapsack_propagator.html#aa4161d4fb0a577a3e854b7f285d7ace6">items</a>();</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  profit_max_ = 0;</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_knapsack_item.html">KnapsackItem</a>* <span class="keyword">const</span> item : sorted_items_) {</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  profit_max_ = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(profit_max_, item->profit);</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  }</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  ++profit_max_;</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  CompareKnapsackItemsInDecreasingEfficiencyOrder compare_object(profit_max_);</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  std::sort(sorted_items_.begin(), sorted_items_.end(), compare_object);</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span> }</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  </div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="comment">// Returns false when the propagator fails.</span></div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_capacity_propagator.html#a3cde41b7fa0c9734783a562aadd9ef8c"> 267</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_knapsack_capacity_propagator.html#a3cde41b7fa0c9734783a562aadd9ef8c">KnapsackCapacityPropagator::UpdatePropagator</a>(</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordtype">bool</span> revert, <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_knapsack_assignment.html">KnapsackAssignment</a>& assignment) {</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordflow">if</span> (assignment.<a class="code" href="structoperations__research_1_1_knapsack_assignment.html#a922620900c7a18d22de686d47e25d4ed">is_in</a>) {</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordflow">if</span> (revert) {</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  consumed_capacity_ -= <a class="code" href="classoperations__research_1_1_knapsack_propagator.html#aa4161d4fb0a577a3e854b7f285d7ace6">items</a>()[assignment.<a class="code" href="structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32">item_id</a>]->weight;</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  consumed_capacity_ += <a class="code" href="classoperations__research_1_1_knapsack_propagator.html#aa4161d4fb0a577a3e854b7f285d7ace6">items</a>()[assignment.<a class="code" href="structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32">item_id</a>]->weight;</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">if</span> (consumed_capacity_ > capacity_) {</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  }</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  }</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  }</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span> }</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  </div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_capacity_propagator.html#a706a3a7c9568016131afd718f347ec8d"> 282</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack_capacity_propagator.html#a706a3a7c9568016131afd718f347ec8d">KnapsackCapacityPropagator::CopyCurrentStateToSolutionPropagator</a>(</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  std::vector<bool>* solution)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(solution != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> remaining_capacity = capacity_ - consumed_capacity_;</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_knapsack_item.html">KnapsackItem</a>* <span class="keyword">const</span> item : sorted_items_) {</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_knapsack_propagator.html#a9b748c5fb5e1da5da53026ffb91db51f">state</a>().is_bound(item->id)) {</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordflow">if</span> (remaining_capacity >= item->weight) {</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  remaining_capacity -= item->weight;</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  (*solution)[item->id] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  }</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  }</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  }</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span> }</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  </div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> KnapsackCapacityPropagator::GetAdditionalProfit(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> remaining_capacity,</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordtype">int</span> break_item_id)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> after_break_item_id = break_item_id + 1;</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> additional_profit_when_no_break_item = 0;</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordflow">if</span> (after_break_item_id < sorted_items_.size()) {</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="comment">// As items are sorted by decreasing profit / weight ratio, and the current</span></div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="comment">// weight is non-zero, the next_weight is non-zero too.</span></div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> next_weight = sorted_items_[after_break_item_id]->weight;</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> next_profit = sorted_items_[after_break_item_id]->profit;</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  additional_profit_when_no_break_item =</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  UpperBoundOfRatio(remaining_capacity, next_profit, next_weight);</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  }</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  </div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> before_break_item_id = break_item_id - 1;</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> additional_profit_when_break_item = 0;</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordflow">if</span> (before_break_item_id >= 0) {</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> previous_weight = sorted_items_[before_break_item_id]->weight;</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="comment">// Having previous_weight == 0 means the total capacity is smaller than</span></div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="comment">// the weight of the current item. In such a case the item cannot be part</span></div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="comment">// of a solution of the local one dimension problem.</span></div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordflow">if</span> (previous_weight != 0) {</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> previous_profit = sorted_items_[before_break_item_id]->profit;</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> overused_capacity =</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  sorted_items_[break_item_id]->weight - remaining_capacity;</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="revised__simplex_8cc.html#af01c50e388647c921aa7d9c77f2b72b2">ratio</a> = UpperBoundOfRatio(overused_capacity, previous_profit,</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  previous_weight);</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  additional_profit_when_break_item =</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  sorted_items_[break_item_id]->profit - <a class="code" href="revised__simplex_8cc.html#af01c50e388647c921aa7d9c77f2b72b2">ratio</a>;</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  }</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  }</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  </div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> additional_profit = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(additional_profit_when_no_break_item,</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  additional_profit_when_break_item);</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(additional_profit, 0);</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">return</span> additional_profit;</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span> }</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  </div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span> <span class="comment">// ----- KnapsackGenericSolver -----</span></div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_generic_solver.html#a2a7bff5cf8a51192eadec54eb0499064"> 336</a></span> <a class="code" href="classoperations__research_1_1_knapsack_generic_solver.html#a2a7bff5cf8a51192eadec54eb0499064">KnapsackGenericSolver::KnapsackGenericSolver</a>(<span class="keyword">const</span> std::string& solver_name)</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  : <a class="code" href="classoperations__research_1_1_base_knapsack_solver.html">BaseKnapsackSolver</a>(solver_name),</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  propagators_(),</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  master_propagator_id_(kMasterPropagatorId),</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  search_nodes_(),</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  state_(),</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  best_solution_profit_(0),</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  best_solution_() {}</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  </div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_generic_solver.html#a2a25594d97a0a532f9d814bdc6dea380"> 345</a></span> <a class="code" href="classoperations__research_1_1_knapsack_generic_solver.html#a2a25594d97a0a532f9d814bdc6dea380">KnapsackGenericSolver::~KnapsackGenericSolver</a>() { Clear(); }</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  </div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_generic_solver.html#a51cac72a6280d047002a1b9bf34d7948"> 347</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack_generic_solver.html#a51cac72a6280d047002a1b9bf34d7948">KnapsackGenericSolver::Init</a>(<span class="keyword">const</span> std::vector<int64>& profits,</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keyword">const</span> std::vector<std::vector<int64>>& weights,</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keyword">const</span> std::vector<int64>& capacities) {</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(capacities.size(), weights.size());</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  </div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  Clear();</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> number_of_items = profits.size();</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> number_of_dimensions = weights.size();</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  state_.<a class="code" href="classoperations__research_1_1_knapsack_state.html#a6308c7a97200f84f6ebf5b2c487b0362">Init</a>(number_of_items);</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  best_solution_.assign(number_of_items, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < number_of_dimensions; ++i) {</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(number_of_items, weights[i].size());</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  </div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <a class="code" href="classoperations__research_1_1_knapsack_capacity_propagator.html">KnapsackCapacityPropagator</a>* propagator =</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1_knapsack_capacity_propagator.html">KnapsackCapacityPropagator</a>(state_, capacities[i]);</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  propagator-><a class="code" href="classoperations__research_1_1_knapsack_propagator.html#a9fdde4d0e47bfb9ca54f16554a69ce1b">Init</a>(profits, weights[i]);</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  propagators_.push_back(propagator);</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  }</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  master_propagator_id_ = kMasterPropagatorId;</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span> }</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  </div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_generic_solver.html#a35bfa97bc24861491acb8d3d20087306"> 368</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack_generic_solver.html#a35bfa97bc24861491acb8d3d20087306">KnapsackGenericSolver::GetLowerAndUpperBoundWhenItem</a>(<span class="keywordtype">int</span> item_id,</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordtype">bool</span> is_item_in,</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* lower_bound,</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* upper_bound) {</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(lower_bound != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(upper_bound != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <a class="code" href="structoperations__research_1_1_knapsack_assignment.html">KnapsackAssignment</a> assignment(item_id, is_item_in);</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> fail = !IncrementalUpdate(<span class="keyword">false</span>, assignment);</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordflow">if</span> (fail) {</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  *lower_bound = 0LL;</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  *upper_bound = 0LL;</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  *lower_bound =</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  (HasOnePropagator())</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  ? propagators_[master_propagator_id_]->profit_lower_bound()</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  : 0LL;</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  *upper_bound = GetAggregatedProfitUpperBound();</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  }</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  </div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> fail_revert = !IncrementalUpdate(<span class="keyword">true</span>, assignment);</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keywordflow">if</span> (fail_revert) {</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  *lower_bound = 0LL;</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  *upper_bound = 0LL;</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  }</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span> }</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  </div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_generic_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7"> 394</a></span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_knapsack_generic_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7">KnapsackGenericSolver::Solve</a>(<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>,</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keywordtype">bool</span>* is_solution_optimal) {</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a> != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(is_solution_optimal != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  best_solution_profit_ = 0LL;</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  *is_solution_optimal = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  </div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  SearchQueue search_queue;</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_knapsack_assignment.html">KnapsackAssignment</a> assignment(kNoSelection, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <a class="code" href="classoperations__research_1_1_knapsack_search_node.html">KnapsackSearchNode</a>* root_node = <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1_knapsack_search_node.html">KnapsackSearchNode</a>(<span class="keyword">nullptr</span>, assignment);</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  root_node-><a class="code" href="classoperations__research_1_1_knapsack_search_node.html#a388481288bf0c9bdc7e3583217150962">set_current_profit</a>(GetCurrentProfit());</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  root_node-><a class="code" href="classoperations__research_1_1_knapsack_search_node.html#ab7f8c7e53d1f8f72cb6b1a2bffae2407">set_profit_upper_bound</a>(GetAggregatedProfitUpperBound());</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  root_node-><a class="code" href="classoperations__research_1_1_knapsack_search_node.html#a9962698a737cd21789c77ff32bef0d98">set_next_item_id</a>(GetNextItemId());</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  search_nodes_.push_back(root_node);</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  </div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordflow">if</span> (MakeNewNode(*root_node, <span class="keyword">false</span>)) {</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  search_queue.push(search_nodes_.back());</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  }</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordflow">if</span> (MakeNewNode(*root_node, <span class="keyword">true</span>)) {</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  search_queue.push(search_nodes_.back());</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  }</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  </div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <a class="code" href="classoperations__research_1_1_knapsack_search_node.html">KnapsackSearchNode</a>* current_node = root_node;</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordflow">while</span> (!search_queue.empty() &&</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  search_queue.top()->profit_upper_bound() > best_solution_profit_) {</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>->LimitReached()) {</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  *is_solution_optimal = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  }</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <a class="code" href="classoperations__research_1_1_knapsack_search_node.html">KnapsackSearchNode</a>* <span class="keyword">const</span> node = search_queue.top();</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  search_queue.pop();</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  </div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keywordflow">if</span> (node != current_node) {</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <a class="code" href="classoperations__research_1_1_knapsack_search_path.html">KnapsackSearchPath</a> path(*current_node, *node);</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  path.<a class="code" href="classoperations__research_1_1_knapsack_search_path.html#a1e3b6d38df0786ccf7f938d60e386aae">Init</a>();</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> no_fail = UpdatePropagators(path);</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  current_node = node;</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(no_fail, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  }</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  </div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keywordflow">if</span> (MakeNewNode(*node, <span class="keyword">false</span>)) {</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  search_queue.push(search_nodes_.back());</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  }</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keywordflow">if</span> (MakeNewNode(*node, <span class="keyword">true</span>)) {</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  search_queue.push(search_nodes_.back());</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  }</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  }</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordflow">return</span> best_solution_profit_;</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span> }</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  </div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span> <span class="keywordtype">void</span> KnapsackGenericSolver::Clear() {</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <a class="code" href="namespacegtl.html#a4ee3db0c4acaa0f277a0d7006f5ad1e6">gtl::STLDeleteElements</a>(&propagators_);</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <a class="code" href="namespacegtl.html#a4ee3db0c4acaa0f277a0d7006f5ad1e6">gtl::STLDeleteElements</a>(&search_nodes_);</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span> }</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  </div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span> <span class="comment">// Returns false when at least one propagator fails.</span></div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span> <span class="keywordtype">bool</span> KnapsackGenericSolver::UpdatePropagators(<span class="keyword">const</span> KnapsackSearchPath& path) {</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keywordtype">bool</span> no_fail = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="comment">// Revert previous changes.</span></div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="keyword">const</span> KnapsackSearchNode* node = &path.from();</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="keyword">const</span> KnapsackSearchNode* via = &path.via();</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keywordflow">while</span> (node != via) {</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  no_fail = IncrementalUpdate(<span class="keyword">true</span>, node->assignment()) && no_fail;</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  node = node->parent();</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  }</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="comment">// Apply current changes.</span></div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  node = &path.to();</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keywordflow">while</span> (node != via) {</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  no_fail = IncrementalUpdate(<span class="keyword">false</span>, node->assignment()) && no_fail;</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  node = node->parent();</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  }</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keywordflow">return</span> no_fail;</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span> }</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  </div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> KnapsackGenericSolver::GetAggregatedProfitUpperBound()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> upper_bound = <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keywordflow">for</span> (KnapsackPropagator* <span class="keyword">const</span> prop : propagators_) {</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  prop->ComputeProfitBounds();</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> propagator_upper_bound = prop->profit_upper_bound();</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  upper_bound = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(upper_bound, propagator_upper_bound);</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  }</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keywordflow">return</span> upper_bound;</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span> }</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  </div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span> <span class="keywordtype">bool</span> KnapsackGenericSolver::MakeNewNode(<span class="keyword">const</span> KnapsackSearchNode& node,</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keywordtype">bool</span> is_in) {</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keywordflow">if</span> (node.next_item_id() == kNoSelection) {</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  }</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  KnapsackAssignment assignment(node.next_item_id(), is_in);</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  KnapsackSearchNode new_node(&node, assignment);</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  </div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  KnapsackSearchPath path(node, new_node);</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  path.Init();</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> no_fail = UpdatePropagators(path);</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keywordflow">if</span> (no_fail) {</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  new_node.set_current_profit(GetCurrentProfit());</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  new_node.set_profit_upper_bound(GetAggregatedProfitUpperBound());</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  new_node.set_next_item_id(GetNextItemId());</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  UpdateBestSolution();</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  }</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  </div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="comment">// Revert to be able to create another node from parent.</span></div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  KnapsackSearchPath revert_path(new_node, node);</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  revert_path.Init();</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  UpdatePropagators(revert_path);</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  </div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keywordflow">if</span> (!no_fail || new_node.profit_upper_bound() < best_solution_profit_) {</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  }</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  </div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="comment">// The node is relevant.</span></div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  KnapsackSearchNode* relevant_node = <span class="keyword">new</span> KnapsackSearchNode(&node, assignment);</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  relevant_node->set_current_profit(new_node.current_profit());</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  relevant_node->set_profit_upper_bound(new_node.profit_upper_bound());</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  relevant_node->set_next_item_id(new_node.next_item_id());</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  search_nodes_.push_back(relevant_node);</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  </div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span> }</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  </div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span> <span class="keywordtype">bool</span> KnapsackGenericSolver::IncrementalUpdate(</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keywordtype">bool</span> revert, <span class="keyword">const</span> KnapsackAssignment& assignment) {</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="comment">// Do not stop on a failure: To be able to be incremental on the update,</span></div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="comment">// partial solution (state) and propagators must all be in the same state.</span></div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keywordtype">bool</span> no_fail = state_.<a class="code" href="classoperations__research_1_1_knapsack_state.html#ab771ac0e538f991b73b011ee3ba11f05">UpdateState</a>(revert, assignment);</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">for</span> (KnapsackPropagator* <span class="keyword">const</span> prop : propagators_) {</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  no_fail = prop->Update(revert, assignment) && no_fail;</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  }</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">return</span> no_fail;</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span> }</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  </div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span> <span class="keywordtype">void</span> KnapsackGenericSolver::UpdateBestSolution() {</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> profit_lower_bound =</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  (HasOnePropagator())</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  ? propagators_[master_propagator_id_]->profit_lower_bound()</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  : propagators_[master_propagator_id_]->current_profit();</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  </div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="keywordflow">if</span> (best_solution_profit_ < profit_lower_bound) {</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  best_solution_profit_ = profit_lower_bound;</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  propagators_[master_propagator_id_]->CopyCurrentStateToSolution(</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  HasOnePropagator(), &best_solution_);</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  }</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span> }</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  </div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span> <span class="comment">// ----- KnapsackBruteForceSolver -----</span></div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span> <span class="comment">// KnapsackBruteForceSolver solves the 0-1 knapsack problem when the number of</span></div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span> <span class="comment">// items is less or equal to 30 with brute force, ie. explores all states.</span></div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span> <span class="comment">// Experiments show better results than KnapsackGenericSolver when the</span></div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span> <span class="comment">// number of items is less than 15.</span></div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_brute_force_solver.html"> 544</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_knapsack_brute_force_solver.html">KnapsackBruteForceSolver</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1_base_knapsack_solver.html">BaseKnapsackSolver</a> {</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_knapsack_brute_force_solver.html#a4f9df2a0d826265d62cd86f04070d439">KnapsackBruteForceSolver</a>(<span class="keyword">const</span> std::string& solver_name);</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  </div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="comment">// Initializes the solver and enters the problem to be solved.</span></div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack_brute_force_solver.html#a9025339045590a3988cb87ee4796a551">Init</a>(<span class="keyword">const</span> std::vector<int64>& profits,</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keyword">const</span> std::vector<std::vector<int64>>& weights,</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="keyword">const</span> std::vector<int64>& capacities) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  </div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="comment">// Solves the problem and returns the profit of the optimal solution.</span></div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_knapsack_brute_force_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7">Solve</a>(<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>, <span class="keywordtype">bool</span>* is_solution_optimal) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  </div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="comment">// Returns true if the item 'item_id' is packed in the optimal knapsack.</span></div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_brute_force_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4"> 557</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_knapsack_brute_force_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4">best_solution</a>(<span class="keywordtype">int</span> item_id)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordflow">return</span> (best_solution_ & <a class="code" href="namespaceoperations__research.html#ac258cd47a0ecede02fda32d46ca2b9de">OneBit32</a>(item_id)) != 0U;</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  }</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  </div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keywordtype">int</span> num_items_;</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> profits_weights_[kMaxNumberOfBruteForceItems * 2];</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> capacity_;</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> best_solution_profit_;</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <a class="code" href="integral__types_8h.html#a1134b580f8da4de94ca6b1de4d37975e">uint32</a> best_solution_;</div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  </div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1_knapsack_brute_force_solver.html">KnapsackBruteForceSolver</a>);</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span> };</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  </div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_brute_force_solver.html#a4f9df2a0d826265d62cd86f04070d439"> 571</a></span> <a class="code" href="classoperations__research_1_1_knapsack_brute_force_solver.html#a4f9df2a0d826265d62cd86f04070d439">KnapsackBruteForceSolver::KnapsackBruteForceSolver</a>(</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="keyword">const</span> std::string& solver_name)</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  : <a class="code" href="classoperations__research_1_1_base_knapsack_solver.html">BaseKnapsackSolver</a>(solver_name),</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  num_items_(0),</div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  capacity_(0LL),</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  best_solution_profit_(0LL),</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  best_solution_(0U) {}</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  </div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_brute_force_solver.html#a9025339045590a3988cb87ee4796a551"> 579</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack_brute_force_solver.html#a9025339045590a3988cb87ee4796a551">KnapsackBruteForceSolver::Init</a>(</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keyword">const</span> std::vector<int64>& profits,</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="keyword">const</span> std::vector<std::vector<int64>>& weights,</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keyword">const</span> std::vector<int64>& capacities) {</div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="comment">// TODO(user): Implement multi-dimensional brute force solver.</span></div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(weights.size(), 1)</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  << <span class="stringliteral">"Brute force solver only works with one dimension."</span>;</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(capacities.size(), weights.size());</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  </div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  num_items_ = profits.size();</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(num_items_, weights.at(0).size());</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(num_items_, kMaxNumberOfBruteForceItems)</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  << <span class="stringliteral">"To use KnapsackBruteForceSolver the number of items should be "</span></div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  << <span class="stringliteral">"less than "</span> << kMaxNumberOfBruteForceItems</div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  << <span class="stringliteral">". Current value: "</span> << num_items_ << <span class="stringliteral">"."</span>;</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  </div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_items_; ++i) {</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  profits_weights_[i * 2] = profits.at(i);</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  profits_weights_[i * 2 + 1] = weights.at(0).at(i);</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  }</div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  capacity_ = capacities.at(0);</div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span> }</div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  </div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_brute_force_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7"> 602</a></span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_knapsack_brute_force_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7">KnapsackBruteForceSolver::Solve</a>(<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>,</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keywordtype">bool</span>* is_solution_optimal) {</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(is_solution_optimal != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  *is_solution_optimal = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  best_solution_profit_ = 0LL;</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  best_solution_ = 0U;</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  </div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a1134b580f8da4de94ca6b1de4d37975e">uint32</a> num_states = <a class="code" href="namespaceoperations__research.html#ac258cd47a0ecede02fda32d46ca2b9de">OneBit32</a>(num_items_);</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <a class="code" href="integral__types_8h.html#a1134b580f8da4de94ca6b1de4d37975e">uint32</a> prev_state = 0U;</div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> sum_profit = 0ULL;</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> sum_weight = 0ULL;</div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <a class="code" href="integral__types_8h.html#a1134b580f8da4de94ca6b1de4d37975e">uint32</a> diff_state = 0U;</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <a class="code" href="integral__types_8h.html#a1134b580f8da4de94ca6b1de4d37975e">uint32</a> local_state = 0U;</div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="keywordtype">int</span> item_id = 0;</div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="comment">// This loop starts at 1, because state = 0 was already considered previously,</span></div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="comment">// ie. when no items are in, sum_profit = 0.</span></div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a1134b580f8da4de94ca6b1de4d37975e">uint32</a> state = 1U; state < num_states; ++state, ++prev_state) {</div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  diff_state = state ^ prev_state;</div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  local_state = state;</div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  item_id = 0;</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keywordflow">while</span> (diff_state) {</div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="keywordflow">if</span> (diff_state & 1U) { <span class="comment">// There is a diff.</span></div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="keywordflow">if</span> (local_state & 1U) { <span class="comment">// This item is now in the knapsack.</span></div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  sum_profit += profits_weights_[item_id];</div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  sum_weight += profits_weights_[item_id + 1];</div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(item_id + 1, 2 * num_items_);</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  } <span class="keywordflow">else</span> { <span class="comment">// This item has been removed of the knapsack.</span></div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  sum_profit -= profits_weights_[item_id];</div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  sum_weight -= profits_weights_[item_id + 1];</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(item_id + 1, 2 * num_items_);</div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  }</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  }</div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  item_id += 2;</div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  local_state = local_state >> 1;</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  diff_state = diff_state >> 1;</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  }</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  </div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keywordflow">if</span> (sum_weight <= capacity_ && best_solution_profit_ < sum_profit) {</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  best_solution_profit_ = sum_profit;</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  best_solution_ = state;</div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  }</div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  }</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  </div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keywordflow">return</span> best_solution_profit_;</div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span> }</div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  </div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span> <span class="comment">// ----- KnapsackItemWithEfficiency -----</span></div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span> <span class="comment">// KnapsackItem is a small struct to pair an item weight with its</span></div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span> <span class="comment">// corresponding profit.</span></div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span> <span class="comment">// This struct is used by Knapsack64ItemsSolver. As this solver deals only</span></div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span> <span class="comment">// with one dimension, that's more efficient to store 'efficiency' than</span></div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span> <span class="comment">// computing it on the fly.</span></div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_knapsack_item_with_efficiency.html"> 654</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1_knapsack_item_with_efficiency.html">KnapsackItemWithEfficiency</a> {</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_knapsack_item_with_efficiency.html#af49bb942c0b8f1303541fabeb9829e69"> 655</a></span>  <a class="code" href="structoperations__research_1_1_knapsack_item_with_efficiency.html#af49bb942c0b8f1303541fabeb9829e69">KnapsackItemWithEfficiency</a>(<span class="keywordtype">int</span> _id, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> _profit, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> _weight,</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> _profit_max)</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  : <a class="code" href="structoperations__research_1_1_knapsack_item_with_efficiency.html#a7441ef0865bcb3db9b8064dd7375c1ea">id</a>(_id),</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <a class="code" href="structoperations__research_1_1_knapsack_item_with_efficiency.html#adcadf13719705572b332bccdaab51993">profit</a>(_profit),</div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <a class="code" href="structoperations__research_1_1_knapsack_item_with_efficiency.html#ae42ca38a167164c07831993889216903">weight</a>(_weight),</div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <a class="code" href="structoperations__research_1_1_knapsack_item_with_efficiency.html#a036eb5930698269322fab01797c24255">efficiency</a>((<a class="code" href="structoperations__research_1_1_knapsack_item_with_efficiency.html#ae42ca38a167164c07831993889216903">weight</a> > 0) ? static_cast<double>(_profit) /</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  static_cast<double>(_weight)</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  : static_cast<double>(_profit_max)) {}</div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  </div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_knapsack_item_with_efficiency.html#a7441ef0865bcb3db9b8064dd7375c1ea"> 664</a></span>  <span class="keywordtype">int</span> <a class="code" href="structoperations__research_1_1_knapsack_item_with_efficiency.html#a7441ef0865bcb3db9b8064dd7375c1ea">id</a>;</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_knapsack_item_with_efficiency.html#adcadf13719705572b332bccdaab51993"> 665</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="structoperations__research_1_1_knapsack_item_with_efficiency.html#adcadf13719705572b332bccdaab51993">profit</a>;</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_knapsack_item_with_efficiency.html#ae42ca38a167164c07831993889216903"> 666</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="structoperations__research_1_1_knapsack_item_with_efficiency.html#ae42ca38a167164c07831993889216903">weight</a>;</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_knapsack_item_with_efficiency.html#a036eb5930698269322fab01797c24255"> 667</a></span>  <span class="keywordtype">double</span> <a class="code" href="structoperations__research_1_1_knapsack_item_with_efficiency.html#a036eb5930698269322fab01797c24255">efficiency</a>;</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span> };</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  </div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span> <span class="comment">// ----- Knapsack64ItemsSolver -----</span></div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span> <span class="comment">// Knapsack64ItemsSolver solves the 0-1 knapsack problem when the number of</span></div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span> <span class="comment">// items is less or equal to 64. This implementation is about 4 times faster</span></div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span> <span class="comment">// than KnapsackGenericSolver.</span></div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack64_items_solver.html"> 674</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_knapsack64_items_solver.html">Knapsack64ItemsSolver</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1_base_knapsack_solver.html">BaseKnapsackSolver</a> {</div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_knapsack64_items_solver.html#a6efbe15e2ab4e192b6af2fdcdda41ca2">Knapsack64ItemsSolver</a>(<span class="keyword">const</span> std::string& solver_name);</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  </div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="comment">// Initializes the solver and enters the problem to be solved.</span></div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack64_items_solver.html#a9025339045590a3988cb87ee4796a551">Init</a>(<span class="keyword">const</span> std::vector<int64>& profits,</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keyword">const</span> std::vector<std::vector<int64>>& weights,</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="keyword">const</span> std::vector<int64>& capacities) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  </div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="comment">// Solves the problem and returns the profit of the optimal solution.</span></div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_knapsack64_items_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7">Solve</a>(<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>, <span class="keywordtype">bool</span>* is_solution_optimal) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  </div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="comment">// Returns true if the item 'item_id' is packed in the optimal knapsack.</span></div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack64_items_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4"> 687</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_knapsack64_items_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4">best_solution</a>(<span class="keywordtype">int</span> item_id)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keywordflow">return</span> (best_solution_ & <a class="code" href="namespaceoperations__research.html#aebb30ce0aaac158bab53d6d5a17e6ac2">OneBit64</a>(item_id)) != 0ULL;</div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  }</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  </div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="keywordtype">int</span> GetBreakItemId(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="keywordtype">void</span> GetLowerAndUpperBound(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* lower_bound, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* upper_bound) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="keywordtype">void</span> GoToNextState(<span class="keywordtype">bool</span> has_failed);</div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keywordtype">void</span> BuildBestSolution();</div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  </div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  std::vector<KnapsackItemWithEfficiency> sorted_items_;</div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  std::vector<int64> sum_profits_;</div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  std::vector<int64> sum_weights_;</div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> capacity_;</div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> state_;</div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keywordtype">int</span> state_depth_;</div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  </div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> best_solution_profit_;</div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> best_solution_;</div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keywordtype">int</span> best_solution_depth_;</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  </div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="comment">// Sum of weights of included item in state.</span></div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> state_weight_;</div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="comment">// Sum of profits of non included items in state.</span></div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> rejected_items_profit_;</div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="comment">// Sum of weights of non included items in state.</span></div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> rejected_items_weight_;</div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span> };</div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  </div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span> <span class="comment">// Comparator used to sort item in decreasing efficiency order</span></div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a627ab892a9c19c32b05c8f118e7660e0"> 717</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research.html#a627ab892a9c19c32b05c8f118e7660e0">CompareKnapsackItemWithEfficiencyInDecreasingEfficiencyOrder</a>(</div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_knapsack_item_with_efficiency.html">KnapsackItemWithEfficiency</a>& item1,</div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_knapsack_item_with_efficiency.html">KnapsackItemWithEfficiency</a>& item2) {</div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keywordflow">return</span> item1.<a class="code" href="structoperations__research_1_1_knapsack_item_with_efficiency.html#a036eb5930698269322fab01797c24255">efficiency</a> > item2.<a class="code" href="structoperations__research_1_1_knapsack_item_with_efficiency.html#a036eb5930698269322fab01797c24255">efficiency</a>;</div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span> }</div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  </div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span> <span class="comment">// ----- Knapsack64ItemsSolver -----</span></div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack64_items_solver.html#a6efbe15e2ab4e192b6af2fdcdda41ca2"> 724</a></span> <a class="code" href="classoperations__research_1_1_knapsack64_items_solver.html#a6efbe15e2ab4e192b6af2fdcdda41ca2">Knapsack64ItemsSolver::Knapsack64ItemsSolver</a>(<span class="keyword">const</span> std::string& solver_name)</div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  : <a class="code" href="classoperations__research_1_1_base_knapsack_solver.html">BaseKnapsackSolver</a>(solver_name),</div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  sorted_items_(),</div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  sum_profits_(),</div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  sum_weights_(),</div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  capacity_(0LL),</div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  state_(0ULL),</div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  state_depth_(0),</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  best_solution_profit_(0LL),</div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  best_solution_(0ULL),</div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  best_solution_depth_(0),</div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  state_weight_(0LL),</div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  rejected_items_profit_(0LL),</div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  rejected_items_weight_(0LL) {}</div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  </div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack64_items_solver.html#a9025339045590a3988cb87ee4796a551"> 739</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack64_items_solver.html#a9025339045590a3988cb87ee4796a551">Knapsack64ItemsSolver::Init</a>(<span class="keyword">const</span> std::vector<int64>& profits,</div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="keyword">const</span> std::vector<std::vector<int64>>& weights,</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <span class="keyword">const</span> std::vector<int64>& capacities) {</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(weights.size(), 1)</div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  << <span class="stringliteral">"Brute force solver only works with one dimension."</span>;</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(capacities.size(), weights.size());</div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  </div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  sorted_items_.clear();</div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  sum_profits_.clear();</div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  sum_weights_.clear();</div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  </div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  capacity_ = capacities[0];</div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_items = profits.size();</div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(num_items, kMaxNumberOf64Items)</div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  << <span class="stringliteral">"To use Knapsack64ItemsSolver the number of items should be "</span></div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  << <span class="stringliteral">"less than "</span> << kMaxNumberOf64Items << <span class="stringliteral">". Current value: "</span> << num_items</div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  << <span class="stringliteral">"."</span>;</div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="knapsack__solver_8cc.html#a6f2f9756946f8553d52c633b7acb44f3">profit_max</a> = *std::max_element(profits.begin(), profits.end());</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  </div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_items; ++i) {</div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  sorted_items_.push_back(</div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <a class="code" href="structoperations__research_1_1_knapsack_item_with_efficiency.html">KnapsackItemWithEfficiency</a>(i, profits[i], weights[0][i], <a class="code" href="knapsack__solver_8cc.html#a6f2f9756946f8553d52c633b7acb44f3">profit_max</a>));</div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  }</div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  </div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  std::sort(sorted_items_.begin(), sorted_items_.end(),</div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <a class="code" href="namespaceoperations__research.html#a627ab892a9c19c32b05c8f118e7660e0">CompareKnapsackItemWithEfficiencyInDecreasingEfficiencyOrder</a>);</div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  </div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> sum_profit = 0;</div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> sum_weight = 0;</div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  sum_profits_.push_back(sum_profit);</div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  sum_weights_.push_back(sum_weight);</div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_items; ++i) {</div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  sum_profit += sorted_items_[i].profit;</div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  sum_weight += sorted_items_[i].weight;</div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  </div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  sum_profits_.push_back(sum_profit);</div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  sum_weights_.push_back(sum_weight);</div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  }</div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span> }</div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  </div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack64_items_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7"> 779</a></span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_knapsack64_items_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7">Knapsack64ItemsSolver::Solve</a>(<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>,</div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keywordtype">bool</span>* is_solution_optimal) {</div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(is_solution_optimal != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  *is_solution_optimal = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_items = sorted_items_.size();</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  state_ = 1ULL;</div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  state_depth_ = 0;</div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  state_weight_ = sorted_items_[0].weight;</div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  rejected_items_profit_ = 0LL;</div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  rejected_items_weight_ = 0LL;</div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  best_solution_profit_ = 0LL;</div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  best_solution_ = 0ULL;</div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  best_solution_depth_ = 0;</div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  </div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lower_bound = 0LL;</div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> upper_bound = 0LL;</div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="keywordtype">bool</span> fail = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="keywordflow">while</span> (state_depth_ >= 0) {</div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  fail = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <span class="keywordflow">if</span> (state_weight_ > capacity_ || state_depth_ >= num_items) {</div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  fail = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  GetLowerAndUpperBound(&lower_bound, &upper_bound);</div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keywordflow">if</span> (best_solution_profit_ < lower_bound) {</div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  best_solution_profit_ = lower_bound;</div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  best_solution_ = state_;</div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  best_solution_depth_ = state_depth_;</div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  }</div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  }</div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  fail = fail || best_solution_profit_ >= upper_bound;</div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  GoToNextState(fail);</div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  }</div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  </div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  BuildBestSolution();</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="keywordflow">return</span> best_solution_profit_;</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span> }</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  </div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span> <span class="keywordtype">int</span> Knapsack64ItemsSolver::GetBreakItemId(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  std::vector<int64>::const_iterator binary_search_iterator =</div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  std::upper_bound(sum_weights_.begin(), sum_weights_.end(), <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>);</div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(binary_search_iterator - sum_weights_.begin()) - 1;</div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span> }</div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  </div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span> <span class="comment">// This method is called for each possible state.</span></div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span> <span class="comment">// Lower and upper bounds can be equal from one state to another.</span></div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span> <span class="comment">// For instance state 1010???? and state 101011?? have exactly the same</span></div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span> <span class="comment">// bounds. So it sounds like a good idea to cache those bounds.</span></div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span> <span class="comment">// Unfortunately, experiments show equivalent results with or without this</span></div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span> <span class="comment">// code optimization (only 1/7 of calls can be reused).</span></div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span> <span class="comment">// In order to simplify the code, this optimization is not implemented.</span></div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span> <span class="keywordtype">void</span> Knapsack64ItemsSolver::GetLowerAndUpperBound(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* lower_bound,</div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* upper_bound)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> available_capacity = capacity_ + rejected_items_weight_;</div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> break_item_id = GetBreakItemId(available_capacity);</div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_items = sorted_items_.size();</div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="keywordflow">if</span> (break_item_id >= num_items) {</div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  *lower_bound = sum_profits_[num_items] - rejected_items_profit_;</div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  *upper_bound = *lower_bound;</div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  }</div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  </div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  *lower_bound = sum_profits_[break_item_id] - rejected_items_profit_;</div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  *upper_bound = *lower_bound;</div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> consumed_capacity = sum_weights_[break_item_id];</div>
|
|
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> remaining_capacity = available_capacity - consumed_capacity;</div>
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> efficiency = sorted_items_[break_item_id].efficiency;</div>
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> additional_profit =</div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="keyword">static_cast<</span><a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a><span class="keyword">></span>(remaining_capacity * efficiency);</div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  *upper_bound += additional_profit;</div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span> }</div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  </div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span> <span class="comment">// As state_depth_ is the position of the most significant bit on state_</span></div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span> <span class="comment">// it is possible to remove the loop and so be in O(1) instead of O(depth).</span></div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span> <span class="comment">// In such a case rejected_items_profit_ is computed using sum_profits_ array.</span></div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span> <span class="comment">// Unfortunately experiments show smaller computation time using the 'while'</span></div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span> <span class="comment">// (10% speed-up). That's the reason why the loop version is implemented.</span></div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span> <span class="keywordtype">void</span> Knapsack64ItemsSolver::GoToNextState(<span class="keywordtype">bool</span> has_failed) {</div>
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> mask = <a class="code" href="namespaceoperations__research.html#aebb30ce0aaac158bab53d6d5a17e6ac2">OneBit64</a>(state_depth_);</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="keywordflow">if</span> (!has_failed) { <span class="comment">// Go to next item.</span></div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  ++state_depth_;</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  state_ = state_ | (mask << 1);</div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  state_weight_ += sorted_items_[state_depth_].weight;</div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <span class="comment">// Backtrack to last item in.</span></div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  <span class="keywordflow">while</span> ((state_ & mask) == 0ULL && state_depth_ >= 0) {</div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="keyword">const</span> KnapsackItemWithEfficiency& item = sorted_items_[state_depth_];</div>
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  rejected_items_profit_ -= item.profit;</div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  rejected_items_weight_ -= item.weight;</div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  --state_depth_;</div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  mask = mask >> 1ULL;</div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  }</div>
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  </div>
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  <span class="keywordflow">if</span> (state_ & mask) { <span class="comment">// Item was in, remove it.</span></div>
|
|
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  state_ = state_ & ~mask;</div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  <span class="keyword">const</span> KnapsackItemWithEfficiency& item = sorted_items_[state_depth_];</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  rejected_items_profit_ += item.profit;</div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  rejected_items_weight_ += item.weight;</div>
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  state_weight_ -= item.weight;</div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  }</div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  }</div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span> }</div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  </div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span> <span class="keywordtype">void</span> Knapsack64ItemsSolver::BuildBestSolution() {</div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> remaining_capacity = capacity_;</div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> check_profit = 0LL;</div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  </div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="comment">// Compute remaining capacity at best_solution_depth_ to be able to redo</span></div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="comment">// the GetLowerAndUpperBound computation.</span></div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i <= best_solution_depth_; ++i) {</div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="keywordflow">if</span> (best_solution_ & <a class="code" href="namespaceoperations__research.html#aebb30ce0aaac158bab53d6d5a17e6ac2">OneBit64</a>(i)) {</div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  remaining_capacity -= sorted_items_[i].weight;</div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  check_profit += sorted_items_[i].profit;</div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  }</div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  }</div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  </div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="comment">// Add all items till the break item.</span></div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_items = sorted_items_.size();</div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = best_solution_depth_ + 1; i < num_items; ++i) {</div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#ae42ca38a167164c07831993889216903">weight</a> = sorted_items_[i].weight;</div>
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <span class="keywordflow">if</span> (remaining_capacity >= <a class="code" href="pack_8cc.html#ae42ca38a167164c07831993889216903">weight</a>) {</div>
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  remaining_capacity -= <a class="code" href="pack_8cc.html#ae42ca38a167164c07831993889216903">weight</a>;</div>
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  check_profit += sorted_items_[i].profit;</div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  best_solution_ = best_solution_ | <a class="code" href="namespaceoperations__research.html#aebb30ce0aaac158bab53d6d5a17e6ac2">OneBit64</a>(i);</div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  best_solution_ = best_solution_ & ~<a class="code" href="namespaceoperations__research.html#aebb30ce0aaac158bab53d6d5a17e6ac2">OneBit64</a>(i);</div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  }</div>
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  }</div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(best_solution_profit_, check_profit);</div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  </div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  <span class="comment">// Items were sorted by efficiency, solution should be unsorted to be</span></div>
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="comment">// in user order.</span></div>
|
|
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="comment">// Note that best_solution_ will not be in the same order than other data</span></div>
|
|
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  <span class="comment">// structures anymore.</span></div>
|
|
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> tmp_solution = 0ULL;</div>
|
|
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_items; ++i) {</div>
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="keywordflow">if</span> (best_solution_ & <a class="code" href="namespaceoperations__research.html#aebb30ce0aaac158bab53d6d5a17e6ac2">OneBit64</a>(i)) {</div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> original_id = sorted_items_[i].id;</div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  tmp_solution = tmp_solution | <a class="code" href="namespaceoperations__research.html#aebb30ce0aaac158bab53d6d5a17e6ac2">OneBit64</a>(original_id);</div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  }</div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  }</div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  </div>
|
|
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  best_solution_ = tmp_solution;</div>
|
|
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span> }</div>
|
|
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  </div>
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span> <span class="comment">// ----- KnapsackDynamicProgrammingSolver -----</span></div>
|
|
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span> <span class="comment">// KnapsackDynamicProgrammingSolver solves the 0-1 knapsack problem</span></div>
|
|
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span> <span class="comment">// using dynamic programming. This algorithm is pseudo-polynomial because it</span></div>
|
|
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span> <span class="comment">// depends on capacity, ie. the time and space complexity is</span></div>
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span> <span class="comment">// O(capacity * number_of_items).</span></div>
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span> <span class="comment">// The implemented algorithm is 'DP-3' in "Knapsack problems", Hans Kellerer,</span></div>
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span> <span class="comment">// Ulrich Pferschy and David Pisinger, Springer book (ISBN 978-3540402862).</span></div>
|
|
<div class="line"><a name="l00930"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html"> 930</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html">KnapsackDynamicProgrammingSolver</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1_base_knapsack_solver.html">BaseKnapsackSolver</a> {</div>
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html#ad12d8a6596d658d1b3fabafdeb505d16">KnapsackDynamicProgrammingSolver</a>(<span class="keyword">const</span> std::string& solver_name);</div>
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  </div>
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  <span class="comment">// Initializes the solver and enters the problem to be solved.</span></div>
|
|
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html#a9025339045590a3988cb87ee4796a551">Init</a>(<span class="keyword">const</span> std::vector<int64>& profits,</div>
|
|
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="keyword">const</span> std::vector<std::vector<int64>>& weights,</div>
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="keyword">const</span> std::vector<int64>& capacities) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  </div>
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  <span class="comment">// Solves the problem and returns the profit of the optimal solution.</span></div>
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7">Solve</a>(<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>, <span class="keywordtype">bool</span>* is_solution_optimal) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  </div>
|
|
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="comment">// Returns true if the item 'item_id' is packed in the optimal knapsack.</span></div>
|
|
<div class="line"><a name="l00943"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4"> 943</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4">best_solution</a>(<span class="keywordtype">int</span> item_id)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  <span class="keywordflow">return</span> best_solution_.at(item_id);</div>
|
|
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  }</div>
|
|
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  </div>
|
|
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> SolveSubProblem(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <span class="keywordtype">int</span> num_items);</div>
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  </div>
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  std::vector<int64> profits_;</div>
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  std::vector<int64> weights_;</div>
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> capacity_;</div>
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  std::vector<int64> computed_profits_;</div>
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  std::vector<int> selected_item_ids_;</div>
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  std::vector<bool> best_solution_;</div>
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span> };</div>
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  </div>
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span> <span class="comment">// ----- KnapsackDynamicProgrammingSolver -----</span></div>
|
|
<div class="line"><a name="l00959"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html#ad12d8a6596d658d1b3fabafdeb505d16"> 959</a></span> <a class="code" href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html#ad12d8a6596d658d1b3fabafdeb505d16">KnapsackDynamicProgrammingSolver::KnapsackDynamicProgrammingSolver</a>(</div>
|
|
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="keyword">const</span> std::string& solver_name)</div>
|
|
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  : <a class="code" href="classoperations__research_1_1_base_knapsack_solver.html">BaseKnapsackSolver</a>(solver_name),</div>
|
|
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  profits_(),</div>
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  weights_(),</div>
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  capacity_(0),</div>
|
|
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  computed_profits_(),</div>
|
|
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  selected_item_ids_(),</div>
|
|
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  best_solution_() {}</div>
|
|
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  </div>
|
|
<div class="line"><a name="l00969"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html#a9025339045590a3988cb87ee4796a551"> 969</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html#a9025339045590a3988cb87ee4796a551">KnapsackDynamicProgrammingSolver::Init</a>(</div>
|
|
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  <span class="keyword">const</span> std::vector<int64>& profits,</div>
|
|
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  <span class="keyword">const</span> std::vector<std::vector<int64>>& weights,</div>
|
|
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  <span class="keyword">const</span> std::vector<int64>& capacities) {</div>
|
|
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(weights.size(), 1)</div>
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  << <span class="stringliteral">"Current implementation of the dynamic programming solver only deals"</span></div>
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  << <span class="stringliteral">" with one dimension."</span>;</div>
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(capacities.size(), weights.size());</div>
|
|
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  </div>
|
|
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  profits_ = profits;</div>
|
|
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  weights_ = weights[0];</div>
|
|
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  capacity_ = capacities[0];</div>
|
|
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span> }</div>
|
|
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  </div>
|
|
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> KnapsackDynamicProgrammingSolver::SolveSubProblem(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>,</div>
|
|
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  <span class="keywordtype">int</span> num_items) {</div>
|
|
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> capacity_plus_1 = <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a> + 1;</div>
|
|
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  std::fill_n(selected_item_ids_.begin(), capacity_plus_1, 0);</div>
|
|
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  std::fill_n(computed_profits_.begin(), capacity_plus_1, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>{0});</div>
|
|
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> item_id = 0; item_id < num_items; ++item_id) {</div>
|
|
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> item_weight = weights_[item_id];</div>
|
|
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> item_profit = profits_[item_id];</div>
|
|
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> used_capacity = <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>; used_capacity >= item_weight;</div>
|
|
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  --used_capacity) {</div>
|
|
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <span class="keywordflow">if</span> (computed_profits_[used_capacity - item_weight] + item_profit ></div>
|
|
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  computed_profits_[used_capacity]) {</div>
|
|
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  computed_profits_[used_capacity] =</div>
|
|
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  computed_profits_[used_capacity - item_weight] + item_profit;</div>
|
|
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  selected_item_ids_[used_capacity] = item_id;</div>
|
|
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  }</div>
|
|
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  }</div>
|
|
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  }</div>
|
|
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  <span class="keywordflow">return</span> selected_item_ids_.at(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>);</div>
|
|
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span> }</div>
|
|
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  </div>
|
|
<div class="line"><a name="l01004"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7"> 1004</a></span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7">KnapsackDynamicProgrammingSolver::Solve</a>(<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>,</div>
|
|
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  <span class="keywordtype">bool</span>* is_solution_optimal) {</div>
|
|
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(is_solution_optimal != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  *is_solution_optimal = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> capacity_plus_1 = capacity_ + 1;</div>
|
|
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  selected_item_ids_.assign(capacity_plus_1, 0);</div>
|
|
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  computed_profits_.assign(capacity_plus_1, 0LL);</div>
|
|
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  </div>
|
|
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> remaining_capacity = capacity_;</div>
|
|
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  <span class="keywordtype">int</span> num_items = profits_.size();</div>
|
|
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  best_solution_.assign(num_items, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  </div>
|
|
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <span class="keywordflow">while</span> (remaining_capacity > 0 && num_items > 0) {</div>
|
|
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> selected_item_id = SolveSubProblem(remaining_capacity, num_items);</div>
|
|
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  remaining_capacity -= weights_[selected_item_id];</div>
|
|
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  num_items = selected_item_id;</div>
|
|
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  <span class="keywordflow">if</span> (remaining_capacity >= 0) {</div>
|
|
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  best_solution_[selected_item_id] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  }</div>
|
|
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  }</div>
|
|
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  </div>
|
|
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  <span class="keywordflow">return</span> computed_profits_[capacity_];</div>
|
|
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span> }</div>
|
|
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  </div>
|
|
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span> <span class="comment">// ----- KnapsackMIPSolver -----</span></div>
|
|
<div class="line"><a name="l01029"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_m_i_p_solver.html"> 1029</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_knapsack_m_i_p_solver.html">KnapsackMIPSolver</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1_base_knapsack_solver.html">BaseKnapsackSolver</a> {</div>
|
|
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  <a class="code" href="classoperations__research_1_1_knapsack_m_i_p_solver.html#a86d45985fb2256114f8fa235af155cff">KnapsackMIPSolver</a>(<a class="code" href="classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8">MPSolver::OptimizationProblemType</a> <a class="code" href="linear__solver_8cc.html#acdf66e64954cbe33c30a45395b4d74b6">problem_type</a>,</div>
|
|
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  <span class="keyword">const</span> std::string& solver_name);</div>
|
|
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  </div>
|
|
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  <span class="comment">// Initializes the solver and enters the problem to be solved.</span></div>
|
|
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack_m_i_p_solver.html#a9025339045590a3988cb87ee4796a551">Init</a>(<span class="keyword">const</span> std::vector<int64>& profits,</div>
|
|
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  <span class="keyword">const</span> std::vector<std::vector<int64>>& weights,</div>
|
|
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  <span class="keyword">const</span> std::vector<int64>& capacities) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  </div>
|
|
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  <span class="comment">// Solves the problem and returns the profit of the optimal solution.</span></div>
|
|
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_knapsack_m_i_p_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7">Solve</a>(<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>, <span class="keywordtype">bool</span>* is_solution_optimal) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  </div>
|
|
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  <span class="comment">// Returns true if the item 'item_id' is packed in the optimal knapsack.</span></div>
|
|
<div class="line"><a name="l01043"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_m_i_p_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4"> 1043</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_knapsack_m_i_p_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4">best_solution</a>(<span class="keywordtype">int</span> item_id)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  <span class="keywordflow">return</span> best_solution_.at(item_id);</div>
|
|
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  }</div>
|
|
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  </div>
|
|
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <a class="code" href="classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8">MPSolver::OptimizationProblemType</a> problem_type_;</div>
|
|
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  std::vector<int64> profits_;</div>
|
|
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  std::vector<std::vector<int64>> weights_;</div>
|
|
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  std::vector<int64> capacities_;</div>
|
|
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  std::vector<bool> best_solution_;</div>
|
|
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span> };</div>
|
|
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  </div>
|
|
<div class="line"><a name="l01055"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_m_i_p_solver.html#a86d45985fb2256114f8fa235af155cff"> 1055</a></span> <a class="code" href="classoperations__research_1_1_knapsack_m_i_p_solver.html#a86d45985fb2256114f8fa235af155cff">KnapsackMIPSolver::KnapsackMIPSolver</a>(</div>
|
|
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  <a class="code" href="classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8">MPSolver::OptimizationProblemType</a> <a class="code" href="linear__solver_8cc.html#acdf66e64954cbe33c30a45395b4d74b6">problem_type</a>,</div>
|
|
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  <span class="keyword">const</span> std::string& solver_name)</div>
|
|
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  : <a class="code" href="classoperations__research_1_1_base_knapsack_solver.html">BaseKnapsackSolver</a>(solver_name),</div>
|
|
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  problem_type_(<a class="code" href="linear__solver_8cc.html#acdf66e64954cbe33c30a45395b4d74b6">problem_type</a>),</div>
|
|
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  profits_(),</div>
|
|
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  weights_(),</div>
|
|
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  capacities_(),</div>
|
|
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  best_solution_() {}</div>
|
|
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  </div>
|
|
<div class="line"><a name="l01065"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_m_i_p_solver.html#a9025339045590a3988cb87ee4796a551"> 1065</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack_m_i_p_solver.html#a9025339045590a3988cb87ee4796a551">KnapsackMIPSolver::Init</a>(<span class="keyword">const</span> std::vector<int64>& profits,</div>
|
|
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  <span class="keyword">const</span> std::vector<std::vector<int64>>& weights,</div>
|
|
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <span class="keyword">const</span> std::vector<int64>& capacities) {</div>
|
|
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  profits_ = profits;</div>
|
|
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  weights_ = weights;</div>
|
|
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  capacities_ = capacities;</div>
|
|
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span> }</div>
|
|
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  </div>
|
|
<div class="line"><a name="l01073"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_m_i_p_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7"> 1073</a></span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_knapsack_m_i_p_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7">KnapsackMIPSolver::Solve</a>(<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>,</div>
|
|
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  <span class="keywordtype">bool</span>* is_solution_optimal) {</div>
|
|
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(is_solution_optimal != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  *is_solution_optimal = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  <a class="code" href="classoperations__research_1_1_m_p_solver.html">MPSolver</a> solver(<a class="code" href="classoperations__research_1_1_base_knapsack_solver.html#ae194e7bee4a383e5ee6c8ed341b49b7e">GetName</a>(), problem_type_);</div>
|
|
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  </div>
|
|
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_items = profits_.size();</div>
|
|
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  std::vector<MPVariable*> variables;</div>
|
|
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#a200ccd114eb5057856c05501c2d4abe5">MakeBoolVarArray</a>(num_items, <span class="stringliteral">"x"</span>, &variables);</div>
|
|
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  </div>
|
|
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  <span class="comment">// Add constraints.</span></div>
|
|
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_dimensions = capacities_.size();</div>
|
|
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(weights_.size() == num_dimensions)</div>
|
|
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  << <span class="stringliteral">"Weights should be vector of num_dimensions ("</span> << num_dimensions</div>
|
|
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  << <span class="stringliteral">") vectors of size num_items ("</span> << num_items << <span class="stringliteral">")."</span>;</div>
|
|
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_dimensions; ++i) {</div>
|
|
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  <a class="code" href="classoperations__research_1_1_m_p_constraint.html">MPConstraint</a>* <span class="keyword">const</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#a43d6ca2f978ca6f622a16117166ff69a">MakeRowConstraint</a>(0LL, capacities_.at(i));</div>
|
|
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < num_items; ++j) {</div>
|
|
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->SetCoefficient(variables.at(j), weights_.at(i).at(j));</div>
|
|
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  }</div>
|
|
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  }</div>
|
|
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  </div>
|
|
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  <span class="comment">// Define objective to minimize. Minimization is used instead of maximization</span></div>
|
|
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  <span class="comment">// because of an issue with CBC solver which does not always find the optimal</span></div>
|
|
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  <span class="comment">// solution on maximization problems.</span></div>
|
|
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  <a class="code" href="classoperations__research_1_1_m_p_objective.html">MPObjective</a>* <span class="keyword">const</span> objective = solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#a226456dfb15300dd4e59d0bf80d0ce07">MutableObjective</a>();</div>
|
|
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < num_items; ++j) {</div>
|
|
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  objective-><a class="code" href="classoperations__research_1_1_m_p_objective.html#a2def997791a2a5119c3502aa68c34181">SetCoefficient</a>(variables.at(j), -profits_.at(j));</div>
|
|
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  }</div>
|
|
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  objective-><a class="code" href="classoperations__research_1_1_m_p_objective.html#ac187b2ba08422f3a06b8d1e1502ceea6">SetMinimization</a>();</div>
|
|
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  </div>
|
|
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#ae1df08a9aabad59b5d620930126e6d91">SuppressOutput</a>();</div>
|
|
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#acede9075c58cb2f506c99a9fe6f20303">Solve</a>();</div>
|
|
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  </div>
|
|
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  <span class="comment">// Store best solution.</span></div>
|
|
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> kRoundNear = 0.5;</div>
|
|
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  best_solution_.assign(num_items, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < num_items; ++j) {</div>
|
|
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> = variables.at(j)->solution_value();</div>
|
|
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  best_solution_.at(j) = <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> >= kRoundNear;</div>
|
|
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  }</div>
|
|
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  </div>
|
|
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  <span class="keywordflow">return</span> -objective-><a class="code" href="classoperations__research_1_1_m_p_objective.html#a8554e97d98d05016f16300cedf2be9f6">Value</a>() + kRoundNear;</div>
|
|
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span> }</div>
|
|
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  </div>
|
|
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span> <span class="comment">// ----- KnapsackSolver -----</span></div>
|
|
<div class="line"><a name="l01119"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_solver.html#a6b46c35c8977efde66ae7ad97423bdf2"> 1119</a></span> <a class="code" href="classoperations__research_1_1_knapsack_solver.html#a6b46c35c8977efde66ae7ad97423bdf2">KnapsackSolver::KnapsackSolver</a>(<span class="keyword">const</span> std::string& solver_name)</div>
|
|
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  : <a class="code" href="classoperations__research_1_1_knapsack_solver.html">KnapsackSolver</a>(KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER,</div>
|
|
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  solver_name) {}</div>
|
|
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  </div>
|
|
<div class="line"><a name="l01123"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_solver.html#a09627cf25401a9880d2e94551ecbf993"> 1123</a></span> <a class="code" href="classoperations__research_1_1_knapsack_solver.html#a6b46c35c8977efde66ae7ad97423bdf2">KnapsackSolver::KnapsackSolver</a>(<a class="code" href="classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306ec">SolverType</a> solver_type,</div>
|
|
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  <span class="keyword">const</span> std::string& solver_name)</div>
|
|
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  : solver_(),</div>
|
|
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  known_value_(),</div>
|
|
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  best_solution_(),</div>
|
|
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  mapping_reduced_item_id_(),</div>
|
|
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  is_problem_solved_(false),</div>
|
|
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  additional_profit_(0LL),</div>
|
|
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  use_reduction_(true),</div>
|
|
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  time_limit_seconds_(std::numeric_limits<double>::infinity()) {</div>
|
|
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  <span class="keywordflow">switch</span> (solver_type) {</div>
|
|
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306ecac43056d6d2f96cee37fcb8a752b0ff45">KNAPSACK_BRUTE_FORCE_SOLVER</a>:</div>
|
|
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  solver_ = absl::make_unique<KnapsackBruteForceSolver>(solver_name);</div>
|
|
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306ecaa020f211a1ff184e712aa4f372d6ea34">KNAPSACK_64ITEMS_SOLVER</a>:</div>
|
|
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  solver_ = absl::make_unique<Knapsack64ItemsSolver>(solver_name);</div>
|
|
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306eca793d998526508cfcc2bfc89fe25b3edd">KNAPSACK_DYNAMIC_PROGRAMMING_SOLVER</a>:</div>
|
|
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  solver_ =</div>
|
|
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  absl::make_unique<KnapsackDynamicProgrammingSolver>(solver_name);</div>
|
|
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306eca2a4e77eec4f386d17001e7285e812a0b">KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER</a>:</div>
|
|
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  solver_ = absl::make_unique<KnapsackGenericSolver>(solver_name);</div>
|
|
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span> <span class="preprocessor">#if defined(USE_CBC)</span></div>
|
|
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306ecae2ce6e36a247621de398e875d5feb575">KNAPSACK_MULTIDIMENSION_CBC_MIP_SOLVER</a>:</div>
|
|
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  solver_ = absl::make_unique<KnapsackMIPSolver>(</div>
|
|
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  <a class="code" href="classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8ad183dc62c63346a3b984b93fbda0137a">MPSolver::CBC_MIXED_INTEGER_PROGRAMMING</a>, solver_name);</div>
|
|
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span> <span class="preprocessor">#endif </span><span class="comment">// USE_CBC</span></div>
|
|
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span> <span class="preprocessor">#if defined(USE_SCIP)</span></div>
|
|
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306eca1f4e1e2f80ab9c7d4fc1b14d9f5da959">KNAPSACK_MULTIDIMENSION_SCIP_MIP_SOLVER</a>:</div>
|
|
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  solver_ = absl::make_unique<KnapsackMIPSolver>(</div>
|
|
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  <a class="code" href="classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8a83b85675904f261c34c280b2abdcd9ae">MPSolver::SCIP_MIXED_INTEGER_PROGRAMMING</a>, solver_name);</div>
|
|
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span> <span class="preprocessor">#endif </span><span class="comment">// USE_SCIP</span></div>
|
|
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span> <span class="preprocessor">#if defined(USE_XPRESS)</span></div>
|
|
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  <span class="keywordflow">case</span> KNAPSACK_MULTIDIMENSION_XPRESS_MIP_SOLVER:</div>
|
|
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  solver_ = absl::make_unique<KnapsackMIPSolver>(</div>
|
|
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  <a class="code" href="classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8a5a62faa5ec0ffed2abbc2d526bd53286">MPSolver::XPRESS_MIXED_INTEGER_PROGRAMMING</a>, solver_name);</div>
|
|
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span> <span class="preprocessor">#if defined(USE_CPLEX)</span></div>
|
|
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  <span class="keywordflow">case</span> KNAPSACK_MULTIDIMENSION_CPLEX_MIP_SOLVER:</div>
|
|
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  solver_ = absl::make_unique<KnapsackMIPSolver>(</div>
|
|
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  <a class="code" href="classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8a223fb1b5c8d153d5fef50b8d6f0426e9">MPSolver::CPLEX_MIXED_INTEGER_PROGRAMMING</a>, solver_name);</div>
|
|
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Unknown knapsack solver type."</span>;</div>
|
|
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  }</div>
|
|
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span> }</div>
|
|
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  </div>
|
|
<div class="line"><a name="l01176"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_solver.html#abb19dddb08cf912baec8995cfd2f1f42"> 1176</a></span> <a class="code" href="classoperations__research_1_1_knapsack_solver.html#abb19dddb08cf912baec8995cfd2f1f42">KnapsackSolver::~KnapsackSolver</a>() {}</div>
|
|
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  </div>
|
|
<div class="line"><a name="l01178"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_solver.html#a89892382a4f8fa0a4baeb4a3451b8b32"> 1178</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_knapsack_solver.html#a89892382a4f8fa0a4baeb4a3451b8b32">KnapsackSolver::Init</a>(<span class="keyword">const</span> std::vector<int64>& profits,</div>
|
|
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <span class="keyword">const</span> std::vector<std::vector<int64>>& weights,</div>
|
|
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  <span class="keyword">const</span> std::vector<int64>& capacities) {</div>
|
|
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  time_limit_ = absl::make_unique<TimeLimit>(time_limit_seconds_);</div>
|
|
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  is_solution_optimal_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  additional_profit_ = 0LL;</div>
|
|
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  is_problem_solved_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  </div>
|
|
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_items = profits.size();</div>
|
|
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  std::vector<std::vector<int64>> reduced_weights;</div>
|
|
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  std::vector<int64> reduced_capacities;</div>
|
|
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  <span class="keywordflow">if</span> (use_reduction_) {</div>
|
|
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_reduced_items = ReduceCapacities(</div>
|
|
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  num_items, weights, capacities, &reduced_weights, &reduced_capacities);</div>
|
|
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <span class="keywordflow">if</span> (num_reduced_items > 0) {</div>
|
|
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  ComputeAdditionalProfit(profits);</div>
|
|
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  }</div>
|
|
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  reduced_weights = weights;</div>
|
|
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  reduced_capacities = capacities;</div>
|
|
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  }</div>
|
|
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  <span class="keywordflow">if</span> (!is_problem_solved_) {</div>
|
|
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  solver_->Init(profits, reduced_weights, reduced_capacities);</div>
|
|
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  <span class="keywordflow">if</span> (use_reduction_) {</div>
|
|
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_reduced_items = ReduceProblem(num_items);</div>
|
|
<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  </div>
|
|
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  <span class="keywordflow">if</span> (num_reduced_items > 0) {</div>
|
|
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  ComputeAdditionalProfit(profits);</div>
|
|
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  }</div>
|
|
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  </div>
|
|
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  <span class="keywordflow">if</span> (num_reduced_items > 0 && num_reduced_items < num_items) {</div>
|
|
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  InitReducedProblem(profits, reduced_weights, reduced_capacities);</div>
|
|
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  }</div>
|
|
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  }</div>
|
|
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  }</div>
|
|
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  <span class="keywordflow">if</span> (is_problem_solved_) {</div>
|
|
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  is_solution_optimal_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  }</div>
|
|
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span> }</div>
|
|
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  </div>
|
|
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span> <span class="keywordtype">int</span> KnapsackSolver::ReduceCapacities(</div>
|
|
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <span class="keywordtype">int</span> num_items, <span class="keyword">const</span> std::vector<std::vector<int64>>& weights,</div>
|
|
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  <span class="keyword">const</span> std::vector<int64>& capacities,</div>
|
|
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  std::vector<std::vector<int64>>* reduced_weights,</div>
|
|
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  std::vector<int64>* reduced_capacities) {</div>
|
|
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  known_value_.assign(num_items, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  best_solution_.assign(num_items, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  mapping_reduced_item_id_.assign(num_items, 0);</div>
|
|
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  std::vector<bool> active_capacities(weights.size(), <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  <span class="keywordtype">int</span> number_of_active_capacities = 0;</div>
|
|
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < weights.size(); ++i) {</div>
|
|
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_weight = 0;</div>
|
|
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#ae42ca38a167164c07831993889216903">weight</a> : weights[i]) {</div>
|
|
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  max_weight += <a class="code" href="pack_8cc.html#ae42ca38a167164c07831993889216903">weight</a>;</div>
|
|
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  }</div>
|
|
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  <span class="keywordflow">if</span> (max_weight <= capacities[i]) {</div>
|
|
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  active_capacities[i] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  ++number_of_active_capacities;</div>
|
|
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  }</div>
|
|
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  }</div>
|
|
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  reduced_weights->reserve(number_of_active_capacities);</div>
|
|
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  reduced_capacities->reserve(number_of_active_capacities);</div>
|
|
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < weights.size(); ++i) {</div>
|
|
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  <span class="keywordflow">if</span> (active_capacities[i]) {</div>
|
|
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  reduced_weights->push_back(weights[i]);</div>
|
|
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  reduced_capacities->push_back(capacities[i]);</div>
|
|
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  }</div>
|
|
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  }</div>
|
|
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  <span class="keywordflow">if</span> (reduced_capacities->empty()) {</div>
|
|
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  <span class="comment">// There are no capacity constraints in the problem so we can reduce all</span></div>
|
|
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  <span class="comment">// items and just add them to the best solution.</span></div>
|
|
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> item_id = 0; item_id < num_items; ++item_id) {</div>
|
|
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  known_value_[item_id] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  best_solution_[item_id] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  }</div>
|
|
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  is_problem_solved_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  <span class="comment">// All items are reduced.</span></div>
|
|
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  <span class="keywordflow">return</span> num_items;</div>
|
|
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  }</div>
|
|
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  <span class="comment">// There are still capacity constraints so no item reduction is done.</span></div>
|
|
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span> }</div>
|
|
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  </div>
|
|
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span> <span class="keywordtype">int</span> KnapsackSolver::ReduceProblem(<span class="keywordtype">int</span> num_items) {</div>
|
|
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  known_value_.assign(num_items, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  best_solution_.assign(num_items, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  mapping_reduced_item_id_.assign(num_items, 0);</div>
|
|
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  additional_profit_ = 0LL;</div>
|
|
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  </div>
|
|
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> item_id = 0; item_id < num_items; ++item_id) {</div>
|
|
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  mapping_reduced_item_id_[item_id] = item_id;</div>
|
|
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  }</div>
|
|
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  </div>
|
|
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> best_lower_bound = 0LL;</div>
|
|
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  std::vector<int64> J0_upper_bounds(num_items, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>);</div>
|
|
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  std::vector<int64> J1_upper_bounds(num_items, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>);</div>
|
|
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> item_id = 0; item_id < num_items; ++item_id) {</div>
|
|
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  <span class="keywordflow">if</span> (time_limit_->LimitReached()) {</div>
|
|
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  }</div>
|
|
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lower_bound = 0LL;</div>
|
|
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> upper_bound = <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  solver_->GetLowerAndUpperBoundWhenItem(item_id, <span class="keyword">false</span>, &lower_bound,</div>
|
|
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  &upper_bound);</div>
|
|
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  J1_upper_bounds.at(item_id) = upper_bound;</div>
|
|
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  best_lower_bound = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(best_lower_bound, lower_bound);</div>
|
|
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  </div>
|
|
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  solver_->GetLowerAndUpperBoundWhenItem(item_id, <span class="keyword">true</span>, &lower_bound,</div>
|
|
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  &upper_bound);</div>
|
|
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  J0_upper_bounds.at(item_id) = upper_bound;</div>
|
|
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  best_lower_bound = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(best_lower_bound, lower_bound);</div>
|
|
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  }</div>
|
|
<div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  </div>
|
|
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  <span class="keywordtype">int</span> num_reduced_items = 0;</div>
|
|
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> item_id = 0; item_id < num_items; ++item_id) {</div>
|
|
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  <span class="keywordflow">if</span> (best_lower_bound > J0_upper_bounds[item_id]) {</div>
|
|
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  known_value_[item_id] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  best_solution_[item_id] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  ++num_reduced_items;</div>
|
|
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (best_lower_bound > J1_upper_bounds[item_id]) {</div>
|
|
<div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  known_value_[item_id] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  best_solution_[item_id] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  ++num_reduced_items;</div>
|
|
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  }</div>
|
|
<div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  }</div>
|
|
<div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  </div>
|
|
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  is_problem_solved_ = num_reduced_items == num_items;</div>
|
|
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  <span class="keywordflow">return</span> num_reduced_items;</div>
|
|
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</span> }</div>
|
|
<div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  </div>
|
|
<div class="line"><a name="l01309"></a><span class="lineno"> 1309</span> <span class="keywordtype">void</span> KnapsackSolver::ComputeAdditionalProfit(</div>
|
|
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  <span class="keyword">const</span> std::vector<int64>& profits) {</div>
|
|
<div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_items = profits.size();</div>
|
|
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  additional_profit_ = 0LL;</div>
|
|
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> item_id = 0; item_id < num_items; ++item_id) {</div>
|
|
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  <span class="keywordflow">if</span> (known_value_[item_id] && best_solution_[item_id]) {</div>
|
|
<div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  additional_profit_ += profits[item_id];</div>
|
|
<div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  }</div>
|
|
<div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  }</div>
|
|
<div class="line"><a name="l01318"></a><span class="lineno"> 1318</span> }</div>
|
|
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  </div>
|
|
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span> <span class="keywordtype">void</span> KnapsackSolver::InitReducedProblem(</div>
|
|
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  <span class="keyword">const</span> std::vector<int64>& profits,</div>
|
|
<div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  <span class="keyword">const</span> std::vector<std::vector<int64>>& weights,</div>
|
|
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  <span class="keyword">const</span> std::vector<int64>& capacities) {</div>
|
|
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_items = profits.size();</div>
|
|
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_dimensions = capacities.size();</div>
|
|
<div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  </div>
|
|
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  std::vector<int64> reduced_profits;</div>
|
|
<div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> item_id = 0; item_id < num_items; ++item_id) {</div>
|
|
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  <span class="keywordflow">if</span> (!known_value_[item_id]) {</div>
|
|
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  mapping_reduced_item_id_[item_id] = reduced_profits.size();</div>
|
|
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  reduced_profits.push_back(profits[item_id]);</div>
|
|
<div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  }</div>
|
|
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  }</div>
|
|
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  </div>
|
|
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  std::vector<std::vector<int64>> reduced_weights;</div>
|
|
<div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  std::vector<int64> reduced_capacities = capacities;</div>
|
|
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> dim = 0; dim < num_dimensions; ++dim) {</div>
|
|
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  <span class="keyword">const</span> std::vector<int64>& one_dimension_weights = weights[dim];</div>
|
|
<div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  std::vector<int64> one_dimension_reduced_weights;</div>
|
|
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> item_id = 0; item_id < num_items; ++item_id) {</div>
|
|
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  <span class="keywordflow">if</span> (known_value_[item_id]) {</div>
|
|
<div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  <span class="keywordflow">if</span> (best_solution_[item_id]) {</div>
|
|
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  reduced_capacities[dim] -= one_dimension_weights[item_id];</div>
|
|
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  }</div>
|
|
<div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  one_dimension_reduced_weights.push_back(one_dimension_weights[item_id]);</div>
|
|
<div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  }</div>
|
|
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  }</div>
|
|
<div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  reduced_weights.push_back(one_dimension_reduced_weights);</div>
|
|
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  }</div>
|
|
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  solver_->Init(reduced_profits, reduced_weights, reduced_capacities);</div>
|
|
<div class="line"><a name="l01352"></a><span class="lineno"> 1352</span> }</div>
|
|
<div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  </div>
|
|
<div class="line"><a name="l01354"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_solver.html#a666eb21bb3912d9500caf2c63f5bcefb"> 1354</a></span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_knapsack_solver.html#a666eb21bb3912d9500caf2c63f5bcefb">KnapsackSolver::Solve</a>() {</div>
|
|
<div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  <span class="keywordflow">return</span> additional_profit_ +</div>
|
|
<div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  ((is_problem_solved_)</div>
|
|
<div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  ? 0</div>
|
|
<div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  : solver_->Solve(time_limit_.get(), &is_solution_optimal_));</div>
|
|
<div class="line"><a name="l01359"></a><span class="lineno"> 1359</span> }</div>
|
|
<div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  </div>
|
|
<div class="line"><a name="l01361"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_solver.html#a57d88f584d14b161580550918c8fbf3b"> 1361</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_knapsack_solver.html#a57d88f584d14b161580550918c8fbf3b">KnapsackSolver::BestSolutionContains</a>(<span class="keywordtype">int</span> item_id)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> mapped_item_id =</div>
|
|
<div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  (use_reduction_) ? mapping_reduced_item_id_[item_id] : item_id;</div>
|
|
<div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  <span class="keywordflow">return</span> (use_reduction_ && known_value_[item_id])</div>
|
|
<div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  ? best_solution_[item_id]</div>
|
|
<div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  : solver_->best_solution(mapped_item_id);</div>
|
|
<div class="line"><a name="l01367"></a><span class="lineno"> 1367</span> }</div>
|
|
<div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  </div>
|
|
<div class="line"><a name="l01369"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_knapsack_solver.html#a9a98946a64f3893b085f650932c9dfee"> 1369</a></span> std::string <a class="code" href="classoperations__research_1_1_knapsack_solver.html#a9a98946a64f3893b085f650932c9dfee">KnapsackSolver::GetName</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> solver_->GetName(); }</div>
|
|
<div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  </div>
|
|
<div class="line"><a name="l01371"></a><span class="lineno"> 1371</span> <span class="comment">// ----- BaseKnapsackSolver -----</span></div>
|
|
<div class="line"><a name="l01372"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_base_knapsack_solver.html#a89a48b92823beaaf48f9580ea38c24d1"> 1372</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_base_knapsack_solver.html#a89a48b92823beaaf48f9580ea38c24d1">BaseKnapsackSolver::GetLowerAndUpperBoundWhenItem</a>(<span class="keywordtype">int</span> item_id,</div>
|
|
<div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  <span class="keywordtype">bool</span> is_item_in,</div>
|
|
<div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* lower_bound,</div>
|
|
<div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* upper_bound) {</div>
|
|
<div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(lower_bound != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(upper_bound != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  *lower_bound = 0LL;</div>
|
|
<div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  *upper_bound = <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l01380"></a><span class="lineno"> 1380</span> }</div>
|
|
<div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  </div>
|
|
<div class="line"><a name="l01382"></a><span class="lineno"> 1382</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a021e695f54a13bd809c34b2f4ca87c37"><div class="ttname"><a href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">min</a></div><div class="ttdeci">int64 min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00138">alldiff_cst.cc:138</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a9d0c202d5fdd62f4fa2c613339ff168a"><div class="ttname"><a href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">max</a></div><div class="ttdeci">int64 max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a4bd2e815ca2f702a4b6aa744b1ff3b82"><div class="ttname"><a href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a></div><div class="ttdeci">#define CHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00700">base/logging.h:700</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00697">base/logging.h:697</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00701">base/logging.h:701</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab4f56aa24c4c9cddc47a6abd2d747f9a"><div class="ttname"><a href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a></div><div class="ttdeci">#define DCHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00890">base/logging.h:890</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00420">base/logging.h:420</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00884">base/logging.h:884</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae4db23f10f5d4aad6d735f5a74cd6f8c"><div class="ttname"><a href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a></div><div class="ttdeci">#define CHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00699">base/logging.h:699</a></div></div>
|
|
<div class="ttc" id="abitset_8h_html"><div class="ttname"><a href="bitset_8h.html">bitset.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_base_knapsack_solver_html"><div class="ttname"><a href="classoperations__research_1_1_base_knapsack_solver.html">operations_research::BaseKnapsackSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00566">knapsack_solver.h:566</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_base_knapsack_solver_html_a89a48b92823beaaf48f9580ea38c24d1"><div class="ttname"><a href="classoperations__research_1_1_base_knapsack_solver.html#a89a48b92823beaaf48f9580ea38c24d1">operations_research::BaseKnapsackSolver::GetLowerAndUpperBoundWhenItem</a></div><div class="ttdeci">virtual void GetLowerAndUpperBoundWhenItem(int item_id, bool is_item_in, int64 *lower_bound, int64 *upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l01372">knapsack_solver.cc:1372</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_base_knapsack_solver_html_ae194e7bee4a383e5ee6c8ed341b49b7e"><div class="ttname"><a href="classoperations__research_1_1_base_knapsack_solver.html#ae194e7bee4a383e5ee6c8ed341b49b7e">operations_research::BaseKnapsackSolver::GetName</a></div><div class="ttdeci">virtual std::string GetName() const</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00590">knapsack_solver.h:590</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack64_items_solver_html"><div class="ttname"><a href="classoperations__research_1_1_knapsack64_items_solver.html">operations_research::Knapsack64ItemsSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00674">knapsack_solver.cc:674</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack64_items_solver_html_a6efbe15e2ab4e192b6af2fdcdda41ca2"><div class="ttname"><a href="classoperations__research_1_1_knapsack64_items_solver.html#a6efbe15e2ab4e192b6af2fdcdda41ca2">operations_research::Knapsack64ItemsSolver::Knapsack64ItemsSolver</a></div><div class="ttdeci">Knapsack64ItemsSolver(const std::string &solver_name)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00724">knapsack_solver.cc:724</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack64_items_solver_html_a9025339045590a3988cb87ee4796a551"><div class="ttname"><a href="classoperations__research_1_1_knapsack64_items_solver.html#a9025339045590a3988cb87ee4796a551">operations_research::Knapsack64ItemsSolver::Init</a></div><div class="ttdeci">void Init(const std::vector< int64 > &profits, const std::vector< std::vector< int64 >> &weights, const std::vector< int64 > &capacities) override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00739">knapsack_solver.cc:739</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack64_items_solver_html_abfd4cb3faa2f1d6840b8123765fa2fc4"><div class="ttname"><a href="classoperations__research_1_1_knapsack64_items_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4">operations_research::Knapsack64ItemsSolver::best_solution</a></div><div class="ttdeci">bool best_solution(int item_id) const override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00687">knapsack_solver.cc:687</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack64_items_solver_html_ad596c251b64c28e1e5b34e9de44b2dd7"><div class="ttname"><a href="classoperations__research_1_1_knapsack64_items_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7">operations_research::Knapsack64ItemsSolver::Solve</a></div><div class="ttdeci">int64 Solve(TimeLimit *time_limit, bool *is_solution_optimal) override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00779">knapsack_solver.cc:779</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_brute_force_solver_html"><div class="ttname"><a href="classoperations__research_1_1_knapsack_brute_force_solver.html">operations_research::KnapsackBruteForceSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00544">knapsack_solver.cc:544</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_brute_force_solver_html_a4f9df2a0d826265d62cd86f04070d439"><div class="ttname"><a href="classoperations__research_1_1_knapsack_brute_force_solver.html#a4f9df2a0d826265d62cd86f04070d439">operations_research::KnapsackBruteForceSolver::KnapsackBruteForceSolver</a></div><div class="ttdeci">KnapsackBruteForceSolver(const std::string &solver_name)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00571">knapsack_solver.cc:571</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_brute_force_solver_html_a9025339045590a3988cb87ee4796a551"><div class="ttname"><a href="classoperations__research_1_1_knapsack_brute_force_solver.html#a9025339045590a3988cb87ee4796a551">operations_research::KnapsackBruteForceSolver::Init</a></div><div class="ttdeci">void Init(const std::vector< int64 > &profits, const std::vector< std::vector< int64 >> &weights, const std::vector< int64 > &capacities) override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00579">knapsack_solver.cc:579</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_brute_force_solver_html_abfd4cb3faa2f1d6840b8123765fa2fc4"><div class="ttname"><a href="classoperations__research_1_1_knapsack_brute_force_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4">operations_research::KnapsackBruteForceSolver::best_solution</a></div><div class="ttdeci">bool best_solution(int item_id) const override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00557">knapsack_solver.cc:557</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_brute_force_solver_html_ad596c251b64c28e1e5b34e9de44b2dd7"><div class="ttname"><a href="classoperations__research_1_1_knapsack_brute_force_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7">operations_research::KnapsackBruteForceSolver::Solve</a></div><div class="ttdeci">int64 Solve(TimeLimit *time_limit, bool *is_solution_optimal) override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00602">knapsack_solver.cc:602</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_capacity_propagator_html"><div class="ttname"><a href="classoperations__research_1_1_knapsack_capacity_propagator.html">operations_research::KnapsackCapacityPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00526">knapsack_solver.h:526</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_capacity_propagator_html_a0884060c60d64130c91ee7300cd3c4b0"><div class="ttname"><a href="classoperations__research_1_1_knapsack_capacity_propagator.html#a0884060c60d64130c91ee7300cd3c4b0">operations_research::KnapsackCapacityPropagator::KnapsackCapacityPropagator</a></div><div class="ttdeci">KnapsackCapacityPropagator(const KnapsackState &state, int64 capacity)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00209">knapsack_solver.cc:209</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_capacity_propagator_html_a3cde41b7fa0c9734783a562aadd9ef8c"><div class="ttname"><a href="classoperations__research_1_1_knapsack_capacity_propagator.html#a3cde41b7fa0c9734783a562aadd9ef8c">operations_research::KnapsackCapacityPropagator::UpdatePropagator</a></div><div class="ttdeci">bool UpdatePropagator(bool revert, const KnapsackAssignment &assignment) override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00267">knapsack_solver.cc:267</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_capacity_propagator_html_a706a3a7c9568016131afd718f347ec8d"><div class="ttname"><a href="classoperations__research_1_1_knapsack_capacity_propagator.html#a706a3a7c9568016131afd718f347ec8d">operations_research::KnapsackCapacityPropagator::CopyCurrentStateToSolutionPropagator</a></div><div class="ttdeci">void CopyCurrentStateToSolutionPropagator(std::vector< bool > *solution) const override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00282">knapsack_solver.cc:282</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_capacity_propagator_html_a9921c39ed90a9cd32301ee0fee9491cb"><div class="ttname"><a href="classoperations__research_1_1_knapsack_capacity_propagator.html#a9921c39ed90a9cd32301ee0fee9491cb">operations_research::KnapsackCapacityPropagator::ComputeProfitBounds</a></div><div class="ttdeci">void ComputeProfitBounds() override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00222">knapsack_solver.cc:222</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_capacity_propagator_html_aa14e63156675c18c06073ac1cb8aa170"><div class="ttname"><a href="classoperations__research_1_1_knapsack_capacity_propagator.html#aa14e63156675c18c06073ac1cb8aa170">operations_research::KnapsackCapacityPropagator::~KnapsackCapacityPropagator</a></div><div class="ttdeci">~KnapsackCapacityPropagator() override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00218">knapsack_solver.cc:218</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_capacity_propagator_html_ae2545020be753ee6a66c277daac41784"><div class="ttname"><a href="classoperations__research_1_1_knapsack_capacity_propagator.html#ae2545020be753ee6a66c277daac41784">operations_research::KnapsackCapacityPropagator::InitPropagator</a></div><div class="ttdeci">void InitPropagator() override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00253">knapsack_solver.cc:253</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_dynamic_programming_solver_html"><div class="ttname"><a href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html">operations_research::KnapsackDynamicProgrammingSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00930">knapsack_solver.cc:930</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_dynamic_programming_solver_html_a9025339045590a3988cb87ee4796a551"><div class="ttname"><a href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html#a9025339045590a3988cb87ee4796a551">operations_research::KnapsackDynamicProgrammingSolver::Init</a></div><div class="ttdeci">void Init(const std::vector< int64 > &profits, const std::vector< std::vector< int64 >> &weights, const std::vector< int64 > &capacities) override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00969">knapsack_solver.cc:969</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_dynamic_programming_solver_html_abfd4cb3faa2f1d6840b8123765fa2fc4"><div class="ttname"><a href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4">operations_research::KnapsackDynamicProgrammingSolver::best_solution</a></div><div class="ttdeci">bool best_solution(int item_id) const override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00943">knapsack_solver.cc:943</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_dynamic_programming_solver_html_ad12d8a6596d658d1b3fabafdeb505d16"><div class="ttname"><a href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html#ad12d8a6596d658d1b3fabafdeb505d16">operations_research::KnapsackDynamicProgrammingSolver::KnapsackDynamicProgrammingSolver</a></div><div class="ttdeci">KnapsackDynamicProgrammingSolver(const std::string &solver_name)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00959">knapsack_solver.cc:959</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_dynamic_programming_solver_html_ad596c251b64c28e1e5b34e9de44b2dd7"><div class="ttname"><a href="classoperations__research_1_1_knapsack_dynamic_programming_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7">operations_research::KnapsackDynamicProgrammingSolver::Solve</a></div><div class="ttdeci">int64 Solve(TimeLimit *time_limit, bool *is_solution_optimal) override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l01004">knapsack_solver.cc:1004</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_generic_solver_html_a2a25594d97a0a532f9d814bdc6dea380"><div class="ttname"><a href="classoperations__research_1_1_knapsack_generic_solver.html#a2a25594d97a0a532f9d814bdc6dea380">operations_research::KnapsackGenericSolver::~KnapsackGenericSolver</a></div><div class="ttdeci">~KnapsackGenericSolver() override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00345">knapsack_solver.cc:345</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_generic_solver_html_a2a7bff5cf8a51192eadec54eb0499064"><div class="ttname"><a href="classoperations__research_1_1_knapsack_generic_solver.html#a2a7bff5cf8a51192eadec54eb0499064">operations_research::KnapsackGenericSolver::KnapsackGenericSolver</a></div><div class="ttdeci">KnapsackGenericSolver(const std::string &solver_name)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00336">knapsack_solver.cc:336</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_generic_solver_html_a35bfa97bc24861491acb8d3d20087306"><div class="ttname"><a href="classoperations__research_1_1_knapsack_generic_solver.html#a35bfa97bc24861491acb8d3d20087306">operations_research::KnapsackGenericSolver::GetLowerAndUpperBoundWhenItem</a></div><div class="ttdeci">void GetLowerAndUpperBoundWhenItem(int item_id, bool is_item_in, int64 *lower_bound, int64 *upper_bound) override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00368">knapsack_solver.cc:368</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_generic_solver_html_a51cac72a6280d047002a1b9bf34d7948"><div class="ttname"><a href="classoperations__research_1_1_knapsack_generic_solver.html#a51cac72a6280d047002a1b9bf34d7948">operations_research::KnapsackGenericSolver::Init</a></div><div class="ttdeci">void Init(const std::vector< int64 > &profits, const std::vector< std::vector< int64 > > &weights, const std::vector< int64 > &capacities) override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00347">knapsack_solver.cc:347</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_generic_solver_html_ad596c251b64c28e1e5b34e9de44b2dd7"><div class="ttname"><a href="classoperations__research_1_1_knapsack_generic_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7">operations_research::KnapsackGenericSolver::Solve</a></div><div class="ttdeci">int64 Solve(TimeLimit *time_limit, bool *is_solution_optimal) override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00394">knapsack_solver.cc:394</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_m_i_p_solver_html"><div class="ttname"><a href="classoperations__research_1_1_knapsack_m_i_p_solver.html">operations_research::KnapsackMIPSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l01029">knapsack_solver.cc:1029</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_m_i_p_solver_html_a86d45985fb2256114f8fa235af155cff"><div class="ttname"><a href="classoperations__research_1_1_knapsack_m_i_p_solver.html#a86d45985fb2256114f8fa235af155cff">operations_research::KnapsackMIPSolver::KnapsackMIPSolver</a></div><div class="ttdeci">KnapsackMIPSolver(MPSolver::OptimizationProblemType problem_type, const std::string &solver_name)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l01055">knapsack_solver.cc:1055</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_m_i_p_solver_html_a9025339045590a3988cb87ee4796a551"><div class="ttname"><a href="classoperations__research_1_1_knapsack_m_i_p_solver.html#a9025339045590a3988cb87ee4796a551">operations_research::KnapsackMIPSolver::Init</a></div><div class="ttdeci">void Init(const std::vector< int64 > &profits, const std::vector< std::vector< int64 >> &weights, const std::vector< int64 > &capacities) override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l01065">knapsack_solver.cc:1065</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_m_i_p_solver_html_abfd4cb3faa2f1d6840b8123765fa2fc4"><div class="ttname"><a href="classoperations__research_1_1_knapsack_m_i_p_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4">operations_research::KnapsackMIPSolver::best_solution</a></div><div class="ttdeci">bool best_solution(int item_id) const override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l01043">knapsack_solver.cc:1043</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_m_i_p_solver_html_ad596c251b64c28e1e5b34e9de44b2dd7"><div class="ttname"><a href="classoperations__research_1_1_knapsack_m_i_p_solver.html#ad596c251b64c28e1e5b34e9de44b2dd7">operations_research::KnapsackMIPSolver::Solve</a></div><div class="ttdeci">int64 Solve(TimeLimit *time_limit, bool *is_solution_optimal) override</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l01073">knapsack_solver.cc:1073</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_propagator_html"><div class="ttname"><a href="classoperations__research_1_1_knapsack_propagator.html">operations_research::KnapsackPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00440">knapsack_solver.h:440</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_propagator_html_a0dbb4d48acf17b899ecf83ea7e38fdc6"><div class="ttname"><a href="classoperations__research_1_1_knapsack_propagator.html#a0dbb4d48acf17b899ecf83ea7e38fdc6">operations_research::KnapsackPropagator::profit_lower_bound</a></div><div class="ttdeci">int64 profit_lower_bound() const</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00460">knapsack_solver.h:460</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_propagator_html_a1fa45af1bf0d6aa9d5f86e2ed9ae5323"><div class="ttname"><a href="classoperations__research_1_1_knapsack_propagator.html#a1fa45af1bf0d6aa9d5f86e2ed9ae5323">operations_research::KnapsackPropagator::CopyCurrentStateToSolution</a></div><div class="ttdeci">void CopyCurrentStateToSolution(bool has_one_propagator, std::vector< bool > *solution) const</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00196">knapsack_solver.cc:196</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_propagator_html_a5a0d11be6f0d5b521477226fb7573db8"><div class="ttname"><a href="classoperations__research_1_1_knapsack_propagator.html#a5a0d11be6f0d5b521477226fb7573db8">operations_research::KnapsackPropagator::UpdatePropagator</a></div><div class="ttdeci">virtual bool UpdatePropagator(bool revert, const KnapsackAssignment &assignment)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_propagator_html_a69d95c916b31aeb94a63596cabb507dd"><div class="ttname"><a href="classoperations__research_1_1_knapsack_propagator.html#a69d95c916b31aeb94a63596cabb507dd">operations_research::KnapsackPropagator::set_profit_lower_bound</a></div><div class="ttdeci">void set_profit_lower_bound(int64 profit)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00493">knapsack_solver.h:493</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_propagator_html_a883cd053b1e7322727eb9e19940f69f6"><div class="ttname"><a href="classoperations__research_1_1_knapsack_propagator.html#a883cd053b1e7322727eb9e19940f69f6">operations_research::KnapsackPropagator::InitPropagator</a></div><div class="ttdeci">virtual void InitPropagator()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_propagator_html_a9b748c5fb5e1da5da53026ffb91db51f"><div class="ttname"><a href="classoperations__research_1_1_knapsack_propagator.html#a9b748c5fb5e1da5da53026ffb91db51f">operations_research::KnapsackPropagator::state</a></div><div class="ttdeci">const KnapsackState & state() const</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00490">knapsack_solver.h:490</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_propagator_html_a9fdde4d0e47bfb9ca54f16554a69ce1b"><div class="ttname"><a href="classoperations__research_1_1_knapsack_propagator.html#a9fdde4d0e47bfb9ca54f16554a69ce1b">operations_research::KnapsackPropagator::Init</a></div><div class="ttdeci">void Init(const std::vector< int64 > &profits, const std::vector< int64 > &weights)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00171">knapsack_solver.cc:171</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_propagator_html_aa4161d4fb0a577a3e854b7f285d7ace6"><div class="ttname"><a href="classoperations__research_1_1_knapsack_propagator.html#aa4161d4fb0a577a3e854b7f285d7ace6">operations_research::KnapsackPropagator::items</a></div><div class="ttdeci">const std::vector< KnapsackItemPtr > & items() const</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00491">knapsack_solver.h:491</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_propagator_html_ab7f8c7e53d1f8f72cb6b1a2bffae2407"><div class="ttname"><a href="classoperations__research_1_1_knapsack_propagator.html#ab7f8c7e53d1f8f72cb6b1a2bffae2407">operations_research::KnapsackPropagator::set_profit_upper_bound</a></div><div class="ttdeci">void set_profit_upper_bound(int64 profit)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00494">knapsack_solver.h:494</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_propagator_html_ab803770e8e21bb448a2f3d940ab125f8"><div class="ttname"><a href="classoperations__research_1_1_knapsack_propagator.html#ab803770e8e21bb448a2f3d940ab125f8">operations_research::KnapsackPropagator::CopyCurrentStateToSolutionPropagator</a></div><div class="ttdeci">virtual void CopyCurrentStateToSolutionPropagator(std::vector< bool > *solution) const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_propagator_html_ade05a213d54a2045bab20c41e56a2144"><div class="ttname"><a href="classoperations__research_1_1_knapsack_propagator.html#ade05a213d54a2045bab20c41e56a2144">operations_research::KnapsackPropagator::profit_upper_bound</a></div><div class="ttdeci">int64 profit_upper_bound() const</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00461">knapsack_solver.h:461</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_propagator_html_af15d878d664ee8a07cf3b710f8047cba"><div class="ttname"><a href="classoperations__research_1_1_knapsack_propagator.html#af15d878d664ee8a07cf3b710f8047cba">operations_research::KnapsackPropagator::~KnapsackPropagator</a></div><div class="ttdeci">virtual ~KnapsackPropagator()</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00169">knapsack_solver.cc:169</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_propagator_html_af28391017c090a638200c57b4c8a2ac1"><div class="ttname"><a href="classoperations__research_1_1_knapsack_propagator.html#af28391017c090a638200c57b4c8a2ac1">operations_research::KnapsackPropagator::KnapsackPropagator</a></div><div class="ttdeci">KnapsackPropagator(const KnapsackState &state)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00162">knapsack_solver.cc:162</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_propagator_html_af41d4ebb02ec2b735851141b01f4769a"><div class="ttname"><a href="classoperations__research_1_1_knapsack_propagator.html#af41d4ebb02ec2b735851141b01f4769a">operations_research::KnapsackPropagator::current_profit</a></div><div class="ttdeci">int64 current_profit() const</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00459">knapsack_solver.h:459</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_propagator_html_af4b38123d3654471f0868774c5ff877d"><div class="ttname"><a href="classoperations__research_1_1_knapsack_propagator.html#af4b38123d3654471f0868774c5ff877d">operations_research::KnapsackPropagator::Update</a></div><div class="ttdeci">bool Update(bool revert, const KnapsackAssignment &assignment)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00184">knapsack_solver.cc:184</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_search_node_html"><div class="ttname"><a href="classoperations__research_1_1_knapsack_search_node.html">operations_research::KnapsackSearchNode</a></div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00331">knapsack_solver.h:331</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_search_node_html_a388481288bf0c9bdc7e3583217150962"><div class="ttname"><a href="classoperations__research_1_1_knapsack_search_node.html#a388481288bf0c9bdc7e3583217150962">operations_research::KnapsackSearchNode::set_current_profit</a></div><div class="ttdeci">void set_current_profit(int64 profit)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00340">knapsack_solver.h:340</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_search_node_html_a6fdd73f8011695b97659f2bea29325cb"><div class="ttname"><a href="classoperations__research_1_1_knapsack_search_node.html#a6fdd73f8011695b97659f2bea29325cb">operations_research::KnapsackSearchNode::depth</a></div><div class="ttdeci">int depth() const</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00335">knapsack_solver.h:335</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_search_node_html_a9962698a737cd21789c77ff32bef0d98"><div class="ttname"><a href="classoperations__research_1_1_knapsack_search_node.html#a9962698a737cd21789c77ff32bef0d98">operations_research::KnapsackSearchNode::set_next_item_id</a></div><div class="ttdeci">void set_next_item_id(int id)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00346">knapsack_solver.h:346</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_search_node_html_ab7f8c7e53d1f8f72cb6b1a2bffae2407"><div class="ttname"><a href="classoperations__research_1_1_knapsack_search_node.html#ab7f8c7e53d1f8f72cb6b1a2bffae2407">operations_research::KnapsackSearchNode::set_profit_upper_bound</a></div><div class="ttdeci">void set_profit_upper_bound(int64 profit)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00343">knapsack_solver.h:343</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_search_node_html_ad17e46a2afcf393a4ec9159162c969f2"><div class="ttname"><a href="classoperations__research_1_1_knapsack_search_node.html#ad17e46a2afcf393a4ec9159162c969f2">operations_research::KnapsackSearchNode::KnapsackSearchNode</a></div><div class="ttdeci">KnapsackSearchNode(const KnapsackSearchNode *const parent, const KnapsackAssignment &assignment)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00101">knapsack_solver.cc:101</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_search_node_html_afe9938cf4bbeb06ed8985c37646433fd"><div class="ttname"><a href="classoperations__research_1_1_knapsack_search_node.html#afe9938cf4bbeb06ed8985c37646433fd">operations_research::KnapsackSearchNode::parent</a></div><div class="ttdeci">const KnapsackSearchNode *const parent() const</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00336">knapsack_solver.h:336</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_search_path_html"><div class="ttname"><a href="classoperations__research_1_1_knapsack_search_path.html">operations_research::KnapsackSearchPath</a></div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00385">knapsack_solver.h:385</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_search_path_html_a09f219a2226f7c0de0f50b6f00c099e3"><div class="ttname"><a href="classoperations__research_1_1_knapsack_search_path.html#a09f219a2226f7c0de0f50b6f00c099e3">operations_research::KnapsackSearchPath::MoveUpToDepth</a></div><div class="ttdeci">const KnapsackSearchNode * MoveUpToDepth(const KnapsackSearchNode &node, int depth) const</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00128">knapsack_solver.cc:128</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_search_path_html_a1e3b6d38df0786ccf7f938d60e386aae"><div class="ttname"><a href="classoperations__research_1_1_knapsack_search_path.html#a1e3b6d38df0786ccf7f938d60e386aae">operations_research::KnapsackSearchPath::Init</a></div><div class="ttdeci">void Init()</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00115">knapsack_solver.cc:115</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_search_path_html_a3dc3602e1a640bc986956e0ce5e88d04"><div class="ttname"><a href="classoperations__research_1_1_knapsack_search_path.html#a3dc3602e1a640bc986956e0ce5e88d04">operations_research::KnapsackSearchPath::KnapsackSearchPath</a></div><div class="ttdeci">KnapsackSearchPath(const KnapsackSearchNode &from, const KnapsackSearchNode &to)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00111">knapsack_solver.cc:111</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_html"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver.html">operations_research::KnapsackSolver</a></div><div class="ttdoc">This library solves knapsack problems.</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00117">knapsack_solver.h:117</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_html_a57d88f584d14b161580550918c8fbf3b"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver.html#a57d88f584d14b161580550918c8fbf3b">operations_research::KnapsackSolver::BestSolutionContains</a></div><div class="ttdeci">bool BestSolutionContains(int item_id) const</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="knapsack__solver_8cc_source.html#l01361">knapsack_solver.cc:1361</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_html_a666eb21bb3912d9500caf2c63f5bcefb"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver.html#a666eb21bb3912d9500caf2c63f5bcefb">operations_research::KnapsackSolver::Solve</a></div><div class="ttdeci">int64 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="knapsack__solver_8cc_source.html#l01354">knapsack_solver.cc:1354</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_html_a6b46c35c8977efde66ae7ad97423bdf2"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver.html#a6b46c35c8977efde66ae7ad97423bdf2">operations_research::KnapsackSolver::KnapsackSolver</a></div><div class="ttdeci">KnapsackSolver(const std::string &solver_name)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l01119">knapsack_solver.cc:1119</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_html_a89892382a4f8fa0a4baeb4a3451b8b32"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver.html#a89892382a4f8fa0a4baeb4a3451b8b32">operations_research::KnapsackSolver::Init</a></div><div class="ttdeci">void Init(const std::vector< int64 > &profits, const std::vector< std::vector< int64 > > &weights, const std::vector< int64 > &capacities)</div><div class="ttdoc">Initializes the solver and enters the problem to be solved.</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l01178">knapsack_solver.cc:1178</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_html_a8b06041d7c1fb05f379714f4312306ec"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306ec">operations_research::KnapsackSolver::SolverType</a></div><div class="ttdeci">SolverType</div><div class="ttdoc">Enum controlling which underlying algorithm is used.</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00124">knapsack_solver.h:124</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_html_a8b06041d7c1fb05f379714f4312306eca1f4e1e2f80ab9c7d4fc1b14d9f5da959"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306eca1f4e1e2f80ab9c7d4fc1b14d9f5da959">operations_research::KnapsackSolver::KNAPSACK_MULTIDIMENSION_SCIP_MIP_SOLVER</a></div><div class="ttdeci">@ KNAPSACK_MULTIDIMENSION_SCIP_MIP_SOLVER</div><div class="ttdoc">SCIP based solver.</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00171">knapsack_solver.h:171</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_html_a8b06041d7c1fb05f379714f4312306eca2a4e77eec4f386d17001e7285e812a0b"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306eca2a4e77eec4f386d17001e7285e812a0b">operations_research::KnapsackSolver::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="knapsack__solver_8h_source.html#l00163">knapsack_solver.h:163</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_html_a8b06041d7c1fb05f379714f4312306eca793d998526508cfcc2bfc89fe25b3edd"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306eca793d998526508cfcc2bfc89fe25b3edd">operations_research::KnapsackSolver::KNAPSACK_DYNAMIC_PROGRAMMING_SOLVER</a></div><div class="ttdeci">@ KNAPSACK_DYNAMIC_PROGRAMMING_SOLVER</div><div class="ttdoc">Dynamic Programming approach for single dimension problems.</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00147">knapsack_solver.h:147</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_html_a8b06041d7c1fb05f379714f4312306ecaa020f211a1ff184e712aa4f372d6ea34"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306ecaa020f211a1ff184e712aa4f372d6ea34">operations_research::KnapsackSolver::KNAPSACK_64ITEMS_SOLVER</a></div><div class="ttdeci">@ KNAPSACK_64ITEMS_SOLVER</div><div class="ttdoc">Optimized method for single dimension small problems.</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00139">knapsack_solver.h:139</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_html_a8b06041d7c1fb05f379714f4312306ecac43056d6d2f96cee37fcb8a752b0ff45"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306ecac43056d6d2f96cee37fcb8a752b0ff45">operations_research::KnapsackSolver::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="knapsack__solver_8h_source.html#l00131">knapsack_solver.h:131</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_html_a8b06041d7c1fb05f379714f4312306ecae2ce6e36a247621de398e875d5feb575"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306ecae2ce6e36a247621de398e875d5feb575">operations_research::KnapsackSolver::KNAPSACK_MULTIDIMENSION_CBC_MIP_SOLVER</a></div><div class="ttdeci">@ KNAPSACK_MULTIDIMENSION_CBC_MIP_SOLVER</div><div class="ttdoc">CBC Based Solver.</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00155">knapsack_solver.h:155</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_html_a9a98946a64f3893b085f650932c9dfee"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver.html#a9a98946a64f3893b085f650932c9dfee">operations_research::KnapsackSolver::GetName</a></div><div class="ttdeci">std::string GetName() const</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l01369">knapsack_solver.cc:1369</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_html_abb19dddb08cf912baec8995cfd2f1f42"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver.html#abb19dddb08cf912baec8995cfd2f1f42">operations_research::KnapsackSolver::~KnapsackSolver</a></div><div class="ttdeci">virtual ~KnapsackSolver()</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l01176">knapsack_solver.cc:1176</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_state_html"><div class="ttname"><a href="classoperations__research_1_1_knapsack_state.html">operations_research::KnapsackState</a></div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00406">knapsack_solver.h:406</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_state_html_a41f9430cc0090383e7797a88c1dbacbc"><div class="ttname"><a href="classoperations__research_1_1_knapsack_state.html#a41f9430cc0090383e7797a88c1dbacbc">operations_research::KnapsackState::KnapsackState</a></div><div class="ttdeci">KnapsackState()</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00138">knapsack_solver.cc:138</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_state_html_a6308c7a97200f84f6ebf5b2c487b0362"><div class="ttname"><a href="classoperations__research_1_1_knapsack_state.html#a6308c7a97200f84f6ebf5b2c487b0362">operations_research::KnapsackState::Init</a></div><div class="ttdeci">void Init(int number_of_items)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00140">knapsack_solver.cc:140</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_state_html_a862bf4e908cd82ea44f72e98558016ad"><div class="ttname"><a href="classoperations__research_1_1_knapsack_state.html#a862bf4e908cd82ea44f72e98558016ad">operations_research::KnapsackState::is_in</a></div><div class="ttdeci">bool is_in(int id) const</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00419">knapsack_solver.h:419</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_state_html_a89aa280d2321c1316aa1305106f1bb49"><div class="ttname"><a href="classoperations__research_1_1_knapsack_state.html#a89aa280d2321c1316aa1305106f1bb49">operations_research::KnapsackState::is_bound</a></div><div class="ttdeci">bool is_bound(int id) const</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00418">knapsack_solver.h:418</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_knapsack_state_html_ab771ac0e538f991b73b011ee3ba11f05"><div class="ttname"><a href="classoperations__research_1_1_knapsack_state.html#ab771ac0e538f991b73b011ee3ba11f05">operations_research::KnapsackState::UpdateState</a></div><div class="ttdeci">bool UpdateState(bool revert, const KnapsackAssignment &assignment)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00146">knapsack_solver.cc:146</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_constraint_html"><div class="ttname"><a href="classoperations__research_1_1_m_p_constraint.html">operations_research::MPConstraint</a></div><div class="ttdoc">The class for constraints of a Mathematical Programming (MP) model.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8h_source.html#l01177">linear_solver.h:1177</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_objective_html"><div class="ttname"><a href="classoperations__research_1_1_m_p_objective.html">operations_research::MPObjective</a></div><div class="ttdoc">A class to express a linear objective.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8h_source.html#l00925">linear_solver.h:925</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_objective_html_a2def997791a2a5119c3502aa68c34181"><div class="ttname"><a href="classoperations__research_1_1_m_p_objective.html#a2def997791a2a5119c3502aa68c34181">operations_research::MPObjective::SetCoefficient</a></div><div class="ttdeci">void SetCoefficient(const MPVariable *const var, double coeff)</div><div class="ttdoc">Sets the coefficient of the variable in the objective.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8cc_source.html#l00177">linear_solver.cc:177</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_objective_html_a8554e97d98d05016f16300cedf2be9f6"><div class="ttname"><a href="classoperations__research_1_1_m_p_objective.html#a8554e97d98d05016f16300cedf2be9f6">operations_research::MPObjective::Value</a></div><div class="ttdeci">double Value() const</div><div class="ttdoc">Returns the objective value of the best solution found so far.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8cc_source.html#l00249">linear_solver.cc:249</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_objective_html_ac187b2ba08422f3a06b8d1e1502ceea6"><div class="ttname"><a href="classoperations__research_1_1_m_p_objective.html#ac187b2ba08422f3a06b8d1e1502ceea6">operations_research::MPObjective::SetMinimization</a></div><div class="ttdeci">void SetMinimization()</div><div class="ttdoc">Sets the optimization direction to minimize.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8h_source.html#l00985">linear_solver.h:985</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_solver_html"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html">operations_research::MPSolver</a></div><div class="ttdoc">This mathematical programming (MP) solver class is the main class though which users build and solve ...</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8h_source.html#l00179">linear_solver.h:179</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_solver_html_a200ccd114eb5057856c05501c2d4abe5"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#a200ccd114eb5057856c05501c2d4abe5">operations_research::MPSolver::MakeBoolVarArray</a></div><div class="ttdeci">void MakeBoolVarArray(int nb, const std::string &name, std::vector< MPVariable * > *vars)</div><div class="ttdoc">Creates an array of boolean variables.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8cc_source.html#l01143">linear_solver.cc:1143</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_solver_html_a226456dfb15300dd4e59d0bf80d0ce07"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#a226456dfb15300dd4e59d0bf80d0ce07">operations_research::MPSolver::MutableObjective</a></div><div class="ttdeci">MPObjective * MutableObjective()</div><div class="ttdoc">Returns the mutable objective object.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8h_source.html#l00419">linear_solver.h:419</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_solver_html_a43d6ca2f978ca6f622a16117166ff69a"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#a43d6ca2f978ca6f622a16117166ff69a">operations_research::MPSolver::MakeRowConstraint</a></div><div class="ttdeci">MPConstraint * MakeRowConstraint(double lb, double ub)</div><div class="ttdoc">Creates a linear constraint with given bounds.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8cc_source.html#l01148">linear_solver.cc:1148</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_solver_html_a76c87990aabadd148304b95332a60ff8"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8">operations_research::MPSolver::OptimizationProblemType</a></div><div class="ttdeci">OptimizationProblemType</div><div class="ttdoc">The type of problems (LP or MIP) that will be solved and the underlying solver (GLOP,...</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8h_source.html#l00187">linear_solver.h:187</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_solver_html_a76c87990aabadd148304b95332a60ff8a223fb1b5c8d153d5fef50b8d6f0426e9"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8a223fb1b5c8d153d5fef50b8d6f0426e9">operations_research::MPSolver::CPLEX_MIXED_INTEGER_PROGRAMMING</a></div><div class="ttdeci">@ CPLEX_MIXED_INTEGER_PROGRAMMING</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8h_source.html#l00204">linear_solver.h:204</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_solver_html_a76c87990aabadd148304b95332a60ff8a5a62faa5ec0ffed2abbc2d526bd53286"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8a5a62faa5ec0ffed2abbc2d526bd53286">operations_research::MPSolver::XPRESS_MIXED_INTEGER_PROGRAMMING</a></div><div class="ttdeci">@ XPRESS_MIXED_INTEGER_PROGRAMMING</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8h_source.html#l00206">linear_solver.h:206</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_solver_html_a76c87990aabadd148304b95332a60ff8a83b85675904f261c34c280b2abdcd9ae"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8a83b85675904f261c34c280b2abdcd9ae">operations_research::MPSolver::SCIP_MIXED_INTEGER_PROGRAMMING</a></div><div class="ttdeci">@ SCIP_MIXED_INTEGER_PROGRAMMING</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8h_source.html#l00196">linear_solver.h:196</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_solver_html_a76c87990aabadd148304b95332a60ff8ad183dc62c63346a3b984b93fbda0137a"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8ad183dc62c63346a3b984b93fbda0137a">operations_research::MPSolver::CBC_MIXED_INTEGER_PROGRAMMING</a></div><div class="ttdeci">@ CBC_MIXED_INTEGER_PROGRAMMING</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8h_source.html#l00198">linear_solver.h:198</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_solver_html_acede9075c58cb2f506c99a9fe6f20303"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#acede9075c58cb2f506c99a9fe6f20303">operations_research::MPSolver::Solve</a></div><div class="ttdeci">ResultStatus Solve()</div><div class="ttdoc">Solves the problem using the default parameter values.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8cc_source.html#l01225">linear_solver.cc:1225</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_solver_html_ae1df08a9aabad59b5d620930126e6d91"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#ae1df08a9aabad59b5d620930126e6d91">operations_research::MPSolver::SuppressOutput</a></div><div class="ttdeci">void SuppressOutput()</div><div class="ttdoc">Suppresses solver logging.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8cc_source.html#l01504">linear_solver.cc:1504</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html">operations_research::TimeLimit</a></div><div class="ttdoc">A simple class to enforce both an elapsed time limit and a deterministic time limit in the same threa...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00105">time_limit.h:105</a></div></div>
|
|
<div class="ttc" id="acp__model__solver_8cc_html_ac3cf9db02b23ea1455b5ae6955d03e47"><div class="ttname"><a href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a></div><div class="ttdeci">SharedTimeLimit * time_limit</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02106">cp_model_solver.cc:2106</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695"><div class="ttname"><a href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a></div><div class="ttdeci">const Constraint * ct</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00042">demon_profiler.cc:42</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a21edc7ca4cc5802c8779d68556bc09cf"><div class="ttname"><a href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a></div><div class="ttdeci">int64 value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a1134b580f8da4de94ca6b1de4d37975e"><div class="ttname"><a href="integral__types_8h.html#a1134b580f8da4de94ca6b1de4d37975e">uint32</a></div><div class="ttdeci">unsigned int uint32</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00038">integral_types.h:38</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a74ea76ea27f48fb1b6e148e1577b3719"><div class="ttname"><a href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a></div><div class="ttdeci">static const int64 kint64max</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00062">integral_types.h:62</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_abc0f5bc07737e498f287334775dff2b6"><div class="ttname"><a href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a></div><div class="ttdeci">uint64_t uint64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00039">integral_types.h:39</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_af458164b470cbba416d5ed579e00ff60"><div class="ttname"><a href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a></div><div class="ttdeci">static const int64 kint64min</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00060">integral_types.h:60</a></div></div>
|
|
<div class="ttc" id="aknapsack__solver_8cc_html_a6f2f9756946f8553d52c633b7acb44f3"><div class="ttname"><a href="knapsack__solver_8cc.html#a6f2f9756946f8553d52c633b7acb44f3">profit_max</a></div><div class="ttdeci">const int64 profit_max</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00044">knapsack_solver.cc:44</a></div></div>
|
|
<div class="ttc" id="aknapsack__solver_8h_html"><div class="ttname"><a href="knapsack__solver_8h.html">knapsack_solver.h</a></div></div>
|
|
<div class="ttc" id="alinear__solver_8cc_html_acdf66e64954cbe33c30a45395b4d74b6"><div class="ttname"><a href="linear__solver_8cc.html#acdf66e64954cbe33c30a45395b4d74b6">problem_type</a></div><div class="ttdeci">MPSolver::OptimizationProblemType problem_type</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8cc_source.html#l00503">linear_solver.cc:503</a></div></div>
|
|
<div class="ttc" id="alinear__solver_8h_html"><div class="ttname"><a href="linear__solver_8h.html">linear_solver.h</a></div><div class="ttdoc">A C++ wrapper that provides a simple and unified interface to several linear programming and mixed in...</div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_acdd38e3c9f22f127d7776920e3079eda"><div class="ttname"><a href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a></div><div class="ttdeci">const int FATAL</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00032">log_severity.h:32</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a4ee3db0c4acaa0f277a0d7006f5ad1e6"><div class="ttname"><a href="namespacegtl.html#a4ee3db0c4acaa0f277a0d7006f5ad1e6">gtl::STLDeleteElements</a></div><div class="ttdeci">void STLDeleteElements(T *container)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00372">stl_util.h:372</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a2f9ef253c023106392eb1495a277616b"><div class="ttname"><a href="namespaceoperations__research.html#a2f9ef253c023106392eb1495a277616b">operations_research::MostSignificantBitPosition64</a></div><div class="ttdeci">int MostSignificantBitPosition64(uint64 n)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00231">bitset.h:231</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a627ab892a9c19c32b05c8f118e7660e0"><div class="ttname"><a href="namespaceoperations__research.html#a627ab892a9c19c32b05c8f118e7660e0">operations_research::CompareKnapsackItemWithEfficiencyInDecreasingEfficiencyOrder</a></div><div class="ttdeci">bool CompareKnapsackItemWithEfficiencyInDecreasingEfficiencyOrder(const KnapsackItemWithEfficiency &item1, const KnapsackItemWithEfficiency &item2)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00717">knapsack_solver.cc:717</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ac258cd47a0ecede02fda32d46ca2b9de"><div class="ttname"><a href="namespaceoperations__research.html#ac258cd47a0ecede02fda32d46ca2b9de">operations_research::OneBit32</a></div><div class="ttdeci">uint32 OneBit32(int pos)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00039">bitset.h:39</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ada7d9b46f657c6053a197273a85043a7"><div class="ttname"><a href="namespaceoperations__research.html#ada7d9b46f657c6053a197273a85043a7">operations_research::KnapsackItemPtr</a></div><div class="ttdeci">KnapsackItem * KnapsackItemPtr</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00321">knapsack_solver.h:321</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aebb30ce0aaac158bab53d6d5a17e6ac2"><div class="ttname"><a href="namespaceoperations__research.html#aebb30ce0aaac158bab53d6d5a17e6ac2">operations_research::OneBit64</a></div><div class="ttdeci">uint64 OneBit64(int pos)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00038">bitset.h:38</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_ae42ca38a167164c07831993889216903"><div class="ttname"><a href="pack_8cc.html#ae42ca38a167164c07831993889216903">weight</a></div><div class="ttdeci">int64 weight</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00509">pack.cc:509</a></div></div>
|
|
<div class="ttc" id="arevised__simplex_8cc_html_af01c50e388647c921aa7d9c77f2b72b2"><div class="ttname"><a href="revised__simplex_8cc.html#af01c50e388647c921aa7d9c77f2b72b2">ratio</a></div><div class="ttdeci">Fractional ratio</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l01815">revised_simplex.cc:1815</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_adf3be22c64f10c0783c0cf277e857adf"><div class="ttname"><a href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a></div><div class="ttdeci">int64 capacity</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00129">routing_flow.cc:129</a></div></div>
|
|
<div class="ttc" id="astl__util_8h_html"><div class="ttname"><a href="stl__util_8h.html">stl_util.h</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_knapsack_assignment_html"><div class="ttname"><a href="structoperations__research_1_1_knapsack_assignment.html">operations_research::KnapsackAssignment</a></div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00287">knapsack_solver.h:287</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_knapsack_assignment_html_a1c0c3c835f3c4363b650fba65c7ebf32"><div class="ttname"><a href="structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32">operations_research::KnapsackAssignment::item_id</a></div><div class="ttdeci">int item_id</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00290">knapsack_solver.h:290</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_knapsack_assignment_html_a922620900c7a18d22de686d47e25d4ed"><div class="ttname"><a href="structoperations__research_1_1_knapsack_assignment.html#a922620900c7a18d22de686d47e25d4ed">operations_research::KnapsackAssignment::is_in</a></div><div class="ttdeci">bool is_in</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00291">knapsack_solver.h:291</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_knapsack_item_html"><div class="ttname"><a href="structoperations__research_1_1_knapsack_item.html">operations_research::KnapsackItem</a></div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00306">knapsack_solver.h:306</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_knapsack_item_html_a64ae40793ade89d800a8c5646d2980fc"><div class="ttname"><a href="structoperations__research_1_1_knapsack_item.html#a64ae40793ade89d800a8c5646d2980fc">operations_research::KnapsackItem::id</a></div><div class="ttdeci">const int id</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00317">knapsack_solver.h:317</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_knapsack_item_html_a7a9c8a0c92aa590e21fcb9006e4dc004"><div class="ttname"><a href="structoperations__research_1_1_knapsack_item.html#a7a9c8a0c92aa590e21fcb9006e4dc004">operations_research::KnapsackItem::profit</a></div><div class="ttdeci">const int64 profit</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00319">knapsack_solver.h:319</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_knapsack_item_html_a965717cd1b82709b7fc2d04aa3f8796d"><div class="ttname"><a href="structoperations__research_1_1_knapsack_item.html#a965717cd1b82709b7fc2d04aa3f8796d">operations_research::KnapsackItem::weight</a></div><div class="ttdeci">const int64 weight</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8h_source.html#l00318">knapsack_solver.h:318</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_knapsack_item_with_efficiency_html"><div class="ttname"><a href="structoperations__research_1_1_knapsack_item_with_efficiency.html">operations_research::KnapsackItemWithEfficiency</a></div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00654">knapsack_solver.cc:654</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_knapsack_item_with_efficiency_html_a036eb5930698269322fab01797c24255"><div class="ttname"><a href="structoperations__research_1_1_knapsack_item_with_efficiency.html#a036eb5930698269322fab01797c24255">operations_research::KnapsackItemWithEfficiency::efficiency</a></div><div class="ttdeci">double efficiency</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00667">knapsack_solver.cc:667</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_knapsack_item_with_efficiency_html_a7441ef0865bcb3db9b8064dd7375c1ea"><div class="ttname"><a href="structoperations__research_1_1_knapsack_item_with_efficiency.html#a7441ef0865bcb3db9b8064dd7375c1ea">operations_research::KnapsackItemWithEfficiency::id</a></div><div class="ttdeci">int id</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00664">knapsack_solver.cc:664</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_knapsack_item_with_efficiency_html_adcadf13719705572b332bccdaab51993"><div class="ttname"><a href="structoperations__research_1_1_knapsack_item_with_efficiency.html#adcadf13719705572b332bccdaab51993">operations_research::KnapsackItemWithEfficiency::profit</a></div><div class="ttdeci">int64 profit</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00665">knapsack_solver.cc:665</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_knapsack_item_with_efficiency_html_ae42ca38a167164c07831993889216903"><div class="ttname"><a href="structoperations__research_1_1_knapsack_item_with_efficiency.html#ae42ca38a167164c07831993889216903">operations_research::KnapsackItemWithEfficiency::weight</a></div><div class="ttdeci">int64 weight</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00666">knapsack_solver.cc:666</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_knapsack_item_with_efficiency_html_af49bb942c0b8f1303541fabeb9829e69"><div class="ttname"><a href="structoperations__research_1_1_knapsack_item_with_efficiency.html#af49bb942c0b8f1303541fabeb9829e69">operations_research::KnapsackItemWithEfficiency::KnapsackItemWithEfficiency</a></div><div class="ttdeci">KnapsackItemWithEfficiency(int _id, int64 _profit, int64 _weight, int64 _profit_max)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver_8cc_source.html#l00655">knapsack_solver.cc:655</a></div></div>
|
|
<div class="ttc" id="atime__limit_8h_html"><div class="ttname"><a href="time__limit_8h.html">time_limit.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_80dda7a75b0dfcf996988638a63eb03a.html">algorithms</a></li><li class="navelem"><a class="el" href="knapsack__solver_8cc.html">knapsack_solver.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|