Files
ortools-clone/docs/cpp/cuts_8cc_source.html
Mizux Seiha 3b81c981c2 Update doc
2022-03-04 00:19:15 +01:00

2458 lines
507 KiB
HTML

<!-- HTML header for doxygen 1.8.18-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.3"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>OR-Tools: cuts.cc Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">OR-Tools
&#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('cuts_8cc_source.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle"><div class="title">cuts.cc</div></div>
</div><!--header-->
<div class="contents">
<a href="cuts_8cc.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="preprocessor">#include &quot;<a class="code" href="cuts_8h.html">ortools/sat/cuts.h</a>&quot;</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span> </div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include &lt;cstdlib&gt;</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include &lt;functional&gt;</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include &lt;limits&gt;</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include &lt;memory&gt;</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include &lt;string&gt;</span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include &lt;utility&gt;</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> </div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include &quot;absl/container/btree_set.h&quot;</span></div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include &quot;absl/container/flat_hash_map.h&quot;</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include &quot;absl/container/flat_hash_set.h&quot;</span></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include &quot;absl/memory/memory.h&quot;</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include &quot;absl/meta/type_traits.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="knapsack__solver__for__cuts_8h.html">ortools/algorithms/knapsack_solver_for_cuts.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="base_2logging_8h.html">ortools/base/logging.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="stl__util_8h.html">ortools/base/stl_util.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__vector_8h.html">ortools/base/strong_vector.h</a>&quot;</span></div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="preprocessor">#include &quot;<a class="code" href="clause_8h.html">ortools/sat/clause.h</a>&quot;</span></div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="preprocessor">#include &quot;<a class="code" href="implied__bounds_8h.html">ortools/sat/implied_bounds.h</a>&quot;</span></div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="preprocessor">#include &quot;<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>&quot;</span></div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="preprocessor">#include &quot;<a class="code" href="sat_2linear__constraint_8h.html">ortools/sat/linear_constraint.h</a>&quot;</span></div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="preprocessor">#include &quot;<a class="code" href="linear__constraint__manager_8h.html">ortools/sat/linear_constraint_manager.h</a>&quot;</span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="preprocessor">#include &quot;<a class="code" href="sat_2model_8h.html">ortools/sat/model.h</a>&quot;</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</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="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="preprocessor">#include &quot;<a class="code" href="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.h</a>&quot;</span></div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="preprocessor">#include &quot;<a class="code" href="sorted__interval__list_8h.html">ortools/util/sorted_interval_list.h</a>&quot;</span></div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</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="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="preprocessor">#include &quot;<a class="code" href="time__limit_8h.html">ortools/util/time_limit.h</a>&quot;</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> </div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span><span class="keyword">namespace </span>sat {</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> </div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span><span class="keyword">namespace </span>{</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> </div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="comment">// Minimum amount of violation of the cut constraint by the solution. This</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span><span class="comment">// is needed to avoid numerical issues and adding cuts with minor effect.</span></div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span><span class="keyword">const</span> <span class="keywordtype">double</span> kMinCutViolation = 1e-4;</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> </div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span><span class="comment">// Returns the lp value of a Literal.</span></div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span><span class="keywordtype">double</span> GetLiteralLpValue(</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keyword">const</span> Literal lit,</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values,</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keyword">const</span> IntegerEncoder* encoder) {</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keyword">const</span> IntegerVariable direct_view = encoder-&gt;GetLiteralView(lit);</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordflow">if</span> (direct_view != <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordflow">return</span> lp_values[direct_view];</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> }</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keyword">const</span> IntegerVariable opposite_view = encoder-&gt;GetLiteralView(lit.Negated());</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(opposite_view, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>);</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keywordflow">return</span> 1.0 - lp_values[opposite_view];</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span>}</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">// Returns a constraint that disallow all given variables to be at their current</span></div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span><span class="comment">// upper bound. The arguments must form a non-trival constraint of the form</span></div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span><span class="comment">// sum terms (coeff * var) &lt;= upper_bound.</span></div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span>LinearConstraint GenerateKnapsackCutForCover(</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keyword">const</span> std::vector&lt;IntegerVariable&gt;&amp; vars,</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keyword">const</span> std::vector&lt;IntegerValue&gt;&amp; coeffs, <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>,</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="keyword">const</span> IntegerTrail&amp; integer_trail) {</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(vars.size(), coeffs.size());</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <a class="code hl_define" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(vars.size(), 0);</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> LinearConstraint cut;</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> IntegerValue cut_upper_bound = IntegerValue(0);</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> IntegerValue max_coeff = coeffs[0];</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="comment">// slack = \sum_{i}(coeffs[i] * upper_bound[i]) - upper_bound.</span></div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> IntegerValue slack = -<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>;</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; vars.size(); ++i) {</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keyword">const</span> IntegerValue var_upper_bound =</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> integer_trail.LevelZeroUpperBound(vars[i]);</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> cut_upper_bound += var_upper_bound;</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> cut.vars.push_back(vars[i]);</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> cut.coeffs.push_back(IntegerValue(1));</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> max_coeff = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_coeff, coeffs[i]);</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> slack += coeffs[i] * var_upper_bound;</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> }</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <a class="code hl_define" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(slack, 0.0) &lt;&lt; <span class="stringliteral">&quot;Invalid cover for knapsack cut.&quot;</span>;</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> cut_upper_bound -= <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(slack, max_coeff);</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> cut.lb = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5316808a2d5007c3b489e844801385e5">kMinIntegerValue</a>;</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> cut.ub = cut_upper_bound;</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) &lt;&lt; <span class="stringliteral">&quot;Generated Knapsack Constraint:&quot;</span> &lt;&lt; cut.DebugString();</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordflow">return</span> cut;</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> </div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span><span class="keywordtype">bool</span> SolutionSatisfiesConstraint(</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="keyword">const</span> LinearConstraint&amp; constraint,</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values) {</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="keyword">const</span> <span class="keywordtype">double</span> activity = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aea18a909121c1c2ba4a818298611f0b2">ComputeActivity</a>(constraint, lp_values);</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="keyword">const</span> <span class="keywordtype">double</span> tolerance = 1e-6;</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="keywordflow">return</span> (activity &lt;= <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(constraint.ub) + tolerance &amp;&amp;</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> activity &gt;= <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(constraint.lb) - tolerance)</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> ? true</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> : <span class="keyword">false</span>;</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span>}</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="keywordtype">bool</span> SmallRangeAndAllCoefficientsMagnitudeAreTheSame(</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="keyword">const</span> LinearConstraint&amp; constraint, IntegerTrail* integer_trail) {</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="keywordflow">if</span> (constraint.vars.empty()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</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"> 117</span> <span class="keyword">const</span> int64_t magnitude = std::abs(constraint.coeffs[0].value());</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; constraint.coeffs.size(); ++i) {</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = constraint.vars[i];</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="keywordflow">if</span> (integer_trail-&gt;LevelZeroUpperBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) -</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> integer_trail-&gt;LevelZeroLowerBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) &gt;</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> 1) {</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> }</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">if</span> (std::abs(constraint.coeffs[i].value()) != magnitude) {</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</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"> 128</span> }</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span>}</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> </div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span><span class="keywordtype">bool</span> AllVarsTakeIntegerValue(</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> <span class="keyword">const</span> std::vector&lt;IntegerVariable&gt; vars,</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values) {</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="keywordflow">for</span> (IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars) {</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="keywordflow">if</span> (std::abs(lp_values[<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] - std::round(lp_values[<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>])) &gt; 1e-6) {</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> }</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> }</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span>}</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">// Returns smallest cover size for the given constraint taking into account</span></div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span><span class="comment">// level zero bounds. Smallest Cover size is computed as follows.</span></div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span><span class="comment">// 1. Compute the upper bound if all variables are shifted to have zero lower</span></div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span><span class="comment">// bound.</span></div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span><span class="comment">// 2. Sort all terms (coefficient * shifted upper bound) in non decreasing</span></div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span><span class="comment">// order.</span></div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span><span class="comment">// 3. Add terms in cover until term sum is smaller or equal to upper bound.</span></div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span><span class="comment">// 4. Add the last item which violates the upper bound. This forms the smallest</span></div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span><span class="comment">// cover. Return the size of this cover.</span></div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span><span class="keywordtype">int</span> GetSmallestCoverSize(<span class="keyword">const</span> LinearConstraint&amp; constraint,</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="keyword">const</span> IntegerTrail&amp; integer_trail) {</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> IntegerValue ub = constraint.ub;</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> std::vector&lt;IntegerValue&gt; sorted_terms;</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; constraint.vars.size(); ++i) {</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = constraint.coeffs[i];</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = constraint.vars[i];</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="keyword">const</span> IntegerValue var_ub = integer_trail.LevelZeroUpperBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="keyword">const</span> IntegerValue var_lb = integer_trail.LevelZeroLowerBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> ub -= var_lb * <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>;</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> sorted_terms.push_back(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> * (var_ub - var_lb));</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> }</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> std::sort(sorted_terms.begin(), sorted_terms.end(),</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> std::greater&lt;IntegerValue&gt;());</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="keywordtype">int</span> smallest_cover_size = 0;</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> IntegerValue sorted_term_sum = IntegerValue(0);</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <span class="keywordflow">while</span> (sorted_term_sum &lt;= ub &amp;&amp;</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> smallest_cover_size &lt; constraint.vars.size()) {</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> sorted_term_sum += sorted_terms[smallest_cover_size++];</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> }</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="keywordflow">return</span> smallest_cover_size;</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span>}</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> </div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span><span class="keywordtype">bool</span> ConstraintIsEligibleForLifting(<span class="keyword">const</span> LinearConstraint&amp; constraint,</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="keyword">const</span> IntegerTrail&amp; integer_trail) {</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : constraint.vars) {</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="keywordflow">if</span> (integer_trail.LevelZeroLowerBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) != IntegerValue(0) ||</div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> integer_trail.LevelZeroUpperBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) != IntegerValue(1)) {</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> }</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> }</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</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">// namespace</span></div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> </div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#accb737ae1fad15d6798a4b8bc27cea51"> 187</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#accb737ae1fad15d6798a4b8bc27cea51">LiftKnapsackCut</a>(</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>&amp; constraint,</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values,</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="keyword">const</span> std::vector&lt;IntegerValue&gt;&amp; cut_vars_original_coefficients,</div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>&amp; integer_trail, <a class="code hl_class" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code hl_variable" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>,</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>* cut) {</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> absl::btree_set&lt;IntegerVariable&gt; vars_in_cut;</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <span class="keywordflow">for</span> (IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>) {</div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> vars_in_cut.insert(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</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> </div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> std::vector&lt;std::pair&lt;IntegerValue, IntegerVariable&gt;&gt; non_zero_vars;</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> std::vector&lt;std::pair&lt;IntegerValue, IntegerVariable&gt;&gt; zero_vars;</div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size(); ++i) {</div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i];</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="keywordflow">if</span> (integer_trail.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) != IntegerValue(0) ||</div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> integer_trail.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) != IntegerValue(1)) {</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> }</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="keywordflow">if</span> (vars_in_cut.find(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) != vars_in_cut.end()) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i];</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="keywordflow">if</span> (lp_values[<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] &lt;= 1e-6) {</div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> zero_vars.push_back({<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>});</div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> non_zero_vars.push_back({<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>});</div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> }</div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> }</div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> </div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="comment">// Decide lifting sequence (nonzeros, zeros in nonincreasing order</span></div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="comment">// of coefficient ).</span></div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> std::sort(non_zero_vars.rbegin(), non_zero_vars.rend());</div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> std::sort(zero_vars.rbegin(), zero_vars.rend());</div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> </div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> std::vector&lt;std::pair&lt;IntegerValue, IntegerVariable&gt;&gt; lifting_sequence(</div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> std::move(non_zero_vars));</div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> </div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> lifting_sequence.insert(lifting_sequence.end(), zero_vars.begin(),</div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> zero_vars.end());</div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> </div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="comment">// Form Knapsack.</span></div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> std::vector&lt;double&gt; lifting_profits;</div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> std::vector&lt;double&gt; lifting_weights;</div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size(); ++i) {</div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> lifting_profits.push_back(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i]));</div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> lifting_weights.push_back(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(cut_vars_original_coefficients[i]));</div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> }</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> </div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <span class="comment">// Lift the cut.</span></div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <span class="keywordtype">bool</span> is_lifted = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> <span class="keywordtype">bool</span> is_solution_optimal = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <a class="code hl_class" href="classoperations__research_1_1_knapsack_solver_for_cuts.html">KnapsackSolverForCuts</a> knapsack_solver(<span class="stringliteral">&quot;Knapsack cut lifter&quot;</span>);</div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> entry : lifting_sequence) {</div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> is_solution_optimal = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="keyword">const</span> IntegerValue var_original_coeff = entry.first;</div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = entry.second;</div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <span class="keyword">const</span> IntegerValue lifting_capacity = constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> - entry.first;</div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <span class="keywordflow">if</span> (lifting_capacity &lt;= IntegerValue(0)) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> knapsack_solver.<a class="code hl_function" href="classoperations__research_1_1_knapsack_solver_for_cuts.html#a902b91803b24fe467929767c65b6ee4f">Init</a>(lifting_profits, lifting_weights,</div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(lifting_capacity));</div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> knapsack_solver.<a class="code hl_function" href="classoperations__research_1_1_knapsack_solver_for_cuts.html#a4bcd14198cbb6f2c3bea61c85015e07a">set_node_limit</a>(100);</div>
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> <span class="comment">// NOTE: Since all profits and weights are integer, solution of</span></div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="comment">// knapsack is also integer.</span></div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <span class="comment">// TODO(user): Use an integer solver or heuristic.</span></div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> knapsack_solver.<a class="code hl_function" href="classoperations__research_1_1_knapsack_solver_for_cuts.html#aab4a9c689632460b6b96f3d4bf22f86e">Solve</a>(<a class="code hl_variable" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>, &amp;is_solution_optimal);</div>
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="keyword">const</span> <span class="keywordtype">double</span> knapsack_upper_bound =</div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> std::round(knapsack_solver.<a class="code hl_function" href="classoperations__research_1_1_knapsack_solver_for_cuts.html#afa66a5ae5f09a131d7fdb338b8a212ba">GetUpperBound</a>());</div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <span class="keyword">const</span> IntegerValue cut_coeff =</div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> - <span class="keyword">static_cast&lt;</span>int64_t<span class="keyword">&gt;</span>(knapsack_upper_bound);</div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <span class="keywordflow">if</span> (cut_coeff &gt; IntegerValue(0)) {</div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> is_lifted = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.push_back(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>.push_back(cut_coeff);</div>
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> lifting_profits.push_back(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(cut_coeff));</div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> lifting_weights.push_back(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(var_original_coeff));</div>
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> }</div>
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> }</div>
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> <span class="keywordflow">return</span> is_lifted;</div>
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span>}</div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> </div>
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a1de556a1559f25bd0819655d375f6c8e"> 266</a></span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1de556a1559f25bd0819655d375f6c8e">GetPreprocessedLinearConstraint</a>(</div>
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>&amp; constraint,</div>
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values,</div>
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>&amp; integer_trail) {</div>
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> IntegerValue ub = constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>;</div>
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> constraint_with_left_vars;</div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size(); ++i) {</div>
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> <span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i];</div>
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> <span class="keyword">const</span> IntegerValue var_ub = integer_trail.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i];</div>
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(var_ub) - lp_values[<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] &lt;= 1.0 - kMinCutViolation) {</div>
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> constraint_with_left_vars.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.push_back(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> constraint_with_left_vars.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>.push_back(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>);</div>
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <span class="comment">// Variable not in cut</span></div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> <span class="keyword">const</span> IntegerValue var_lb = integer_trail.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> ub -= <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> * var_lb;</div>
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> }</div>
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> }</div>
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> constraint_with_left_vars.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> = ub;</div>
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> constraint_with_left_vars.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a> = constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a>;</div>
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="keywordflow">return</span> constraint_with_left_vars;</div>
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span>}</div>
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> </div>
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ac8b530afe36cf1521c919ca43429926d"> 290</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ac8b530afe36cf1521c919ca43429926d">ConstraintIsTriviallyTrue</a>(<span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>&amp; constraint,</div>
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>&amp; integer_trail) {</div>
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> IntegerValue term_sum = IntegerValue(0);</div>
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size(); ++i) {</div>
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i];</div>
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <span class="keyword">const</span> IntegerValue var_ub = integer_trail.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i];</div>
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> term_sum += <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> * var_ub;</div>
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> }</div>
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="keywordflow">if</span> (term_sum &lt;= constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>) {</div>
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) &lt;&lt; <span class="stringliteral">&quot;Filtered by cover filter&quot;</span>;</div>
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> }</div>
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span>}</div>
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> </div>
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a588b516182cd6d5d8c048dfd76bc5523"> 306</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a588b516182cd6d5d8c048dfd76bc5523">CanBeFilteredUsingCutLowerBound</a>(</div>
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>&amp; preprocessed_constraint,</div>
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values,</div>
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>&amp; integer_trail) {</div>
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> std::vector&lt;double&gt; variable_upper_bound_distances;</div>
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : preprocessed_constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>) {</div>
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> <span class="keyword">const</span> IntegerValue var_ub = integer_trail.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> variable_upper_bound_distances.push_back(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(var_ub) - lp_values[<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]);</div>
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> }</div>
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> <span class="comment">// Compute the min cover size.</span></div>
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> <span class="keyword">const</span> <span class="keywordtype">int</span> smallest_cover_size =</div>
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> GetSmallestCoverSize(preprocessed_constraint, integer_trail);</div>
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> </div>
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> std::nth_element(</div>
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> variable_upper_bound_distances.begin(),</div>
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> variable_upper_bound_distances.begin() + smallest_cover_size - 1,</div>
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> variable_upper_bound_distances.end());</div>
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> <span class="keywordtype">double</span> cut_lower_bound = 0.0;</div>
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; smallest_cover_size; ++i) {</div>
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> cut_lower_bound += variable_upper_bound_distances[i];</div>
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> }</div>
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> <span class="keywordflow">if</span> (cut_lower_bound &gt;= 1.0 - kMinCutViolation) {</div>
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) &lt;&lt; <span class="stringliteral">&quot;Filtered by kappa heuristic&quot;</span>;</div>
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> }</div>
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span>}</div>
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> </div>
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a457076abfb3071fca80b8175363e3dfa"> 334</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a457076abfb3071fca80b8175363e3dfa">GetKnapsackUpperBound</a>(std::vector&lt;KnapsackItem&gt; items,</div>
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>) {</div>
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> <span class="comment">// Sort items by value by weight ratio.</span></div>
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> std::sort(items.begin(), items.end(), std::greater&lt;KnapsackItem&gt;());</div>
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> <span class="keywordtype">double</span> left_capacity = <a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>;</div>
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> <span class="keywordtype">double</span> profit = 0.0;</div>
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_knapsack_item.html">KnapsackItem</a> item : items) {</div>
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> <span class="keywordflow">if</span> (item.weight &lt;= left_capacity) {</div>
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> profit += item.profit;</div>
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> left_capacity -= item.weight;</div>
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> profit += (left_capacity / item.weight) * item.profit;</div>
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> }</div>
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> }</div>
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> <span class="keywordflow">return</span> profit;</div>
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span>}</div>
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> </div>
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a8c8db245a613f2fb46d917cd78100f83"> 352</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a8c8db245a613f2fb46d917cd78100f83">CanBeFilteredUsingKnapsackUpperBound</a>(</div>
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>&amp; constraint,</div>
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values,</div>
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>&amp; integer_trail) {</div>
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> std::vector&lt;KnapsackItem&gt; items;</div>
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a> = -<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>) - 1.0;</div>
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <span class="keywordtype">double</span> sum_variable_profit = 0;</div>
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size(); ++i) {</div>
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> <span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i];</div>
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> <span class="keyword">const</span> IntegerValue var_ub = integer_trail.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> <span class="keyword">const</span> IntegerValue var_lb = integer_trail.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i];</div>
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_knapsack_item.html">KnapsackItem</a> item;</div>
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> item.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_knapsack_item.html#a3ff84545f00a56ba7584b2a7f2cef69c">profit</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(var_ub) - lp_values[<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>];</div>
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> item.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_knapsack_item.html#a99108733d00274978a4979dc072bd513">weight</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> * (var_ub - var_lb));</div>
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> items.push_back(item);</div>
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> <a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a> += <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> * var_ub);</div>
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> sum_variable_profit += item.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_knapsack_item.html#a3ff84545f00a56ba7584b2a7f2cef69c">profit</a>;</div>
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> }</div>
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> </div>
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> <span class="comment">// Return early if the required upper bound is negative since all the profits</span></div>
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> <span class="comment">// are non negative.</span></div>
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> <span class="keywordflow">if</span> (sum_variable_profit - 1.0 + kMinCutViolation &lt; 0.0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> </div>
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> <span class="comment">// Get the knapsack upper bound.</span></div>
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> <span class="keyword">const</span> <span class="keywordtype">double</span> knapsack_upper_bound =</div>
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a457076abfb3071fca80b8175363e3dfa">GetKnapsackUpperBound</a>(std::move(items), <a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>);</div>
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> <span class="keywordflow">if</span> (knapsack_upper_bound &lt; sum_variable_profit - 1.0 + kMinCutViolation) {</div>
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) &lt;&lt; <span class="stringliteral">&quot;Filtered by knapsack upper bound&quot;</span>;</div>
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> }</div>
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span>}</div>
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> </div>
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a32f0016572d69bfcd1f3af811b2043ad"> 386</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a32f0016572d69bfcd1f3af811b2043ad">CanFormValidKnapsackCover</a>(</div>
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>&amp; preprocessed_constraint,</div>
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values,</div>
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>&amp; integer_trail) {</div>
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ac8b530afe36cf1521c919ca43429926d">ConstraintIsTriviallyTrue</a>(preprocessed_constraint, integer_trail)) {</div>
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> }</div>
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a588b516182cd6d5d8c048dfd76bc5523">CanBeFilteredUsingCutLowerBound</a>(preprocessed_constraint, lp_values,</div>
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> integer_trail)) {</div>
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> }</div>
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a8c8db245a613f2fb46d917cd78100f83">CanBeFilteredUsingKnapsackUpperBound</a>(preprocessed_constraint, lp_values,</div>
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> integer_trail)) {</div>
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> }</div>
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span>}</div>
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> </div>
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a06e2118f6735d033f7f43a939abe558d"> 404</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a06e2118f6735d033f7f43a939abe558d">ConvertToKnapsackForm</a>(<span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>&amp; constraint,</div>
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> std::vector&lt;LinearConstraint&gt;* knapsack_constraints,</div>
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail) {</div>
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> <span class="comment">// If all coefficient are the same, the generated knapsack cuts cannot be</span></div>
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> <span class="comment">// stronger than the constraint itself. However, when we substitute variables</span></div>
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> <span class="comment">// using the implication graph, this is not longer true. So we only skip</span></div>
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> <span class="comment">// constraints with same coeff and no substitutions.</span></div>
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> <span class="keywordflow">if</span> (SmallRangeAndAllCoefficientsMagnitudeAreTheSame(constraint,</div>
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> integer_trail)) {</div>
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span> }</div>
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> <span class="keywordflow">if</span> (constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> &lt; <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>) {</div>
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> canonical_knapsack_form;</div>
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> </div>
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> <span class="comment">// Negate the variables with negative coefficients.</span></div>
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size(); ++i) {</div>
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> <span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i];</div>
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i];</div>
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> &gt; IntegerValue(0)) {</div>
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> canonical_knapsack_form.<a class="code hl_function" href="structoperations__research_1_1sat_1_1_linear_constraint.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>);</div>
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> canonical_knapsack_form.<a class="code hl_function" href="structoperations__research_1_1sat_1_1_linear_constraint.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>), -<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>);</div>
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> }</div>
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> }</div>
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> canonical_knapsack_form.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> = constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>;</div>
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> canonical_knapsack_form.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5316808a2d5007c3b489e844801385e5">kMinIntegerValue</a>;</div>
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> knapsack_constraints-&gt;push_back(canonical_knapsack_form);</div>
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> }</div>
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> </div>
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> <span class="keywordflow">if</span> (constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a> &gt; <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5316808a2d5007c3b489e844801385e5">kMinIntegerValue</a>) {</div>
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> canonical_knapsack_form;</div>
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> </div>
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> <span class="comment">// Negate the variables with positive coefficients.</span></div>
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size(); ++i) {</div>
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> <span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i];</div>
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i];</div>
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> &gt; IntegerValue(0)) {</div>
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> canonical_knapsack_form.<a class="code hl_function" href="structoperations__research_1_1sat_1_1_linear_constraint.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>), <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>);</div>
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> canonical_knapsack_form.<a class="code hl_function" href="structoperations__research_1_1sat_1_1_linear_constraint.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, -<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>);</div>
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> }</div>
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> }</div>
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> canonical_knapsack_form.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> = -constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a>;</div>
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span> canonical_knapsack_form.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5316808a2d5007c3b489e844801385e5">kMinIntegerValue</a>;</div>
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> knapsack_constraints-&gt;push_back(canonical_knapsack_form);</div>
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> }</div>
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span>}</div>
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> </div>
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span><span class="comment">// TODO(user): This is no longer used as we try to separate all cut with</span></div>
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span><span class="comment">// knapsack now, remove.</span></div>
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ac158f737c8653b1fc1bd294ea2d3412d"> 454</a></span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ac158f737c8653b1fc1bd294ea2d3412d">CreateKnapsackCoverCutGenerator</a>(</div>
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span> <span class="keyword">const</span> std::vector&lt;LinearConstraint&gt;&amp; base_constraints,</div>
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> <span class="keyword">const</span> std::vector&lt;IntegerVariable&gt;&amp; vars, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"> 457</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div>
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a> = vars;</div>
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> </div>
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>-&gt;GetOrCreate&lt;<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>&gt;();</div>
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> std::vector&lt;LinearConstraint&gt; knapsack_constraints;</div>
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>&amp; constraint : base_constraints) {</div>
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> <span class="comment">// There is often a lot of small linear base constraints and it doesn&#39;t seem</span></div>
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> <span class="comment">// super useful to generate cuts for constraints of size 2. Any valid cut</span></div>
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> <span class="comment">// of size 1 should be already infered by the propagation.</span></div>
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> <span class="comment">//</span></div>
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> <span class="comment">// TODO(user): The case of size 2 is a bit less clear. investigate more if</span></div>
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> <span class="comment">// it is useful.</span></div>
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> <span class="keywordflow">if</span> (constraint.vars.size() &lt;= 2) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span> </div>
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a06e2118f6735d033f7f43a939abe558d">ConvertToKnapsackForm</a>(constraint, &amp;knapsack_constraints, integer_trail);</div>
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> }</div>
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) &lt;&lt; <span class="stringliteral">&quot;#knapsack constraints: &quot;</span> &lt;&lt; knapsack_constraints.size();</div>
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span> </div>
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"> 475</span> <span class="comment">// Note(user): for Knapsack cuts, it seems always advantageous to replace a</span></div>
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> <span class="comment">// variable X by a TIGHT lower bound of the form &quot;coeff * binary + lb&quot;. This</span></div>
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span> <span class="comment">// will not change &quot;covers&quot; but can only result in more violation by the</span></div>
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> <span class="comment">// current LP solution.</span></div>
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"> 479</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html">ImpliedBoundsProcessor</a> implied_bounds_processor(</div>
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> vars, integer_trail, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>-&gt;GetOrCreate&lt;<a class="code hl_class" href="classoperations__research_1_1sat_1_1_implied_bounds.html">ImpliedBounds</a>&gt;());</div>
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span> </div>
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> <span class="comment">// TODO(user): do not add generator if there are no knapsack constraints.</span></div>
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">generate_cuts</a> = [implied_bounds_processor, knapsack_constraints, vars,</div>
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, integer_trail](</div>
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp;</div>
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> lp_values,</div>
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) <span class="keyword">mutable</span> {</div>
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> <span class="comment">// TODO(user): When we use implied-bound substitution, we might still infer</span></div>
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> <span class="comment">// an interesting cut even if all variables are integer. See if we still</span></div>
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> <span class="comment">// want to skip all such constraints.</span></div>
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> <span class="keywordflow">if</span> (AllVarsTakeIntegerValue(vars, lp_values)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> </div>
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> <a class="code hl_class" href="classoperations__research_1_1_knapsack_solver_for_cuts.html">KnapsackSolverForCuts</a> knapsack_solver(</div>
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> <span class="stringliteral">&quot;Knapsack on demand cover cut generator&quot;</span>);</div>
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> int64_t skipped_constraints = 0;</div>
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> mutable_constraint;</div>
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> </div>
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> <span class="comment">// Iterate through all knapsack constraints.</span></div>
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span> implied_bounds_processor.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#ab354ebe396f7f5ad0c79ff2a928d9a40">RecomputeCacheAndSeparateSomeImpliedBoundCuts</a>(</div>
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno"> 500</span> lp_values);</div>
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno"> 501</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>&amp; constraint : knapsack_constraints) {</div>
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"> 502</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>-&gt;GetOrCreate&lt;<a class="code hl_class" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>&gt;()-&gt;<a class="code hl_function" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>()) <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno"> 503</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) &lt;&lt; <span class="stringliteral">&quot;Processing constraint: &quot;</span> &lt;&lt; constraint.DebugString();</div>
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> </div>
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span> mutable_constraint = constraint;</div>
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> implied_bounds_processor.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#a7fb8d0b24091252e79aea6e5666f29e8">ProcessUpperBoundedConstraint</a>(</div>
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span> lp_values, &amp;mutable_constraint);</div>
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5d3aa6734674f8f81aac3895cde58d6d">MakeAllCoefficientsPositive</a>(&amp;mutable_constraint);</div>
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span> </div>
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> preprocessed_constraint =</div>
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1de556a1559f25bd0819655d375f6c8e">GetPreprocessedLinearConstraint</a>(mutable_constraint, lp_values,</div>
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</span> *integer_trail);</div>
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span> <span class="keywordflow">if</span> (preprocessed_constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.empty()) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"> 514</span> </div>
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"> 515</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a32f0016572d69bfcd1f3af811b2043ad">CanFormValidKnapsackCover</a>(preprocessed_constraint, lp_values,</div>
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno"> 516</span> *integer_trail)) {</div>
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> skipped_constraints++;</div>
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"> 519</span> }</div>
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"> 520</span> </div>
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno"> 521</span> <span class="comment">// Profits are (upper_bounds[i] - lp_values[i]) for knapsack variables.</span></div>
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"> 522</span> std::vector&lt;double&gt; profits;</div>
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> profits.reserve(preprocessed_constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size());</div>
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"> 524</span> </div>
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> <span class="comment">// Weights are (coeffs[i] * (upper_bound[i] - lower_bound[i])).</span></div>
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"> 526</span> std::vector&lt;double&gt; weights;</div>
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno"> 527</span> weights.reserve(preprocessed_constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size());</div>
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"> 528</span> </div>
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno"> 529</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a> = -<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(preprocessed_constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>) - 1.0;</div>
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno"> 530</span> </div>
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"> 531</span> <span class="comment">// Compute and store the sum of variable profits. This is the constant</span></div>
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno"> 532</span> <span class="comment">// part of the objective of the problem we are trying to solve. Hence</span></div>
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno"> 533</span> <span class="comment">// this part is not supplied to the knapsack_solver and is subtracted</span></div>
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"> 534</span> <span class="comment">// when we receive the knapsack solution.</span></div>
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno"> 535</span> <span class="keywordtype">double</span> sum_variable_profit = 0;</div>
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno"> 536</span> </div>
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"> 537</span> <span class="comment">// Compute the profits, the weights and the capacity for the knapsack</span></div>
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno"> 538</span> <span class="comment">// instance.</span></div>
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno"> 539</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; preprocessed_constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size(); ++i) {</div>
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"> 540</span> <span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = preprocessed_constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i];</div>
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno"> 541</span> <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(preprocessed_constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i]);</div>
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno"> 542</span> <span class="keyword">const</span> <span class="keywordtype">double</span> var_ub = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail-&gt;<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno"> 543</span> <span class="keyword">const</span> <span class="keywordtype">double</span> var_lb = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail-&gt;<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno"> 544</span> <span class="keyword">const</span> <span class="keywordtype">double</span> variable_profit = var_ub - lp_values[<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>];</div>
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno"> 545</span> profits.push_back(variable_profit);</div>
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno"> 546</span> </div>
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> sum_variable_profit += variable_profit;</div>
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"> 548</span> </div>
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a> = <a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> * (var_ub - var_lb);</div>
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno"> 550</span> weights.push_back(<a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a>);</div>
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"> 551</span> <a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a> += <a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a> + <a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> * var_lb;</div>
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"> 552</span> }</div>
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a> &lt; 0.0) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno"> 554</span> </div>
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno"> 555</span> std::vector&lt;IntegerVariable&gt; cut_vars;</div>
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno"> 556</span> std::vector&lt;IntegerValue&gt; cut_vars_original_coefficients;</div>
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"> 557</span> </div>
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno"> 558</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) &lt;&lt; <span class="stringliteral">&quot;Knapsack size: &quot;</span> &lt;&lt; profits.size();</div>
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno"> 559</span> knapsack_solver.<a class="code hl_function" href="classoperations__research_1_1_knapsack_solver_for_cuts.html#a902b91803b24fe467929767c65b6ee4f">Init</a>(profits, weights, <a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>);</div>
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"> 560</span> </div>
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"> 561</span> <span class="comment">// Set the time limit for the knapsack solver.</span></div>
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno"> 562</span> <span class="keyword">const</span> <span class="keywordtype">double</span> time_limit_for_knapsack_solver =</div>
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno"> 563</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>-&gt;GetOrCreate&lt;<a class="code hl_class" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>&gt;()-&gt;GetTimeLeft();</div>
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno"> 564</span> </div>
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno"> 565</span> <span class="comment">// Solve the instance and subtract the constant part to compute the</span></div>
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno"> 566</span> <span class="comment">// sum_of_distance_to_ub_for_vars_in_cover.</span></div>
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno"> 567</span> <span class="comment">// TODO(user): Consider solving the instance approximately.</span></div>
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno"> 568</span> <span class="keywordtype">bool</span> is_solution_optimal = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno"> 569</span> knapsack_solver.<a class="code hl_function" href="classoperations__research_1_1_knapsack_solver_for_cuts.html#afd53920302b4dcd6ef445bc52a001a5b">set_solution_upper_bound_threshold</a>(</div>
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno"> 570</span> sum_variable_profit - 1.0 + kMinCutViolation);</div>
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno"> 571</span> <span class="comment">// TODO(user): Consider providing lower bound threshold as</span></div>
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno"> 572</span> <span class="comment">// sum_variable_profit - 1.0 + kMinCutViolation.</span></div>
<div class="line"><a id="l00573" name="l00573"></a><span class="lineno"> 573</span> <span class="comment">// TODO(user): Set node limit for knapsack solver.</span></div>
<div class="line"><a id="l00574" name="l00574"></a><span class="lineno"> 574</span> <span class="keyword">auto</span> time_limit_for_solver =</div>
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno"> 575</span> absl::make_unique&lt;TimeLimit&gt;(time_limit_for_knapsack_solver);</div>
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno"> 576</span> <span class="keyword">const</span> <span class="keywordtype">double</span> sum_of_distance_to_ub_for_vars_in_cover =</div>
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"> 577</span> sum_variable_profit -</div>
<div class="line"><a id="l00578" name="l00578"></a><span class="lineno"> 578</span> knapsack_solver.<a class="code hl_function" href="classoperations__research_1_1_knapsack_solver_for_cuts.html#aab4a9c689632460b6b96f3d4bf22f86e">Solve</a>(time_limit_for_solver.get(),</div>
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno"> 579</span> &amp;is_solution_optimal);</div>
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno"> 580</span> <span class="keywordflow">if</span> (is_solution_optimal) {</div>
<div class="line"><a id="l00581" name="l00581"></a><span class="lineno"> 581</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) &lt;&lt; <span class="stringliteral">&quot;Knapsack Optimal solution found yay !&quot;</span>;</div>
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno"> 582</span> }</div>
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno"> 583</span> <span class="keywordflow">if</span> (time_limit_for_solver-&gt;LimitReached()) {</div>
<div class="line"><a id="l00584" name="l00584"></a><span class="lineno"> 584</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) &lt;&lt; <span class="stringliteral">&quot;Knapsack Solver run out of time limit.&quot;</span>;</div>
<div class="line"><a id="l00585" name="l00585"></a><span class="lineno"> 585</span> }</div>
<div class="line"><a id="l00586" name="l00586"></a><span class="lineno"> 586</span> <span class="keywordflow">if</span> (sum_of_distance_to_ub_for_vars_in_cover &lt; 1.0 - kMinCutViolation) {</div>
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno"> 587</span> <span class="comment">// Constraint is eligible for the cover.</span></div>
<div class="line"><a id="l00588" name="l00588"></a><span class="lineno"> 588</span> </div>
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno"> 589</span> IntegerValue constraint_ub_for_cut = preprocessed_constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>;</div>
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno"> 590</span> absl::btree_set&lt;IntegerVariable&gt; vars_in_cut;</div>
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno"> 591</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; preprocessed_constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size(); ++i) {</div>
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno"> 592</span> <span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = preprocessed_constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i];</div>
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno"> 593</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> = preprocessed_constraint.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i];</div>
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno"> 594</span> <span class="keywordflow">if</span> (!knapsack_solver.<a class="code hl_function" href="classoperations__research_1_1_knapsack_solver_for_cuts.html#a3bd66bb6693c84e8b758c0d8a18ed9e5">best_solution</a>(i)) {</div>
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno"> 595</span> cut_vars.push_back(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno"> 596</span> cut_vars_original_coefficients.push_back(<a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>);</div>
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno"> 597</span> vars_in_cut.insert(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno"> 598</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno"> 599</span> <span class="keyword">const</span> IntegerValue var_lb = integer_trail-&gt;<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno"> 600</span> constraint_ub_for_cut -= <a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> * var_lb;</div>
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno"> 601</span> }</div>
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno"> 602</span> }</div>
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno"> 603</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> cut = GenerateKnapsackCutForCover(</div>
<div class="line"><a id="l00604" name="l00604"></a><span class="lineno"> 604</span> cut_vars, cut_vars_original_coefficients, constraint_ub_for_cut,</div>
<div class="line"><a id="l00605" name="l00605"></a><span class="lineno"> 605</span> *integer_trail);</div>
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno"> 606</span> </div>
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno"> 607</span> <span class="comment">// Check if the constraint has only binary variables.</span></div>
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno"> 608</span> <span class="keywordtype">bool</span> is_lifted = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno"> 609</span> <span class="keywordflow">if</span> (ConstraintIsEligibleForLifting(cut, *integer_trail)) {</div>
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno"> 610</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#accb737ae1fad15d6798a4b8bc27cea51">LiftKnapsackCut</a>(mutable_constraint, lp_values,</div>
<div class="line"><a id="l00611" name="l00611"></a><span class="lineno"> 611</span> cut_vars_original_coefficients, *integer_trail,</div>
<div class="line"><a id="l00612" name="l00612"></a><span class="lineno"> 612</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>-&gt;GetOrCreate&lt;<a class="code hl_class" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>&gt;(), &amp;cut)) {</div>
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno"> 613</span> is_lifted = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno"> 614</span> }</div>
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno"> 615</span> }</div>
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno"> 616</span> </div>
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno"> 617</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!SolutionSatisfiesConstraint(cut, lp_values));</div>
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno"> 618</span> manager-&gt;AddCut(cut, is_lifted ? <span class="stringliteral">&quot;LiftedKnapsack&quot;</span> : <span class="stringliteral">&quot;Knapsack&quot;</span>,</div>
<div class="line"><a id="l00619" name="l00619"></a><span class="lineno"> 619</span> lp_values);</div>
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno"> 620</span> }</div>
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno"> 621</span> }</div>
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno"> 622</span> <span class="keywordflow">if</span> (skipped_constraints &gt; 0) {</div>
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno"> 623</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) &lt;&lt; <span class="stringliteral">&quot;Skipped constraints: &quot;</span> &lt;&lt; skipped_constraints;</div>
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno"> 624</span> }</div>
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno"> 625</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno"> 626</span> };</div>
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno"> 627</span> </div>
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno"> 628</span> <span class="keywordflow">return</span> result;</div>
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno"> 629</span>}</div>
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno"> 630</span> </div>
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno"> 631</span><span class="comment">// Compute the larger t &lt;= max_t such that t * rhs_remainder &gt;= divisor / 2.</span></div>
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno"> 632</span><span class="comment">//</span></div>
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno"> 633</span><span class="comment">// This is just a separate function as it is slightly faster to compute the</span></div>
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno"> 634</span><span class="comment">// result only once.</span></div>
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a44bd0a015c444c2e2d58a002a09a1ea5"> 635</a></span>IntegerValue <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a44bd0a015c444c2e2d58a002a09a1ea5">GetFactorT</a>(IntegerValue rhs_remainder, IntegerValue divisor,</div>
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno"> 636</span> IntegerValue max_t) {</div>
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno"> 637</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(max_t, 1);</div>
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno"> 638</span> <span class="keywordflow">return</span> rhs_remainder == 0</div>
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno"> 639</span> ? max_t</div>
<div class="line"><a id="l00640" name="l00640"></a><span class="lineno"> 640</span> : <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(max_t, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(divisor / 2, rhs_remainder));</div>
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno"> 641</span>}</div>
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno"> 642</span> </div>
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a8e30df8580d6914abba28f43b6e4e667"> 643</a></span>std::function&lt;IntegerValue(IntegerValue)&gt; <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a8e30df8580d6914abba28f43b6e4e667">GetSuperAdditiveRoundingFunction</a>(</div>
<div class="line"><a id="l00644" name="l00644"></a><span class="lineno"> 644</span> IntegerValue rhs_remainder, IntegerValue divisor, IntegerValue t,</div>
<div class="line"><a id="l00645" name="l00645"></a><span class="lineno"> 645</span> IntegerValue max_scaling) {</div>
<div class="line"><a id="l00646" name="l00646"></a><span class="lineno"> 646</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(max_scaling, 1);</div>
<div class="line"><a id="l00647" name="l00647"></a><span class="lineno"> 647</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(t, 1);</div>
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno"> 648</span> </div>
<div class="line"><a id="l00649" name="l00649"></a><span class="lineno"> 649</span> <span class="comment">// Adjust after the multiplication by t.</span></div>
<div class="line"><a id="l00650" name="l00650"></a><span class="lineno"> 650</span> rhs_remainder *= t;</div>
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno"> 651</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(rhs_remainder, divisor);</div>
<div class="line"><a id="l00652" name="l00652"></a><span class="lineno"> 652</span> </div>
<div class="line"><a id="l00653" name="l00653"></a><span class="lineno"> 653</span> <span class="comment">// Make sure we don&#39;t have an integer overflow below. Note that we assume that</span></div>
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno"> 654</span> <span class="comment">// divisor and the maximum coeff magnitude are not too different (maybe a</span></div>
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno"> 655</span> <span class="comment">// factor 1000 at most) so that the final result will never overflow.</span></div>
<div class="line"><a id="l00656" name="l00656"></a><span class="lineno"> 656</span> max_scaling =</div>
<div class="line"><a id="l00657" name="l00657"></a><span class="lineno"> 657</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(max_scaling, <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits&lt;int64_t&gt;::max</a>() / divisor);</div>
<div class="line"><a id="l00658" name="l00658"></a><span class="lineno"> 658</span> </div>
<div class="line"><a id="l00659" name="l00659"></a><span class="lineno"> 659</span> <span class="keyword">const</span> IntegerValue size = divisor - rhs_remainder;</div>
<div class="line"><a id="l00660" name="l00660"></a><span class="lineno"> 660</span> <span class="keywordflow">if</span> (max_scaling == 1 || size == 1) {</div>
<div class="line"><a id="l00661" name="l00661"></a><span class="lineno"> 661</span> <span class="comment">// TODO(user): Use everywhere a two step computation to avoid overflow?</span></div>
<div class="line"><a id="l00662" name="l00662"></a><span class="lineno"> 662</span> <span class="comment">// First divide by divisor, then multiply by t. For now, we limit t so that</span></div>
<div class="line"><a id="l00663" name="l00663"></a><span class="lineno"> 663</span> <span class="comment">// we never have an overflow instead.</span></div>
<div class="line"><a id="l00664" name="l00664"></a><span class="lineno"> 664</span> <span class="keywordflow">return</span> [t, divisor](IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>) {</div>
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno"> 665</span> <span class="keywordflow">return</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(t * <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, divisor);</div>
<div class="line"><a id="l00666" name="l00666"></a><span class="lineno"> 666</span> };</div>
<div class="line"><a id="l00667" name="l00667"></a><span class="lineno"> 667</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size &lt;= max_scaling) {</div>
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno"> 668</span> <span class="keywordflow">return</span> [size, rhs_remainder, t, divisor](IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>) {</div>
<div class="line"><a id="l00669" name="l00669"></a><span class="lineno"> 669</span> <span class="keyword">const</span> IntegerValue t_coeff = t * <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>;</div>
<div class="line"><a id="l00670" name="l00670"></a><span class="lineno"> 670</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="revised__simplex_8cc.html#af01c50e388647c921aa7d9c77f2b72b2">ratio</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(t_coeff, divisor);</div>
<div class="line"><a id="l00671" name="l00671"></a><span class="lineno"> 671</span> <span class="keyword">const</span> IntegerValue remainder = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a83f714c395df7a814ed067125f567a0d">PositiveRemainder</a>(t_coeff, divisor);</div>
<div class="line"><a id="l00672" name="l00672"></a><span class="lineno"> 672</span> <span class="keyword">const</span> IntegerValue diff = remainder - rhs_remainder;</div>
<div class="line"><a id="l00673" name="l00673"></a><span class="lineno"> 673</span> <span class="keywordflow">return</span> size * <a class="code hl_variable" href="revised__simplex_8cc.html#af01c50e388647c921aa7d9c77f2b72b2">ratio</a> + <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(IntegerValue(0), diff);</div>
<div class="line"><a id="l00674" name="l00674"></a><span class="lineno"> 674</span> };</div>
<div class="line"><a id="l00675" name="l00675"></a><span class="lineno"> 675</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (max_scaling.value() * rhs_remainder.value() &lt; divisor) {</div>
<div class="line"><a id="l00676" name="l00676"></a><span class="lineno"> 676</span> <span class="comment">// Because of our max_t limitation, the rhs_remainder might stay small.</span></div>
<div class="line"><a id="l00677" name="l00677"></a><span class="lineno"> 677</span> <span class="comment">//</span></div>
<div class="line"><a id="l00678" name="l00678"></a><span class="lineno"> 678</span> <span class="comment">// If it is &quot;too small&quot; we cannot use the code below because it will not be</span></div>
<div class="line"><a id="l00679" name="l00679"></a><span class="lineno"> 679</span> <span class="comment">// valid. So we just divide divisor into max_scaling bucket. The</span></div>
<div class="line"><a id="l00680" name="l00680"></a><span class="lineno"> 680</span> <span class="comment">// rhs_remainder will be in the bucket 0.</span></div>
<div class="line"><a id="l00681" name="l00681"></a><span class="lineno"> 681</span> <span class="comment">//</span></div>
<div class="line"><a id="l00682" name="l00682"></a><span class="lineno"> 682</span> <span class="comment">// Note(user): This seems the same as just increasing t, modulo integer</span></div>
<div class="line"><a id="l00683" name="l00683"></a><span class="lineno"> 683</span> <span class="comment">// overflows. Maybe we should just always do the computation like this so</span></div>
<div class="line"><a id="l00684" name="l00684"></a><span class="lineno"> 684</span> <span class="comment">// that we can use larger t even if coeff is close to kint64max.</span></div>
<div class="line"><a id="l00685" name="l00685"></a><span class="lineno"> 685</span> <span class="keywordflow">return</span> [t, divisor, max_scaling](IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>) {</div>
<div class="line"><a id="l00686" name="l00686"></a><span class="lineno"> 686</span> <span class="keyword">const</span> IntegerValue t_coeff = t * <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>;</div>
<div class="line"><a id="l00687" name="l00687"></a><span class="lineno"> 687</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="revised__simplex_8cc.html#af01c50e388647c921aa7d9c77f2b72b2">ratio</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(t_coeff, divisor);</div>
<div class="line"><a id="l00688" name="l00688"></a><span class="lineno"> 688</span> <span class="keyword">const</span> IntegerValue remainder = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a83f714c395df7a814ed067125f567a0d">PositiveRemainder</a>(t_coeff, divisor);</div>
<div class="line"><a id="l00689" name="l00689"></a><span class="lineno"> 689</span> <span class="keyword">const</span> IntegerValue bucket = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(remainder * max_scaling, divisor);</div>
<div class="line"><a id="l00690" name="l00690"></a><span class="lineno"> 690</span> <span class="keywordflow">return</span> max_scaling * <a class="code hl_variable" href="revised__simplex_8cc.html#af01c50e388647c921aa7d9c77f2b72b2">ratio</a> + bucket;</div>
<div class="line"><a id="l00691" name="l00691"></a><span class="lineno"> 691</span> };</div>
<div class="line"><a id="l00692" name="l00692"></a><span class="lineno"> 692</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00693" name="l00693"></a><span class="lineno"> 693</span> <span class="comment">// We divide (size = divisor - rhs_remainder) into (max_scaling - 1) buckets</span></div>
<div class="line"><a id="l00694" name="l00694"></a><span class="lineno"> 694</span> <span class="comment">// and increase the function by 1 / max_scaling for each of them.</span></div>
<div class="line"><a id="l00695" name="l00695"></a><span class="lineno"> 695</span> <span class="comment">//</span></div>
<div class="line"><a id="l00696" name="l00696"></a><span class="lineno"> 696</span> <span class="comment">// Note that for different values of max_scaling, we get a family of</span></div>
<div class="line"><a id="l00697" name="l00697"></a><span class="lineno"> 697</span> <span class="comment">// functions that do not dominate each others. So potentially, a max scaling</span></div>
<div class="line"><a id="l00698" name="l00698"></a><span class="lineno"> 698</span> <span class="comment">// as low as 2 could lead to the better cut (this is exactly the Letchford &amp;</span></div>
<div class="line"><a id="l00699" name="l00699"></a><span class="lineno"> 699</span> <span class="comment">// Lodi function).</span></div>
<div class="line"><a id="l00700" name="l00700"></a><span class="lineno"> 700</span> <span class="comment">//</span></div>
<div class="line"><a id="l00701" name="l00701"></a><span class="lineno"> 701</span> <span class="comment">// Another interesting fact, is that if we want to compute the maximum alpha</span></div>
<div class="line"><a id="l00702" name="l00702"></a><span class="lineno"> 702</span> <span class="comment">// for a constraint with 2 terms like:</span></div>
<div class="line"><a id="l00703" name="l00703"></a><span class="lineno"> 703</span> <span class="comment">// divisor * Y + (ratio * divisor + remainder) * X</span></div>
<div class="line"><a id="l00704" name="l00704"></a><span class="lineno"> 704</span> <span class="comment">// &lt;= rhs_ratio * divisor + rhs_remainder</span></div>
<div class="line"><a id="l00705" name="l00705"></a><span class="lineno"> 705</span> <span class="comment">// so that we have the cut:</span></div>
<div class="line"><a id="l00706" name="l00706"></a><span class="lineno"> 706</span> <span class="comment">// Y + (ratio + alpha) * X &lt;= rhs_ratio</span></div>
<div class="line"><a id="l00707" name="l00707"></a><span class="lineno"> 707</span> <span class="comment">// This is the same as computing the maximum alpha such that for all integer</span></div>
<div class="line"><a id="l00708" name="l00708"></a><span class="lineno"> 708</span> <span class="comment">// X &gt; 0 we have CeilRatio(alpha * divisor * X, divisor)</span></div>
<div class="line"><a id="l00709" name="l00709"></a><span class="lineno"> 709</span> <span class="comment">// &lt;= CeilRatio(remainder * X - rhs_remainder, divisor).</span></div>
<div class="line"><a id="l00710" name="l00710"></a><span class="lineno"> 710</span> <span class="comment">// We can prove that this alpha is of the form (n - 1) / n, and it will</span></div>
<div class="line"><a id="l00711" name="l00711"></a><span class="lineno"> 711</span> <span class="comment">// be reached by such function for a max_scaling of n.</span></div>
<div class="line"><a id="l00712" name="l00712"></a><span class="lineno"> 712</span> <span class="comment">//</span></div>
<div class="line"><a id="l00713" name="l00713"></a><span class="lineno"> 713</span> <span class="comment">// TODO(user): This function is not always maximal when</span></div>
<div class="line"><a id="l00714" name="l00714"></a><span class="lineno"> 714</span> <span class="comment">// size % (max_scaling - 1) == 0. Improve?</span></div>
<div class="line"><a id="l00715" name="l00715"></a><span class="lineno"> 715</span> <span class="keywordflow">return</span> [size, rhs_remainder, t, divisor, max_scaling](IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>) {</div>
<div class="line"><a id="l00716" name="l00716"></a><span class="lineno"> 716</span> <span class="keyword">const</span> IntegerValue t_coeff = t * <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>;</div>
<div class="line"><a id="l00717" name="l00717"></a><span class="lineno"> 717</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="revised__simplex_8cc.html#af01c50e388647c921aa7d9c77f2b72b2">ratio</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(t_coeff, divisor);</div>
<div class="line"><a id="l00718" name="l00718"></a><span class="lineno"> 718</span> <span class="keyword">const</span> IntegerValue remainder = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a83f714c395df7a814ed067125f567a0d">PositiveRemainder</a>(t_coeff, divisor);</div>
<div class="line"><a id="l00719" name="l00719"></a><span class="lineno"> 719</span> <span class="keyword">const</span> IntegerValue diff = remainder - rhs_remainder;</div>
<div class="line"><a id="l00720" name="l00720"></a><span class="lineno"> 720</span> <span class="keyword">const</span> IntegerValue bucket =</div>
<div class="line"><a id="l00721" name="l00721"></a><span class="lineno"> 721</span> diff &gt; 0 ? <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(diff * (max_scaling - 1), size)</div>
<div class="line"><a id="l00722" name="l00722"></a><span class="lineno"> 722</span> : IntegerValue(0);</div>
<div class="line"><a id="l00723" name="l00723"></a><span class="lineno"> 723</span> <span class="keywordflow">return</span> max_scaling * <a class="code hl_variable" href="revised__simplex_8cc.html#af01c50e388647c921aa7d9c77f2b72b2">ratio</a> + bucket;</div>
<div class="line"><a id="l00724" name="l00724"></a><span class="lineno"> 724</span> };</div>
<div class="line"><a id="l00725" name="l00725"></a><span class="lineno"> 725</span> }</div>
<div class="line"><a id="l00726" name="l00726"></a><span class="lineno"> 726</span>}</div>
<div class="line"><a id="l00727" name="l00727"></a><span class="lineno"> 727</span> </div>
<div class="line"><a id="l00728" name="l00728"></a><span class="lineno"> 728</span><span class="comment">// TODO(user): This has been optimized a bit, but we can probably do even better</span></div>
<div class="line"><a id="l00729" name="l00729"></a><span class="lineno"> 729</span><span class="comment">// as it still takes around 25% percent of the run time when all the cuts are on</span></div>
<div class="line"><a id="l00730" name="l00730"></a><span class="lineno"> 730</span><span class="comment">// for the opm*mps.gz problems and others.</span></div>
<div class="line"><a id="l00731" name="l00731"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_integer_rounding_cut_helper.html#a66c8e6dc26260b69dcdf7668925dc3aa"> 731</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_rounding_cut_helper.html#a66c8e6dc26260b69dcdf7668925dc3aa">IntegerRoundingCutHelper::ComputeCut</a>(</div>
<div class="line"><a id="l00732" name="l00732"></a><span class="lineno"> 732</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_rounding_options.html">RoundingOptions</a> options, <span class="keyword">const</span> std::vector&lt;double&gt;&amp; lp_values,</div>
<div class="line"><a id="l00733" name="l00733"></a><span class="lineno"> 733</span> <span class="keyword">const</span> std::vector&lt;IntegerValue&gt;&amp; <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>,</div>
<div class="line"><a id="l00734" name="l00734"></a><span class="lineno"> 734</span> <span class="keyword">const</span> std::vector&lt;IntegerValue&gt;&amp; <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a88215c8581662c40eec0fb8621c44af3">upper_bounds</a>,</div>
<div class="line"><a id="l00735" name="l00735"></a><span class="lineno"> 735</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html">ImpliedBoundsProcessor</a>* ib_processor, <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>* cut) {</div>
<div class="line"><a id="l00736" name="l00736"></a><span class="lineno"> 736</span> <span class="keyword">const</span> <span class="keywordtype">int</span> size = lp_values.size();</div>
<div class="line"><a id="l00737" name="l00737"></a><span class="lineno"> 737</span> <span class="keywordflow">if</span> (size == 0) <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00738" name="l00738"></a><span class="lineno"> 738</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code hl_variable" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>.size(), size);</div>
<div class="line"><a id="l00739" name="l00739"></a><span class="lineno"> 739</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code hl_variable" href="sat_2lp__utils_8cc.html#a88215c8581662c40eec0fb8621c44af3">upper_bounds</a>.size(), size);</div>
<div class="line"><a id="l00740" name="l00740"></a><span class="lineno"> 740</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size(), size);</div>
<div class="line"><a id="l00741" name="l00741"></a><span class="lineno"> 741</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>.size(), size);</div>
<div class="line"><a id="l00742" name="l00742"></a><span class="lineno"> 742</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a>, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5316808a2d5007c3b489e844801385e5">kMinIntegerValue</a>);</div>
<div class="line"><a id="l00743" name="l00743"></a><span class="lineno"> 743</span> </div>
<div class="line"><a id="l00744" name="l00744"></a><span class="lineno"> 744</span> <span class="comment">// To optimize the computation of the best divisor below, we only need to</span></div>
<div class="line"><a id="l00745" name="l00745"></a><span class="lineno"> 745</span> <span class="comment">// look at the indices with a shifted lp value that is not close to zero.</span></div>
<div class="line"><a id="l00746" name="l00746"></a><span class="lineno"> 746</span> <span class="comment">//</span></div>
<div class="line"><a id="l00747" name="l00747"></a><span class="lineno"> 747</span> <span class="comment">// TODO(user): sort by decreasing lp_values so that our early abort test in</span></div>
<div class="line"><a id="l00748" name="l00748"></a><span class="lineno"> 748</span> <span class="comment">// the critical loop below has more chance of returning early? I tried but it</span></div>
<div class="line"><a id="l00749" name="l00749"></a><span class="lineno"> 749</span> <span class="comment">// didn&#39;t seems to change much though.</span></div>
<div class="line"><a id="l00750" name="l00750"></a><span class="lineno"> 750</span> relevant_indices_.clear();</div>
<div class="line"><a id="l00751" name="l00751"></a><span class="lineno"> 751</span> relevant_lp_values_.clear();</div>
<div class="line"><a id="l00752" name="l00752"></a><span class="lineno"> 752</span> relevant_coeffs_.clear();</div>
<div class="line"><a id="l00753" name="l00753"></a><span class="lineno"> 753</span> relevant_bound_diffs_.clear();</div>
<div class="line"><a id="l00754" name="l00754"></a><span class="lineno"> 754</span> divisors_.clear();</div>
<div class="line"><a id="l00755" name="l00755"></a><span class="lineno"> 755</span> adjusted_coeffs_.clear();</div>
<div class="line"><a id="l00756" name="l00756"></a><span class="lineno"> 756</span> </div>
<div class="line"><a id="l00757" name="l00757"></a><span class="lineno"> 757</span> <span class="comment">// Compute the maximum magnitude for non-fixed variables.</span></div>
<div class="line"><a id="l00758" name="l00758"></a><span class="lineno"> 758</span> IntegerValue max_magnitude(0);</div>
<div class="line"><a id="l00759" name="l00759"></a><span class="lineno"> 759</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><a id="l00760" name="l00760"></a><span class="lineno"> 760</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>[i] == <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a88215c8581662c40eec0fb8621c44af3">upper_bounds</a>[i]) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00761" name="l00761"></a><span class="lineno"> 761</span> <span class="keyword">const</span> IntegerValue magnitude = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i]);</div>
<div class="line"><a id="l00762" name="l00762"></a><span class="lineno"> 762</span> max_magnitude = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_magnitude, magnitude);</div>
<div class="line"><a id="l00763" name="l00763"></a><span class="lineno"> 763</span> }</div>
<div class="line"><a id="l00764" name="l00764"></a><span class="lineno"> 764</span> </div>
<div class="line"><a id="l00765" name="l00765"></a><span class="lineno"> 765</span> <span class="comment">// Shift each variable using its lower/upper bound so that no variable can</span></div>
<div class="line"><a id="l00766" name="l00766"></a><span class="lineno"> 766</span> <span class="comment">// change sign. We eventually do a change of variable to its negation so</span></div>
<div class="line"><a id="l00767" name="l00767"></a><span class="lineno"> 767</span> <span class="comment">// that all variable are non-negative.</span></div>
<div class="line"><a id="l00768" name="l00768"></a><span class="lineno"> 768</span> <span class="keywordtype">bool</span> overflow = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00769" name="l00769"></a><span class="lineno"> 769</span> change_sign_at_postprocessing_.assign(size, <span class="keyword">false</span>);</div>
<div class="line"><a id="l00770" name="l00770"></a><span class="lineno"> 770</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><a id="l00771" name="l00771"></a><span class="lineno"> 771</span> <span class="keywordflow">if</span> (cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i] == 0) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00772" name="l00772"></a><span class="lineno"> 772</span> <span class="keyword">const</span> IntegerValue magnitude = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i]);</div>
<div class="line"><a id="l00773" name="l00773"></a><span class="lineno"> 773</span> </div>
<div class="line"><a id="l00774" name="l00774"></a><span class="lineno"> 774</span> <span class="comment">// We might change them below.</span></div>
<div class="line"><a id="l00775" name="l00775"></a><span class="lineno"> 775</span> IntegerValue lb = <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>[i];</div>
<div class="line"><a id="l00776" name="l00776"></a><span class="lineno"> 776</span> <span class="keywordtype">double</span> lp_value = lp_values[i];</div>
<div class="line"><a id="l00777" name="l00777"></a><span class="lineno"> 777</span> </div>
<div class="line"><a id="l00778" name="l00778"></a><span class="lineno"> 778</span> <span class="keyword">const</span> IntegerValue ub = <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a88215c8581662c40eec0fb8621c44af3">upper_bounds</a>[i];</div>
<div class="line"><a id="l00779" name="l00779"></a><span class="lineno"> 779</span> <span class="keyword">const</span> IntegerValue bound_diff =</div>
<div class="line"><a id="l00780" name="l00780"></a><span class="lineno"> 780</span> IntegerValue(<a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(ub.value(), lb.value()));</div>
<div class="line"><a id="l00781" name="l00781"></a><span class="lineno"> 781</span> <span class="comment">// Note that since we use ToDouble() this code works fine with lb/ub at</span></div>
<div class="line"><a id="l00782" name="l00782"></a><span class="lineno"> 782</span> <span class="comment">// min/max integer value.</span></div>
<div class="line"><a id="l00783" name="l00783"></a><span class="lineno"> 783</span> <span class="comment">//</span></div>
<div class="line"><a id="l00784" name="l00784"></a><span class="lineno"> 784</span> <span class="comment">// TODO(user): Experiments with different heuristics. Other solver also</span></div>
<div class="line"><a id="l00785" name="l00785"></a><span class="lineno"> 785</span> <span class="comment">// seems to try a bunch of possibilities in a &quot;postprocess&quot; phase once</span></div>
<div class="line"><a id="l00786" name="l00786"></a><span class="lineno"> 786</span> <span class="comment">// the divisor is chosen. Try that.</span></div>
<div class="line"><a id="l00787" name="l00787"></a><span class="lineno"> 787</span> {</div>
<div class="line"><a id="l00788" name="l00788"></a><span class="lineno"> 788</span> <span class="comment">// when the magnitude of the entry become smaller and smaller we bias</span></div>
<div class="line"><a id="l00789" name="l00789"></a><span class="lineno"> 789</span> <span class="comment">// towards a positive coefficient. This is because after rounding this</span></div>
<div class="line"><a id="l00790" name="l00790"></a><span class="lineno"> 790</span> <span class="comment">// will likely become zero instead of -divisor and we need the lp value</span></div>
<div class="line"><a id="l00791" name="l00791"></a><span class="lineno"> 791</span> <span class="comment">// to be really close to its bound to compensate.</span></div>
<div class="line"><a id="l00792" name="l00792"></a><span class="lineno"> 792</span> <span class="keyword">const</span> <span class="keywordtype">double</span> lb_dist = std::abs(lp_value - <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(lb));</div>
<div class="line"><a id="l00793" name="l00793"></a><span class="lineno"> 793</span> <span class="keyword">const</span> <span class="keywordtype">double</span> ub_dist = std::abs(lp_value - <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(ub));</div>
<div class="line"><a id="l00794" name="l00794"></a><span class="lineno"> 794</span> <span class="keyword">const</span> <span class="keywordtype">double</span> bias =</div>
<div class="line"><a id="l00795" name="l00795"></a><span class="lineno"> 795</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(1.0, 0.1 * <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(max_magnitude) / <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(magnitude));</div>
<div class="line"><a id="l00796" name="l00796"></a><span class="lineno"> 796</span> <span class="keywordflow">if</span> ((bias * lb_dist &gt; ub_dist &amp;&amp; cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i] &lt; 0) ||</div>
<div class="line"><a id="l00797" name="l00797"></a><span class="lineno"> 797</span> (lb_dist &gt; bias * ub_dist &amp;&amp; cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i] &gt; 0)) {</div>
<div class="line"><a id="l00798" name="l00798"></a><span class="lineno"> 798</span> change_sign_at_postprocessing_[i] = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00799" name="l00799"></a><span class="lineno"> 799</span> cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i] = -cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i];</div>
<div class="line"><a id="l00800" name="l00800"></a><span class="lineno"> 800</span> lp_value = -lp_value;</div>
<div class="line"><a id="l00801" name="l00801"></a><span class="lineno"> 801</span> lb = -ub;</div>
<div class="line"><a id="l00802" name="l00802"></a><span class="lineno"> 802</span> }</div>
<div class="line"><a id="l00803" name="l00803"></a><span class="lineno"> 803</span> }</div>
<div class="line"><a id="l00804" name="l00804"></a><span class="lineno"> 804</span> </div>
<div class="line"><a id="l00805" name="l00805"></a><span class="lineno"> 805</span> <span class="comment">// Always shift to lb.</span></div>
<div class="line"><a id="l00806" name="l00806"></a><span class="lineno"> 806</span> <span class="comment">// coeff * X = coeff * (X - shift) + coeff * shift.</span></div>
<div class="line"><a id="l00807" name="l00807"></a><span class="lineno"> 807</span> lp_value -= <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(lb);</div>
<div class="line"><a id="l00808" name="l00808"></a><span class="lineno"> 808</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">AddProductTo</a>(-cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i], lb, &amp;cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>)) {</div>
<div class="line"><a id="l00809" name="l00809"></a><span class="lineno"> 809</span> overflow = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00810" name="l00810"></a><span class="lineno"> 810</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00811" name="l00811"></a><span class="lineno"> 811</span> }</div>
<div class="line"><a id="l00812" name="l00812"></a><span class="lineno"> 812</span> </div>
<div class="line"><a id="l00813" name="l00813"></a><span class="lineno"> 813</span> <span class="comment">// Deal with fixed variable, no need to shift back in this case, we can</span></div>
<div class="line"><a id="l00814" name="l00814"></a><span class="lineno"> 814</span> <span class="comment">// just remove the term.</span></div>
<div class="line"><a id="l00815" name="l00815"></a><span class="lineno"> 815</span> <span class="keywordflow">if</span> (bound_diff == 0) {</div>
<div class="line"><a id="l00816" name="l00816"></a><span class="lineno"> 816</span> cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i] = IntegerValue(0);</div>
<div class="line"><a id="l00817" name="l00817"></a><span class="lineno"> 817</span> lp_value = 0.0;</div>
<div class="line"><a id="l00818" name="l00818"></a><span class="lineno"> 818</span> }</div>
<div class="line"><a id="l00819" name="l00819"></a><span class="lineno"> 819</span> </div>
<div class="line"><a id="l00820" name="l00820"></a><span class="lineno"> 820</span> <span class="keywordflow">if</span> (std::abs(lp_value) &gt; 1e-2) {</div>
<div class="line"><a id="l00821" name="l00821"></a><span class="lineno"> 821</span> relevant_coeffs_.push_back(cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i]);</div>
<div class="line"><a id="l00822" name="l00822"></a><span class="lineno"> 822</span> relevant_indices_.push_back(i);</div>
<div class="line"><a id="l00823" name="l00823"></a><span class="lineno"> 823</span> relevant_lp_values_.push_back(lp_value);</div>
<div class="line"><a id="l00824" name="l00824"></a><span class="lineno"> 824</span> relevant_bound_diffs_.push_back(bound_diff);</div>
<div class="line"><a id="l00825" name="l00825"></a><span class="lineno"> 825</span> divisors_.push_back(magnitude);</div>
<div class="line"><a id="l00826" name="l00826"></a><span class="lineno"> 826</span> }</div>
<div class="line"><a id="l00827" name="l00827"></a><span class="lineno"> 827</span> }</div>
<div class="line"><a id="l00828" name="l00828"></a><span class="lineno"> 828</span> </div>
<div class="line"><a id="l00829" name="l00829"></a><span class="lineno"> 829</span> <span class="comment">// TODO(user): Maybe this shouldn&#39;t be called on such constraint.</span></div>
<div class="line"><a id="l00830" name="l00830"></a><span class="lineno"> 830</span> <span class="keywordflow">if</span> (relevant_coeffs_.empty()) {</div>
<div class="line"><a id="l00831" name="l00831"></a><span class="lineno"> 831</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) &lt;&lt; <span class="stringliteral">&quot;Issue, nothing to cut.&quot;</span>;</div>
<div class="line"><a id="l00832" name="l00832"></a><span class="lineno"> 832</span> *cut = <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>(IntegerValue(0), IntegerValue(0));</div>
<div class="line"><a id="l00833" name="l00833"></a><span class="lineno"> 833</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00834" name="l00834"></a><span class="lineno"> 834</span> }</div>
<div class="line"><a id="l00835" name="l00835"></a><span class="lineno"> 835</span> <a class="code hl_define" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(max_magnitude, 0);</div>
<div class="line"><a id="l00836" name="l00836"></a><span class="lineno"> 836</span> </div>
<div class="line"><a id="l00837" name="l00837"></a><span class="lineno"> 837</span> <span class="comment">// Our heuristic will try to generate a few different cuts, and we will keep</span></div>
<div class="line"><a id="l00838" name="l00838"></a><span class="lineno"> 838</span> <span class="comment">// the most violated one scaled by the l2 norm of the relevant position.</span></div>
<div class="line"><a id="l00839" name="l00839"></a><span class="lineno"> 839</span> <span class="comment">//</span></div>
<div class="line"><a id="l00840" name="l00840"></a><span class="lineno"> 840</span> <span class="comment">// TODO(user): Experiment for the best value of this initial violation</span></div>
<div class="line"><a id="l00841" name="l00841"></a><span class="lineno"> 841</span> <span class="comment">// threshold. Note also that we use the l2 norm on the restricted position</span></div>
<div class="line"><a id="l00842" name="l00842"></a><span class="lineno"> 842</span> <span class="comment">// here. Maybe we should change that? On that note, the L2 norm usage seems a</span></div>
<div class="line"><a id="l00843" name="l00843"></a><span class="lineno"> 843</span> <span class="comment">// bit weird to me since it grows with the number of term in the cut. And</span></div>
<div class="line"><a id="l00844" name="l00844"></a><span class="lineno"> 844</span> <span class="comment">// often, we already have a good cut, and we make it stronger by adding extra</span></div>
<div class="line"><a id="l00845" name="l00845"></a><span class="lineno"> 845</span> <span class="comment">// terms that do not change its activity.</span></div>
<div class="line"><a id="l00846" name="l00846"></a><span class="lineno"> 846</span> <span class="comment">//</span></div>
<div class="line"><a id="l00847" name="l00847"></a><span class="lineno"> 847</span> <span class="comment">// The discussion above only concern the best_scaled_violation initial value.</span></div>
<div class="line"><a id="l00848" name="l00848"></a><span class="lineno"> 848</span> <span class="comment">// The remainder_threshold allows to not consider cuts for which the final</span></div>
<div class="line"><a id="l00849" name="l00849"></a><span class="lineno"> 849</span> <span class="comment">// efficacity is clearly lower than 1e-3 (it is a bound, so we could generate</span></div>
<div class="line"><a id="l00850" name="l00850"></a><span class="lineno"> 850</span> <span class="comment">// cuts with a lower efficacity than this).</span></div>
<div class="line"><a id="l00851" name="l00851"></a><span class="lineno"> 851</span> <span class="keywordtype">double</span> best_scaled_violation = 0.01;</div>
<div class="line"><a id="l00852" name="l00852"></a><span class="lineno"> 852</span> <span class="keyword">const</span> IntegerValue remainder_threshold(max_magnitude / 1000);</div>
<div class="line"><a id="l00853" name="l00853"></a><span class="lineno"> 853</span> </div>
<div class="line"><a id="l00854" name="l00854"></a><span class="lineno"> 854</span> <span class="comment">// The cut-&gt;ub might have grown quite a bit with the bound substitution, so</span></div>
<div class="line"><a id="l00855" name="l00855"></a><span class="lineno"> 855</span> <span class="comment">// we need to include it too since we will apply the rounding function on it.</span></div>
<div class="line"><a id="l00856" name="l00856"></a><span class="lineno"> 856</span> max_magnitude = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_magnitude, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>));</div>
<div class="line"><a id="l00857" name="l00857"></a><span class="lineno"> 857</span> </div>
<div class="line"><a id="l00858" name="l00858"></a><span class="lineno"> 858</span> <span class="comment">// Make sure that when we multiply the rhs or the coefficient by a factor t,</span></div>
<div class="line"><a id="l00859" name="l00859"></a><span class="lineno"> 859</span> <span class="comment">// we do not have an integer overflow. Actually, we need a bit more room</span></div>
<div class="line"><a id="l00860" name="l00860"></a><span class="lineno"> 860</span> <span class="comment">// because we might round down a value to the next multiple of</span></div>
<div class="line"><a id="l00861" name="l00861"></a><span class="lineno"> 861</span> <span class="comment">// max_magnitude.</span></div>
<div class="line"><a id="l00862" name="l00862"></a><span class="lineno"> 862</span> <span class="keyword">const</span> IntegerValue threshold = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a> / 2;</div>
<div class="line"><a id="l00863" name="l00863"></a><span class="lineno"> 863</span> <span class="keywordflow">if</span> (overflow || max_magnitude &gt;= threshold) {</div>
<div class="line"><a id="l00864" name="l00864"></a><span class="lineno"> 864</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) &lt;&lt; <span class="stringliteral">&quot;Issue, overflow.&quot;</span>;</div>
<div class="line"><a id="l00865" name="l00865"></a><span class="lineno"> 865</span> *cut = <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>(IntegerValue(0), IntegerValue(0));</div>
<div class="line"><a id="l00866" name="l00866"></a><span class="lineno"> 866</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00867" name="l00867"></a><span class="lineno"> 867</span> }</div>
<div class="line"><a id="l00868" name="l00868"></a><span class="lineno"> 868</span> <span class="keyword">const</span> IntegerValue max_t = threshold / max_magnitude;</div>
<div class="line"><a id="l00869" name="l00869"></a><span class="lineno"> 869</span> </div>
<div class="line"><a id="l00870" name="l00870"></a><span class="lineno"> 870</span> <span class="comment">// There is no point trying twice the same divisor or a divisor that is too</span></div>
<div class="line"><a id="l00871" name="l00871"></a><span class="lineno"> 871</span> <span class="comment">// small. Note that we use a higher threshold than the remainder_threshold</span></div>
<div class="line"><a id="l00872" name="l00872"></a><span class="lineno"> 872</span> <span class="comment">// because we can boost the remainder thanks to our adjusting heuristic below</span></div>
<div class="line"><a id="l00873" name="l00873"></a><span class="lineno"> 873</span> <span class="comment">// and also because this allows to have cuts with a small range of</span></div>
<div class="line"><a id="l00874" name="l00874"></a><span class="lineno"> 874</span> <span class="comment">// coefficients.</span></div>
<div class="line"><a id="l00875" name="l00875"></a><span class="lineno"> 875</span> <span class="comment">//</span></div>
<div class="line"><a id="l00876" name="l00876"></a><span class="lineno"> 876</span> <span class="comment">// TODO(user): Note that the std::sort() is visible in some cpu profile.</span></div>
<div class="line"><a id="l00877" name="l00877"></a><span class="lineno"> 877</span> {</div>
<div class="line"><a id="l00878" name="l00878"></a><span class="lineno"> 878</span> <span class="keywordtype">int</span> new_size = 0;</div>
<div class="line"><a id="l00879" name="l00879"></a><span class="lineno"> 879</span> <span class="keyword">const</span> IntegerValue divisor_threshold = max_magnitude / 10;</div>
<div class="line"><a id="l00880" name="l00880"></a><span class="lineno"> 880</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; divisors_.size(); ++i) {</div>
<div class="line"><a id="l00881" name="l00881"></a><span class="lineno"> 881</span> <span class="keywordflow">if</span> (divisors_[i] &lt;= divisor_threshold) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00882" name="l00882"></a><span class="lineno"> 882</span> divisors_[new_size++] = divisors_[i];</div>
<div class="line"><a id="l00883" name="l00883"></a><span class="lineno"> 883</span> }</div>
<div class="line"><a id="l00884" name="l00884"></a><span class="lineno"> 884</span> divisors_.resize(new_size);</div>
<div class="line"><a id="l00885" name="l00885"></a><span class="lineno"> 885</span> }</div>
<div class="line"><a id="l00886" name="l00886"></a><span class="lineno"> 886</span> <a class="code hl_function" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&amp;divisors_, std::greater&lt;IntegerValue&gt;());</div>
<div class="line"><a id="l00887" name="l00887"></a><span class="lineno"> 887</span> </div>
<div class="line"><a id="l00888" name="l00888"></a><span class="lineno"> 888</span> <span class="comment">// TODO(user): Avoid quadratic algorithm? Note that we are quadratic in</span></div>
<div class="line"><a id="l00889" name="l00889"></a><span class="lineno"> 889</span> <span class="comment">// relevant_indices not the full cut-&gt;coeffs.size(), but this is still too</span></div>
<div class="line"><a id="l00890" name="l00890"></a><span class="lineno"> 890</span> <span class="comment">// much on some problems.</span></div>
<div class="line"><a id="l00891" name="l00891"></a><span class="lineno"> 891</span> IntegerValue best_divisor(0);</div>
<div class="line"><a id="l00892" name="l00892"></a><span class="lineno"> 892</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerValue divisor : divisors_) {</div>
<div class="line"><a id="l00893" name="l00893"></a><span class="lineno"> 893</span> <span class="comment">// Skip if we don&#39;t have the potential to generate a good enough cut.</span></div>
<div class="line"><a id="l00894" name="l00894"></a><span class="lineno"> 894</span> <span class="keyword">const</span> IntegerValue initial_rhs_remainder =</div>
<div class="line"><a id="l00895" name="l00895"></a><span class="lineno"> 895</span> cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> - <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>, divisor) * divisor;</div>
<div class="line"><a id="l00896" name="l00896"></a><span class="lineno"> 896</span> <span class="keywordflow">if</span> (initial_rhs_remainder &lt;= remainder_threshold) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00897" name="l00897"></a><span class="lineno"> 897</span> </div>
<div class="line"><a id="l00898" name="l00898"></a><span class="lineno"> 898</span> IntegerValue temp_ub = cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>;</div>
<div class="line"><a id="l00899" name="l00899"></a><span class="lineno"> 899</span> adjusted_coeffs_.clear();</div>
<div class="line"><a id="l00900" name="l00900"></a><span class="lineno"> 900</span> </div>
<div class="line"><a id="l00901" name="l00901"></a><span class="lineno"> 901</span> <span class="comment">// We will adjust coefficient that are just under an exact multiple of</span></div>
<div class="line"><a id="l00902" name="l00902"></a><span class="lineno"> 902</span> <span class="comment">// divisor to an exact multiple. This is meant to get rid of small errors</span></div>
<div class="line"><a id="l00903" name="l00903"></a><span class="lineno"> 903</span> <span class="comment">// that appears due to rounding error in our exact computation of the</span></div>
<div class="line"><a id="l00904" name="l00904"></a><span class="lineno"> 904</span> <span class="comment">// initial constraint given to this class.</span></div>
<div class="line"><a id="l00905" name="l00905"></a><span class="lineno"> 905</span> <span class="comment">//</span></div>
<div class="line"><a id="l00906" name="l00906"></a><span class="lineno"> 906</span> <span class="comment">// Each adjustement will cause the initial_rhs_remainder to increase, and we</span></div>
<div class="line"><a id="l00907" name="l00907"></a><span class="lineno"> 907</span> <span class="comment">// do not want to increase it above divisor. Our threshold below guarantees</span></div>
<div class="line"><a id="l00908" name="l00908"></a><span class="lineno"> 908</span> <span class="comment">// this. Note that the higher the rhs_remainder becomes, the more the</span></div>
<div class="line"><a id="l00909" name="l00909"></a><span class="lineno"> 909</span> <span class="comment">// function f() has a chance to reduce the violation, so it is not always a</span></div>
<div class="line"><a id="l00910" name="l00910"></a><span class="lineno"> 910</span> <span class="comment">// good idea to use all the slack we have between initial_rhs_remainder and</span></div>
<div class="line"><a id="l00911" name="l00911"></a><span class="lineno"> 911</span> <span class="comment">// divisor.</span></div>
<div class="line"><a id="l00912" name="l00912"></a><span class="lineno"> 912</span> <span class="comment">//</span></div>
<div class="line"><a id="l00913" name="l00913"></a><span class="lineno"> 913</span> <span class="comment">// TODO(user): If possible, it might be better to complement these</span></div>
<div class="line"><a id="l00914" name="l00914"></a><span class="lineno"> 914</span> <span class="comment">// variables. Even if the adjusted lp_values end up larger, if we loose less</span></div>
<div class="line"><a id="l00915" name="l00915"></a><span class="lineno"> 915</span> <span class="comment">// when taking f(), then we will have a better violation.</span></div>
<div class="line"><a id="l00916" name="l00916"></a><span class="lineno"> 916</span> <span class="keyword">const</span> IntegerValue adjust_threshold =</div>
<div class="line"><a id="l00917" name="l00917"></a><span class="lineno"> 917</span> (divisor - initial_rhs_remainder - 1) / IntegerValue(size);</div>
<div class="line"><a id="l00918" name="l00918"></a><span class="lineno"> 918</span> <span class="keywordflow">if</span> (adjust_threshold &gt; 0) {</div>
<div class="line"><a id="l00919" name="l00919"></a><span class="lineno"> 919</span> <span class="comment">// Even before we finish the adjust, we can have a lower bound on the</span></div>
<div class="line"><a id="l00920" name="l00920"></a><span class="lineno"> 920</span> <span class="comment">// activily loss using this divisor, and so we can abort early. This is</span></div>
<div class="line"><a id="l00921" name="l00921"></a><span class="lineno"> 921</span> <span class="comment">// similar to what is done below in the function.</span></div>
<div class="line"><a id="l00922" name="l00922"></a><span class="lineno"> 922</span> <span class="keywordtype">bool</span> early_abort = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00923" name="l00923"></a><span class="lineno"> 923</span> <span class="keywordtype">double</span> loss_lb = 0.0;</div>
<div class="line"><a id="l00924" name="l00924"></a><span class="lineno"> 924</span> <span class="keyword">const</span> <span class="keywordtype">double</span> threshold = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(initial_rhs_remainder);</div>
<div class="line"><a id="l00925" name="l00925"></a><span class="lineno"> 925</span> </div>
<div class="line"><a id="l00926" name="l00926"></a><span class="lineno"> 926</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; relevant_coeffs_.size(); ++i) {</div>
<div class="line"><a id="l00927" name="l00927"></a><span class="lineno"> 927</span> <span class="comment">// Compute the difference of coeff with the next multiple of divisor.</span></div>
<div class="line"><a id="l00928" name="l00928"></a><span class="lineno"> 928</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = relevant_coeffs_[i];</div>
<div class="line"><a id="l00929" name="l00929"></a><span class="lineno"> 929</span> <span class="keyword">const</span> IntegerValue remainder =</div>
<div class="line"><a id="l00930" name="l00930"></a><span class="lineno"> 930</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, divisor) * divisor - <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>;</div>
<div class="line"><a id="l00931" name="l00931"></a><span class="lineno"> 931</span> </div>
<div class="line"><a id="l00932" name="l00932"></a><span class="lineno"> 932</span> <span class="keywordflow">if</span> (divisor - remainder &lt;= initial_rhs_remainder) {</div>
<div class="line"><a id="l00933" name="l00933"></a><span class="lineno"> 933</span> <span class="comment">// We do not know exactly f() yet, but it will always round to the</span></div>
<div class="line"><a id="l00934" name="l00934"></a><span class="lineno"> 934</span> <span class="comment">// floor of the division by divisor in this case.</span></div>
<div class="line"><a id="l00935" name="l00935"></a><span class="lineno"> 935</span> loss_lb += <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(divisor - remainder) * relevant_lp_values_[i];</div>
<div class="line"><a id="l00936" name="l00936"></a><span class="lineno"> 936</span> <span class="keywordflow">if</span> (loss_lb &gt;= threshold) {</div>
<div class="line"><a id="l00937" name="l00937"></a><span class="lineno"> 937</span> early_abort = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00938" name="l00938"></a><span class="lineno"> 938</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00939" name="l00939"></a><span class="lineno"> 939</span> }</div>
<div class="line"><a id="l00940" name="l00940"></a><span class="lineno"> 940</span> }</div>
<div class="line"><a id="l00941" name="l00941"></a><span class="lineno"> 941</span> </div>
<div class="line"><a id="l00942" name="l00942"></a><span class="lineno"> 942</span> <span class="comment">// Adjust coeff of the form k * divisor - epsilon.</span></div>
<div class="line"><a id="l00943" name="l00943"></a><span class="lineno"> 943</span> <span class="keyword">const</span> IntegerValue diff = relevant_bound_diffs_[i];</div>
<div class="line"><a id="l00944" name="l00944"></a><span class="lineno"> 944</span> <span class="keywordflow">if</span> (remainder &gt; 0 &amp;&amp; remainder &lt;= adjust_threshold &amp;&amp;</div>
<div class="line"><a id="l00945" name="l00945"></a><span class="lineno"> 945</span> <a class="code hl_function" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(diff.value(), remainder.value()) &lt;= adjust_threshold) {</div>
<div class="line"><a id="l00946" name="l00946"></a><span class="lineno"> 946</span> temp_ub += remainder * diff;</div>
<div class="line"><a id="l00947" name="l00947"></a><span class="lineno"> 947</span> adjusted_coeffs_.push_back({i, <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> + remainder});</div>
<div class="line"><a id="l00948" name="l00948"></a><span class="lineno"> 948</span> }</div>
<div class="line"><a id="l00949" name="l00949"></a><span class="lineno"> 949</span> }</div>
<div class="line"><a id="l00950" name="l00950"></a><span class="lineno"> 950</span> </div>
<div class="line"><a id="l00951" name="l00951"></a><span class="lineno"> 951</span> <span class="keywordflow">if</span> (early_abort) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00952" name="l00952"></a><span class="lineno"> 952</span> }</div>
<div class="line"><a id="l00953" name="l00953"></a><span class="lineno"> 953</span> </div>
<div class="line"><a id="l00954" name="l00954"></a><span class="lineno"> 954</span> <span class="comment">// Create the super-additive function f().</span></div>
<div class="line"><a id="l00955" name="l00955"></a><span class="lineno"> 955</span> <span class="keyword">const</span> IntegerValue rhs_remainder =</div>
<div class="line"><a id="l00956" name="l00956"></a><span class="lineno"> 956</span> temp_ub - <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(temp_ub, divisor) * divisor;</div>
<div class="line"><a id="l00957" name="l00957"></a><span class="lineno"> 957</span> <span class="keywordflow">if</span> (rhs_remainder == 0) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00958" name="l00958"></a><span class="lineno"> 958</span> </div>
<div class="line"><a id="l00959" name="l00959"></a><span class="lineno"> 959</span> <span class="keyword">const</span> <span class="keyword">auto</span> f = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a8e30df8580d6914abba28f43b6e4e667">GetSuperAdditiveRoundingFunction</a>(</div>
<div class="line"><a id="l00960" name="l00960"></a><span class="lineno"> 960</span> rhs_remainder, divisor, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a44bd0a015c444c2e2d58a002a09a1ea5">GetFactorT</a>(rhs_remainder, divisor, max_t),</div>
<div class="line"><a id="l00961" name="l00961"></a><span class="lineno"> 961</span> options.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_rounding_options.html#a01db407e90fac1c31c6705758a057908">max_scaling</a>);</div>
<div class="line"><a id="l00962" name="l00962"></a><span class="lineno"> 962</span> </div>
<div class="line"><a id="l00963" name="l00963"></a><span class="lineno"> 963</span> <span class="comment">// As we round coefficients, we will compute the loss compared to the</span></div>
<div class="line"><a id="l00964" name="l00964"></a><span class="lineno"> 964</span> <span class="comment">// current scaled constraint activity. As soon as this loss crosses the</span></div>
<div class="line"><a id="l00965" name="l00965"></a><span class="lineno"> 965</span> <span class="comment">// slack, then we known that there is no violation and we can abort early.</span></div>
<div class="line"><a id="l00966" name="l00966"></a><span class="lineno"> 966</span> <span class="comment">//</span></div>
<div class="line"><a id="l00967" name="l00967"></a><span class="lineno"> 967</span> <span class="comment">// TODO(user): modulo the scaling, we could compute the exact threshold</span></div>
<div class="line"><a id="l00968" name="l00968"></a><span class="lineno"> 968</span> <span class="comment">// using our current best cut. Note that we also have to account the change</span></div>
<div class="line"><a id="l00969" name="l00969"></a><span class="lineno"> 969</span> <span class="comment">// in slack due to the adjust code above.</span></div>
<div class="line"><a id="l00970" name="l00970"></a><span class="lineno"> 970</span> <span class="keyword">const</span> <span class="keywordtype">double</span> scaling = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(f(divisor)) / <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(divisor);</div>
<div class="line"><a id="l00971" name="l00971"></a><span class="lineno"> 971</span> <span class="keyword">const</span> <span class="keywordtype">double</span> threshold = scaling * <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(rhs_remainder);</div>
<div class="line"><a id="l00972" name="l00972"></a><span class="lineno"> 972</span> <span class="keywordtype">double</span> loss = 0.0;</div>
<div class="line"><a id="l00973" name="l00973"></a><span class="lineno"> 973</span> </div>
<div class="line"><a id="l00974" name="l00974"></a><span class="lineno"> 974</span> <span class="comment">// Apply f() to the cut and compute the cut violation. Note that it is</span></div>
<div class="line"><a id="l00975" name="l00975"></a><span class="lineno"> 975</span> <span class="comment">// okay to just look at the relevant indices since the other have a lp</span></div>
<div class="line"><a id="l00976" name="l00976"></a><span class="lineno"> 976</span> <span class="comment">// value which is almost zero. Doing it like this is faster, and even if</span></div>
<div class="line"><a id="l00977" name="l00977"></a><span class="lineno"> 977</span> <span class="comment">// the max_magnitude might be off it should still be relevant enough.</span></div>
<div class="line"><a id="l00978" name="l00978"></a><span class="lineno"> 978</span> <span class="keywordtype">double</span> violation = -<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(f(temp_ub));</div>
<div class="line"><a id="l00979" name="l00979"></a><span class="lineno"> 979</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="sharded__optimization__utils_8cc.html#a2a897122b37c5a906205687aecdb627b">l2_norm</a> = 0.0;</div>
<div class="line"><a id="l00980" name="l00980"></a><span class="lineno"> 980</span> <span class="keywordtype">bool</span> early_abort = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00981" name="l00981"></a><span class="lineno"> 981</span> <span class="keywordtype">int</span> adjusted_coeffs_index = 0;</div>
<div class="line"><a id="l00982" name="l00982"></a><span class="lineno"> 982</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; relevant_coeffs_.size(); ++i) {</div>
<div class="line"><a id="l00983" name="l00983"></a><span class="lineno"> 983</span> IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = relevant_coeffs_[i];</div>
<div class="line"><a id="l00984" name="l00984"></a><span class="lineno"> 984</span> </div>
<div class="line"><a id="l00985" name="l00985"></a><span class="lineno"> 985</span> <span class="comment">// Adjust coeff according to our previous computation if needed.</span></div>
<div class="line"><a id="l00986" name="l00986"></a><span class="lineno"> 986</span> <span class="keywordflow">if</span> (adjusted_coeffs_index &lt; adjusted_coeffs_.size() &amp;&amp;</div>
<div class="line"><a id="l00987" name="l00987"></a><span class="lineno"> 987</span> adjusted_coeffs_[adjusted_coeffs_index].first == i) {</div>
<div class="line"><a id="l00988" name="l00988"></a><span class="lineno"> 988</span> <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = adjusted_coeffs_[adjusted_coeffs_index].second;</div>
<div class="line"><a id="l00989" name="l00989"></a><span class="lineno"> 989</span> adjusted_coeffs_index++;</div>
<div class="line"><a id="l00990" name="l00990"></a><span class="lineno"> 990</span> }</div>
<div class="line"><a id="l00991" name="l00991"></a><span class="lineno"> 991</span> </div>
<div class="line"><a id="l00992" name="l00992"></a><span class="lineno"> 992</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> == 0) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00993" name="l00993"></a><span class="lineno"> 993</span> <span class="keyword">const</span> IntegerValue new_coeff = f(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>);</div>
<div class="line"><a id="l00994" name="l00994"></a><span class="lineno"> 994</span> <span class="keyword">const</span> <span class="keywordtype">double</span> new_coeff_double = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(new_coeff);</div>
<div class="line"><a id="l00995" name="l00995"></a><span class="lineno"> 995</span> <span class="keyword">const</span> <span class="keywordtype">double</span> lp_value = relevant_lp_values_[i];</div>
<div class="line"><a id="l00996" name="l00996"></a><span class="lineno"> 996</span> </div>
<div class="line"><a id="l00997" name="l00997"></a><span class="lineno"> 997</span> <a class="code hl_variable" href="sharded__optimization__utils_8cc.html#a2a897122b37c5a906205687aecdb627b">l2_norm</a> += new_coeff_double * new_coeff_double;</div>
<div class="line"><a id="l00998" name="l00998"></a><span class="lineno"> 998</span> violation += new_coeff_double * lp_value;</div>
<div class="line"><a id="l00999" name="l00999"></a><span class="lineno"> 999</span> loss += (scaling * <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>) - new_coeff_double) * lp_value;</div>
<div class="line"><a id="l01000" name="l01000"></a><span class="lineno"> 1000</span> <span class="keywordflow">if</span> (loss &gt;= threshold) {</div>
<div class="line"><a id="l01001" name="l01001"></a><span class="lineno"> 1001</span> early_abort = <span class="keyword">true</span>;</div>
<div class="line"><a id="l01002" name="l01002"></a><span class="lineno"> 1002</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l01003" name="l01003"></a><span class="lineno"> 1003</span> }</div>
<div class="line"><a id="l01004" name="l01004"></a><span class="lineno"> 1004</span> }</div>
<div class="line"><a id="l01005" name="l01005"></a><span class="lineno"> 1005</span> <span class="keywordflow">if</span> (early_abort) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l01006" name="l01006"></a><span class="lineno"> 1006</span> </div>
<div class="line"><a id="l01007" name="l01007"></a><span class="lineno"> 1007</span> <span class="comment">// Here we scale by the L2 norm over the &quot;relevant&quot; positions. This seems</span></div>
<div class="line"><a id="l01008" name="l01008"></a><span class="lineno"> 1008</span> <span class="comment">// to work slighly better in practice.</span></div>
<div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span> violation /= sqrt(<a class="code hl_variable" href="sharded__optimization__utils_8cc.html#a2a897122b37c5a906205687aecdb627b">l2_norm</a>);</div>
<div class="line"><a id="l01010" name="l01010"></a><span class="lineno"> 1010</span> <span class="keywordflow">if</span> (violation &gt; best_scaled_violation) {</div>
<div class="line"><a id="l01011" name="l01011"></a><span class="lineno"> 1011</span> best_scaled_violation = violation;</div>
<div class="line"><a id="l01012" name="l01012"></a><span class="lineno"> 1012</span> best_divisor = divisor;</div>
<div class="line"><a id="l01013" name="l01013"></a><span class="lineno"> 1013</span> }</div>
<div class="line"><a id="l01014" name="l01014"></a><span class="lineno"> 1014</span> }</div>
<div class="line"><a id="l01015" name="l01015"></a><span class="lineno"> 1015</span> </div>
<div class="line"><a id="l01016" name="l01016"></a><span class="lineno"> 1016</span> <span class="keywordflow">if</span> (best_divisor == 0) {</div>
<div class="line"><a id="l01017" name="l01017"></a><span class="lineno"> 1017</span> *cut = <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>(IntegerValue(0), IntegerValue(0));</div>
<div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l01019" name="l01019"></a><span class="lineno"> 1019</span> }</div>
<div class="line"><a id="l01020" name="l01020"></a><span class="lineno"> 1020</span> </div>
<div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span> <span class="comment">// Adjust coefficients.</span></div>
<div class="line"><a id="l01022" name="l01022"></a><span class="lineno"> 1022</span> <span class="comment">//</span></div>
<div class="line"><a id="l01023" name="l01023"></a><span class="lineno"> 1023</span> <span class="comment">// TODO(user): It might make sense to also adjust the one with a small LP</span></div>
<div class="line"><a id="l01024" name="l01024"></a><span class="lineno"> 1024</span> <span class="comment">// value, but then the cut will be slighlty different than the one we computed</span></div>
<div class="line"><a id="l01025" name="l01025"></a><span class="lineno"> 1025</span> <span class="comment">// above. Try with and without maybe?</span></div>
<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"> 1026</span> <span class="keyword">const</span> IntegerValue initial_rhs_remainder =</div>
<div class="line"><a id="l01027" name="l01027"></a><span class="lineno"> 1027</span> cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> - <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>, best_divisor) * best_divisor;</div>
<div class="line"><a id="l01028" name="l01028"></a><span class="lineno"> 1028</span> <span class="keyword">const</span> IntegerValue adjust_threshold =</div>
<div class="line"><a id="l01029" name="l01029"></a><span class="lineno"> 1029</span> (best_divisor - initial_rhs_remainder - 1) / IntegerValue(size);</div>
<div class="line"><a id="l01030" name="l01030"></a><span class="lineno"> 1030</span> <span class="keywordflow">if</span> (adjust_threshold &gt; 0) {</div>
<div class="line"><a id="l01031" name="l01031"></a><span class="lineno"> 1031</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; relevant_indices_.size(); ++i) {</div>
<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = relevant_indices_[i];</div>
<div class="line"><a id="l01033" name="l01033"></a><span class="lineno"> 1033</span> <span class="keyword">const</span> IntegerValue diff = relevant_bound_diffs_[i];</div>
<div class="line"><a id="l01034" name="l01034"></a><span class="lineno"> 1034</span> <span class="keywordflow">if</span> (diff &gt; adjust_threshold) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l01035" name="l01035"></a><span class="lineno"> 1035</span> </div>
<div class="line"><a id="l01036" name="l01036"></a><span class="lineno"> 1036</span> <span class="comment">// Adjust coeff of the form k * best_divisor - epsilon.</span></div>
<div class="line"><a id="l01037" name="l01037"></a><span class="lineno"> 1037</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
<div class="line"><a id="l01038" name="l01038"></a><span class="lineno"> 1038</span> <span class="keyword">const</span> IntegerValue remainder =</div>
<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, best_divisor) * best_divisor - <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>;</div>
<div class="line"><a id="l01040" name="l01040"></a><span class="lineno"> 1040</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(diff.value(), remainder.value()) &lt;= adjust_threshold) {</div>
<div class="line"><a id="l01041" name="l01041"></a><span class="lineno"> 1041</span> cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> += remainder * diff;</div>
<div class="line"><a id="l01042" name="l01042"></a><span class="lineno"> 1042</span> cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] += remainder;</div>
<div class="line"><a id="l01043" name="l01043"></a><span class="lineno"> 1043</span> }</div>
<div class="line"><a id="l01044" name="l01044"></a><span class="lineno"> 1044</span> }</div>
<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span> }</div>
<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span> </div>
<div class="line"><a id="l01047" name="l01047"></a><span class="lineno"> 1047</span> <span class="comment">// Create the super-additive function f().</span></div>
<div class="line"><a id="l01048" name="l01048"></a><span class="lineno"> 1048</span> <span class="comment">//</span></div>
<div class="line"><a id="l01049" name="l01049"></a><span class="lineno"> 1049</span> <span class="comment">// TODO(user): Try out different rounding function and keep the best. We can</span></div>
<div class="line"><a id="l01050" name="l01050"></a><span class="lineno"> 1050</span> <span class="comment">// change max_t and max_scaling. It might not be easy to choose which cut is</span></div>
<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span> <span class="comment">// the best, but we can at least know for sure if one dominate the other</span></div>
<div class="line"><a id="l01052" name="l01052"></a><span class="lineno"> 1052</span> <span class="comment">// completely. That is, if for all coeff f(coeff)/f(divisor) is greater than</span></div>
<div class="line"><a id="l01053" name="l01053"></a><span class="lineno"> 1053</span> <span class="comment">// or equal to the same value for another function f.</span></div>
<div class="line"><a id="l01054" name="l01054"></a><span class="lineno"> 1054</span> <span class="keyword">const</span> IntegerValue rhs_remainder =</div>
<div class="line"><a id="l01055" name="l01055"></a><span class="lineno"> 1055</span> cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> - <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>, best_divisor) * best_divisor;</div>
<div class="line"><a id="l01056" name="l01056"></a><span class="lineno"> 1056</span> IntegerValue factor_t = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a44bd0a015c444c2e2d58a002a09a1ea5">GetFactorT</a>(rhs_remainder, best_divisor, max_t);</div>
<div class="line"><a id="l01057" name="l01057"></a><span class="lineno"> 1057</span> <span class="keyword">auto</span> f = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a8e30df8580d6914abba28f43b6e4e667">GetSuperAdditiveRoundingFunction</a>(rhs_remainder, best_divisor,</div>
<div class="line"><a id="l01058" name="l01058"></a><span class="lineno"> 1058</span> factor_t, options.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_rounding_options.html#a01db407e90fac1c31c6705758a057908">max_scaling</a>);</div>
<div class="line"><a id="l01059" name="l01059"></a><span class="lineno"> 1059</span> </div>
<div class="line"><a id="l01060" name="l01060"></a><span class="lineno"> 1060</span> <span class="comment">// Look amongst all our possible function f() for one that dominate greedily</span></div>
<div class="line"><a id="l01061" name="l01061"></a><span class="lineno"> 1061</span> <span class="comment">// our current best one. Note that we prefer lower scaling factor since that</span></div>
<div class="line"><a id="l01062" name="l01062"></a><span class="lineno"> 1062</span> <span class="comment">// result in a cut with lower coefficients.</span></div>
<div class="line"><a id="l01063" name="l01063"></a><span class="lineno"> 1063</span> remainders_.clear();</div>
<div class="line"><a id="l01064" name="l01064"></a><span class="lineno"> 1064</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><a id="l01065" name="l01065"></a><span class="lineno"> 1065</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i];</div>
<div class="line"><a id="l01066" name="l01066"></a><span class="lineno"> 1066</span> <span class="keyword">const</span> IntegerValue r =</div>
<div class="line"><a id="l01067" name="l01067"></a><span class="lineno"> 1067</span> <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> - <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, best_divisor) * best_divisor;</div>
<div class="line"><a id="l01068" name="l01068"></a><span class="lineno"> 1068</span> <span class="keywordflow">if</span> (r &gt; rhs_remainder) remainders_.push_back(r);</div>
<div class="line"><a id="l01069" name="l01069"></a><span class="lineno"> 1069</span> }</div>
<div class="line"><a id="l01070" name="l01070"></a><span class="lineno"> 1070</span> <a class="code hl_function" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&amp;remainders_);</div>
<div class="line"><a id="l01071" name="l01071"></a><span class="lineno"> 1071</span> <span class="keywordflow">if</span> (remainders_.size() &lt;= 100) {</div>
<div class="line"><a id="l01072" name="l01072"></a><span class="lineno"> 1072</span> best_rs_.clear();</div>
<div class="line"><a id="l01073" name="l01073"></a><span class="lineno"> 1073</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerValue r : remainders_) {</div>
<div class="line"><a id="l01074" name="l01074"></a><span class="lineno"> 1074</span> best_rs_.push_back(f(r));</div>
<div class="line"><a id="l01075" name="l01075"></a><span class="lineno"> 1075</span> }</div>
<div class="line"><a id="l01076" name="l01076"></a><span class="lineno"> 1076</span> IntegerValue best_d = f(best_divisor);</div>
<div class="line"><a id="l01077" name="l01077"></a><span class="lineno"> 1077</span> </div>
<div class="line"><a id="l01078" name="l01078"></a><span class="lineno"> 1078</span> <span class="comment">// Note that the complexity seems high 100 * 2 * options.max_scaling, but</span></div>
<div class="line"><a id="l01079" name="l01079"></a><span class="lineno"> 1079</span> <span class="comment">// this only run on cuts that are already efficient and the inner loop tend</span></div>
<div class="line"><a id="l01080" name="l01080"></a><span class="lineno"> 1080</span> <span class="comment">// to abort quickly. I didn&#39;t see this code in the cpu profile so far.</span></div>
<div class="line"><a id="l01081" name="l01081"></a><span class="lineno"> 1081</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerValue t :</div>
<div class="line"><a id="l01082" name="l01082"></a><span class="lineno"> 1082</span> {IntegerValue(1), <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a44bd0a015c444c2e2d58a002a09a1ea5">GetFactorT</a>(rhs_remainder, best_divisor, max_t)}) {</div>
<div class="line"><a id="l01083" name="l01083"></a><span class="lineno"> 1083</span> <span class="keywordflow">for</span> (IntegerValue s(2); s &lt;= options.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_rounding_options.html#a01db407e90fac1c31c6705758a057908">max_scaling</a>; ++s) {</div>
<div class="line"><a id="l01084" name="l01084"></a><span class="lineno"> 1084</span> <span class="keyword">const</span> <span class="keyword">auto</span> g =</div>
<div class="line"><a id="l01085" name="l01085"></a><span class="lineno"> 1085</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a8e30df8580d6914abba28f43b6e4e667">GetSuperAdditiveRoundingFunction</a>(rhs_remainder, best_divisor, t, s);</div>
<div class="line"><a id="l01086" name="l01086"></a><span class="lineno"> 1086</span> <span class="keywordtype">int</span> num_strictly_better = 0;</div>
<div class="line"><a id="l01087" name="l01087"></a><span class="lineno"> 1087</span> rs_.clear();</div>
<div class="line"><a id="l01088" name="l01088"></a><span class="lineno"> 1088</span> <span class="keyword">const</span> IntegerValue d = g(best_divisor);</div>
<div class="line"><a id="l01089" name="l01089"></a><span class="lineno"> 1089</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; best_rs_.size(); ++i) {</div>
<div class="line"><a id="l01090" name="l01090"></a><span class="lineno"> 1090</span> <span class="keyword">const</span> IntegerValue temp = g(remainders_[i]);</div>
<div class="line"><a id="l01091" name="l01091"></a><span class="lineno"> 1091</span> <span class="keywordflow">if</span> (temp * best_d &lt; best_rs_[i] * d) <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l01092" name="l01092"></a><span class="lineno"> 1092</span> <span class="keywordflow">if</span> (temp * best_d &gt; best_rs_[i] * d) num_strictly_better++;</div>
<div class="line"><a id="l01093" name="l01093"></a><span class="lineno"> 1093</span> rs_.push_back(temp);</div>
<div class="line"><a id="l01094" name="l01094"></a><span class="lineno"> 1094</span> }</div>
<div class="line"><a id="l01095" name="l01095"></a><span class="lineno"> 1095</span> <span class="keywordflow">if</span> (rs_.size() == best_rs_.size() &amp;&amp; num_strictly_better &gt; 0) {</div>
<div class="line"><a id="l01096" name="l01096"></a><span class="lineno"> 1096</span> f = g;</div>
<div class="line"><a id="l01097" name="l01097"></a><span class="lineno"> 1097</span> factor_t = t;</div>
<div class="line"><a id="l01098" name="l01098"></a><span class="lineno"> 1098</span> best_rs_ = rs_;</div>
<div class="line"><a id="l01099" name="l01099"></a><span class="lineno"> 1099</span> best_d = d;</div>
<div class="line"><a id="l01100" name="l01100"></a><span class="lineno"> 1100</span> }</div>
<div class="line"><a id="l01101" name="l01101"></a><span class="lineno"> 1101</span> }</div>
<div class="line"><a id="l01102" name="l01102"></a><span class="lineno"> 1102</span> }</div>
<div class="line"><a id="l01103" name="l01103"></a><span class="lineno"> 1103</span> }</div>
<div class="line"><a id="l01104" name="l01104"></a><span class="lineno"> 1104</span> </div>
<div class="line"><a id="l01105" name="l01105"></a><span class="lineno"> 1105</span> <span class="comment">// Starts to apply f() to the cut. We only apply it to the rhs here, the</span></div>
<div class="line"><a id="l01106" name="l01106"></a><span class="lineno"> 1106</span> <span class="comment">// coefficient will be done after the potential lifting of some Booleans.</span></div>
<div class="line"><a id="l01107" name="l01107"></a><span class="lineno"> 1107</span> cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> = f(cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>);</div>
<div class="line"><a id="l01108" name="l01108"></a><span class="lineno"> 1108</span> tmp_terms_.clear();</div>
<div class="line"><a id="l01109" name="l01109"></a><span class="lineno"> 1109</span> </div>
<div class="line"><a id="l01110" name="l01110"></a><span class="lineno"> 1110</span> <span class="comment">// Lift some implied bounds Booleans. Note that we will add them after</span></div>
<div class="line"><a id="l01111" name="l01111"></a><span class="lineno"> 1111</span> <span class="comment">// &quot;size&quot; so they will be ignored in the second loop below.</span></div>
<div class="line"><a id="l01112" name="l01112"></a><span class="lineno"> 1112</span> num_lifted_booleans_ = 0;</div>
<div class="line"><a id="l01113" name="l01113"></a><span class="lineno"> 1113</span> <span class="keywordflow">if</span> (ib_processor != <span class="keyword">nullptr</span>) {</div>
<div class="line"><a id="l01114" name="l01114"></a><span class="lineno"> 1114</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><a id="l01115" name="l01115"></a><span class="lineno"> 1115</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i];</div>
<div class="line"><a id="l01116" name="l01116"></a><span class="lineno"> 1116</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> == 0) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l01117" name="l01117"></a><span class="lineno"> 1117</span> </div>
<div class="line"><a id="l01118" name="l01118"></a><span class="lineno"> 1118</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i];</div>
<div class="line"><a id="l01119" name="l01119"></a><span class="lineno"> 1119</span> <span class="keywordflow">if</span> (change_sign_at_postprocessing_[i]) {</div>
<div class="line"><a id="l01120" name="l01120"></a><span class="lineno"> 1120</span> <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l01121" name="l01121"></a><span class="lineno"> 1121</span> }</div>
<div class="line"><a id="l01122" name="l01122"></a><span class="lineno"> 1122</span> </div>
<div class="line"><a id="l01123" name="l01123"></a><span class="lineno"> 1123</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html">ImpliedBoundsProcessor::BestImpliedBoundInfo</a> info =</div>
<div class="line"><a id="l01124" name="l01124"></a><span class="lineno"> 1124</span> ib_processor-&gt;<a class="code hl_function" href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#abb0b7cc2e259fc8ebe8fd3dd55816b75">GetCachedImpliedBoundInfo</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l01125" name="l01125"></a><span class="lineno"> 1125</span> </div>
<div class="line"><a id="l01126" name="l01126"></a><span class="lineno"> 1126</span> <span class="comment">// Avoid overflow.</span></div>
<div class="line"><a id="l01127" name="l01127"></a><span class="lineno"> 1127</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(<a class="code hl_function" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(std::abs(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>.value()), factor_t.value()),</div>
<div class="line"><a id="l01128" name="l01128"></a><span class="lineno"> 1128</span> info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a2c25b894240115eebb2e75e2d8491a79">bound_diff</a>.value()) ==</div>
<div class="line"><a id="l01129" name="l01129"></a><span class="lineno"> 1129</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits&lt;int64_t&gt;::max</a>()) {</div>
<div class="line"><a id="l01130" name="l01130"></a><span class="lineno"> 1130</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l01131" name="l01131"></a><span class="lineno"> 1131</span> }</div>
<div class="line"><a id="l01132" name="l01132"></a><span class="lineno"> 1132</span> </div>
<div class="line"><a id="l01133" name="l01133"></a><span class="lineno"> 1133</span> <span class="comment">// Because X = bound_diff * B + S</span></div>
<div class="line"><a id="l01134" name="l01134"></a><span class="lineno"> 1134</span> <span class="comment">// We can replace coeff * X by the expression before applying f:</span></div>
<div class="line"><a id="l01135" name="l01135"></a><span class="lineno"> 1135</span> <span class="comment">// = f(coeff * bound_diff) * B + f(coeff) * [X - bound_diff * B]</span></div>
<div class="line"><a id="l01136" name="l01136"></a><span class="lineno"> 1136</span> <span class="comment">// = f(coeff) * X + (f(coeff * bound_diff) - f(coeff) * bound_diff] B</span></div>
<div class="line"><a id="l01137" name="l01137"></a><span class="lineno"> 1137</span> <span class="comment">// So we can &quot;lift&quot; B into the cut.</span></div>
<div class="line"><a id="l01138" name="l01138"></a><span class="lineno"> 1138</span> <span class="keyword">const</span> IntegerValue coeff_b =</div>
<div class="line"><a id="l01139" name="l01139"></a><span class="lineno"> 1139</span> f(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> * info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a2c25b894240115eebb2e75e2d8491a79">bound_diff</a>) - f(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>) * info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a2c25b894240115eebb2e75e2d8491a79">bound_diff</a>;</div>
<div class="line"><a id="l01140" name="l01140"></a><span class="lineno"> 1140</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(coeff_b, 0);</div>
<div class="line"><a id="l01141" name="l01141"></a><span class="lineno"> 1141</span> <span class="keywordflow">if</span> (coeff_b == 0) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l01142" name="l01142"></a><span class="lineno"> 1142</span> </div>
<div class="line"><a id="l01143" name="l01143"></a><span class="lineno"> 1143</span> ++num_lifted_booleans_;</div>
<div class="line"><a id="l01144" name="l01144"></a><span class="lineno"> 1144</span> <span class="keywordflow">if</span> (info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a6d2822d5e07c3716efcdf73a4ae5eafc">is_positive</a>) {</div>
<div class="line"><a id="l01145" name="l01145"></a><span class="lineno"> 1145</span> tmp_terms_.push_back({info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a871eaa421116e3c7cd440b6299d0b74d">bool_var</a>, coeff_b});</div>
<div class="line"><a id="l01146" name="l01146"></a><span class="lineno"> 1146</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l01147" name="l01147"></a><span class="lineno"> 1147</span> tmp_terms_.push_back({info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a871eaa421116e3c7cd440b6299d0b74d">bool_var</a>, -coeff_b});</div>
<div class="line"><a id="l01148" name="l01148"></a><span class="lineno"> 1148</span> cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> = <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(-coeff_b.value(), cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>.value());</div>
<div class="line"><a id="l01149" name="l01149"></a><span class="lineno"> 1149</span> }</div>
<div class="line"><a id="l01150" name="l01150"></a><span class="lineno"> 1150</span> }</div>
<div class="line"><a id="l01151" name="l01151"></a><span class="lineno"> 1151</span> }</div>
<div class="line"><a id="l01152" name="l01152"></a><span class="lineno"> 1152</span> </div>
<div class="line"><a id="l01153" name="l01153"></a><span class="lineno"> 1153</span> <span class="comment">// Apply f() to the cut.</span></div>
<div class="line"><a id="l01154" name="l01154"></a><span class="lineno"> 1154</span> <span class="comment">//</span></div>
<div class="line"><a id="l01155" name="l01155"></a><span class="lineno"> 1155</span> <span class="comment">// Remove the bound shifts so the constraint is expressed in the original</span></div>
<div class="line"><a id="l01156" name="l01156"></a><span class="lineno"> 1156</span> <span class="comment">// variables.</span></div>
<div class="line"><a id="l01157" name="l01157"></a><span class="lineno"> 1157</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><a id="l01158" name="l01158"></a><span class="lineno"> 1158</span> IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i];</div>
<div class="line"><a id="l01159" name="l01159"></a><span class="lineno"> 1159</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> == 0) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l01160" name="l01160"></a><span class="lineno"> 1160</span> <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = f(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>);</div>
<div class="line"><a id="l01161" name="l01161"></a><span class="lineno"> 1161</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> == 0) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l01162" name="l01162"></a><span class="lineno"> 1162</span> <span class="keywordflow">if</span> (change_sign_at_postprocessing_[i]) {</div>
<div class="line"><a id="l01163" name="l01163"></a><span class="lineno"> 1163</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">AddProductTo</a>(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, -<a class="code hl_variable" href="sat_2lp__utils_8cc.html#a88215c8581662c40eec0fb8621c44af3">upper_bounds</a>[i], &amp;cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>)) {</div>
<div class="line"><a id="l01164" name="l01164"></a><span class="lineno"> 1164</span> <span class="comment">// Abort with a trivially satisfied cut.</span></div>
<div class="line"><a id="l01165" name="l01165"></a><span class="lineno"> 1165</span> cut-&gt;<a class="code hl_function" href="structoperations__research_1_1sat_1_1_linear_constraint.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
<div class="line"><a id="l01166" name="l01166"></a><span class="lineno"> 1166</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l01167" name="l01167"></a><span class="lineno"> 1167</span> }</div>
<div class="line"><a id="l01168" name="l01168"></a><span class="lineno"> 1168</span> tmp_terms_.push_back({cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i], -<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>});</div>
<div class="line"><a id="l01169" name="l01169"></a><span class="lineno"> 1169</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l01170" name="l01170"></a><span class="lineno"> 1170</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">AddProductTo</a>(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>[i], &amp;cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>)) {</div>
<div class="line"><a id="l01171" name="l01171"></a><span class="lineno"> 1171</span> <span class="comment">// Abort with a trivially satisfied cut.</span></div>
<div class="line"><a id="l01172" name="l01172"></a><span class="lineno"> 1172</span> cut-&gt;<a class="code hl_function" href="structoperations__research_1_1sat_1_1_linear_constraint.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
<div class="line"><a id="l01173" name="l01173"></a><span class="lineno"> 1173</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l01174" name="l01174"></a><span class="lineno"> 1174</span> }</div>
<div class="line"><a id="l01175" name="l01175"></a><span class="lineno"> 1175</span> tmp_terms_.push_back({cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i], <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>});</div>
<div class="line"><a id="l01176" name="l01176"></a><span class="lineno"> 1176</span> }</div>
<div class="line"><a id="l01177" name="l01177"></a><span class="lineno"> 1177</span> }</div>
<div class="line"><a id="l01178" name="l01178"></a><span class="lineno"> 1178</span> </div>
<div class="line"><a id="l01179" name="l01179"></a><span class="lineno"> 1179</span> <span class="comment">// Basic post-processing.</span></div>
<div class="line"><a id="l01180" name="l01180"></a><span class="lineno"> 1180</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a6314c72e08e179c06ce3b76747499b8c">CleanTermsAndFillConstraint</a>(&amp;tmp_terms_, cut);</div>
<div class="line"><a id="l01181" name="l01181"></a><span class="lineno"> 1181</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a4393db2c15b2f92d7ef16ce6b38c8150">RemoveZeroTerms</a>(cut);</div>
<div class="line"><a id="l01182" name="l01182"></a><span class="lineno"> 1182</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ae3c495e2e05950c578b01976701f9b2a">DivideByGCD</a>(cut);</div>
<div class="line"><a id="l01183" name="l01183"></a><span class="lineno"> 1183</span>}</div>
<div class="line"><a id="l01184" name="l01184"></a><span class="lineno"> 1184</span> </div>
<div class="line"><a id="l01185" name="l01185"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_cover_cut_helper.html#ad86e161bb994fe49fa9c4298ebb5ae2d"> 1185</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_cover_cut_helper.html#ad86e161bb994fe49fa9c4298ebb5ae2d">CoverCutHelper::TrySimpleKnapsack</a>(</div>
<div class="line"><a id="l01186" name="l01186"></a><span class="lineno"> 1186</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> base_ct, <span class="keyword">const</span> std::vector&lt;double&gt;&amp; lp_values,</div>
<div class="line"><a id="l01187" name="l01187"></a><span class="lineno"> 1187</span> <span class="keyword">const</span> std::vector&lt;IntegerValue&gt;&amp; <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>,</div>
<div class="line"><a id="l01188" name="l01188"></a><span class="lineno"> 1188</span> <span class="keyword">const</span> std::vector&lt;IntegerValue&gt;&amp; <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a88215c8581662c40eec0fb8621c44af3">upper_bounds</a>) {</div>
<div class="line"><a id="l01189" name="l01189"></a><span class="lineno"> 1189</span> <span class="keyword">const</span> <span class="keywordtype">int</span> base_size = lp_values.size();</div>
<div class="line"><a id="l01190" name="l01190"></a><span class="lineno"> 1190</span> </div>
<div class="line"><a id="l01191" name="l01191"></a><span class="lineno"> 1191</span> <span class="comment">// Fill terms with a rewrite of the base constraint where all coeffs &amp;</span></div>
<div class="line"><a id="l01192" name="l01192"></a><span class="lineno"> 1192</span> <span class="comment">// variables are positive by using either (X - LB) or (UB - X) as new</span></div>
<div class="line"><a id="l01193" name="l01193"></a><span class="lineno"> 1193</span> <span class="comment">// variables.</span></div>
<div class="line"><a id="l01194" name="l01194"></a><span class="lineno"> 1194</span> terms_.clear();</div>
<div class="line"><a id="l01195" name="l01195"></a><span class="lineno"> 1195</span> IntegerValue rhs = base_ct.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>;</div>
<div class="line"><a id="l01196" name="l01196"></a><span class="lineno"> 1196</span> IntegerValue sum_of_diff(0);</div>
<div class="line"><a id="l01197" name="l01197"></a><span class="lineno"> 1197</span> IntegerValue max_base_magnitude(0);</div>
<div class="line"><a id="l01198" name="l01198"></a><span class="lineno"> 1198</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; base_size; ++i) {</div>
<div class="line"><a id="l01199" name="l01199"></a><span class="lineno"> 1199</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = base_ct.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i];</div>
<div class="line"><a id="l01200" name="l01200"></a><span class="lineno"> 1200</span> <span class="keyword">const</span> IntegerValue positive_coeff = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>);</div>
<div class="line"><a id="l01201" name="l01201"></a><span class="lineno"> 1201</span> max_base_magnitude = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_base_magnitude, positive_coeff);</div>
<div class="line"><a id="l01202" name="l01202"></a><span class="lineno"> 1202</span> <span class="keyword">const</span> IntegerValue bound_diff = <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a88215c8581662c40eec0fb8621c44af3">upper_bounds</a>[i] - <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>[i];</div>
<div class="line"><a id="l01203" name="l01203"></a><span class="lineno"> 1203</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">AddProductTo</a>(positive_coeff, bound_diff, &amp;sum_of_diff)) {</div>
<div class="line"><a id="l01204" name="l01204"></a><span class="lineno"> 1204</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l01205" name="l01205"></a><span class="lineno"> 1205</span> }</div>
<div class="line"><a id="l01206" name="l01206"></a><span class="lineno"> 1206</span> <span class="keyword">const</span> IntegerValue diff = positive_coeff * bound_diff;</div>
<div class="line"><a id="l01207" name="l01207"></a><span class="lineno"> 1207</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> &gt; 0) {</div>
<div class="line"><a id="l01208" name="l01208"></a><span class="lineno"> 1208</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">AddProductTo</a>(-<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>[i], &amp;rhs)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l01209" name="l01209"></a><span class="lineno"> 1209</span> terms_.push_back(</div>
<div class="line"><a id="l01210" name="l01210"></a><span class="lineno"> 1210</span> {i, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(<a class="code hl_variable" href="sat_2lp__utils_8cc.html#a88215c8581662c40eec0fb8621c44af3">upper_bounds</a>[i]) - lp_values[i], positive_coeff, diff});</div>
<div class="line"><a id="l01211" name="l01211"></a><span class="lineno"> 1211</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l01212" name="l01212"></a><span class="lineno"> 1212</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">AddProductTo</a>(-<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a88215c8581662c40eec0fb8621c44af3">upper_bounds</a>[i], &amp;rhs)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l01213" name="l01213"></a><span class="lineno"> 1213</span> terms_.push_back(</div>
<div class="line"><a id="l01214" name="l01214"></a><span class="lineno"> 1214</span> {i, lp_values[i] - <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(<a class="code hl_variable" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>[i]), positive_coeff, diff});</div>
<div class="line"><a id="l01215" name="l01215"></a><span class="lineno"> 1215</span> }</div>
<div class="line"><a id="l01216" name="l01216"></a><span class="lineno"> 1216</span> }</div>
<div class="line"><a id="l01217" name="l01217"></a><span class="lineno"> 1217</span> </div>
<div class="line"><a id="l01218" name="l01218"></a><span class="lineno"> 1218</span> <span class="comment">// Try a simple cover heuristic.</span></div>
<div class="line"><a id="l01219" name="l01219"></a><span class="lineno"> 1219</span> <span class="comment">// Look for violated CUT of the form: sum (UB - X) or (X - LB) &gt;= 1.</span></div>
<div class="line"><a id="l01220" name="l01220"></a><span class="lineno"> 1220</span> <span class="keywordtype">double</span> activity = 0.0;</div>
<div class="line"><a id="l01221" name="l01221"></a><span class="lineno"> 1221</span> <span class="keywordtype">int</span> new_size = 0;</div>
<div class="line"><a id="l01222" name="l01222"></a><span class="lineno"> 1222</span> std::sort(terms_.begin(), terms_.end(), [](<span class="keyword">const</span> Term&amp; <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <span class="keyword">const</span> Term&amp; <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) {</div>
<div class="line"><a id="l01223" name="l01223"></a><span class="lineno"> 1223</span> if (a.dist_to_max_value == b.dist_to_max_value) {</div>
<div class="line"><a id="l01224" name="l01224"></a><span class="lineno"> 1224</span> <span class="comment">// Prefer low coefficients if the distance is the same.</span></div>
<div class="line"><a id="l01225" name="l01225"></a><span class="lineno"> 1225</span> return a.positive_coeff &lt; b.positive_coeff;</div>
<div class="line"><a id="l01226" name="l01226"></a><span class="lineno"> 1226</span> }</div>
<div class="line"><a id="l01227" name="l01227"></a><span class="lineno"> 1227</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.dist_to_max_value &lt; <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.dist_to_max_value;</div>
<div class="line"><a id="l01228" name="l01228"></a><span class="lineno"> 1228</span> });</div>
<div class="line"><a id="l01229" name="l01229"></a><span class="lineno"> 1229</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; terms_.size(); ++i) {</div>
<div class="line"><a id="l01230" name="l01230"></a><span class="lineno"> 1230</span> <span class="keyword">const</span> Term&amp; term = terms_[i];</div>
<div class="line"><a id="l01231" name="l01231"></a><span class="lineno"> 1231</span> activity += term.dist_to_max_value;</div>
<div class="line"><a id="l01232" name="l01232"></a><span class="lineno"> 1232</span> </div>
<div class="line"><a id="l01233" name="l01233"></a><span class="lineno"> 1233</span> <span class="comment">// As an heuristic we select all the term so that the sum of distance</span></div>
<div class="line"><a id="l01234" name="l01234"></a><span class="lineno"> 1234</span> <span class="comment">// to the upper bound is &lt;= 1.0. If the corresponding rhs is negative, then</span></div>
<div class="line"><a id="l01235" name="l01235"></a><span class="lineno"> 1235</span> <span class="comment">// we will have a cut of violation at least 0.0. Note that this violation</span></div>
<div class="line"><a id="l01236" name="l01236"></a><span class="lineno"> 1236</span> <span class="comment">// can be improved by the lifting.</span></div>
<div class="line"><a id="l01237" name="l01237"></a><span class="lineno"> 1237</span> <span class="comment">//</span></div>
<div class="line"><a id="l01238" name="l01238"></a><span class="lineno"> 1238</span> <span class="comment">// TODO(user): experiment with different threshold (even greater than one).</span></div>
<div class="line"><a id="l01239" name="l01239"></a><span class="lineno"> 1239</span> <span class="comment">// Or come up with an algo that incorporate the lifting into the heuristic.</span></div>
<div class="line"><a id="l01240" name="l01240"></a><span class="lineno"> 1240</span> <span class="keywordflow">if</span> (activity &gt; 1.0) {</div>
<div class="line"><a id="l01241" name="l01241"></a><span class="lineno"> 1241</span> new_size = i; <span class="comment">// before this entry.</span></div>
<div class="line"><a id="l01242" name="l01242"></a><span class="lineno"> 1242</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l01243" name="l01243"></a><span class="lineno"> 1243</span> }</div>
<div class="line"><a id="l01244" name="l01244"></a><span class="lineno"> 1244</span> </div>
<div class="line"><a id="l01245" name="l01245"></a><span class="lineno"> 1245</span> rhs -= term.diff;</div>
<div class="line"><a id="l01246" name="l01246"></a><span class="lineno"> 1246</span> }</div>
<div class="line"><a id="l01247" name="l01247"></a><span class="lineno"> 1247</span> </div>
<div class="line"><a id="l01248" name="l01248"></a><span class="lineno"> 1248</span> <span class="comment">// If the rhs is now negative, we have a cut.</span></div>
<div class="line"><a id="l01249" name="l01249"></a><span class="lineno"> 1249</span> <span class="comment">//</span></div>
<div class="line"><a id="l01250" name="l01250"></a><span class="lineno"> 1250</span> <span class="comment">// Note(user): past this point, now that a given &quot;base&quot; cover has been chosen,</span></div>
<div class="line"><a id="l01251" name="l01251"></a><span class="lineno"> 1251</span> <span class="comment">// we basically compute the cut (of the form sum X &lt;= bound) with the maximum</span></div>
<div class="line"><a id="l01252" name="l01252"></a><span class="lineno"> 1252</span> <span class="comment">// possible violation. Note also that we lift as much as possible, so we don&#39;t</span></div>
<div class="line"><a id="l01253" name="l01253"></a><span class="lineno"> 1253</span> <span class="comment">// necessarily optimize for the cut efficacity though. But we do get a</span></div>
<div class="line"><a id="l01254" name="l01254"></a><span class="lineno"> 1254</span> <span class="comment">// stronger cut.</span></div>
<div class="line"><a id="l01255" name="l01255"></a><span class="lineno"> 1255</span> <span class="keywordflow">if</span> (rhs &gt;= 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l01256" name="l01256"></a><span class="lineno"> 1256</span> <span class="keywordflow">if</span> (new_size == 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l01257" name="l01257"></a><span class="lineno"> 1257</span> </div>
<div class="line"><a id="l01258" name="l01258"></a><span class="lineno"> 1258</span> <span class="comment">// Transform to a minimal cover. We want to greedily remove the largest coeff</span></div>
<div class="line"><a id="l01259" name="l01259"></a><span class="lineno"> 1259</span> <span class="comment">// first, so we have more chance for the &quot;lifting&quot; below which can increase</span></div>
<div class="line"><a id="l01260" name="l01260"></a><span class="lineno"> 1260</span> <span class="comment">// the cut violation. If the coeff are the same, we prefer to remove high</span></div>
<div class="line"><a id="l01261" name="l01261"></a><span class="lineno"> 1261</span> <span class="comment">// distance from upper bound first.</span></div>
<div class="line"><a id="l01262" name="l01262"></a><span class="lineno"> 1262</span> <span class="comment">//</span></div>
<div class="line"><a id="l01263" name="l01263"></a><span class="lineno"> 1263</span> <span class="comment">// We compute the cut at the same time.</span></div>
<div class="line"><a id="l01264" name="l01264"></a><span class="lineno"> 1264</span> terms_.resize(new_size);</div>
<div class="line"><a id="l01265" name="l01265"></a><span class="lineno"> 1265</span> std::sort(terms_.begin(), terms_.end(), [](<span class="keyword">const</span> Term&amp; <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <span class="keyword">const</span> Term&amp; <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) {</div>
<div class="line"><a id="l01266" name="l01266"></a><span class="lineno"> 1266</span> if (a.positive_coeff == b.positive_coeff) {</div>
<div class="line"><a id="l01267" name="l01267"></a><span class="lineno"> 1267</span> return a.dist_to_max_value &gt; b.dist_to_max_value;</div>
<div class="line"><a id="l01268" name="l01268"></a><span class="lineno"> 1268</span> }</div>
<div class="line"><a id="l01269" name="l01269"></a><span class="lineno"> 1269</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.positive_coeff &gt; <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.positive_coeff;</div>
<div class="line"><a id="l01270" name="l01270"></a><span class="lineno"> 1270</span> });</div>
<div class="line"><a id="l01271" name="l01271"></a><span class="lineno"> 1271</span> in_cut_.assign(base_ct.vars.size(), <span class="keyword">false</span>);</div>
<div class="line"><a id="l01272" name="l01272"></a><span class="lineno"> 1272</span> cut_.ClearTerms();</div>
<div class="line"><a id="l01273" name="l01273"></a><span class="lineno"> 1273</span> cut_.lb = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5316808a2d5007c3b489e844801385e5">kMinIntegerValue</a>;</div>
<div class="line"><a id="l01274" name="l01274"></a><span class="lineno"> 1274</span> cut_.ub = IntegerValue(-1);</div>
<div class="line"><a id="l01275" name="l01275"></a><span class="lineno"> 1275</span> IntegerValue max_coeff(0);</div>
<div class="line"><a id="l01276" name="l01276"></a><span class="lineno"> 1276</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> Term term : terms_) {</div>
<div class="line"><a id="l01277" name="l01277"></a><span class="lineno"> 1277</span> <span class="keywordflow">if</span> (term.diff + rhs &lt; 0) {</div>
<div class="line"><a id="l01278" name="l01278"></a><span class="lineno"> 1278</span> rhs += term.diff;</div>
<div class="line"><a id="l01279" name="l01279"></a><span class="lineno"> 1279</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l01280" name="l01280"></a><span class="lineno"> 1280</span> }</div>
<div class="line"><a id="l01281" name="l01281"></a><span class="lineno"> 1281</span> in_cut_[term.index] = <span class="keyword">true</span>;</div>
<div class="line"><a id="l01282" name="l01282"></a><span class="lineno"> 1282</span> max_coeff = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_coeff, term.positive_coeff);</div>
<div class="line"><a id="l01283" name="l01283"></a><span class="lineno"> 1283</span> cut_.vars.push_back(base_ct.vars[term.index]);</div>
<div class="line"><a id="l01284" name="l01284"></a><span class="lineno"> 1284</span> <span class="keywordflow">if</span> (base_ct.coeffs[term.index] &gt; 0) {</div>
<div class="line"><a id="l01285" name="l01285"></a><span class="lineno"> 1285</span> cut_.coeffs.push_back(IntegerValue(1));</div>
<div class="line"><a id="l01286" name="l01286"></a><span class="lineno"> 1286</span> cut_.ub += <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a88215c8581662c40eec0fb8621c44af3">upper_bounds</a>[term.index];</div>
<div class="line"><a id="l01287" name="l01287"></a><span class="lineno"> 1287</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l01288" name="l01288"></a><span class="lineno"> 1288</span> cut_.coeffs.push_back(IntegerValue(-1));</div>
<div class="line"><a id="l01289" name="l01289"></a><span class="lineno"> 1289</span> cut_.ub -= <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>[term.index];</div>
<div class="line"><a id="l01290" name="l01290"></a><span class="lineno"> 1290</span> }</div>
<div class="line"><a id="l01291" name="l01291"></a><span class="lineno"> 1291</span> }</div>
<div class="line"><a id="l01292" name="l01292"></a><span class="lineno"> 1292</span> </div>
<div class="line"><a id="l01293" name="l01293"></a><span class="lineno"> 1293</span> <span class="comment">// In case the max_coeff variable is not binary, it might be possible to</span></div>
<div class="line"><a id="l01294" name="l01294"></a><span class="lineno"> 1294</span> <span class="comment">// tighten the cut a bit more.</span></div>
<div class="line"><a id="l01295" name="l01295"></a><span class="lineno"> 1295</span> <span class="comment">//</span></div>
<div class="line"><a id="l01296" name="l01296"></a><span class="lineno"> 1296</span> <span class="comment">// Note(user): I never observed this on the miplib so far.</span></div>
<div class="line"><a id="l01297" name="l01297"></a><span class="lineno"> 1297</span> <span class="keywordflow">if</span> (max_coeff == 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l01298" name="l01298"></a><span class="lineno"> 1298</span> <span class="keywordflow">if</span> (max_coeff &lt; -rhs) {</div>
<div class="line"><a id="l01299" name="l01299"></a><span class="lineno"> 1299</span> <span class="keyword">const</span> IntegerValue m = <a class="code hl_function" href="namespaceoperations__research.html#a1e2ec837105d112356116f6308b73fca">FloorRatio</a>(-rhs - 1, max_coeff);</div>
<div class="line"><a id="l01300" name="l01300"></a><span class="lineno"> 1300</span> rhs += max_coeff * m;</div>
<div class="line"><a id="l01301" name="l01301"></a><span class="lineno"> 1301</span> cut_.ub -= m;</div>
<div class="line"><a id="l01302" name="l01302"></a><span class="lineno"> 1302</span> }</div>
<div class="line"><a id="l01303" name="l01303"></a><span class="lineno"> 1303</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(rhs, 0);</div>
<div class="line"><a id="l01304" name="l01304"></a><span class="lineno"> 1304</span> </div>
<div class="line"><a id="l01305" name="l01305"></a><span class="lineno"> 1305</span> <span class="comment">// Lift all at once the variables not used in the cover.</span></div>
<div class="line"><a id="l01306" name="l01306"></a><span class="lineno"> 1306</span> <span class="comment">//</span></div>
<div class="line"><a id="l01307" name="l01307"></a><span class="lineno"> 1307</span> <span class="comment">// We have a cut of the form sum_i X_i &lt;= b that we will lift into</span></div>
<div class="line"><a id="l01308" name="l01308"></a><span class="lineno"> 1308</span> <span class="comment">// sum_i scaling X_i + sum f(base_coeff_j) X_j &lt;= b * scaling.</span></div>
<div class="line"><a id="l01309" name="l01309"></a><span class="lineno"> 1309</span> <span class="comment">//</span></div>
<div class="line"><a id="l01310" name="l01310"></a><span class="lineno"> 1310</span> <span class="comment">// Using the super additivity of f() and how we construct it,</span></div>
<div class="line"><a id="l01311" name="l01311"></a><span class="lineno"> 1311</span> <span class="comment">// we know that: sum_j base_coeff_j X_j &lt;= N * max_coeff + (max_coeff - slack)</span></div>
<div class="line"><a id="l01312" name="l01312"></a><span class="lineno"> 1312</span> <span class="comment">// implies that: sum_j f(base_coeff_j) X_j &lt;= N * scaling.</span></div>
<div class="line"><a id="l01313" name="l01313"></a><span class="lineno"> 1313</span> <span class="comment">//</span></div>
<div class="line"><a id="l01314" name="l01314"></a><span class="lineno"> 1314</span> <span class="comment">// 1/ cut &gt; b -(N+1) =&gt; original sum + (N+1) * max_coeff &gt;= rhs + slack</span></div>
<div class="line"><a id="l01315" name="l01315"></a><span class="lineno"> 1315</span> <span class="comment">// 2/ rewrite 1/ as : scaling * cut &gt;= scaling * b - scaling * N =&gt; ...</span></div>
<div class="line"><a id="l01316" name="l01316"></a><span class="lineno"> 1316</span> <span class="comment">// 3/ lift &gt; N * scaling =&gt; lift_sum &gt; N * max_coeff + (max_coeff - slack)</span></div>
<div class="line"><a id="l01317" name="l01317"></a><span class="lineno"> 1317</span> <span class="comment">// And adding 2/ + 3/ we prove what we want:</span></div>
<div class="line"><a id="l01318" name="l01318"></a><span class="lineno"> 1318</span> <span class="comment">// cut * scaling + lift &gt; b * scaling =&gt; original_sum + lift_sum &gt; rhs.</span></div>
<div class="line"><a id="l01319" name="l01319"></a><span class="lineno"> 1319</span> <span class="keyword">const</span> IntegerValue slack = -rhs;</div>
<div class="line"><a id="l01320" name="l01320"></a><span class="lineno"> 1320</span> <span class="keyword">const</span> IntegerValue remainder = max_coeff - slack;</div>
<div class="line"><a id="l01321" name="l01321"></a><span class="lineno"> 1321</span> max_base_magnitude = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_base_magnitude, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(cut_.ub));</div>
<div class="line"><a id="l01322" name="l01322"></a><span class="lineno"> 1322</span> <span class="keyword">const</span> IntegerValue max_scaling(<a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(</div>
<div class="line"><a id="l01323" name="l01323"></a><span class="lineno"> 1323</span> IntegerValue(60), <a class="code hl_function" href="namespaceoperations__research.html#a1e2ec837105d112356116f6308b73fca">FloorRatio</a>(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>, max_base_magnitude)));</div>
<div class="line"><a id="l01324" name="l01324"></a><span class="lineno"> 1324</span> <span class="keyword">const</span> <span class="keyword">auto</span> f = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a8e30df8580d6914abba28f43b6e4e667">GetSuperAdditiveRoundingFunction</a>(remainder, max_coeff,</div>
<div class="line"><a id="l01325" name="l01325"></a><span class="lineno"> 1325</span> IntegerValue(1), max_scaling);</div>
<div class="line"><a id="l01326" name="l01326"></a><span class="lineno"> 1326</span> </div>
<div class="line"><a id="l01327" name="l01327"></a><span class="lineno"> 1327</span> <span class="keyword">const</span> IntegerValue scaling = f(max_coeff);</div>
<div class="line"><a id="l01328" name="l01328"></a><span class="lineno"> 1328</span> <span class="keywordflow">if</span> (scaling &gt; 1) {</div>
<div class="line"><a id="l01329" name="l01329"></a><span class="lineno"> 1329</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; cut_.coeffs.size(); ++i) cut_.coeffs[i] *= scaling;</div>
<div class="line"><a id="l01330" name="l01330"></a><span class="lineno"> 1330</span> cut_.ub *= scaling;</div>
<div class="line"><a id="l01331" name="l01331"></a><span class="lineno"> 1331</span> }</div>
<div class="line"><a id="l01332" name="l01332"></a><span class="lineno"> 1332</span> </div>
<div class="line"><a id="l01333" name="l01333"></a><span class="lineno"> 1333</span> num_lifting_ = 0;</div>
<div class="line"><a id="l01334" name="l01334"></a><span class="lineno"> 1334</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; base_size; ++i) {</div>
<div class="line"><a id="l01335" name="l01335"></a><span class="lineno"> 1335</span> <span class="keywordflow">if</span> (in_cut_[i]) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l01336" name="l01336"></a><span class="lineno"> 1336</span> <span class="keyword">const</span> IntegerValue positive_coeff = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(base_ct.coeffs[i]);</div>
<div class="line"><a id="l01337" name="l01337"></a><span class="lineno"> 1337</span> <span class="keyword">const</span> IntegerValue new_coeff = f(positive_coeff);</div>
<div class="line"><a id="l01338" name="l01338"></a><span class="lineno"> 1338</span> <span class="keywordflow">if</span> (new_coeff == 0) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l01339" name="l01339"></a><span class="lineno"> 1339</span> </div>
<div class="line"><a id="l01340" name="l01340"></a><span class="lineno"> 1340</span> ++num_lifting_;</div>
<div class="line"><a id="l01341" name="l01341"></a><span class="lineno"> 1341</span> <span class="keywordflow">if</span> (base_ct.coeffs[i] &gt; 0) {</div>
<div class="line"><a id="l01342" name="l01342"></a><span class="lineno"> 1342</span> <span class="comment">// Add new_coeff * (X - LB)</span></div>
<div class="line"><a id="l01343" name="l01343"></a><span class="lineno"> 1343</span> cut_.coeffs.push_back(new_coeff);</div>
<div class="line"><a id="l01344" name="l01344"></a><span class="lineno"> 1344</span> cut_.vars.push_back(base_ct.vars[i]);</div>
<div class="line"><a id="l01345" name="l01345"></a><span class="lineno"> 1345</span> cut_.ub += <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>[i] * new_coeff;</div>
<div class="line"><a id="l01346" name="l01346"></a><span class="lineno"> 1346</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l01347" name="l01347"></a><span class="lineno"> 1347</span> <span class="comment">// Add new_coeff * (UB - X)</span></div>
<div class="line"><a id="l01348" name="l01348"></a><span class="lineno"> 1348</span> cut_.coeffs.push_back(-new_coeff);</div>
<div class="line"><a id="l01349" name="l01349"></a><span class="lineno"> 1349</span> cut_.vars.push_back(base_ct.vars[i]);</div>
<div class="line"><a id="l01350" name="l01350"></a><span class="lineno"> 1350</span> cut_.ub -= <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a88215c8581662c40eec0fb8621c44af3">upper_bounds</a>[i] * new_coeff;</div>
<div class="line"><a id="l01351" name="l01351"></a><span class="lineno"> 1351</span> }</div>
<div class="line"><a id="l01352" name="l01352"></a><span class="lineno"> 1352</span> }</div>
<div class="line"><a id="l01353" name="l01353"></a><span class="lineno"> 1353</span> </div>
<div class="line"><a id="l01354" name="l01354"></a><span class="lineno"> 1354</span> <span class="keywordflow">if</span> (scaling &gt; 1) <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ae3c495e2e05950c578b01976701f9b2a">DivideByGCD</a>(&amp;cut_);</div>
<div class="line"><a id="l01355" name="l01355"></a><span class="lineno"> 1355</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l01356" name="l01356"></a><span class="lineno"> 1356</span>}</div>
<div class="line"><a id="l01357" name="l01357"></a><span class="lineno"> 1357</span> </div>
<div class="line"><a id="l01358" name="l01358"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a86a16fa3180f4ebc8ac36c16a2b49fac"> 1358</a></span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a86a16fa3180f4ebc8ac36c16a2b49fac">CreatePositiveMultiplicationCutGenerator</a>(<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> z,</div>
<div class="line"><a id="l01359" name="l01359"></a><span class="lineno"> 1359</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> x,</div>
<div class="line"><a id="l01360" name="l01360"></a><span class="lineno"> 1360</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> y,</div>
<div class="line"><a id="l01361" name="l01361"></a><span class="lineno"> 1361</span> <span class="keywordtype">int</span> linearization_level,</div>
<div class="line"><a id="l01362" name="l01362"></a><span class="lineno"> 1362</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
<div class="line"><a id="l01363" name="l01363"></a><span class="lineno"> 1363</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div>
<div class="line"><a id="l01364" name="l01364"></a><span class="lineno"> 1364</span> <span class="keywordflow">if</span> (z.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a> != <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.push_back(z.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a>);</div>
<div class="line"><a id="l01365" name="l01365"></a><span class="lineno"> 1365</span> <span class="keywordflow">if</span> (x.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a> != <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.push_back(x.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a>);</div>
<div class="line"><a id="l01366" name="l01366"></a><span class="lineno"> 1366</span> <span class="keywordflow">if</span> (y.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a> != <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.push_back(y.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a>);</div>
<div class="line"><a id="l01367" name="l01367"></a><span class="lineno"> 1367</span> </div>
<div class="line"><a id="l01368" name="l01368"></a><span class="lineno"> 1368</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* <span class="keyword">const</span> integer_trail = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>-&gt;GetOrCreate&lt;<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>&gt;();</div>
<div class="line"><a id="l01369" name="l01369"></a><span class="lineno"> 1369</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>-&gt;GetOrCreate&lt;<a class="code hl_class" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>&gt;();</div>
<div class="line"><a id="l01370" name="l01370"></a><span class="lineno"> 1370</span> </div>
<div class="line"><a id="l01371" name="l01371"></a><span class="lineno"> 1371</span> result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">generate_cuts</a> =</div>
<div class="line"><a id="l01372" name="l01372"></a><span class="lineno"> 1372</span> [z, x, y, linearization_level, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, trail, integer_trail](</div>
<div class="line"><a id="l01373" name="l01373"></a><span class="lineno"> 1373</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values,</div>
<div class="line"><a id="l01374" name="l01374"></a><span class="lineno"> 1374</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div>
<div class="line"><a id="l01375" name="l01375"></a><span class="lineno"> 1375</span> <span class="keywordflow">if</span> (trail-&gt;CurrentDecisionLevel() &gt; 0 &amp;&amp; linearization_level == 1) {</div>
<div class="line"><a id="l01376" name="l01376"></a><span class="lineno"> 1376</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l01377" name="l01377"></a><span class="lineno"> 1377</span> }</div>
<div class="line"><a id="l01378" name="l01378"></a><span class="lineno"> 1378</span> <span class="keyword">const</span> int64_t x_lb = integer_trail-&gt;<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(x).value();</div>
<div class="line"><a id="l01379" name="l01379"></a><span class="lineno"> 1379</span> <span class="keyword">const</span> int64_t x_ub = integer_trail-&gt;<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(x).value();</div>
<div class="line"><a id="l01380" name="l01380"></a><span class="lineno"> 1380</span> <span class="keyword">const</span> int64_t y_lb = integer_trail-&gt;<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(y).value();</div>
<div class="line"><a id="l01381" name="l01381"></a><span class="lineno"> 1381</span> <span class="keyword">const</span> int64_t y_ub = integer_trail-&gt;<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(y).value();</div>
<div class="line"><a id="l01382" name="l01382"></a><span class="lineno"> 1382</span> </div>
<div class="line"><a id="l01383" name="l01383"></a><span class="lineno"> 1383</span> <span class="comment">// TODO(user): Compute a better bound (int_max / 4 ?).</span></div>
<div class="line"><a id="l01384" name="l01384"></a><span class="lineno"> 1384</span> <span class="keyword">const</span> int64_t kMaxSafeInteger = (int64_t{1} &lt;&lt; 53) - 1;</div>
<div class="line"><a id="l01385" name="l01385"></a><span class="lineno"> 1385</span> </div>
<div class="line"><a id="l01386" name="l01386"></a><span class="lineno"> 1386</span> <span class="comment">// Check for overflow with the product of expression bounds and the</span></div>
<div class="line"><a id="l01387" name="l01387"></a><span class="lineno"> 1387</span> <span class="comment">// product of one expression bound times the constant part of the other</span></div>
<div class="line"><a id="l01388" name="l01388"></a><span class="lineno"> 1388</span> <span class="comment">// expression.</span></div>
<div class="line"><a id="l01389" name="l01389"></a><span class="lineno"> 1389</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(<a class="code hl_function" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(x_ub, y_ub), 2) &gt;= kMaxSafeInteger ||</div>
<div class="line"><a id="l01390" name="l01390"></a><span class="lineno"> 1390</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code hl_function" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(x_ub, y.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_affine_expression.html#a06a78ca452e0ab05313a836b024352f2">constant</a>.value()),</div>
<div class="line"><a id="l01391" name="l01391"></a><span class="lineno"> 1391</span> <a class="code hl_function" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(y_ub, x.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_affine_expression.html#a06a78ca452e0ab05313a836b024352f2">constant</a>.value())) &gt;= kMaxSafeInteger) {</div>
<div class="line"><a id="l01392" name="l01392"></a><span class="lineno"> 1392</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) &lt;&lt; <span class="stringliteral">&quot;Potential overflow in PositiveMultiplicationCutGenerator&quot;</span>;</div>
<div class="line"><a id="l01393" name="l01393"></a><span class="lineno"> 1393</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l01394" name="l01394"></a><span class="lineno"> 1394</span> }</div>
<div class="line"><a id="l01395" name="l01395"></a><span class="lineno"> 1395</span> </div>
<div class="line"><a id="l01396" name="l01396"></a><span class="lineno"> 1396</span> <span class="keyword">const</span> <span class="keywordtype">double</span> x_lp_value = x.<a class="code hl_function" href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(lp_values);</div>
<div class="line"><a id="l01397" name="l01397"></a><span class="lineno"> 1397</span> <span class="keyword">const</span> <span class="keywordtype">double</span> y_lp_value = y.<a class="code hl_function" href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(lp_values);</div>
<div class="line"><a id="l01398" name="l01398"></a><span class="lineno"> 1398</span> <span class="keyword">const</span> <span class="keywordtype">double</span> z_lp_value = z.<a class="code hl_function" href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(lp_values);</div>
<div class="line"><a id="l01399" name="l01399"></a><span class="lineno"> 1399</span> </div>
<div class="line"><a id="l01400" name="l01400"></a><span class="lineno"> 1400</span> <span class="comment">// TODO(user): As the bounds change monotonically, these cuts</span></div>
<div class="line"><a id="l01401" name="l01401"></a><span class="lineno"> 1401</span> <span class="comment">// dominate any previous one. try to keep a reference to the cut and</span></div>
<div class="line"><a id="l01402" name="l01402"></a><span class="lineno"> 1402</span> <span class="comment">// replace it. Alternatively, add an API for a level-zero bound change</span></div>
<div class="line"><a id="l01403" name="l01403"></a><span class="lineno"> 1403</span> <span class="comment">// callback.</span></div>
<div class="line"><a id="l01404" name="l01404"></a><span class="lineno"> 1404</span> </div>
<div class="line"><a id="l01405" name="l01405"></a><span class="lineno"> 1405</span> <span class="comment">// Cut -z + x_coeff * x + y_coeff* y &lt;= rhs</span></div>
<div class="line"><a id="l01406" name="l01406"></a><span class="lineno"> 1406</span> <span class="keyword">auto</span> try_add_above_cut =</div>
<div class="line"><a id="l01407" name="l01407"></a><span class="lineno"> 1407</span> [manager, z_lp_value, x_lp_value, y_lp_value, x, y, z, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
<div class="line"><a id="l01408" name="l01408"></a><span class="lineno"> 1408</span> &amp;lp_values](int64_t x_coeff, int64_t y_coeff, int64_t rhs) {</div>
<div class="line"><a id="l01409" name="l01409"></a><span class="lineno"> 1409</span> <span class="keywordflow">if</span> (-z_lp_value + x_lp_value * x_coeff + y_lp_value * y_coeff &gt;=</div>
<div class="line"><a id="l01410" name="l01410"></a><span class="lineno"> 1410</span> rhs + kMinCutViolation) {</div>
<div class="line"><a id="l01411" name="l01411"></a><span class="lineno"> 1411</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">LinearConstraintBuilder</a> cut(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <span class="comment">/*lb=*/</span><a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5316808a2d5007c3b489e844801385e5">kMinIntegerValue</a>,</div>
<div class="line"><a id="l01412" name="l01412"></a><span class="lineno"> 1412</span> <span class="comment">/*ub=*/</span>IntegerValue(rhs));</div>
<div class="line"><a id="l01413" name="l01413"></a><span class="lineno"> 1413</span> cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(z, IntegerValue(-1));</div>
<div class="line"><a id="l01414" name="l01414"></a><span class="lineno"> 1414</span> <span class="keywordflow">if</span> (x_coeff != 0) cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(x, IntegerValue(x_coeff));</div>
<div class="line"><a id="l01415" name="l01415"></a><span class="lineno"> 1415</span> <span class="keywordflow">if</span> (y_coeff != 0) cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(y, IntegerValue(y_coeff));</div>
<div class="line"><a id="l01416" name="l01416"></a><span class="lineno"> 1416</span> manager-&gt;AddCut(cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">Build</a>(), <span class="stringliteral">&quot;PositiveProduct&quot;</span>, lp_values);</div>
<div class="line"><a id="l01417" name="l01417"></a><span class="lineno"> 1417</span> }</div>
<div class="line"><a id="l01418" name="l01418"></a><span class="lineno"> 1418</span> };</div>
<div class="line"><a id="l01419" name="l01419"></a><span class="lineno"> 1419</span> </div>
<div class="line"><a id="l01420" name="l01420"></a><span class="lineno"> 1420</span> <span class="comment">// Cut -z + x_coeff * x + y_coeff* y &gt;= rhs</span></div>
<div class="line"><a id="l01421" name="l01421"></a><span class="lineno"> 1421</span> <span class="keyword">auto</span> try_add_below_cut =</div>
<div class="line"><a id="l01422" name="l01422"></a><span class="lineno"> 1422</span> [manager, z_lp_value, x_lp_value, y_lp_value, x, y, z, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
<div class="line"><a id="l01423" name="l01423"></a><span class="lineno"> 1423</span> &amp;lp_values](int64_t x_coeff, int64_t y_coeff, int64_t rhs) {</div>
<div class="line"><a id="l01424" name="l01424"></a><span class="lineno"> 1424</span> <span class="keywordflow">if</span> (-z_lp_value + x_lp_value * x_coeff + y_lp_value * y_coeff &lt;=</div>
<div class="line"><a id="l01425" name="l01425"></a><span class="lineno"> 1425</span> rhs - kMinCutViolation) {</div>
<div class="line"><a id="l01426" name="l01426"></a><span class="lineno"> 1426</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">LinearConstraintBuilder</a> cut(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <span class="comment">/*lb=*/</span>IntegerValue(rhs),</div>
<div class="line"><a id="l01427" name="l01427"></a><span class="lineno"> 1427</span> <span class="comment">/*ub=*/</span><a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>);</div>
<div class="line"><a id="l01428" name="l01428"></a><span class="lineno"> 1428</span> cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(z, IntegerValue(-1));</div>
<div class="line"><a id="l01429" name="l01429"></a><span class="lineno"> 1429</span> <span class="keywordflow">if</span> (x_coeff != 0) cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(x, IntegerValue(x_coeff));</div>
<div class="line"><a id="l01430" name="l01430"></a><span class="lineno"> 1430</span> <span class="keywordflow">if</span> (y_coeff != 0) cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(y, IntegerValue(y_coeff));</div>
<div class="line"><a id="l01431" name="l01431"></a><span class="lineno"> 1431</span> manager-&gt;AddCut(cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">Build</a>(), <span class="stringliteral">&quot;PositiveProduct&quot;</span>, lp_values);</div>
<div class="line"><a id="l01432" name="l01432"></a><span class="lineno"> 1432</span> }</div>
<div class="line"><a id="l01433" name="l01433"></a><span class="lineno"> 1433</span> };</div>
<div class="line"><a id="l01434" name="l01434"></a><span class="lineno"> 1434</span> </div>
<div class="line"><a id="l01435" name="l01435"></a><span class="lineno"> 1435</span> <span class="comment">// McCormick relaxation of bilinear constraints. These 4 cuts are the</span></div>
<div class="line"><a id="l01436" name="l01436"></a><span class="lineno"> 1436</span> <span class="comment">// exact facets of the x * y polyhedron for a bounded x and y.</span></div>
<div class="line"><a id="l01437" name="l01437"></a><span class="lineno"> 1437</span> <span class="comment">//</span></div>
<div class="line"><a id="l01438" name="l01438"></a><span class="lineno"> 1438</span> <span class="comment">// Each cut correspond to plane that contains two of the line</span></div>
<div class="line"><a id="l01439" name="l01439"></a><span class="lineno"> 1439</span> <span class="comment">// (x=x_lb), (x=x_ub), (y=y_lb), (y=y_ub). The easiest to</span></div>
<div class="line"><a id="l01440" name="l01440"></a><span class="lineno"> 1440</span> <span class="comment">// understand them is to draw the x*y curves and see the 4</span></div>
<div class="line"><a id="l01441" name="l01441"></a><span class="lineno"> 1441</span> <span class="comment">// planes that correspond to the convex hull of the graph.</span></div>
<div class="line"><a id="l01442" name="l01442"></a><span class="lineno"> 1442</span> try_add_above_cut(y_lb, x_lb, x_lb * y_lb);</div>
<div class="line"><a id="l01443" name="l01443"></a><span class="lineno"> 1443</span> try_add_above_cut(y_ub, x_ub, x_ub * y_ub);</div>
<div class="line"><a id="l01444" name="l01444"></a><span class="lineno"> 1444</span> try_add_below_cut(y_ub, x_lb, x_lb * y_ub);</div>
<div class="line"><a id="l01445" name="l01445"></a><span class="lineno"> 1445</span> try_add_below_cut(y_lb, x_ub, x_ub * y_lb);</div>
<div class="line"><a id="l01446" name="l01446"></a><span class="lineno"> 1446</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l01447" name="l01447"></a><span class="lineno"> 1447</span> };</div>
<div class="line"><a id="l01448" name="l01448"></a><span class="lineno"> 1448</span> </div>
<div class="line"><a id="l01449" name="l01449"></a><span class="lineno"> 1449</span> <span class="keywordflow">return</span> result;</div>
<div class="line"><a id="l01450" name="l01450"></a><span class="lineno"> 1450</span>}</div>
<div class="line"><a id="l01451" name="l01451"></a><span class="lineno"> 1451</span> </div>
<div class="line"><a id="l01452" name="l01452"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a91e92ebb8d6c8bd62ae597625f443427"> 1452</a></span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a91e92ebb8d6c8bd62ae597625f443427">CreateSquareCutGenerator</a>(<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> y, <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> x,</div>
<div class="line"><a id="l01453" name="l01453"></a><span class="lineno"> 1453</span> <span class="keywordtype">int</span> linearization_level, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
<div class="line"><a id="l01454" name="l01454"></a><span class="lineno"> 1454</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div>
<div class="line"><a id="l01455" name="l01455"></a><span class="lineno"> 1455</span> <span class="keywordflow">if</span> (x.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a> != <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.push_back(x.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a>);</div>
<div class="line"><a id="l01456" name="l01456"></a><span class="lineno"> 1456</span> <span class="keywordflow">if</span> (y.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a> != <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.push_back(y.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a>);</div>
<div class="line"><a id="l01457" name="l01457"></a><span class="lineno"> 1457</span> </div>
<div class="line"><a id="l01458" name="l01458"></a><span class="lineno"> 1458</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>-&gt;GetOrCreate&lt;<a class="code hl_class" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>&gt;();</div>
<div class="line"><a id="l01459" name="l01459"></a><span class="lineno"> 1459</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>-&gt;GetOrCreate&lt;<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>&gt;();</div>
<div class="line"><a id="l01460" name="l01460"></a><span class="lineno"> 1460</span> result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">generate_cuts</a> =</div>
<div class="line"><a id="l01461" name="l01461"></a><span class="lineno"> 1461</span> [y, x, linearization_level, trail, integer_trail, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>](</div>
<div class="line"><a id="l01462" name="l01462"></a><span class="lineno"> 1462</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values,</div>
<div class="line"><a id="l01463" name="l01463"></a><span class="lineno"> 1463</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div>
<div class="line"><a id="l01464" name="l01464"></a><span class="lineno"> 1464</span> <span class="keywordflow">if</span> (trail-&gt;<a class="code hl_function" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() &gt; 0 &amp;&amp; linearization_level == 1) {</div>
<div class="line"><a id="l01465" name="l01465"></a><span class="lineno"> 1465</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l01466" name="l01466"></a><span class="lineno"> 1466</span> }</div>
<div class="line"><a id="l01467" name="l01467"></a><span class="lineno"> 1467</span> <span class="keyword">const</span> int64_t x_ub = integer_trail-&gt;LevelZeroUpperBound(x).value();</div>
<div class="line"><a id="l01468" name="l01468"></a><span class="lineno"> 1468</span> <span class="keyword">const</span> int64_t x_lb = integer_trail-&gt;LevelZeroLowerBound(x).value();</div>
<div class="line"><a id="l01469" name="l01469"></a><span class="lineno"> 1469</span> </div>
<div class="line"><a id="l01470" name="l01470"></a><span class="lineno"> 1470</span> <span class="keywordflow">if</span> (x_lb == x_ub) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l01471" name="l01471"></a><span class="lineno"> 1471</span> </div>
<div class="line"><a id="l01472" name="l01472"></a><span class="lineno"> 1472</span> <span class="comment">// Check for potential overflows.</span></div>
<div class="line"><a id="l01473" name="l01473"></a><span class="lineno"> 1473</span> <span class="keywordflow">if</span> (x_ub &gt; (int64_t{1} &lt;&lt; 31)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l01474" name="l01474"></a><span class="lineno"> 1474</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(x_lb, 0);</div>
<div class="line"><a id="l01475" name="l01475"></a><span class="lineno"> 1475</span> </div>
<div class="line"><a id="l01476" name="l01476"></a><span class="lineno"> 1476</span> <span class="keyword">const</span> <span class="keywordtype">double</span> y_lp_value = y.<a class="code hl_function" href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(lp_values);</div>
<div class="line"><a id="l01477" name="l01477"></a><span class="lineno"> 1477</span> <span class="keyword">const</span> <span class="keywordtype">double</span> x_lp_value = x.<a class="code hl_function" href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(lp_values);</div>
<div class="line"><a id="l01478" name="l01478"></a><span class="lineno"> 1478</span> </div>
<div class="line"><a id="l01479" name="l01479"></a><span class="lineno"> 1479</span> <span class="comment">// First cut: target should be below the line:</span></div>
<div class="line"><a id="l01480" name="l01480"></a><span class="lineno"> 1480</span> <span class="comment">// (x_lb, x_lb ^ 2) to (x_ub, x_ub ^ 2).</span></div>
<div class="line"><a id="l01481" name="l01481"></a><span class="lineno"> 1481</span> <span class="comment">// The slope of that line is (ub^2 - lb^2) / (ub - lb) = ub + lb.</span></div>
<div class="line"><a id="l01482" name="l01482"></a><span class="lineno"> 1482</span> <span class="keyword">const</span> int64_t y_lb = x_lb * x_lb;</div>
<div class="line"><a id="l01483" name="l01483"></a><span class="lineno"> 1483</span> <span class="keyword">const</span> int64_t above_slope = x_ub + x_lb;</div>
<div class="line"><a id="l01484" name="l01484"></a><span class="lineno"> 1484</span> <span class="keyword">const</span> <span class="keywordtype">double</span> max_lp_y = y_lb + above_slope * (x_lp_value - x_lb);</div>
<div class="line"><a id="l01485" name="l01485"></a><span class="lineno"> 1485</span> <span class="keywordflow">if</span> (y_lp_value &gt;= max_lp_y + kMinCutViolation) {</div>
<div class="line"><a id="l01486" name="l01486"></a><span class="lineno"> 1486</span> <span class="comment">// cut: y &lt;= (x_lb + x_ub) * x - x_lb * x_ub</span></div>
<div class="line"><a id="l01487" name="l01487"></a><span class="lineno"> 1487</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">LinearConstraintBuilder</a> above_cut(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5316808a2d5007c3b489e844801385e5">kMinIntegerValue</a>,</div>
<div class="line"><a id="l01488" name="l01488"></a><span class="lineno"> 1488</span> IntegerValue(-x_lb * x_ub));</div>
<div class="line"><a id="l01489" name="l01489"></a><span class="lineno"> 1489</span> above_cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(y, IntegerValue(1));</div>
<div class="line"><a id="l01490" name="l01490"></a><span class="lineno"> 1490</span> above_cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(x, IntegerValue(-above_slope));</div>
<div class="line"><a id="l01491" name="l01491"></a><span class="lineno"> 1491</span> manager-&gt;AddCut(above_cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">Build</a>(), <span class="stringliteral">&quot;SquareUpper&quot;</span>, lp_values);</div>
<div class="line"><a id="l01492" name="l01492"></a><span class="lineno"> 1492</span> }</div>
<div class="line"><a id="l01493" name="l01493"></a><span class="lineno"> 1493</span> </div>
<div class="line"><a id="l01494" name="l01494"></a><span class="lineno"> 1494</span> <span class="comment">// Second cut: target should be above all the lines</span></div>
<div class="line"><a id="l01495" name="l01495"></a><span class="lineno"> 1495</span> <span class="comment">// (value, value ^ 2) to (value + 1, (value + 1) ^ 2)</span></div>
<div class="line"><a id="l01496" name="l01496"></a><span class="lineno"> 1496</span> <span class="comment">// The slope of that line is 2 * value + 1</span></div>
<div class="line"><a id="l01497" name="l01497"></a><span class="lineno"> 1497</span> <span class="comment">//</span></div>
<div class="line"><a id="l01498" name="l01498"></a><span class="lineno"> 1498</span> <span class="comment">// Note that we only add one of these cuts. The one for x_lp_value in</span></div>
<div class="line"><a id="l01499" name="l01499"></a><span class="lineno"> 1499</span> <span class="comment">// [value, value + 1].</span></div>
<div class="line"><a id="l01500" name="l01500"></a><span class="lineno"> 1500</span> <span class="keyword">const</span> int64_t x_floor = <span class="keyword">static_cast&lt;</span>int64_t<span class="keyword">&gt;</span>(std::floor(x_lp_value));</div>
<div class="line"><a id="l01501" name="l01501"></a><span class="lineno"> 1501</span> <span class="keyword">const</span> int64_t below_slope = 2 * x_floor + 1;</div>
<div class="line"><a id="l01502" name="l01502"></a><span class="lineno"> 1502</span> <span class="keyword">const</span> <span class="keywordtype">double</span> min_lp_y =</div>
<div class="line"><a id="l01503" name="l01503"></a><span class="lineno"> 1503</span> below_slope * x_lp_value - x_floor - x_floor * x_floor;</div>
<div class="line"><a id="l01504" name="l01504"></a><span class="lineno"> 1504</span> <span class="keywordflow">if</span> (min_lp_y &gt;= y_lp_value + kMinCutViolation) {</div>
<div class="line"><a id="l01505" name="l01505"></a><span class="lineno"> 1505</span> <span class="comment">// cut: y &gt;= below_slope * (x - x_floor) + x_floor ^ 2</span></div>
<div class="line"><a id="l01506" name="l01506"></a><span class="lineno"> 1506</span> <span class="comment">// : y &gt;= below_slope * x - x_floor ^ 2 - x_floor</span></div>
<div class="line"><a id="l01507" name="l01507"></a><span class="lineno"> 1507</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">LinearConstraintBuilder</a> below_cut(</div>
<div class="line"><a id="l01508" name="l01508"></a><span class="lineno"> 1508</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, IntegerValue(-x_floor - x_floor * x_floor),</div>
<div class="line"><a id="l01509" name="l01509"></a><span class="lineno"> 1509</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>);</div>
<div class="line"><a id="l01510" name="l01510"></a><span class="lineno"> 1510</span> below_cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(y, IntegerValue(1));</div>
<div class="line"><a id="l01511" name="l01511"></a><span class="lineno"> 1511</span> below_cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(x, -IntegerValue(below_slope));</div>
<div class="line"><a id="l01512" name="l01512"></a><span class="lineno"> 1512</span> manager-&gt;AddCut(below_cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">Build</a>(), <span class="stringliteral">&quot;SquareLower&quot;</span>, lp_values);</div>
<div class="line"><a id="l01513" name="l01513"></a><span class="lineno"> 1513</span> }</div>
<div class="line"><a id="l01514" name="l01514"></a><span class="lineno"> 1514</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l01515" name="l01515"></a><span class="lineno"> 1515</span> };</div>
<div class="line"><a id="l01516" name="l01516"></a><span class="lineno"> 1516</span> </div>
<div class="line"><a id="l01517" name="l01517"></a><span class="lineno"> 1517</span> <span class="keywordflow">return</span> result;</div>
<div class="line"><a id="l01518" name="l01518"></a><span class="lineno"> 1518</span>}</div>
<div class="line"><a id="l01519" name="l01519"></a><span class="lineno"> 1519</span> </div>
<div class="line"><a id="l01520" name="l01520"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#a7fb8d0b24091252e79aea6e5666f29e8"> 1520</a></span><span class="keywordtype">void</span> ImpliedBoundsProcessor::ProcessUpperBoundedConstraint(</div>
<div class="line"><a id="l01521" name="l01521"></a><span class="lineno"> 1521</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values,</div>
<div class="line"><a id="l01522" name="l01522"></a><span class="lineno"> 1522</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>* cut) {</div>
<div class="line"><a id="l01523" name="l01523"></a><span class="lineno"> 1523</span> ProcessUpperBoundedConstraintWithSlackCreation(</div>
<div class="line"><a id="l01524" name="l01524"></a><span class="lineno"> 1524</span> <span class="comment">/*substitute_only_inner_variables=*/</span><span class="keyword">false</span>, IntegerVariable(0), lp_values,</div>
<div class="line"><a id="l01525" name="l01525"></a><span class="lineno"> 1525</span> cut, <span class="keyword">nullptr</span>);</div>
<div class="line"><a id="l01526" name="l01526"></a><span class="lineno"> 1526</span>}</div>
<div class="line"><a id="l01527" name="l01527"></a><span class="lineno"> 1527</span> </div>
<div class="line"><a id="l01528" name="l01528"></a><span class="lineno"> 1528</span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html">ImpliedBoundsProcessor::BestImpliedBoundInfo</a></div>
<div class="line"><a id="l01529" name="l01529"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#abb0b7cc2e259fc8ebe8fd3dd55816b75"> 1529</a></span>ImpliedBoundsProcessor::GetCachedImpliedBoundInfo(IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
<div class="line"><a id="l01530" name="l01530"></a><span class="lineno"> 1530</span> <span class="keyword">auto</span> it = cache_.find(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l01531" name="l01531"></a><span class="lineno"> 1531</span> <span class="keywordflow">if</span> (it != cache_.end()) <span class="keywordflow">return</span> it-&gt;second;</div>
<div class="line"><a id="l01532" name="l01532"></a><span class="lineno"> 1532</span> <span class="keywordflow">return</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html">BestImpliedBoundInfo</a>();</div>
<div class="line"><a id="l01533" name="l01533"></a><span class="lineno"> 1533</span>}</div>
<div class="line"><a id="l01534" name="l01534"></a><span class="lineno"> 1534</span> </div>
<div class="line"><a id="l01535" name="l01535"></a><span class="lineno"> 1535</span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html">ImpliedBoundsProcessor::BestImpliedBoundInfo</a></div>
<div class="line"><a id="l01536" name="l01536"></a><span class="lineno"> 1536</span>ImpliedBoundsProcessor::ComputeBestImpliedBound(</div>
<div class="line"><a id="l01537" name="l01537"></a><span class="lineno"> 1537</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>,</div>
<div class="line"><a id="l01538" name="l01538"></a><span class="lineno"> 1538</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values) {</div>
<div class="line"><a id="l01539" name="l01539"></a><span class="lineno"> 1539</span> <span class="keyword">auto</span> it = cache_.find(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l01540" name="l01540"></a><span class="lineno"> 1540</span> <span class="keywordflow">if</span> (it != cache_.end()) <span class="keywordflow">return</span> it-&gt;second;</div>
<div class="line"><a id="l01541" name="l01541"></a><span class="lineno"> 1541</span> BestImpliedBoundInfo result;</div>
<div class="line"><a id="l01542" name="l01542"></a><span class="lineno"> 1542</span> <span class="keyword">const</span> IntegerValue lb = integer_trail_-&gt;LevelZeroLowerBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l01543" name="l01543"></a><span class="lineno"> 1543</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_implied_bound_entry.html">ImpliedBoundEntry</a>&amp; entry :</div>
<div class="line"><a id="l01544" name="l01544"></a><span class="lineno"> 1544</span> implied_bounds_-&gt;GetImpliedBounds(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) {</div>
<div class="line"><a id="l01545" name="l01545"></a><span class="lineno"> 1545</span> <span class="comment">// Only process entries with a Boolean variable currently part of the LP</span></div>
<div class="line"><a id="l01546" name="l01546"></a><span class="lineno"> 1546</span> <span class="comment">// we are considering for this cut.</span></div>
<div class="line"><a id="l01547" name="l01547"></a><span class="lineno"> 1547</span> <span class="comment">//</span></div>
<div class="line"><a id="l01548" name="l01548"></a><span class="lineno"> 1548</span> <span class="comment">// TODO(user): the more we use cuts, the less it make sense to have a</span></div>
<div class="line"><a id="l01549" name="l01549"></a><span class="lineno"> 1549</span> <span class="comment">// lot of small independent LPs.</span></div>
<div class="line"><a id="l01550" name="l01550"></a><span class="lineno"> 1550</span> <span class="keywordflow">if</span> (!lp_vars_.contains(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">PositiveVariable</a>(entry.literal_view))) {</div>
<div class="line"><a id="l01551" name="l01551"></a><span class="lineno"> 1551</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l01552" name="l01552"></a><span class="lineno"> 1552</span> }</div>
<div class="line"><a id="l01553" name="l01553"></a><span class="lineno"> 1553</span> </div>
<div class="line"><a id="l01554" name="l01554"></a><span class="lineno"> 1554</span> <span class="comment">// The equation is X = lb + diff * Bool + Slack where Bool is in [0, 1]</span></div>
<div class="line"><a id="l01555" name="l01555"></a><span class="lineno"> 1555</span> <span class="comment">// and slack in [0, ub - lb].</span></div>
<div class="line"><a id="l01556" name="l01556"></a><span class="lineno"> 1556</span> <span class="keyword">const</span> IntegerValue diff = entry.lower_bound - lb;</div>
<div class="line"><a id="l01557" name="l01557"></a><span class="lineno"> 1557</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(diff, 0);</div>
<div class="line"><a id="l01558" name="l01558"></a><span class="lineno"> 1558</span> <span class="keyword">const</span> <span class="keywordtype">double</span> bool_lp_value = entry.is_positive</div>
<div class="line"><a id="l01559" name="l01559"></a><span class="lineno"> 1559</span> ? lp_values[entry.literal_view]</div>
<div class="line"><a id="l01560" name="l01560"></a><span class="lineno"> 1560</span> : 1.0 - lp_values[entry.literal_view];</div>
<div class="line"><a id="l01561" name="l01561"></a><span class="lineno"> 1561</span> <span class="keyword">const</span> <span class="keywordtype">double</span> slack_lp_value =</div>
<div class="line"><a id="l01562" name="l01562"></a><span class="lineno"> 1562</span> lp_values[<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] - <a class="code hl_function" href="namespaceoperations__research_1_1glop.html#afd6d278f9d061a91716c6770f2d723e8">ToDouble</a>(lb) - bool_lp_value * <a class="code hl_function" href="namespaceoperations__research_1_1glop.html#afd6d278f9d061a91716c6770f2d723e8">ToDouble</a>(diff);</div>
<div class="line"><a id="l01563" name="l01563"></a><span class="lineno"> 1563</span> </div>
<div class="line"><a id="l01564" name="l01564"></a><span class="lineno"> 1564</span> <span class="comment">// If the implied bound equation is not respected, we just add it</span></div>
<div class="line"><a id="l01565" name="l01565"></a><span class="lineno"> 1565</span> <span class="comment">// to implied_bound_cuts, and skip the entry for now.</span></div>
<div class="line"><a id="l01566" name="l01566"></a><span class="lineno"> 1566</span> <span class="keywordflow">if</span> (slack_lp_value &lt; -1e-4) {</div>
<div class="line"><a id="l01567" name="l01567"></a><span class="lineno"> 1567</span> LinearConstraint ib_cut;</div>
<div class="line"><a id="l01568" name="l01568"></a><span class="lineno"> 1568</span> ib_cut.lb = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5316808a2d5007c3b489e844801385e5">kMinIntegerValue</a>;</div>
<div class="line"><a id="l01569" name="l01569"></a><span class="lineno"> 1569</span> std::vector&lt;std::pair&lt;IntegerVariable, IntegerValue&gt;&gt; terms;</div>
<div class="line"><a id="l01570" name="l01570"></a><span class="lineno"> 1570</span> <span class="keywordflow">if</span> (entry.is_positive) {</div>
<div class="line"><a id="l01571" name="l01571"></a><span class="lineno"> 1571</span> <span class="comment">// X &gt;= Indicator * (bound - lb) + lb</span></div>
<div class="line"><a id="l01572" name="l01572"></a><span class="lineno"> 1572</span> terms.push_back({entry.literal_view, diff});</div>
<div class="line"><a id="l01573" name="l01573"></a><span class="lineno"> 1573</span> terms.push_back({<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, IntegerValue(-1)});</div>
<div class="line"><a id="l01574" name="l01574"></a><span class="lineno"> 1574</span> ib_cut.ub = -lb;</div>
<div class="line"><a id="l01575" name="l01575"></a><span class="lineno"> 1575</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l01576" name="l01576"></a><span class="lineno"> 1576</span> <span class="comment">// X &gt;= -Indicator * (bound - lb) + bound</span></div>
<div class="line"><a id="l01577" name="l01577"></a><span class="lineno"> 1577</span> terms.push_back({entry.literal_view, -diff});</div>
<div class="line"><a id="l01578" name="l01578"></a><span class="lineno"> 1578</span> terms.push_back({<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, IntegerValue(-1)});</div>
<div class="line"><a id="l01579" name="l01579"></a><span class="lineno"> 1579</span> ib_cut.ub = -entry.lower_bound;</div>
<div class="line"><a id="l01580" name="l01580"></a><span class="lineno"> 1580</span> }</div>
<div class="line"><a id="l01581" name="l01581"></a><span class="lineno"> 1581</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a6314c72e08e179c06ce3b76747499b8c">CleanTermsAndFillConstraint</a>(&amp;terms, &amp;ib_cut);</div>
<div class="line"><a id="l01582" name="l01582"></a><span class="lineno"> 1582</span> ib_cut_pool_.AddCut(std::move(ib_cut), <span class="stringliteral">&quot;IB&quot;</span>, lp_values);</div>
<div class="line"><a id="l01583" name="l01583"></a><span class="lineno"> 1583</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l01584" name="l01584"></a><span class="lineno"> 1584</span> }</div>
<div class="line"><a id="l01585" name="l01585"></a><span class="lineno"> 1585</span> </div>
<div class="line"><a id="l01586" name="l01586"></a><span class="lineno"> 1586</span> <span class="comment">// We look for tight implied bounds, and amongst the tightest one, we</span></div>
<div class="line"><a id="l01587" name="l01587"></a><span class="lineno"> 1587</span> <span class="comment">// prefer larger coefficient in front of the Boolean.</span></div>
<div class="line"><a id="l01588" name="l01588"></a><span class="lineno"> 1588</span> <span class="keywordflow">if</span> (slack_lp_value + 1e-4 &lt; result.slack_lp_value ||</div>
<div class="line"><a id="l01589" name="l01589"></a><span class="lineno"> 1589</span> (slack_lp_value &lt; result.slack_lp_value + 1e-4 &amp;&amp;</div>
<div class="line"><a id="l01590" name="l01590"></a><span class="lineno"> 1590</span> diff &gt; result.bound_diff)) {</div>
<div class="line"><a id="l01591" name="l01591"></a><span class="lineno"> 1591</span> result.bool_lp_value = bool_lp_value;</div>
<div class="line"><a id="l01592" name="l01592"></a><span class="lineno"> 1592</span> result.slack_lp_value = slack_lp_value;</div>
<div class="line"><a id="l01593" name="l01593"></a><span class="lineno"> 1593</span> </div>
<div class="line"><a id="l01594" name="l01594"></a><span class="lineno"> 1594</span> result.bound_diff = diff;</div>
<div class="line"><a id="l01595" name="l01595"></a><span class="lineno"> 1595</span> result.is_positive = entry.is_positive;</div>
<div class="line"><a id="l01596" name="l01596"></a><span class="lineno"> 1596</span> result.bool_var = entry.literal_view;</div>
<div class="line"><a id="l01597" name="l01597"></a><span class="lineno"> 1597</span> }</div>
<div class="line"><a id="l01598" name="l01598"></a><span class="lineno"> 1598</span> }</div>
<div class="line"><a id="l01599" name="l01599"></a><span class="lineno"> 1599</span> cache_[<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = result;</div>
<div class="line"><a id="l01600" name="l01600"></a><span class="lineno"> 1600</span> <span class="keywordflow">return</span> result;</div>
<div class="line"><a id="l01601" name="l01601"></a><span class="lineno"> 1601</span>}</div>
<div class="line"><a id="l01602" name="l01602"></a><span class="lineno"> 1602</span> </div>
<div class="line"><a id="l01603" name="l01603"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#ab354ebe396f7f5ad0c79ff2a928d9a40"> 1603</a></span><span class="keywordtype">void</span> ImpliedBoundsProcessor::RecomputeCacheAndSeparateSomeImpliedBoundCuts(</div>
<div class="line"><a id="l01604" name="l01604"></a><span class="lineno"> 1604</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values) {</div>
<div class="line"><a id="l01605" name="l01605"></a><span class="lineno"> 1605</span> cache_.clear();</div>
<div class="line"><a id="l01606" name="l01606"></a><span class="lineno"> 1606</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> :</div>
<div class="line"><a id="l01607" name="l01607"></a><span class="lineno"> 1607</span> implied_bounds_-&gt;VariablesWithImpliedBounds()) {</div>
<div class="line"><a id="l01608" name="l01608"></a><span class="lineno"> 1608</span> <span class="keywordflow">if</span> (!lp_vars_.contains(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">PositiveVariable</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>))) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l01609" name="l01609"></a><span class="lineno"> 1609</span> ComputeBestImpliedBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, lp_values);</div>
<div class="line"><a id="l01610" name="l01610"></a><span class="lineno"> 1610</span> }</div>
<div class="line"><a id="l01611" name="l01611"></a><span class="lineno"> 1611</span>}</div>
<div class="line"><a id="l01612" name="l01612"></a><span class="lineno"> 1612</span> </div>
<div class="line"><a id="l01613" name="l01613"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#a135d2e8757ef674942be0b1d6f46f75b"> 1613</a></span><span class="keywordtype">void</span> ImpliedBoundsProcessor::ProcessUpperBoundedConstraintWithSlackCreation(</div>
<div class="line"><a id="l01614" name="l01614"></a><span class="lineno"> 1614</span> <span class="keywordtype">bool</span> substitute_only_inner_variables, IntegerVariable first_slack,</div>
<div class="line"><a id="l01615" name="l01615"></a><span class="lineno"> 1615</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values,</div>
<div class="line"><a id="l01616" name="l01616"></a><span class="lineno"> 1616</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>* cut, std::vector&lt;SlackInfo&gt;* slack_infos) {</div>
<div class="line"><a id="l01617" name="l01617"></a><span class="lineno"> 1617</span> <span class="keywordflow">if</span> (cache_.empty()) <span class="keywordflow">return</span>; <span class="comment">// Nothing to do.</span></div>
<div class="line"><a id="l01618" name="l01618"></a><span class="lineno"> 1618</span> tmp_terms_.clear();</div>
<div class="line"><a id="l01619" name="l01619"></a><span class="lineno"> 1619</span> IntegerValue new_ub = cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>;</div>
<div class="line"><a id="l01620" name="l01620"></a><span class="lineno"> 1620</span> <span class="keywordtype">bool</span> changed = <span class="keyword">false</span>;</div>
<div class="line"><a id="l01621" name="l01621"></a><span class="lineno"> 1621</span> </div>
<div class="line"><a id="l01622" name="l01622"></a><span class="lineno"> 1622</span> <span class="comment">// TODO(user): we could relax a bit this test.</span></div>
<div class="line"><a id="l01623" name="l01623"></a><span class="lineno"> 1623</span> int64_t overflow_detection = 0;</div>
<div class="line"><a id="l01624" name="l01624"></a><span class="lineno"> 1624</span> </div>
<div class="line"><a id="l01625" name="l01625"></a><span class="lineno"> 1625</span> <span class="keyword">const</span> <span class="keywordtype">int</span> size = cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size();</div>
<div class="line"><a id="l01626" name="l01626"></a><span class="lineno"> 1626</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><a id="l01627" name="l01627"></a><span class="lineno"> 1627</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i];</div>
<div class="line"><a id="l01628" name="l01628"></a><span class="lineno"> 1628</span> IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i];</div>
<div class="line"><a id="l01629" name="l01629"></a><span class="lineno"> 1629</span> </div>
<div class="line"><a id="l01630" name="l01630"></a><span class="lineno"> 1630</span> <span class="comment">// Starts by positive coefficient.</span></div>
<div class="line"><a id="l01631" name="l01631"></a><span class="lineno"> 1631</span> <span class="comment">// TODO(user): Not clear this is best.</span></div>
<div class="line"><a id="l01632" name="l01632"></a><span class="lineno"> 1632</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> &lt; 0) {</div>
<div class="line"><a id="l01633" name="l01633"></a><span class="lineno"> 1633</span> <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = -<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>;</div>
<div class="line"><a id="l01634" name="l01634"></a><span class="lineno"> 1634</span> <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l01635" name="l01635"></a><span class="lineno"> 1635</span> }</div>
<div class="line"><a id="l01636" name="l01636"></a><span class="lineno"> 1636</span> </div>
<div class="line"><a id="l01637" name="l01637"></a><span class="lineno"> 1637</span> <span class="comment">// Find the best implied bound to use.</span></div>
<div class="line"><a id="l01638" name="l01638"></a><span class="lineno"> 1638</span> <span class="comment">// TODO(user): We could also use implied upper bound, that is try with</span></div>
<div class="line"><a id="l01639" name="l01639"></a><span class="lineno"> 1639</span> <span class="comment">// NegationOf(var).</span></div>
<div class="line"><a id="l01640" name="l01640"></a><span class="lineno"> 1640</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html">BestImpliedBoundInfo</a> info = GetCachedImpliedBoundInfo(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l01641" name="l01641"></a><span class="lineno"> 1641</span> <span class="keyword">const</span> <span class="keywordtype">int</span> old_size = tmp_terms_.size();</div>
<div class="line"><a id="l01642" name="l01642"></a><span class="lineno"> 1642</span> </div>
<div class="line"><a id="l01643" name="l01643"></a><span class="lineno"> 1643</span> <span class="comment">// Shall we keep the original term ?</span></div>
<div class="line"><a id="l01644" name="l01644"></a><span class="lineno"> 1644</span> <span class="keywordtype">bool</span> keep_term = <span class="keyword">false</span>;</div>
<div class="line"><a id="l01645" name="l01645"></a><span class="lineno"> 1645</span> <span class="keywordflow">if</span> (info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a871eaa421116e3c7cd440b6299d0b74d">bool_var</a> == <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) keep_term = <span class="keyword">true</span>;</div>
<div class="line"><a id="l01646" name="l01646"></a><span class="lineno"> 1646</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(std::abs(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>.value()), info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a2c25b894240115eebb2e75e2d8491a79">bound_diff</a>.value()) ==</div>
<div class="line"><a id="l01647" name="l01647"></a><span class="lineno"> 1647</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits&lt;int64_t&gt;::max</a>()) {</div>
<div class="line"><a id="l01648" name="l01648"></a><span class="lineno"> 1648</span> keep_term = <span class="keyword">true</span>;</div>
<div class="line"><a id="l01649" name="l01649"></a><span class="lineno"> 1649</span> }</div>
<div class="line"><a id="l01650" name="l01650"></a><span class="lineno"> 1650</span> </div>
<div class="line"><a id="l01651" name="l01651"></a><span class="lineno"> 1651</span> <span class="comment">// TODO(user): On some problem, not replacing the variable at their bound</span></div>
<div class="line"><a id="l01652" name="l01652"></a><span class="lineno"> 1652</span> <span class="comment">// by an implied bounds seems beneficial. This is especially the case on</span></div>
<div class="line"><a id="l01653" name="l01653"></a><span class="lineno"> 1653</span> <span class="comment">// g200x740.mps.gz</span></div>
<div class="line"><a id="l01654" name="l01654"></a><span class="lineno"> 1654</span> <span class="comment">//</span></div>
<div class="line"><a id="l01655" name="l01655"></a><span class="lineno"> 1655</span> <span class="comment">// Note that in ComputeCut() the variable with an LP value at the bound do</span></div>
<div class="line"><a id="l01656" name="l01656"></a><span class="lineno"> 1656</span> <span class="comment">// not contribute to the cut efficacity (no loss) but do contribute to the</span></div>
<div class="line"><a id="l01657" name="l01657"></a><span class="lineno"> 1657</span> <span class="comment">// various heuristic based on the coefficient magnitude.</span></div>
<div class="line"><a id="l01658" name="l01658"></a><span class="lineno"> 1658</span> <span class="keywordflow">if</span> (substitute_only_inner_variables) {</div>
<div class="line"><a id="l01659" name="l01659"></a><span class="lineno"> 1659</span> <span class="keyword">const</span> IntegerValue lb = integer_trail_-&gt;LevelZeroLowerBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l01660" name="l01660"></a><span class="lineno"> 1660</span> <span class="keyword">const</span> IntegerValue ub = integer_trail_-&gt;LevelZeroUpperBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l01661" name="l01661"></a><span class="lineno"> 1661</span> <span class="keywordflow">if</span> (lp_values[<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] - <a class="code hl_function" href="namespaceoperations__research_1_1glop.html#afd6d278f9d061a91716c6770f2d723e8">ToDouble</a>(lb) &lt; 1e-2) keep_term = <span class="keyword">true</span>;</div>
<div class="line"><a id="l01662" name="l01662"></a><span class="lineno"> 1662</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespaceoperations__research_1_1glop.html#afd6d278f9d061a91716c6770f2d723e8">ToDouble</a>(ub) - lp_values[<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] &lt; 1e-2) keep_term = <span class="keyword">true</span>;</div>
<div class="line"><a id="l01663" name="l01663"></a><span class="lineno"> 1663</span> }</div>
<div class="line"><a id="l01664" name="l01664"></a><span class="lineno"> 1664</span> </div>
<div class="line"><a id="l01665" name="l01665"></a><span class="lineno"> 1665</span> <span class="comment">// This is when we do not add slack.</span></div>
<div class="line"><a id="l01666" name="l01666"></a><span class="lineno"> 1666</span> <span class="keywordflow">if</span> (slack_infos == <span class="keyword">nullptr</span>) {</div>
<div class="line"><a id="l01667" name="l01667"></a><span class="lineno"> 1667</span> <span class="comment">// We do not want to loose anything, so we only replace if the slack lp is</span></div>
<div class="line"><a id="l01668" name="l01668"></a><span class="lineno"> 1668</span> <span class="comment">// zero.</span></div>
<div class="line"><a id="l01669" name="l01669"></a><span class="lineno"> 1669</span> <span class="keywordflow">if</span> (info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#ac11e010c276514d6402c772d0651f82f">slack_lp_value</a> &gt; 1e-6) keep_term = <span class="keyword">true</span>;</div>
<div class="line"><a id="l01670" name="l01670"></a><span class="lineno"> 1670</span> }</div>
<div class="line"><a id="l01671" name="l01671"></a><span class="lineno"> 1671</span> </div>
<div class="line"><a id="l01672" name="l01672"></a><span class="lineno"> 1672</span> <span class="keywordflow">if</span> (keep_term) {</div>
<div class="line"><a id="l01673" name="l01673"></a><span class="lineno"> 1673</span> tmp_terms_.push_back({<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>});</div>
<div class="line"><a id="l01674" name="l01674"></a><span class="lineno"> 1674</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l01675" name="l01675"></a><span class="lineno"> 1675</span> <span class="comment">// Substitute.</span></div>
<div class="line"><a id="l01676" name="l01676"></a><span class="lineno"> 1676</span> <span class="keyword">const</span> IntegerValue lb = integer_trail_-&gt;LevelZeroLowerBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l01677" name="l01677"></a><span class="lineno"> 1677</span> <span class="keyword">const</span> IntegerValue ub = integer_trail_-&gt;LevelZeroUpperBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l01678" name="l01678"></a><span class="lineno"> 1678</span> </div>
<div class="line"><a id="l01679" name="l01679"></a><span class="lineno"> 1679</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info.html">SlackInfo</a> slack_info;</div>
<div class="line"><a id="l01680" name="l01680"></a><span class="lineno"> 1680</span> slack_info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info.html#adb47ac0cff7c9dc4dc5f101d38a91185">lp_value</a> = info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#ac11e010c276514d6402c772d0651f82f">slack_lp_value</a>;</div>
<div class="line"><a id="l01681" name="l01681"></a><span class="lineno"> 1681</span> slack_info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a> = 0;</div>
<div class="line"><a id="l01682" name="l01682"></a><span class="lineno"> 1682</span> slack_info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> = ub - lb;</div>
<div class="line"><a id="l01683" name="l01683"></a><span class="lineno"> 1683</span> </div>
<div class="line"><a id="l01684" name="l01684"></a><span class="lineno"> 1684</span> <span class="keywordflow">if</span> (info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a6d2822d5e07c3716efcdf73a4ae5eafc">is_positive</a>) {</div>
<div class="line"><a id="l01685" name="l01685"></a><span class="lineno"> 1685</span> <span class="comment">// X = Indicator * diff + lb + Slack</span></div>
<div class="line"><a id="l01686" name="l01686"></a><span class="lineno"> 1686</span> tmp_terms_.push_back({info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a871eaa421116e3c7cd440b6299d0b74d">bool_var</a>, <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> * info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a2c25b894240115eebb2e75e2d8491a79">bound_diff</a>});</div>
<div class="line"><a id="l01687" name="l01687"></a><span class="lineno"> 1687</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">AddProductTo</a>(-<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, lb, &amp;new_ub)) {</div>
<div class="line"><a id="l01688" name="l01688"></a><span class="lineno"> 1688</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) &lt;&lt; <span class="stringliteral">&quot;Overflow&quot;</span>;</div>
<div class="line"><a id="l01689" name="l01689"></a><span class="lineno"> 1689</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l01690" name="l01690"></a><span class="lineno"> 1690</span> }</div>
<div class="line"><a id="l01691" name="l01691"></a><span class="lineno"> 1691</span> <span class="keywordflow">if</span> (slack_infos != <span class="keyword">nullptr</span>) {</div>
<div class="line"><a id="l01692" name="l01692"></a><span class="lineno"> 1692</span> tmp_terms_.push_back({first_slack, <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>});</div>
<div class="line"><a id="l01693" name="l01693"></a><span class="lineno"> 1693</span> first_slack += 2;</div>
<div class="line"><a id="l01694" name="l01694"></a><span class="lineno"> 1694</span> </div>
<div class="line"><a id="l01695" name="l01695"></a><span class="lineno"> 1695</span> <span class="comment">// slack = X - Indicator * info.bound_diff - lb;</span></div>
<div class="line"><a id="l01696" name="l01696"></a><span class="lineno"> 1696</span> slack_info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info.html#a250583d63e8184c6f9f4deba1125e6bb">terms</a>.push_back({<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, IntegerValue(1)});</div>
<div class="line"><a id="l01697" name="l01697"></a><span class="lineno"> 1697</span> slack_info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info.html#a250583d63e8184c6f9f4deba1125e6bb">terms</a>.push_back({info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a871eaa421116e3c7cd440b6299d0b74d">bool_var</a>, -info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a2c25b894240115eebb2e75e2d8491a79">bound_diff</a>});</div>
<div class="line"><a id="l01698" name="l01698"></a><span class="lineno"> 1698</span> slack_info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info.html#acd07f8397a2e61932c8ee17a4e300e23">offset</a> = -lb;</div>
<div class="line"><a id="l01699" name="l01699"></a><span class="lineno"> 1699</span> slack_infos-&gt;push_back(slack_info);</div>
<div class="line"><a id="l01700" name="l01700"></a><span class="lineno"> 1700</span> }</div>
<div class="line"><a id="l01701" name="l01701"></a><span class="lineno"> 1701</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l01702" name="l01702"></a><span class="lineno"> 1702</span> <span class="comment">// X = (1 - Indicator) * (diff) + lb + Slack</span></div>
<div class="line"><a id="l01703" name="l01703"></a><span class="lineno"> 1703</span> <span class="comment">// X = -Indicator * (diff) + lb + diff + Slack</span></div>
<div class="line"><a id="l01704" name="l01704"></a><span class="lineno"> 1704</span> tmp_terms_.push_back({info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a871eaa421116e3c7cd440b6299d0b74d">bool_var</a>, -<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> * info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a2c25b894240115eebb2e75e2d8491a79">bound_diff</a>});</div>
<div class="line"><a id="l01705" name="l01705"></a><span class="lineno"> 1705</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">AddProductTo</a>(-<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>, lb + info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a2c25b894240115eebb2e75e2d8491a79">bound_diff</a>, &amp;new_ub)) {</div>
<div class="line"><a id="l01706" name="l01706"></a><span class="lineno"> 1706</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) &lt;&lt; <span class="stringliteral">&quot;Overflow&quot;</span>;</div>
<div class="line"><a id="l01707" name="l01707"></a><span class="lineno"> 1707</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l01708" name="l01708"></a><span class="lineno"> 1708</span> }</div>
<div class="line"><a id="l01709" name="l01709"></a><span class="lineno"> 1709</span> <span class="keywordflow">if</span> (slack_infos != <span class="keyword">nullptr</span>) {</div>
<div class="line"><a id="l01710" name="l01710"></a><span class="lineno"> 1710</span> tmp_terms_.push_back({first_slack, <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>});</div>
<div class="line"><a id="l01711" name="l01711"></a><span class="lineno"> 1711</span> first_slack += 2;</div>
<div class="line"><a id="l01712" name="l01712"></a><span class="lineno"> 1712</span> </div>
<div class="line"><a id="l01713" name="l01713"></a><span class="lineno"> 1713</span> <span class="comment">// slack = X + Indicator * info.bound_diff - lb - diff;</span></div>
<div class="line"><a id="l01714" name="l01714"></a><span class="lineno"> 1714</span> slack_info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info.html#a250583d63e8184c6f9f4deba1125e6bb">terms</a>.push_back({<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, IntegerValue(1)});</div>
<div class="line"><a id="l01715" name="l01715"></a><span class="lineno"> 1715</span> slack_info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info.html#a250583d63e8184c6f9f4deba1125e6bb">terms</a>.push_back({info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a871eaa421116e3c7cd440b6299d0b74d">bool_var</a>, +info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a2c25b894240115eebb2e75e2d8491a79">bound_diff</a>});</div>
<div class="line"><a id="l01716" name="l01716"></a><span class="lineno"> 1716</span> slack_info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info.html#acd07f8397a2e61932c8ee17a4e300e23">offset</a> = -lb - info.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a2c25b894240115eebb2e75e2d8491a79">bound_diff</a>;</div>
<div class="line"><a id="l01717" name="l01717"></a><span class="lineno"> 1717</span> slack_infos-&gt;push_back(slack_info);</div>
<div class="line"><a id="l01718" name="l01718"></a><span class="lineno"> 1718</span> }</div>
<div class="line"><a id="l01719" name="l01719"></a><span class="lineno"> 1719</span> }</div>
<div class="line"><a id="l01720" name="l01720"></a><span class="lineno"> 1720</span> changed = <span class="keyword">true</span>;</div>
<div class="line"><a id="l01721" name="l01721"></a><span class="lineno"> 1721</span> }</div>
<div class="line"><a id="l01722" name="l01722"></a><span class="lineno"> 1722</span> </div>
<div class="line"><a id="l01723" name="l01723"></a><span class="lineno"> 1723</span> <span class="comment">// Add all the new terms coefficient to the overflow detection to avoid</span></div>
<div class="line"><a id="l01724" name="l01724"></a><span class="lineno"> 1724</span> <span class="comment">// issue when merging terms referring to the same variable.</span></div>
<div class="line"><a id="l01725" name="l01725"></a><span class="lineno"> 1725</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = old_size; i &lt; tmp_terms_.size(); ++i) {</div>
<div class="line"><a id="l01726" name="l01726"></a><span class="lineno"> 1726</span> overflow_detection =</div>
<div class="line"><a id="l01727" name="l01727"></a><span class="lineno"> 1727</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(overflow_detection, std::abs(tmp_terms_[i].second.value()));</div>
<div class="line"><a id="l01728" name="l01728"></a><span class="lineno"> 1728</span> }</div>
<div class="line"><a id="l01729" name="l01729"></a><span class="lineno"> 1729</span> }</div>
<div class="line"><a id="l01730" name="l01730"></a><span class="lineno"> 1730</span> </div>
<div class="line"><a id="l01731" name="l01731"></a><span class="lineno"> 1731</span> <span class="keywordflow">if</span> (overflow_detection &gt;= <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>) {</div>
<div class="line"><a id="l01732" name="l01732"></a><span class="lineno"> 1732</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) &lt;&lt; <span class="stringliteral">&quot;Overflow&quot;</span>;</div>
<div class="line"><a id="l01733" name="l01733"></a><span class="lineno"> 1733</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l01734" name="l01734"></a><span class="lineno"> 1734</span> }</div>
<div class="line"><a id="l01735" name="l01735"></a><span class="lineno"> 1735</span> <span class="keywordflow">if</span> (!changed) <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l01736" name="l01736"></a><span class="lineno"> 1736</span> </div>
<div class="line"><a id="l01737" name="l01737"></a><span class="lineno"> 1737</span> <span class="comment">// Update the cut.</span></div>
<div class="line"><a id="l01738" name="l01738"></a><span class="lineno"> 1738</span> <span class="comment">//</span></div>
<div class="line"><a id="l01739" name="l01739"></a><span class="lineno"> 1739</span> <span class="comment">// Note that because of our overflow_detection variable, there should be</span></div>
<div class="line"><a id="l01740" name="l01740"></a><span class="lineno"> 1740</span> <span class="comment">// no integer overflow when we merge identical terms.</span></div>
<div class="line"><a id="l01741" name="l01741"></a><span class="lineno"> 1741</span> cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5316808a2d5007c3b489e844801385e5">kMinIntegerValue</a>; <span class="comment">// Not relevant.</span></div>
<div class="line"><a id="l01742" name="l01742"></a><span class="lineno"> 1742</span> cut-&gt;<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> = new_ub;</div>
<div class="line"><a id="l01743" name="l01743"></a><span class="lineno"> 1743</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a6314c72e08e179c06ce3b76747499b8c">CleanTermsAndFillConstraint</a>(&amp;tmp_terms_, cut);</div>
<div class="line"><a id="l01744" name="l01744"></a><span class="lineno"> 1744</span>}</div>
<div class="line"><a id="l01745" name="l01745"></a><span class="lineno"> 1745</span> </div>
<div class="line"><a id="l01746" name="l01746"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#ab1b4642341faf5ff972b02f034d88f21"> 1746</a></span><span class="keywordtype">bool</span> ImpliedBoundsProcessor::DebugSlack(IntegerVariable first_slack,</div>
<div class="line"><a id="l01747" name="l01747"></a><span class="lineno"> 1747</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>&amp; initial_cut,</div>
<div class="line"><a id="l01748" name="l01748"></a><span class="lineno"> 1748</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>&amp; cut,</div>
<div class="line"><a id="l01749" name="l01749"></a><span class="lineno"> 1749</span> <span class="keyword">const</span> std::vector&lt;SlackInfo&gt;&amp; info) {</div>
<div class="line"><a id="l01750" name="l01750"></a><span class="lineno"> 1750</span> tmp_terms_.clear();</div>
<div class="line"><a id="l01751" name="l01751"></a><span class="lineno"> 1751</span> IntegerValue new_ub = cut.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>;</div>
<div class="line"><a id="l01752" name="l01752"></a><span class="lineno"> 1752</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; cut.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size(); ++i) {</div>
<div class="line"><a id="l01753" name="l01753"></a><span class="lineno"> 1753</span> <span class="comment">// Simple copy for non-slack variables.</span></div>
<div class="line"><a id="l01754" name="l01754"></a><span class="lineno"> 1754</span> <span class="keywordflow">if</span> (cut.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i] &lt; first_slack) {</div>
<div class="line"><a id="l01755" name="l01755"></a><span class="lineno"> 1755</span> tmp_terms_.push_back({cut.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i], cut.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i]});</div>
<div class="line"><a id="l01756" name="l01756"></a><span class="lineno"> 1756</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l01757" name="l01757"></a><span class="lineno"> 1757</span> }</div>
<div class="line"><a id="l01758" name="l01758"></a><span class="lineno"> 1758</span> </div>
<div class="line"><a id="l01759" name="l01759"></a><span class="lineno"> 1759</span> <span class="comment">// Replace slack by its definition.</span></div>
<div class="line"><a id="l01760" name="l01760"></a><span class="lineno"> 1760</span> <span class="keyword">const</span> IntegerValue multiplier = cut.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i];</div>
<div class="line"><a id="l01761" name="l01761"></a><span class="lineno"> 1761</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = (cut.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i].value() - first_slack.value()) / 2;</div>
<div class="line"><a id="l01762" name="l01762"></a><span class="lineno"> 1762</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair&lt;IntegerVariable, IntegerValue&gt;&amp; term :</div>
<div class="line"><a id="l01763" name="l01763"></a><span class="lineno"> 1763</span> info[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].terms) {</div>
<div class="line"><a id="l01764" name="l01764"></a><span class="lineno"> 1764</span> tmp_terms_.push_back({term.first, term.second * multiplier});</div>
<div class="line"><a id="l01765" name="l01765"></a><span class="lineno"> 1765</span> }</div>
<div class="line"><a id="l01766" name="l01766"></a><span class="lineno"> 1766</span> new_ub -= multiplier * info[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].offset;</div>
<div class="line"><a id="l01767" name="l01767"></a><span class="lineno"> 1767</span> }</div>
<div class="line"><a id="l01768" name="l01768"></a><span class="lineno"> 1768</span> </div>
<div class="line"><a id="l01769" name="l01769"></a><span class="lineno"> 1769</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> tmp_cut;</div>
<div class="line"><a id="l01770" name="l01770"></a><span class="lineno"> 1770</span> tmp_cut.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5316808a2d5007c3b489e844801385e5">kMinIntegerValue</a>; <span class="comment">// Not relevant.</span></div>
<div class="line"><a id="l01771" name="l01771"></a><span class="lineno"> 1771</span> tmp_cut.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> = new_ub;</div>
<div class="line"><a id="l01772" name="l01772"></a><span class="lineno"> 1772</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a6314c72e08e179c06ce3b76747499b8c">CleanTermsAndFillConstraint</a>(&amp;tmp_terms_, &amp;tmp_cut);</div>
<div class="line"><a id="l01773" name="l01773"></a><span class="lineno"> 1773</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aa2ba15be9aeabce0142c726fbf880798">MakeAllVariablesPositive</a>(&amp;tmp_cut);</div>
<div class="line"><a id="l01774" name="l01774"></a><span class="lineno"> 1774</span> </div>
<div class="line"><a id="l01775" name="l01775"></a><span class="lineno"> 1775</span> <span class="comment">// We need to canonicalize the initial_cut too for comparison. Note that we</span></div>
<div class="line"><a id="l01776" name="l01776"></a><span class="lineno"> 1776</span> <span class="comment">// only use this for debug, so we don&#39;t care too much about the memory and</span></div>
<div class="line"><a id="l01777" name="l01777"></a><span class="lineno"> 1777</span> <span class="comment">// extra time.</span></div>
<div class="line"><a id="l01778" name="l01778"></a><span class="lineno"> 1778</span> <span class="comment">// TODO(user): Expose CanonicalizeConstraint() from the manager.</span></div>
<div class="line"><a id="l01779" name="l01779"></a><span class="lineno"> 1779</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> tmp_copy;</div>
<div class="line"><a id="l01780" name="l01780"></a><span class="lineno"> 1780</span> tmp_terms_.clear();</div>
<div class="line"><a id="l01781" name="l01781"></a><span class="lineno"> 1781</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; initial_cut.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size(); ++i) {</div>
<div class="line"><a id="l01782" name="l01782"></a><span class="lineno"> 1782</span> tmp_terms_.push_back({initial_cut.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i], initial_cut.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i]});</div>
<div class="line"><a id="l01783" name="l01783"></a><span class="lineno"> 1783</span> }</div>
<div class="line"><a id="l01784" name="l01784"></a><span class="lineno"> 1784</span> tmp_copy.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5316808a2d5007c3b489e844801385e5">kMinIntegerValue</a>; <span class="comment">// Not relevant.</span></div>
<div class="line"><a id="l01785" name="l01785"></a><span class="lineno"> 1785</span> tmp_copy.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> = new_ub;</div>
<div class="line"><a id="l01786" name="l01786"></a><span class="lineno"> 1786</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a6314c72e08e179c06ce3b76747499b8c">CleanTermsAndFillConstraint</a>(&amp;tmp_terms_, &amp;tmp_copy);</div>
<div class="line"><a id="l01787" name="l01787"></a><span class="lineno"> 1787</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aa2ba15be9aeabce0142c726fbf880798">MakeAllVariablesPositive</a>(&amp;tmp_copy);</div>
<div class="line"><a id="l01788" name="l01788"></a><span class="lineno"> 1788</span> </div>
<div class="line"><a id="l01789" name="l01789"></a><span class="lineno"> 1789</span> <span class="keywordflow">if</span> (tmp_cut == tmp_copy) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l01790" name="l01790"></a><span class="lineno"> 1790</span> </div>
<div class="line"><a id="l01791" name="l01791"></a><span class="lineno"> 1791</span> <a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code hl_variable" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) &lt;&lt; first_slack;</div>
<div class="line"><a id="l01792" name="l01792"></a><span class="lineno"> 1792</span> <a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code hl_variable" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) &lt;&lt; tmp_copy.<a class="code hl_function" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>();</div>
<div class="line"><a id="l01793" name="l01793"></a><span class="lineno"> 1793</span> <a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code hl_variable" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) &lt;&lt; cut.<a class="code hl_function" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>();</div>
<div class="line"><a id="l01794" name="l01794"></a><span class="lineno"> 1794</span> <a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code hl_variable" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) &lt;&lt; tmp_cut.<a class="code hl_function" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>();</div>
<div class="line"><a id="l01795" name="l01795"></a><span class="lineno"> 1795</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l01796" name="l01796"></a><span class="lineno"> 1796</span>}</div>
<div class="line"><a id="l01797" name="l01797"></a><span class="lineno"> 1797</span> </div>
<div class="line"><a id="l01798" name="l01798"></a><span class="lineno"> 1798</span><span class="keyword">namespace </span>{</div>
<div class="line"><a id="l01799" name="l01799"></a><span class="lineno"> 1799</span> </div>
<div class="line"><a id="l01800" name="l01800"></a><span class="lineno"> 1800</span>int64_t SumOfKMinValues(<span class="keyword">const</span> absl::btree_set&lt;int64_t&gt;&amp; values, <span class="keywordtype">int</span> k) {</div>
<div class="line"><a id="l01801" name="l01801"></a><span class="lineno"> 1801</span> <span class="keywordtype">int</span> count = 0;</div>
<div class="line"><a id="l01802" name="l01802"></a><span class="lineno"> 1802</span> int64_t sum = 0;</div>
<div class="line"><a id="l01803" name="l01803"></a><span class="lineno"> 1803</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> : values) {</div>
<div class="line"><a id="l01804" name="l01804"></a><span class="lineno"> 1804</span> sum += <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>;</div>
<div class="line"><a id="l01805" name="l01805"></a><span class="lineno"> 1805</span> <span class="keywordflow">if</span> (++count &gt;= k) <span class="keywordflow">return</span> sum;</div>
<div class="line"><a id="l01806" name="l01806"></a><span class="lineno"> 1806</span> }</div>
<div class="line"><a id="l01807" name="l01807"></a><span class="lineno"> 1807</span> <span class="keywordflow">return</span> sum;</div>
<div class="line"><a id="l01808" name="l01808"></a><span class="lineno"> 1808</span>}</div>
<div class="line"><a id="l01809" name="l01809"></a><span class="lineno"> 1809</span> </div>
<div class="line"><a id="l01810" name="l01810"></a><span class="lineno"> 1810</span><span class="keywordtype">void</span> TryToGenerateAllDiffCut(</div>
<div class="line"><a id="l01811" name="l01811"></a><span class="lineno"> 1811</span> <span class="keyword">const</span> std::vector&lt;std::pair&lt;double, AffineExpression&gt;&gt;&amp; sorted_exprs_lp,</div>
<div class="line"><a id="l01812" name="l01812"></a><span class="lineno"> 1812</span> <span class="keyword">const</span> IntegerTrail&amp; integer_trail,</div>
<div class="line"><a id="l01813" name="l01813"></a><span class="lineno"> 1813</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values,</div>
<div class="line"><a id="l01814" name="l01814"></a><span class="lineno"> 1814</span> LinearConstraintManager* manager, Model* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
<div class="line"><a id="l01815" name="l01815"></a><span class="lineno"> 1815</span> std::vector&lt;AffineExpression&gt; current_set_exprs;</div>
<div class="line"><a id="l01816" name="l01816"></a><span class="lineno"> 1816</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_exprs = sorted_exprs_lp.size();</div>
<div class="line"><a id="l01817" name="l01817"></a><span class="lineno"> 1817</span> absl::btree_set&lt;int64_t&gt; min_values;</div>
<div class="line"><a id="l01818" name="l01818"></a><span class="lineno"> 1818</span> absl::btree_set&lt;int64_t&gt; negated_max_values;</div>
<div class="line"><a id="l01819" name="l01819"></a><span class="lineno"> 1819</span> <span class="keywordtype">double</span> sum = 0.0;</div>
<div class="line"><a id="l01820" name="l01820"></a><span class="lineno"> 1820</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> value_expr : sorted_exprs_lp) {</div>
<div class="line"><a id="l01821" name="l01821"></a><span class="lineno"> 1821</span> sum += value_expr.first;</div>
<div class="line"><a id="l01822" name="l01822"></a><span class="lineno"> 1822</span> <span class="keyword">const</span> AffineExpression expr = value_expr.second;</div>
<div class="line"><a id="l01823" name="l01823"></a><span class="lineno"> 1823</span> <span class="keywordflow">if</span> (integer_trail.IsFixed(expr)) {</div>
<div class="line"><a id="l01824" name="l01824"></a><span class="lineno"> 1824</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = integer_trail.FixedValue(expr).value();</div>
<div class="line"><a id="l01825" name="l01825"></a><span class="lineno"> 1825</span> min_values.insert(<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
<div class="line"><a id="l01826" name="l01826"></a><span class="lineno"> 1826</span> negated_max_values.insert(-<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
<div class="line"><a id="l01827" name="l01827"></a><span class="lineno"> 1827</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l01828" name="l01828"></a><span class="lineno"> 1828</span> <span class="keywordtype">int</span> count = 0;</div>
<div class="line"><a id="l01829" name="l01829"></a><span class="lineno"> 1829</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = expr.coeff.value();</div>
<div class="line"><a id="l01830" name="l01830"></a><span class="lineno"> 1830</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="variable__and__expressions_8cc.html#a98c17ae8d99a73259ea78de8c4b66254">constant</a> = expr.constant.value();</div>
<div class="line"><a id="l01831" name="l01831"></a><span class="lineno"> 1831</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> :</div>
<div class="line"><a id="l01832" name="l01832"></a><span class="lineno"> 1832</span> integer_trail.InitialVariableDomain(expr.var).Values()) {</div>
<div class="line"><a id="l01833" name="l01833"></a><span class="lineno"> 1833</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> &gt; 0) {</div>
<div class="line"><a id="l01834" name="l01834"></a><span class="lineno"> 1834</span> min_values.insert(<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> * <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> + <a class="code hl_variable" href="variable__and__expressions_8cc.html#a98c17ae8d99a73259ea78de8c4b66254">constant</a>);</div>
<div class="line"><a id="l01835" name="l01835"></a><span class="lineno"> 1835</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l01836" name="l01836"></a><span class="lineno"> 1836</span> negated_max_values.insert(-(<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> * <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> + <a class="code hl_variable" href="variable__and__expressions_8cc.html#a98c17ae8d99a73259ea78de8c4b66254">constant</a>));</div>
<div class="line"><a id="l01837" name="l01837"></a><span class="lineno"> 1837</span> }</div>
<div class="line"><a id="l01838" name="l01838"></a><span class="lineno"> 1838</span> <span class="keywordflow">if</span> (++count &gt;= num_exprs) <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l01839" name="l01839"></a><span class="lineno"> 1839</span> }</div>
<div class="line"><a id="l01840" name="l01840"></a><span class="lineno"> 1840</span> </div>
<div class="line"><a id="l01841" name="l01841"></a><span class="lineno"> 1841</span> count = 0;</div>
<div class="line"><a id="l01842" name="l01842"></a><span class="lineno"> 1842</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> :</div>
<div class="line"><a id="l01843" name="l01843"></a><span class="lineno"> 1843</span> integer_trail.InitialVariableDomain(expr.var).Negation().Values()) {</div>
<div class="line"><a id="l01844" name="l01844"></a><span class="lineno"> 1844</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> &gt; 0) {</div>
<div class="line"><a id="l01845" name="l01845"></a><span class="lineno"> 1845</span> negated_max_values.insert(<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> * <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> - <a class="code hl_variable" href="variable__and__expressions_8cc.html#a98c17ae8d99a73259ea78de8c4b66254">constant</a>);</div>
<div class="line"><a id="l01846" name="l01846"></a><span class="lineno"> 1846</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l01847" name="l01847"></a><span class="lineno"> 1847</span> min_values.insert(-<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> * <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> + <a class="code hl_variable" href="variable__and__expressions_8cc.html#a98c17ae8d99a73259ea78de8c4b66254">constant</a>);</div>
<div class="line"><a id="l01848" name="l01848"></a><span class="lineno"> 1848</span> }</div>
<div class="line"><a id="l01849" name="l01849"></a><span class="lineno"> 1849</span> <span class="keywordflow">if</span> (++count &gt;= num_exprs) <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l01850" name="l01850"></a><span class="lineno"> 1850</span> }</div>
<div class="line"><a id="l01851" name="l01851"></a><span class="lineno"> 1851</span> }</div>
<div class="line"><a id="l01852" name="l01852"></a><span class="lineno"> 1852</span> current_set_exprs.push_back(expr);</div>
<div class="line"><a id="l01853" name="l01853"></a><span class="lineno"> 1853</span> <span class="keyword">const</span> int64_t required_min_sum =</div>
<div class="line"><a id="l01854" name="l01854"></a><span class="lineno"> 1854</span> SumOfKMinValues(min_values, current_set_exprs.size());</div>
<div class="line"><a id="l01855" name="l01855"></a><span class="lineno"> 1855</span> <span class="keyword">const</span> int64_t required_max_sum =</div>
<div class="line"><a id="l01856" name="l01856"></a><span class="lineno"> 1856</span> -SumOfKMinValues(negated_max_values, current_set_exprs.size());</div>
<div class="line"><a id="l01857" name="l01857"></a><span class="lineno"> 1857</span> <span class="keywordflow">if</span> (sum &lt; required_min_sum || sum &gt; required_max_sum) {</div>
<div class="line"><a id="l01858" name="l01858"></a><span class="lineno"> 1858</span> LinearConstraintBuilder cut(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, IntegerValue(required_min_sum),</div>
<div class="line"><a id="l01859" name="l01859"></a><span class="lineno"> 1859</span> IntegerValue(required_max_sum));</div>
<div class="line"><a id="l01860" name="l01860"></a><span class="lineno"> 1860</span> <span class="keywordflow">for</span> (AffineExpression expr : current_set_exprs) {</div>
<div class="line"><a id="l01861" name="l01861"></a><span class="lineno"> 1861</span> cut.AddTerm(expr, IntegerValue(1));</div>
<div class="line"><a id="l01862" name="l01862"></a><span class="lineno"> 1862</span> }</div>
<div class="line"><a id="l01863" name="l01863"></a><span class="lineno"> 1863</span> manager-&gt;AddCut(cut.Build(), <span class="stringliteral">&quot;all_diff&quot;</span>, lp_values);</div>
<div class="line"><a id="l01864" name="l01864"></a><span class="lineno"> 1864</span> <span class="comment">// NOTE: We can extend the current set but it is more helpful to generate</span></div>
<div class="line"><a id="l01865" name="l01865"></a><span class="lineno"> 1865</span> <span class="comment">// the cut on a different set of variables so we reset the counters.</span></div>
<div class="line"><a id="l01866" name="l01866"></a><span class="lineno"> 1866</span> sum = 0.0;</div>
<div class="line"><a id="l01867" name="l01867"></a><span class="lineno"> 1867</span> current_set_exprs.clear();</div>
<div class="line"><a id="l01868" name="l01868"></a><span class="lineno"> 1868</span> min_values.clear();</div>
<div class="line"><a id="l01869" name="l01869"></a><span class="lineno"> 1869</span> negated_max_values.clear();</div>
<div class="line"><a id="l01870" name="l01870"></a><span class="lineno"> 1870</span> }</div>
<div class="line"><a id="l01871" name="l01871"></a><span class="lineno"> 1871</span> }</div>
<div class="line"><a id="l01872" name="l01872"></a><span class="lineno"> 1872</span>}</div>
<div class="line"><a id="l01873" name="l01873"></a><span class="lineno"> 1873</span> </div>
<div class="line"><a id="l01874" name="l01874"></a><span class="lineno"> 1874</span>} <span class="comment">// namespace</span></div>
<div class="line"><a id="l01875" name="l01875"></a><span class="lineno"> 1875</span> </div>
<div class="line"><a id="l01876" name="l01876"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a25553837a2eba1b1fbb5ac0eac64ad15"> 1876</a></span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a25553837a2eba1b1fbb5ac0eac64ad15">CreateAllDifferentCutGenerator</a>(</div>
<div class="line"><a id="l01877" name="l01877"></a><span class="lineno"> 1877</span> <span class="keyword">const</span> std::vector&lt;AffineExpression&gt;&amp; exprs, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
<div class="line"><a id="l01878" name="l01878"></a><span class="lineno"> 1878</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div>
<div class="line"><a id="l01879" name="l01879"></a><span class="lineno"> 1879</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>-&gt;GetOrCreate&lt;<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>&gt;();</div>
<div class="line"><a id="l01880" name="l01880"></a><span class="lineno"> 1880</span> </div>
<div class="line"><a id="l01881" name="l01881"></a><span class="lineno"> 1881</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a>&amp; expr : exprs) {</div>
<div class="line"><a id="l01882" name="l01882"></a><span class="lineno"> 1882</span> <span class="keywordflow">if</span> (!integer_trail-&gt;<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">IsFixed</a>(expr)) {</div>
<div class="line"><a id="l01883" name="l01883"></a><span class="lineno"> 1883</span> result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.push_back(expr.var);</div>
<div class="line"><a id="l01884" name="l01884"></a><span class="lineno"> 1884</span> }</div>
<div class="line"><a id="l01885" name="l01885"></a><span class="lineno"> 1885</span> }</div>
<div class="line"><a id="l01886" name="l01886"></a><span class="lineno"> 1886</span> <a class="code hl_function" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&amp;result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div>
<div class="line"><a id="l01887" name="l01887"></a><span class="lineno"> 1887</span> </div>
<div class="line"><a id="l01888" name="l01888"></a><span class="lineno"> 1888</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>-&gt;GetOrCreate&lt;<a class="code hl_class" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>&gt;();</div>
<div class="line"><a id="l01889" name="l01889"></a><span class="lineno"> 1889</span> result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">generate_cuts</a> =</div>
<div class="line"><a id="l01890" name="l01890"></a><span class="lineno"> 1890</span> [exprs, integer_trail, trail, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>](</div>
<div class="line"><a id="l01891" name="l01891"></a><span class="lineno"> 1891</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values,</div>
<div class="line"><a id="l01892" name="l01892"></a><span class="lineno"> 1892</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div>
<div class="line"><a id="l01893" name="l01893"></a><span class="lineno"> 1893</span> <span class="comment">// These cuts work at all levels but the generator adds too many cuts on</span></div>
<div class="line"><a id="l01894" name="l01894"></a><span class="lineno"> 1894</span> <span class="comment">// some instances and degrade the performance so we only use it at level</span></div>
<div class="line"><a id="l01895" name="l01895"></a><span class="lineno"> 1895</span> <span class="comment">// 0.</span></div>
<div class="line"><a id="l01896" name="l01896"></a><span class="lineno"> 1896</span> <span class="keywordflow">if</span> (trail-&gt;<a class="code hl_function" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() &gt; 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l01897" name="l01897"></a><span class="lineno"> 1897</span> std::vector&lt;std::pair&lt;double, AffineExpression&gt;&gt; sorted_exprs;</div>
<div class="line"><a id="l01898" name="l01898"></a><span class="lineno"> 1898</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> expr : exprs) {</div>
<div class="line"><a id="l01899" name="l01899"></a><span class="lineno"> 1899</span> <span class="keywordflow">if</span> (integer_trail-&gt;<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(expr) ==</div>
<div class="line"><a id="l01900" name="l01900"></a><span class="lineno"> 1900</span> integer_trail-&gt;<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(expr)) {</div>
<div class="line"><a id="l01901" name="l01901"></a><span class="lineno"> 1901</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l01902" name="l01902"></a><span class="lineno"> 1902</span> }</div>
<div class="line"><a id="l01903" name="l01903"></a><span class="lineno"> 1903</span> sorted_exprs.push_back(std::make_pair(expr.LpValue(lp_values), expr));</div>
<div class="line"><a id="l01904" name="l01904"></a><span class="lineno"> 1904</span> }</div>
<div class="line"><a id="l01905" name="l01905"></a><span class="lineno"> 1905</span> std::sort(sorted_exprs.begin(), sorted_exprs.end(),</div>
<div class="line"><a id="l01906" name="l01906"></a><span class="lineno"> 1906</span> [](std::pair&lt;double, AffineExpression&gt;&amp; <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>,</div>
<div class="line"><a id="l01907" name="l01907"></a><span class="lineno"> 1907</span> <span class="keyword">const</span> std::pair&lt;double, AffineExpression&gt;&amp; <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) {</div>
<div class="line"><a id="l01908" name="l01908"></a><span class="lineno"> 1908</span> return a.first &lt; b.first;</div>
<div class="line"><a id="l01909" name="l01909"></a><span class="lineno"> 1909</span> });</div>
<div class="line"><a id="l01910" name="l01910"></a><span class="lineno"> 1910</span> TryToGenerateAllDiffCut(sorted_exprs, *integer_trail, lp_values,</div>
<div class="line"><a id="l01911" name="l01911"></a><span class="lineno"> 1911</span> manager, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
<div class="line"><a id="l01912" name="l01912"></a><span class="lineno"> 1912</span> <span class="comment">// Other direction.</span></div>
<div class="line"><a id="l01913" name="l01913"></a><span class="lineno"> 1913</span> std::reverse(sorted_exprs.begin(), sorted_exprs.end());</div>
<div class="line"><a id="l01914" name="l01914"></a><span class="lineno"> 1914</span> TryToGenerateAllDiffCut(sorted_exprs, *integer_trail, lp_values,</div>
<div class="line"><a id="l01915" name="l01915"></a><span class="lineno"> 1915</span> manager, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
<div class="line"><a id="l01916" name="l01916"></a><span class="lineno"> 1916</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l01917" name="l01917"></a><span class="lineno"> 1917</span> };</div>
<div class="line"><a id="l01918" name="l01918"></a><span class="lineno"> 1918</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) &lt;&lt; <span class="stringliteral">&quot;Created all_diff cut generator of size: &quot;</span> &lt;&lt; exprs.size();</div>
<div class="line"><a id="l01919" name="l01919"></a><span class="lineno"> 1919</span> <span class="keywordflow">return</span> result;</div>
<div class="line"><a id="l01920" name="l01920"></a><span class="lineno"> 1920</span>}</div>
<div class="line"><a id="l01921" name="l01921"></a><span class="lineno"> 1921</span> </div>
<div class="line"><a id="l01922" name="l01922"></a><span class="lineno"> 1922</span><span class="keyword">namespace </span>{</div>
<div class="line"><a id="l01923" name="l01923"></a><span class="lineno"> 1923</span><span class="comment">// Returns max((w2i - w1i)*Li, (w2i - w1i)*Ui).</span></div>
<div class="line"><a id="l01924" name="l01924"></a><span class="lineno"> 1924</span>IntegerValue MaxCornerDifference(<span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>,</div>
<div class="line"><a id="l01925" name="l01925"></a><span class="lineno"> 1925</span> <span class="keyword">const</span> IntegerValue w1_i,</div>
<div class="line"><a id="l01926" name="l01926"></a><span class="lineno"> 1926</span> <span class="keyword">const</span> IntegerValue w2_i,</div>
<div class="line"><a id="l01927" name="l01927"></a><span class="lineno"> 1927</span> <span class="keyword">const</span> IntegerTrail&amp; integer_trail) {</div>
<div class="line"><a id="l01928" name="l01928"></a><span class="lineno"> 1928</span> <span class="keyword">const</span> IntegerValue lb = integer_trail.LevelZeroLowerBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l01929" name="l01929"></a><span class="lineno"> 1929</span> <span class="keyword">const</span> IntegerValue ub = integer_trail.LevelZeroUpperBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l01930" name="l01930"></a><span class="lineno"> 1930</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>((w2_i - w1_i) * lb, (w2_i - w1_i) * ub);</div>
<div class="line"><a id="l01931" name="l01931"></a><span class="lineno"> 1931</span>}</div>
<div class="line"><a id="l01932" name="l01932"></a><span class="lineno"> 1932</span> </div>
<div class="line"><a id="l01933" name="l01933"></a><span class="lineno"> 1933</span><span class="comment">// This is the coefficient of zk in the cut, where k = max_index.</span></div>
<div class="line"><a id="l01934" name="l01934"></a><span class="lineno"> 1934</span><span class="comment">// MPlusCoefficient_ki = max((wki - wI(i)i) * Li,</span></div>
<div class="line"><a id="l01935" name="l01935"></a><span class="lineno"> 1935</span><span class="comment">// (wki - wI(i)i) * Ui)</span></div>
<div class="line"><a id="l01936" name="l01936"></a><span class="lineno"> 1936</span><span class="comment">// = max corner difference for variable i,</span></div>
<div class="line"><a id="l01937" name="l01937"></a><span class="lineno"> 1937</span><span class="comment">// target expr I(i), max expr k.</span></div>
<div class="line"><a id="l01938" name="l01938"></a><span class="lineno"> 1938</span><span class="comment">// The coefficient of zk is Sum(i=1..n)(MPlusCoefficient_ki) + bk</span></div>
<div class="line"><a id="l01939" name="l01939"></a><span class="lineno"> 1939</span>IntegerValue MPlusCoefficient(</div>
<div class="line"><a id="l01940" name="l01940"></a><span class="lineno"> 1940</span> <span class="keyword">const</span> std::vector&lt;IntegerVariable&gt;&amp; x_vars,</div>
<div class="line"><a id="l01941" name="l01941"></a><span class="lineno"> 1941</span> <span class="keyword">const</span> std::vector&lt;LinearExpression&gt;&amp; exprs,</div>
<div class="line"><a id="l01942" name="l01942"></a><span class="lineno"> 1942</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, int&gt;</a>&amp; variable_partition,</div>
<div class="line"><a id="l01943" name="l01943"></a><span class="lineno"> 1943</span> <span class="keyword">const</span> <span class="keywordtype">int</span> max_index, <span class="keyword">const</span> IntegerTrail&amp; integer_trail) {</div>
<div class="line"><a id="l01944" name="l01944"></a><span class="lineno"> 1944</span> IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = exprs[max_index].offset;</div>
<div class="line"><a id="l01945" name="l01945"></a><span class="lineno"> 1945</span> <span class="comment">// TODO(user): This algo is quadratic since GetCoefficientOfPositiveVar()</span></div>
<div class="line"><a id="l01946" name="l01946"></a><span class="lineno"> 1946</span> <span class="comment">// is linear. This can be optimized (better complexity) if needed.</span></div>
<div class="line"><a id="l01947" name="l01947"></a><span class="lineno"> 1947</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : x_vars) {</div>
<div class="line"><a id="l01948" name="l01948"></a><span class="lineno"> 1948</span> <span class="keyword">const</span> <span class="keywordtype">int</span> target_index = variable_partition[<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>];</div>
<div class="line"><a id="l01949" name="l01949"></a><span class="lineno"> 1949</span> <span class="keywordflow">if</span> (max_index != target_index) {</div>
<div class="line"><a id="l01950" name="l01950"></a><span class="lineno"> 1950</span> <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> += MaxCornerDifference(</div>
<div class="line"><a id="l01951" name="l01951"></a><span class="lineno"> 1951</span> <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ab7b2c273b19bf885462dfa04611e4e62">GetCoefficientOfPositiveVar</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, exprs[target_index]),</div>
<div class="line"><a id="l01952" name="l01952"></a><span class="lineno"> 1952</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ab7b2c273b19bf885462dfa04611e4e62">GetCoefficientOfPositiveVar</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, exprs[max_index]), integer_trail);</div>
<div class="line"><a id="l01953" name="l01953"></a><span class="lineno"> 1953</span> }</div>
<div class="line"><a id="l01954" name="l01954"></a><span class="lineno"> 1954</span> }</div>
<div class="line"><a id="l01955" name="l01955"></a><span class="lineno"> 1955</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>;</div>
<div class="line"><a id="l01956" name="l01956"></a><span class="lineno"> 1956</span>}</div>
<div class="line"><a id="l01957" name="l01957"></a><span class="lineno"> 1957</span> </div>
<div class="line"><a id="l01958" name="l01958"></a><span class="lineno"> 1958</span><span class="comment">// Compute the value of</span></div>
<div class="line"><a id="l01959" name="l01959"></a><span class="lineno"> 1959</span><span class="comment">// rhs = wI(i)i * xi + Sum(k=1..d)(MPlusCoefficient_ki * zk)</span></div>
<div class="line"><a id="l01960" name="l01960"></a><span class="lineno"> 1960</span><span class="comment">// for variable xi for given target index I(i).</span></div>
<div class="line"><a id="l01961" name="l01961"></a><span class="lineno"> 1961</span><span class="keywordtype">double</span> ComputeContribution(</div>
<div class="line"><a id="l01962" name="l01962"></a><span class="lineno"> 1962</span> <span class="keyword">const</span> IntegerVariable xi_var, <span class="keyword">const</span> std::vector&lt;IntegerVariable&gt;&amp; z_vars,</div>
<div class="line"><a id="l01963" name="l01963"></a><span class="lineno"> 1963</span> <span class="keyword">const</span> std::vector&lt;LinearExpression&gt;&amp; exprs,</div>
<div class="line"><a id="l01964" name="l01964"></a><span class="lineno"> 1964</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values,</div>
<div class="line"><a id="l01965" name="l01965"></a><span class="lineno"> 1965</span> <span class="keyword">const</span> IntegerTrail&amp; integer_trail, <span class="keyword">const</span> <span class="keywordtype">int</span> target_index) {</div>
<div class="line"><a id="l01966" name="l01966"></a><span class="lineno"> 1966</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(target_index, 0);</div>
<div class="line"><a id="l01967" name="l01967"></a><span class="lineno"> 1967</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(target_index, exprs.size());</div>
<div class="line"><a id="l01968" name="l01968"></a><span class="lineno"> 1968</span> <span class="keyword">const</span> LinearExpression&amp; target_expr = exprs[target_index];</div>
<div class="line"><a id="l01969" name="l01969"></a><span class="lineno"> 1969</span> <span class="keyword">const</span> <span class="keywordtype">double</span> xi_value = lp_values[xi_var];</div>
<div class="line"><a id="l01970" name="l01970"></a><span class="lineno"> 1970</span> <span class="keyword">const</span> IntegerValue wt_i = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ab7b2c273b19bf885462dfa04611e4e62">GetCoefficientOfPositiveVar</a>(xi_var, target_expr);</div>
<div class="line"><a id="l01971" name="l01971"></a><span class="lineno"> 1971</span> <span class="keywordtype">double</span> contrib = <a class="code hl_function" href="namespaceoperations__research_1_1glop.html#afd6d278f9d061a91716c6770f2d723e8">ToDouble</a>(wt_i) * xi_value;</div>
<div class="line"><a id="l01972" name="l01972"></a><span class="lineno"> 1972</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> expr_index = 0; expr_index &lt; exprs.size(); ++expr_index) {</div>
<div class="line"><a id="l01973" name="l01973"></a><span class="lineno"> 1973</span> <span class="keywordflow">if</span> (expr_index == target_index) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l01974" name="l01974"></a><span class="lineno"> 1974</span> <span class="keyword">const</span> LinearExpression&amp; max_expr = exprs[expr_index];</div>
<div class="line"><a id="l01975" name="l01975"></a><span class="lineno"> 1975</span> <span class="keyword">const</span> <span class="keywordtype">double</span> z_max_value = lp_values[z_vars[expr_index]];</div>
<div class="line"><a id="l01976" name="l01976"></a><span class="lineno"> 1976</span> <span class="keyword">const</span> IntegerValue corner_value = MaxCornerDifference(</div>
<div class="line"><a id="l01977" name="l01977"></a><span class="lineno"> 1977</span> xi_var, wt_i, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ab7b2c273b19bf885462dfa04611e4e62">GetCoefficientOfPositiveVar</a>(xi_var, max_expr),</div>
<div class="line"><a id="l01978" name="l01978"></a><span class="lineno"> 1978</span> integer_trail);</div>
<div class="line"><a id="l01979" name="l01979"></a><span class="lineno"> 1979</span> contrib += <a class="code hl_function" href="namespaceoperations__research_1_1glop.html#afd6d278f9d061a91716c6770f2d723e8">ToDouble</a>(corner_value) * z_max_value;</div>
<div class="line"><a id="l01980" name="l01980"></a><span class="lineno"> 1980</span> }</div>
<div class="line"><a id="l01981" name="l01981"></a><span class="lineno"> 1981</span> <span class="keywordflow">return</span> contrib;</div>
<div class="line"><a id="l01982" name="l01982"></a><span class="lineno"> 1982</span>}</div>
<div class="line"><a id="l01983" name="l01983"></a><span class="lineno"> 1983</span>} <span class="comment">// namespace</span></div>
<div class="line"><a id="l01984" name="l01984"></a><span class="lineno"> 1984</span> </div>
<div class="line"><a id="l01985" name="l01985"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a7fea62548e11ae728e506874f767bdd3"> 1985</a></span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a7fea62548e11ae728e506874f767bdd3">CreateLinMaxCutGenerator</a>(</div>
<div class="line"><a id="l01986" name="l01986"></a><span class="lineno"> 1986</span> <span class="keyword">const</span> IntegerVariable target, <span class="keyword">const</span> std::vector&lt;LinearExpression&gt;&amp; exprs,</div>
<div class="line"><a id="l01987" name="l01987"></a><span class="lineno"> 1987</span> <span class="keyword">const</span> std::vector&lt;IntegerVariable&gt;&amp; z_vars, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
<div class="line"><a id="l01988" name="l01988"></a><span class="lineno"> 1988</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div>
<div class="line"><a id="l01989" name="l01989"></a><span class="lineno"> 1989</span> std::vector&lt;IntegerVariable&gt; x_vars;</div>
<div class="line"><a id="l01990" name="l01990"></a><span class="lineno"> 1990</span> result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a> = {target};</div>
<div class="line"><a id="l01991" name="l01991"></a><span class="lineno"> 1991</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_exprs = exprs.size();</div>
<div class="line"><a id="l01992" name="l01992"></a><span class="lineno"> 1992</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; num_exprs; ++i) {</div>
<div class="line"><a id="l01993" name="l01993"></a><span class="lineno"> 1993</span> result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.push_back(z_vars[i]);</div>
<div class="line"><a id="l01994" name="l01994"></a><span class="lineno"> 1994</span> x_vars.insert(x_vars.end(), exprs[i].vars.begin(), exprs[i].vars.end());</div>
<div class="line"><a id="l01995" name="l01995"></a><span class="lineno"> 1995</span> }</div>
<div class="line"><a id="l01996" name="l01996"></a><span class="lineno"> 1996</span> <a class="code hl_function" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&amp;x_vars);</div>
<div class="line"><a id="l01997" name="l01997"></a><span class="lineno"> 1997</span> <span class="comment">// All expressions should only contain positive variables.</span></div>
<div class="line"><a id="l01998" name="l01998"></a><span class="lineno"> 1998</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(std::all_of(x_vars.begin(), x_vars.end(), [](IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
<div class="line"><a id="l01999" name="l01999"></a><span class="lineno"> 1999</span> return VariableIsPositive(var);</div>
<div class="line"><a id="l02000" name="l02000"></a><span class="lineno"> 2000</span> }));</div>
<div class="line"><a id="l02001" name="l02001"></a><span class="lineno"> 2001</span> result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.insert(result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.end(), x_vars.begin(), x_vars.end());</div>
<div class="line"><a id="l02002" name="l02002"></a><span class="lineno"> 2002</span> </div>
<div class="line"><a id="l02003" name="l02003"></a><span class="lineno"> 2003</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>-&gt;GetOrCreate&lt;<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>&gt;();</div>
<div class="line"><a id="l02004" name="l02004"></a><span class="lineno"> 2004</span> result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">generate_cuts</a> =</div>
<div class="line"><a id="l02005" name="l02005"></a><span class="lineno"> 2005</span> [x_vars, z_vars, target, num_exprs, exprs, integer_trail, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>](</div>
<div class="line"><a id="l02006" name="l02006"></a><span class="lineno"> 2006</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values,</div>
<div class="line"><a id="l02007" name="l02007"></a><span class="lineno"> 2007</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div>
<div class="line"><a id="l02008" name="l02008"></a><span class="lineno"> 2008</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, int&gt;</a> variable_partition(</div>
<div class="line"><a id="l02009" name="l02009"></a><span class="lineno"> 2009</span> lp_values.size(), -1);</div>
<div class="line"><a id="l02010" name="l02010"></a><span class="lineno"> 2010</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a> variable_partition_contrib(</div>
<div class="line"><a id="l02011" name="l02011"></a><span class="lineno"> 2011</span> lp_values.size(), std::numeric_limits&lt;double&gt;::infinity());</div>
<div class="line"><a id="l02012" name="l02012"></a><span class="lineno"> 2012</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> expr_index = 0; expr_index &lt; num_exprs; ++expr_index) {</div>
<div class="line"><a id="l02013" name="l02013"></a><span class="lineno"> 2013</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : x_vars) {</div>
<div class="line"><a id="l02014" name="l02014"></a><span class="lineno"> 2014</span> <span class="keyword">const</span> <span class="keywordtype">double</span> contribution = ComputeContribution(</div>
<div class="line"><a id="l02015" name="l02015"></a><span class="lineno"> 2015</span> <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, z_vars, exprs, lp_values, *integer_trail, expr_index);</div>
<div class="line"><a id="l02016" name="l02016"></a><span class="lineno"> 2016</span> <span class="keyword">const</span> <span class="keywordtype">double</span> prev_contribution = variable_partition_contrib[<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>];</div>
<div class="line"><a id="l02017" name="l02017"></a><span class="lineno"> 2017</span> <span class="keywordflow">if</span> (contribution &lt; prev_contribution) {</div>
<div class="line"><a id="l02018" name="l02018"></a><span class="lineno"> 2018</span> variable_partition[<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = expr_index;</div>
<div class="line"><a id="l02019" name="l02019"></a><span class="lineno"> 2019</span> variable_partition_contrib[<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = contribution;</div>
<div class="line"><a id="l02020" name="l02020"></a><span class="lineno"> 2020</span> }</div>
<div class="line"><a id="l02021" name="l02021"></a><span class="lineno"> 2021</span> }</div>
<div class="line"><a id="l02022" name="l02022"></a><span class="lineno"> 2022</span> }</div>
<div class="line"><a id="l02023" name="l02023"></a><span class="lineno"> 2023</span> </div>
<div class="line"><a id="l02024" name="l02024"></a><span class="lineno"> 2024</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">LinearConstraintBuilder</a> cut(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <span class="comment">/*lb=*/</span>IntegerValue(0),</div>
<div class="line"><a id="l02025" name="l02025"></a><span class="lineno"> 2025</span> <span class="comment">/*ub=*/</span><a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>);</div>
<div class="line"><a id="l02026" name="l02026"></a><span class="lineno"> 2026</span> <span class="keywordtype">double</span> violation = lp_values[target];</div>
<div class="line"><a id="l02027" name="l02027"></a><span class="lineno"> 2027</span> cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(target, IntegerValue(-1));</div>
<div class="line"><a id="l02028" name="l02028"></a><span class="lineno"> 2028</span> </div>
<div class="line"><a id="l02029" name="l02029"></a><span class="lineno"> 2029</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable xi_var : x_vars) {</div>
<div class="line"><a id="l02030" name="l02030"></a><span class="lineno"> 2030</span> <span class="keyword">const</span> <span class="keywordtype">int</span> input_index = variable_partition[xi_var];</div>
<div class="line"><a id="l02031" name="l02031"></a><span class="lineno"> 2031</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a>&amp; expr = exprs[input_index];</div>
<div class="line"><a id="l02032" name="l02032"></a><span class="lineno"> 2032</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ab7b2c273b19bf885462dfa04611e4e62">GetCoefficientOfPositiveVar</a>(xi_var, expr);</div>
<div class="line"><a id="l02033" name="l02033"></a><span class="lineno"> 2033</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a> != IntegerValue(0)) {</div>
<div class="line"><a id="l02034" name="l02034"></a><span class="lineno"> 2034</span> cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(xi_var, <a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>);</div>
<div class="line"><a id="l02035" name="l02035"></a><span class="lineno"> 2035</span> }</div>
<div class="line"><a id="l02036" name="l02036"></a><span class="lineno"> 2036</span> violation -= <a class="code hl_function" href="namespaceoperations__research_1_1glop.html#afd6d278f9d061a91716c6770f2d723e8">ToDouble</a>(<a class="code hl_variable" href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a>) * lp_values[xi_var];</div>
<div class="line"><a id="l02037" name="l02037"></a><span class="lineno"> 2037</span> }</div>
<div class="line"><a id="l02038" name="l02038"></a><span class="lineno"> 2038</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> expr_index = 0; expr_index &lt; num_exprs; ++expr_index) {</div>
<div class="line"><a id="l02039" name="l02039"></a><span class="lineno"> 2039</span> <span class="keyword">const</span> IntegerVariable z_var = z_vars[expr_index];</div>
<div class="line"><a id="l02040" name="l02040"></a><span class="lineno"> 2040</span> <span class="keyword">const</span> IntegerValue z_coeff = MPlusCoefficient(</div>
<div class="line"><a id="l02041" name="l02041"></a><span class="lineno"> 2041</span> x_vars, exprs, variable_partition, expr_index, *integer_trail);</div>
<div class="line"><a id="l02042" name="l02042"></a><span class="lineno"> 2042</span> <span class="keywordflow">if</span> (z_coeff != IntegerValue(0)) {</div>
<div class="line"><a id="l02043" name="l02043"></a><span class="lineno"> 2043</span> cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(z_var, z_coeff);</div>
<div class="line"><a id="l02044" name="l02044"></a><span class="lineno"> 2044</span> }</div>
<div class="line"><a id="l02045" name="l02045"></a><span class="lineno"> 2045</span> violation -= <a class="code hl_function" href="namespaceoperations__research_1_1glop.html#afd6d278f9d061a91716c6770f2d723e8">ToDouble</a>(z_coeff) * lp_values[z_var];</div>
<div class="line"><a id="l02046" name="l02046"></a><span class="lineno"> 2046</span> }</div>
<div class="line"><a id="l02047" name="l02047"></a><span class="lineno"> 2047</span> <span class="keywordflow">if</span> (violation &gt; 1e-2) {</div>
<div class="line"><a id="l02048" name="l02048"></a><span class="lineno"> 2048</span> manager-&gt;AddCut(cut.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">Build</a>(), <span class="stringliteral">&quot;LinMax&quot;</span>, lp_values);</div>
<div class="line"><a id="l02049" name="l02049"></a><span class="lineno"> 2049</span> }</div>
<div class="line"><a id="l02050" name="l02050"></a><span class="lineno"> 2050</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l02051" name="l02051"></a><span class="lineno"> 2051</span> };</div>
<div class="line"><a id="l02052" name="l02052"></a><span class="lineno"> 2052</span> <span class="keywordflow">return</span> result;</div>
<div class="line"><a id="l02053" name="l02053"></a><span class="lineno"> 2053</span>}</div>
<div class="line"><a id="l02054" name="l02054"></a><span class="lineno"> 2054</span> </div>
<div class="line"><a id="l02055" name="l02055"></a><span class="lineno"> 2055</span><span class="keyword">namespace </span>{</div>
<div class="line"><a id="l02056" name="l02056"></a><span class="lineno"> 2056</span> </div>
<div class="line"><a id="l02057" name="l02057"></a><span class="lineno"> 2057</span>IntegerValue EvaluateMaxAffine(</div>
<div class="line"><a id="l02058" name="l02058"></a><span class="lineno"> 2058</span> <span class="keyword">const</span> std::vector&lt;std::pair&lt;IntegerValue, IntegerValue&gt;&gt;&amp; affines,</div>
<div class="line"><a id="l02059" name="l02059"></a><span class="lineno"> 2059</span> IntegerValue x) {</div>
<div class="line"><a id="l02060" name="l02060"></a><span class="lineno"> 2060</span> IntegerValue y = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5316808a2d5007c3b489e844801385e5">kMinIntegerValue</a>;</div>
<div class="line"><a id="l02061" name="l02061"></a><span class="lineno"> 2061</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; p : affines) {</div>
<div class="line"><a id="l02062" name="l02062"></a><span class="lineno"> 2062</span> y = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(y, x * p.first + p.second);</div>
<div class="line"><a id="l02063" name="l02063"></a><span class="lineno"> 2063</span> }</div>
<div class="line"><a id="l02064" name="l02064"></a><span class="lineno"> 2064</span> <span class="keywordflow">return</span> y;</div>
<div class="line"><a id="l02065" name="l02065"></a><span class="lineno"> 2065</span>}</div>
<div class="line"><a id="l02066" name="l02066"></a><span class="lineno"> 2066</span> </div>
<div class="line"><a id="l02067" name="l02067"></a><span class="lineno"> 2067</span>} <span class="comment">// namespace</span></div>
<div class="line"><a id="l02068" name="l02068"></a><span class="lineno"> 2068</span> </div>
<div class="line"><a id="l02069" name="l02069"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a88fabb0f851ff07d459b8be401162601"> 2069</a></span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a88fabb0f851ff07d459b8be401162601">BuildMaxAffineUpConstraint</a>(</div>
<div class="line"><a id="l02070" name="l02070"></a><span class="lineno"> 2070</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a>&amp; target, IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>,</div>
<div class="line"><a id="l02071" name="l02071"></a><span class="lineno"> 2071</span> <span class="keyword">const</span> std::vector&lt;std::pair&lt;IntegerValue, IntegerValue&gt;&gt;&amp; affines,</div>
<div class="line"><a id="l02072" name="l02072"></a><span class="lineno"> 2072</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
<div class="line"><a id="l02073" name="l02073"></a><span class="lineno"> 2073</span> <span class="keyword">auto</span>* integer_trail = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>-&gt;GetOrCreate&lt;<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>&gt;();</div>
<div class="line"><a id="l02074" name="l02074"></a><span class="lineno"> 2074</span> <span class="keyword">const</span> IntegerValue x_min = integer_trail-&gt;<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l02075" name="l02075"></a><span class="lineno"> 2075</span> <span class="keyword">const</span> IntegerValue x_max = integer_trail-&gt;LevelZeroUpperBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l02076" name="l02076"></a><span class="lineno"> 2076</span> </div>
<div class="line"><a id="l02077" name="l02077"></a><span class="lineno"> 2077</span> <span class="keyword">const</span> IntegerValue y_at_min = EvaluateMaxAffine(affines, x_min);</div>
<div class="line"><a id="l02078" name="l02078"></a><span class="lineno"> 2078</span> <span class="keyword">const</span> IntegerValue y_at_max = EvaluateMaxAffine(affines, x_max);</div>
<div class="line"><a id="l02079" name="l02079"></a><span class="lineno"> 2079</span> </div>
<div class="line"><a id="l02080" name="l02080"></a><span class="lineno"> 2080</span> <span class="comment">// TODO(user): Be careful to not have any integer overflow in any of</span></div>
<div class="line"><a id="l02081" name="l02081"></a><span class="lineno"> 2081</span> <span class="comment">// the formula used here.</span></div>
<div class="line"><a id="l02082" name="l02082"></a><span class="lineno"> 2082</span> <span class="keyword">const</span> IntegerValue delta_x = x_max - x_min;</div>
<div class="line"><a id="l02083" name="l02083"></a><span class="lineno"> 2083</span> <span class="keyword">const</span> IntegerValue delta_y = y_at_max - y_at_min;</div>
<div class="line"><a id="l02084" name="l02084"></a><span class="lineno"> 2084</span> </div>
<div class="line"><a id="l02085" name="l02085"></a><span class="lineno"> 2085</span> <span class="comment">// target &lt;= y_at_min + (delta_y / delta_x) * (var - x_min)</span></div>
<div class="line"><a id="l02086" name="l02086"></a><span class="lineno"> 2086</span> <span class="comment">// delta_x * target &lt;= delta_x * y_at_min + delta_y * (var - x_min)</span></div>
<div class="line"><a id="l02087" name="l02087"></a><span class="lineno"> 2087</span> <span class="comment">// -delta_y * var + delta_x * target &lt;= delta_x * y_at_min - delta_y * x_min</span></div>
<div class="line"><a id="l02088" name="l02088"></a><span class="lineno"> 2088</span> <span class="keyword">const</span> IntegerValue rhs = delta_x * y_at_min - delta_y * x_min;</div>
<div class="line"><a id="l02089" name="l02089"></a><span class="lineno"> 2089</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">LinearConstraintBuilder</a> lc(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5316808a2d5007c3b489e844801385e5">kMinIntegerValue</a>, rhs);</div>
<div class="line"><a id="l02090" name="l02090"></a><span class="lineno"> 2090</span> lc.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a49e8e4a987d39f4da335e1ed287bb8ad">AddLinearExpression</a>(target, delta_x);</div>
<div class="line"><a id="l02091" name="l02091"></a><span class="lineno"> 2091</span> lc.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, -delta_y);</div>
<div class="line"><a id="l02092" name="l02092"></a><span class="lineno"> 2092</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = lc.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">Build</a>();</div>
<div class="line"><a id="l02093" name="l02093"></a><span class="lineno"> 2093</span> </div>
<div class="line"><a id="l02094" name="l02094"></a><span class="lineno"> 2094</span> <span class="comment">// Prevent to create constraints that can overflow.</span></div>
<div class="line"><a id="l02095" name="l02095"></a><span class="lineno"> 2095</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a0c5d040da1879626549b8877fa275d86">ValidateLinearConstraintForOverflow</a>(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, *integer_trail)) {</div>
<div class="line"><a id="l02096" name="l02096"></a><span class="lineno"> 2096</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) &lt;&lt; <span class="stringliteral">&quot;Linear constraint can cause overflow: &quot;</span> &lt;&lt; <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>;</div>
<div class="line"><a id="l02097" name="l02097"></a><span class="lineno"> 2097</span> </div>
<div class="line"><a id="l02098" name="l02098"></a><span class="lineno"> 2098</span> <span class="comment">// TODO(user): Change API instead of returning trivial constraint?</span></div>
<div class="line"><a id="l02099" name="l02099"></a><span class="lineno"> 2099</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.Clear();</div>
<div class="line"><a id="l02100" name="l02100"></a><span class="lineno"> 2100</span> }</div>
<div class="line"><a id="l02101" name="l02101"></a><span class="lineno"> 2101</span> </div>
<div class="line"><a id="l02102" name="l02102"></a><span class="lineno"> 2102</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>;</div>
<div class="line"><a id="l02103" name="l02103"></a><span class="lineno"> 2103</span>}</div>
<div class="line"><a id="l02104" name="l02104"></a><span class="lineno"> 2104</span> </div>
<div class="line"><a id="l02105" name="l02105"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ab782d6f91aefca5ee81c3b622e862875"> 2105</a></span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ab782d6f91aefca5ee81c3b622e862875">CreateMaxAffineCutGenerator</a>(</div>
<div class="line"><a id="l02106" name="l02106"></a><span class="lineno"> 2106</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a> target, IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>,</div>
<div class="line"><a id="l02107" name="l02107"></a><span class="lineno"> 2107</span> std::vector&lt;std::pair&lt;IntegerValue, IntegerValue&gt;&gt; affines,</div>
<div class="line"><a id="l02108" name="l02108"></a><span class="lineno"> 2108</span> <span class="keyword">const</span> std::string cut_name, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
<div class="line"><a id="l02109" name="l02109"></a><span class="lineno"> 2109</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div>
<div class="line"><a id="l02110" name="l02110"></a><span class="lineno"> 2110</span> result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a> = target.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_linear_expression.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>;</div>
<div class="line"><a id="l02111" name="l02111"></a><span class="lineno"> 2111</span> result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.push_back(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l02112" name="l02112"></a><span class="lineno"> 2112</span> <a class="code hl_function" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&amp;result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div>
<div class="line"><a id="l02113" name="l02113"></a><span class="lineno"> 2113</span> </div>
<div class="line"><a id="l02114" name="l02114"></a><span class="lineno"> 2114</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>-&gt;GetOrCreate&lt;<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>&gt;();</div>
<div class="line"><a id="l02115" name="l02115"></a><span class="lineno"> 2115</span> result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">generate_cuts</a> =</div>
<div class="line"><a id="l02116" name="l02116"></a><span class="lineno"> 2116</span> [target, <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, affines, cut_name, integer_trail, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>](</div>
<div class="line"><a id="l02117" name="l02117"></a><span class="lineno"> 2117</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values,</div>
<div class="line"><a id="l02118" name="l02118"></a><span class="lineno"> 2118</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div>
<div class="line"><a id="l02119" name="l02119"></a><span class="lineno"> 2119</span> <span class="keywordflow">if</span> (integer_trail-&gt;<a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">IsFixed</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l02120" name="l02120"></a><span class="lineno"> 2120</span> manager-&gt;AddCut(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a88fabb0f851ff07d459b8be401162601">BuildMaxAffineUpConstraint</a>(target, <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, affines, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>),</div>
<div class="line"><a id="l02121" name="l02121"></a><span class="lineno"> 2121</span> cut_name, lp_values);</div>
<div class="line"><a id="l02122" name="l02122"></a><span class="lineno"> 2122</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l02123" name="l02123"></a><span class="lineno"> 2123</span> };</div>
<div class="line"><a id="l02124" name="l02124"></a><span class="lineno"> 2124</span> <span class="keywordflow">return</span> result;</div>
<div class="line"><a id="l02125" name="l02125"></a><span class="lineno"> 2125</span>}</div>
<div class="line"><a id="l02126" name="l02126"></a><span class="lineno"> 2126</span> </div>
<div class="line"><a id="l02127" name="l02127"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#adf176ac81e34e8fd124d823ee0033f1a"> 2127</a></span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#adf176ac81e34e8fd124d823ee0033f1a">CreateCliqueCutGenerator</a>(</div>
<div class="line"><a id="l02128" name="l02128"></a><span class="lineno"> 2128</span> <span class="keyword">const</span> std::vector&lt;IntegerVariable&gt;&amp; base_variables, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
<div class="line"><a id="l02129" name="l02129"></a><span class="lineno"> 2129</span> <span class="comment">// Filter base_variables to only keep the one with a literal view, and</span></div>
<div class="line"><a id="l02130" name="l02130"></a><span class="lineno"> 2130</span> <span class="comment">// do the conversion.</span></div>
<div class="line"><a id="l02131" name="l02131"></a><span class="lineno"> 2131</span> std::vector&lt;IntegerVariable&gt; variables;</div>
<div class="line"><a id="l02132" name="l02132"></a><span class="lineno"> 2132</span> std::vector&lt;Literal&gt; literals;</div>
<div class="line"><a id="l02133" name="l02133"></a><span class="lineno"> 2133</span> absl::flat_hash_map&lt;LiteralIndex, IntegerVariable&gt; positive_map;</div>
<div class="line"><a id="l02134" name="l02134"></a><span class="lineno"> 2134</span> absl::flat_hash_map&lt;LiteralIndex, IntegerVariable&gt; negative_map;</div>
<div class="line"><a id="l02135" name="l02135"></a><span class="lineno"> 2135</span> <span class="keyword">auto</span>* integer_trail = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>-&gt;GetOrCreate&lt;<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>&gt;();</div>
<div class="line"><a id="l02136" name="l02136"></a><span class="lineno"> 2136</span> <span class="keyword">auto</span>* encoder = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>-&gt;GetOrCreate&lt;<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>&gt;();</div>
<div class="line"><a id="l02137" name="l02137"></a><span class="lineno"> 2137</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : base_variables) {</div>
<div class="line"><a id="l02138" name="l02138"></a><span class="lineno"> 2138</span> <span class="keywordflow">if</span> (integer_trail-&gt;LowerBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) != IntegerValue(0)) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l02139" name="l02139"></a><span class="lineno"> 2139</span> <span class="keywordflow">if</span> (integer_trail-&gt;UpperBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) != IntegerValue(1)) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l02140" name="l02140"></a><span class="lineno"> 2140</span> <span class="keyword">const</span> LiteralIndex literal_index = encoder-&gt;GetAssociatedLiteral(</div>
<div class="line"><a id="l02141" name="l02141"></a><span class="lineno"> 2141</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ab3ba1ab2a4a6cdc0ea4324d409ddbe7e">IntegerLiteral::GreaterOrEqual</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, IntegerValue(1)));</div>
<div class="line"><a id="l02142" name="l02142"></a><span class="lineno"> 2142</span> <span class="keywordflow">if</span> (literal_index != <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) {</div>
<div class="line"><a id="l02143" name="l02143"></a><span class="lineno"> 2143</span> variables.push_back(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l02144" name="l02144"></a><span class="lineno"> 2144</span> literals.push_back(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(literal_index));</div>
<div class="line"><a id="l02145" name="l02145"></a><span class="lineno"> 2145</span> positive_map[literal_index] = <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>;</div>
<div class="line"><a id="l02146" name="l02146"></a><span class="lineno"> 2146</span> negative_map[<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(literal_index).<a class="code hl_function" href="classoperations__research_1_1sat_1_1_literal.html#a239e1315c4e975a35537790ba0d913a7">NegatedIndex</a>()] = <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>;</div>
<div class="line"><a id="l02147" name="l02147"></a><span class="lineno"> 2147</span> }</div>
<div class="line"><a id="l02148" name="l02148"></a><span class="lineno"> 2148</span> }</div>
<div class="line"><a id="l02149" name="l02149"></a><span class="lineno"> 2149</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div>
<div class="line"><a id="l02150" name="l02150"></a><span class="lineno"> 2150</span> result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a> = variables;</div>
<div class="line"><a id="l02151" name="l02151"></a><span class="lineno"> 2151</span> <span class="keyword">auto</span>* implication_graph = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>-&gt;GetOrCreate&lt;<a class="code hl_class" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html">BinaryImplicationGraph</a>&gt;();</div>
<div class="line"><a id="l02152" name="l02152"></a><span class="lineno"> 2152</span> result.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">generate_cuts</a> =</div>
<div class="line"><a id="l02153" name="l02153"></a><span class="lineno"> 2153</span> [variables, literals, implication_graph, positive_map, negative_map,</div>
<div class="line"><a id="l02154" name="l02154"></a><span class="lineno"> 2154</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>](<span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;IntegerVariable, double&gt;</a>&amp; lp_values,</div>
<div class="line"><a id="l02155" name="l02155"></a><span class="lineno"> 2155</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div>
<div class="line"><a id="l02156" name="l02156"></a><span class="lineno"> 2156</span> std::vector&lt;double&gt; packed_values;</div>
<div class="line"><a id="l02157" name="l02157"></a><span class="lineno"> 2157</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; literals.size(); ++i) {</div>
<div class="line"><a id="l02158" name="l02158"></a><span class="lineno"> 2158</span> packed_values.push_back(lp_values[variables[i]]);</div>
<div class="line"><a id="l02159" name="l02159"></a><span class="lineno"> 2159</span> }</div>
<div class="line"><a id="l02160" name="l02160"></a><span class="lineno"> 2160</span> <span class="keyword">const</span> std::vector&lt;std::vector&lt;Literal&gt;&gt; at_most_ones =</div>
<div class="line"><a id="l02161" name="l02161"></a><span class="lineno"> 2161</span> implication_graph-&gt;GenerateAtMostOnesWithLargeWeight(literals,</div>
<div class="line"><a id="l02162" name="l02162"></a><span class="lineno"> 2162</span> packed_values);</div>
<div class="line"><a id="l02163" name="l02163"></a><span class="lineno"> 2163</span> </div>
<div class="line"><a id="l02164" name="l02164"></a><span class="lineno"> 2164</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> std::vector&lt;Literal&gt;&amp; at_most_one : at_most_ones) {</div>
<div class="line"><a id="l02165" name="l02165"></a><span class="lineno"> 2165</span> <span class="comment">// We need to express such &quot;at most one&quot; in term of the initial</span></div>
<div class="line"><a id="l02166" name="l02166"></a><span class="lineno"> 2166</span> <span class="comment">// variables, so we do not use the</span></div>
<div class="line"><a id="l02167" name="l02167"></a><span class="lineno"> 2167</span> <span class="comment">// LinearConstraintBuilder::AddLiteralTerm() here.</span></div>
<div class="line"><a id="l02168" name="l02168"></a><span class="lineno"> 2168</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">LinearConstraintBuilder</a> builder(</div>
<div class="line"><a id="l02169" name="l02169"></a><span class="lineno"> 2169</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, IntegerValue(<a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits&lt;int64_t&gt;::min</a>()),</div>
<div class="line"><a id="l02170" name="l02170"></a><span class="lineno"> 2170</span> IntegerValue(1));</div>
<div class="line"><a id="l02171" name="l02171"></a><span class="lineno"> 2171</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l : at_most_one) {</div>
<div class="line"><a id="l02172" name="l02172"></a><span class="lineno"> 2172</span> <span class="keywordflow">if</span> (positive_map.contains(l.Index())) {</div>
<div class="line"><a id="l02173" name="l02173"></a><span class="lineno"> 2173</span> builder.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(positive_map.at(l.Index()), IntegerValue(1));</div>
<div class="line"><a id="l02174" name="l02174"></a><span class="lineno"> 2174</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l02175" name="l02175"></a><span class="lineno"> 2175</span> <span class="comment">// Add 1 - X to the linear constraint.</span></div>
<div class="line"><a id="l02176" name="l02176"></a><span class="lineno"> 2176</span> builder.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(negative_map.at(l.Index()), IntegerValue(-1));</div>
<div class="line"><a id="l02177" name="l02177"></a><span class="lineno"> 2177</span> builder.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a322657f18d11f256cf3e03b0bd640d5a">AddConstant</a>(IntegerValue(1));</div>
<div class="line"><a id="l02178" name="l02178"></a><span class="lineno"> 2178</span> }</div>
<div class="line"><a id="l02179" name="l02179"></a><span class="lineno"> 2179</span> }</div>
<div class="line"><a id="l02180" name="l02180"></a><span class="lineno"> 2180</span> </div>
<div class="line"><a id="l02181" name="l02181"></a><span class="lineno"> 2181</span> manager-&gt;AddCut(builder.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">Build</a>(), <span class="stringliteral">&quot;clique&quot;</span>, lp_values);</div>
<div class="line"><a id="l02182" name="l02182"></a><span class="lineno"> 2182</span> }</div>
<div class="line"><a id="l02183" name="l02183"></a><span class="lineno"> 2183</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l02184" name="l02184"></a><span class="lineno"> 2184</span> };</div>
<div class="line"><a id="l02185" name="l02185"></a><span class="lineno"> 2185</span> <span class="keywordflow">return</span> result;</div>
<div class="line"><a id="l02186" name="l02186"></a><span class="lineno"> 2186</span>}</div>
<div class="line"><a id="l02187" name="l02187"></a><span class="lineno"> 2187</span> </div>
<div class="line"><a id="l02188" name="l02188"></a><span class="lineno"> 2188</span>} <span class="comment">// namespace sat</span></div>
<div class="line"><a id="l02189" name="l02189"></a><span class="lineno"> 2189</span>} <span class="comment">// namespace operations_research</span></div>
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
<div class="ttc" id="aalldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00892">base/logging.h:892</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_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00703">base/logging.h:703</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="abase_2logging_8h_html_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00708">base/logging.h:708</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00895">base/logging.h:895</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_ab25e01a2942b821d66371fc68d53f2eb"><div class="ttname"><a href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a></div><div class="ttdeci">#define CHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00704">base/logging.h:704</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_ab62f5ed8f2d48e29802be0cbbcd1359a"><div class="ttname"><a href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a></div><div class="ttdeci">#define DCHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00894">base/logging.h:894</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00420">base/logging.h:420</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00890">base/logging.h:890</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00984">base/logging.h:984</a></div></div>
<div class="ttc" id="aclassabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt; IntegerVariable, double &gt;</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_for_cuts_html"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver_for_cuts.html">operations_research::KnapsackSolverForCuts</a></div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver__for__cuts_8h_source.html#l00301">knapsack_solver_for_cuts.h:301</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_for_cuts_html_a3bd66bb6693c84e8b758c0d8a18ed9e5"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver_for_cuts.html#a3bd66bb6693c84e8b758c0d8a18ed9e5">operations_research::KnapsackSolverForCuts::best_solution</a></div><div class="ttdeci">bool best_solution(int item_id) const</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver__for__cuts_8h_source.html#l00342">knapsack_solver_for_cuts.h:342</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_for_cuts_html_a4bcd14198cbb6f2c3bea61c85015e07a"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver_for_cuts.html#a4bcd14198cbb6f2c3bea61c85015e07a">operations_research::KnapsackSolverForCuts::set_node_limit</a></div><div class="ttdeci">void set_node_limit(const int64_t node_limit)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver__for__cuts_8h_source.html#l00337">knapsack_solver_for_cuts.h:337</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_for_cuts_html_a902b91803b24fe467929767c65b6ee4f"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver_for_cuts.html#a902b91803b24fe467929767c65b6ee4f">operations_research::KnapsackSolverForCuts::Init</a></div><div class="ttdeci">void Init(const std::vector&lt; double &gt; &amp;profits, const std::vector&lt; double &gt; &amp;weights, const double capacity)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver__for__cuts_8cc_source.html#l00287">knapsack_solver_for_cuts.cc:287</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_for_cuts_html_aab4a9c689632460b6b96f3d4bf22f86e"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver_for_cuts.html#aab4a9c689632460b6b96f3d4bf22f86e">operations_research::KnapsackSolverForCuts::Solve</a></div><div class="ttdeci">double Solve(TimeLimit *time_limit, bool *is_solution_optimal)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver__for__cuts_8cc_source.html#l00321">knapsack_solver_for_cuts.cc:321</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_for_cuts_html_afa66a5ae5f09a131d7fdb338b8a212ba"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver_for_cuts.html#afa66a5ae5f09a131d7fdb338b8a212ba">operations_research::KnapsackSolverForCuts::GetUpperBound</a></div><div class="ttdeci">double GetUpperBound()</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver__for__cuts_8h_source.html#l00320">knapsack_solver_for_cuts.h:320</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1_knapsack_solver_for_cuts_html_afd53920302b4dcd6ef445bc52a001a5b"><div class="ttname"><a href="classoperations__research_1_1_knapsack_solver_for_cuts.html#afd53920302b4dcd6ef445bc52a001a5b">operations_research::KnapsackSolverForCuts::set_solution_upper_bound_threshold</a></div><div class="ttdeci">void set_solution_upper_bound_threshold(const double solution_upper_bound_threshold)</div><div class="ttdef"><b>Definition:</b> <a href="knapsack__solver__for__cuts_8h_source.html#l00331">knapsack_solver_for_cuts.h:331</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html">operations_research::TimeLimit</a></div><div class="ttdoc">A simple class to enforce both an elapsed time limit and a deterministic time limit in the same threa...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00106">time_limit.h:106</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html_a810d5f7aaf80cc09cf5a094e20c1aaca"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">operations_research::TimeLimit::LimitReached</a></div><div class="ttdeci">bool LimitReached()</div><div class="ttdoc">Returns true when the external limit is true, or the deterministic time is over the deterministic lim...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00546">time_limit.h:546</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html">operations_research::sat::BinaryImplicationGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00457">clause.h:457</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_cover_cut_helper_html_ad86e161bb994fe49fa9c4298ebb5ae2d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cover_cut_helper.html#ad86e161bb994fe49fa9c4298ebb5ae2d">operations_research::sat::CoverCutHelper::TrySimpleKnapsack</a></div><div class="ttdeci">bool TrySimpleKnapsack(const LinearConstraint base_ct, const std::vector&lt; double &gt; &amp;lp_values, const std::vector&lt; IntegerValue &gt; &amp;lower_bounds, const std::vector&lt; IntegerValue &gt; &amp;upper_bounds)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l01185">cuts.cc:1185</a></div></div>
<div class="ttc" id="aclassoperations__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#l00082">implied_bounds.h:82</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_implied_bounds_processor_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html">operations_research::sat::ImpliedBoundsProcessor</a></div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00062">cuts.h:62</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_implied_bounds_processor_html_a7fb8d0b24091252e79aea6e5666f29e8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#a7fb8d0b24091252e79aea6e5666f29e8">operations_research::sat::ImpliedBoundsProcessor::ProcessUpperBoundedConstraint</a></div><div class="ttdeci">void ProcessUpperBoundedConstraint(const absl::StrongVector&lt; IntegerVariable, double &gt; &amp;lp_values, LinearConstraint *cut)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l01520">cuts.cc:1520</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_implied_bounds_processor_html_ab354ebe396f7f5ad0c79ff2a928d9a40"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#ab354ebe396f7f5ad0c79ff2a928d9a40">operations_research::sat::ImpliedBoundsProcessor::RecomputeCacheAndSeparateSomeImpliedBoundCuts</a></div><div class="ttdeci">void RecomputeCacheAndSeparateSomeImpliedBoundCuts(const absl::StrongVector&lt; IntegerVariable, double &gt; &amp;lp_values)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l01603">cuts.cc:1603</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_implied_bounds_processor_html_abb0b7cc2e259fc8ebe8fd3dd55816b75"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#abb0b7cc2e259fc8ebe8fd3dd55816b75">operations_research::sat::ImpliedBoundsProcessor::GetCachedImpliedBoundInfo</a></div><div class="ttdeci">BestImpliedBoundInfo GetCachedImpliedBoundInfo(IntegerVariable var)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l01529">cuts.cc:1529</a></div></div>
<div class="ttc" id="aclassoperations__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#l00362">integer.h:362</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_rounding_cut_helper_html_a66c8e6dc26260b69dcdf7668925dc3aa"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_rounding_cut_helper.html#a66c8e6dc26260b69dcdf7668925dc3aa">operations_research::sat::IntegerRoundingCutHelper::ComputeCut</a></div><div class="ttdeci">void ComputeCut(RoundingOptions options, const std::vector&lt; double &gt; &amp;lp_values, const std::vector&lt; IntegerValue &gt; &amp;lower_bounds, const std::vector&lt; IntegerValue &gt; &amp;upper_bounds, ImpliedBoundsProcessor *ib_processor, LinearConstraint *cut)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l00731">cuts.cc:731</a></div></div>
<div class="ttc" id="aclassoperations__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#l00620">integer.h:620</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a523501d854b2ca8034d37c15e7c89117"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">operations_research::sat::IntegerTrail::IsFixed</a></div><div class="ttdeci">bool IsFixed(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01453">integer.h:1453</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a9ab880b5e67213a0607c5c3935da9f08"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">operations_research::sat::IntegerTrail::LevelZeroUpperBound</a></div><div class="ttdeci">IntegerValue LevelZeroUpperBound(IntegerVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01534">integer.h:1534</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_aa68cc40c827bff2fb311040e2b848f9b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">operations_research::sat::IntegerTrail::LevelZeroLowerBound</a></div><div class="ttdeci">IntegerValue LevelZeroLowerBound(IntegerVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01529">integer.h:1529</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_builder_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">operations_research::sat::LinearConstraintBuilder</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00161">sat/linear_constraint.h:161</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_builder_html_a322657f18d11f256cf3e03b0bd640d5a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a322657f18d11f256cf3e03b0bd640d5a">operations_research::sat::LinearConstraintBuilder::AddConstant</a></div><div class="ttdeci">void AddConstant(IntegerValue value)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8cc_source.html#l00100">linear_constraint.cc:100</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_builder_html_a49e8e4a987d39f4da335e1ed287bb8ad"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a49e8e4a987d39f4da335e1ed287bb8ad">operations_research::sat::LinearConstraintBuilder::AddLinearExpression</a></div><div class="ttdeci">void AddLinearExpression(const LinearExpression &amp;expr)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8cc_source.html#l00065">linear_constraint.cc:65</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_builder_html_a8ef32d79f50eb45bb9305c8b436cf6c4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">operations_research::sat::LinearConstraintBuilder::Build</a></div><div class="ttdeci">LinearConstraint Build()</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8cc_source.html#l00133">linear_constraint.cc:133</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_builder_html_ad65ddc0d04d71006a9ebe3b9dcfe2ce6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">operations_research::sat::LinearConstraintBuilder::AddTerm</a></div><div class="ttdeci">void AddTerm(IntegerVariable var, IntegerValue coeff)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8cc_source.html#l00039">linear_constraint.cc:39</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">operations_research::sat::LinearConstraintManager</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint__manager_8h_source.html#l00050">linear_constraint_manager.h:50</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_literal_html_a239e1315c4e975a35537790ba0d913a7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a239e1315c4e975a35537790ba0d913a7">operations_research::sat::Literal::NegatedIndex</a></div><div class="ttdeci">LiteralIndex NegatedIndex() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00088">sat_base.h:88</a></div></div>
<div class="ttc" id="aclassoperations__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#l00042">sat/model.h:42</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html">operations_research::sat::Trail</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00236">sat_base.h:236</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_ad63c4461a1384629cb99413c6df8b9ca"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">operations_research::sat::Trail::CurrentDecisionLevel</a></div><div class="ttdeci">int CurrentDecisionLevel() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00358">sat_base.h:358</a></div></div>
<div class="ttc" id="aclause_8h_html"><div class="ttname"><a href="clause_8h.html">clause.h</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="acp__model__solver_8cc_html_aec8af5c1be4e1b6d4330e1161028de21"><div class="ttname"><a href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a></div><div class="ttdeci">ModelSharedTimeLimit * time_limit</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02050">cp_model_solver.cc:2050</a></div></div>
<div class="ttc" id="acuts_8h_html"><div class="ttname"><a href="cuts_8h.html">cuts.h</a></div></div>
<div class="ttc" id="ademon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695"><div class="ttname"><a href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a></div><div class="ttdeci">const Constraint * ct</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
<div class="ttc" id="ademon__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="aexpr__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="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="agurobi__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="aimplied__bounds_8h_html"><div class="ttname"><a href="implied__bounds_8h.html">implied_bounds.h</a></div></div>
<div class="ttc" id="ainteger_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
<div class="ttc" id="aknapsack__solver__for__cuts_8h_html"><div class="ttname"><a href="knapsack__solver__for__cuts_8h.html">knapsack_solver_for_cuts.h</a></div></div>
<div class="ttc" id="alinear__constraint__manager_8h_html"><div class="ttname"><a href="linear__constraint__manager_8h.html">linear_constraint_manager.h</a></div></div>
<div class="ttc" id="alocal__search_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l02750">local_search.cc:2750</a></div></div>
<div class="ttc" id="alog__severity_8h_html_ab4a2cbab234914b320b7fae11b6e8cb9"><div class="ttname"><a href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a></div><div class="ttdeci">const int INFO</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00031">log_severity.h:31</a></div></div>
<div class="ttc" id="anamespacegtl_html_a288a1dc92da5d3ad62d4bc4cec9e8b1d"><div class="ttname"><a href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a></div><div class="ttdeci">void STLSortAndRemoveDuplicates(T *v, const LessFunc &amp;less_func)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00058">stl_util.h:58</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_afd6d278f9d061a91716c6770f2d723e8"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#afd6d278f9d061a91716c6770f2d723e8">operations_research::glop::ToDouble</a></div><div class="ttdeci">static double ToDouble(double f)</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00069">lp_types.h:69</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a06e2118f6735d033f7f43a939abe558d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a06e2118f6735d033f7f43a939abe558d">operations_research::sat::ConvertToKnapsackForm</a></div><div class="ttdeci">void ConvertToKnapsackForm(const LinearConstraint &amp;constraint, std::vector&lt; LinearConstraint &gt; *knapsack_constraints, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l00404">cuts.cc:404</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a07823d046b027c81155f8a2f322cf813"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">operations_research::sat::FloorRatio</a></div><div class="ttdeci">IntegerValue FloorRatio(IntegerValue dividend, IntegerValue positive_divisor)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00098">integer.h:98</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a0c5d040da1879626549b8877fa275d86"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0c5d040da1879626549b8877fa275d86">operations_research::sat::ValidateLinearConstraintForOverflow</a></div><div class="ttdeci">bool ValidateLinearConstraintForOverflow(const LinearConstraint &amp;constraint, const IntegerTrail &amp;integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8cc_source.html#l00385">linear_constraint.cc:385</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a0c9e8fab437ba44c91b0493a74cde263"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">operations_research::sat::AddProductTo</a></div><div class="ttdeci">bool AddProductTo(IntegerValue a, IntegerValue b, IntegerValue *result)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00121">integer.h:121</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1227e67513602591fb959e35c9de66e8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">operations_research::sat::kMaxIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMaxIntegerValue(std::numeric_limits&lt; IntegerValue::ValueType &gt;::max() - 1)</div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1de556a1559f25bd0819655d375f6c8e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1de556a1559f25bd0819655d375f6c8e">operations_research::sat::GetPreprocessedLinearConstraint</a></div><div class="ttdeci">LinearConstraint GetPreprocessedLinearConstraint(const LinearConstraint &amp;constraint, const absl::StrongVector&lt; IntegerVariable, double &gt; &amp;lp_values, const IntegerTrail &amp;integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l00266">cuts.cc:266</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1e30e51173c7e43a8c0b4668d5e3f050"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">operations_research::sat::IntTypeAbs</a></div><div class="ttdeci">IntType IntTypeAbs(IntType t)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00085">integer.h:85</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a25553837a2eba1b1fbb5ac0eac64ad15"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a25553837a2eba1b1fbb5ac0eac64ad15">operations_research::sat::CreateAllDifferentCutGenerator</a></div><div class="ttdeci">CutGenerator CreateAllDifferentCutGenerator(const std::vector&lt; AffineExpression &gt; &amp;exprs, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l01876">cuts.cc:1876</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a29b96869d2a821cf1d2e6099e7a0f51b"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">operations_research::sat::CeilRatio</a></div><div class="ttdeci">IntegerValue CeilRatio(IntegerValue dividend, IntegerValue positive_divisor)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00089">integer.h:89</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a2dbcb7017d468a17bdb30252af5c6c31"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">operations_research::sat::kNoLiteralIndex</a></div><div class="ttdeci">const LiteralIndex kNoLiteralIndex(-1)</div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a32f0016572d69bfcd1f3af811b2043ad"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a32f0016572d69bfcd1f3af811b2043ad">operations_research::sat::CanFormValidKnapsackCover</a></div><div class="ttdeci">bool CanFormValidKnapsackCover(const LinearConstraint &amp;preprocessed_constraint, const absl::StrongVector&lt; IntegerVariable, double &gt; &amp;lp_values, const IntegerTrail &amp;integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l00386">cuts.cc:386</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a4393db2c15b2f92d7ef16ce6b38c8150"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a4393db2c15b2f92d7ef16ce6b38c8150">operations_research::sat::RemoveZeroTerms</a></div><div class="ttdeci">void RemoveZeroTerms(LinearConstraint *constraint)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8cc_source.html#l00234">linear_constraint.cc:234</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a44bd0a015c444c2e2d58a002a09a1ea5"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a44bd0a015c444c2e2d58a002a09a1ea5">operations_research::sat::GetFactorT</a></div><div class="ttdeci">IntegerValue GetFactorT(IntegerValue rhs_remainder, IntegerValue divisor, IntegerValue max_t)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l00635">cuts.cc:635</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a457076abfb3071fca80b8175363e3dfa"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a457076abfb3071fca80b8175363e3dfa">operations_research::sat::GetKnapsackUpperBound</a></div><div class="ttdeci">double GetKnapsackUpperBound(std::vector&lt; KnapsackItem &gt; items, const double capacity)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l00334">cuts.cc:334</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a5316808a2d5007c3b489e844801385e5"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5316808a2d5007c3b489e844801385e5">operations_research::sat::kMinIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMinIntegerValue(-kMaxIntegerValue.value())</div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a588b516182cd6d5d8c048dfd76bc5523"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a588b516182cd6d5d8c048dfd76bc5523">operations_research::sat::CanBeFilteredUsingCutLowerBound</a></div><div class="ttdeci">bool CanBeFilteredUsingCutLowerBound(const LinearConstraint &amp;preprocessed_constraint, const absl::StrongVector&lt; IntegerVariable, double &gt; &amp;lp_values, const IntegerTrail &amp;integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l00306">cuts.cc:306</a></div></div>
<div class="ttc" id="anamespaceoperations__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="anamespaceoperations__research_1_1sat_html_a5d3aa6734674f8f81aac3895cde58d6d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5d3aa6734674f8f81aac3895cde58d6d">operations_research::sat::MakeAllCoefficientsPositive</a></div><div class="ttdeci">void MakeAllCoefficientsPositive(LinearConstraint *constraint)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8cc_source.html#l00247">linear_constraint.cc:247</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a6314c72e08e179c06ce3b76747499b8c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a6314c72e08e179c06ce3b76747499b8c">operations_research::sat::CleanTermsAndFillConstraint</a></div><div class="ttdeci">void CleanTermsAndFillConstraint(std::vector&lt; std::pair&lt; IntegerVariable, IntegerValue &gt; &gt; *terms, ClassWithVarsAndCoeffs *output)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00277">sat/linear_constraint.h:277</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a7f1ac774d4646a83631f8117f4ea03f5"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">operations_research::sat::PositiveVariable</a></div><div class="ttdeci">IntegerVariable PositiveVariable(IntegerVariable i)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00149">integer.h:149</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a7fea62548e11ae728e506874f767bdd3"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7fea62548e11ae728e506874f767bdd3">operations_research::sat::CreateLinMaxCutGenerator</a></div><div class="ttdeci">CutGenerator CreateLinMaxCutGenerator(const IntegerVariable target, const std::vector&lt; LinearExpression &gt; &amp;exprs, const std::vector&lt; IntegerVariable &gt; &amp;z_vars, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l01985">cuts.cc:1985</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a83f714c395df7a814ed067125f567a0d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a83f714c395df7a814ed067125f567a0d">operations_research::sat::PositiveRemainder</a></div><div class="ttdeci">IntegerValue PositiveRemainder(IntegerValue dividend, IntegerValue positive_divisor)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00113">integer.h:113</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a86a16fa3180f4ebc8ac36c16a2b49fac"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a86a16fa3180f4ebc8ac36c16a2b49fac">operations_research::sat::CreatePositiveMultiplicationCutGenerator</a></div><div class="ttdeci">CutGenerator CreatePositiveMultiplicationCutGenerator(AffineExpression z, AffineExpression x, AffineExpression y, int linearization_level, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l01358">cuts.cc:1358</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a88fabb0f851ff07d459b8be401162601"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a88fabb0f851ff07d459b8be401162601">operations_research::sat::BuildMaxAffineUpConstraint</a></div><div class="ttdeci">LinearConstraint BuildMaxAffineUpConstraint(const LinearExpression &amp;target, IntegerVariable var, const std::vector&lt; std::pair&lt; IntegerValue, IntegerValue &gt; &gt; &amp;affines, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l02069">cuts.cc:2069</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a8c8db245a613f2fb46d917cd78100f83"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8c8db245a613f2fb46d917cd78100f83">operations_research::sat::CanBeFilteredUsingKnapsackUpperBound</a></div><div class="ttdeci">bool CanBeFilteredUsingKnapsackUpperBound(const LinearConstraint &amp;constraint, const absl::StrongVector&lt; IntegerVariable, double &gt; &amp;lp_values, const IntegerTrail &amp;integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l00352">cuts.cc:352</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a8e30df8580d6914abba28f43b6e4e667"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8e30df8580d6914abba28f43b6e4e667">operations_research::sat::GetSuperAdditiveRoundingFunction</a></div><div class="ttdeci">std::function&lt; IntegerValue(IntegerValue)&gt; GetSuperAdditiveRoundingFunction(IntegerValue rhs_remainder, IntegerValue divisor, IntegerValue t, IntegerValue max_scaling)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l00643">cuts.cc:643</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a91e92ebb8d6c8bd62ae597625f443427"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a91e92ebb8d6c8bd62ae597625f443427">operations_research::sat::CreateSquareCutGenerator</a></div><div class="ttdeci">CutGenerator CreateSquareCutGenerator(AffineExpression y, AffineExpression x, int linearization_level, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l01452">cuts.cc:1452</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aa2ba15be9aeabce0142c726fbf880798"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa2ba15be9aeabce0142c726fbf880798">operations_research::sat::MakeAllVariablesPositive</a></div><div class="ttdeci">void MakeAllVariablesPositive(LinearConstraint *constraint)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8cc_source.html#l00258">linear_constraint.cc:258</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aae43e784db06c0974ce59ebbe8dd2b22"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">operations_research::sat::NegationOf</a></div><div class="ttdeci">std::vector&lt; IntegerVariable &gt; NegationOf(const std::vector&lt; IntegerVariable &gt; &amp;vars)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00047">integer.cc:47</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ab3ba1ab2a4a6cdc0ea4324d409ddbe7e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab3ba1ab2a4a6cdc0ea4324d409ddbe7e">operations_research::sat::GreaterOrEqual</a></div><div class="ttdeci">std::function&lt; void(Model *)&gt; GreaterOrEqual(IntegerVariable v, int64_t lb)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01691">integer.h:1691</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ab782d6f91aefca5ee81c3b622e862875"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab782d6f91aefca5ee81c3b622e862875">operations_research::sat::CreateMaxAffineCutGenerator</a></div><div class="ttdeci">CutGenerator CreateMaxAffineCutGenerator(LinearExpression target, IntegerVariable var, std::vector&lt; std::pair&lt; IntegerValue, IntegerValue &gt; &gt; affines, const std::string cut_name, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l02105">cuts.cc:2105</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ab7b2c273b19bf885462dfa04611e4e62"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab7b2c273b19bf885462dfa04611e4e62">operations_research::sat::GetCoefficientOfPositiveVar</a></div><div class="ttdeci">IntegerValue GetCoefficientOfPositiveVar(const IntegerVariable var, const LinearExpression &amp;expr)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8cc_source.html#l00446">linear_constraint.cc:446</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ac158f737c8653b1fc1bd294ea2d3412d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ac158f737c8653b1fc1bd294ea2d3412d">operations_research::sat::CreateKnapsackCoverCutGenerator</a></div><div class="ttdeci">CutGenerator CreateKnapsackCoverCutGenerator(const std::vector&lt; LinearConstraint &gt; &amp;base_constraints, const std::vector&lt; IntegerVariable &gt; &amp;vars, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l00454">cuts.cc:454</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ac8b530afe36cf1521c919ca43429926d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ac8b530afe36cf1521c919ca43429926d">operations_research::sat::ConstraintIsTriviallyTrue</a></div><div class="ttdeci">bool ConstraintIsTriviallyTrue(const LinearConstraint &amp;constraint, const IntegerTrail &amp;integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l00290">cuts.cc:290</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_accb737ae1fad15d6798a4b8bc27cea51"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#accb737ae1fad15d6798a4b8bc27cea51">operations_research::sat::LiftKnapsackCut</a></div><div class="ttdeci">bool LiftKnapsackCut(const LinearConstraint &amp;constraint, const absl::StrongVector&lt; IntegerVariable, double &gt; &amp;lp_values, const std::vector&lt; IntegerValue &gt; &amp;cut_vars_original_coefficients, const IntegerTrail &amp;integer_trail, TimeLimit *time_limit, LinearConstraint *cut)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l00187">cuts.cc:187</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_adf176ac81e34e8fd124d823ee0033f1a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#adf176ac81e34e8fd124d823ee0033f1a">operations_research::sat::CreateCliqueCutGenerator</a></div><div class="ttdeci">CutGenerator CreateCliqueCutGenerator(const std::vector&lt; IntegerVariable &gt; &amp;base_variables, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l02127">cuts.cc:2127</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ae3c495e2e05950c578b01976701f9b2a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae3c495e2e05950c578b01976701f9b2a">operations_research::sat::DivideByGCD</a></div><div class="ttdeci">void DivideByGCD(LinearConstraint *constraint)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8cc_source.html#l00220">linear_constraint.cc:220</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aea18a909121c1c2ba4a818298611f0b2"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aea18a909121c1c2ba4a818298611f0b2">operations_research::sat::ComputeActivity</a></div><div class="ttdeci">double ComputeActivity(const LinearConstraint &amp;constraint, const absl::StrongVector&lt; IntegerVariable, double &gt; &amp;values)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8cc_source.html#l00153">linear_constraint.cc:153</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aed77a1a7675c2f8568529a5a16247ec1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">operations_research::sat::ToDouble</a></div><div class="ttdeci">double ToDouble(IntegerValue value)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00077">integer.h:77</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="anamespaceoperations__research_html_a111f44b9b9cf67a8e8d83794ac9f5291"><div class="ttname"><a href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">operations_research::CapAdd</a></div><div class="ttdeci">int64_t CapAdd(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00126">saturated_arithmetic.h:126</a></div></div>
<div class="ttc" id="anamespaceoperations__research_html_a1e2ec837105d112356116f6308b73fca"><div class="ttname"><a href="namespaceoperations__research.html#a1e2ec837105d112356116f6308b73fca">operations_research::FloorRatio</a></div><div class="ttdeci">int64_t FloorRatio(int64_t value, int64_t positive_coeff)</div><div class="ttdef"><b>Definition:</b> <a href="sorted__interval__list_8cc_source.html#l00100">sorted_interval_list.cc:100</a></div></div>
<div class="ttc" id="anamespaceoperations__research_html_a4a43d435871f16c321861fa5de32df82"><div class="ttname"><a href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">operations_research::CapSub</a></div><div class="ttdeci">int64_t CapSub(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00158">saturated_arithmetic.h:158</a></div></div>
<div class="ttc" id="anamespaceoperations__research_html_aa64bf49d041052c7cb3f40f7496d7534"><div class="ttname"><a href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">operations_research::CapProd</a></div><div class="ttdeci">int64_t CapProd(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00235">saturated_arithmetic.h:235</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="arevised__simplex_8cc_html_af01c50e388647c921aa7d9c77f2b72b2"><div class="ttname"><a href="revised__simplex_8cc.html#af01c50e388647c921aa7d9c77f2b72b2">ratio</a></div><div class="ttdeci">Fractional ratio</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l01981">revised_simplex.cc:1981</a></div></div>
<div class="ttc" id="arouting__filters_8cc_html_a8e4ee19dee0e00541dbe9bbc83d806ba"><div class="ttname"><a href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a></div><div class="ttdeci">int64_t coefficient</div><div class="ttdef"><b>Definition:</b> <a href="routing__filters_8cc_source.html#l00969">routing_filters.cc:969</a></div></div>
<div class="ttc" id="arouting__flow_8cc_html_a2acb49f4df5288066c43610bede123ec"><div class="ttname"><a href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a></div><div class="ttdeci">int64_t capacity</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00151">routing_flow.cc:151</a></div></div>
<div class="ttc" id="asat_2linear__constraint_8h_html"><div class="ttname"><a href="sat_2linear__constraint_8h.html">linear_constraint.h</a></div></div>
<div class="ttc" id="asat_2lp__utils_8cc_html_a561d7bf12fc7674b3fe0ad2ba2e175a0"><div class="ttname"><a href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a></div><div class="ttdeci">std::vector&lt; double &gt; lower_bounds</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l00606">sat/lp_utils.cc:606</a></div></div>
<div class="ttc" id="asat_2lp__utils_8cc_html_a88215c8581662c40eec0fb8621c44af3"><div class="ttname"><a href="sat_2lp__utils_8cc.html#a88215c8581662c40eec0fb8621c44af3">upper_bounds</a></div><div class="ttdeci">std::vector&lt; double &gt; upper_bounds</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l00607">sat/lp_utils.cc:607</a></div></div>
<div class="ttc" id="asat_2model_8h_html"><div class="ttname"><a href="sat_2model_8h.html">model.h</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="asaturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.h</a></div></div>
<div class="ttc" id="asharded__optimization__utils_8cc_html_a2a897122b37c5a906205687aecdb627b"><div class="ttname"><a href="sharded__optimization__utils_8cc.html#a2a897122b37c5a906205687aecdb627b">l2_norm</a></div><div class="ttdeci">double l2_norm</div><div class="ttdef"><b>Definition:</b> <a href="sharded__optimization__utils_8cc_source.html#l00102">sharded_optimization_utils.cc:102</a></div></div>
<div class="ttc" id="asorted__interval__list_8h_html"><div class="ttname"><a href="sorted__interval__list_8h.html">sorted_interval_list.h</a></div></div>
<div class="ttc" id="astl__util_8h_html"><div class="ttname"><a href="stl__util_8h.html">stl_util.h</a></div></div>
<div class="ttc" id="astrong__integers_8h_html"><div class="ttname"><a href="strong__integers_8h.html">strong_integers.h</a></div></div>
<div class="ttc" id="astrong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_affine_expression_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html">operations_research::sat::AffineExpression</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00233">integer.h:233</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_affine_expression_html_a06a78ca452e0ab05313a836b024352f2"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#a06a78ca452e0ab05313a836b024352f2">operations_research::sat::AffineExpression::constant</a></div><div class="ttdeci">IntegerValue constant</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00300">integer.h:300</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_affine_expression_html_aa9c149604bc3f558e14c6d233ebc4b19"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">operations_research::sat::AffineExpression::LpValue</a></div><div class="ttdeci">double LpValue(const absl::StrongVector&lt; IntegerVariable, double &gt; &amp;lp_values) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00278">integer.h:278</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_affine_expression_html_ab6516f556b715738034b30d290c40214"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">operations_research::sat::AffineExpression::var</a></div><div class="ttdeci">IntegerVariable var</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00298">integer.h:298</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_cut_generator_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_cut_generator.html">operations_research::sat::CutGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00047">cuts.h:47</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_cut_generator_html_a73e4094f2d4e2adbe5e8d79a5b61fcd1"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">operations_research::sat::CutGenerator::vars</a></div><div class="ttdeci">std::vector&lt; IntegerVariable &gt; vars</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00048">cuts.h:48</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_cut_generator_html_a79779673f2fe909d104c37f3b7cc5a48"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">operations_research::sat::CutGenerator::generate_cuts</a></div><div class="ttdeci">std::function&lt; bool(const absl::StrongVector&lt; IntegerVariable, double &gt; &amp;lp_values, LinearConstraintManager *manager)&gt; generate_cuts</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00052">cuts.h:52</a></div></div>
<div class="ttc" id="astructoperations__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#l00044">implied_bounds.h:44</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html">operations_research::sat::ImpliedBoundsProcessor::BestImpliedBoundInfo</a></div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00122">cuts.h:122</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info_html_a2c25b894240115eebb2e75e2d8491a79"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a2c25b894240115eebb2e75e2d8491a79">operations_research::sat::ImpliedBoundsProcessor::BestImpliedBoundInfo::bound_diff</a></div><div class="ttdeci">IntegerValue bound_diff</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00126">cuts.h:126</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info_html_a6d2822d5e07c3716efcdf73a4ae5eafc"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a6d2822d5e07c3716efcdf73a4ae5eafc">operations_research::sat::ImpliedBoundsProcessor::BestImpliedBoundInfo::is_positive</a></div><div class="ttdeci">bool is_positive</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00125">cuts.h:125</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info_html_a871eaa421116e3c7cd440b6299d0b74d"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#a871eaa421116e3c7cd440b6299d0b74d">operations_research::sat::ImpliedBoundsProcessor::BestImpliedBoundInfo::bool_var</a></div><div class="ttdeci">IntegerVariable bool_var</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00127">cuts.h:127</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info_html_ac11e010c276514d6402c772d0651f82f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_best_implied_bound_info.html#ac11e010c276514d6402c772d0651f82f">operations_research::sat::ImpliedBoundsProcessor::BestImpliedBoundInfo::slack_lp_value</a></div><div class="ttdeci">double slack_lp_value</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00124">cuts.h:124</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info.html">operations_research::sat::ImpliedBoundsProcessor::SlackInfo</a></div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00092">cuts.h:92</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info_html_a0ee34e5c6fbf075def1a6c2f0c42d040"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info.html#a0ee34e5c6fbf075def1a6c2f0c42d040">operations_research::sat::ImpliedBoundsProcessor::SlackInfo::lb</a></div><div class="ttdeci">IntegerValue lb</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00098">cuts.h:98</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info_html_a250583d63e8184c6f9f4deba1125e6bb"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info.html#a250583d63e8184c6f9f4deba1125e6bb">operations_research::sat::ImpliedBoundsProcessor::SlackInfo::terms</a></div><div class="ttdeci">std::vector&lt; std::pair&lt; IntegerVariable, IntegerValue &gt; &gt; terms</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00094">cuts.h:94</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info_html_a6e2915dc7e5345d6959390b53f026c5f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info.html#a6e2915dc7e5345d6959390b53f026c5f">operations_research::sat::ImpliedBoundsProcessor::SlackInfo::ub</a></div><div class="ttdeci">IntegerValue ub</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00099">cuts.h:99</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info_html_acd07f8397a2e61932c8ee17a4e300e23"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info.html#acd07f8397a2e61932c8ee17a4e300e23">operations_research::sat::ImpliedBoundsProcessor::SlackInfo::offset</a></div><div class="ttdeci">IntegerValue offset</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00095">cuts.h:95</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info_html_adb47ac0cff7c9dc4dc5f101d38a91185"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_implied_bounds_processor_1_1_slack_info.html#adb47ac0cff7c9dc4dc5f101d38a91185">operations_research::sat::ImpliedBoundsProcessor::SlackInfo::lp_value</a></div><div class="ttdeci">double lp_value</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00100">cuts.h:100</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_knapsack_item_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_knapsack_item.html">operations_research::sat::KnapsackItem</a></div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00313">cuts.h:313</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_knapsack_item_html_a3ff84545f00a56ba7584b2a7f2cef69c"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_knapsack_item.html#a3ff84545f00a56ba7584b2a7f2cef69c">operations_research::sat::KnapsackItem::profit</a></div><div class="ttdeci">double profit</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00314">cuts.h:314</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_knapsack_item_html_a99108733d00274978a4979dc072bd513"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_knapsack_item.html#a99108733d00274978a4979dc072bd513">operations_research::sat::KnapsackItem::weight</a></div><div class="ttdeci">double weight</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00315">cuts.h:315</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_linear_constraint_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html">operations_research::sat::LinearConstraint</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00041">sat/linear_constraint.h:41</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_linear_constraint_html_a0ee34e5c6fbf075def1a6c2f0c42d040"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">operations_research::sat::LinearConstraint::lb</a></div><div class="ttdeci">IntegerValue lb</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00042">sat/linear_constraint.h:42</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_linear_constraint_html_a4053d5aed2a34995e0aeb2042878ca7a"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">operations_research::sat::LinearConstraint::coeffs</a></div><div class="ttdeci">std::vector&lt; IntegerValue &gt; coeffs</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00045">sat/linear_constraint.h:45</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_linear_constraint_html_a6e2915dc7e5345d6959390b53f026c5f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">operations_research::sat::LinearConstraint::ub</a></div><div class="ttdeci">IntegerValue ub</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00043">sat/linear_constraint.h:43</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_linear_constraint_html_a73e4094f2d4e2adbe5e8d79a5b61fcd1"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">operations_research::sat::LinearConstraint::vars</a></div><div class="ttdeci">std::vector&lt; IntegerVariable &gt; vars</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00044">sat/linear_constraint.h:44</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_linear_constraint_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#a764be64f3029f8b8e23511061d8de355">operations_research::sat::LinearConstraint::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00065">sat/linear_constraint.h:65</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_linear_constraint_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::sat::LinearConstraint::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00055">sat/linear_constraint.h:55</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_linear_constraint_html_ad65ddc0d04d71006a9ebe3b9dcfe2ce6"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">operations_research::sat::LinearConstraint::AddTerm</a></div><div class="ttdeci">void AddTerm(IntegerVariable var, IntegerValue coeff)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00050">sat/linear_constraint.h:50</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_linear_expression_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_expression.html">operations_research::sat::LinearExpression</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00096">sat/linear_constraint.h:96</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_linear_expression_html_a73e4094f2d4e2adbe5e8d79a5b61fcd1"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_expression.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">operations_research::sat::LinearExpression::vars</a></div><div class="ttdeci">std::vector&lt; IntegerVariable &gt; vars</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00097">sat/linear_constraint.h:97</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_rounding_options_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rounding_options.html">operations_research::sat::RoundingOptions</a></div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00217">cuts.h:217</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_rounding_options_html_a01db407e90fac1c31c6705758a057908"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rounding_options.html#a01db407e90fac1c31c6705758a057908">operations_research::sat::RoundingOptions::max_scaling</a></div><div class="ttdeci">IntegerValue max_scaling</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00218">cuts.h:218</a></div></div>
<div class="ttc" id="atime__limit_8h_html"><div class="ttname"><a href="time__limit_8h.html">time_limit.h</a></div></div>
<div class="ttc" id="avariable__and__expressions_8cc_html_a2091cd7d80fdd31762020bce86138587"><div class="ttname"><a href="variable__and__expressions_8cc.html#a2091cd7d80fdd31762020bce86138587">coeff</a></div><div class="ttdeci">const double coeff</div><div class="ttdef"><b>Definition:</b> <a href="variable__and__expressions_8cc_source.html#l00105">variable_and_expressions.cc:105</a></div></div>
<div class="ttc" id="avariable__and__expressions_8cc_html_a98c17ae8d99a73259ea78de8c4b66254"><div class="ttname"><a href="variable__and__expressions_8cc.html#a98c17ae8d99a73259ea78de8c4b66254">constant</a></div><div class="ttdeci">const double constant</div><div class="ttdef"><b>Definition:</b> <a href="variable__and__expressions_8cc_source.html#l00140">variable_and_expressions.cc:140</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="cuts_8cc.html">cuts.cc</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.3 </li>
</ul>
</div>
</body>
</html>