518 lines
102 KiB
HTML
518 lines
102 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.2"/>
|
|
<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>
|
|
<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.9.2 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('cumulative_8cc_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">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 id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include "<a class="code" href="cumulative_8h.html">ortools/sat/cumulative.h</a>"</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span> </div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span> </div>
|
|
<div class="line"><a id="l00019" 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 id="l00020" 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 id="l00021" 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 id="l00022" 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 id="l00023" 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 id="l00024" 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 id="l00025" 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 id="l00026" 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 id="l00027" 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 id="l00028" 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 id="l00029" 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 id="l00030" 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 id="l00031" name="l00031"></a><span class="lineno"> 31</span> </div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> </div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a615085331bd86d852e84f75fcadbeaa1"> 35</a></span>std::function<void(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a615085331bd86d852e84f75fcadbeaa1">Cumulative</a>(</div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">const</span> std::vector<IntervalVariable>& vars,</div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <span class="keyword">const</span> std::vector<AffineExpression>& demands, <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>,</div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper) {</div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="keywordflow">return</span> [=](<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) <span class="keyword">mutable</span> {</div>
|
|
<div class="line"><a id="l00040" 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 id="l00041" name="l00041"></a><span class="lineno"> 41</span> </div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="keyword">auto</span>* intervals = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>>();</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="keyword">auto</span>* encoder = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>();</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="keyword">auto</span>* integer_trail = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keyword">auto</span>* watcher = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>();</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> </div>
|
|
<div class="line"><a id="l00047" 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 id="l00048" 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 id="l00049" 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 id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// filter the capacity variable very well.</span></div>
|
|
<div class="line"><a id="l00051" 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 id="l00052" 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 id="l00053" name="l00053"></a><span class="lineno"> 53</span> </div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">LinearConstraintBuilder</a> builder(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>, IntegerValue(0));</div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> builder.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(demands[i], IntegerValue(1));</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> builder.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(<a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, IntegerValue(-1));</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = builder.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">Build</a>();</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> </div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> std::vector<Literal> enforcement_literals;</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keywordflow">if</span> (intervals->IsOptional(vars[i])) {</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> enforcement_literals.push_back(intervals->PresenceLiteral(vars[i]));</div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> }</div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> </div>
|
|
<div class="line"><a id="l00064" 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 id="l00065" 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 id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="comment">// for this.</span></div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keywordflow">if</span> (intervals->MinSize(vars[i]) == 0) {</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> enforcement_literals.push_back(encoder->GetOrCreateAssociatedLiteral(</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> intervals->Size(vars[i]).GreaterOrEqual(IntegerValue(1))));</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> }</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> </div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keywordflow">if</span> (enforcement_literals.empty()) {</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a85f779432cdf63a07905deaae7fd0041">LoadLinearConstraint</a>(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a4b4da650bfcb86c00bee1df0ab0cc953">LoadConditionalLinearConstraint</a>(enforcement_literals, <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> }</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> }</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> </div>
|
|
<div class="line"><a id="l00079" 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 id="l00080" name="l00080"></a><span class="lineno"> 80</span> </div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>& <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a> = *(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>());</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> </div>
|
|
<div class="line"><a id="l00083" 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 id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="comment">// Disjunctive() constraint over them.</span></div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a9833365f24d44f8f84dcf777d8462e59">use_disjunctive_constraint_in_cumulative_constraint</a>()) {</div>
|
|
<div class="line"><a id="l00086" 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 id="l00087" 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 id="l00088" 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 id="l00089" 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 id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// handling of interval with size zero.</span></div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="comment">// TODO(user): improve the condition (see CL147454185).</span></div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> std::vector<IntervalVariable> in_disjunction;</div>
|
|
<div class="line"><a id="l00094" 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 id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="keywordflow">if</span> (intervals->MinSize(vars[i]) > 0 &&</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> 2 * integer_trail->LowerBound(demands[i]) ></div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> integer_trail->UpperBound(<a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>)) {</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> in_disjunction.push_back(vars[i]);</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> }</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> }</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> </div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="comment">// Add a disjunctive constraint on the intervals in in_disjunction. Do not</span></div>
|
|
<div class="line"><a id="l00103" 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 id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00105" 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 id="l00106" 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 id="l00107" 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 id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="comment">// propagation code.</span></div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00110" 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 id="l00111" 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 id="l00112" 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 id="l00113" 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 id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// decision on such Boolean.</span></div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00116" 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 id="l00117" 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 id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="keywordflow">if</span> (in_disjunction.size() > 1) <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a93f88f728c3591678a7052bb92ee53d0">Disjunctive</a>(in_disjunction));</div>
|
|
<div class="line"><a id="l00119" 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 id="l00120" name="l00120"></a><span class="lineno"> 120</span> }</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> </div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keywordflow">if</span> (helper == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> helper = <span class="keyword">new</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>(vars, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(helper);</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> }</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> </div>
|
|
<div class="line"><a id="l00127" 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 id="l00128" 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 id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="comment">// propagate it.</span></div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00131" 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 id="l00132" 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 id="l00133" 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 id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="comment">// instances.</span></div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00136" 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 id="l00137" 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 id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00139" 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 id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="comment">// precedence propagator. Abstract more?</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> {</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> std::vector<IntegerVariable> index_to_end_vars;</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> std::vector<int> index_to_task;</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> std::vector<PrecedencesPropagator::IntegerPrecedences> before;</div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> index_to_end_vars.clear();</div>
|
|
<div class="line"><a id="l00146" 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 hl_function" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>(); ++t) {</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a>& end_exp = helper-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af6b67dbb2cdebc18af8a8660f7469aa9">Ends</a>()[t];</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> </div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// TODO(user): Handle generic affine relation?</span></div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="keywordflow">if</span> (end_exp.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a> == <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a> || end_exp.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_affine_expression.html#ad7d5fda7881b6c8fdc9d1e7a74ee4a2e">coeff</a> != 1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> index_to_end_vars.push_back(end_exp.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a>);</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> index_to_task.push_back(t);</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> }</div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>>()->ComputePrecedences(</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> index_to_end_vars, &before);</div>
|
|
<div class="line"><a id="l00156" 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 id="l00157" 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 id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = before[i].var;</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>);</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> </div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> IntegerValue min_offset = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> std::vector<int> subtasks;</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="keywordflow">for</span> (; i < size && before[i].var == <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>; ++i) {</div>
|
|
<div class="line"><a id="l00164" 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 id="l00165" name="l00165"></a><span class="lineno"> 165</span> subtasks.push_back(t);</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> </div>
|
|
<div class="line"><a id="l00167" 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 id="l00168" 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 id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="comment">// var >= task end + new_offset.</span></div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a>& end_exp = helper-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af6b67dbb2cdebc18af8a8660f7469aa9">Ends</a>()[t];</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> min_offset =</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_offset, before[i].offset - end_exp.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_affine_expression.html#a06a78ca452e0ab05313a836b024352f2">constant</a>);</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> }</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> </div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="keywordflow">if</span> (subtasks.size() > 1) {</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_cumulative_is_after_subset_constraint.html">CumulativeIsAfterSubsetConstraint</a>* constraint =</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="keyword">new</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_cumulative_is_after_subset_constraint.html">CumulativeIsAfterSubsetConstraint</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, min_offset, <a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>,</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> demands, subtasks,</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> integer_trail, helper);</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> constraint-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_cumulative_is_after_subset_constraint.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(watcher);</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(constraint);</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> }</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> }</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> }</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> </div>
|
|
<div class="line"><a id="l00186" 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 id="l00187" 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 id="l00188" 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 id="l00189" name="l00189"></a><span class="lineno"> 189</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html">TimeTablingPerTask</a>* time_tabling =</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="keyword">new</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html">TimeTablingPerTask</a>(demands, <a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, integer_trail, helper);</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> time_tabling-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(watcher);</div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(time_tabling);</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> </div>
|
|
<div class="line"><a id="l00194" 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 id="l00195" 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 id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a81961c06b643e701054c339479b09738">use_overload_checker_in_cumulative_constraint</a>()) {</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a05f04a0b896f5070619b4c8c7ef9a69e">AddCumulativeOverloadChecker</a>(demands, <a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, helper, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> }</div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> </div>
|
|
<div class="line"><a id="l00200" 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 id="l00201" 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 id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="comment">// maximum of the end variables,</span></div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#aa396f46518b6dd2abe9ffb68104d69b6">use_timetable_edge_finding_in_cumulative_constraint</a>()) {</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html">TimeTableEdgeFinding</a>* time_table_edge_finding =</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <span class="keyword">new</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html">TimeTableEdgeFinding</a>(demands, <a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, helper, integer_trail);</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> time_table_edge_finding-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(watcher);</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(time_table_edge_finding);</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> }</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> };</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span>}</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> </div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ab521107466b31efd0078a963cdc8d978"> 212</a></span>std::function<void(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ab521107466b31efd0078a963cdc8d978">CumulativeTimeDecomposition</a>(</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <span class="keyword">const</span> std::vector<IntervalVariable>& vars,</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="keyword">const</span> std::vector<AffineExpression>& demands, <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>,</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper) {</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="keywordflow">return</span> [=](<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a id="l00217" 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 id="l00218" name="l00218"></a><span class="lineno"> 218</span> </div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(integer_trail-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">IsFixed</a>(<a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>));</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> fixed_capacity(</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> integer_trail-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>).value());</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> </div>
|
|
<div class="line"><a id="l00224" 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 id="l00225" name="l00225"></a><span class="lineno"> 225</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* sat_solver = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>();</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>* encoder = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>();</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>* intervals = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>>();</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> </div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> std::vector<IntegerVariable> start_vars;</div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> std::vector<IntegerVariable> end_vars;</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> std::vector<IntegerValue> fixed_demands;</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> </div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < num_tasks; ++t) {</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> start_vars.push_back(intervals->StartVar(vars[t]));</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> end_vars.push_back(intervals->EndVar(vars[t]));</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(integer_trail-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">IsFixed</a>(demands[t]));</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> fixed_demands.push_back(integer_trail-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(demands[t]));</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> }</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> </div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="comment">// Compute time range.</span></div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> IntegerValue min_start = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> IntegerValue max_end = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a id="l00243" 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 id="l00244" name="l00244"></a><span class="lineno"> 244</span> min_start = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_start, integer_trail-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(start_vars[t]));</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> max_end = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_end, integer_trail-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(end_vars[t]));</div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> }</div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> </div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="keywordflow">for</span> (IntegerValue <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> = min_start; <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> < max_end; ++<a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>) {</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> std::vector<LiteralWithCoeff> literals_with_coeff;</div>
|
|
<div class="line"><a id="l00250" 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 id="l00251" name="l00251"></a><span class="lineno"> 251</span> sat_solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#adadc001cbdc7263b106fc5886b60ff39">Propagate</a>();</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a> = integer_trail-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(start_vars[t]);</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="sched__constraints_8cc.html#a368fa95d42fa4962a75cedd9df656694">end_max</a> = integer_trail-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(end_vars[t]);</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="sched__constraints_8cc.html#a368fa95d42fa4962a75cedd9df656694">end_max</a> <= <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> || <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> < <a class="code hl_variable" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a> || fixed_demands[t] == 0) {</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> }</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> </div>
|
|
<div class="line"><a id="l00258" 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 id="l00259" name="l00259"></a><span class="lineno"> 259</span> std::vector<Literal> consume_condition;</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> consume = <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a3cb95842130bc03177260ad20464bdbf">NewBooleanVariable</a>()), <span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> </div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> <span class="comment">// Task t consumes the resource at time if it is present.</span></div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> <span class="keywordflow">if</span> (intervals->IsOptional(vars[t])) {</div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> consume_condition.push_back(intervals->PresenceLiteral(vars[t]));</div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> }</div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> </div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="comment">// Task t overlaps time.</span></div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> consume_condition.push_back(encoder->GetOrCreateAssociatedLiteral(</div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <a class="code hl_function" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(start_vars[t], IntegerValue(<a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>))));</div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> consume_condition.push_back(encoder->GetOrCreateAssociatedLiteral(</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <a class="code hl_function" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(end_vars[t],</div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> IntegerValue(<a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> + 1))));</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> </div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aa6d55689d1854993da4a2e31c5539905">ReifiedBoolAnd</a>(consume_condition, consume));</div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> </div>
|
|
<div class="line"><a id="l00276" 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 id="l00277" name="l00277"></a><span class="lineno"> 277</span> <span class="comment">// boolean variable if the model is unsat.</span></div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="keywordflow">if</span> (sat_solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab">IsModelUnsat</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> </div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> literals_with_coeff.push_back(</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>(consume, <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>(fixed_demands[t].<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>())));</div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> }</div>
|
|
<div class="line"><a id="l00283" 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 id="l00284" name="l00284"></a><span class="lineno"> 284</span> sat_solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653">AddLinearConstraint</a>(<span class="keyword">false</span>, <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>(0), <span class="keyword">true</span>,</div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> fixed_capacity, &literals_with_coeff);</div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> </div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="comment">// Abort if UNSAT.</span></div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <span class="keywordflow">if</span> (sat_solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab">IsModelUnsat</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> }</div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> };</div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span>}</div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> </div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#adf06bba7c940f142f85307687dcdf744"> 293</a></span>std::function<void(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#adf06bba7c940f142f85307687dcdf744">CumulativeUsingReservoir</a>(</div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <span class="keyword">const</span> std::vector<IntervalVariable>& vars,</div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <span class="keyword">const</span> std::vector<AffineExpression>& demands, <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>,</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper) {</div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> <span class="keywordflow">return</span> [=](<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a id="l00298" 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 id="l00299" name="l00299"></a><span class="lineno"> 299</span> </div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> <span class="keyword">auto</span>* integer_trail = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> <span class="keyword">auto</span>* encoder = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>();</div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> <span class="keyword">auto</span>* intervals = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>>();</div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> </div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(integer_trail->IsFixed(<a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>));</div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> <span class="keyword">const</span> IntegerValue fixed_capacity(</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> integer_trail->UpperBound(<a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>).value());</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> </div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> std::vector<AffineExpression> times;</div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> std::vector<IntegerValue> deltas;</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> std::vector<Literal> presences;</div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> </div>
|
|
<div class="line"><a id="l00312" 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 id="l00313" 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 id="l00314" name="l00314"></a><span class="lineno"> 314</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(integer_trail->IsFixed(demands[t]));</div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> times.push_back(intervals->StartVar(vars[t]));</div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> deltas.push_back(integer_trail->LowerBound(demands[t]));</div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> times.push_back(intervals->EndVar(vars[t]));</div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> deltas.push_back(-integer_trail->LowerBound(demands[t]));</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> <span class="keywordflow">if</span> (intervals->IsOptional(vars[t])) {</div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> presences.push_back(intervals->PresenceLiteral(vars[t]));</div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> presences.push_back(intervals->PresenceLiteral(vars[t]));</div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> presences.push_back(encoder->GetTrueLiteral());</div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> presences.push_back(encoder->GetTrueLiteral());</div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> }</div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> }</div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a0291403b5e2a3a0e097e22cf962299ae">AddReservoirConstraint</a>(times, deltas, presences, 0, fixed_capacity.value(),</div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> };</div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span>}</div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> </div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span>} <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00491">base/logging.h:491</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00887">base/logging.h:887</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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 class="ttc" id="aclassoperations__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="aclassoperations__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="aclassoperations__research_1_1sat_1_1_integer_encoder_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html">operations_research::sat::IntegerEncoder</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00306">integer.h:306</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html">operations_research::sat::IntegerTrail</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00574">integer.h:574</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a523501d854b2ca8034d37c15e7c89117"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">operations_research::sat::IntegerTrail::IsFixed</a></div><div class="ttdeci">bool IsFixed(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01353">integer.h:1353</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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="aclassoperations__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="aclassoperations__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="aclassoperations__research_1_1sat_1_1_linear_constraint_builder_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">operations_research::sat::LinearConstraintBuilder</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00147">sat/linear_constraint.h:147</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_builder_html_a8ef32d79f50eb45bb9305c8b436cf6c4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">operations_research::sat::LinearConstraintBuilder::Build</a></div><div class="ttdeci">LinearConstraint Build()</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00154">sat/linear_constraint.cc:154</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_builder_html_ad65ddc0d04d71006a9ebe3b9dcfe2ce6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">operations_research::sat::LinearConstraintBuilder::AddTerm</a></div><div class="ttdeci">void AddTerm(IntegerVariable var, IntegerValue coeff)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00025">sat/linear_constraint.cc:25</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00065">sat_base.h:65</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00038">sat/model.h:38</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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="aclassoperations__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:348</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l06119">sat_parameters.pb.h:6119</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l06175">sat_parameters.pb.h:6175</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l06147">sat_parameters.pb.h:6147</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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="aclassoperations__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="aclassoperations__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="aclassoperations__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="aclassoperations__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:174</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_af6b67dbb2cdebc18af8a8660f7469aa9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af6b67dbb2cdebc18af8a8660f7469aa9">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="aclassoperations__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="aclassoperations__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="aclassoperations__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="aclassoperations__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="acp__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="acumulative_8h_html"><div class="ttname"><a href="cumulative_8h.html">cumulative.h</a></div></div>
|
|
<div class="ttc" id="acumulative__energy_8h_html"><div class="ttname"><a href="cumulative__energy_8h.html">cumulative_energy.h</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695"><div class="ttname"><a href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a></div><div class="ttdeci">const Constraint * ct</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
|
|
<div class="ttc" id="adisjunctive_8h_html"><div class="ttname"><a href="disjunctive_8h.html">disjunctive.h</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00273">gurobi_interface.cc:273</a></div></div>
|
|
<div class="ttc" id="aint__type_8h_html"><div class="ttname"><a href="int__type_8h.html">int_type.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__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="anamespaceoperations__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="anamespaceoperations__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="anamespaceoperations__research_1_1sat_html_a1227e67513602591fb959e35c9de66e8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">operations_research::sat::kMaxIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMaxIntegerValue(std::numeric_limits< IntegerValue::ValueType >::max() - 1)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__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="anamespaceoperations__research_1_1sat_html_a3cb95842130bc03177260ad20464bdbf"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3cb95842130bc03177260ad20464bdbf">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="anamespaceoperations__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#l00573">integer_expr.h:573</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a5bd8c44473618b7eafd33ba978db2f06"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">operations_research::sat::kNoIntegerVariable</a></div><div class="ttdeci">const IntegerVariable kNoIntegerVariable(-1)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a615085331bd86d852e84f75fcadbeaa1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a615085331bd86d852e84f75fcadbeaa1">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)</div><div class="ttdef"><b>Definition:</b> <a href="cumulative_8cc_source.html#l00035">cumulative.cc:35</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__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="anamespaceoperations__research_1_1sat_html_a93f88f728c3591678a7052bb92ee53d0"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a93f88f728c3591678a7052bb92ee53d0">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_8cc_source.html#l00030">disjunctive.cc:30</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aa6d55689d1854993da4a2e31c5539905"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa6d55689d1854993da4a2e31c5539905">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="anamespaceoperations__research_1_1sat_html_ab521107466b31efd0078a963cdc8d978"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab521107466b31efd0078a963cdc8d978">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)</div><div class="ttdef"><b>Definition:</b> <a href="cumulative_8cc_source.html#l00212">cumulative.cc:212</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_adf06bba7c940f142f85307687dcdf744"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#adf06bba7c940f142f85307687dcdf744">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)</div><div class="ttdef"><b>Definition:</b> <a href="cumulative_8cc_source.html#l00293">cumulative.cc:293</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="apb__constraint_8h_html"><div class="ttname"><a href="pb__constraint_8h.html">pb_constraint.h</a></div></div>
|
|
<div class="ttc" id="aprecedences_8h_html"><div class="ttname"><a href="precedences_8h.html">precedences.h</a></div></div>
|
|
<div class="ttc" id="aresource_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="arouting__flow_8cc_html_a2acb49f4df5288066c43610bede123ec"><div class="ttname"><a href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a></div><div class="ttdeci">int64_t capacity</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00151">routing_flow.cc:151</a></div></div>
|
|
<div class="ttc" id="asat_2linear__constraint_8h_html"><div class="ttname"><a href="sat_2linear__constraint_8h.html">linear_constraint.h</a></div></div>
|
|
<div class="ttc" id="asat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</a></div></div>
|
|
<div class="ttc" id="asat__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="asat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
|
|
<div class="ttc" id="asched__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="asched__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="astructoperations__research_1_1sat_1_1_affine_expression_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html">operations_research::sat::AffineExpression</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00220">integer.h:220</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_affine_expression_html_a06a78ca452e0ab05313a836b024352f2"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#a06a78ca452e0ab05313a836b024352f2">operations_research::sat::AffineExpression::constant</a></div><div class="ttdeci">IntegerValue constant</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00272">integer.h:272</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_affine_expression_html_ab6516f556b715738034b30d290c40214"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">operations_research::sat::AffineExpression::var</a></div><div class="ttdeci">IntegerVariable var</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00270">integer.h:270</a></div></div>
|
|
<div class="ttc" id="astructoperations__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="astructoperations__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="astructoperations__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="astructoperations__research_1_1sat_1_1_linear_constraint_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html">operations_research::sat::LinearConstraint</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00033">sat/linear_constraint.h:33</a></div></div>
|
|
<div class="ttc" id="astructoperations__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="atimetable_8h_html"><div class="ttname"><a href="timetable_8h.html">timetable.h</a></div></div>
|
|
<div class="ttc" id="atimetable__edgefinding_8h_html"><div class="ttname"><a href="timetable__edgefinding_8h.html">timetable_edgefinding.h</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.9.2 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|