always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
a3ef28e824ee84a948796dffbb8254e67714cb56
ortools-clone/docs/cpp/encoding_8h_source.html
Mizux Seiha 3b81c981c2 Update doc
2022-03-04 00:19:15 +01:00

405 lines
79 KiB
HTML
Raw Blame History

<!-- 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.3"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>OR-Tools: encoding.h 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
&#160;<span id="projectnumber">9.3</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.3 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search",'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:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(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:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('encoding_8h_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">encoding.h</div></div>
</div><!--header-->
<div class="contents">
<a href="encoding_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the &quot;License&quot;);</span></div>
<div class="line"><a id="l00003" 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 id="l00004" 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 id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
<div class="line"><a id="l00006" 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 id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
<div class="line"><a id="l00008" 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 id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an &quot;AS IS&quot; BASIS,</span></div>
<div class="line"><a id="l00010" 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 id="l00011" 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 id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="comment">// Algorithms to encode constraints into their SAT representation. Currently,</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="comment">// this contains one possible encoding of a cardinality constraint as used by</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="comment">// the core-based optimization algorithm in optimization.h.</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="comment">//</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="comment">// This is also known as the incremental totalizer encoding in the literature.</span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span> </div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#ifndef OR_TOOLS_SAT_ENCODING_H_</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#define OR_TOOLS_SAT_ENCODING_H_</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span> </div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include &lt;deque&gt;</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include &lt;string&gt;</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> </div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include &quot;<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>&quot;</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include &quot;<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>&quot;</span></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include &quot;<a class="code" href="macros_8h.html">ortools/base/macros.h</a>&quot;</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include &quot;ortools/sat/boolean_problem.pb.h&quot;</span></div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="preprocessor">#include &quot;<a class="code" href="pb__constraint_8h.html">ortools/sat/pb_constraint.h</a>&quot;</span></div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="preprocessor">#include &quot;<a class="code" href="sat__base_8h.html">ortools/sat/sat_base.h</a>&quot;</span></div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="preprocessor">#include &quot;<a class="code" href="sat__solver_8h.html">ortools/sat/sat_solver.h</a>&quot;</span></div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="preprocessor">#include &quot;<a class="code" href="strong__integers_8h.html">ortools/util/strong_integers.h</a>&quot;</span></div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> </div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="keyword">namespace </span>sat {</div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> </div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="comment">// This class represents a number in [0, ub]. The encoding uses ub binary</span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="comment">// variables x_i with i in [0, ub) where x_i means that the number is &gt; i. It is</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="comment">// called an EncodingNode, because it represents one node of the tree used to</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="comment">// encode a cardinality constraint.</span></div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="comment">//</span></div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="comment">// In practice, not all literals are explicitly created:</span></div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="comment">// - Only the literals in [lb, current_ub) are &quot;active&quot; at a given time.</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span><span class="comment">// - The represented number is known to be &gt;= lb.</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span><span class="comment">// - It may be greater than current_ub, but the extra literals will be only</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span><span class="comment">// created lazily. In all our solves, the literal current_ub - 1, will always</span></div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span><span class="comment">// be assumed to false (i.e. the number will be &lt;= current_ub - 1).</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span><span class="comment">// - Note that lb may increase and ub decrease as more information is learned</span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span><span class="comment">// about this node by the sat solver.</span></div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="comment">//</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span><span class="comment">// This is roughly based on the cardinality constraint encoding described in:</span></div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span><span class="comment">// Bailleux and Yacine Boufkhad, &quot;Efficient CNF Encoding of Boolean Cardinality</span></div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span><span class="comment">// Constraints&quot;, In Proc. of CP 2003, pages 108-122, 2003.</span></div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html"> 57</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a> {</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="keyword">public</span>:</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#afcc0ba7af448641ff70c751416efb4ae"> 59</a></span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#afcc0ba7af448641ff70c751416efb4ae">EncodingNode</a>() {}</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> </div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// Constructs a EncodingNode of size one, just formed by the given literal.</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keyword">explicit</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#afcc0ba7af448641ff70c751416efb4ae">EncodingNode</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l);</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> </div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="comment">// Creates a &quot;full&quot; encoding node on n new variables, the represented number</span></div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="comment">// beeing in [lb, ub = lb + n). The variables are added to the given solver</span></div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="comment">// with the basic implications linking them:</span></div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="comment">// literal(0) &gt;= ... &gt;= literal(n-1)</span></div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a6e81565ea8f030c21126024751b8d4be">InitializeFullNode</a>(<span class="keywordtype">int</span> n, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>,</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver);</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> </div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="comment">// Creates a &quot;lazy&quot; encoding node representing the sum of a and b.</span></div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// Only one literals will be created by this operation. Note that no clauses</span></div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="comment">// linking it with a or b are added by this function.</span></div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a6bea440eb7f63954ecf88b597d182ecb">InitializeLazyNode</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver);</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a1a774190f5acacd461d1bf75be1f8af7">InitializeLazyCoreNode</a>(<a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a7f57c0d3f4a1efca82d8c0721556b9d7">weight</a>, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>,</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> </div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="comment">// Returns a literal with the meaning &#39;this node number is &gt; i&#39;.</span></div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="comment">// The given i must be in [lb_, current_ub).</span></div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#ad43b46262f3e4103bd59aae627925fdf"> 80</a></span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#ad43b46262f3e4103bd59aae627925fdf">GreaterThan</a>(<span class="keywordtype">int</span> i)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">literal</a>(i - lb_); }</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> </div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// Accessors to size() and literals in [lb, current_ub).</span></div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#af9593d4a5ff4274efaf429cb4f9e57cc"> 83</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#af9593d4a5ff4274efaf429cb4f9e57cc">size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> literals_.size(); }</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198"> 84</a></span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">literal</a>(<span class="keywordtype">int</span> i)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(i, 0);</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(i, literals_.size());</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="keywordflow">return</span> literals_[i];</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> }</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> </div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// Sort by decreasing depth first and then by increasing variable index.</span></div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="comment">// This is meant to be used by the priority queue in MergeAllNodesWithPQ().</span></div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#afcf37f1f013451c059ca2074be226078"> 92</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#afcf37f1f013451c059ca2074be226078">operator&lt;</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>&amp; other)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keywordflow">return</span> depth_ &gt; other.depth_ ||</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> (depth_ == other.depth_ &amp;&amp; other.for_sorting_ &gt; for_sorting_);</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> }</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> </div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// Creates a new literals and increases current_ub.</span></div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="comment">// Returns false if we were already at the upper bound for this node.</span></div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a29f3df8e348017bbeaab35d77a4b3fa8">IncreaseCurrentUB</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver);</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> </div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="comment">// Removes the left-side literals fixed to 1. Note that this increases lb_ and</span></div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="comment">// reduces the number of active literals. It also removes any right-side</span></div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// literals fixed to 0. If such a literal exists, ub is updated accordingly.</span></div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="comment">//</span></div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="comment">// Return the overall weight increase.</span></div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a3ca866781a37374b8defaed83b57d602">Reduce</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>&amp; solver);</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> </div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="comment">// GetAssumption() might need to create new literals.</span></div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a2666f50fdfaf51c1d78daf2256aacfa5">GetAssumption</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver);</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a28af91866016be797ebb710a9b0479ff">HasNoWeight</a>() <span class="keyword">const</span>;</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a345efb9c8f2a5a6fa4786ed9e25b9208">IncreaseWeightLb</a>();</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> </div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="comment">// Fix any literal that would cause the weight of this node to go over the</span></div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// gap.</span></div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a2e40079f184eb47ba002820b1c8d7814">ApplyWeightUpperBound</a>(<a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> gap, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver);</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> </div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#ac92f797a3120e43647b75cc41aa9033e"> 117</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#ac92f797a3120e43647b75cc41aa9033e">set_weight</a>(<a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> w) {</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> weight_lb_ = lb_;</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> weight_ = w;</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> }</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a7f57c0d3f4a1efca82d8c0721556b9d7"> 121</a></span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a7f57c0d3f4a1efca82d8c0721556b9d7">weight</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> weight_; }</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> </div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="comment">// The depth is mainly used as an heuristic to decide which nodes to merge</span></div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="comment">// first. See the &lt; operator.</span></div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#ad9823fa53cc58fc4444d3b2eaadb885c"> 125</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#ad9823fa53cc58fc4444d3b2eaadb885c">set_depth</a>(<span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a6fdd73f8011695b97659f2bea29325cb">depth</a>) { depth_ = <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a6fdd73f8011695b97659f2bea29325cb">depth</a>; }</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a6fdd73f8011695b97659f2bea29325cb"> 126</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a6fdd73f8011695b97659f2bea29325cb">depth</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> depth_; }</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> </div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a42fc122b08d9872df0fe327946356be9"> 128</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a42fc122b08d9872df0fe327946356be9">lb</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> lb_; }</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a4101c336fb4c5135ceef3ab532d755cd"> 129</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a4101c336fb4c5135ceef3ab532d755cd">current_ub</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> lb_ + literals_.size(); }</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a45469cb8257ad81b6b29393836a4ac5b"> 130</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a45469cb8257ad81b6b29393836a4ac5b">ub</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> ub_; }</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#ab4a971df4b55922bdbff74843db10dd1"> 131</a></span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#ab4a971df4b55922bdbff74843db10dd1">child_a</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> child_a_; }</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_encoding_node.html#a4534d0c2b93a62ca6b7b08ec4c8a1365"> 132</a></span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a4534d0c2b93a62ca6b7b08ec4c8a1365">child_b</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> child_b_; }</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> </div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="comment">// We use the solver to display the current values of the literals.</span></div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> std::string <a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a903b410531434c46abc6516983c6d4d0">DebugString</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_variables_assignment.html">VariablesAssignment</a>&amp; assignment) <span class="keyword">const</span>;</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> </div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keyword">private</span>:</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="keywordtype">int</span> depth_ = 0;</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="keywordtype">int</span> lb_ = 0;</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keywordtype">int</span> ub_ = 1;</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> BooleanVariable for_sorting_;</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> </div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="comment">// The weight is only applies for literal &gt;= this lb.</span></div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="keywordtype">int</span> weight_lb_ = 0;</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> </div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> weight_;</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* child_a_;</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* child_b_;</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> </div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// The literals of this node in order.</span></div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> std::vector&lt;Literal&gt; literals_;</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span>};</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> </div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span><span class="comment">// Merges the two given EncodingNodes by creating a new node that corresponds to</span></div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span><span class="comment">// the sum of the two given ones. Only the left-most binary variable is created</span></div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span><span class="comment">// for the parent node, the other ones will be created later when needed.</span></div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span>EncodingNode <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a99e372550892ddd117f7a23e4fd73518">LazyMerge</a>(EncodingNode* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, EncodingNode* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, SatSolver* solver);</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> </div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span><span class="comment">// Increases the size of the given node by one. To keep all the needed relations</span></div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span><span class="comment">// with its children, we also need to increase their size by one, and so on</span></div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span><span class="comment">// recursively. Also adds all the necessary clauses linking the newly added</span></div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span><span class="comment">// literals.</span></div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a6af701ea48c91ef8a59a67b5b8d355c2">IncreaseNodeSize</a>(EncodingNode* node, SatSolver* solver);</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> </div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span><span class="comment">// Merges the two given EncodingNode by creating a new node that corresponds to</span></div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span><span class="comment">// the sum of the two given ones. The given upper_bound is interpreted as a</span></div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span><span class="comment">// bound on this sum, and allows creating fewer binary variables.</span></div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span>EncodingNode <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aa357501e62925d41514301a6fd211c3e">FullMerge</a>(<a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, EncodingNode* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>,</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> EncodingNode* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, SatSolver* solver);</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> </div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span><span class="comment">// Merges all the given nodes two by two until there is only one left. Returns</span></div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span><span class="comment">// the final node which encodes the sum of all the given nodes.</span></div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span>EncodingNode* <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a29ff75f2188e0ac1c58fa4b0cf793a00">MergeAllNodesWithDeque</a>(<a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>,</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="keyword">const</span> std::vector&lt;EncodingNode*&gt;&amp; <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>,</div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> SatSolver* solver,</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> std::deque&lt;EncodingNode&gt;* repository);</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> </div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span><span class="comment">// Same as MergeAllNodesWithDeque() but use a priority queue to merge in</span></div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span><span class="comment">// priority nodes with smaller sizes. This also enforce that the sum of nodes</span></div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span><span class="comment">// is greater than its lower bound.</span></div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span>EncodingNode* <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a377e4b11a03d712029888c83b492c1cb">LazyMergeAllNodeWithPQAndIncreaseLb</a>(</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a>, <span class="keyword">const</span> std::vector&lt;EncodingNode*&gt;&amp; <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>,</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> SatSolver* solver, std::deque&lt;EncodingNode&gt;* repository);</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> </div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span><span class="comment">// Returns a vector with one new EncodingNode by variable in the given</span></div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span><span class="comment">// objective. Sets the offset to the negated sum of the negative coefficient,</span></div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span><span class="comment">// because in this case we negate the literals to have only positive</span></div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span><span class="comment">// coefficients.</span></div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span>std::vector&lt;EncodingNode*&gt; <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aea70549adb843d22d06bef763a0960c8">CreateInitialEncodingNodes</a>(</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="keyword">const</span> std::vector&lt;Literal&gt;&amp; literals,</div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="keyword">const</span> std::vector&lt;Coefficient&gt;&amp; coeffs, <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>* offset,</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> std::deque&lt;EncodingNode&gt;* repository);</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span>std::vector&lt;EncodingNode*&gt; <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aea70549adb843d22d06bef763a0960c8">CreateInitialEncodingNodes</a>(</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <span class="keyword">const</span> LinearObjective&amp; objective_proto, <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>* offset,</div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> std::deque&lt;EncodingNode&gt;* repository);</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> </div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span><span class="comment">// Reduces the nodes using the now fixed literals, update the lower-bound, and</span></div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span><span class="comment">// returns the set of assumptions for the next round of the core-based</span></div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span><span class="comment">// algorithm. Returns an empty set of assumptions if everything is fixed.</span></div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span>std::vector&lt;Literal&gt; <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a3c7b9fb850d243d90ea59790db13a676">ReduceNodesAndExtractAssumptions</a>(</div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> stratified_lower_bound,</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>* <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, std::vector&lt;EncodingNode*&gt;* <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>,</div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> SatSolver* solver);</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> </div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span><span class="comment">// Returns the minimum weight of the nodes in the core. Note that the literal in</span></div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span><span class="comment">// the core must appear in the same order as the one in nodes.</span></div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span><a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1c9d74b9b207b6e5513334dd135a00a9">ComputeCoreMinWeight</a>(<span class="keyword">const</span> std::vector&lt;EncodingNode*&gt;&amp; <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>,</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="keyword">const</span> std::vector&lt;Literal&gt;&amp; core);</div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> </div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span><span class="comment">// Returns the maximum node weight under the given upper_bound. Returns zero if</span></div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span><span class="comment">// no such weight exist (note that a node weight is strictly positive, so this</span></div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span><span class="comment">// make sense).</span></div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span><a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ad6c9cfad7e2fa7ae1bbff31720394436">MaxNodeWeightSmallerThan</a>(<span class="keyword">const</span> std::vector&lt;EncodingNode*&gt;&amp; <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>,</div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> </div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span><span class="comment">// Updates the encoding using the given core. The literals in the core must</span></div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span><span class="comment">// match the order in nodes. Returns false if the model become infeasible.</span></div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#accf33b62b1612d7a8abf3014a2df933c">ProcessCore</a>(<span class="keyword">const</span> std::vector&lt;Literal&gt;&amp; core, <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> min_weight,</div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> std::deque&lt;EncodingNode&gt;* repository,</div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> std::vector&lt;EncodingNode*&gt;* <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, SatSolver* solver);</div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> </div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span><span class="comment">// There is more than one way to create new assumptions and encode the</span></div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span><span class="comment">// information from this core. This is slightly different from ProcessCore() and</span></div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span><span class="comment">// follow the algorithm used by many of the top max-SAT solver under the name</span></div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span><span class="comment">// incremental OLL. This is described in:</span></div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span><span class="comment">// António Morgado, Carmine Dodaro, Joao Marques-Silva. &quot;Core-Guided MaxSAT</span></div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span><span class="comment">// with Soft Cardinality Constraints&quot;. CP 2014. pp. 564-573.</span></div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span><span class="comment">// António Morgado, Alexey Ignatiev, Joao Marques-Silva. &quot;MSCG: Robust</span></div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span><span class="comment">// Core-Guided MaxSAT Solving.&quot; JSAT 9. 2014. pp. 129-134.</span></div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span><span class="comment">//</span></div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span><span class="comment">// TODO(user): The last time this was tested, it was however not as good as the</span></div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span><span class="comment">// ProcessCore() version. That might change as we code/change more heuristic, so</span></div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span><span class="comment">// we keep it around.</span></div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ae6a6bf1bcc04b9d64b9d9f4178e34333">ProcessCoreWithAlternativeEncoding</a>(<span class="keyword">const</span> std::vector&lt;Literal&gt;&amp; core,</div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> min_weight,</div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> std::deque&lt;EncodingNode&gt;* repository,</div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> std::vector&lt;EncodingNode*&gt;* <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>,</div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> SatSolver* solver);</div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> </div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span>} <span class="comment">// namespace sat</span></div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span>} <span class="comment">// namespace operations_research</span></div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> </div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_SAT_ENCODING_H_</span></div>
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</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#l00706">base/logging.h:706</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#l00707">base/logging.h:707</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html">operations_research::sat::EncodingNode</a></div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00057">encoding.h:57</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a1a774190f5acacd461d1bf75be1f8af7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a1a774190f5acacd461d1bf75be1f8af7">operations_research::sat::EncodingNode::InitializeLazyCoreNode</a></div><div class="ttdeci">void InitializeLazyCoreNode(Coefficient weight, EncodingNode *a, EncodingNode *b)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00075">encoding.cc:75</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a2666f50fdfaf51c1d78daf2256aacfa5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a2666f50fdfaf51c1d78daf2256aacfa5">operations_research::sat::EncodingNode::GetAssumption</a></div><div class="ttdeci">Literal GetAssumption(SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00134">encoding.cc:134</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a28af91866016be797ebb710a9b0479ff"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a28af91866016be797ebb710a9b0479ff">operations_research::sat::EncodingNode::HasNoWeight</a></div><div class="ttdeci">bool HasNoWeight() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00150">encoding.cc:150</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a29f3df8e348017bbeaab35d77a4b3fa8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a29f3df8e348017bbeaab35d77a4b3fa8">operations_research::sat::EncodingNode::IncreaseCurrentUB</a></div><div class="ttdeci">bool IncreaseCurrentUB(SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00090">encoding.cc:90</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a2e40079f184eb47ba002820b1c8d7814"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a2e40079f184eb47ba002820b1c8d7814">operations_research::sat::EncodingNode::ApplyWeightUpperBound</a></div><div class="ttdeci">void ApplyWeightUpperBound(Coefficient gap, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00121">encoding.cc:121</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a345efb9c8f2a5a6fa4786ed9e25b9208"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a345efb9c8f2a5a6fa4786ed9e25b9208">operations_research::sat::EncodingNode::IncreaseWeightLb</a></div><div class="ttdeci">void IncreaseWeightLb()</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00145">encoding.cc:145</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a3ca866781a37374b8defaed83b57d602"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a3ca866781a37374b8defaed83b57d602">operations_research::sat::EncodingNode::Reduce</a></div><div class="ttdeci">Coefficient Reduce(const SatSolver &amp;solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00101">encoding.cc:101</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a4101c336fb4c5135ceef3ab532d755cd"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a4101c336fb4c5135ceef3ab532d755cd">operations_research::sat::EncodingNode::current_ub</a></div><div class="ttdeci">int current_ub() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00129">encoding.h:129</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a42fc122b08d9872df0fe327946356be9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a42fc122b08d9872df0fe327946356be9">operations_research::sat::EncodingNode::lb</a></div><div class="ttdeci">int lb() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00128">encoding.h:128</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a4534d0c2b93a62ca6b7b08ec4c8a1365"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a4534d0c2b93a62ca6b7b08ec4c8a1365">operations_research::sat::EncodingNode::child_b</a></div><div class="ttdeci">EncodingNode * child_b() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00132">encoding.h:132</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a45469cb8257ad81b6b29393836a4ac5b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a45469cb8257ad81b6b29393836a4ac5b">operations_research::sat::EncodingNode::ub</a></div><div class="ttdeci">int ub() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00130">encoding.h:130</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a6bea440eb7f63954ecf88b597d182ecb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a6bea440eb7f63954ecf88b597d182ecb">operations_research::sat::EncodingNode::InitializeLazyNode</a></div><div class="ttdeci">void InitializeLazyNode(EncodingNode *a, EncodingNode *b, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00059">encoding.cc:59</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a6e81565ea8f030c21126024751b8d4be"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a6e81565ea8f030c21126024751b8d4be">operations_research::sat::EncodingNode::InitializeFullNode</a></div><div class="ttdeci">void InitializeFullNode(int n, EncodingNode *a, EncodingNode *b, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00039">encoding.cc:39</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a6fdd73f8011695b97659f2bea29325cb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a6fdd73f8011695b97659f2bea29325cb">operations_research::sat::EncodingNode::depth</a></div><div class="ttdeci">int depth() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00126">encoding.h:126</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a7f57c0d3f4a1efca82d8c0721556b9d7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a7f57c0d3f4a1efca82d8c0721556b9d7">operations_research::sat::EncodingNode::weight</a></div><div class="ttdeci">Coefficient weight() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00121">encoding.h:121</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a8d59d3e1fa9887ff055c7a6853055198"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">operations_research::sat::EncodingNode::literal</a></div><div class="ttdeci">Literal literal(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00084">encoding.h:84</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a903b410531434c46abc6516983c6d4d0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a903b410531434c46abc6516983c6d4d0">operations_research::sat::EncodingNode::DebugString</a></div><div class="ttdeci">std::string DebugString(const VariablesAssignment &amp;assignment) const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00154">encoding.cc:154</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_ab4a971df4b55922bdbff74843db10dd1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#ab4a971df4b55922bdbff74843db10dd1">operations_research::sat::EncodingNode::child_a</a></div><div class="ttdeci">EncodingNode * child_a() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00131">encoding.h:131</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_ac92f797a3120e43647b75cc41aa9033e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#ac92f797a3120e43647b75cc41aa9033e">operations_research::sat::EncodingNode::set_weight</a></div><div class="ttdeci">void set_weight(Coefficient w)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00117">encoding.h:117</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_ad43b46262f3e4103bd59aae627925fdf"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#ad43b46262f3e4103bd59aae627925fdf">operations_research::sat::EncodingNode::GreaterThan</a></div><div class="ttdeci">Literal GreaterThan(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00080">encoding.h:80</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_ad9823fa53cc58fc4444d3b2eaadb885c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#ad9823fa53cc58fc4444d3b2eaadb885c">operations_research::sat::EncodingNode::set_depth</a></div><div class="ttdeci">void set_depth(int depth)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00125">encoding.h:125</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_af9593d4a5ff4274efaf429cb4f9e57cc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#af9593d4a5ff4274efaf429cb4f9e57cc">operations_research::sat::EncodingNode::size</a></div><div class="ttdeci">int size() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00083">encoding.h:83</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_afcc0ba7af448641ff70c751416efb4ae"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#afcc0ba7af448641ff70c751416efb4ae">operations_research::sat::EncodingNode::EncodingNode</a></div><div class="ttdeci">EncodingNode()</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00059">encoding.h:59</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_afcf37f1f013451c059ca2074be226078"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#afcf37f1f013451c059ca2074be226078">operations_research::sat::EncodingNode::operator&lt;</a></div><div class="ttdeci">bool operator&lt;(const EncodingNode &amp;other) const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00092">encoding.h:92</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00067">sat_base.h:67</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html">operations_research::sat::SatSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00061">sat_solver.h:61</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html">operations_research::sat::VariablesAssignment</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00125">sat_base.h:125</a></div></div>
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a9293e4d29cac928301645070dd307683"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a></div><div class="ttdeci">int64_t b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00047">constraint_solver/table.cc:47</a></div></div>
<div class="ttc" id="aconstraint__solver_2table_8cc_html_acb18315d548212835cd8ed4287e6c0b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a></div><div class="ttdeci">int64_t a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00046">constraint_solver/table.cc:46</a></div></div>
<div class="ttc" id="agscip__solver_8cc_html_a1ba5ca0f61f2fa13bd23bf0f89004f35"><div class="ttname"><a href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a></div><div class="ttdeci">double upper_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00137">gscip_solver.cc:137</a></div></div>
<div class="ttc" id="agscip__solver_8cc_html_a1e2f9a2352c1d9a6cada9544898fceec"><div class="ttname"><a href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a></div><div class="ttdeci">double lower_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00136">gscip_solver.cc:136</a></div></div>
<div class="ttc" id="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
<div class="ttc" id="amacros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ab61209db5b13f0d424da009e414298fc"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">operations_research::math_opt::Coefficient</a></div><div class="ttdeci">std::tuple&lt; int64_t, int64_t, const double &gt; Coefficient</div><div class="ttdef"><b>Definition:</b> <a href="sparse__collection__matchers_8h_source.html#l00061">sparse_collection_matchers.h:61</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1c9d74b9b207b6e5513334dd135a00a9"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1c9d74b9b207b6e5513334dd135a00a9">operations_research::sat::ComputeCoreMinWeight</a></div><div class="ttdeci">Coefficient ComputeCoreMinWeight(const std::vector&lt; EncodingNode * &gt; &amp;nodes, const std::vector&lt; Literal &gt; &amp;core)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00501">encoding.cc:501</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a29ff75f2188e0ac1c58fa4b0cf793a00"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a29ff75f2188e0ac1c58fa4b0cf793a00">operations_research::sat::MergeAllNodesWithDeque</a></div><div class="ttdeci">EncodingNode * MergeAllNodesWithDeque(Coefficient upper_bound, const std::vector&lt; EncodingNode * &gt; &amp;nodes, SatSolver *solver, std::deque&lt; EncodingNode &gt; *repository)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00335">encoding.cc:335</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a377e4b11a03d712029888c83b492c1cb"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a377e4b11a03d712029888c83b492c1cb">operations_research::sat::LazyMergeAllNodeWithPQAndIncreaseLb</a></div><div class="ttdeci">EncodingNode * LazyMergeAllNodeWithPQAndIncreaseLb(Coefficient weight, const std::vector&lt; EncodingNode * &gt; &amp;nodes, SatSolver *solver, std::deque&lt; EncodingNode &gt; *repository)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00357">encoding.cc:357</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a3c7b9fb850d243d90ea59790db13a676"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3c7b9fb850d243d90ea59790db13a676">operations_research::sat::ReduceNodesAndExtractAssumptions</a></div><div class="ttdeci">std::vector&lt; Literal &gt; ReduceNodesAndExtractAssumptions(Coefficient upper_bound, Coefficient stratified_lower_bound, Coefficient *lower_bound, std::vector&lt; EncodingNode * &gt; *nodes, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00447">encoding.cc:447</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a6af701ea48c91ef8a59a67b5b8d355c2"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a6af701ea48c91ef8a59a67b5b8d355c2">operations_research::sat::IncreaseNodeSize</a></div><div class="ttdeci">void IncreaseNodeSize(EncodingNode *node, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00189">encoding.cc:189</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a99e372550892ddd117f7a23e4fd73518"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a99e372550892ddd117f7a23e4fd73518">operations_research::sat::LazyMerge</a></div><div class="ttdeci">EncodingNode LazyMerge(EncodingNode *a, EncodingNode *b, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00179">encoding.cc:179</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aa357501e62925d41514301a6fd211c3e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa357501e62925d41514301a6fd211c3e">operations_research::sat::FullMerge</a></div><div class="ttdeci">EncodingNode FullMerge(Coefficient upper_bound, EncodingNode *a, EncodingNode *b, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00284">encoding.cc:284</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_accf33b62b1612d7a8abf3014a2df933c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#accf33b62b1612d7a8abf3014a2df933c">operations_research::sat::ProcessCore</a></div><div class="ttdeci">bool ProcessCore(const std::vector&lt; Literal &gt; &amp;core, Coefficient min_weight, std::deque&lt; EncodingNode &gt; *repository, std::vector&lt; EncodingNode * &gt; *nodes, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00528">encoding.cc:528</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ad6c9cfad7e2fa7ae1bbff31720394436"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ad6c9cfad7e2fa7ae1bbff31720394436">operations_research::sat::MaxNodeWeightSmallerThan</a></div><div class="ttdeci">Coefficient MaxNodeWeightSmallerThan(const std::vector&lt; EncodingNode * &gt; &amp;nodes, Coefficient upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00516">encoding.cc:516</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ae6a6bf1bcc04b9d64b9d9f4178e34333"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae6a6bf1bcc04b9d64b9d9f4178e34333">operations_research::sat::ProcessCoreWithAlternativeEncoding</a></div><div class="ttdeci">bool ProcessCoreWithAlternativeEncoding(const std::vector&lt; Literal &gt; &amp;core, Coefficient min_weight, std::deque&lt; EncodingNode &gt; *repository, std::vector&lt; EncodingNode * &gt; *nodes, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00576">encoding.cc:576</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aea70549adb843d22d06bef763a0960c8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aea70549adb843d22d06bef763a0960c8">operations_research::sat::CreateInitialEncodingNodes</a></div><div class="ttdeci">std::vector&lt; EncodingNode * &gt; CreateInitialEncodingNodes(const std::vector&lt; Literal &gt; &amp;literals, const std::vector&lt; Coefficient &gt; &amp;coeffs, Coefficient *offset, std::deque&lt; EncodingNode &gt; *repository)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00385">encoding.cc:385</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">Collection of objects used to extend the Constraint Solver library.</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="apack_8cc_html_a4255f714cea26cdd64f6a0ee72d34a8c"><div class="ttname"><a href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a></div><div class="ttdeci">int64_t weight</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00510">pack.cc:510</a></div></div>
<div class="ttc" id="apb__constraint_8h_html"><div class="ttname"><a href="pb__constraint_8h.html">pb_constraint.h</a></div></div>
<div class="ttc" id="arouting__search_8cc_html_a6b7983ccd32c86cbbc3d4d9cda4cac17"><div class="ttname"><a href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a></div><div class="ttdeci">int nodes</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03997">routing_search.cc:3997</a></div></div>
<div class="ttc" id="asat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</a></div></div>
<div class="ttc" id="asat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
<div class="ttc" id="astrong__integers_8h_html"><div class="ttname"><a href="strong__integers_8h.html">strong_integers.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_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="encoding_8h.html">encoding.h</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.3 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink