189 lines
98 KiB
HTML
189 lines
98 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: cumulative.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<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.1</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('cumulative_8cc_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">cumulative.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="cumulative_8cc.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">#include "<a class="code" href="cumulative_8h.html">ortools/sat/cumulative.h</a>"</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <algorithm></span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <memory></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="int__type_8h.html">ortools/base/int_type.h</a>"</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="cumulative__energy_8h.html">ortools/sat/cumulative_energy.h</a>"</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="disjunctive_8h.html">ortools/sat/disjunctive.h</a>"</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="sat_2linear__constraint_8h.html">ortools/sat/linear_constraint.h</a>"</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="pb__constraint_8h.html">ortools/sat/pb_constraint.h</a>"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="precedences_8h.html">ortools/sat/precedences.h</a>"</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="sat__base_8h.html">ortools/sat/sat_base.h</a>"</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="sat__parameters_8pb_8h.html">ortools/sat/sat_parameters.pb.h</a>"</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="sat__solver_8h.html">ortools/sat/sat_solver.h</a>"</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="timetable_8h.html">ortools/sat/timetable.h</a>"</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="timetable__edgefinding_8h.html">ortools/sat/timetable_edgefinding.h</a>"</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">namespace </span>sat {</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> </div><div class="line"><a name="l00035"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ac76a5515ee62116e057ea8cff119cd2d"> 35</a></span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#ac6a1be9a6c43165f51a69d15c90d7567">Cumulative</a>(</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& vars,</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keyword">const</span> std::vector<AffineExpression>& demands, <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>,</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper) {</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) <span class="keyword">mutable</span> {</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordflow">if</span> (vars.empty()) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> </div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keyword">auto</span>* intervals = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>>();</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keyword">auto</span>* encoder = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>();</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keyword">auto</span>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keyword">auto</span>* watcher = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>();</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> </div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="comment">// Redundant constraints to ensure that the resource capacity is high enough</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="comment">// for each task. Also ensure that no task consumes more resource than what</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">// is available. This is useful because the subsequent propagators do not</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">// filter the capacity variable very well.</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < demands.size(); ++i) {</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">if</span> (intervals->MaxSize(vars[i]) == 0) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> </div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">LinearConstraintBuilder</a> builder(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>, IntegerValue(0));</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  builder.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(demands[i], IntegerValue(1));</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  builder.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, IntegerValue(-1));</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</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> = builder.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">Build</a>();</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  std::vector<Literal> enforcement_literals;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">if</span> (intervals->IsOptional(vars[i])) {</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  enforcement_literals.push_back(intervals->PresenceLiteral(vars[i]));</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  }</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> </div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">// If the interval can be of size zero, it currently do not count towards</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// the capacity. TODO(user): Change that since we have optional interval</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="comment">// for this.</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">if</span> (intervals->MinSize(vars[i]) == 0) {</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  enforcement_literals.push_back(encoder->GetOrCreateAssociatedLiteral(</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  intervals->Size(vars[i]).GreaterOrEqual(IntegerValue(1))));</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"> 72</span>  <span class="keywordflow">if</span> (enforcement_literals.empty()) {</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a85f779432cdf63a07905deaae7fd0041">LoadLinearConstraint</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a4b4da650bfcb86c00bee1df0ab0cc953">LoadConditionalLinearConstraint</a>(enforcement_literals, <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  }</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</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>  <span class="keywordflow">if</span> (vars.size() == 1) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>& <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a> = *(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>());</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> </div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// Detect a subset of intervals that needs to be in disjunction and add a</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// Disjunctive() constraint over them.</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a9833365f24d44f8f84dcf777d8462e59">use_disjunctive_constraint_in_cumulative_constraint</a>()) {</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// TODO(user): We need to exclude intervals that can be of size zero</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// because the disjunctive do not "ignore" them like the cumulative</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// does. That is, the interval [2,2) will be assumed to be in</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="comment">// disjunction with [1, 3) for instance. We need to uniformize the</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// handling of interval with size zero.</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">//</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">// TODO(user): improve the condition (see CL147454185).</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  std::vector<IntervalVariable> in_disjunction;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < vars.size(); ++i) {</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">if</span> (intervals->MinSize(vars[i]) > 0 &&</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  2 * integer_trail->LowerBound(demands[i]) ></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  integer_trail->UpperBound(<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>)) {</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  in_disjunction.push_back(vars[i]);</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  }</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</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">// Add a disjunctive constraint on the intervals in in_disjunction. Do not</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// create the cumulative at all when all intervals must be in disjunction.</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">//</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// TODO(user): Do proper experiments to see how beneficial this is, the</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// disjunctive will propagate more but is also using slower algorithms.</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// That said, this is more a question of optimizing the disjunctive</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// propagation code.</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">//</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="comment">// TODO(user): Another "known" idea is to detect pair of tasks that must</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="comment">// be in disjunction and to create a Boolean to indicate which one is</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">// before the other. It shouldn't change the propagation, but may result</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="comment">// in a faster one with smaller explanations, and the solver can also take</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">// decision on such Boolean.</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">//</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="comment">// TODO(user): A better place for stuff like this could be in the</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// presolver so that it is easier to disable and play with alternatives.</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">if</span> (in_disjunction.size() > 1) <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a6ff77d5023ff68e4bd9958c53c88a99b">Disjunctive</a>(in_disjunction));</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">if</span> (in_disjunction.size() == vars.size()) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  }</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">if</span> (helper == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  helper = <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>(vars, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(helper);</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  }</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> </div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">// For each variables that is after a subset of task ends (i.e. like a</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="comment">// makespan objective), we detect it and add a special constraint to</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="comment">// propagate it.</span></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="comment">//</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="comment">// TODO(user): Models that include the makespan as a special interval might</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="comment">// be better, but then not everyone does that. In particular this code</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="comment">// allows to have decent lower bound on the large cumulative minizinc</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="comment">// instances.</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="comment">//</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="comment">// TODO(user): this require the precedence constraints to be already loaded,</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="comment">// and there is no guarantee of that currently. Find a more robust way.</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">//</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">// TODO(user): There is a bit of code duplication with the disjunctive</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">// precedence propagator. Abstract more?</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  {</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  std::vector<IntegerVariable> index_to_end_vars;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  std::vector<int> index_to_task;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  std::vector<PrecedencesPropagator::IntegerPrecedences> before;</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  index_to_end_vars.clear();</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>(); ++t) {</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a>& end_exp = helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#affb6ad259bc1c6bd004308fb3b8a6b05">Ends</a>()[t];</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> </div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="comment">// TODO(user): Handle generic affine relation?</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">if</span> (end_exp.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a> == <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a> || end_exp.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#ad7d5fda7881b6c8fdc9d1e7a74ee4a2e">coeff</a> != 1) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  index_to_end_vars.push_back(end_exp.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a>);</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  index_to_task.push_back(t);</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  }</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>>()->ComputePrecedences(</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  index_to_end_vars, &before);</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = before.size();</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size;) {</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = before[i].var;</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>);</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> </div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  IntegerValue min_offset = <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  std::vector<int> subtasks;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">for</span> (; i < size && before[i].var == <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>; ++i) {</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> t = index_to_task[before[i].index];</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  subtasks.push_back(t);</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> </div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="comment">// We have var >= end_exp.var + offset, so</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">// var >= (end_exp.var + end_exp.cte) + (offset - end_exp.cte)</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">// var >= task end + new_offset.</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a>& end_exp = helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#affb6ad259bc1c6bd004308fb3b8a6b05">Ends</a>()[t];</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  min_offset =</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_offset, before[i].offset - end_exp.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a06a78ca452e0ab05313a836b024352f2">constant</a>);</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  }</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> </div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">if</span> (subtasks.size() > 1) {</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <a class="code" href="classoperations__research_1_1sat_1_1_cumulative_is_after_subset_constraint.html">CumulativeIsAfterSubsetConstraint</a>* constraint =</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_cumulative_is_after_subset_constraint.html">CumulativeIsAfterSubsetConstraint</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, min_offset, <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>,</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  demands, subtasks,</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  integer_trail, helper);</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  constraint-><a class="code" href="classoperations__research_1_1sat_1_1_cumulative_is_after_subset_constraint.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(watcher);</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(constraint);</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  }</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  }</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  }</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> </div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">// Propagator responsible for applying Timetabling filtering rule. It</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">// increases the minimum of the start variables, decrease the maximum of the</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">// end variables, and increase the minimum of the capacity variable.</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <a class="code" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html">TimeTablingPerTask</a>* time_tabling =</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html">TimeTablingPerTask</a>(demands, <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, integer_trail, helper);</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  time_tabling-><a class="code" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(watcher);</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(time_tabling);</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> </div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="comment">// Propagator responsible for applying the Overload Checking filtering rule.</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="comment">// It increases the minimum of the capacity variable.</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a81961c06b643e701054c339479b09738">use_overload_checker_in_cumulative_constraint</a>()) {</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a05f04a0b896f5070619b4c8c7ef9a69e">AddCumulativeOverloadChecker</a>(demands, <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  }</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> </div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="comment">// Propagator responsible for applying the Timetable Edge finding filtering</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="comment">// rule. It increases the minimum of the start variables and decreases the</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">// maximum of the end variables,</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#aa396f46518b6dd2abe9ffb68104d69b6">use_timetable_edge_finding_in_cumulative_constraint</a>()) {</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <a class="code" href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html">TimeTableEdgeFinding</a>* time_table_edge_finding =</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html">TimeTableEdgeFinding</a>(demands, <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, helper, integer_trail);</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  time_table_edge_finding-><a class="code" href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(watcher);</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(time_table_edge_finding);</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>  };</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> }</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> </div><div class="line"><a name="l00212"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a5c2ad9ca01a9711e9f60ff0efb4cb715"> 212</a></span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a08d3a66bfe2cb8c6cbf5b4d34b8a108a">CumulativeTimeDecomposition</a>(</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& vars,</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keyword">const</span> std::vector<AffineExpression>& demands, <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>,</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper) {</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">if</span> (vars.empty()) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> </div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">IsFixed</a>(<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>));</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> fixed_capacity(</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>).value());</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>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = vars.size();</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* sat_solver = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>();</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>* encoder = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>();</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>* intervals = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>>();</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> </div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  std::vector<IntegerVariable> start_vars;</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  std::vector<IntegerVariable> end_vars;</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  std::vector<IntegerValue> fixed_demands;</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> </div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < num_tasks; ++t) {</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  start_vars.push_back(intervals->StartVar(vars[t]));</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  end_vars.push_back(intervals->EndVar(vars[t]));</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">IsFixed</a>(demands[t]));</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  fixed_demands.push_back(integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(demands[t]));</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  }</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> </div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// Compute time range.</span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  IntegerValue min_start = <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  IntegerValue max_end = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < num_tasks; ++t) {</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  min_start = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_start, integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(start_vars[t]));</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  max_end = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_end, integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(end_vars[t]));</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  }</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> </div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">for</span> (IntegerValue <a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> = min_start; <a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> < max_end; ++<a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>) {</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  std::vector<LiteralWithCoeff> literals_with_coeff;</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < num_tasks; ++t) {</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#adadc001cbdc7263b106fc5886b60ff39">Propagate</a>();</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a> = integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(start_vars[t]);</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a368fa95d42fa4962a75cedd9df656694">end_max</a> = integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(end_vars[t]);</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a368fa95d42fa4962a75cedd9df656694">end_max</a> <= <a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> || <a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> < <a class="code" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a> || fixed_demands[t] == 0) {</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  }</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span> </div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="comment">// Task t consumes the resource at time if consume_condition is true.</span></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  std::vector<Literal> consume_condition;</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> consume = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a38766514ce4824ae1e093a25d7fb43b3">NewBooleanVariable</a>()), <span class="keyword">true</span>);</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> </div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="comment">// Task t consumes the resource at time if it is present.</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">if</span> (intervals->IsOptional(vars[t])) {</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  consume_condition.push_back(intervals->PresenceLiteral(vars[t]));</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  }</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="comment">// Task t overlaps time.</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  consume_condition.push_back(encoder->GetOrCreateAssociatedLiteral(</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(start_vars[t], IntegerValue(<a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>))));</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  consume_condition.push_back(encoder->GetOrCreateAssociatedLiteral(</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(end_vars[t],</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  IntegerValue(<a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> + 1))));</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> </div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#aa874aee040980146062498b87e8fb956">ReifiedBoolAnd</a>(consume_condition, consume));</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> </div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// TODO(user): this is needed because we currently can't create a</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">// boolean variable if the model is unsat.</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">if</span> (sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab">IsModelUnsat</a>()) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> </div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  literals_with_coeff.push_back(</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>(consume, <a class="code" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>(fixed_demands[t].<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>())));</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  }</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="comment">// The profile cannot exceed the capacity at time.</span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653">AddLinearConstraint</a>(<span class="keyword">false</span>, <a class="code" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>(0), <span class="keyword">true</span>,</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  fixed_capacity, &literals_with_coeff);</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span> </div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="comment">// Abort if UNSAT.</span></div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordflow">if</span> (sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab">IsModelUnsat</a>()) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  }</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  };</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> }</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> </div><div class="line"><a name="l00293"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a2e2502fc28f294768d8a4476f7f196d2"> 293</a></span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#ae3fb5eb64e131ee2f673a0fcd99b4be8">CumulativeUsingReservoir</a>(</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& vars,</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keyword">const</span> std::vector<AffineExpression>& demands, <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>,</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper) {</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">if</span> (vars.empty()) <span class="keywordflow">return</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="keyword">auto</span>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keyword">auto</span>* encoder = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>();</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keyword">auto</span>* intervals = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>>();</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> </div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(integer_trail->IsFixed(<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>));</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keyword">const</span> IntegerValue fixed_capacity(</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  integer_trail->UpperBound(<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>).value());</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> </div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  std::vector<AffineExpression> times;</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  std::vector<IntegerValue> deltas;</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  std::vector<Literal> presences;</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> </div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = vars.size();</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < num_tasks; ++t) {</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(integer_trail->IsFixed(demands[t]));</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  times.push_back(intervals->StartVar(vars[t]));</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  deltas.push_back(integer_trail->LowerBound(demands[t]));</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  times.push_back(intervals->EndVar(vars[t]));</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  deltas.push_back(-integer_trail->LowerBound(demands[t]));</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keywordflow">if</span> (intervals->IsOptional(vars[t])) {</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  presences.push_back(intervals->PresenceLiteral(vars[t]));</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  presences.push_back(intervals->PresenceLiteral(vars[t]));</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  presences.push_back(encoder->GetTrueLiteral());</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  presences.push_back(encoder->GetTrueLiteral());</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  }</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  }</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a0291403b5e2a3a0e097e22cf962299ae">AddReservoirConstraint</a>(times, deltas, presences, 0, fixed_capacity.value(),</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  };</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span> }</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> </div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span> } <span class="comment">// namespace sat</span></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="base_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00491">base/logging.h:491</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a38766514ce4824ae1e093a25d7fb43b3"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a38766514ce4824ae1e093a25d7fb43b3">operations_research::sat::NewBooleanVariable</a></div><div class="ttdeci">std::function< BooleanVariable(Model *)> NewBooleanVariable()</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01469">integer.h:1469</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_a81961c06b643e701054c339479b09738"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a81961c06b643e701054c339479b09738">operations_research::sat::SatParameters::use_overload_checker_in_cumulative_constraint</a></div><div class="ttdeci">bool use_overload_checker_in_cumulative_constraint() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l06115">sat_parameters.pb.h:6115</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a05f04a0b896f5070619b4c8c7ef9a69e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a05f04a0b896f5070619b4c8c7ef9a69e">operations_research::sat::AddCumulativeOverloadChecker</a></div><div class="ttdeci">void AddCumulativeOverloadChecker(const std::vector< AffineExpression > &demands, AffineExpression capacity, SchedulingConstraintHelper *helper, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="cumulative__energy_8cc_source.html#l00040">cumulative_energy.cc:40</a></div></div>
|
|
<div class="ttc" id="timetable_8h_html"><div class="ttname"><a href="timetable_8h.html">timetable.h</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="disjunctive_8h_html"><div class="ttname"><a href="disjunctive_8h.html">disjunctive.h</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="int__type_8h_html"><div class="ttname"><a href="int__type_8h.html">int_type.h</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_linear_constraint_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html">operations_research::sat::LinearConstraint</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00033">sat/linear_constraint.h:33</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html_a3e2eb445631727dd4abf1d5343f16b2f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">operations_research::sat::IntegerLiteral::LowerOrEqual</a></div><div class="ttdeci">static IntegerLiteral LowerOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01315">integer.h:1315</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aa874aee040980146062498b87e8fb956"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa874aee040980146062498b87e8fb956">operations_research::sat::ReifiedBoolAnd</a></div><div class="ttdeci">std::function< void(Model *)> ReifiedBoolAnd(const std::vector< Literal > &literals, Literal r)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00970">sat_solver.h:970</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_ab857cd2aead68952d9fe92a8ad8d3ac9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">operations_research::sat::IntegerTrail::LowerBound</a></div><div class="ttdeci">IntegerValue LowerBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01345">integer.h:1345</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_time_tabling_per_task_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::TimeTablingPerTask::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="timetable_8cc_source.html#l00314">timetable.cc:314</a></div></div>
|
|
<div class="ttc" id="sched__constraints_8cc_html_a826c744af066625acb241b17ae3e2be9"><div class="ttname"><a href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a></div><div class="ttdeci">Rev< int64_t > start_min</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00243">sched_constraints.cc:243</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#l00273">gurobi_interface.cc:273</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#l00065">sat_base.h:65</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_generic_literal_watcher_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">operations_research::sat::GenericLiteralWatcher</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01153">integer.h:1153</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="sat_2linear__constraint_8h_html"><div class="ttname"><a href="sat_2linear__constraint_8h.html">linear_constraint.h</a></div></div>
|
|
<div class="ttc" id="cumulative_8h_html"><div class="ttname"><a href="cumulative_8h.html">cumulative.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ae3fb5eb64e131ee2f673a0fcd99b4be8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae3fb5eb64e131ee2f673a0fcd99b4be8">operations_research::sat::CumulativeUsingReservoir</a></div><div class="ttdeci">std::function< void(Model *)> CumulativeUsingReservoir(const std::vector< IntervalVariable > &vars, const std::vector< AffineExpression > &demands, AffineExpression capacity, SchedulingConstraintHelper *helper=nullptr)</div><div class="ttdef"><b>Definition:</b> <a href="cumulative_8h_source.html#l00061">cumulative.h:61</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="cumulative__energy_8h_html"><div class="ttname"><a href="cumulative__energy_8h.html">cumulative_energy.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_encoder_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html">operations_research::sat::IntegerEncoder</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00306">integer.h:306</a></div></div>
|
|
<div class="ttc" id="sched__constraints_8cc_html_a368fa95d42fa4962a75cedd9df656694"><div class="ttname"><a href="sched__constraints_8cc.html#a368fa95d42fa4962a75cedd9df656694">end_max</a></div><div class="ttdeci">Rev< int64_t > end_max</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00246">sched_constraints.cc:246</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00887">base/logging.h:887</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_aa396f46518b6dd2abe9ffb68104d69b6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#aa396f46518b6dd2abe9ffb68104d69b6">operations_research::sat::SatParameters::use_timetable_edge_finding_in_cumulative_constraint</a></div><div class="ttdeci">bool use_timetable_edge_finding_in_cumulative_constraint() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l06143">sat_parameters.pb.h:6143</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_precedences_propagator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html">operations_research::sat::PrecedencesPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00052">precedences.h:52</a></div></div>
|
|
<div class="ttc" id="sat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
|
|
<div class="ttc" id="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#l00574">integer.h:574</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cumulative_is_after_subset_constraint_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cumulative_is_after_subset_constraint.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::CumulativeIsAfterSubsetConstraint::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="cumulative__energy_8cc_source.html#l00394">cumulative_energy.cc:394</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_adadc001cbdc7263b106fc5886b60ff39"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#adadc001cbdc7263b106fc5886b60ff39">operations_research::sat::SatSolver::Propagate</a></div><div class="ttdeci">bool Propagate()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l01623">sat_solver.cc:1623</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_affine_expression_html_a06a78ca452e0ab05313a836b024352f2"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#a06a78ca452e0ab05313a836b024352f2">operations_research::sat::AffineExpression::constant</a></div><div class="ttdeci">IntegerValue constant</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00272">integer.h:272</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a6ff77d5023ff68e4bd9958c53c88a99b"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a6ff77d5023ff68e4bd9958c53c88a99b">operations_research::sat::Disjunctive</a></div><div class="ttdeci">std::function< void(Model *)> Disjunctive(const std::vector< IntervalVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00039">disjunctive.h:39</a></div></div>
|
|
<div class="ttc" id="routing__flow_8cc_html_a2acb49f4df5288066c43610bede123ec"><div class="ttname"><a href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a></div><div class="ttdeci">int64_t capacity</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00151">routing_flow.cc:151</a></div></div>
|
|
<div class="ttc" id="precedences_8h_html"><div class="ttname"><a href="precedences_8h.html">precedences.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a05c49a95f6af6f8d873c96cae6ab6653"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653">operations_research::sat::SatSolver::AddLinearConstraint</a></div><div class="ttdeci">bool AddLinearConstraint(bool use_lower_bound, Coefficient lower_bound, bool use_upper_bound, Coefficient upper_bound, std::vector< LiteralWithCoeff > *cst)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00300">sat_solver.cc:300</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#l00220">integer.h:220</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#l00147">sat/linear_constraint.h:147</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_time_tabling_per_task_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html">operations_research::sat::TimeTablingPerTask</a></div><div class="ttdef"><b>Definition:</b> <a href="timetable_8h_source.html#l00104">timetable.h:104</a></div></div>
|
|
<div class="ttc" id="sat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_affine_expression_html_ab6516f556b715738034b30d290c40214"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">operations_research::sat::AffineExpression::var</a></div><div class="ttdeci">IntegerVariable var</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00270">integer.h:270</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html">operations_research::sat::SatSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00058">sat_solver.h:58</a></div></div>
|
|
<div class="ttc" id="sat__parameters_8pb_8h_html"><div class="ttname"><a href="sat__parameters_8pb_8h.html">sat_parameters.pb.h</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_affb6ad259bc1c6bd004308fb3b8a6b05"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#affb6ad259bc1c6bd004308fb3b8a6b05">operations_research::sat::SchedulingConstraintHelper::Ends</a></div><div class="ttdeci">const std::vector< AffineExpression > & Ends() const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00337">intervals.h:337</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_affine_expression_html_ad7d5fda7881b6c8fdc9d1e7a74ee4a2e"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#ad7d5fda7881b6c8fdc9d1e7a74ee4a2e">operations_research::sat::AffineExpression::coeff</a></div><div class="ttdeci">IntegerValue coeff</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00271">integer.h:271</a></div></div>
|
|
<div class="ttc" id="timetable__edgefinding_8h_html"><div class="ttname"><a href="timetable__edgefinding_8h.html">timetable_edgefinding.h</a></div></div>
|
|
<div class="ttc" id="pb__constraint_8h_html"><div class="ttname"><a href="pb__constraint_8h.html">pb_constraint.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1math__opt_html_ab61209db5b13f0d424da009e414298fc"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">operations_research::math_opt::Coefficient</a></div><div class="ttdeci">std::tuple< int64_t, int64_t, const double > Coefficient</div><div class="ttdef"><b>Definition:</b> <a href="sparse__collection__matchers_8h_source.html#l00061">sparse_collection_matchers.h:61</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">operations_research::sat::SchedulingConstraintHelper</a></div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00173">intervals.h:173</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a08d3a66bfe2cb8c6cbf5b4d34b8a108a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a08d3a66bfe2cb8c6cbf5b4d34b8a108a">operations_research::sat::CumulativeTimeDecomposition</a></div><div class="ttdeci">std::function< void(Model *)> CumulativeTimeDecomposition(const std::vector< IntervalVariable > &vars, const std::vector< AffineExpression > &demands, AffineExpression capacity, SchedulingConstraintHelper *helper=nullptr)</div><div class="ttdef"><b>Definition:</b> <a href="cumulative_8h_source.html#l00055">cumulative.h:55</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#l00154">sat/linear_constraint.cc:154</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_literal_with_coeff_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">operations_research::sat::LiteralWithCoeff</a></div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00050">pb_constraint.h:50</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ad9b4a962b743e358f3a7c4b2279f99c8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">operations_research::sat::SchedulingConstraintHelper::NumTasks</a></div><div class="ttdeci">int NumTasks() const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00204">intervals.h:204</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a0291403b5e2a3a0e097e22cf962299ae"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0291403b5e2a3a0e097e22cf962299ae">operations_research::sat::AddReservoirConstraint</a></div><div class="ttdeci">void AddReservoirConstraint(std::vector< AffineExpression > times, std::vector< IntegerValue > deltas, std::vector< Literal > presences, int64_t min_level, int64_t max_level, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="timetable_8cc_source.html#l00028">timetable.cc:28</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a8b6d5a25e6ad3d28a85b1924471e2cac"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">operations_research::sat::IntegerTrail::UpperBound</a></div><div class="ttdeci">IntegerValue UpperBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01349">integer.h:1349</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_time_table_edge_finding_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::TimeTableEdgeFinding::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="timetable__edgefinding_8cc_source.html#l00048">timetable_edgefinding.cc:48</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_ad2a33e1d9335cce63548abed6b5c8aab"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab">operations_research::sat::SatSolver::IsModelUnsat</a></div><div class="ttdeci">bool IsModelUnsat() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00137">sat_solver.h:137</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="resource_8cc_html_aee52de7b225665566aa47246b9d6b8fa"><div class="ttname"><a href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a></div><div class="ttdeci">int64_t time</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01691">resource.cc:1691</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html_a6c233aafac25ea66d69de93a83c9be63"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">operations_research::sat::IntegerLiteral::GreaterOrEqual</a></div><div class="ttdeci">static IntegerLiteral GreaterOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01309">integer.h:1309</a></div></div>
|
|
<div class="ttc" id="cp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a></div><div class="ttdeci">SatParameters parameters</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00116">cp_model_fz_solver.cc:116</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_time_table_edge_finding_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html">operations_research::sat::TimeTableEdgeFinding</a></div><div class="ttdef"><b>Definition:</b> <a href="timetable__edgefinding_8h_source.html#l00061">timetable_edgefinding.h:61</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html">operations_research::sat::SatParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00347">sat_parameters.pb.h:347</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_intervals_repository_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_intervals_repository.html">operations_research::sat::IntervalsRepository</a></div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00047">intervals.h:47</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a85f779432cdf63a07905deaae7fd0041"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a85f779432cdf63a07905deaae7fd0041">operations_research::sat::LoadLinearConstraint</a></div><div class="ttdeci">void LoadLinearConstraint(const ConstraintProto &ct, Model *m)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__loader_8cc_source.html#l01180">cp_model_loader.cc:1180</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_a9833365f24d44f8f84dcf777d8462e59"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a9833365f24d44f8f84dcf777d8462e59">operations_research::sat::SatParameters::use_disjunctive_constraint_in_cumulative_constraint</a></div><div class="ttdeci">bool use_disjunctive_constraint_in_cumulative_constraint() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l06171">sat_parameters.pb.h:6171</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a4b4da650bfcb86c00bee1df0ab0cc953"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a4b4da650bfcb86c00bee1df0ab0cc953">operations_research::sat::LoadConditionalLinearConstraint</a></div><div class="ttdeci">void LoadConditionalLinearConstraint(const absl::Span< const Literal > enforcement_literals, const LinearConstraint &cst, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00575">integer_expr.h:575</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_ac6a1be9a6c43165f51a69d15c90d7567"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ac6a1be9a6c43165f51a69d15c90d7567">operations_research::sat::Cumulative</a></div><div class="ttdeci">std::function< void(Model *)> Cumulative(const std::vector< IntervalVariable > &vars, const std::vector< AffineExpression > &demands, AffineExpression capacity, SchedulingConstraintHelper *helper=nullptr)</div><div class="ttdef"><b>Definition:</b> <a href="cumulative_8h_source.html#l00045">cumulative.h:45</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a523501d854b2ca8034d37c15e7c89117"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">operations_research::sat::IntegerTrail::IsFixed</a></div><div class="ttdeci">bool IsFixed(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01353">integer.h:1353</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_cumulative_is_after_subset_constraint_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cumulative_is_after_subset_constraint.html">operations_research::sat::CumulativeIsAfterSubsetConstraint</a></div><div class="ttdef"><b>Definition:</b> <a href="cumulative__energy_8h_source.html#l00083">cumulative_energy.h:83</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="cumulative_8cc.html">cumulative.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|