241 lines
247 KiB
HTML
241 lines
247 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.15"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: integer_expr.h Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('integer__expr_8h_source.html','');});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">integer_expr.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="integer__expr_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2021 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#ifndef OR_TOOLS_SAT_INTEGER_EXPR_H_</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#define OR_TOOLS_SAT_INTEGER_EXPR_H_</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <cstdint></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <functional></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="int__type_8h.html">ortools/base/int_type.h</a>"</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="macros_8h.html">ortools/base/macros.h</a>"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="mathutil_8h.html">ortools/base/mathutil.h</a>"</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>"</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="sat_2linear__constraint_8h.html">ortools/sat/linear_constraint.h</a>"</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="sat_2model_8h.html">ortools/sat/model.h</a>"</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="precedences_8h.html">ortools/sat/precedences.h</a>"</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="sat__base_8h.html">ortools/sat/sat_base.h</a>"</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="sat__solver_8h.html">ortools/sat/sat_solver.h</a>"</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include "<a class="code" href="rev_8h.html">ortools/util/rev.h</a>"</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> </div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="keyword">namespace </span>sat {</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> </div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// A really basic implementation of an upper-bounded sum of integer variables.</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// The complexity is in O(num_variables) at each propagation.</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">//</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// Note that we assume that there can be NO integer overflow. This must be</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// checked at model validation time before this is even created.</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment">//</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// TODO(user): If one has many such constraint, it will be more efficient to</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// propagate all of them at once rather than doing it one at the time.</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">//</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// TODO(user): Explore tree structure to get a log(n) complexity.</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment">//</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// TODO(user): When the variables are Boolean, use directly the pseudo-Boolean</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// constraint implementation. But we do need support for enforcement literals</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// there.</span></div><div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html"> 51</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html">IntegerSumLE</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_propagator_interface.html">PropagatorInterface</a> {</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="comment">// If refied_literal is kNoLiteralIndex then this is a normal constraint,</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="comment">// otherwise we enforce the implication refied_literal => constraint is true.</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">// Note that we don't do the reverse implication here, it is usually done by</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="comment">// another IntegerSumLE constraint on the negated variables.</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#aec1aae1092c281971431aac37d923b60">IntegerSumLE</a>(<span class="keyword">const</span> std::vector<Literal>& enforcement_literals,</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& vars,</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keyword">const</span> std::vector<IntegerValue>& coeffs,</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  IntegerValue <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">// We propagate:</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="comment">// - If the sum of the individual lower-bound is > upper_bound, we fail.</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">// - For all i, upper-bound of i</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// <= upper_bound - Sum {individual lower-bound excluding i).</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>() <span class="keyword">final</span>;</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher);</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="comment">// Same as Propagate() but only consider current root level bounds. This is</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="comment">// mainly useful for the LP propagator since it can find relevant optimal</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">// really late in the search tree.</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#a79ee9e362d647b6d65cf6d38e3df216d">PropagateAtLevelZero</a>();</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> </div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// This is a pretty usage specific function. Returns the implied lower bound</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">// on target_var if the given integer literal is false (resp. true). If the</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// variables do not appear both in the linear inequality, this returns two</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// kMinIntegerValue.</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  std::pair<IntegerValue, IntegerValue> <a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#a83404baa3e4ce3beaefa9a662f627655">ConditionalLb</a>(</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> integer_literal, IntegerVariable target_var) <span class="keyword">const</span>;</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">// Fills integer_reason_ with all the current lower_bounds. The real</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// explanation may require removing one of them, but as an optimization, we</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// always keep all the IntegerLiteral in integer_reason_, and swap them as</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">// needed just before pushing something.</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordtype">void</span> FillIntegerReason();</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> </div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">const</span> std::vector<Literal> enforcement_literals_;</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keyword">const</span> IntegerValue upper_bound_;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> </div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail_;</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail_;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* time_limit_;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <a class="code" href="classoperations__research_1_1sat_1_1_rev_integer_value_repository.html">RevIntegerValueRepository</a>* rev_integer_value_repository_;</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> </div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="comment">// Reversible sum of the lower bound of the fixed variables.</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordtype">bool</span> is_registered_ = <span class="keyword">false</span>;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  IntegerValue rev_lb_fixed_vars_;</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// Reversible number of fixed variables.</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordtype">int</span> rev_num_fixed_vars_;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> </div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// Those vectors are shuffled during search to ensure that the variables</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// (resp. coefficients) contained in the range [0, rev_num_fixed_vars_) of</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// vars_ (resp. coeffs_) are fixed (resp. belong to fixed variables).</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  std::vector<IntegerVariable> vars_;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  std::vector<IntegerValue> coeffs_;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  std::vector<IntegerValue> max_variations_;</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> </div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  std::vector<Literal> literal_reason_;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">// Parallel vectors.</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  std::vector<IntegerLiteral> integer_reason_;</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  std::vector<IntegerValue> reason_coeffs_;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> </div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html">IntegerSumLE</a>);</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> };</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> </div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment">// This assumes target = SUM_i coeffs[i] * vars[i], and detects that the target</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment">// must be of the form (a*X + b).</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment">//</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment">// This propagator is quite specific and runs only at level zero. For now, this</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment">// is mainly used for the objective variable. As we fix terms with high</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment">// objective coefficient, it is possible the only terms left have a common</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment">// divisor. This close app2-2.mps in less than a second instead of running</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// forever to prove the optimal (in single thread).</span></div><div class="line"><a name="l00127"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_level_zero_equality.html"> 127</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_level_zero_equality.html">LevelZeroEquality</a> : <a class="code" href="classoperations__research_1_1sat_1_1_propagator_interface.html">PropagatorInterface</a> {</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <a class="code" href="classoperations__research_1_1sat_1_1_level_zero_equality.html#ab7be565ae45c1e7171a1975d0055c422">LevelZeroEquality</a>(IntegerVariable target,</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& vars,</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">const</span> std::vector<IntegerValue>& coeffs, <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> </div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_level_zero_equality.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>() <span class="keyword">final</span>;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> </div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keyword">const</span> IntegerVariable target_;</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">const</span> std::vector<IntegerVariable> vars_;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keyword">const</span> std::vector<IntegerValue> coeffs_;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> </div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  IntegerValue gcd_ = IntegerValue(1);</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> </div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail_;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail_;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> };</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> </div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment">// A min (resp max) constraint of the form min == MIN(vars) can be decomposed</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment">// into two inequalities:</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment">// 1/ min <= MIN(vars), which is the same as for all v in vars, "min <= v".</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// This can be taken care of by the LowerOrEqual(min, v) constraint.</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// 2/ min >= MIN(vars).</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment">//</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment">// And in turn, 2/ can be decomposed in:</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// a) lb(min) >= lb(MIN(vars)) = MIN(lb(var));</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment">// b) ub(min) >= ub(MIN(vars)) and we can't propagate anything here unless</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment">// there is just one possible variable 'v' that can be the min:</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment">// for all u != v, lb(u) > ub(min);</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// In this case, ub(min) >= ub(v).</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment">//</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment">// This constraint take care of a) and b). That is:</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment">// - If the min of the lower bound of the vars increase, then the lower bound of</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment">// the min_var will be >= to it.</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment">// - If there is only one candidate for the min, then if the ub(min) decrease,</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment">// the ub of the only candidate will be <= to it.</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment">//</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment">// Complexity: This is a basic implementation in O(num_vars) on each call to</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="comment">// Propagate(), which will happen each time one or more variables in vars_</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="comment">// changed.</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="comment">//</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="comment">// TODO(user): Implement a more efficient algorithm when the need arise.</span></div><div class="line"><a name="l00170"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_min_propagator.html"> 170</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_min_propagator.html">MinPropagator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_propagator_interface.html">PropagatorInterface</a> {</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <a class="code" href="classoperations__research_1_1sat_1_1_min_propagator.html#a7adb3d82f96ba9699d1e1e1b399134ec">MinPropagator</a>(<span class="keyword">const</span> std::vector<IntegerVariable>& vars,</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  IntegerVariable min_var, <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail);</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> </div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_min_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>() <span class="keyword">final</span>;</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_min_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher);</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> </div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keyword">const</span> std::vector<IntegerVariable> vars_;</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keyword">const</span> IntegerVariable min_var_;</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail_;</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> </div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  std::vector<IntegerLiteral> integer_reason_;</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> </div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1sat_1_1_min_propagator.html">MinPropagator</a>);</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> };</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> </div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment">// Same as MinPropagator except this works on min = MIN(exprs) where exprs are</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="comment">// linear expressions. It uses IntegerSumLE to propagate bounds on the exprs.</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="comment">// Assumes Canonical expressions (all positive coefficients).</span></div><div class="line"><a name="l00191"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_lin_min_propagator.html"> 191</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_lin_min_propagator.html">LinMinPropagator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_propagator_interface.html">PropagatorInterface</a> {</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <a class="code" href="classoperations__research_1_1sat_1_1_lin_min_propagator.html#a3b562468ef8cc634a83e3ac7240a43da">LinMinPropagator</a>(<span class="keyword">const</span> std::vector<LinearExpression>& exprs,</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  IntegerVariable min_var, <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <a class="code" href="classoperations__research_1_1sat_1_1_lin_min_propagator.html#a3b562468ef8cc634a83e3ac7240a43da">LinMinPropagator</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_lin_min_propagator.html">LinMinPropagator</a>&) = <span class="keyword">delete</span>;</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <a class="code" href="classoperations__research_1_1sat_1_1_lin_min_propagator.html">LinMinPropagator</a>& <a class="code" href="classoperations__research_1_1sat_1_1_lin_min_propagator.html#a03071a5ba6c96c598a7005f7e2b29411">operator=</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_lin_min_propagator.html">LinMinPropagator</a>&) = <span class="keyword">delete</span>;</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_lin_min_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>() <span class="keyword">final</span>;</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_lin_min_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher);</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> </div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">// Lighter version of IntegerSumLE. This uses the current value of</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">// integer_reason_ in addition to the reason for propagating the linear</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="comment">// constraint. The coeffs are assumed to be positive here.</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordtype">bool</span> PropagateLinearUpperBound(<span class="keyword">const</span> std::vector<IntegerVariable>& vars,</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keyword">const</span> std::vector<IntegerValue>& coeffs,</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  IntegerValue <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> </div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keyword">const</span> std::vector<LinearExpression> exprs_;</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keyword">const</span> IntegerVariable min_var_;</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  std::vector<IntegerValue> expr_lbs_;</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* model_;</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail_;</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  std::vector<IntegerLiteral> integer_reason_for_unique_candidate_;</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordtype">int</span> rev_unique_candidate_ = 0;</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> };</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> </div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="comment">// Propagates a * b = p.</span></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="comment">//</span></div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="comment">// The bounds [min, max] of a and b will be propagated perfectly, but not</span></div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> <span class="comment">// the bounds on p as this require more complex arithmetics.</span></div><div class="line"><a name="l00222"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_product_propagator.html"> 222</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_product_propagator.html">ProductPropagator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_propagator_interface.html">PropagatorInterface</a> {</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <a class="code" href="classoperations__research_1_1sat_1_1_product_propagator.html#ac88ae9a72b79c5308eebc84c67eb02b2">ProductPropagator</a>(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> p,</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail);</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> </div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_product_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>() <span class="keyword">final</span>;</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_product_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher);</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> </div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="comment">// Maybe replace a_, b_ or c_ by their negation to simplify the cases.</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordtype">bool</span> CanonicalizeCases();</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> </div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="comment">// Special case when all are >= 0.</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="comment">// We use faster code and better reasons than the generic code.</span></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordtype">bool</span> PropagateWhenAllNonNegative();</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> </div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="comment">// Internal helper, see code for more details.</span></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordtype">bool</span> PropagateMaxOnPositiveProduct(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>,</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  IntegerValue min_p, IntegerValue max_p);</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span> </div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="comment">// Note that we might negate any two terms in CanonicalizeCases() during</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="comment">// each propagation. This is fine.</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> a_;</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> b_;</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> p_;</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> </div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail_;</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> </div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1sat_1_1_product_propagator.html">ProductPropagator</a>);</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span> };</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span> </div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="comment">// Propagates num / denom = div. Basic version, we don't extract any special</span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="comment">// cases, and we only propagates the bounds. It expects denom to be > 0.</span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment">//</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="comment">// TODO(user): Deal with overflow.</span></div><div class="line"><a name="l00257"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_division_propagator.html"> 257</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_division_propagator.html">DivisionPropagator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_propagator_interface.html">PropagatorInterface</a> {</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <a class="code" href="classoperations__research_1_1sat_1_1_division_propagator.html#a246b8936f3e0d5275497100133021fb9">DivisionPropagator</a>(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> num, <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> denom,</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> div, <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail);</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> </div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_division_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>() <span class="keyword">final</span>;</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_division_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher);</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> </div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="comment">// Propagates the fact that the signs of each domain, if fixed, are</span></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="comment">// compatible.</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordtype">bool</span> PropagateSigns();</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> </div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="comment">// If both num and div >= 0, we can propagate their upper bounds.</span></div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordtype">bool</span> PropagateUpperBounds(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> num, <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> denom,</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> div);</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> </div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="comment">// When the sign of all 3 expressions are fixed, we can do morel propagation.</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">//</span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// By using negated expressions, we can make sure the domains of num, denom,</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">// and div are positive.</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordtype">bool</span> PropagatePositiveDomains(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> num, <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> denom,</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> div);</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span> </div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> num_;</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> denom_;</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> div_;</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> negated_num_;</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> negated_div_;</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail_;</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> </div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1sat_1_1_division_propagator.html">DivisionPropagator</a>);</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span> };</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span> </div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> <span class="comment">// Propagates var_a / cst_b = var_c. Basic version, we don't extract any special</span></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> <span class="comment">// cases, and we only propagates the bounds. cst_b must be > 0.</span></div><div class="line"><a name="l00293"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html"> 293</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html">FixedDivisionPropagator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_propagator_interface.html">PropagatorInterface</a> {</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <a class="code" href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html#ab3ec103368339f9db05ce8325e246406">FixedDivisionPropagator</a>(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, IntegerValue <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>,</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> c, <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail);</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> </div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>() <span class="keyword">final</span>;</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher);</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span> </div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> a_;</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keyword">const</span> IntegerValue b_;</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> c_;</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span> </div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail_;</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> </div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html">FixedDivisionPropagator</a>);</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> };</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> </div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> <span class="comment">// Propagates target == expr % mod. Basic version, we don't extract any special</span></div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="comment">// cases, and we only propagates the bounds. mod must be > 0.</span></div><div class="line"><a name="l00313"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html"> 313</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html">FixedModuloPropagator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_propagator_interface.html">PropagatorInterface</a> {</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <a class="code" href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html#ae5d1328b48b697601cfa55b49d56c5cc">FixedModuloPropagator</a>(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> expr, IntegerValue mod,</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> target, <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail);</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> </div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>() <span class="keyword">final</span>;</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher);</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> </div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordtype">bool</span> PropagateSignsAndTargetRange();</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordtype">bool</span> PropagateBoundsWhenExprIsPositive(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> expr,</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> target);</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keywordtype">bool</span> PropagateOuterBounds();</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> </div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> expr_;</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keyword">const</span> IntegerValue mod_;</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> target_;</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> negated_expr_;</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> negated_target_;</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail_;</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> </div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html">FixedModuloPropagator</a>);</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> };</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span> </div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> <span class="comment">// Propagates x * x = s.</span></div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> <span class="comment">// TODO(user): Only works for x nonnegative.</span></div><div class="line"><a name="l00339"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_square_propagator.html"> 339</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_square_propagator.html">SquarePropagator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_propagator_interface.html">PropagatorInterface</a> {</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <a class="code" href="classoperations__research_1_1sat_1_1_square_propagator.html#a86723da0f387e68b890ab489f88318af">SquarePropagator</a>(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> x, <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> s,</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail);</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span> </div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_square_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>() <span class="keyword">final</span>;</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_square_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher);</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span> </div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> x_;</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> s_;</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail_;</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> </div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1sat_1_1_square_propagator.html">SquarePropagator</a>);</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span> };</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span> </div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> <span class="comment">// =============================================================================</span></div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span> <span class="comment">// Model based functions.</span></div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> <span class="comment">// =============================================================================</span></div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> </div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span> <span class="comment">// Weighted sum <= constant.</span></div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> <span class="keyword">template</span> <<span class="keyword">typename</span> VectorInt></div><div class="line"><a name="l00361"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a94d028de71e81b94a1e49ed6a22e1881"> 361</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a94d028de71e81b94a1e49ed6a22e1881">WeightedSumLowerOrEqual</a>(</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& vars, <span class="keyword">const</span> VectorInt& <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>,</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  int64_t <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="comment">// Special cases.</span></div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(vars.size(), 1);</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keywordflow">if</span> (vars.size() == 1) {</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keyword">const</span> int64_t c = <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[0];</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(c, 0);</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">if</span> (c > 0) {</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a9b1f29e2e2079dc31e89749c9a33bc01">LowerOrEqual</a>(</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  vars[0],</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(IntegerValue(<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>), IntegerValue(c)).<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>());</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a0dedef72c691d332e0e1cc092bc01bc8">GreaterOrEqual</a>(</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  vars[0],</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(IntegerValue(-<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>), IntegerValue(-c)).<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>());</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  }</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  }</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keywordflow">if</span> (vars.size() == 2 && (<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[0] == 1 || <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[0] == -1) &&</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  (<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[1] == 1 || <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[1] == -1)) {</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a689b1371728b50d48e083628d424e7e5">Sum2LowerOrEqual</a>(</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[0] == 1 ? vars[0] : <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(vars[0]),</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[1] == 1 ? vars[1] : <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(vars[1]), <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  }</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">if</span> (vars.size() == 3 && (<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[0] == 1 || <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[0] == -1) &&</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  (<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[1] == 1 || <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[1] == -1) &&</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  (<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[2] == 1 || <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[2] == -1)) {</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a92f4b0ea4d733b52487388fa3441fe7c">Sum3LowerOrEqual</a>(</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[0] == 1 ? vars[0] : <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(vars[0]),</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[1] == 1 ? vars[1] : <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(vars[1]),</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[2] == 1 ? vars[2] : <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(vars[2]), <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  }</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> </div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="comment">// We split large constraints into a square root number of parts.</span></div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="comment">// This is to avoid a bad complexity while propagating them since our</span></div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="comment">// algorithm is not in O(num_changes).</span></div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="comment">//</span></div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="comment">// TODO(user): Alternatively, we could use a O(num_changes) propagation (a</span></div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="comment">// bit tricky to implement), or a decomposition into a tree with more than</span></div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="comment">// one level. Both requires experimentations.</span></div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="comment">//</span></div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="comment">// TODO(user): If the initial constraint was an equalilty we will create</span></div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="comment">// the "intermediate" variable twice where we could have use the same for</span></div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="comment">// both direction. Improve?</span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = vars.size();</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">if</span> (num_vars > 100) {</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  std::vector<IntegerVariable> bucket_sum_vars;</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span> </div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  std::vector<IntegerVariable> local_vars;</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  std::vector<IntegerValue> local_coeffs;</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> </div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordtype">int</span> i = 0;</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_buckets = static_cast<int>(std::round(std::sqrt(num_vars)));</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> = 0; <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> < num_buckets; ++<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) {</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  local_vars.clear();</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  local_coeffs.clear();</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  int64_t bucket_lb = 0;</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  int64_t bucket_ub = 0;</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> limit = num_vars * (<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> + 1);</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keywordflow">for</span> (; i * num_buckets < limit; ++i) {</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  local_vars.push_back(vars[i]);</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  local_coeffs.push_back(IntegerValue(<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i]));</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keyword">const</span> int64_t term1 =</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get(<a class="code" href="namespaceoperations__research_1_1sat.html#ae13e4169ae1934ab2b1c58af67d9fce3">LowerBound</a>(vars[i])) * <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i];</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keyword">const</span> int64_t term2 =</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get(<a class="code" href="namespaceoperations__research_1_1sat.html#a0ee70f9d17fac333fb71c0ab6423f58c">UpperBound</a>(vars[i])) * <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i];</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  bucket_lb += <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(term1, term2);</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  bucket_ub += <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(term1, term2);</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  }</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> </div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keyword">const</span> IntegerVariable bucket_sum =</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a9d8cd5de7be4a42157145228a43d177e">NewIntegerVariable</a>(bucket_lb, bucket_ub));</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  bucket_sum_vars.push_back(bucket_sum);</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  local_vars.push_back(bucket_sum);</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  local_coeffs.push_back(IntegerValue(-1));</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html">IntegerSumLE</a>* constraint = <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html">IntegerSumLE</a>(</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  {}, local_vars, local_coeffs, IntegerValue(0), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  constraint-><a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>());</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(constraint);</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  }</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span> </div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="comment">// Create the root-level sum.</span></div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  local_vars.clear();</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  local_coeffs.clear();</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : bucket_sum_vars) {</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  local_vars.push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  local_coeffs.push_back(IntegerValue(1));</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  }</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html">IntegerSumLE</a>* constraint = <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html">IntegerSumLE</a>(</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  {}, local_vars, local_coeffs, IntegerValue(<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  constraint-><a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>());</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(constraint);</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  }</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span> </div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html">IntegerSumLE</a>* constraint = <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html">IntegerSumLE</a>(</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  {}, vars,</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  std::vector<IntegerValue>(<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>.begin(), <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>.end()),</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  IntegerValue(<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  constraint-><a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>());</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(constraint);</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  };</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span> }</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span> </div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span> <span class="comment">// Weighted sum >= constant.</span></div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> <span class="keyword">template</span> <<span class="keyword">typename</span> VectorInt></div><div class="line"><a name="l00468"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#af68f789cce73e17fbe614888479c3f0d"> 468</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#af68f789cce73e17fbe614888479c3f0d">WeightedSumGreaterOrEqual</a>(</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& vars, <span class="keyword">const</span> VectorInt& <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>,</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  int64_t <a class="code" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>) {</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="comment">// We just negate everything and use an <= constraints.</span></div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  std::vector<int64_t> negated_coeffs(<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>.begin(), <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>.end());</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keywordflow">for</span> (int64_t& ref : negated_coeffs) ref = -ref;</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a94d028de71e81b94a1e49ed6a22e1881">WeightedSumLowerOrEqual</a>(vars, negated_coeffs, -<a class="code" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>);</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span> }</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span> </div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span> <span class="comment">// Weighted sum == constant.</span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span> <span class="keyword">template</span> <<span class="keyword">typename</span> VectorInt></div><div class="line"><a name="l00479"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a9afb94a13748f5bd2e343e775f4a302c"> 479</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a9afb94a13748f5bd2e343e775f4a302c">FixedWeightedSum</a>(</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& vars, <span class="keyword">const</span> VectorInt& <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>,</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#af68f789cce73e17fbe614888479c3f0d">WeightedSumGreaterOrEqual</a>(vars, <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>));</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a94d028de71e81b94a1e49ed6a22e1881">WeightedSumLowerOrEqual</a>(vars, <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>));</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  };</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span> }</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span> </div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span> <span class="comment">// enforcement_literals => sum <= upper_bound</span></div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span> <span class="keyword">template</span> <<span class="keyword">typename</span> VectorInt></div><div class="line"><a name="l00490"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a22d7b811bf8e75458bbfebd39fe5b8d0"> 490</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a22d7b811bf8e75458bbfebd39fe5b8d0">ConditionalWeightedSumLowerOrEqual</a>(</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="keyword">const</span> std::vector<Literal>& enforcement_literals,</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& vars, <span class="keyword">const</span> VectorInt& <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>,</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  int64_t <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="comment">// Special cases.</span></div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(vars.size(), 1);</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordflow">if</span> (vars.size() == 1) {</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[0], 0);</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keywordflow">if</span> (<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[0] > 0) {</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a8a0620c105ec05f1b42bcde3a9380872">Implication</a>(</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  enforcement_literals,</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  vars[0], <a class="code" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(IntegerValue(<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>),</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  IntegerValue(<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[0]))));</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a8a0620c105ec05f1b42bcde3a9380872">Implication</a>(</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  enforcement_literals,</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  vars[0], <a class="code" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(IntegerValue(-<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>),</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  IntegerValue(-<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[0]))));</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  }</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  }</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span> </div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordflow">if</span> (vars.size() == 2 && (<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[0] == 1 || <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[0] == -1) &&</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  (<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[1] == 1 || <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[1] == -1)) {</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a4b74487600a1e03a74634208f05f1656">ConditionalSum2LowerOrEqual</a>(</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[0] == 1 ? vars[0] : <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(vars[0]),</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[1] == 1 ? vars[1] : <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(vars[1]), <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>,</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  enforcement_literals);</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  }</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">if</span> (vars.size() == 3 && (<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[0] == 1 || <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[0] == -1) &&</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  (<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[1] == 1 || <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[1] == -1) &&</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  (<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[2] == 1 || <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[2] == -1)) {</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#afbccccf013bc539ec659a066318b9ee9">ConditionalSum3LowerOrEqual</a>(</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[0] == 1 ? vars[0] : <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(vars[0]),</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[1] == 1 ? vars[1] : <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(vars[1]),</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[2] == 1 ? vars[2] : <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(vars[2]), <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>,</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  enforcement_literals);</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  }</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span> </div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="comment">// If value == min(expression), then we can avoid creating the sum.</span></div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  IntegerValue expression_min(0);</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keyword">auto</span>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < vars.size(); ++i) {</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  expression_min +=</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i] * (<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i] >= 0</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  ? integer_trail->LowerBound(vars[i])</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  : integer_trail->UpperBound(vars[i]));</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  }</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keywordflow">if</span> (expression_min == <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="comment">// Tricky: as we create integer literal, we might propagate stuff and</span></div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="comment">// the bounds might change, so if the expression_min increase with the</span></div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="comment">// bound we use, then the literal must be false.</span></div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  IntegerValue non_cached_min;</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < vars.size(); ++i) {</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordflow">if</span> (<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i] > 0) {</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keyword">const</span> IntegerValue lb = integer_trail->LowerBound(vars[i]);</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  non_cached_min += <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i] * lb;</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a8a0620c105ec05f1b42bcde3a9380872">Implication</a>(enforcement_literals,</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(vars[i], lb)));</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i] < 0) {</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keyword">const</span> IntegerValue ub = integer_trail->UpperBound(vars[i]);</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  non_cached_min += <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i] * ub;</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a8a0620c105ec05f1b42bcde3a9380872">Implication</a>(enforcement_literals,</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(vars[i], ub)));</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  }</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  }</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordflow">if</span> (non_cached_min > expression_min) {</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  std::vector<Literal> clause;</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l : enforcement_literals) {</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  clause.push_back(l.Negated());</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  }</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a1655a9b9673e7c4de940ca6e5e3cf936">ClauseConstraint</a>(clause));</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  }</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html">IntegerSumLE</a>* constraint = <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html">IntegerSumLE</a>(</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  enforcement_literals, vars,</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  std::vector<IntegerValue>(<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>.begin(), <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>.end()),</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  IntegerValue(<a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  constraint-><a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>());</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(constraint);</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  }</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  };</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span> }</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span> </div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span> <span class="comment">// enforcement_literals => sum >= lower_bound</span></div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span> <span class="keyword">template</span> <<span class="keyword">typename</span> VectorInt></div><div class="line"><a name="l00578"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a520c2f743c9adfde168689908851dfee"> 578</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a520c2f743c9adfde168689908851dfee">ConditionalWeightedSumGreaterOrEqual</a>(</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keyword">const</span> std::vector<Literal>& enforcement_literals,</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& vars, <span class="keyword">const</span> VectorInt& <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>,</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  int64_t <a class="code" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>) {</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="comment">// We just negate everything and use an <= constraint.</span></div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  std::vector<int64_t> negated_coeffs(<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>.begin(), <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>.end());</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordflow">for</span> (int64_t& ref : negated_coeffs) ref = -ref;</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a22d7b811bf8e75458bbfebd39fe5b8d0">ConditionalWeightedSumLowerOrEqual</a>(enforcement_literals, vars,</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  negated_coeffs, -<a class="code" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>);</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span> }</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span> </div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span> <span class="comment">// Weighted sum <= constant reified.</span></div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span> <span class="keyword">template</span> <<span class="keyword">typename</span> VectorInt></div><div class="line"><a name="l00591"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#aad2e1c8bb55fe9901f1ae962547fb306"> 591</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#aad2e1c8bb55fe9901f1ae962547fb306">WeightedSumLowerOrEqualReif</a>(</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_le, <span class="keyword">const</span> std::vector<IntegerVariable>& vars,</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keyword">const</span> VectorInt& <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>, int64_t <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a22d7b811bf8e75458bbfebd39fe5b8d0">ConditionalWeightedSumLowerOrEqual</a>({is_le}, vars, <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>,</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>));</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a520c2f743c9adfde168689908851dfee">ConditionalWeightedSumGreaterOrEqual</a>(</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  {is_le.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>()}, vars, <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>, <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> + 1));</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  };</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span> }</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span> </div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="comment">// Weighted sum >= constant reified.</span></div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span> <span class="keyword">template</span> <<span class="keyword">typename</span> VectorInt></div><div class="line"><a name="l00604"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ad748caa6ba0c400918366076fc8d50d0"> 604</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#ad748caa6ba0c400918366076fc8d50d0">WeightedSumGreaterOrEqualReif</a>(</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_ge, <span class="keyword">const</span> std::vector<IntegerVariable>& vars,</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keyword">const</span> VectorInt& <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>, int64_t <a class="code" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>) {</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a520c2f743c9adfde168689908851dfee">ConditionalWeightedSumGreaterOrEqual</a>({is_ge}, vars, <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>,</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <a class="code" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>));</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a22d7b811bf8e75458bbfebd39fe5b8d0">ConditionalWeightedSumLowerOrEqual</a>(</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  {is_ge.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>()}, vars, <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>, <a class="code" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a> - 1));</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  };</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span> }</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span> </div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span> <span class="comment">// LinearConstraint version.</span></div><div class="line"><a name="l00616"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a899896953b6215b01cb0b85caa96bebe"> 616</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a85f779432cdf63a07905deaae7fd0041">LoadLinearConstraint</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>& cst, <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keywordflow">if</span> (cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.empty()) {</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="keywordflow">if</span> (cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a> <= 0 && cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> >= 0) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>()->NotifyThatModelIsUnsat();</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  }</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span> </div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="comment">// TODO(user): Remove the conversion!</span></div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  std::vector<int64_t> converted_coeffs;</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span> </div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerValue v : cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>) converted_coeffs.push_back(v.value());</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="keywordflow">if</span> (cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> < <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>) {</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a94d028de71e81b94a1e49ed6a22e1881">WeightedSumLowerOrEqual</a>(cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>, converted_coeffs, cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>.value()));</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  }</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="keywordflow">if</span> (cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a> > <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>) {</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#af68f789cce73e17fbe614888479c3f0d">WeightedSumGreaterOrEqual</a>(cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>, converted_coeffs, cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a>.value()));</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  }</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span> }</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span> </div><div class="line"><a name="l00637"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a4b4da650bfcb86c00bee1df0ab0cc953"> 637</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a4b4da650bfcb86c00bee1df0ab0cc953">LoadConditionalLinearConstraint</a>(</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="keyword">const</span> absl::Span<const Literal> enforcement_literals,</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>& cst, <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keywordflow">if</span> (enforcement_literals.empty()) {</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a85f779432cdf63a07905deaae7fd0041">LoadLinearConstraint</a>(cst, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  }</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keywordflow">if</span> (cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.empty()) {</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keywordflow">if</span> (cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a> <= 0 && cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> >= 0) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keywordflow">return</span> <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a1655a9b9673e7c4de940ca6e5e3cf936">ClauseConstraint</a>(enforcement_literals));</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  }</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span> </div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="comment">// TODO(user): Remove the conversion!</span></div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  std::vector<Literal> converted_literals(enforcement_literals.begin(),</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  enforcement_literals.end());</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  std::vector<int64_t> converted_coeffs;</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerValue v : cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>) converted_coeffs.push_back(v.value());</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span> </div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keywordflow">if</span> (cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> < <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>) {</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a22d7b811bf8e75458bbfebd39fe5b8d0">ConditionalWeightedSumLowerOrEqual</a>(</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  converted_literals, cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>, converted_coeffs, cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>.value()));</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  }</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keywordflow">if</span> (cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a> > <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>) {</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a520c2f743c9adfde168689908851dfee">ConditionalWeightedSumGreaterOrEqual</a>(</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  converted_literals, cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>, converted_coeffs, cst.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a>.value()));</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  }</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span> }</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span> </div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span> <span class="comment">// Weighted sum == constant reified.</span></div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span> <span class="comment">// TODO(user): Simplify if the constant is at the edge of the possible values.</span></div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span> <span class="keyword">template</span> <<span class="keyword">typename</span> VectorInt></div><div class="line"><a name="l00667"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a2c1a97ccf43ab8a81301e26b18ac2530"> 667</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a2c1a97ccf43ab8a81301e26b18ac2530">FixedWeightedSumReif</a>(</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_eq, <span class="keyword">const</span> std::vector<IntegerVariable>& vars,</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keyword">const</span> VectorInt& <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>, int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="comment">// We creates two extra Boolean variables in this case. The alternative is</span></div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="comment">// to code a custom propagator for the direction equality => reified.</span></div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_le = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a38766514ce4824ae1e093a25d7fb43b3">NewBooleanVariable</a>()), <span class="keyword">true</span>);</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_ge = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a38766514ce4824ae1e093a25d7fb43b3">NewBooleanVariable</a>()), <span class="keyword">true</span>);</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#aa874aee040980146062498b87e8fb956">ReifiedBoolAnd</a>({is_le, is_ge}, is_eq));</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#aad2e1c8bb55fe9901f1ae962547fb306">WeightedSumLowerOrEqualReif</a>(is_le, vars, <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>));</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#ad748caa6ba0c400918366076fc8d50d0">WeightedSumGreaterOrEqualReif</a>(is_ge, vars, <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>));</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  };</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span> }</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span> </div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span> <span class="comment">// Weighted sum != constant.</span></div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span> <span class="comment">// TODO(user): Simplify if the constant is at the edge of the possible values.</span></div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span> <span class="keyword">template</span> <<span class="keyword">typename</span> VectorInt></div><div class="line"><a name="l00684"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a513fed05d241e478e7ddcb86ff5846b7"> 684</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a513fed05d241e478e7ddcb86ff5846b7">WeightedSumNotEqual</a>(</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& vars, <span class="keyword">const</span> VectorInt& <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>,</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="comment">// Exactly one of these alternative must be true.</span></div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_lt = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a38766514ce4824ae1e093a25d7fb43b3">NewBooleanVariable</a>()), <span class="keyword">true</span>);</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> is_gt = is_lt.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>();</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a22d7b811bf8e75458bbfebd39fe5b8d0">ConditionalWeightedSumLowerOrEqual</a>(is_lt, vars, <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>,</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - 1));</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a520c2f743c9adfde168689908851dfee">ConditionalWeightedSumGreaterOrEqual</a>(is_gt, vars, <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>,</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> + 1));</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  };</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span> }</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span> </div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span> <span class="comment">// Model-based function to create an IntegerVariable that corresponds to the</span></div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span> <span class="comment">// given weighted sum of other IntegerVariables.</span></div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span> <span class="comment">//</span></div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span> <span class="comment">// Note that this is templated so that it can seamlessly accept vector<int> or</span></div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span> <span class="comment">// vector<int64_t>.</span></div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span> <span class="comment">//</span></div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span> <span class="comment">// TODO(user): invert the coefficients/vars arguments.</span></div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span> <span class="keyword">template</span> <<span class="keyword">typename</span> VectorInt></div><div class="line"><a name="l00706"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a847e8bc51b18a71329b9f0dde2d48293"> 706</a></span> <span class="keyword">inline</span> std::function<IntegerVariable(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a847e8bc51b18a71329b9f0dde2d48293">NewWeightedSum</a>(</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="keyword">const</span> VectorInt& <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>, <span class="keyword">const</span> std::vector<IntegerVariable>& vars) {</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  std::vector<IntegerVariable> new_vars = vars;</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="comment">// To avoid overflow in the FixedWeightedSum() constraint, we need to</span></div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="comment">// compute the basic bounds on the sum.</span></div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="comment">//</span></div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="comment">// TODO(user): deal with overflow here too!</span></div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  int64_t sum_lb(0);</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  int64_t sum_ub(0);</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < new_vars.size(); ++i) {</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keywordflow">if</span> (<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i] > 0) {</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  sum_lb += <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i] * <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get(<a class="code" href="namespaceoperations__research_1_1sat.html#ae13e4169ae1934ab2b1c58af67d9fce3">LowerBound</a>(new_vars[i]));</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  sum_ub += <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i] * <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get(<a class="code" href="namespaceoperations__research_1_1sat.html#a0ee70f9d17fac333fb71c0ab6423f58c">UpperBound</a>(new_vars[i]));</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  sum_lb += <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i] * <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get(<a class="code" href="namespaceoperations__research_1_1sat.html#a0ee70f9d17fac333fb71c0ab6423f58c">UpperBound</a>(new_vars[i]));</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  sum_ub += <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i] * <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get(<a class="code" href="namespaceoperations__research_1_1sat.html#ae13e4169ae1934ab2b1c58af67d9fce3">LowerBound</a>(new_vars[i]));</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  }</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  }</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span> </div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keyword">const</span> IntegerVariable sum = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a9d8cd5de7be4a42157145228a43d177e">NewIntegerVariable</a>(sum_lb, sum_ub));</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  new_vars.push_back(sum);</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  std::vector<int64_t> new_coeffs(<a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>.begin(), <a class="code" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>.end());</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  new_coeffs.push_back(-1);</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a9afb94a13748f5bd2e343e775f4a302c">FixedWeightedSum</a>(new_vars, new_coeffs, 0));</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keywordflow">return</span> sum;</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  };</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span> }</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span> </div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span> <span class="comment">// Expresses the fact that an existing integer variable is equal to the minimum</span></div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span> <span class="comment">// of other integer variables.</span></div><div class="line"><a name="l00737"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ab316e19c73976fdd6381a93d1458699f"> 737</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#ab316e19c73976fdd6381a93d1458699f">IsEqualToMinOf</a>(</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  IntegerVariable min_var, <span class="keyword">const</span> std::vector<IntegerVariable>& vars) {</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable& <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars) {</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a9b1f29e2e2079dc31e89749c9a33bc01">LowerOrEqual</a>(min_var, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  }</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span> </div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <a class="code" href="classoperations__research_1_1sat_1_1_min_propagator.html">MinPropagator</a>* constraint =</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_min_propagator.html">MinPropagator</a>(vars, min_var, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>());</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  constraint-><a class="code" href="classoperations__research_1_1sat_1_1_min_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>());</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(constraint);</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  };</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span> }</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span> </div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span> <span class="comment">// Expresses the fact that an existing integer variable is equal to the minimum</span></div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span> <span class="comment">// of linear expressions. Assumes Canonical expressions (all positive</span></div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span> <span class="comment">// coefficients).</span></div><div class="line"><a name="l00754"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a1689281a38d93c3d0ebe6ae49bec7554"> 754</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#ab316e19c73976fdd6381a93d1458699f">IsEqualToMinOf</a>(</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a>& min_expr,</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <span class="keyword">const</span> std::vector<LinearExpression>& exprs) {</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span> </div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  IntegerVariable min_var;</div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="keywordflow">if</span> (min_expr.<a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size() == 1 &&</div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  std::abs(min_expr.<a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[0].value()) == 1 && min_expr.<a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html#acd07f8397a2e61932c8ee17a4e300e23">offset</a> == 0) {</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keywordflow">if</span> (min_expr.<a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[0].value() == 1) {</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  min_var = min_expr.<a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[0];</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  min_var = <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(min_expr.<a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[0]);</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  }</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="comment">// Create a new variable if the expression is not just a single variable.</span></div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  IntegerValue min_lb = <a class="code" href="namespaceoperations__research_1_1sat.html#a14ed349a41e2b31bb1c15ea3c44a6bc0">LinExprLowerBound</a>(min_expr, *integer_trail);</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  IntegerValue min_ub = <a class="code" href="namespaceoperations__research_1_1sat.html#ad8620567e3849359ab6deda5f97aef91">LinExprUpperBound</a>(min_expr, *integer_trail);</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  min_var = integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa2d7b702e17a5cd4108b465385dd9acd">AddIntegerVariable</a>(min_lb, min_ub);</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span> </div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="comment">// min_var = min_expr</span></div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  std::vector<IntegerVariable> min_sum_vars = min_expr.<a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>;</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  std::vector<int64_t> min_sum_coeffs;</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="keywordflow">for</span> (IntegerValue coeff : min_expr.<a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>) {</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  min_sum_coeffs.push_back(coeff.value());</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  }</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  min_sum_vars.push_back(min_var);</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  min_sum_coeffs.push_back(-1);</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span> </div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a9afb94a13748f5bd2e343e775f4a302c">FixedWeightedSum</a>(min_sum_vars, min_sum_coeffs,</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  -min_expr.<a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html#acd07f8397a2e61932c8ee17a4e300e23">offset</a>.value()));</div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  }</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a>& expr : exprs) {</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="comment">// min_var <= expr</span></div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  std::vector<IntegerVariable> vars = expr.vars;</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  std::vector<int64_t> coeffs;</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="keywordflow">for</span> (IntegerValue coeff : expr.coeffs) {</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  coeffs.push_back(coeff.value());</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  }</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  vars.push_back(min_var);</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  coeffs.push_back(-1);</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#af68f789cce73e17fbe614888479c3f0d">WeightedSumGreaterOrEqual</a>(vars, coeffs, -expr.offset.value()));</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  }</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span> </div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <a class="code" href="classoperations__research_1_1sat_1_1_lin_min_propagator.html">LinMinPropagator</a>* constraint = <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_lin_min_propagator.html">LinMinPropagator</a>(exprs, min_var, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  constraint-><a class="code" href="classoperations__research_1_1sat_1_1_lin_min_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>());</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(constraint);</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  };</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span> }</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span> </div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span> <span class="comment">// Expresses the fact that an existing integer variable is equal to the maximum</span></div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span> <span class="comment">// of other integer variables.</span></div><div class="line"><a name="l00806"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a14d3bed64d7fdf5b081c349270c4cf11"> 806</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a14d3bed64d7fdf5b081c349270c4cf11">IsEqualToMaxOf</a>(</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  IntegerVariable max_var, <span class="keyword">const</span> std::vector<IntegerVariable>& vars) {</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  std::vector<IntegerVariable> negated_vars;</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable& <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars) {</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  negated_vars.push_back(<a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a0dedef72c691d332e0e1cc092bc01bc8">GreaterOrEqual</a>(max_var, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  }</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span> </div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  <a class="code" href="classoperations__research_1_1sat_1_1_min_propagator.html">MinPropagator</a>* constraint = <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_min_propagator.html">MinPropagator</a>(</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  negated_vars, <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(max_var), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>());</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  constraint-><a class="code" href="classoperations__research_1_1sat_1_1_min_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>());</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(constraint);</div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  };</div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span> }</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span> </div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span> <span class="comment">// Expresses the fact that an existing integer variable is equal to one of</span></div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span> <span class="comment">// the given values, each selected by a given literal.</span></div><div class="line"><a name="l00824"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a64b28e887e5cc31ab18530300f8c745e"> 824</a></span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a64b28e887e5cc31ab18530300f8c745e">IsOneOf</a>(IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>,</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keyword">const</span> std::vector<Literal>& selectors,</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <span class="keyword">const</span> std::vector<IntegerValue>& values);</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span> </div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div><div class="line"><a name="l00829"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a838ae1c98a62762620ef82e362c4ad8c"> 829</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a838ae1c98a62762620ef82e362c4ad8c">RegisterAndTransferOwnership</a>(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, T* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>) {</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->RegisterWith(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>());</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span> }</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span> <span class="comment">// Adds the constraint: a * b = p.</span></div><div class="line"><a name="l00834"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a7bdbe585d50d5454b69069c6fbdcc32e"> 834</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a7bdbe585d50d5454b69069c6fbdcc32e">ProductConstraint</a>(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>,</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>,</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> p) {</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> == <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) {</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="keywordflow">if</span> (integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>) >= 0) {</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a838ae1c98a62762620ef82e362c4ad8c">RegisterAndTransferOwnership</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_square_propagator.html">SquarePropagator</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, p, integer_trail));</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  }</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="keywordflow">if</span> (integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>) <= 0) {</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a838ae1c98a62762620ef82e362c4ad8c">RegisterAndTransferOwnership</a>(</div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_square_propagator.html">SquarePropagator</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.Negated(), p, integer_trail));</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  }</div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  }</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a838ae1c98a62762620ef82e362c4ad8c">RegisterAndTransferOwnership</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_product_propagator.html">ProductPropagator</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, p, integer_trail));</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  };</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span> }</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span> </div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span> <span class="comment">// Adds the constraint: num / denom = div. (denom > 0).</span></div><div class="line"><a name="l00857"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a9fe5ef73b556d8c0de4dd3b791a636ff"> 857</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a9fe5ef73b556d8c0de4dd3b791a636ff">DivisionConstraint</a>(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> num,</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> denom,</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> div) {</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <a class="code" href="classoperations__research_1_1sat_1_1_division_propagator.html">DivisionPropagator</a>* constraint;</div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  <span class="keywordflow">if</span> (integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(denom) < 0) {</div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  constraint = <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_division_propagator.html">DivisionPropagator</a>(num.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a19bff44fb82e19c55a4da7fe9aa38a86">Negated</a>(), denom.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a19bff44fb82e19c55a4da7fe9aa38a86">Negated</a>(), div,</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  integer_trail);</div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span> </div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  constraint = <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_division_propagator.html">DivisionPropagator</a>(num, denom, div, integer_trail);</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  }</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  constraint->RegisterWith(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>());</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(constraint);</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  };</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span> }</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span> </div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span> <span class="comment">// Adds the constraint: a / b = c where b is a constant.</span></div><div class="line"><a name="l00876"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#aa6b56b8b36d20c0da816098cc486a821"> 876</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#aa6b56b8b36d20c0da816098cc486a821">FixedDivisionConstraint</a>(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>,</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  IntegerValue <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>,</div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> c) {</div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <a class="code" href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html">FixedDivisionPropagator</a>* constraint =</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> > 0 ? <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html">FixedDivisionPropagator</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, c, integer_trail)</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  : <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html">FixedDivisionPropagator</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.Negated(), -<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, c, integer_trail);</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  constraint-><a class="code" href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>());</div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(constraint);</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  };</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span> }</div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span> </div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span> <span class="comment">// Adds the constraint: a % b = c where b is a constant.</span></div><div class="line"><a name="l00890"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#acb008be02076a99a06ab2a7da13afe66"> 890</a></span> <span class="keyword">inline</span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#acb008be02076a99a06ab2a7da13afe66">FixedModuloConstraint</a>(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>,</div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  IntegerValue <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>,</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> c) {</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <a class="code" href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html">FixedModuloPropagator</a>* constraint =</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html">FixedModuloPropagator</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, c, integer_trail);</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  constraint->RegisterWith(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>());</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(constraint);</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  };</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span> }</div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span> </div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span> } <span class="comment">// namespace sat</span></div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span> } <span class="comment">// namespace operations_research</span></div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span> </div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span> <span class="preprocessor">#endif // OR_TOOLS_SAT_INTEGER_EXPR_H_</span></div><div class="ttc" id="namespaceoperations__research_1_1sat_html_a847e8bc51b18a71329b9f0dde2d48293"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a847e8bc51b18a71329b9f0dde2d48293">operations_research::sat::NewWeightedSum</a></div><div class="ttdeci">std::function< IntegerVariable(Model *)> NewWeightedSum(const VectorInt &coefficients, const std::vector< IntegerVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00706">integer_expr.h:706</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_fixed_modulo_propagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::FixedModuloPropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01283">integer_expr.cc:1283</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_division_propagator_html_a246b8936f3e0d5275497100133021fb9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_division_propagator.html#a246b8936f3e0d5275497100133021fb9">operations_research::sat::DivisionPropagator::DivisionPropagator</a></div><div class="ttdeci">DivisionPropagator(AffineExpression num, AffineExpression denom, AffineExpression div, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01023">integer_expr.cc:1023</a></div></div>
|
|
<div class="ttc" id="classoperations__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="namespaceoperations__research_1_1sat_html_a38766514ce4824ae1e093a25d7fb43b3"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a38766514ce4824ae1e093a25d7fb43b3">operations_research::sat::NewBooleanVariable</a></div><div class="ttdeci">std::function< BooleanVariable(Model *)> NewBooleanVariable()</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01598">integer.h:1598</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_affine_expression_html_a19bff44fb82e19c55a4da7fe9aa38a86"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#a19bff44fb82e19c55a4da7fe9aa38a86">operations_research::sat::AffineExpression::Negated</a></div><div class="ttdeci">AffineExpression Negated() const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00252">integer.h:252</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_aa2d7b702e17a5cd4108b465385dd9acd"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#aa2d7b702e17a5cd4108b465385dd9acd">operations_research::sat::IntegerTrail::AddIntegerVariable</a></div><div class="ttdeci">IntegerVariable AddIntegerVariable(IntegerValue lower_bound, IntegerValue upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00622">integer.cc:622</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a92f4b0ea4d733b52487388fa3441fe7c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a92f4b0ea4d733b52487388fa3441fe7c">operations_research::sat::Sum3LowerOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> Sum3LowerOrEqual(IntegerVariable a, IntegerVariable b, IntegerVariable c, int64_t ub)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00371">precedences.h:371</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html">operations_research::sat::IntegerLiteral</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00168">integer.h:168</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_product_propagator_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_product_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::ProductPropagator::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00960">integer_expr.cc:960</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a94d028de71e81b94a1e49ed6a22e1881"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a94d028de71e81b94a1e49ed6a22e1881">operations_research::sat::WeightedSumLowerOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> WeightedSumLowerOrEqual(const std::vector< IntegerVariable > &vars, const VectorInt &coefficients, int64_t upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00361">integer_expr.h:361</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_division_propagator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_division_propagator.html">operations_research::sat::DivisionPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00257">integer_expr.h:257</a></div></div>
|
|
<div class="ttc" id="alldiff__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="classoperations__research_1_1sat_1_1_fixed_division_propagator_html_ab3ec103368339f9db05ce8325e246406"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html#ab3ec103368339f9db05ce8325e246406">operations_research::sat::FixedDivisionPropagator::FixedDivisionPropagator</a></div><div class="ttdeci">FixedDivisionPropagator(AffineExpression a, IntegerValue b, AffineExpression c, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01214">integer_expr.cc:1214</a></div></div>
|
|
<div class="ttc" id="base_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#l00706">base/logging.h:706</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a14ed349a41e2b31bb1c15ea3c44a6bc0"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a14ed349a41e2b31bb1c15ea3c44a6bc0">operations_research::sat::LinExprLowerBound</a></div><div class="ttdeci">IntegerValue LinExprLowerBound(const LinearExpression &expr, const IntegerTrail &integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00348">sat/linear_constraint.cc:348</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_linear_expression_html_acd07f8397a2e61932c8ee17a4e300e23"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_expression.html#acd07f8397a2e61932c8ee17a4e300e23">operations_research::sat::LinearExpression::offset</a></div><div class="ttdeci">IntegerValue offset</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00091">sat/linear_constraint.h:91</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00038">sat/model.h:38</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_lin_min_propagator_html_a3b562468ef8cc634a83e3ac7240a43da"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_lin_min_propagator.html#a3b562468ef8cc634a83e3ac7240a43da">operations_research::sat::LinMinPropagator::LinMinPropagator</a></div><div class="ttdeci">LinMinPropagator(const std::vector< LinearExpression > &exprs, IntegerVariable min_var, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00469">integer_expr.cc:469</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aad2e1c8bb55fe9901f1ae962547fb306"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aad2e1c8bb55fe9901f1ae962547fb306">operations_research::sat::WeightedSumLowerOrEqualReif</a></div><div class="ttdeci">std::function< void(Model *)> WeightedSumLowerOrEqualReif(Literal is_le, const std::vector< IntegerVariable > &vars, const VectorInt &coefficients, int64_t upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00591">integer_expr.h:591</a></div></div>
|
|
<div class="ttc" id="structoperations__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< IntegerValue > coeffs</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00037">sat/linear_constraint.h:37</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a355a62f25cfadeccfb164ab9fb867c81"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">operations_research::sat::kMinIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMinIntegerValue(-kMaxIntegerValue)</div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_min_propagator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_min_propagator.html">operations_research::sat::MinPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00170">integer_expr.h:170</a></div></div>
|
|
<div class="ttc" id="int__type_8h_html"><div class="ttname"><a href="int__type_8h.html">int_type.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_fixed_modulo_propagator_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::FixedModuloPropagator::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01442">integer_expr.cc:1442</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_product_propagator_html_ac88ae9a72b79c5308eebc84c67eb02b2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_product_propagator.html#ac88ae9a72b79c5308eebc84c67eb02b2">operations_research::sat::ProductPropagator::ProductPropagator</a></div><div class="ttdeci">ProductPropagator(AffineExpression a, AffineExpression b, AffineExpression p, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00669">integer_expr.cc:669</a></div></div>
|
|
<div class="ttc" id="structoperations__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#l00033">sat/linear_constraint.h:33</a></div></div>
|
|
<div class="ttc" id="sat_2model_8h_html"><div class="ttname"><a href="sat_2model_8h.html">model.h</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html_a3e2eb445631727dd4abf1d5343f16b2f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">operations_research::sat::IntegerLiteral::LowerOrEqual</a></div><div class="ttdeci">static IntegerLiteral LowerOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01383">integer.h:1383</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aa874aee040980146062498b87e8fb956"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa874aee040980146062498b87e8fb956">operations_research::sat::ReifiedBoolAnd</a></div><div class="ttdeci">std::function< void(Model *)> ReifiedBoolAnd(const std::vector< Literal > &literals, Literal r)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00970">sat_solver.h:970</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_sum_l_e_html_a83404baa3e4ce3beaefa9a662f627655"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#a83404baa3e4ce3beaefa9a662f627655">operations_research::sat::IntegerSumLE::ConditionalLb</a></div><div class="ttdeci">std::pair< IntegerValue, IntegerValue > ConditionalLb(IntegerLiteral integer_literal, IntegerVariable target_var) const</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00080">integer_expr.cc:80</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_ab857cd2aead68952d9fe92a8ad8d3ac9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">operations_research::sat::IntegerTrail::LowerBound</a></div><div class="ttdeci">IntegerValue LowerBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01435">integer.h:1435</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_fixed_modulo_propagator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html">operations_research::sat::FixedModuloPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00313">integer_expr.h:313</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a520c2f743c9adfde168689908851dfee"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a520c2f743c9adfde168689908851dfee">operations_research::sat::ConditionalWeightedSumGreaterOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> ConditionalWeightedSumGreaterOrEqual(const std::vector< Literal > &enforcement_literals, const std::vector< IntegerVariable > &vars, const VectorInt &coefficients, int64_t lower_bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00578">integer_expr.h:578</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_literal_html_a886e9c024f7209181c0a850b6e90c644"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">operations_research::sat::Literal::Negated</a></div><div class="ttdeci">Literal Negated() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00093">sat_base.h:93</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a7bdbe585d50d5454b69069c6fbdcc32e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7bdbe585d50d5454b69069c6fbdcc32e">operations_research::sat::ProductConstraint</a></div><div class="ttdeci">std::function< void(Model *)> ProductConstraint(AffineExpression a, AffineExpression b, AffineExpression p)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00834">integer_expr.h:834</a></div></div>
|
|
<div class="ttc" id="gurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00274">gurobi_interface.cc:274</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_fixed_division_propagator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html">operations_research::sat::FixedDivisionPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00293">integer_expr.h:293</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00066">sat_base.h:66</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_division_propagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_division_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::DivisionPropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01037">integer_expr.cc:1037</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_generic_literal_watcher_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">operations_research::sat::GenericLiteralWatcher</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01221">integer.h:1221</a></div></div>
|
|
<div class="ttc" id="structoperations__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#l00088">sat/linear_constraint.h:88</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a9fe5ef73b556d8c0de4dd3b791a636ff"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a9fe5ef73b556d8c0de4dd3b791a636ff">operations_research::sat::DivisionConstraint</a></div><div class="ttdeci">std::function< void(Model *)> DivisionConstraint(AffineExpression num, AffineExpression denom, AffineExpression div)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00857">integer_expr.h:857</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__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< IntegerValue::ValueType >::max() - 1)</div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_linear_expression_html_a4053d5aed2a34995e0aeb2042878ca7a"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_expression.html#a4053d5aed2a34995e0aeb2042878ca7a">operations_research::sat::LinearExpression::coeffs</a></div><div class="ttdeci">std::vector< IntegerValue > coeffs</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00090">sat/linear_constraint.h:90</a></div></div>
|
|
<div class="ttc" id="constraint__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="integral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_square_propagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_square_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::SquarePropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00976">integer_expr.cc:976</a></div></div>
|
|
<div class="ttc" id="sat_2linear__constraint_8h_html"><div class="ttname"><a href="sat_2linear__constraint_8h.html">linear_constraint.h</a></div></div>
|
|
<div class="ttc" id="structoperations__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< IntegerVariable > vars</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00036">sat/linear_constraint.h:36</a></div></div>
|
|
<div class="ttc" id="structoperations__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< IntegerVariable > vars</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00089">sat/linear_constraint.h:89</a></div></div>
|
|
<div class="ttc" id="macros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a9d8cd5de7be4a42157145228a43d177e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a9d8cd5de7be4a42157145228a43d177e">operations_research::sat::NewIntegerVariable</a></div><div class="ttdeci">std::function< IntegerVariable(Model *)> NewIntegerVariable(int64_t lb, int64_t ub)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01612">integer.h:1612</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_level_zero_equality_html_ab7be565ae45c1e7171a1975d0055c422"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_level_zero_equality.html#ab7be565ae45c1e7171a1975d0055c422">operations_research::sat::LevelZeroEquality::LevelZeroEquality</a></div><div class="ttdeci">LevelZeroEquality(IntegerVariable target, const std::vector< IntegerVariable > &vars, const std::vector< IntegerValue > &coeffs, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00309">integer_expr.cc:309</a></div></div>
|
|
<div class="ttc" id="mathutil_8h_html"><div class="ttname"><a href="mathutil_8h.html">mathutil.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_sum_l_e_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::IntegerSumLE::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00293">integer_expr.cc:293</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a14d3bed64d7fdf5b081c349270c4cf11"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a14d3bed64d7fdf5b081c349270c4cf11">operations_research::sat::IsEqualToMaxOf</a></div><div class="ttdeci">std::function< void(Model *)> IsEqualToMaxOf(IntegerVariable max_var, const std::vector< IntegerVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00806">integer_expr.h:806</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a9b1f29e2e2079dc31e89749c9a33bc01"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a9b1f29e2e2079dc31e89749c9a33bc01">operations_research::sat::LowerOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> LowerOrEqual(IntegerVariable v, int64_t ub)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01696">integer.h:1696</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a64b28e887e5cc31ab18530300f8c745e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a64b28e887e5cc31ab18530300f8c745e">operations_research::sat::IsOneOf</a></div><div class="ttdeci">std::function< void(Model *)> IsOneOf(IntegerVariable var, const std::vector< Literal > &selectors, const std::vector< IntegerValue > &values)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00824">integer_expr.h:824</a></div></div>
|
|
<div class="ttc" id="alldiff__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="namespaceoperations__research_1_1sat_html_ab316e19c73976fdd6381a93d1458699f"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab316e19c73976fdd6381a93d1458699f">operations_research::sat::IsEqualToMinOf</a></div><div class="ttdeci">std::function< void(Model *)> IsEqualToMinOf(IntegerVariable min_var, const std::vector< IntegerVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00737">integer_expr.h:737</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_square_propagator_html_a86723da0f387e68b890ab489f88318af"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_square_propagator.html#a86723da0f387e68b890ab489f88318af">operations_research::sat::SquarePropagator::SquarePropagator</a></div><div class="ttdeci">SquarePropagator(AffineExpression x, AffineExpression s, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00968">integer_expr.cc:968</a></div></div>
|
|
<div class="ttc" id="gscip__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#l00126">gscip_solver.cc:126</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_sum_l_e_html_a79ee9e362d647b6d65cf6d38e3df216d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#a79ee9e362d647b6d65cf6d38e3df216d">operations_research::sat::IntegerSumLE::PropagateAtLevelZero</a></div><div class="ttdeci">bool PropagateAtLevelZero()</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00251">integer_expr.cc:251</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_lin_min_propagator_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_lin_min_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::LinMinPropagator::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00652">integer_expr.cc:652</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_min_propagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_min_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::MinPropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00383">integer_expr.cc:383</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a4b74487600a1e03a74634208f05f1656"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a4b74487600a1e03a74634208f05f1656">operations_research::sat::ConditionalSum2LowerOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> ConditionalSum2LowerOrEqual(IntegerVariable a, IntegerVariable b, int64_t ub, const std::vector< Literal > &enforcement_literals)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00360">precedences.h:360</a></div></div>
|
|
<div class="ttc" id="gscip__solver_8cc_html_a1e2f9a2352c1d9a6cada9544898fceec"><div class="ttname"><a href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a></div><div class="ttdeci">double lower_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00125">gscip_solver.cc:125</a></div></div>
|
|
<div class="ttc" id="sat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a0dedef72c691d332e0e1cc092bc01bc8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0dedef72c691d332e0e1cc092bc01bc8">operations_research::sat::GreaterOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> GreaterOrEqual(IntegerVariable v, int64_t lb)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01681">integer.h:1681</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_afbccccf013bc539ec659a066318b9ee9"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#afbccccf013bc539ec659a066318b9ee9">operations_research::sat::ConditionalSum3LowerOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> ConditionalSum3LowerOrEqual(IntegerVariable a, IntegerVariable b, IntegerVariable c, int64_t ub, const std::vector< Literal > &enforcement_literals)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00382">precedences.h:382</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html">operations_research::sat::IntegerTrail</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00613">integer.h:613</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_product_propagator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_product_propagator.html">operations_research::sat::ProductPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00222">integer_expr.h:222</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a513fed05d241e478e7ddcb86ff5846b7"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a513fed05d241e478e7ddcb86ff5846b7">operations_research::sat::WeightedSumNotEqual</a></div><div class="ttdeci">std::function< void(Model *)> WeightedSumNotEqual(const std::vector< IntegerVariable > &vars, const VectorInt &coefficients, int64_t value)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00684">integer_expr.h:684</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_sum_l_e_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html">operations_research::sat::IntegerSumLE</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00051">integer_expr.h:51</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00235">sat_base.h:235</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_fixed_modulo_propagator_html_ae5d1328b48b697601cfa55b49d56c5cc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html#ae5d1328b48b697601cfa55b49d56c5cc">operations_research::sat::FixedModuloPropagator::FixedModuloPropagator</a></div><div class="ttdeci">FixedModuloPropagator(AffineExpression expr, IntegerValue mod, AffineExpression target, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01275">integer_expr.cc:1275</a></div></div>
|
|
<div class="ttc" id="precedences_8h_html"><div class="ttname"><a href="precedences_8h.html">precedences.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a689b1371728b50d48e083628d424e7e5"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a689b1371728b50d48e083628d424e7e5">operations_research::sat::Sum2LowerOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> Sum2LowerOrEqual(IntegerVariable a, IntegerVariable b, int64_t ub)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00353">precedences.h:353</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a22d7b811bf8e75458bbfebd39fe5b8d0"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a22d7b811bf8e75458bbfebd39fe5b8d0">operations_research::sat::ConditionalWeightedSumLowerOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> ConditionalWeightedSumLowerOrEqual(const std::vector< Literal > &enforcement_literals, const std::vector< IntegerVariable > &vars, const VectorInt &coefficients, int64_t upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00490">integer_expr.h:490</a></div></div>
|
|
<div class="ttc" id="structoperations__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#l00227">integer.h:227</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_square_propagator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_square_propagator.html">operations_research::sat::SquarePropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00339">integer_expr.h:339</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_acb008be02076a99a06ab2a7da13afe66"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#acb008be02076a99a06ab2a7da13afe66">operations_research::sat::FixedModuloConstraint</a></div><div class="ttdeci">std::function< void(Model *)> FixedModuloConstraint(AffineExpression a, IntegerValue b, AffineExpression c)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00890">integer_expr.h:890</a></div></div>
|
|
<div class="ttc" id="sat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a0ee70f9d17fac333fb71c0ab6423f58c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0ee70f9d17fac333fb71c0ab6423f58c">operations_research::sat::UpperBound</a></div><div class="ttdeci">std::function< int64_t(const Model &)> UpperBound(IntegerVariable v)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01659">integer.h:1659</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html">operations_research::sat::SatSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00058">sat_solver.h:58</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ad8620567e3849359ab6deda5f97aef91"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ad8620567e3849359ab6deda5f97aef91">operations_research::sat::LinExprUpperBound</a></div><div class="ttdeci">IntegerValue LinExprUpperBound(const LinearExpression &expr, const IntegerTrail &integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00358">sat/linear_constraint.cc:358</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__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< IntegerVariable > NegationOf(const std::vector< IntegerVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00030">integer.cc:30</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ad748caa6ba0c400918366076fc8d50d0"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ad748caa6ba0c400918366076fc8d50d0">operations_research::sat::WeightedSumGreaterOrEqualReif</a></div><div class="ttdeci">std::function< void(Model *)> WeightedSumGreaterOrEqualReif(Literal is_ge, const std::vector< IntegerVariable > &vars, const VectorInt &coefficients, int64_t lower_bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00604">integer_expr.h:604</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a8a0620c105ec05f1b42bcde3a9380872"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8a0620c105ec05f1b42bcde3a9380872">operations_research::sat::Implication</a></div><div class="ttdeci">std::function< void(Model *)> Implication(const std::vector< Literal > &enforcement_literals, IntegerLiteral i)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01724">integer.h:1724</a></div></div>
|
|
<div class="ttc" id="structoperations__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#l00034">sat/linear_constraint.h:34</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_lin_min_propagator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_lin_min_propagator.html">operations_research::sat::LinMinPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00191">integer_expr.h:191</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_rev_integer_value_repository_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_rev_integer_value_repository.html">operations_research::sat::RevIntegerValueRepository</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01210">integer.h:1210</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__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#l00092">integer.h:92</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_min_propagator_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_min_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::MinPropagator::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00461">integer_expr.cc:461</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ae13e4169ae1934ab2b1c58af67d9fce3"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae13e4169ae1934ab2b1c58af67d9fce3">operations_research::sat::LowerBound</a></div><div class="ttdeci">std::function< int64_t(const Model &)> LowerBound(IntegerVariable v)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01653">integer.h:1653</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__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#l00083">integer.h:83</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_propagator_interface_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_propagator_interface.html">operations_research::sat::PropagatorInterface</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01173">integer.h:1173</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a8b6d5a25e6ad3d28a85b1924471e2cac"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">operations_research::sat::IntegerTrail::UpperBound</a></div><div class="ttdeci">IntegerValue UpperBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01439">integer.h:1439</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_lin_min_propagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_lin_min_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::LinMinPropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00573">integer_expr.cc:573</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_min_propagator_html_a7adb3d82f96ba9699d1e1e1b399134ec"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_min_propagator.html#a7adb3d82f96ba9699d1e1e1b399134ec">operations_research::sat::MinPropagator::MinPropagator</a></div><div class="ttdeci">MinPropagator(const std::vector< IntegerVariable > &vars, IntegerVariable min_var, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00378">integer_expr.cc:378</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_square_propagator_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_square_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::SquarePropagator::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01016">integer_expr.cc:1016</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_sum_l_e_html_aec1aae1092c281971431aac37d923b60"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#aec1aae1092c281971431aac37d923b60">operations_research::sat::IntegerSumLE::IntegerSumLE</a></div><div class="ttdeci">IntegerSumLE(const std::vector< Literal > &enforcement_literals, const std::vector< IntegerVariable > &vars, const std::vector< IntegerValue > &coeffs, IntegerValue upper_bound, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00032">integer_expr.cc:32</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_level_zero_equality_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_level_zero_equality.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::LevelZeroEquality::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00333">integer_expr.cc:333</a></div></div>
|
|
<div class="ttc" id="integer_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="structoperations__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#l00035">sat/linear_constraint.h:35</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html_a6c233aafac25ea66d69de93a83c9be63"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">operations_research::sat::IntegerLiteral::GreaterOrEqual</a></div><div class="ttdeci">static IntegerLiteral GreaterOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01377">integer.h:1377</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_fixed_division_propagator_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::FixedDivisionPropagator::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01269">integer_expr.cc:1269</a></div></div>
|
|
<div class="ttc" id="gscip__solver_8cc_html_aa59e74cc299dbf75fa6e2234dd0849a2"><div class="ttname"><a href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a></div><div class="ttdeci">absl::Span< const double > coefficients</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00129">gscip_solver.cc:129</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aa6b56b8b36d20c0da816098cc486a821"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa6b56b8b36d20c0da816098cc486a821">operations_research::sat::FixedDivisionConstraint</a></div><div class="ttdeci">std::function< void(Model *)> FixedDivisionConstraint(AffineExpression a, IntegerValue b, AffineExpression c)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00876">integer_expr.h:876</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_af68f789cce73e17fbe614888479c3f0d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#af68f789cce73e17fbe614888479c3f0d">operations_research::sat::WeightedSumGreaterOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> WeightedSumGreaterOrEqual(const std::vector< IntegerVariable > &vars, const VectorInt &coefficients, int64_t lower_bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00468">integer_expr.h:468</a></div></div>
|
|
<div class="ttc" id="rev_8h_html"><div class="ttname"><a href="rev_8h.html">rev.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_fixed_division_propagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::FixedDivisionPropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01222">integer_expr.cc:1222</a></div></div>
|
|
<div class="ttc" id="expr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a2c1a97ccf43ab8a81301e26b18ac2530"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a2c1a97ccf43ab8a81301e26b18ac2530">operations_research::sat::FixedWeightedSumReif</a></div><div class="ttdeci">std::function< void(Model *)> FixedWeightedSumReif(Literal is_eq, const std::vector< IntegerVariable > &vars, const VectorInt &coefficients, int64_t value)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00667">integer_expr.h:667</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_division_propagator_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_division_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::DivisionPropagator::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01206">integer_expr.cc:1206</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a1655a9b9673e7c4de940ca6e5e3cf936"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1655a9b9673e7c4de940ca6e5e3cf936">operations_research::sat::ClauseConstraint</a></div><div class="ttdeci">std::function< void(Model *)> ClauseConstraint(absl::Span< const Literal > literals)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00906">sat_solver.h:906</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a838ae1c98a62762620ef82e362c4ad8c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a838ae1c98a62762620ef82e362c4ad8c">operations_research::sat::RegisterAndTransferOwnership</a></div><div class="ttdeci">void RegisterAndTransferOwnership(Model *model, T *ct)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00829">integer_expr.h:829</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a9afb94a13748f5bd2e343e775f4a302c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a9afb94a13748f5bd2e343e775f4a302c">operations_research::sat::FixedWeightedSum</a></div><div class="ttdeci">std::function< void(Model *)> FixedWeightedSum(const std::vector< IntegerVariable > &vars, const VectorInt &coefficients, int64_t value)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00479">integer_expr.h:479</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a85f779432cdf63a07905deaae7fd0041"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a85f779432cdf63a07905deaae7fd0041">operations_research::sat::LoadLinearConstraint</a></div><div class="ttdeci">void LoadLinearConstraint(const ConstraintProto &ct, Model *m)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__loader_8cc_source.html#l00979">cp_model_loader.cc:979</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a4b4da650bfcb86c00bee1df0ab0cc953"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a4b4da650bfcb86c00bee1df0ab0cc953">operations_research::sat::LoadConditionalLinearConstraint</a></div><div class="ttdeci">void LoadConditionalLinearConstraint(const absl::Span< const Literal > enforcement_literals, const LinearConstraint &cst, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00637">integer_expr.h:637</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_product_propagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_product_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::ProductPropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00816">integer_expr.cc:816</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_sum_l_e_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::IntegerSumLE::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00135">integer_expr.cc:135</a></div></div>
|
|
<div class="ttc" id="demon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
|
|
<div class="ttc" id="base_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#l00703">base/logging.h:703</a></div></div>
|
|
<div class="ttc" id="demon__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="classoperations__research_1_1sat_1_1_level_zero_equality_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_level_zero_equality.html">operations_research::sat::LevelZeroEquality</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00127">integer_expr.h:127</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_lin_min_propagator_html_a03071a5ba6c96c598a7005f7e2b29411"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_lin_min_propagator.html#a03071a5ba6c96c598a7005f7e2b29411">operations_research::sat::LinMinPropagator::operator=</a></div><div class="ttdeci">LinMinPropagator & operator=(const LinMinPropagator &)=delete</div></div>
|
|
<div class="ttc" id="constraint__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><!-- 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="integer__expr_8h.html">integer_expr.h</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|