180 lines
94 KiB
HTML
180 lines
94 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: linear_constraint.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('sat_2linear__constraint_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">sat/linear_constraint.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="sat_2linear__constraint_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_LINEAR_CONSTRAINT_H_</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#define OR_TOOLS_SAT_LINEAR_CONSTRAINT_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 <vector></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> </div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include "<a class="code" href="strong__vector_8h.html">ortools/base/strong_vector.h</a>"</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>"</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</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="l00022"></a><span class="lineno"> 22</span> </div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="keyword">namespace </span>sat {</div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">// One linear constraint on a set of Integer variables.</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// Important: there should be no duplicate variables.</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">//</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// We also assume that we never have integer overflow when evaluating such</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// constraint at the ROOT node. This should be enforced by the checker for user</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// given constraints, and we must enforce it ourselves for the newly created</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// constraint. See ValidateLinearConstraintForOverflow().</span></div><div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_linear_constraint.html"> 33</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> {</div><div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040"> 34</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a>;</div><div class="line"><a name="l00035"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f"> 35</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>;</div><div class="line"><a name="l00036"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1"> 36</a></span>  std::vector<IntegerVariable> <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>;</div><div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a"> 37</a></span>  std::vector<IntegerValue> <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>;</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73a9ecb4187cf067b6d89210083109aa"> 39</a></span>  <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73a9ecb4187cf067b6d89210083109aa">LinearConstraint</a>() {}</div><div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a872f8136841759147bb8120aca72fa0d"> 40</a></span>  <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a872f8136841759147bb8120aca72fa0d">LinearConstraint</a>(IntegerValue _lb, IntegerValue _ub) : <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a>(_lb), <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>(_ub) {}</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> </div><div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_linear_constraint.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6"> 42</a></span>  <span class="keywordtype">void</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, IntegerValue coeff) {</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>.push_back(coeff);</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  }</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> </div><div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_linear_constraint.html#aa71d36872f416feaa853788a7a7a7ef8"> 47</a></span>  <span class="keywordtype">void</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>() {</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a> = <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> = IntegerValue(0);</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a2f5112deb5776f95a5e0902fad467e2b">ClearTerms</a>();</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  }</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> </div><div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a2f5112deb5776f95a5e0902fad467e2b"> 52</a></span>  <span class="keywordtype">void</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a2f5112deb5776f95a5e0902fad467e2b">ClearTerms</a>() {</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.clear();</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>.clear();</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  }</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> </div><div class="line"><a name="l00057"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a764be64f3029f8b8e23511061d8de355"> 57</a></span>  std::string <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  std::string result;</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">if</span> (<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a>.value() > <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>) {</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  absl::StrAppend(&result, <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a>.value(), <span class="stringliteral">" <= "</span>);</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="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size(); ++i) {</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  absl::StrAppend(&result, i > 0 ? <span class="stringliteral">" "</span> : <span class="stringliteral">""</span>,</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a429d1fd54b5becc39e4cfbc608d7d70a">IntegerTermDebugString</a>(<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i], <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i]));</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  }</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">if</span> (<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>.value() < <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>) {</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  absl::StrAppend(&result, <span class="stringliteral">" <= "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>.value());</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="keywordflow">return</span> result;</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  }</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> </div><div class="line"><a name="l00072"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4bd9f4d170b09ddbfb93957c70caee79"> 72</a></span>  <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4bd9f4d170b09ddbfb93957c70caee79">operator==</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> other)<span class="keyword"> const </span>{</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">if</span> (this->lb != other.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">if</span> (this->ub != other.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">if</span> (this->vars != other.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordflow">if</span> (this->coeffs != other.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  }</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> };</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div><div class="line"><a name="l00081"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a05bd0b78e65530c1b0f79fe68eebc198"> 81</a></span> <span class="keyword">inline</span> std::ostream& <a class="code" href="namespaceoperations__research_1_1sat.html#a15ca399ada8a279dc92f693ede7e4004">operator<<</a>(std::ostream& os, <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>) {</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  os << <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.DebugString();</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">return</span> os;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> }</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> </div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment">// Helper struct to model linear expression for lin_min/lin_max constraints. The</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment">// canonical expression should only contain positive coefficients.</span></div><div class="line"><a name="l00088"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_linear_expression.html"> 88</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a> {</div><div class="line"><a name="l00089"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_linear_expression.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1"> 89</a></span>  std::vector<IntegerVariable> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>;</div><div class="line"><a name="l00090"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_linear_expression.html#a4053d5aed2a34995e0aeb2042878ca7a"> 90</a></span>  std::vector<IntegerValue> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>;</div><div class="line"><a name="l00091"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_linear_expression.html#acd07f8397a2e61932c8ee17a4e300e23"> 91</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html#acd07f8397a2e61932c8ee17a4e300e23">offset</a> = IntegerValue(0);</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> </div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// Return[s] the evaluation of the linear expression.</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordtype">double</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values) <span class="keyword">const</span>;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html#a2f3cf45fe97c9a855645ff69bf528a6b">LevelZeroMin</a>(<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail) <span class="keyword">const</span>;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html#a155597f12e920a6ff8256360ed91d061">Min</a>(<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail) <span class="keyword">const</span>;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  std::string <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>() <span class="keyword">const</span>;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> };</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> </div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment">// Returns the same expression in the canonical form (all positive</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// coefficients).</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a> <a class="code" href="namespaceoperations__research_1_1sat.html#a5ec390fe1c25c7af4de7a30f84a0cd27">CanonicalizeExpr</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a>& expr);</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// Returns lower bound of linear expression using variable bounds of the</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment">// variables in expression. Assumes Canonical expression (all positive</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment">// coefficients).</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> IntegerValue <a class="code" href="namespaceoperations__research_1_1sat.html#a14ed349a41e2b31bb1c15ea3c44a6bc0">LinExprLowerBound</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a>& expr,</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>& integer_trail);</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">// Returns upper bound of linear expression using variable bounds of the</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment">// variables in expression. Assumes Canonical expression (all positive</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// coefficients).</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> IntegerValue <a class="code" href="namespaceoperations__research_1_1sat.html#ad8620567e3849359ab6deda5f97aef91">LinExprUpperBound</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a>& expr,</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>& integer_trail);</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> <span class="comment">// Makes sure that any of our future computation on this constraint will not</span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment">// cause overflow. We use the level zero bounds and use the same definition as</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment">// in PossibleIntegerOverflow() in the cp_model.proto checker.</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">// Namely, the sum of positive terms, the sum of negative terms and their</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment">// difference shouldn't overflow. Note that we don't validate the rhs, but if</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment">// the bounds are properly relaxed, then this shouldn't cause any issues.</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment">//</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// Note(user): We should avoid doing this test too often as it can be slow. At</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="comment">// least do not do it more than once on each constraint.</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a0c5d040da1879626549b8877fa275d86">ValidateLinearConstraintForOverflow</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>& constraint,</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>& integer_trail);</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> </div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment">// Preserves canonicality.</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a> <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a>& expr);</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> </div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment">// Returns the same expression with positive variables.</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a> <a class="code" href="namespaceoperations__research_1_1sat.html#a4ff205ed5a074bbe499b1fa20da1dd9b">PositiveVarExpr</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a>& expr);</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment">// Returns the coefficient of the variable in the expression. Works in linear</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment">// time.</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment">// Note: GetCoefficient(NegationOf(var, expr)) == -GetCoefficient(var, expr).</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> IntegerValue <a class="code" href="namespaceoperations__research_1_1sat.html#a8b7508824efeabdd4dfd00ab39bfb969">GetCoefficient</a>(<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>,</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a>& expr);</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> IntegerValue <a class="code" href="namespaceoperations__research_1_1sat.html#ab7b2c273b19bf885462dfa04611e4e62">GetCoefficientOfPositiveVar</a>(<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>,</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a>& expr);</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> </div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// Allow to build a LinearConstraint while making sure there is no duplicate</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment">// variables. Note that we do not simplify literal/variable that are currently</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment">// fixed here.</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment">//</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// All the functions manipulate a linear expression with an offset. The final</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// constraint bounds will include this offset.</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">// TODO(user): Rename to LinearExpressionBuilder?</span></div><div class="line"><a name="l00153"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html"> 153</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">LinearConstraintBuilder</a> {</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">// We support "sticky" kMinIntegerValue for lb and kMaxIntegerValue for ub</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">// for one-sided constraints.</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="comment">//</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">// Assumes that the 'model' has IntegerEncoder. The bounds can either be</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="comment">// specified at construction or during the Build() call.</span></div><div class="line"><a name="l00160"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a430818c3ef05f66283bb2e83e29e5df6"> 160</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a430818c3ef05f66283bb2e83e29e5df6">LinearConstraintBuilder</a>(<span class="keyword">const</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="l00161"></a><span class="lineno"> 161</span>  : encoder_(*<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get<<a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>()), lb_(0), ub_(0) {}</div><div class="line"><a name="l00162"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ac4f3463a3a8c65c17b54653af8aaba1f"> 162</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ac4f3463a3a8c65c17b54653af8aaba1f">LinearConstraintBuilder</a>(<span class="keyword">const</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>, IntegerValue lb, IntegerValue ub)</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  : encoder_(*<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get<<a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>()), lb_(lb), ub_(ub) {}</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="comment">// Adds the corresponding term to the current linear expression.</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a322657f18d11f256cf3e03b0bd640d5a">AddConstant</a>(IntegerValue <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, IntegerValue coeff);</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> expr, IntegerValue coeff);</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a49e8e4a987d39f4da335e1ed287bb8ad">AddLinearExpression</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a>& expr);</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a49e8e4a987d39f4da335e1ed287bb8ad">AddLinearExpression</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a>& expr, IntegerValue coeff);</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> </div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// Add literal * coeff to the constaint. Returns false and do nothing if the</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">// given literal didn't have an integer view.</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  ABSL_MUST_USE_RESULT <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a094a24aaf66d66b693e7e80a0222f040">AddLiteralTerm</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> lit, IntegerValue coeff);</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> </div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="comment">// Add an under linearization of the product of two affine expressions.</span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="comment">// If at least one of them is fixed, then we add the exact product (which is</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="comment">// linear). Otherwise, we use McCormick relaxation:</span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">// left * right = (left_min + delta_left) * (right_min + delta_right) =</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="comment">// left_min * right_min + delta_left * right_min +</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">// delta_right * left_min + delta_left * delta_right</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// which is >= (by ignoring the quatratic term)</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="comment">// right_min * left + left_min * right - right_min * left_min</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="comment">//</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="comment">// TODO(user): We could use (max - delta) instead of (min + delta) for each</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">// expression instead. This would depend on the LP value of the left and</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">// right.</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a7e251202babf951363efedbd30af45c5">AddQuadraticLowerBound</a>(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> left, <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> right,</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail);</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> </div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// Clears all added terms and constants. Keeps the original bounds.</span></div><div class="line"><a name="l00192"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#aa71d36872f416feaa853788a7a7a7ef8"> 192</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>() {</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  offset_ = IntegerValue(0);</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  terms_.clear();</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  }</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> </div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="comment">// Builds and returns the corresponding constraint in a canonical form.</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// All the IntegerVariable will be positive and appear in increasing index</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">// order.</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="comment">//</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="comment">// The bounds can be changed here or taken at construction.</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">//</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">// TODO(user): this doesn't invalidate the builder object, but if one wants</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="comment">// to do a lot of dynamic editing to the constraint, then then underlying</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="comment">// algorithm needs to be optimized for that.</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">Build</a>();</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a4d2ece710db2456bc8e887f57e09312a">BuildConstraint</a>(IntegerValue lb, IntegerValue ub);</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="comment">// Returns the linear expression part of the constraint only, without the</span></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="comment">// bounds.</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a> <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a96ececaa94026aaa3a46fb65df0a17a9">BuildExpression</a>();</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> </div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>& encoder_;</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keyword">const</span> IntegerValue lb_;</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keyword">const</span> IntegerValue ub_;</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>  IntegerValue offset_ = IntegerValue(0);</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> </div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="comment">// Initially we push all AddTerm() here, and during Build() we merge terms</span></div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="comment">// on the same variable.</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  std::vector<std::pair<IntegerVariable, IntegerValue>> terms_;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> };</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> </div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="comment">// Returns the activity of the given constraint. That is the current value of</span></div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="comment">// the linear terms.</span></div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="keywordtype">double</span> <a class="code" href="namespaceoperations__research_1_1sat.html#aea18a909121c1c2ba4a818298611f0b2">ComputeActivity</a>(</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keyword">const</span> LinearConstraint& constraint,</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& values);</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> </div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <span class="comment">// Returns sqrt(sum square(coeff)).</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="keywordtype">double</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a89bc8a9319a176bb809f209617fa10ca">ComputeL2Norm</a>(<span class="keyword">const</span> LinearConstraint& constraint);</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">// Returns the maximum absolute value of the coefficients.</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> IntegerValue <a class="code" href="namespaceoperations__research_1_1sat.html#acb294633c7688f918623b3b0e09aec43">ComputeInfinityNorm</a>(<span class="keyword">const</span> LinearConstraint& constraint);</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> </div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> <span class="comment">// Returns the scalar product of given constraint coefficients. This method</span></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="comment">// assumes that the constraint variables are in sorted order.</span></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="keywordtype">double</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a58fbc2d7f414974dcb10768e6ffdf68e">ScalarProduct</a>(<span class="keyword">const</span> LinearConstraint& constraint1,</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keyword">const</span> LinearConstraint& constraint2);</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">// Computes the GCD of the constraint coefficient, and divide them by it. This</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> <span class="comment">// also tighten the constraint bounds assumming all the variables are integer.</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#ae3c495e2e05950c578b01976701f9b2a">DivideByGCD</a>(LinearConstraint* constraint);</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> </div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="comment">// Removes the entries with a coefficient of zero.</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a4393db2c15b2f92d7ef16ce6b38c8150">RemoveZeroTerms</a>(LinearConstraint* constraint);</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> </div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="comment">// Makes all coefficients positive by transforming a variable to its negation.</span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a5d3aa6734674f8f81aac3895cde58d6d">MakeAllCoefficientsPositive</a>(LinearConstraint* constraint);</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> <span class="comment">// Makes all variables "positive" by transforming a variable to its negation.</span></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#aa2ba15be9aeabce0142c726fbf880798">MakeAllVariablesPositive</a>(LinearConstraint* constraint);</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> </div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment">// Sorts the terms and makes all IntegerVariable positive. This assumes that a</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="comment">// variable or its negation only appear once.</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="comment">//</span></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="comment">// Note that currently this allocates some temporary memory.</span></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a6b1886825a71bbbe156439e2e1dacbc2">CanonicalizeConstraint</a>(LinearConstraint* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> </div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment">// Returns false if duplicate variables are found in ct.</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a7e57f3af8ac7a8b8030adb1019cf2b44">NoDuplicateVariable</a>(<span class="keyword">const</span> LinearConstraint& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> </div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="comment">// Sorts and merges duplicate IntegerVariable in the given "terms".</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span> <span class="comment">// Fills the given LinearConstraint or LinearExpression with the result.</span></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="comment">//</span></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="comment">// TODO(user): This actually only sort the terms, we don't clean them.</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="keyword">template</span> <<span class="keyword">class</span> ClassWithVarsAndCoeffs></div><div class="line"><a name="l00269"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#acfd1b85de3d066337a1680996726c769"> 269</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#acfd1b85de3d066337a1680996726c769">CleanTermsAndFillConstraint</a>(</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  std::vector<std::pair<IntegerVariable, IntegerValue>>* terms,</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  ClassWithVarsAndCoeffs* output) {</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  output->vars.clear();</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  output->coeffs.clear();</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> </div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">// Sort and add coeff of duplicate variables. Note that a variable and</span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// its negation will appear one after another in the natural order.</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  std::sort(terms->begin(), terms->end());</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  IntegerVariable previous_var = <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>;</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  IntegerValue current_coeff(0);</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair<IntegerVariable, IntegerValue> entry : *terms) {</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keywordflow">if</span> (previous_var == entry.first) {</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  current_coeff += entry.second;</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (previous_var == <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(entry.first)) {</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  current_coeff -= entry.second;</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">if</span> (current_coeff != 0) {</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  output->vars.push_back(previous_var);</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  output->coeffs.push_back(current_coeff);</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>  previous_var = entry.first;</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  current_coeff = entry.second;</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  }</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  }</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">if</span> (current_coeff != 0) {</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  output->vars.push_back(previous_var);</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  output->coeffs.push_back(current_coeff);</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> }</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> </div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span> } <span class="comment">// namespace sat</span></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> } <span class="comment">// namespace operations_research</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> </div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> <span class="preprocessor">#endif // OR_TOOLS_SAT_LINEAR_CONSTRAINT_H_</span></div><div class="ttc" id="structoperations__research_1_1sat_1_1_linear_constraint_html_a2f5112deb5776f95a5e0902fad467e2b"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#a2f5112deb5776f95a5e0902fad467e2b">operations_research::sat::LinearConstraint::ClearTerms</a></div><div class="ttdeci">void ClearTerms()</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00052">sat/linear_constraint.h:52</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a8b7508824efeabdd4dfd00ab39bfb969"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8b7508824efeabdd4dfd00ab39bfb969">operations_research::sat::GetCoefficient</a></div><div class="ttdeci">IntegerValue GetCoefficient(const IntegerVariable var, const LinearExpression &expr)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00419">sat/linear_constraint.cc:419</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_linear_constraint_html_ad65ddc0d04d71006a9ebe3b9dcfe2ce6"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">operations_research::sat::LinearConstraint::AddTerm</a></div><div class="ttdeci">void AddTerm(IntegerVariable var, IntegerValue coeff)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00042">sat/linear_constraint.h:42</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a89bc8a9319a176bb809f209617fa10ca"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a89bc8a9319a176bb809f209617fa10ca">operations_research::sat::ComputeL2Norm</a></div><div class="ttdeci">double ComputeL2Norm(const LinearConstraint &constraint)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00151">sat/linear_constraint.cc:151</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="structoperations__research_1_1sat_1_1_linear_constraint_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::sat::LinearConstraint::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00047">sat/linear_constraint.h:47</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="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="classoperations__research_1_1sat_1_1_linear_constraint_builder_html_a49e8e4a987d39f4da335e1ed287bb8ad"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a49e8e4a987d39f4da335e1ed287bb8ad">operations_research::sat::LinearConstraintBuilder::AddLinearExpression</a></div><div class="ttdeci">void AddLinearExpression(const LinearExpression &expr)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00051">sat/linear_constraint.cc:51</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a429d1fd54b5becc39e4cfbc608d7d70a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a429d1fd54b5becc39e4cfbc608d7d70a">operations_research::sat::IntegerTermDebugString</a></div><div class="ttdeci">std::string IntegerTermDebugString(IntegerVariable var, IntegerValue coeff)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00153">integer.h:153</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_builder_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::sat::LinearConstraintBuilder::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00192">sat/linear_constraint.h:192</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="namespaceoperations__research_1_1sat_html_a4ff205ed5a074bbe499b1fa20da1dd9b"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a4ff205ed5a074bbe499b1fa20da1dd9b">operations_research::sat::PositiveVarExpr</a></div><div class="ttdeci">LinearExpression PositiveVarExpr(const LinearExpression &expr)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00404">sat/linear_constraint.cc:404</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_builder_html_ad65ddc0d04d71006a9ebe3b9dcfe2ce6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">operations_research::sat::LinearConstraintBuilder::AddTerm</a></div><div class="ttdeci">void AddTerm(IntegerVariable var, IntegerValue coeff)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00025">sat/linear_constraint.cc:25</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_linear_constraint_builder_html_a094a24aaf66d66b693e7e80a0222f040"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a094a24aaf66d66b693e7e80a0222f040">operations_research::sat::LinearConstraintBuilder::AddLiteralTerm</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool AddLiteralTerm(Literal lit, IntegerValue coeff)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00090">sat/linear_constraint.cc:90</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_builder_html_ac4f3463a3a8c65c17b54653af8aaba1f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ac4f3463a3a8c65c17b54653af8aaba1f">operations_research::sat::LinearConstraintBuilder::LinearConstraintBuilder</a></div><div class="ttdeci">LinearConstraintBuilder(const Model *model, IntegerValue lb, IntegerValue ub)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00162">sat/linear_constraint.h:162</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a5d3aa6734674f8f81aac3895cde58d6d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5d3aa6734674f8f81aac3895cde58d6d">operations_research::sat::MakeAllCoefficientsPositive</a></div><div class="ttdeci">void MakeAllCoefficientsPositive(LinearConstraint *constraint)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00233">sat/linear_constraint.cc:233</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_linear_expression_html_aa9c149604bc3f558e14c6d233ebc4b19"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">operations_research::sat::LinearExpression::LpValue</a></div><div class="ttdeci">double LpValue(const absl::StrongVector< IntegerVariable, double > &lp_values) const</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00255">sat/linear_constraint.cc:255</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_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="namespaceoperations__research_1_1sat_html_a5ec390fe1c25c7af4de7a30f84a0cd27"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5ec390fe1c25c7af4de7a30f84a0cd27">operations_research::sat::CanonicalizeExpr</a></div><div class="ttdeci">LinearExpression CanonicalizeExpr(const LinearExpression &expr)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00333">sat/linear_constraint.cc:333</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aea18a909121c1c2ba4a818298611f0b2"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aea18a909121c1c2ba4a818298611f0b2">operations_research::sat::ComputeActivity</a></div><div class="ttdeci">double ComputeActivity(const LinearConstraint &constraint, const absl::StrongVector< IntegerVariable, double > &values)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00139">sat/linear_constraint.cc:139</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="namespaceoperations__research_1_1sat_html_ae3c495e2e05950c578b01976701f9b2a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae3c495e2e05950c578b01976701f9b2a">operations_research::sat::DivideByGCD</a></div><div class="ttdeci">void DivideByGCD(LinearConstraint *constraint)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00206">sat/linear_constraint.cc:206</a></div></div>
|
|
<div class="ttc" id="strong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_builder_html_a4d2ece710db2456bc8e887f57e09312a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a4d2ece710db2456bc8e887f57e09312a">operations_research::sat::LinearConstraintBuilder::BuildConstraint</a></div><div class="ttdeci">LinearConstraint BuildConstraint(IntegerValue lb, IntegerValue ub)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00123">sat/linear_constraint.cc:123</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_linear_constraint_html_a73a9ecb4187cf067b6d89210083109aa"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73a9ecb4187cf067b6d89210083109aa">operations_research::sat::LinearConstraint::LinearConstraint</a></div><div class="ttdeci">LinearConstraint()</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00039">sat/linear_constraint.h:39</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_encoder_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html">operations_research::sat::IntegerEncoder</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00356">integer.h:356</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_acb294633c7688f918623b3b0e09aec43"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#acb294633c7688f918623b3b0e09aec43">operations_research::sat::ComputeInfinityNorm</a></div><div class="ttdeci">IntegerValue ComputeInfinityNorm(const LinearConstraint &constraint)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00159">sat/linear_constraint.cc:159</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_linear_constraint_html_a872f8136841759147bb8120aca72fa0d"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#a872f8136841759147bb8120aca72fa0d">operations_research::sat::LinearConstraint::LinearConstraint</a></div><div class="ttdeci">LinearConstraint(IntegerValue _lb, IntegerValue _ub)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00040">sat/linear_constraint.h:40</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html">operations_research::sat::IntegerTrail</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00613">integer.h:613</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_linear_expression_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_expression.html#a764be64f3029f8b8e23511061d8de355">operations_research::sat::LinearExpression::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00281">sat/linear_constraint.cc:281</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_linear_constraint_html_a4bd9f4d170b09ddbfb93957c70caee79"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4bd9f4d170b09ddbfb93957c70caee79">operations_research::sat::LinearConstraint::operator==</a></div><div class="ttdeci">bool operator==(const LinearConstraint other) const</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00072">sat/linear_constraint.h:72</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_linear_constraint_builder_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">operations_research::sat::LinearConstraintBuilder</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00153">sat/linear_constraint.h:153</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a0c5d040da1879626549b8877fa275d86"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0c5d040da1879626549b8877fa275d86">operations_research::sat::ValidateLinearConstraintForOverflow</a></div><div class="ttdeci">bool ValidateLinearConstraintForOverflow(const LinearConstraint &constraint, const IntegerTrail &integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00370">sat/linear_constraint.cc:370</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a58fbc2d7f414974dcb10768e6ffdf68e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a58fbc2d7f414974dcb10768e6ffdf68e">operations_research::sat::ScalarProduct</a></div><div class="ttdeci">double ScalarProduct(const LinearConstraint &constraint1, const LinearConstraint &constraint2)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00167">sat/linear_constraint.cc:167</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="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_a6b1886825a71bbbe156439e2e1dacbc2"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a6b1886825a71bbbe156439e2e1dacbc2">operations_research::sat::CanonicalizeConstraint</a></div><div class="ttdeci">void CanonicalizeConstraint(LinearConstraint *ct)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00299">sat/linear_constraint.cc:299</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_linear_expression_html_a155597f12e920a6ff8256360ed91d061"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_expression.html#a155597f12e920a6ff8256360ed91d061">operations_research::sat::LinearExpression::Min</a></div><div class="ttdeci">IntegerValue Min(IntegerTrail *integer_trail) const</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00273">sat/linear_constraint.cc:273</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="classabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector< IntegerVariable, double ></a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_builder_html_a322657f18d11f256cf3e03b0bd640d5a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a322657f18d11f256cf3e03b0bd640d5a">operations_research::sat::LinearConstraintBuilder::AddConstant</a></div><div class="ttdeci">void AddConstant(IntegerValue value)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00086">sat/linear_constraint.cc:86</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_acfd1b85de3d066337a1680996726c769"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#acfd1b85de3d066337a1680996726c769">operations_research::sat::CleanTermsAndFillConstraint</a></div><div class="ttdeci">void CleanTermsAndFillConstraint(std::vector< std::pair< IntegerVariable, IntegerValue >> *terms, ClassWithVarsAndCoeffs *output)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00269">sat/linear_constraint.h:269</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_builder_html_a8ef32d79f50eb45bb9305c8b436cf6c4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">operations_research::sat::LinearConstraintBuilder::Build</a></div><div class="ttdeci">LinearConstraint Build()</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00119">sat/linear_constraint.cc:119</a></div></div>
|
|
<div class="ttc" id="integer_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a5bd8c44473618b7eafd33ba978db2f06"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">operations_research::sat::kNoIntegerVariable</a></div><div class="ttdeci">const IntegerVariable kNoIntegerVariable(-1)</div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_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="classoperations__research_1_1sat_1_1_linear_constraint_builder_html_a430818c3ef05f66283bb2e83e29e5df6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a430818c3ef05f66283bb2e83e29e5df6">operations_research::sat::LinearConstraintBuilder::LinearConstraintBuilder</a></div><div class="ttdeci">LinearConstraintBuilder(const Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00160">sat/linear_constraint.h:160</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a15ca399ada8a279dc92f693ede7e4004"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a15ca399ada8a279dc92f693ede7e4004">operations_research::sat::operator<<</a></div><div class="ttdeci">std::ostream & operator<<(std::ostream &os, const BoolVar &var)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8cc_source.html#l00086">cp_model.cc:86</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="classoperations__research_1_1sat_1_1_linear_constraint_builder_html_a96ececaa94026aaa3a46fb65df0a17a9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a96ececaa94026aaa3a46fb65df0a17a9">operations_research::sat::LinearConstraintBuilder::BuildExpression</a></div><div class="ttdeci">LinearExpression BuildExpression()</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00132">sat/linear_constraint.cc:132</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aa2ba15be9aeabce0142c726fbf880798"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa2ba15be9aeabce0142c726fbf880798">operations_research::sat::MakeAllVariablesPositive</a></div><div class="ttdeci">void MakeAllVariablesPositive(LinearConstraint *constraint)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00244">sat/linear_constraint.cc:244</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_linear_expression_html_a2f3cf45fe97c9a855645ff69bf528a6b"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_expression.html#a2f3cf45fe97c9a855645ff69bf528a6b">operations_research::sat::LinearExpression::LevelZeroMin</a></div><div class="ttdeci">IntegerValue LevelZeroMin(IntegerTrail *integer_trail) const</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00264">sat/linear_constraint.cc:264</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_linear_constraint_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#a764be64f3029f8b8e23511061d8de355">operations_research::sat::LinearConstraint::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00057">sat/linear_constraint.h:57</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="namespaceoperations__research_1_1sat_html_a4393db2c15b2f92d7ef16ce6b38c8150"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a4393db2c15b2f92d7ef16ce6b38c8150">operations_research::sat::RemoveZeroTerms</a></div><div class="ttdeci">void RemoveZeroTerms(LinearConstraint *constraint)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00220">sat/linear_constraint.cc:220</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_linear_constraint_builder_html_a7e251202babf951363efedbd30af45c5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a7e251202babf951363efedbd30af45c5">operations_research::sat::LinearConstraintBuilder::AddQuadraticLowerBound</a></div><div class="ttdeci">void AddQuadraticLowerBound(AffineExpression left, AffineExpression right, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00069">sat/linear_constraint.cc:69</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ab7b2c273b19bf885462dfa04611e4e62"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab7b2c273b19bf885462dfa04611e4e62">operations_research::sat::GetCoefficientOfPositiveVar</a></div><div class="ttdeci">IntegerValue GetCoefficientOfPositiveVar(const IntegerVariable var, const LinearExpression &expr)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00431">sat/linear_constraint.cc:431</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a7e57f3af8ac7a8b8030adb1019cf2b44"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7e57f3af8ac7a8b8030adb1019cf2b44">operations_research::sat::NoDuplicateVariable</a></div><div class="ttdeci">bool NoDuplicateVariable(const LinearConstraint &ct)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00320">sat/linear_constraint.cc:320</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="sat_2linear__constraint_8h.html">linear_constraint.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>
|