158 lines
64 KiB
HTML
158 lines
64 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.8.15"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: implied_bounds.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>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</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">9.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<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');
|
|
/* @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('implied__bounds_8h_source.html','');});
|
|
/* @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">implied_bounds.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="implied__bounds_8h.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-2021 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">#ifndef OR_TOOLS_SAT_IMPLIED_BOUNDS_H_</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#define OR_TOOLS_SAT_IMPLIED_BOUNDS_H_</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <algorithm></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <cstdint></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/container/flat_hash_map.h"</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="int__type_8h.html">ortools/base/int_type.h</a>"</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="strong__vector_8h.html">ortools/base/strong_vector.h</a>"</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>"</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="sat_2linear__constraint_8h.html">ortools/sat/linear_constraint.h</a>"</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="sat_2model_8h.html">ortools/sat/model.h</a>"</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="sat__base_8h.html">ortools/sat/sat_base.h</a>"</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="bitset_8h.html">ortools/util/bitset.h</a>"</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">namespace </span>sat {</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">// For each IntegerVariable, the ImpliedBound class allows to list all such</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// entries.</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">//</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// This is meant to be used in the cut generation code when it make sense: if we</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// have BoolVar => X >= bound, we can always lower bound the variable X by</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// (bound - X_lb) * BoolVar + X_lb, and that can lead to stronger cuts.</span></div><div class="line"><a name="l00041"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html"> 41</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html">ImpliedBoundEntry</a> {</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="comment">// An integer variable in [0, 1]. When at 1, then the IntegerVariable</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="comment">// corresponding to this entry must be greater or equal to the given lower</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="comment">// bound.</span></div><div class="line"><a name="l00045"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#aeed2f5711a316d7b21a6d36629af958f"> 45</a></span>  IntegerVariable <a class="code" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#aeed2f5711a316d7b21a6d36629af958f">literal_view</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>;</div><div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#ac6420aaa41bdee5430eb0bb90df18c9e"> 46</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#ac6420aaa41bdee5430eb0bb90df18c9e">lower_bound</a> = IntegerValue(0);</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> </div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="comment">// If false, it is when the literal_view is zero that the lower bound is</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">// valid.</span></div><div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#a6d2822d5e07c3716efcdf73a4ae5eafc"> 50</a></span>  <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#a6d2822d5e07c3716efcdf73a4ae5eafc">is_positive</a> = <span class="keyword">true</span>;</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> </div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="comment">// These constructors are needed for OR-Tools.</span></div><div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#a9444514145a4699439477891643ac4e2"> 53</a></span>  <a class="code" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#a9444514145a4699439477891643ac4e2">ImpliedBoundEntry</a>(IntegerVariable lit, IntegerValue lb, <span class="keywordtype">bool</span> positive)</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  : <a class="code" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#aeed2f5711a316d7b21a6d36629af958f">literal_view</a>(lit), <a class="code" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#ac6420aaa41bdee5430eb0bb90df18c9e">lower_bound</a>(lb), <a class="code" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#a6d2822d5e07c3716efcdf73a4ae5eafc">is_positive</a>(positive) {}</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#a61c116a72051cf8d1b798d7352f98dbc"> 56</a></span>  <a class="code" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#a61c116a72051cf8d1b798d7352f98dbc">ImpliedBoundEntry</a>()</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  : <a class="code" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#aeed2f5711a316d7b21a6d36629af958f">literal_view</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>), <a class="code" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#ac6420aaa41bdee5430eb0bb90df18c9e">lower_bound</a>(0), <a class="code" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#a6d2822d5e07c3716efcdf73a4ae5eafc">is_positive</a>(true) {}</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> };</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="comment">// Maintains all the implications of the form Literal => IntegerLiteral. We</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// collect these implication at model loading, during probing and during search.</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment">//</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment">// TODO(user): This can quickly use up too much memory. Add some limit in place.</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment">// In particular, each time we have literal => integer_literal we should avoid</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment">// storing the same integer_literal for all other_literal for which</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment">// other_literal => literal. For this we need to interact with the</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment">// BinaryImplicationGraph.</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment">//</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// TODO(user): This is a bit of a duplicate with the Literal <=> IntegerLiteral</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment">// stored in the IntegerEncoder class. However we only need one side here.</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment">//</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// TODO(user): Do like in the DomainDeductions class and allow to process</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment">// clauses (or store them) to perform more level zero deductions. Note that this</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// is again a slight duplicate with what we do there (except that we work at the</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment">// Domain level in that presolve class).</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment">//</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// TODO(user): Add an implied bound cut generator to add these simple</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment">// constraints to the LP when needed.</span></div><div class="line"><a name="l00079"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_implied_bounds.html"> 79</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html">ImpliedBounds</a> {</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00081"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_implied_bounds.html#a0664b5f76135ba014b22d1be698cdb85"> 81</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html#a0664b5f76135ba014b22d1be698cdb85">ImpliedBounds</a>(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  : parameters_(*<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>()),</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  sat_solver_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>()),</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  integer_trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>()),</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  integer_encoder_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>()) {}</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html#a524f691e9f750b9f09ae9393c7464dd1">~ImpliedBounds</a>();</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> </div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// Adds literal => integer_literal to the repository.</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="comment">//</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// Not that it checks right aways if there is another bound on the same</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// variable involving literal.Negated(), in which case we can improve the</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">// level zero lower bound of the variable.</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html#a6090e7a5aaf2ae687d3dab6e8ab31cab">Add</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>, <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> integer_literal);</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> </div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// Adds literal => var == value.</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html#a23dc89241d2cd6c2c02a54f2d25c8b95">AddLiteralImpliesVarEqValue</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>, IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>,</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  IntegerValue <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// This must be called after first_decision has been enqueued and propagated.</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// It will inspect the trail and add all new implied bounds.</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">//</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// Preconditions: The decision level must be one (CHECKed). And the decision</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// must be equal to first decision (we currently do not CHECK that).</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html#af55df3ca81000daf46c6096a71778c40">ProcessIntegerTrail</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> first_decision);</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// Returns all the implied bounds stored for the given variable.</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// Note that only literal with an IntegerView are considered here.</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">const</span> std::vector<ImpliedBoundEntry>& <a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html#a1abcc20de9ebbf211ba0e97710b4be4d">GetImpliedBounds</a>(IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</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">// Returns all the variables for which GetImpliedBounds(var) is not empty. Or</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="comment">// at least that was not empty at some point, because we lazily remove bounds</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">// that become trivial as the search progress.</span></div><div class="line"><a name="l00113"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_implied_bounds.html#ad9f39b33797e085f172b1c042819b213"> 113</a></span>  <span class="keyword">const</span> std::vector<IntegerVariable>& <a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html#ad9f39b33797e085f172b1c042819b213">VariablesWithImpliedBounds</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">return</span> has_implied_bounds_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>();</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  }</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// Returns all the implied values stored for a given literal.</span></div><div class="line"><a name="l00118"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_implied_bounds.html#a92f05ad5926bbad9e9a9ed0513927d93"> 118</a></span>  <span class="keyword">const</span> absl::flat_hash_map<IntegerVariable, IntegerValue>& <a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html#a92f05ad5926bbad9e9a9ed0513927d93">GetImpliedValues</a>(</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)<span class="keyword"> const </span>{</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">const</span> <span class="keyword">auto</span> it = literal_to_var_to_value_.find(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index());</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">return</span> it != literal_to_var_to_value_.end() ? it->second</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  : empty_var_to_value_;</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  }</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>  <span class="comment">// Register the fact that var = sum literal * value with sum literal == 1.</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// Note that we call this an "element" encoding because a value can appear</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">// more than once.</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html#a6f803d37ccb81865b3dfe666cf3f2c3e">AddElementEncoding</a>(IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>,</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">const</span> std::vector<ValueLiteralPair>& encoding,</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordtype">int</span> exactly_one_index);</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="comment">// Returns an empty map if there is no such encoding.</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">const</span> absl::flat_hash_map<int, std::vector<ValueLiteralPair>>&</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html#a5fa6e048979b81356f58a0ce364b0f28">GetElementEncodings</a>(IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</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>  <span class="comment">// Get an unsorted set of variables appearing in element encodings.</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& <a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html#ab8e39f1475297ca71eba5563bce4726c">GetElementEncodedVariables</a>() <span class="keyword">const</span>;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">// Adds to the integer trail all the new level-zero deduction made here.</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">// This can only be called at decision level zero. Returns false iff the model</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">// is infeasible.</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html#a0e2d0bf17ef8f8ea329a2faec4583377">EnqueueNewDeductions</a>();</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>  <span class="comment">// When a literal does not have an integer view, we do not add any</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="comment">// ImpliedBoundEntry. This allows to create missing entries for a literal for</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="comment">// which a view was just created.</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">//</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="comment">// TODO(user): Implement and call when we create new views in the linear</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="comment">// relaxation.</span></div><div class="line"><a name="l00150"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_implied_bounds.html#a2ae6fb4551f6640de5e5dcabf8930253"> 150</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html#a2ae6fb4551f6640de5e5dcabf8930253">NotifyNewIntegerView</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>) {}</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>& parameters_;</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* sat_solver_;</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail_;</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>* integer_encoder_;</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="comment">// TODO(user): Remove the need for this.</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  std::vector<IntegerLiteral> tmp_integer_literals_;</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">// For each (Literal, IntegerVariable) the best lower bound implied by this</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="comment">// literal. Note that there is no need to store any entries that do not</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="comment">// improve on the level zero lower bound.</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="comment">//</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="comment">// TODO(user): we could lazily remove old entries to save a bit of space if</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// many deduction where made at level zero.</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  absl::flat_hash_map<std::pair<LiteralIndex, IntegerVariable>, IntegerValue></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  bounds_;</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// Note(user): The plan is to use these during cut generation, so only the</span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="comment">// Literal with an IntegerView that can be used in the LP relaxation need to</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// be kept here.</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">//</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="comment">// TODO(user): Use inlined vectors.</span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  std::vector<ImpliedBoundEntry> empty_implied_bounds_;</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, std::vector<ImpliedBoundEntry></a>></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  var_to_bounds_;</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">// Track the list of variables with some implied bounds.</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <a class="code" href="classoperations__research_1_1_sparse_bitset.html">SparseBitset<IntegerVariable></a> has_implied_bounds_;</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> </div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// Stores implied values per variable.</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  absl::flat_hash_map<LiteralIndex,</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  absl::flat_hash_map<IntegerVariable, IntegerValue>></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  literal_to_var_to_value_;</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keyword">const</span> absl::flat_hash_map<IntegerVariable, IntegerValue> empty_var_to_value_;</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> </div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  absl::flat_hash_map<IntegerVariable,</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  absl::flat_hash_map<int, std::vector<ValueLiteralPair>>></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  var_to_index_to_element_encodings_;</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keyword">const</span> absl::flat_hash_map<int, std::vector<ValueLiteralPair>></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  empty_element_encoding_;</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  std::vector<IntegerVariable> element_encoded_variables_;</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>  <span class="comment">// TODO(user): Ideally, this should go away if we manage to push level-zero</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="comment">// fact at a positive level directly.</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, IntegerValue></a> level_zero_lower_bounds_;</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <a class="code" href="classoperations__research_1_1_sparse_bitset.html">SparseBitset<IntegerVariable></a> new_level_zero_bounds_;</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> </div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="comment">// Stats.</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  int64_t num_deductions_ = 0;</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  int64_t num_enqueued_in_var_to_bounds_ = 0;</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> };</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> </div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="comment">// Looks at value encodings and detects if the product of two variables can be</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="comment">// linearized.</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="comment">//</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment">// In the returned encoding, note that all the literals will be unique and in</span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="comment">// exactly one relation, and that the values can be duplicated. This is what we</span></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="comment">// call an "element" encoding.</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="comment">//</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="comment">// The expressions will also be canonical.</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a8d19e8d5e074feb1e673e585b3a04266">DetectLinearEncodingOfProducts</a>(<span class="keyword">const</span> AffineExpression& left,</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keyword">const</span> AffineExpression& right, Model* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  LinearConstraintBuilder* builder);</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> </div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="comment">// Try to linearize each term of the inner product of left and right.</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="comment">// If the linearization not possible at position i, then</span></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="comment">// ProductIsLinearized(energies[i]) will return false.</span></div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a47064139cec9b2ea520361ee30f0f243">LinearizeInnerProduct</a>(<span class="keyword">const</span> std::vector<AffineExpression>& left,</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keyword">const</span> std::vector<AffineExpression>& right,</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  Model* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  std::vector<LinearExpression>* energies);</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> </div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="comment">// Returns whether the corresponding expression is a valid linearization of</span></div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="comment">// the product of two affine expressions.</span></div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a88c8ab90d500702234707905c3b07ad2">ProductIsLinearized</a>(<span class="keyword">const</span> LinearExpression& expr);</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> </div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> } <span class="comment">// namespace sat</span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> } <span class="comment">// namespace operations_research</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> </div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="preprocessor">#endif // OR_TOOLS_SAT_IMPLIED_BOUNDS_H_</span></div><div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html">operations_research::sat::IntegerLiteral</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00168">integer.h:168</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00038">sat/model.h:38</a></div></div>
|
|
<div class="ttc" id="int__type_8h_html"><div class="ttname"><a href="int__type_8h.html">int_type.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_implied_bounds_html_a5fa6e048979b81356f58a0ce364b0f28"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html#a5fa6e048979b81356f58a0ce364b0f28">operations_research::sat::ImpliedBounds::GetElementEncodings</a></div><div class="ttdeci">const absl::flat_hash_map< int, std::vector< ValueLiteralPair > > & GetElementEncodings(IntegerVariable var)</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8cc_source.html#l00215">implied_bounds.cc:215</a></div></div>
|
|
<div class="ttc" id="sat_2model_8h_html"><div class="ttname"><a href="sat_2model_8h.html">model.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_implied_bounds_html_a6f803d37ccb81865b3dfe666cf3f2c3e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html#a6f803d37ccb81865b3dfe666cf3f2c3e">operations_research::sat::ImpliedBounds::AddElementEncoding</a></div><div class="ttdeci">void AddElementEncoding(IntegerVariable var, const std::vector< ValueLiteralPair > &encoding, int exactly_one_index)</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8cc_source.html#l00208">implied_bounds.cc:208</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_bitset_html"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html">operations_research::SparseBitset< IntegerVariable ></a></div></div>
|
|
<div class="ttc" id="gurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00274">gurobi_interface.cc:274</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00066">sat_base.h:66</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_implied_bounds_html_a6090e7a5aaf2ae687d3dab6e8ab31cab"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html#a6090e7a5aaf2ae687d3dab6e8ab31cab">operations_research::sat::ImpliedBounds::Add</a></div><div class="ttdeci">void Add(Literal literal, IntegerLiteral integer_literal)</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8cc_source.html#l00033">implied_bounds.cc:33</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a8d19e8d5e074feb1e673e585b3a04266"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8d19e8d5e074feb1e673e585b3a04266">operations_research::sat::DetectLinearEncodingOfProducts</a></div><div class="ttdeci">bool DetectLinearEncodingOfProducts(const AffineExpression &left, const AffineExpression &right, Model *model, LinearConstraintBuilder *builder)</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8cc_source.html#l00320">implied_bounds.cc:320</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_implied_bounds_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html">operations_research::sat::ImpliedBounds</a></div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8h_source.html#l00079">implied_bounds.h:79</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_implied_bound_entry_html_aeed2f5711a316d7b21a6d36629af958f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#aeed2f5711a316d7b21a6d36629af958f">operations_research::sat::ImpliedBoundEntry::literal_view</a></div><div class="ttdeci">IntegerVariable literal_view</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8h_source.html#l00045">implied_bounds.h:45</a></div></div>
|
|
<div class="ttc" id="integral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="sat_2linear__constraint_8h_html"><div class="ttname"><a href="sat_2linear__constraint_8h.html">linear_constraint.h</a></div></div>
|
|
<div class="ttc" id="strong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_encoder_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html">operations_research::sat::IntegerEncoder</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00356">integer.h:356</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_implied_bounds_html_a23dc89241d2cd6c2c02a54f2d25c8b95"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html#a23dc89241d2cd6c2c02a54f2d25c8b95">operations_research::sat::ImpliedBounds::AddLiteralImpliesVarEqValue</a></div><div class="ttdeci">void AddLiteralImpliesVarEqValue(Literal literal, IntegerVariable var, IntegerValue value)</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8cc_source.html#l00187">implied_bounds.cc:187</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_implied_bounds_html_ad9f39b33797e085f172b1c042819b213"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html#ad9f39b33797e085f172b1c042819b213">operations_research::sat::ImpliedBounds::VariablesWithImpliedBounds</a></div><div class="ttdeci">const std::vector< IntegerVariable > & VariablesWithImpliedBounds() const</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8h_source.html#l00113">implied_bounds.h:113</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_implied_bound_entry_html_a6d2822d5e07c3716efcdf73a4ae5eafc"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#a6d2822d5e07c3716efcdf73a4ae5eafc">operations_research::sat::ImpliedBoundEntry::is_positive</a></div><div class="ttdeci">bool is_positive</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8h_source.html#l00050">implied_bounds.h:50</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html">operations_research::sat::IntegerTrail</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00613">integer.h:613</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_implied_bound_entry_html_a61c116a72051cf8d1b798d7352f98dbc"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#a61c116a72051cf8d1b798d7352f98dbc">operations_research::sat::ImpliedBoundEntry::ImpliedBoundEntry</a></div><div class="ttdeci">ImpliedBoundEntry()</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8h_source.html#l00056">implied_bounds.h:56</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_implied_bounds_html_af55df3ca81000daf46c6096a71778c40"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html#af55df3ca81000daf46c6096a71778c40">operations_research::sat::ImpliedBounds::ProcessIntegerTrail</a></div><div class="ttdeci">void ProcessIntegerTrail(Literal first_decision)</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8cc_source.html#l00197">implied_bounds.cc:197</a></div></div>
|
|
<div class="ttc" id="sat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00058">sat_solver.h:58</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_implied_bound_entry_html_ac6420aaa41bdee5430eb0bb90df18c9e"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#ac6420aaa41bdee5430eb0bb90df18c9e">operations_research::sat::ImpliedBoundEntry::lower_bound</a></div><div class="ttdeci">IntegerValue lower_bound</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8h_source.html#l00046">implied_bounds.h:46</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_implied_bound_entry_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_implied_bound_entry.html">operations_research::sat::ImpliedBoundEntry</a></div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8h_source.html#l00041">implied_bounds.h:41</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_implied_bounds_html_a0664b5f76135ba014b22d1be698cdb85"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html#a0664b5f76135ba014b22d1be698cdb85">operations_research::sat::ImpliedBounds::ImpliedBounds</a></div><div class="ttdeci">ImpliedBounds(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8h_source.html#l00081">implied_bounds.h:81</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_implied_bounds_html_a1abcc20de9ebbf211ba0e97710b4be4d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html#a1abcc20de9ebbf211ba0e97710b4be4d">operations_research::sat::ImpliedBounds::GetImpliedBounds</a></div><div class="ttdeci">const std::vector< ImpliedBoundEntry > & GetImpliedBounds(IntegerVariable var)</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8cc_source.html#l00165">implied_bounds.cc:165</a></div></div>
|
|
<div class="ttc" id="classabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector</a></div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00076">strong_vector.h:76</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a47064139cec9b2ea520361ee30f0f243"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a47064139cec9b2ea520361ee30f0f243">operations_research::sat::LinearizeInnerProduct</a></div><div class="ttdeci">void LinearizeInnerProduct(const std::vector< AffineExpression > &left, const std::vector< AffineExpression > &right, Model *model, std::vector< LinearExpression > *energies)</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8cc_source.html#l00444">implied_bounds.cc:444</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_implied_bounds_html_a2ae6fb4551f6640de5e5dcabf8930253"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html#a2ae6fb4551f6640de5e5dcabf8930253">operations_research::sat::ImpliedBounds::NotifyNewIntegerView</a></div><div class="ttdeci">void NotifyNewIntegerView(Literal literal)</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8h_source.html#l00150">implied_bounds.h:150</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_sparse_bitset_html_a1e5ae9fb14fd6b25919148ae8bbaf050"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">operations_research::SparseBitset::PositionsSetAtLeastOnce</a></div><div class="ttdeci">const std::vector< IntegerType > & PositionsSetAtLeastOnce() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00814">bitset.h:814</a></div></div>
|
|
<div class="ttc" id="integer_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__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="namespaceoperations__research_1_1sat_html_a5bd8c44473618b7eafd33ba978db2f06"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">operations_research::sat::kNoIntegerVariable</a></div><div class="ttdeci">const IntegerVariable kNoIntegerVariable(-1)</div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_implied_bound_entry_html_a9444514145a4699439477891643ac4e2"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_implied_bound_entry.html#a9444514145a4699439477891643ac4e2">operations_research::sat::ImpliedBoundEntry::ImpliedBoundEntry</a></div><div class="ttdeci">ImpliedBoundEntry(IntegerVariable lit, IntegerValue lb, bool positive)</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8h_source.html#l00053">implied_bounds.h:53</a></div></div>
|
|
<div class="ttc" id="expr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="bitset_8h_html"><div class="ttname"><a href="bitset_8h.html">bitset.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_implied_bounds_html_ab8e39f1475297ca71eba5563bce4726c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html#ab8e39f1475297ca71eba5563bce4726c">operations_research::sat::ImpliedBounds::GetElementEncodedVariables</a></div><div class="ttdeci">const std::vector< IntegerVariable > & GetElementEncodedVariables() const</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8cc_source.html#l00224">implied_bounds.cc:224</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_implied_bounds_html_a524f691e9f750b9f09ae9393c7464dd1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html#a524f691e9f750b9f09ae9393c7464dd1">operations_research::sat::ImpliedBounds::~ImpliedBounds</a></div><div class="ttdeci">~ImpliedBounds()</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8cc_source.html#l00026">implied_bounds.cc:26</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html">operations_research::sat::SatParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00347">sat_parameters.pb.h:347</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a88c8ab90d500702234707905c3b07ad2"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a88c8ab90d500702234707905c3b07ad2">operations_research::sat::ProductIsLinearized</a></div><div class="ttdeci">bool ProductIsLinearized(const LinearExpression &expr)</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8cc_source.html#l00439">implied_bounds.cc:439</a></div></div>
|
|
<div class="ttc" id="demon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
|
|
<div class="ttc" id="optimization_8cc_html_af63dcc00f2023fdf498e0829e6fb8a6b"><div class="ttname"><a href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a></div><div class="ttdeci">Literal literal</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00085">optimization.cc:85</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_implied_bounds_html_a0e2d0bf17ef8f8ea329a2faec4583377"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html#a0e2d0bf17ef8f8ea329a2faec4583377">operations_research::sat::ImpliedBounds::EnqueueNewDeductions</a></div><div class="ttdeci">bool EnqueueNewDeductions()</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8cc_source.html#l00229">implied_bounds.cc:229</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_implied_bounds_html_a92f05ad5926bbad9e9a9ed0513927d93"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html#a92f05ad5926bbad9e9a9ed0513927d93">operations_research::sat::ImpliedBounds::GetImpliedValues</a></div><div class="ttdeci">const absl::flat_hash_map< IntegerVariable, IntegerValue > & GetImpliedValues(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8h_source.html#l00118">implied_bounds.h:118</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="implied__bounds_8h.html">implied_bounds.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.8.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|