402 lines
71 KiB
HTML
402 lines
71 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.20"/>
|
|
<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">8.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.20 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('cumulative_8cc_source.html',''); 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 name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="cumulative_8h.html">ortools/sat/cumulative.h</a>"</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  </div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>  </div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include "<a class="code" href="int__type_8h.html">ortools/base/int_type.h</a>"</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="cumulative__energy_8h.html">ortools/sat/cumulative_energy.h</a>"</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="disjunctive_8h.html">ortools/sat/disjunctive.h</a>"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="linear__constraint_8h.html">ortools/sat/linear_constraint.h</a>"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="pb__constraint_8h.html">ortools/sat/pb_constraint.h</a>"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="precedences_8h.html">ortools/sat/precedences.h</a>"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="sat__base_8h.html">ortools/sat/sat_base.h</a>"</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="sat__parameters_8pb_8h.html">ortools/sat/sat_parameters.pb.h</a>"</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="sat__solver_8h.html">ortools/sat/sat_solver.h</a>"</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="timetable_8h.html">ortools/sat/timetable.h</a>"</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="timetable__edgefinding_8h.html">ortools/sat/timetable_edgefinding.h</a>"</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  </div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  </div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a615085331bd86d852e84f75fcadbeaa1"> 35</a></span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a615085331bd86d852e84f75fcadbeaa1">Cumulative</a>(</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& vars,</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keyword">const</span> std::vector<AffineExpression>& demands, <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>,</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper) {</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) <span class="keyword">mutable</span> {</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordflow">if</span> (vars.empty()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  </div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keyword">auto</span>* intervals = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>>();</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keyword">auto</span>* encoder = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>();</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keyword">auto</span>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keyword">auto</span>* watcher = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>();</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  </div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="comment">// Redundant constraints to ensure that the resource capacity is high enough</span></div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="comment">// for each task. Also ensure that no task consumes more resource than what</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">// is available. This is useful because the subsequent propagators do not</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">// filter the capacity variable very well.</span></div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < demands.size(); ++i) {</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">if</span> (intervals->MaxSize(vars[i]) == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  </div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">LinearConstraintBuilder</a> builder(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>, IntegerValue(0));</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  builder.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(demands[i], IntegerValue(1));</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  builder.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, IntegerValue(-1));</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = builder.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">Build</a>();</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  </div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  std::vector<Literal> enforcement_literals;</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">if</span> (intervals->IsOptional(vars[i])) {</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  enforcement_literals.push_back(intervals->IsPresentLiteral(vars[i]));</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  }</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  </div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">// If the interval can be of size zero, it currently do not count towards</span></div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// the capacity. TODO(user): Change that since we have optional interval</span></div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="comment">// for this.</span></div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">if</span> (intervals->MinSize(vars[i]) == 0) {</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  enforcement_literals.push_back(encoder->GetOrCreateAssociatedLiteral(</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(intervals->SizeVar(vars[i]),</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  IntegerValue(1))));</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  }</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  </div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">if</span> (enforcement_literals.empty()) {</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a85f779432cdf63a07905deaae7fd0041">LoadLinearConstraint</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a4b4da650bfcb86c00bee1df0ab0cc953">LoadConditionalLinearConstraint</a>(enforcement_literals, <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  }</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  }</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  </div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span> (vars.size() == 1) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  </div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keyword">const</span> SatParameters& <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a> = *(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<SatParameters>());</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  </div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// Detect a subset of intervals that needs to be in disjunction and add a</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">// Disjunctive() constraint over them.</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.use_disjunctive_constraint_in_cumulative_constraint()) {</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// TODO(user): We need to exclude intervals that can be of size zero</span></div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// because the disjunctive do not "ignore" them like the cumulative</span></div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="comment">// does. That is, the interval [2,2) will be assumed to be in</span></div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// disjunction with [1, 3) for instance. We need to uniformize the</span></div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// handling of interval with size zero.</span></div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// TODO(user): improve the condition (see CL147454185).</span></div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  std::vector<IntervalVariable> in_disjunction;</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < vars.size(); ++i) {</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">if</span> (intervals->MinSize(vars[i]) > 0 &&</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  2 * integer_trail->LowerBound(demands[i]) ></div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  integer_trail->UpperBound(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>)) {</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  in_disjunction.push_back(vars[i]);</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  }</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  </div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// Add a disjunctive constraint on the intervals in in_disjunction. Do not</span></div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// create the cumulative at all when all intervals must be in disjunction.</span></div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// TODO(user): Do proper experiments to see how beneficial this is, the</span></div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// disjunctive will propagate more but is also using slower algorithms.</span></div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// That said, this is more a question of optimizing the disjunctive</span></div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">// propagation code.</span></div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="comment">// TODO(user): Another "known" idea is to detect pair of tasks that must</span></div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">// be in disjunction and to create a Boolean to indicate which one is</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="comment">// before the other. It shouldn't change the propagation, but may result</span></div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">// in a faster one with smaller explanations, and the solver can also take</span></div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">// decision on such Boolean.</span></div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// TODO(user): A better place for stuff like this could be in the</span></div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="comment">// presolver so that it is easier to disable and play with alternatives.</span></div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">if</span> (in_disjunction.size() > 1) <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a93f88f728c3591678a7052bb92ee53d0">Disjunctive</a>(in_disjunction));</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">if</span> (in_disjunction.size() == vars.size()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  }</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  </div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordflow">if</span> (helper == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  helper = <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>(vars, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(helper);</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  }</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  </div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="comment">// Propagator responsible for applying Timetabling filtering rule. It</span></div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="comment">// increases the minimum of the start variables, decrease the maximum of the</span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="comment">// end variables, and increase the minimum of the capacity variable.</span></div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <a class="code" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html">TimeTablingPerTask</a>* time_tabling =</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html">TimeTablingPerTask</a>(demands, <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, integer_trail, helper);</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  time_tabling-><a class="code" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(watcher);</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(time_tabling);</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  </div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="comment">// Propagator responsible for applying the Overload Checking filtering rule.</span></div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="comment">// It increases the minimum of the capacity variable.</span></div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.use_overload_checker_in_cumulative_constraint()) {</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a05f04a0b896f5070619b4c8c7ef9a69e">AddCumulativeOverloadChecker</a>(demands, <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  }</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  </div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="comment">// Propagator responsible for applying the Timetable Edge finding filtering</span></div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">// rule. It increases the minimum of the start variables and decreases the</span></div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="comment">// maximum of the end variables,</span></div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.use_timetable_edge_finding_in_cumulative_constraint()) {</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <a class="code" href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html">TimeTableEdgeFinding</a>* time_table_edge_finding =</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html">TimeTableEdgeFinding</a>(demands, <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, helper, integer_trail);</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  time_table_edge_finding-><a class="code" href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(watcher);</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(time_table_edge_finding);</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  }</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  };</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> }</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  </div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ab521107466b31efd0078a963cdc8d978"> 154</a></span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#ab521107466b31efd0078a963cdc8d978">CumulativeTimeDecomposition</a>(</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& vars,</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keyword">const</span> std::vector<AffineExpression>& demands, <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>,</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper) {</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">if</span> (vars.empty()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  </div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  CHECK(integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">IsFixed</a>(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>));</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keyword">const</span> Coefficient fixed_capacity(</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>).value());</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  </div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = vars.size();</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* sat_solver = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>();</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>* encoder = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>();</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>* intervals = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>>();</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  </div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  std::vector<IntegerVariable> start_vars;</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  std::vector<IntegerVariable> end_vars;</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  std::vector<IntegerValue> fixed_demands;</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  </div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < num_tasks; ++t) {</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  start_vars.push_back(intervals->StartVar(vars[t]));</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  end_vars.push_back(intervals->EndVar(vars[t]));</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  CHECK(integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">IsFixed</a>(demands[t]));</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  fixed_demands.push_back(integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(demands[t]));</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  }</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  </div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// Compute time range.</span></div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  IntegerValue min_start = <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  IntegerValue max_end = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < num_tasks; ++t) {</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  min_start = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(min_start, integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(start_vars[t]));</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  max_end = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(max_end, integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(end_vars[t]));</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  </div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">for</span> (IntegerValue <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> = min_start; <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> < max_end; ++<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>) {</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  std::vector<LiteralWithCoeff> literals_with_coeff;</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < num_tasks; ++t) {</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#adadc001cbdc7263b106fc5886b60ff39">Propagate</a>();</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#ab2188791e61e013dc8b28e66b31041cd">start_min</a> = integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(start_vars[t]);</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a3db7a45809ea7c6000b10a58f003b331">end_max</a> = integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(end_vars[t]);</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a3db7a45809ea7c6000b10a58f003b331">end_max</a> <= <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> || <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> < <a class="code" href="sched__constraints_8cc.html#ab2188791e61e013dc8b28e66b31041cd">start_min</a> || fixed_demands[t] == 0) {</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  }</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  </div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="comment">// Task t consumes the resource at time if consume_condition is true.</span></div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  std::vector<Literal> consume_condition;</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> consume = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a38766514ce4824ae1e093a25d7fb43b3">NewBooleanVariable</a>()), <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  </div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="comment">// Task t consumes the resource at time if it is present.</span></div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">if</span> (intervals->IsOptional(vars[t])) {</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  consume_condition.push_back(intervals->IsPresentLiteral(vars[t]));</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  }</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  </div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="comment">// Task t overlaps time.</span></div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  consume_condition.push_back(encoder->GetOrCreateAssociatedLiteral(</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(start_vars[t], IntegerValue(<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>))));</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  consume_condition.push_back(encoder->GetOrCreateAssociatedLiteral(</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(end_vars[t],</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  IntegerValue(<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> + 1))));</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  </div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#aa874aee040980146062498b87e8fb956">ReifiedBoolAnd</a>(consume_condition, consume));</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  </div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">// TODO(user): this is needed because we currently can't create a</span></div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="comment">// boolean variable if the model is unsat.</span></div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">if</span> (sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab">IsModelUnsat</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  </div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  literals_with_coeff.push_back(</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>(consume, Coefficient(fixed_demands[t].<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>())));</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  }</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="comment">// The profile cannot exceed the capacity at time.</span></div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653">AddLinearConstraint</a>(<span class="keyword">false</span>, Coefficient(0), <span class="keyword">true</span>,</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  fixed_capacity, &literals_with_coeff);</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  </div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="comment">// Abort if UNSAT.</span></div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordflow">if</span> (sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab">IsModelUnsat</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  }</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  };</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span> }</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  </div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span> } <span class="comment">// namespace operations_research</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<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="aalldiff__cst_8cc_html_a021e695f54a13bd809c34b2f4ca87c37"><div class="ttname"><a href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">min</a></div><div class="ttdeci">int64 min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00138">alldiff_cst.cc:138</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#l00203">integer.h:203</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#l00523">integer.h:523</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a9d0c202d5fdd62f4fa2c613339ff168a"><div class="ttname"><a href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">max</a></div><div class="ttdeci">int64 max</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="aclassoperations__research_1_1sat_1_1_linear_constraint_builder_html_a8ef32d79f50eb45bb9305c8b436cf6c4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">operations_research::sat::LinearConstraintBuilder::Build</a></div><div class="ttdeci">LinearConstraint Build()</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8cc_source.html#l00113">linear_constraint.cc:113</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="asched__constraints_8cc_html_a3db7a45809ea7c6000b10a58f003b331"><div class="ttname"><a href="sched__constraints_8cc.html#a3db7a45809ea7c6000b10a58f003b331">end_max</a></div><div class="ttdeci">Rev< int64 > end_max</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00244">sched_constraints.cc:244</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#l00297">sat_solver.cc:297</a></div></div>
|
|
<div class="ttc" id="alinear__constraint_8h_html"><div class="ttname"><a href="linear__constraint_8h.html">linear_constraint.h</a></div></div>
|
|
<div class="ttc" id="asched__constraints_8cc_html_ab2188791e61e013dc8b28e66b31041cd"><div class="ttname"><a href="sched__constraints_8cc.html#ab2188791e61e013dc8b28e66b31041cd">start_min</a></div><div class="ttdeci">Rev< int64 > start_min</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00241">sched_constraints.cc:241</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="adisjunctive_8h_html"><div class="ttname"><a href="disjunctive_8h.html">disjunctive.h</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="ademon__profiler_8cc_html_a21edc7ca4cc5802c8779d68556bc09cf"><div class="ttname"><a href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a></div><div class="ttdeci">int64 value</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="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</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="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#l01208">integer.h:1208</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="asat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_builder_html_ad65ddc0d04d71006a9ebe3b9dcfe2ce6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">operations_research::sat::LinearConstraintBuilder::AddTerm</a></div><div class="ttdeci">void AddTerm(IntegerVariable var, IntegerValue coeff)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8cc_source.html#l00022">linear_constraint.cc:22</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="atimetable_8h_html"><div class="ttname"><a href="timetable_8h.html">timetable.h</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#l01067">integer.h:1067</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="linear__constraint_8h_source.html#l00039">linear_constraint.h:39</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a38766514ce4824ae1e093a25d7fb43b3"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a38766514ce4824ae1e093a25d7fb43b3">operations_research::sat::NewBooleanVariable</a></div><div class="ttdeci">std::function< BooleanVariable(Model *)> NewBooleanVariable()</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01331">integer.h:1331</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="linear__constraint_8h_source.html#l00087">linear_constraint.h:87</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="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#l00137">intervals.h:137</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#l01232">integer.h:1232</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="aprecedences_8h_html"><div class="ttname"><a href="precedences_8h.html">precedences.h</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_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="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#l00047">timetable_edgefinding.cc:47</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#l01055">cp_model_loader.cc:1055</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="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#l00042">demon_profiler.cc:42</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="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#l01214">integer.h:1214</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#l00195">gurobi_interface.cc:195</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#l00064">sat_base.h:64</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#l01617">sat_solver.cc:1617</a></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_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#l00154">cumulative.cc:154</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="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#l00045">intervals.h:45</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#l00049">pb_constraint.h:49</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#l01236">integer.h:1236</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 class="ttc" id="arouting__flow_8cc_html_adf3be22c64f10c0783c0cf277e857adf"><div class="ttname"><a href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a></div><div class="ttdeci">int64 capacity</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00129">routing_flow.cc:129</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#l01228">integer.h:1228</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#l00528">integer_expr.h:528</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aa874aee040980146062498b87e8fb956"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa874aee040980146062498b87e8fb956">operations_research::sat::ReifiedBoolAnd</a></div><div class="ttdeci">std::function< void(Model *)> ReifiedBoolAnd(const std::vector< Literal > &literals, Literal r)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00957">sat_solver.h:957</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="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="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#l00107">cp_model_fz_solver.cc:107</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#l00267">integer.h:267</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#l00061">timetable.cc:61</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#l00029">timetable.h:29</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_a13421db7d7e84fff732599bcf954c5cc"><div class="ttname"><a href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a></div><div class="ttdeci">int64 time</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01683">resource.cc:1683</a></div></div>
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="cumulative_8cc.html">cumulative.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.20 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|