250 lines
338 KiB
HTML
250 lines
338 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||
<html xmlns="http://www.w3.org/1999/xhtml">
|
||
<head>
|
||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
||
<meta name="generator" content="Doxygen 1.8.15"/>
|
||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||
<title>OR-Tools: scheduling_cuts.cc Source File</title>
|
||
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
||
<script type="text/javascript" src="jquery.js"></script>
|
||
<script type="text/javascript" src="dynsections.js"></script>
|
||
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
||
<script type="text/javascript" src="resize.js"></script>
|
||
<script type="text/javascript" src="navtreedata.js"></script>
|
||
<script type="text/javascript" src="navtree.js"></script>
|
||
<script type="text/javascript">
|
||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||
$(document).ready(initResizable);
|
||
/* @license-end */</script>
|
||
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
||
<script type="text/javascript" src="search/searchdata.js"></script>
|
||
<script type="text/javascript" src="search/search.js"></script>
|
||
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
||
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
||
</head>
|
||
<body>
|
||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||
<div id="titlearea">
|
||
<table cellspacing="0" cellpadding="0">
|
||
<tbody>
|
||
<tr style="height: 56px;">
|
||
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
||
<td id="projectalign" style="padding-left: 0.5em;">
|
||
<div id="projectname">OR-Tools
|
||
 <span id="projectnumber">9.2</span>
|
||
</div>
|
||
</td>
|
||
</tr>
|
||
</tbody>
|
||
</table>
|
||
</div>
|
||
<!-- end header part -->
|
||
<!-- Generated by Doxygen 1.8.15 -->
|
||
<script type="text/javascript">
|
||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
||
/* @license-end */
|
||
</script>
|
||
<script type="text/javascript" src="menudata.js"></script>
|
||
<script type="text/javascript" src="menu.js"></script>
|
||
<script type="text/javascript">
|
||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||
$(function() {
|
||
initMenu('',true,false,'search.php','Search');
|
||
$(document).ready(function() { init_search(); });
|
||
});
|
||
/* @license-end */</script>
|
||
<div id="main-nav"></div>
|
||
</div><!-- top -->
|
||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||
<div id="nav-tree">
|
||
<div id="nav-tree-contents">
|
||
<div id="nav-sync" class="sync"></div>
|
||
</div>
|
||
</div>
|
||
<div id="splitbar" style="-moz-user-select:none;"
|
||
class="ui-resizable-handle">
|
||
</div>
|
||
</div>
|
||
<script type="text/javascript">
|
||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||
$(document).ready(function(){initNavTree('scheduling__cuts_8cc_source.html','');});
|
||
/* @license-end */
|
||
</script>
|
||
<div id="doc-content">
|
||
<!-- window showing the filter options -->
|
||
<div id="MSearchSelectWindow"
|
||
onmouseover="return searchBox.OnSearchSelectShow()"
|
||
onmouseout="return searchBox.OnSearchSelectHide()"
|
||
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
||
</div>
|
||
|
||
<!-- iframe showing the search results (closed by default) -->
|
||
<div id="MSearchResultsWindow">
|
||
<iframe src="javascript:void(0)" frameborder="0"
|
||
name="MSearchResults" id="MSearchResults">
|
||
</iframe>
|
||
</div>
|
||
|
||
<div class="header">
|
||
<div class="headertitle">
|
||
<div class="title">scheduling_cuts.cc</div> </div>
|
||
</div><!--header-->
|
||
<div class="contents">
|
||
<a href="scheduling__cuts_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2021 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="scheduling__cuts_8h.html">ortools/sat/scheduling_cuts.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 <cmath></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <cstdint></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <functional></span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <limits></span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <memory></span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <string></span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <utility></span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "absl/strings/str_cat.h"</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="stl__util_8h.html">ortools/base/stl_util.h</a>"</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="strong__vector_8h.html">ortools/base/strong_vector.h</a>"</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="diffn__util_8h.html">ortools/sat/diffn_util.h</a>"</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="implied__bounds_8h.html">ortools/sat/implied_bounds.h</a>"</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>"</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include "<a class="code" href="intervals_8h.html">ortools/sat/intervals.h</a>"</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include "<a class="code" href="sat_2linear__constraint_8h.html">ortools/sat/linear_constraint.h</a>"</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include "<a class="code" href="linear__constraint__manager_8h.html">ortools/sat/linear_constraint_manager.h</a>"</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</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="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include "<a class="code" href="sat_2util_8h.html">ortools/sat/util.h</a>"</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include "<a class="code" href="time__limit_8h.html">ortools/util/time_limit.h</a>"</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> </div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="keyword">namespace </span>sat {</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> </div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="keyword">namespace </span>{</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// Minimum amount of violation of the cut constraint by the solution. This</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// is needed to avoid numerical issues and adding cuts with minor effect.</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="keyword">const</span> <span class="keywordtype">double</span> kMinCutViolation = 1e-4;</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> </div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// Returns the lp value of a Literal.</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="keywordtype">double</span> GetLiteralLpValue(</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keyword">const</span> Literal lit,</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values,</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keyword">const</span> IntegerEncoder* encoder) {</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">const</span> IntegerVariable direct_view = encoder->GetLiteralView(lit);</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">if</span> (direct_view != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">return</span> lp_values[direct_view];</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  }</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keyword">const</span> IntegerVariable opposite_view = encoder->GetLiteralView(lit.Negated());</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(opposite_view, <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>);</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">return</span> 1.0 - lp_values[opposite_view];</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> }</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="keywordtype">void</span> AddIntegerVariableFromIntervals(SchedulingConstraintHelper* helper,</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  Model* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  std::vector<IntegerVariable>* vars) {</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  IntegerEncoder* encoder = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<IntegerEncoder>();</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < helper->NumTasks(); ++t) {</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">if</span> (helper->Starts()[t].var != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  vars->push_back(helper->Starts()[t].var);</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  }</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">if</span> (helper->Sizes()[t].var != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  vars->push_back(helper->Sizes()[t].var);</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  }</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">if</span> (helper->Ends()[t].var != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  vars->push_back(helper->Ends()[t].var);</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  }</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">if</span> (helper->IsOptional(t) && !helper->IsAbsent(t) &&</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  !helper->IsPresent(t)) {</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">const</span> Literal l = helper->PresenceLiteral(t);</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span> (encoder->GetLiteralView(l) == <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a> &&</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  encoder->GetLiteralView(l.Negated()) == <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a775efd540e54bd3be662ce7ee8894c1e">NewIntegerVariableFromLiteral</a>(l));</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="keyword">const</span> IntegerVariable direct_view = encoder->GetLiteralView(l);</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">if</span> (direct_view != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  vars->push_back(direct_view);</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  vars->push_back(encoder->GetLiteralView(l.Negated()));</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(vars->back(), <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>);</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  }</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  }</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  }</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> }</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> </div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> } <span class="comment">// namespace</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> </div><div class="line"><a name="l00097"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html"> 97</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html">EnergyEvent</a> {</div><div class="line"><a name="l00098"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#aae5633dcc6f196817cf87ff999faa6af"> 98</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#aae5633dcc6f196817cf87ff999faa6af">x_start_min</a>;</div><div class="line"><a name="l00099"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#ac33aa2de38f159fcf7838830159d6c86"> 99</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ac33aa2de38f159fcf7838830159d6c86">x_start_max</a>;</div><div class="line"><a name="l00100"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#a0dd6e2baf0ea9a1cbd252bed5a8890da"> 100</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a0dd6e2baf0ea9a1cbd252bed5a8890da">x_end_min</a>;</div><div class="line"><a name="l00101"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#a4807e6da5062c463e7f6c8cabe7d63c5"> 101</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a4807e6da5062c463e7f6c8cabe7d63c5">x_end_max</a>;</div><div class="line"><a name="l00102"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#a7feaa770019816070e3fcafcc0883e95"> 102</a></span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a7feaa770019816070e3fcafcc0883e95">x_size</a>;</div><div class="line"><a name="l00103"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#a379a897decc0711464cb15e8d02fd095"> 103</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a379a897decc0711464cb15e8d02fd095">y_min</a> = IntegerValue(0); <span class="comment">// Useful for no_overlap_2d.</span></div><div class="line"><a name="l00104"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#ae39303b5b3149e1914834c36ad51fe8f"> 104</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ae39303b5b3149e1914834c36ad51fe8f">y_max</a> = IntegerValue(0); <span class="comment">// Useful for no_overlap_2d.</span></div><div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#a227a649685aa74d3dbf82f5ff410f782"> 105</a></span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a227a649685aa74d3dbf82f5ff410f782">y_size</a>;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> </div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// Energy will be present only if the x_size * y_size could be linearized.</span></div><div class="line"><a name="l00108"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8"> 108</a></span>  std::optional<LinearExpression> <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a>;</div><div class="line"><a name="l00109"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#a83f79d0fb389d59356fe4b7a7440d55a"> 109</a></span>  <span class="keywordtype">double</span> <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a83f79d0fb389d59356fe4b7a7440d55a">energy_lp</a> = 0.0;</div><div class="line"><a name="l00110"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#a318e14075dca909780636f1eb7435ea2"> 110</a></span>  LiteralIndex <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a318e14075dca909780636f1eb7435ea2">presence_literal_index</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">// This just cache MinOf(x_size) and MinOf(y_size) for speed:</span></div><div class="line"><a name="l00113"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2"> 113</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">x_size_min</a>;</div><div class="line"><a name="l00114"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#acffeeeb7712a014c78029cb130da23da"> 114</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#acffeeeb7712a014c78029cb130da23da">y_size_min</a>;</div><div class="line"><a name="l00115"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#af8dee2e03e9b51a9149bad32c7ed4958"> 115</a></span>  <span class="keywordtype">double</span> <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#af8dee2e03e9b51a9149bad32c7ed4958">literal_lp</a> = 1.0;</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// Used to minimize the increase on the y axis for rectangles.</span></div><div class="line"><a name="l00118"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#a2e3ce74381be12a227ac6f04a7df9054"> 118</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a2e3ce74381be12a227ac6f04a7df9054">y_spread</a> = IntegerValue(0);</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// The actual value of the presence literal of the interval(s) is checked</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="comment">// when the event is created. A value of kNoLiteralIndex indicates that either</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="comment">// the interval was not optional, or that its presence literal is true at</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="comment">// level zero.</span></div><div class="line"><a name="l00124"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#a90037a849f93aa8dddc93f0e19868d24"> 124</a></span>  <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a90037a849f93aa8dddc93f0e19868d24">IsPresent</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a318e14075dca909780636f1eb7435ea2">presence_literal_index</a> == <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>; }</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> </div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// Computes the mandatory minimal overlap of the interval with the time window</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">// [start, end].</span></div><div class="line"><a name="l00128"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#ac6822fe3edb67cd39211bf3849d3332b"> 128</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ac6822fe3edb67cd39211bf3849d3332b">MinOverlap</a>(IntegerValue start, IntegerValue end)<span class="keyword"> const </span>{</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keywordflow">return</span> <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(<a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>({<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a0dd6e2baf0ea9a1cbd252bed5a8890da">x_end_min</a> - start, end - <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ac33aa2de38f159fcf7838830159d6c86">x_start_max</a>, <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">x_size_min</a>,</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  end - start}),</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  IntegerValue(0));</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  }</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> </div><div class="line"><a name="l00134"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_energy_event.html#a764be64f3029f8b8e23511061d8de355"> 134</a></span>  std::string <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">return</span> absl::StrCat(</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="stringliteral">"EnergyEvent(x_start_min = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#aae5633dcc6f196817cf87ff999faa6af">x_start_min</a>.value(),</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="stringliteral">", x_start_max = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ac33aa2de38f159fcf7838830159d6c86">x_start_max</a>.value(),</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="stringliteral">", x_end_min = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a0dd6e2baf0ea9a1cbd252bed5a8890da">x_end_min</a>.value(),</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="stringliteral">", x_end_max = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a4807e6da5062c463e7f6c8cabe7d63c5">x_end_max</a>.value(),</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="stringliteral">", x_size = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a7feaa770019816070e3fcafcc0883e95">x_size</a>.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#ac3740684133a43f28203f0b85ed847b7">DebugString</a>(), <span class="stringliteral">", y_min = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a379a897decc0711464cb15e8d02fd095">y_min</a>.value(),</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="stringliteral">", y_max = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ae39303b5b3149e1914834c36ad51fe8f">y_max</a>.value(), <span class="stringliteral">", y_size = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a227a649685aa74d3dbf82f5ff410f782">y_size</a>.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#ac3740684133a43f28203f0b85ed847b7">DebugString</a>(),</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="stringliteral">", energy = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a> ? <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a>.value().DebugString() : <span class="stringliteral">"{}"</span>,</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="stringliteral">", presence_literal_index = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a318e14075dca909780636f1eb7435ea2">presence_literal_index</a>.value(), <span class="stringliteral">")"</span>);</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> };</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> </div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment">// Note that we only support to cases:</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment">// - capacity is non-zero and the y_min/y_max of the events must be zero.</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// - capacity is zero, and the y_min/y_max can be set.</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// This is DCHECKed in the code.</span></div><div class="line"><a name="l00151"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a55f294666b4e56097efc1c955d6de181"> 151</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a55f294666b4e56097efc1c955d6de181">GenerateEnergeticCuts</a>(</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keyword">const</span> std::string& cut_name,</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values,</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  std::vector<EnergyEvent> events, <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>,</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordtype">bool</span> no_overlap_2d, <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>, <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</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="l00157"></a><span class="lineno"> 157</span>  <a class="code" href="classoperations__research_1_1sat_1_1_top_n_cuts.html">TopNCuts</a> top_n_cuts(15);</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> </div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  std::sort(events.begin(), events.end(),</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  [](<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html">EnergyEvent</a>& <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html">EnergyEvent</a>& <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) {</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">return</span> std::tie(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.x_start_min, <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.y_spread, <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.x_end_max) <</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  std::tie(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.x_start_min, <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.y_spread, <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.x_end_max);</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  });</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> capacity_lp = <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>.LpValue(lp_values);</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> </div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="comment">// The sum of all energies can be used to stop iterating early.</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordtype">double</span> sum_of_all_energies = 0.0;</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& e : events) {</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  sum_of_all_energies += e.energy_lp;</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> </div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  IntegerValue processed_start = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i1 = 0; i1 + 1 < events.size(); ++i1) {</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="comment">// We want maximal cuts. For any x_start_min value, we only need to create</span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="comment">// cuts starting from the first interval having this x_start_min value.</span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">if</span> (events[i1].x_start_min == processed_start) {</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!no_overlap_2d) {</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="comment">// Enabling this optimization reduces dramatically the number of generated</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">// cuts in the no_overlap_2d case.</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// TODO(user): Improve splitting part for the no_overlap_2d part.</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  processed_start = events[i1].x_start_min;</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  }</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> </div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">// For each start time, we will keep the most violated cut generated while</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">// scanning the residual intervals.</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordtype">int</span> max_violation_end_index = -1;</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordtype">double</span> max_relative_violation = 1.01;</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  IntegerValue max_violation_window_start(0);</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  IntegerValue max_violation_window_end(0);</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  IntegerValue max_violation_y_min(0);</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  IntegerValue max_violation_y_max(0);</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  std::vector<EnergyEvent> max_violation_lifted_events;</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> </div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="comment">// Accumulate intervals and check for potential cuts.</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordtype">double</span> energy_lp = 0.0;</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  IntegerValue window_min = <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  IntegerValue window_max = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  IntegerValue y_min = <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  IntegerValue y_max = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> </div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">// We sort all tasks (x_start_min(task) >= x_start_min(start_index) by</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="comment">// increasing end max.</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  std::vector<EnergyEvent> residual_events(events.begin() + i1, events.end());</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  std::sort(residual_events.begin(), residual_events.end(),</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  [](<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html">EnergyEvent</a>& <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html">EnergyEvent</a>& <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) {</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">return</span> std::tie(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.x_end_max, <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.y_spread) <</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  std::tie(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.x_end_max, <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.y_spread);</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  });</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="comment">// Let's process residual tasks and evaluate the violation of the cut at</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="comment">// each step. We follow the same structure as the cut creation code below.</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i2 = 0; i2 < residual_events.size(); ++i2) {</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html">EnergyEvent</a>& e = residual_events[i2];</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  energy_lp += e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a83f79d0fb389d59356fe4b7a7440d55a">energy_lp</a>;</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  window_min = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(window_min, e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#aae5633dcc6f196817cf87ff999faa6af">x_start_min</a>);</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  window_max = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(window_max, e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a4807e6da5062c463e7f6c8cabe7d63c5">x_end_max</a>);</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  y_min = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(y_min, e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a379a897decc0711464cb15e8d02fd095">y_min</a>);</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  y_max = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(y_max, e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ae39303b5b3149e1914834c36ad51fe8f">y_max</a>);</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> </div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="comment">// Dominance rule. If the next interval also fits in</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="comment">// [window_min, window_max], the cut will be stronger with the</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="comment">// next interval.</span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">if</span> (i2 + 1 < residual_events.size() &&</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  residual_events[i2 + 1].x_start_min >= window_min &&</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  residual_events[i2 + 1].x_end_max <= window_max &&</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  residual_events[i2 + 1].y_min >= y_min &&</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  residual_events[i2 + 1].y_max <= y_max) {</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  }</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> </div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">// Checks the current area vs the sum of all energies.</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(capacity_lp == 0.0 || y_max == y_min);</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> window_lp = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(window_max - window_min);</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> area = window_lp * (capacity_lp + <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(y_max - y_min));</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">if</span> (area >= sum_of_all_energies) {</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  }</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> </div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// Compute forced contributions from intervals not included in</span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="comment">// [window_min..window_max].</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="comment">//</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="comment">// TODO(user): We could precompute possible intervals and store them</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="comment">// by x_start_max, x_end_min to reduce the complexity.</span></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  std::vector<EnergyEvent> lifted_events;</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordtype">double</span> lifted_contrib_lp = 0.0;</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> </div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keyword">const</span> <span class="keyword">auto</span> check_lifted_cuts = [&lifted_events, window_min, window_max,</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  y_min, y_max, &lifted_contrib_lp,</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  &lp_values](<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html">EnergyEvent</a>& e) {</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="comment">// It should not happen because of the 2 dominance rules above.</span></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordflow">if</span> (e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#aae5633dcc6f196817cf87ff999faa6af">x_start_min</a> >= window_min && e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a4807e6da5062c463e7f6c8cabe7d63c5">x_end_max</a> <= window_max) {</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  }</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> </div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="comment">// Do not add if it extends the y range.</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">if</span> (e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a379a897decc0711464cb15e8d02fd095">y_min</a> < y_min || e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ae39303b5b3149e1914834c36ad51fe8f">y_max</a> > y_max) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> </div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="comment">// Exit if the interval can be pushed left or right of the window.</span></div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordflow">if</span> (e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a0dd6e2baf0ea9a1cbd252bed5a8890da">x_end_min</a> <= window_min || e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ac33aa2de38f159fcf7838830159d6c86">x_start_max</a> >= window_max) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> </div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(window_max, window_min);</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">x_size_min</a>, 0);</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> </div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keyword">const</span> IntegerValue min_overlap = e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ac6822fe3edb67cd39211bf3849d3332b">MinOverlap</a>(window_min, window_max);</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordflow">if</span> (min_overlap <= 0) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> </div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  lifted_events.push_back(e);</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordtype">double</span> contrib_lp = 0.0;</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordflow">if</span> (e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a90037a849f93aa8dddc93f0e19868d24">IsPresent</a>()) {</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  contrib_lp = e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a227a649685aa74d3dbf82f5ff410f782">y_size</a>.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(lp_values) * <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(min_overlap);</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  contrib_lp = e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#af8dee2e03e9b51a9149bad32c7ed4958">literal_lp</a> * <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(min_overlap * e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#acffeeeb7712a014c78029cb130da23da">y_size_min</a>);</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  }</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// We know the energy is >= 0.0. Some epsilon in the simplex can make</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">// contrib_lp a small negative number. We can correct this.</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  lifted_contrib_lp += <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(contrib_lp, 0.0);</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  };</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span> </div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="comment">// Because of the 2D conflicts, lifted events are unlikely in the</span></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="comment">// no_overlap_2d case. Let's disable this expensive loop for the time</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="comment">// being.</span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordflow">if</span> (!no_overlap_2d) {</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i3 = 0; i3 < i1; ++i3) {</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  check_lifted_cuts(events[i3]);</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i3 = i2 + 1; i3 < residual_events.size(); ++i3) {</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  check_lifted_cuts(residual_events[i3]);</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  }</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  }</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> </div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="comment">// Compute the violation of the potential cut.</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> relative_violation = (energy_lp + lifted_contrib_lp) / area;</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">if</span> (relative_violation > max_relative_violation) {</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  max_violation_end_index = i2;</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  max_relative_violation = relative_violation;</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  max_violation_window_start = window_min;</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  max_violation_window_end = window_max;</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  max_violation_y_min = y_min;</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  max_violation_y_max = y_max;</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  max_violation_lifted_events = lifted_events;</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  }</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  }</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span> </div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">if</span> (max_violation_end_index == -1) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> </div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="comment">// A maximal violated cut has been found.</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordtype">bool</span> cut_generated = <span class="keyword">true</span>;</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordtype">bool</span> has_opt_cuts = <span class="keyword">false</span>;</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordtype">bool</span> use_lifted_events = <span class="keyword">false</span>;</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordtype">bool</span> has_quadratic_cuts = <span class="keyword">false</span>;</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordtype">bool</span> use_energy = <span class="keyword">false</span>;</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> </div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(capacity_lp == 0.0 || max_violation_y_max == max_violation_y_min);</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">LinearConstraintBuilder</a> cut(</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>,</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  (max_violation_window_end - max_violation_window_start) *</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  (max_violation_y_max - max_violation_y_min));</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> </div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="comment">// Build the cut.</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>,</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  max_violation_window_start - max_violation_window_end);</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i2 = 0; i2 <= max_violation_end_index; ++i2) {</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html">EnergyEvent</a>& e = residual_events[i2];</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordflow">if</span> (e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a90037a849f93aa8dddc93f0e19868d24">IsPresent</a>()) {</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordflow">if</span> (e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a>) {</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="comment">// We favor the energy info instead of the McCormick relaxation.</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a49e8e4a987d39f4da335e1ed287bb8ad">AddLinearExpression</a>(e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a>.value());</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  use_energy = <span class="keyword">true</span>;</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a7e251202babf951363efedbd30af45c5">AddQuadraticLowerBound</a>(e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a7feaa770019816070e3fcafcc0883e95">x_size</a>, e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a227a649685aa74d3dbf82f5ff410f782">y_size</a>, integer_trail);</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  has_quadratic_cuts = <span class="keyword">true</span>;</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  }</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  has_opt_cuts = <span class="keyword">true</span>;</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keyword">const</span> IntegerValue min_energy =</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">x_size_min</a> * e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#acffeeeb7712a014c78029cb130da23da">y_size_min</a>,</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a> ? e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a>.value().LevelZeroMin(integer_trail)</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  : IntegerValue(0));</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">if</span> (min_energy > e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">x_size_min</a> * e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#acffeeeb7712a014c78029cb130da23da">y_size_min</a>) {</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  use_energy = <span class="keyword">true</span>;</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  }</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordflow">if</span> (!cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a094a24aaf66d66b693e7e80a0222f040">AddLiteralTerm</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a318e14075dca909780636f1eb7435ea2">presence_literal_index</a>),</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  min_energy)) {</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  cut_generated = <span class="keyword">false</span>;</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  }</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  }</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  }</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> </div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html">EnergyEvent</a>& e : max_violation_lifted_events) {</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keyword">const</span> IntegerValue min_overlap = e.MinOverlap(window_min, window_max);</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(min_overlap, 0);</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  use_lifted_events = <span class="keyword">true</span>;</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span> </div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordflow">if</span> (e.IsPresent()) {</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(e.y_size, min_overlap);</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  has_opt_cuts = <span class="keyword">true</span>;</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">if</span> (!cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a094a24aaf66d66b693e7e80a0222f040">AddLiteralTerm</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(e.presence_literal_index),</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  min_overlap * e.y_size_min)) {</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  cut_generated = <span class="keyword">false</span>;</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  }</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  }</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  }</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> </div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">if</span> (cut_generated) {</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  std::string full_name = cut_name;</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keywordflow">if</span> (has_opt_cuts) full_name.append(<span class="stringliteral">"_opt"</span>);</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordflow">if</span> (has_quadratic_cuts) full_name.append(<span class="stringliteral">"_quad"</span>);</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keywordflow">if</span> (use_lifted_events) full_name.append(<span class="stringliteral">"_lifted"</span>);</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keywordflow">if</span> (use_energy) full_name.append(<span class="stringliteral">"_energy"</span>);</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  top_n_cuts.AddCut(cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">Build</a>(), full_name, lp_values);</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  }</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  }</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  top_n_cuts.TransferToManager(lp_values, manager);</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span> }</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> </div><div class="line"><a name="l00381"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a64dd4ef1984ac7dd7fdb25c7b2765554"> 381</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a64dd4ef1984ac7dd7fdb25c7b2765554">AppendVariablesToCumulativeCut</a>(</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a>& <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>,</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keyword">const</span> std::vector<AffineExpression>& demands, <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail,</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a>* result) {</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a>& demand_expr : demands) {</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">if</span> (!integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">IsFixed</a>(demand_expr)) {</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  result-><a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.push_back(demand_expr.var);</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  }</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  }</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordflow">if</span> (!integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">IsFixed</a>(<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>)) {</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  result-><a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.push_back(<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>.var);</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  }</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> }</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> </div><div class="line"><a name="l00395"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a04d3913888ed0b200c1d1fa879c62804"> 395</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code" href="namespaceoperations__research_1_1sat.html#a04d3913888ed0b200c1d1fa879c62804">CreateCumulativeEnergyCutGenerator</a>(</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& intervals,</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a>& <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>,</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keyword">const</span> std::vector<AffineExpression>& demands,</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keyword">const</span> std::vector<LinearExpression>& energies, <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="l00400"></a><span class="lineno"> 400</span>  <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span> </div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper =</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>(intervals, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(helper);</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> </div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>();</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</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="l00408"></a><span class="lineno"> 408</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="l00409"></a><span class="lineno"> 409</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a64dd4ef1984ac7dd7fdb25c7b2765554">AppendVariablesToCumulativeCut</a>(<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, demands, integer_trail, &result);</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  AddIntegerVariableFromIntervals(helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, &result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a>& <a class="code" href="resource_8cc.html#a4a6149ef5bdc681a998b90bb5c165bf3">energy</a> : energies) {</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.insert(result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.end(), <a class="code" href="resource_8cc.html#a4a6149ef5bdc681a998b90bb5c165bf3">energy</a>.vars.begin(),</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <a class="code" href="resource_8cc.html#a4a6149ef5bdc681a998b90bb5c165bf3">energy</a>.vars.end());</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  }</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <a class="code" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> </div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">generate_cuts</a> =</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  [<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, demands, energies, trail, integer_trail, helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  encoder](<span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values,</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keywordflow">if</span> (trail->CurrentDecisionLevel() > 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> </div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  std::vector<EnergyEvent> events;</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < helper->NumTasks(); ++i) {</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keywordflow">if</span> (helper->IsAbsent(i)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keywordflow">if</span> (integer_trail->LevelZeroUpperBound(demands[i]) == 0 ||</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  helper->SizeMin(i) == 0) {</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  }</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> </div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html">EnergyEvent</a> e;</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#aae5633dcc6f196817cf87ff999faa6af">x_start_min</a> = helper->StartMin(i);</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ac33aa2de38f159fcf7838830159d6c86">x_start_max</a> = helper->StartMax(i);</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a0dd6e2baf0ea9a1cbd252bed5a8890da">x_end_min</a> = helper->EndMin(i);</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a4807e6da5062c463e7f6c8cabe7d63c5">x_end_max</a> = helper->EndMax(i);</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a7feaa770019816070e3fcafcc0883e95">x_size</a> = helper->Sizes()[i];</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a227a649685aa74d3dbf82f5ff410f782">y_size</a> = demands[i];</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research_1_1sat.html#a88c8ab90d500702234707905c3b07ad2">ProductIsLinearized</a>(energies[i])) {</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a> = energies[i];</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  }</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordflow">if</span> (!helper->IsPresent(i)) {</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a318e14075dca909780636f1eb7435ea2">presence_literal_index</a> = helper->PresenceLiteral(i).Index();</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  }</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">x_size_min</a> = helper->SizeMin(i);</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#acffeeeb7712a014c78029cb130da23da">y_size_min</a> = integer_trail->LevelZeroLowerBound(demands[i]);</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="comment">// Cache the energy contribution for the lp relaxation.</span></div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keywordtype">double</span> energy_lp = 0.0;</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">if</span> (helper->IsPresent(i)) {</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keywordflow">if</span> (e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a>) {</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  energy_lp = e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a>.value().LpValue(lp_values);</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  } <span class="keywordflow">else</span> { <span class="comment">// demand and size are not fixed.</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="comment">// X * Y >= X * y_min + x_min * Y - x_min * y_min.</span></div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  energy_lp = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#acffeeeb7712a014c78029cb130da23da">y_size_min</a>) * e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a7feaa770019816070e3fcafcc0883e95">x_size</a>.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(lp_values);</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  energy_lp += <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">x_size_min</a>) * e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a227a649685aa74d3dbf82f5ff410f782">y_size</a>.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(lp_values);</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  energy_lp -= <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">x_size_min</a> * e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#acffeeeb7712a014c78029cb130da23da">y_size_min</a>);</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  }</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a318e14075dca909780636f1eb7435ea2">presence_literal_index</a> = helper->PresenceLiteral(i).Index();</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#af8dee2e03e9b51a9149bad32c7ed4958">literal_lp</a> = GetLiteralLpValue(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a318e14075dca909780636f1eb7435ea2">presence_literal_index</a>),</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  lp_values, encoder);</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keyword">const</span> IntegerValue min_energy =</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">x_size_min</a> * e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#acffeeeb7712a014c78029cb130da23da">y_size_min</a>,</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a> ? e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a>.value().LevelZeroMin(integer_trail)</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  : IntegerValue(0));</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  energy_lp = e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#af8dee2e03e9b51a9149bad32c7ed4958">literal_lp</a> * <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(min_energy);</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  }</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="comment">// we know the energy is >= 0. So we can avoid small negative numbers.</span></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a83f79d0fb389d59356fe4b7a7440d55a">energy_lp</a> = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(energy_lp, 0.0);</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  events.push_back(e);</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  }</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> </div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a55f294666b4e56097efc1c955d6de181">GenerateEnergeticCuts</a>(<span class="stringliteral">"CumulativeEnergy"</span>, lp_values, events, <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>,</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keyword">false</span>, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, manager);</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  };</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span> </div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span> }</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span> </div><div class="line"><a name="l00480"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ab62fb8f885a68c653b586424aa5863c8"> 480</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code" href="namespaceoperations__research_1_1sat.html#ab62fb8f885a68c653b586424aa5863c8">CreateNoOverlapEnergyCutGenerator</a>(</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& intervals, <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="l00482"></a><span class="lineno"> 482</span>  <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> </div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>();</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</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="l00486"></a><span class="lineno"> 486</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper =</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>(intervals, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(helper);</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span> </div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  AddIntegerVariableFromIntervals(helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, &result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <a class="code" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span> </div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="comment">// We need to convert AffineExpression to LinearExpression for the energy.</span></div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  std::vector<LinearExpression> sizes;</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  sizes.reserve(intervals.size());</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals.size(); ++i) {</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</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>);</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  builder.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(helper->Sizes()[i], IntegerValue(1));</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  sizes.push_back(builder.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a96ececaa94026aaa3a46fb65df0a17a9">BuildExpression</a>());</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  }</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span> </div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">generate_cuts</a> =</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  [sizes, trail, helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, encoder](</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values,</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keywordflow">if</span> (trail->CurrentDecisionLevel() > 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span> </div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  std::vector<EnergyEvent> events;</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < helper->NumTasks(); ++i) {</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordflow">if</span> (helper->IsAbsent(i)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordflow">if</span> (helper->SizeMin(i) == 0) {</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  }</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span> </div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html">EnergyEvent</a> e;</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#aae5633dcc6f196817cf87ff999faa6af">x_start_min</a> = helper->StartMin(i);</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ac33aa2de38f159fcf7838830159d6c86">x_start_max</a> = helper->StartMax(i);</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a0dd6e2baf0ea9a1cbd252bed5a8890da">x_end_min</a> = helper->EndMin(i);</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a4807e6da5062c463e7f6c8cabe7d63c5">x_end_max</a> = helper->EndMax(i);</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a7feaa770019816070e3fcafcc0883e95">x_size</a> = helper->Sizes()[i];</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a227a649685aa74d3dbf82f5ff410f782">y_size</a> = IntegerValue(1);</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a> = sizes[i];</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">x_size_min</a> = helper->SizeMin(i);</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#acffeeeb7712a014c78029cb130da23da">y_size_min</a> = IntegerValue(1);</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keywordtype">double</span> energy_lp = 0.0;</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keywordflow">if</span> (helper->IsPresent(i)) {</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  energy_lp = e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a>->LpValue(lp_values);</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a318e14075dca909780636f1eb7435ea2">presence_literal_index</a> = helper->PresenceLiteral(i).Index();</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#af8dee2e03e9b51a9149bad32c7ed4958">literal_lp</a> = GetLiteralLpValue(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a318e14075dca909780636f1eb7435ea2">presence_literal_index</a>),</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  lp_values, encoder);</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  energy_lp = e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#af8dee2e03e9b51a9149bad32c7ed4958">literal_lp</a> * <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">x_size_min</a>);</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  }</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="comment">// we know the energy is >= 0. So we can avoid small negative numbers.</span></div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a83f79d0fb389d59356fe4b7a7440d55a">energy_lp</a> = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(energy_lp, 0.0);</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  events.push_back(e);</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  }</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span> </div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a55f294666b4e56097efc1c955d6de181">GenerateEnergeticCuts</a>(<span class="stringliteral">"NoOverlapEnergy"</span>, lp_values, events,</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  IntegerValue(1), <span class="keyword">false</span>, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, manager);</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  };</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> }</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span> </div><div class="line"><a name="l00546"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a4afe32e790c8bdda016751c64074547e"> 546</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a4afe32e790c8bdda016751c64074547e">GenerateNoOverlap2dEnergyCut</a>(</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keyword">const</span> std::vector<LinearExpression>& energies, absl::Span<int> rectangles,</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keyword">const</span> std::string& cut_name,</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values, <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="l00550"></a><span class="lineno"> 550</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail, <a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>* encoder,</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager, <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* x_helper,</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* y_helper) {</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  std::vector<EnergyEvent> events;</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> rect : rectangles) {</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keywordflow">if</span> (y_helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afa1aca9725da8adf5c56ea08e7636c32">SizeMax</a>(rect) == 0 || x_helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afa1aca9725da8adf5c56ea08e7636c32">SizeMax</a>(rect) == 0) {</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  }</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span> </div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keyword">const</span> LiteralIndex literal_index =</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  x_helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(rect)</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  ? (y_helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(rect)</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  ? <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a></div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  : y_helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ac8a0cc4c1cca9aefa21788b096954f31">PresenceLiteral</a>(rect).<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>())</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  : x_helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ac8a0cc4c1cca9aefa21788b096954f31">PresenceLiteral</a>(rect).<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>();</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span> </div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html">EnergyEvent</a> e;</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#aae5633dcc6f196817cf87ff999faa6af">x_start_min</a> = x_helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">StartMin</a>(rect);</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ac33aa2de38f159fcf7838830159d6c86">x_start_max</a> = x_helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(rect);</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a0dd6e2baf0ea9a1cbd252bed5a8890da">x_end_min</a> = x_helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(rect);</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a4807e6da5062c463e7f6c8cabe7d63c5">x_end_max</a> = x_helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9125ec8126e6035eacce8a5eb52b45c5">EndMax</a>(rect);</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a7feaa770019816070e3fcafcc0883e95">x_size</a> = x_helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ade00ce69e73ccd8470ea0198961da58e">Sizes</a>()[rect];</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a379a897decc0711464cb15e8d02fd095">y_min</a> = y_helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">StartMin</a>(rect);</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ae39303b5b3149e1914834c36ad51fe8f">y_max</a> = y_helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9125ec8126e6035eacce8a5eb52b45c5">EndMax</a>(rect);</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a227a649685aa74d3dbf82f5ff410f782">y_size</a> = y_helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ade00ce69e73ccd8470ea0198961da58e">Sizes</a>()[rect];</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research_1_1sat.html#a88c8ab90d500702234707905c3b07ad2">ProductIsLinearized</a>(energies[rect])) {</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a> = energies[rect];</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  }</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a318e14075dca909780636f1eb7435ea2">presence_literal_index</a> = literal_index;</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">x_size_min</a> = x_helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(rect);</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#acffeeeb7712a014c78029cb130da23da">y_size_min</a> = y_helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(rect);</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="comment">// Cache the energy contribution for the lp relaxation.</span></div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keywordtype">double</span> energy_lp = 0.0;</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordflow">if</span> (e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a318e14075dca909780636f1eb7435ea2">presence_literal_index</a> == <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) {</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordflow">if</span> (e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a>) {</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  energy_lp = e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a>.value().LpValue(lp_values);</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  } <span class="keywordflow">else</span> { <span class="comment">// demand and size are not fixed.</span></div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="comment">// X * Y >= X * y_min + x_min * Y - x_min * y_min.</span></div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  energy_lp = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#acffeeeb7712a014c78029cb130da23da">y_size_min</a>) * e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a7feaa770019816070e3fcafcc0883e95">x_size</a>.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(lp_values);</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  energy_lp += <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">x_size_min</a>) * e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a227a649685aa74d3dbf82f5ff410f782">y_size</a>.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(lp_values);</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  energy_lp -= <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">x_size_min</a> * e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#acffeeeb7712a014c78029cb130da23da">y_size_min</a>);</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  }</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#af8dee2e03e9b51a9149bad32c7ed4958">literal_lp</a> = GetLiteralLpValue(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a318e14075dca909780636f1eb7435ea2">presence_literal_index</a>),</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  lp_values, encoder);</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keyword">const</span> IntegerValue min_energy =</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">x_size_min</a> * e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#acffeeeb7712a014c78029cb130da23da">y_size_min</a>,</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a> ? e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">energy</a>.value().LevelZeroMin(integer_trail)</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  : IntegerValue(0));</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  energy_lp = e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#af8dee2e03e9b51a9149bad32c7ed4958">literal_lp</a> * <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(min_energy);</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  }</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="comment">// we know the energy is >= 0. So we can avoid small negative numbers.</span></div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  e.<a class="code" href="structoperations__research_1_1sat_1_1_energy_event.html#a83f79d0fb389d59356fe4b7a7440d55a">energy_lp</a> = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(energy_lp, 0.0);</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  events.push_back(e);</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  }</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span> </div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keywordflow">if</span> (events.empty()) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span> </div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="comment">// Compute y_spread.</span></div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keywordtype">double</span> average_d = 0.0;</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& e : events) {</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  average_d += <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(e.y_min + e.y_max);</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  }</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="keyword">const</span> int64_t average =</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  static_cast<int64_t>(std::round(average_d / 2 / events.size()));</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span>& e : events) {</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  e.y_spread = IntegerValue(std::abs(e.y_max.value() - average) +</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  std::abs(average - e.y_min.value()));</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  }</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a55f294666b4e56097efc1c955d6de181">GenerateEnergeticCuts</a>(cut_name, lp_values, events, IntegerValue(0), <span class="keyword">true</span>,</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, manager);</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span> }</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span> </div><div class="line"><a name="l00623"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a0c1099fcb640b53078dba0e5b9bcd2ce"> 623</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code" href="namespaceoperations__research_1_1sat.html#a0c1099fcb640b53078dba0e5b9bcd2ce">CreateNoOverlap2dEnergyCutGenerator</a>(</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& x_intervals,</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& y_intervals, <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="l00626"></a><span class="lineno"> 626</span>  <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>* intervals_repository =</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <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="l00629"></a><span class="lineno"> 629</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_rectangles = x_intervals.size();</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span> </div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  std::vector<LinearExpression> energies;</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  std::vector<AffineExpression> x_sizes;</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  std::vector<AffineExpression> y_sizes;</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_rectangles; ++i) {</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  x_sizes.push_back(intervals_repository-><a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html#aa57420b719d949fc4e8fec48c0c41dcc">Size</a>(x_intervals[i]));</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  y_sizes.push_back(intervals_repository-><a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html#aa57420b719d949fc4e8fec48c0c41dcc">Size</a>(y_intervals[i]));</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  }</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a47064139cec9b2ea520361ee30f0f243">LinearizeInnerProduct</a>(x_sizes, y_sizes, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, &energies);</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span> </div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* x_helper =</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>(x_intervals, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(x_helper);</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span> </div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* y_helper =</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>(y_intervals, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(y_helper);</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span> </div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  AddIntegerVariableFromIntervals(x_helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, &result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  AddIntegerVariableFromIntervals(y_helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, &result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <a class="code" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span> </div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>();</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</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="l00654"></a><span class="lineno"> 654</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="l00655"></a><span class="lineno"> 655</span> </div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">generate_cuts</a> =</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  [integer_trail, trail, encoder, x_helper, y_helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, energies](</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values,</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="keywordflow">if</span> (trail->CurrentDecisionLevel() > 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span> </div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keywordflow">if</span> (!x_helper->SynchronizeAndSetTimeDirection(<span class="keyword">true</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="keywordflow">if</span> (!y_helper->SynchronizeAndSetTimeDirection(<span class="keyword">true</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span> </div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_rectangles = x_helper->NumTasks();</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  std::vector<int> active_rectangles;</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  std::vector<Rectangle> cached_rectangles(num_rectangles);</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> rect = 0; rect < num_rectangles; ++rect) {</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keywordflow">if</span> (y_helper->IsAbsent(rect) || y_helper->IsAbsent(rect)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="comment">// We do not consider rectangles controlled by 2 different unassigned</span></div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="comment">// enforcement literals.</span></div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="keywordflow">if</span> (!x_helper->IsPresent(rect) && !y_helper->IsPresent(rect) &&</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  x_helper->PresenceLiteral(rect) !=</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  y_helper->PresenceLiteral(rect)) {</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  }</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span> </div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="comment">// TODO(user): It might be possible/better to use some shifted value</span></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="comment">// here, but for now this code is not in the hot spot, so better be</span></div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="comment">// defensive and only do connected components on really disjoint</span></div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="comment">// rectangles.</span></div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html">Rectangle</a>& rectangle = cached_rectangles[rect];</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  rectangle.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a1f62ae069f3793df9ae18399ba6d052c">x_min</a> = x_helper->StartMin(rect);</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  rectangle.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a0cc9a3a200ee27bae9b9907d97b5718e">x_max</a> = x_helper->EndMax(rect);</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  rectangle.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a379a897decc0711464cb15e8d02fd095">y_min</a> = y_helper->StartMin(rect);</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  rectangle.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#ae39303b5b3149e1914834c36ad51fe8f">y_max</a> = y_helper->EndMax(rect);</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span> </div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  active_rectangles.push_back(rect);</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  }</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span> </div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keywordflow">if</span> (active_rectangles.size() <= 1) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span> </div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  std::vector<absl::Span<int>> components =</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a3e2516c0d3fc4991896c6a9bbead80e7">GetOverlappingRectangleComponents</a>(</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  cached_rectangles, absl::MakeSpan(active_rectangles));</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span> </div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="comment">// Forward pass. No need to do a backward pass.</span></div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="keywordflow">for</span> (absl::Span<int> rectangles : components) {</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="keywordflow">if</span> (rectangles.size() <= 1) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span> </div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a4afe32e790c8bdda016751c64074547e">GenerateNoOverlap2dEnergyCut</a>(</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  energies, rectangles, <span class="stringliteral">"NoOverlap2dXEnergy"</span>, lp_values, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  integer_trail, encoder, manager, x_helper, y_helper);</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a4afe32e790c8bdda016751c64074547e">GenerateNoOverlap2dEnergyCut</a>(</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  energies, rectangles, <span class="stringliteral">"NoOverlap2dYEnergy"</span>, lp_values, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  integer_trail, encoder, manager, y_helper, x_helper);</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  }</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span> </div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  };</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span> }</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span> </div><div class="line"><a name="l00714"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a6b12eb18e7becd3da4eda60b61182f95"> 714</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code" href="namespaceoperations__research_1_1sat.html#a6b12eb18e7becd3da4eda60b61182f95">CreateCumulativeTimeTableCutGenerator</a>(</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& intervals,</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a>& <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>,</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keyword">const</span> std::vector<AffineExpression>& demands, <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="l00718"></a><span class="lineno"> 718</span>  <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span> </div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper =</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>(intervals, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(helper);</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span> </div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <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="l00725"></a><span class="lineno"> 725</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a64dd4ef1984ac7dd7fdb25c7b2765554">AppendVariablesToCumulativeCut</a>(<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, demands, integer_trail, &result);</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span> </div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  AddIntegerVariableFromIntervals(helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, &result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <a class="code" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span> </div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <span class="keyword">struct </span>TimeTableEvent {</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keywordtype">int</span> interval_index;</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  IntegerValue <a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>;</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="keywordtype">bool</span> positive;</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a>;</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  };</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span> </div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>();</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span> </div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">generate_cuts</a> =</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  [helper, <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, demands, trail, integer_trail, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>](</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values,</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="keywordflow">if</span> (trail->CurrentDecisionLevel() > 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span> </div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  std::vector<TimeTableEvent> events;</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <span class="comment">// Iterate through the intervals. If start_max < end_min, the demand</span></div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="comment">// is mandatory.</span></div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>(); ++i) {</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="keywordflow">if</span> (helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">IsAbsent</a>(i)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span> </div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a> = helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(i);</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a> = helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(i);</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span> </div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a> >= <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a>) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span> </div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  TimeTableEvent e1;</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  e1.interval_index = i;</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  e1.time = <a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a>;</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  e1.demand = demands[i];</div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  e1.positive = <span class="keyword">true</span>;</div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span> </div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  TimeTableEvent e2 = e1;</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  e2.time = <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a>;</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  e2.positive = <span class="keyword">false</span>;</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  events.push_back(e1);</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  events.push_back(e2);</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  }</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span> </div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="comment">// Sort events by time.</span></div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  <span class="comment">// It is also important that all positive event with the same time as</span></div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="comment">// negative events appear after for the correctness of the algo below.</span></div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  std::sort(events.begin(), events.end(),</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  [](<span class="keyword">const</span> TimeTableEvent& i, <span class="keyword">const</span> TimeTableEvent& j) {</div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="keywordflow">if</span> (i.time == j.time) {</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="keywordflow">if</span> (i.positive == j.positive) {</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="keywordflow">return</span> i.interval_index < j.interval_index;</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  }</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="keywordflow">return</span> !i.positive;</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  }</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keywordflow">return</span> i.time < j.time;</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  });</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span> </div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  std::vector<TimeTableEvent> cut_events;</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="keywordtype">bool</span> added_positive_event = <span class="keyword">false</span>;</div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> TimeTableEvent& e : events) {</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="keywordflow">if</span> (e.positive) {</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  added_positive_event = <span class="keyword">true</span>;</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  cut_events.push_back(e);</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  }</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="keywordflow">if</span> (added_positive_event && cut_events.size() > 1) {</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="comment">// Create cut.</span></div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="keywordtype">bool</span> cut_generated = <span class="keyword">true</span>;</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">LinearConstraintBuilder</a> cut(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>,</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  IntegerValue(0));</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, IntegerValue(-1));</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> TimeTableEvent& cut_event : cut_events) {</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <span class="keywordflow">if</span> (helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(cut_event.interval_index)) {</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(cut_event.demand, IntegerValue(1));</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  cut_generated &= cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a094a24aaf66d66b693e7e80a0222f040">AddLiteralTerm</a>(</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  helper-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ac8a0cc4c1cca9aefa21788b096954f31">PresenceLiteral</a>(cut_event.interval_index),</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  integer_trail->LowerBound(cut_event.demand));</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keywordflow">if</span> (!cut_generated) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  }</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  }</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="keywordflow">if</span> (cut_generated) {</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="comment">// Violation of the cut is checked by AddCut so we don't check</span></div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="comment">// it here.</span></div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  manager->AddCut(cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">Build</a>(), <span class="stringliteral">"CumulativeTimeTable"</span>, lp_values);</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  }</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  }</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="comment">// Remove the event.</span></div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <span class="keywordtype">int</span> new_size = 0;</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < cut_events.size(); ++i) {</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  <span class="keywordflow">if</span> (cut_events[i].interval_index == e.interval_index) {</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  }</div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  cut_events[new_size] = cut_events[i];</div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  new_size++;</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  }</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  cut_events.resize(new_size);</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  added_positive_event = <span class="keyword">false</span>;</div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  }</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  };</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span> }</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span> </div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span> <span class="comment">// Cached Information about one interval.</span></div><div class="line"><a name="l00831"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_precedence_event.html"> 831</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html">PrecedenceEvent</a> {</div><div class="line"><a name="l00832"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_precedence_event.html#a79a74bd07a8525e729a55c74f7edf5a8"> 832</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a79a74bd07a8525e729a55c74f7edf5a8">start_min</a>;</div><div class="line"><a name="l00833"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_precedence_event.html#a42030b641a6e87057b56a8bcce50d74d"> 833</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a42030b641a6e87057b56a8bcce50d74d">start_max</a>;</div><div class="line"><a name="l00834"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_precedence_event.html#a44f4c48334f8c6331c4529a8d3a24890"> 834</a></span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a44f4c48334f8c6331c4529a8d3a24890">start</a>;</div><div class="line"><a name="l00835"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_precedence_event.html#a5370a7b26b844e14470a72da8356f542"> 835</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a5370a7b26b844e14470a72da8356f542">end_min</a>;</div><div class="line"><a name="l00836"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_precedence_event.html#adf60ac80f206800313d477b023b6fcf0"> 836</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#adf60ac80f206800313d477b023b6fcf0">end_max</a>;</div><div class="line"><a name="l00837"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_precedence_event.html#a7c9fbb0345c1acfa72199617f10038ac"> 837</a></span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a7c9fbb0345c1acfa72199617f10038ac">end</a>;</div><div class="line"><a name="l00838"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_precedence_event.html#a766465a77b29d9d4c1401711b5e1083c"> 838</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a766465a77b29d9d4c1401711b5e1083c">demand_min</a>;</div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span> };</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span> </div><div class="line"><a name="l00841"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a11da691271c7e581ccc6383d8c25c666"> 841</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a11da691271c7e581ccc6383d8c25c666">GeneratePrecedenceCuts</a>(</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keyword">const</span> std::string& cut_name,</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values,</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  std::vector<PrecedenceEvent> events, IntegerValue capacity_max,</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</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>, <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_events = events.size();</div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  <span class="keywordflow">if</span> (num_events <= 1) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span> </div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  std::sort(events.begin(), events.end(),</div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  [](<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html">PrecedenceEvent</a>& e1, <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html">PrecedenceEvent</a>& e2) {</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="keywordflow">return</span> e1.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a79a74bd07a8525e729a55c74f7edf5a8">start_min</a> < e2.start_min ||</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  (e1.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a79a74bd07a8525e729a55c74f7edf5a8">start_min</a> == e2.start_min && e1.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#adf60ac80f206800313d477b023b6fcf0">end_max</a> < e2.end_max);</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  });</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span> </div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> tolerance = 1e-4;</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span> </div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i + 1 < num_events; ++i) {</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html">PrecedenceEvent</a>& e1 = events[i];</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j < num_events; ++j) {</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html">PrecedenceEvent</a>& e2 = events[j];</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keywordflow">if</span> (e2.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a79a74bd07a8525e729a55c74f7edf5a8">start_min</a> >= e1.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#adf60ac80f206800313d477b023b6fcf0">end_max</a>) <span class="keywordflow">break</span>; <span class="comment">// Break out of the index2 loop.</span></div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span> </div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  <span class="comment">// Encode only the interesting pairs.</span></div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="keywordflow">if</span> (e1.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a766465a77b29d9d4c1401711b5e1083c">demand_min</a> + e2.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a766465a77b29d9d4c1401711b5e1083c">demand_min</a> <= capacity_max) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span> </div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> interval_1_can_precede_2 = e1.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a5370a7b26b844e14470a72da8356f542">end_min</a> <= e2.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a42030b641a6e87057b56a8bcce50d74d">start_max</a>;</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> interval_2_can_precede_1 = e2.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a5370a7b26b844e14470a72da8356f542">end_min</a> <= e1.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a42030b641a6e87057b56a8bcce50d74d">start_max</a>;</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span> </div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="keywordflow">if</span> (interval_1_can_precede_2 && !interval_2_can_precede_1 &&</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  e1.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a7c9fbb0345c1acfa72199617f10038ac">end</a>.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(lp_values) >=</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  e2.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a44f4c48334f8c6331c4529a8d3a24890">start</a>.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(lp_values) + tolerance) {</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="comment">// interval1.end <= interval2.start</span></div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">LinearConstraintBuilder</a> cut(<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="l00874"></a><span class="lineno"> 874</span>  cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(e1.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a7c9fbb0345c1acfa72199617f10038ac">end</a>, IntegerValue(1));</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(e2.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a44f4c48334f8c6331c4529a8d3a24890">start</a>, IntegerValue(-1));</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (interval_2_can_precede_1 && !interval_1_can_precede_2 &&</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  e2.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a7c9fbb0345c1acfa72199617f10038ac">end</a>.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(lp_values) >=</div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  e1.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a44f4c48334f8c6331c4529a8d3a24890">start</a>.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(lp_values) + tolerance) {</div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <span class="comment">// interval2.end <= interval1.start</span></div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">LinearConstraintBuilder</a> cut(<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="l00881"></a><span class="lineno"> 881</span>  cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(e2.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a7c9fbb0345c1acfa72199617f10038ac">end</a>, IntegerValue(1));</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(e1.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a44f4c48334f8c6331c4529a8d3a24890">start</a>, IntegerValue(-1));</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  manager-><a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a9456bb31790e4dae791914e3c065b460">AddCut</a>(cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">Build</a>(), cut_name, lp_values);</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  }</div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  }</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  }</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span> }</div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span> </div><div class="line"><a name="l00889"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ac8570d5d120d42444fded60c841c6616"> 889</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code" href="namespaceoperations__research_1_1sat.html#ac8570d5d120d42444fded60c841c6616">CreateCumulativePrecedenceCutGenerator</a>(</div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& intervals,</div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a>& <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>,</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="keyword">const</span> std::vector<AffineExpression>& demands, <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="l00893"></a><span class="lineno"> 893</span>  <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span> </div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper =</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>(intervals, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(helper);</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span> </div><div class="line"><a name="l00899"></a><span class="lineno"> 899</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="l00900"></a><span class="lineno"> 900</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a64dd4ef1984ac7dd7fdb25c7b2765554">AppendVariablesToCumulativeCut</a>(<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, demands, integer_trail, &result);</div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span> </div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  AddIntegerVariableFromIntervals(helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, &result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <a class="code" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span> </div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>();</div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span> </div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">generate_cuts</a> =</div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  [trail, integer_trail, helper, demands, <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>](</div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values,</div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  <span class="keywordflow">if</span> (trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() > 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span> </div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <span class="keyword">const</span> IntegerValue capacity_max = integer_trail->UpperBound(<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>);</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  std::vector<PrecedenceEvent> events;</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < helper->NumTasks(); ++t) {</div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <span class="keywordflow">if</span> (!helper->IsPresent(t)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html">PrecedenceEvent</a> event;</div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <span class="keyword">event</span>.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a79a74bd07a8525e729a55c74f7edf5a8">start_min</a> = helper->StartMin(t);</div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="keyword">event</span>.start_max = helper->StartMax(t);</div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <span class="keyword">event</span>.start = helper->Starts()[t];</div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="keyword">event</span>.end_min = helper->EndMin(t);</div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="keyword">event</span>.end_max = helper->EndMax(t);</div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="keyword">event</span>.end = helper->Ends()[t];</div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="keyword">event</span>.demand_min = integer_trail->LowerBound(demands[t]);</div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  events.push_back(event);</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  }</div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a11da691271c7e581ccc6383d8c25c666">GeneratePrecedenceCuts</a>(<span class="stringliteral">"CumulativePrecedence"</span>, lp_values,</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  std::move(events), capacity_max, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, manager);</div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  };</div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span> }</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span> </div><div class="line"><a name="l00934"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a23849eabdcf8e9f6f90e7aa05b298dc9"> 934</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code" href="namespaceoperations__research_1_1sat.html#a23849eabdcf8e9f6f90e7aa05b298dc9">CreateNoOverlapPrecedenceCutGenerator</a>(</div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& intervals, <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="l00936"></a><span class="lineno"> 936</span>  <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span> </div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper =</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>(intervals, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(helper);</div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span> </div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  AddIntegerVariableFromIntervals(helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, &result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  <a class="code" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span> </div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>();</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span> </div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">generate_cuts</a> =</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  [trail, helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>](</div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values,</div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  <span class="keywordflow">if</span> (trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() > 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span> </div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  std::vector<PrecedenceEvent> events;</div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < helper->NumTasks(); ++t) {</div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <span class="keywordflow">if</span> (!helper->IsPresent(t)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  <a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html">PrecedenceEvent</a> event;</div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  <span class="keyword">event</span>.<a class="code" href="structoperations__research_1_1sat_1_1_precedence_event.html#a79a74bd07a8525e729a55c74f7edf5a8">start_min</a> = helper->StartMin(t);</div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  <span class="keyword">event</span>.start_max = helper->StartMax(t);</div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="keyword">event</span>.start = helper->Starts()[t];</div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="keyword">event</span>.end_min = helper->EndMin(t);</div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  <span class="keyword">event</span>.end_max = helper->EndMax(t);</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="keyword">event</span>.end = helper->Ends()[t];</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <span class="keyword">event</span>.demand_min = IntegerValue(1);</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  events.push_back(event);</div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  }</div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a11da691271c7e581ccc6383d8c25c666">GeneratePrecedenceCuts</a>(<span class="stringliteral">"NoOverlapPrecedence"</span>, lp_values,</div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  std::move(events), IntegerValue(1), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  manager);</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  };</div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span> </div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span> }</div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span> </div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span> <span class="comment">// Stores the event for a rectangle along the two axis x and y.</span></div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span> <span class="comment">// For a no_overlap constraint, y is always of size 1 between 0 and 1.</span></div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span> <span class="comment">// For a cumulative constraint, y is the demand that must be between 0 and</span></div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span> <span class="comment">// capacity_max.</span></div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span> <span class="comment">// For a no_overlap_2d constraint, y the other dimension of the rect.</span></div><div class="line"><a name="l00980"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_ct_event.html"> 980</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html">CtEvent</a> {</div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <span class="comment">// The start min of the x interval.</span></div><div class="line"><a name="l00982"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_ct_event.html#aae5633dcc6f196817cf87ff999faa6af"> 982</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#aae5633dcc6f196817cf87ff999faa6af">x_start_min</a>;</div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span> </div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  <span class="comment">// The size min of the x interval.</span></div><div class="line"><a name="l00985"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_ct_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2"> 985</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">x_size_min</a>;</div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span> </div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  <span class="comment">// The end of the x interval.</span></div><div class="line"><a name="l00988"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_ct_event.html#aafe035000b060515489304c1d769c1c8"> 988</a></span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#aafe035000b060515489304c1d769c1c8">x_end</a>;</div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span> </div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="comment">// The lp value of the end of the x interval.</span></div><div class="line"><a name="l00991"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_ct_event.html#abd3efe555c40cabd2d93bc58dc5d6f0f"> 991</a></span>  <span class="keywordtype">double</span> <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#abd3efe555c40cabd2d93bc58dc5d6f0f">x_lp_end</a>;</div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span> </div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <span class="comment">// The start min of the y interval.</span></div><div class="line"><a name="l00994"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_ct_event.html#a5113c9bb6a8fa5f8213f4e3eeb93b5fb"> 994</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#a5113c9bb6a8fa5f8213f4e3eeb93b5fb">y_start_min</a>;</div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span> </div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  <span class="comment">// The end max of the y interval.</span></div><div class="line"><a name="l00997"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_ct_event.html#a8aa9f672169eb8bb479c7f3e98e7a334"> 997</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#a8aa9f672169eb8bb479c7f3e98e7a334">y_end_max</a>;</div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span> </div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <span class="comment">// The min energy of the task (this is always larger or equal to x_size_min *</span></div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  <span class="comment">// y_size_min).</span></div><div class="line"><a name="l01001"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_ct_event.html#a4f71e6fc95b8de0290911759804601d4"> 1001</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#a4f71e6fc95b8de0290911759804601d4">energy_min</a>;</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span> </div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  <span class="comment">// Indicates if the events used the optional energy information from the</span></div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="comment">// model.</span></div><div class="line"><a name="l01005"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_ct_event.html#a938bfef8e3fbad056a67e91392c95df8"> 1005</a></span>  <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#a938bfef8e3fbad056a67e91392c95df8">use_energy</a> = <span class="keyword">false</span>;</div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span> </div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <span class="comment">// Indicates if the cut is lifted, that is if it includes tasks that are not</span></div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="comment">// strictly contained in the current time window.</span></div><div class="line"><a name="l01009"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_ct_event.html#a6382230ccc5d66808e87821bfcc3f6a4"> 1009</a></span>  <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#a6382230ccc5d66808e87821bfcc3f6a4">lifted</a> = <span class="keyword">false</span>;</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span> </div><div class="line"><a name="l01011"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_ct_event.html#a764be64f3029f8b8e23511061d8de355"> 1011</a></span>  std::string <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  <span class="keywordflow">return</span> absl::StrCat(<span class="stringliteral">"CtEvent(x_end = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#aafe035000b060515489304c1d769c1c8">x_end</a>.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#ac3740684133a43f28203f0b85ed847b7">DebugString</a>(),</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  <span class="stringliteral">", x_start_min = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#aae5633dcc6f196817cf87ff999faa6af">x_start_min</a>.value(),</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  <span class="stringliteral">", x_size_min = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">x_size_min</a>.value(),</div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  <span class="stringliteral">", x_lp_end = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#abd3efe555c40cabd2d93bc58dc5d6f0f">x_lp_end</a>,</div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <span class="stringliteral">", y_start_min = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#a5113c9bb6a8fa5f8213f4e3eeb93b5fb">y_start_min</a>.value(),</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  <span class="stringliteral">", y_end_max = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#a8aa9f672169eb8bb479c7f3e98e7a334">y_end_max</a>.value(),</div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <span class="stringliteral">", energy_min = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#a4f71e6fc95b8de0290911759804601d4">energy_min</a>.value(),</div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="stringliteral">", use_energy = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#a938bfef8e3fbad056a67e91392c95df8">use_energy</a>, <span class="stringliteral">", lifted = "</span>, <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#a6382230ccc5d66808e87821bfcc3f6a4">lifted</a>);</div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  }</div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span> };</div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span> </div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span> <span class="comment">// We generate the cut from the Smith's rule from:</span></div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span> <span class="comment">// M. Queyranne, Structure of a simple scheduling polyhedron,</span></div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span> <span class="comment">// Mathematical Programming 58 (1993), 263–285</span></div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span> <span class="comment">//</span></div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span> <span class="comment">// The original cut is:</span></div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span> <span class="comment">// sum(end_min_i * duration_min_i) >=</span></div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span> <span class="comment">// (sum(duration_min_i^2) + sum(duration_min_i)^2) / 2</span></div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span> <span class="comment">// We strenghten this cuts by noticing that if all tasks starts after S,</span></div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span> <span class="comment">// then replacing end_min_i by (end_min_i - S) is still valid.</span></div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span> <span class="comment">//</span></div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span> <span class="comment">// A second difference is that we look at a set of intervals starting</span></div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span> <span class="comment">// after a given start_min, sorted by relative (end_lp - start_min).</span></div><div class="line"><a name="l01035"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a7181fb054123974741e1ead27c6cf635"> 1035</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a7181fb054123974741e1ead27c6cf635">GenerateCompletionTimeCuts</a>(</div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  <span class="keyword">const</span> std::string& cut_name,</div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values,</div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  std::vector<CtEvent> events, <span class="keywordtype">bool</span> use_lifting, <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="l01039"></a><span class="lineno"> 1039</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  <a class="code" href="classoperations__research_1_1sat_1_1_top_n_cuts.html">TopNCuts</a> top_n_cuts(15);</div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span> </div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  <span class="comment">// Sort by start min to bucketize by start_min.</span></div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  std::sort(events.begin(), events.end(),</div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  [](<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html">CtEvent</a>& e1, <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html">CtEvent</a>& e2) {</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  <span class="keywordflow">return</span> e1.<a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#aae5633dcc6f196817cf87ff999faa6af">x_start_min</a> < e2.x_start_min;</div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  });</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> start = 0; start + 1 < events.size(); ++start) {</div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <span class="comment">// Skip to the next start_min value.</span></div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="keywordflow">if</span> (start > 0 &&</div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  events[start].x_start_min == events[start - 1].x_start_min) {</div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  }</div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span> </div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  <span class="keyword">const</span> IntegerValue sequence_start_min = events[start].x_start_min;</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  std::vector<CtEvent> residual_tasks(events.begin() + start, events.end());</div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span> </div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  <span class="comment">// We look at event that start before sequence_start_min, but are forced</span></div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  <span class="comment">// to cross this time point. In that case, we replace this event by a</span></div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  <span class="comment">// truncated event starting at sequence_start_min. To do this, we reduce</span></div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  <span class="comment">// the size_min, align the start_min with the sequence_start_min, and</span></div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  <span class="comment">// scale the energy down accordingly.</span></div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  <span class="keywordflow">if</span> (use_lifting) {</div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> before = 0; before < start; ++before) {</div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  <span class="keywordflow">if</span> (events[before].x_start_min + events[before].x_size_min ></div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  sequence_start_min) {</div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  <span class="comment">// Build the vector of energies as the vector of sizes.</span></div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html">CtEvent</a> <span class="keyword">event</span> = events[before]; <span class="comment">// Copy.</span></div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  <span class="keyword">event</span>.lifted = <span class="keyword">true</span>;</div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  <span class="keyword">const</span> IntegerValue old_size_min = <span class="keyword">event</span>.x_size_min;</div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  <span class="keyword">event</span>.x_size_min =</div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="keyword">event</span>.x_size_min + <span class="keyword">event</span>.x_start_min - sequence_start_min;</div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  <span class="keyword">event</span>.x_start_min = sequence_start_min;</div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  <span class="comment">// We can rescale the energy min correctly.</span></div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  <span class="comment">//</span></div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  <span class="comment">// Let's take the example of a rectangle of size 2 * 20 that overlaps</span></div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="comment">// sequence start min by 1, and that can rotate by 90 degrees.</span></div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  <span class="comment">// The energy min is 40, size min is 2, size_max is 20.</span></div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  <span class="comment">// If the rectangle is horizontal, the lifted energy is:</span></div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="comment">// (20 - 1) * 2 = 38</span></div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  <span class="comment">// If the rectangle is vertical, the lifted energy is:</span></div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  <span class="comment">// (2 - 1) * 20 = 20</span></div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  <span class="comment">// The min of the two is always reached when size = size_min.</span></div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  <span class="keyword">event</span>.energy_min = <span class="keyword">event</span>.energy_min * <span class="keyword">event</span>.x_size_min / old_size_min;</div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  residual_tasks.push_back(event);</div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  }</div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  }</div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  }</div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span> </div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  std::sort(residual_tasks.begin(), residual_tasks.end(),</div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  [](<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html">CtEvent</a>& e1, <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html">CtEvent</a>& e2) {</div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  <span class="keywordflow">return</span> e1.<a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#abd3efe555c40cabd2d93bc58dc5d6f0f">x_lp_end</a> < e2.x_lp_end;</div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  });</div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span> </div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="keywordtype">int</span> best_end = -1;</div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  <span class="keywordtype">double</span> best_efficacy = 0.01;</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  IntegerValue best_min_contrib(0);</div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  IntegerValue sum_duration(0);</div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  IntegerValue sum_square_duration(0);</div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  IntegerValue best_size_divisor(0);</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  <span class="keywordtype">double</span> unscaled_lp_contrib = 0;</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  IntegerValue current_start_min(<a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>);</div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  IntegerValue y_start_min = <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  IntegerValue y_end_max = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span> </div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < residual_tasks.size(); ++i) {</div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html">CtEvent</a>& <span class="keyword">event</span> = residual_tasks[i];</div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(event.x_start_min, sequence_start_min);</div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="resource_8cc.html#a4a6149ef5bdc681a998b90bb5c165bf3">energy</a> = <span class="keyword">event</span>.energy_min;</div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  sum_duration += <a class="code" href="resource_8cc.html#a4a6149ef5bdc681a998b90bb5c165bf3">energy</a>;</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  sum_square_duration += <a class="code" href="resource_8cc.html#a4a6149ef5bdc681a998b90bb5c165bf3">energy</a> * <a class="code" href="resource_8cc.html#a4a6149ef5bdc681a998b90bb5c165bf3">energy</a>;</div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  unscaled_lp_contrib += <span class="keyword">event</span>.x_lp_end * <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(<a class="code" href="resource_8cc.html#a4a6149ef5bdc681a998b90bb5c165bf3">energy</a>);</div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  current_start_min = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(current_start_min, event.x_start_min);</div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  y_start_min = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(y_start_min, event.y_start_min);</div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  y_end_max = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(y_end_max, event.y_end_max);</div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span> </div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  <span class="keyword">const</span> IntegerValue size_divisor = y_end_max - y_start_min;</div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span> </div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  <span class="comment">// We compute the cuts with all the sizes actually equal to</span></div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  <span class="comment">// size_min * demand_min / size_divisor</span></div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  <span class="comment">// but to keep the computation in the integer domain, we multiply by</span></div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  <span class="comment">// size_divisor where needed instead.</span></div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  <span class="keyword">const</span> IntegerValue min_contrib =</div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  (sum_duration * sum_duration + sum_square_duration) / 2 +</div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  current_start_min * sum_duration * size_divisor;</div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> efficacy = (<a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(min_contrib) -</div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  unscaled_lp_contrib * <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(size_divisor)) /</div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  std::sqrt(<a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(sum_square_duration));</div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  <span class="comment">// TODO(user): Check overflow and ignore if too big.</span></div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  <span class="keywordflow">if</span> (efficacy > best_efficacy) {</div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  best_efficacy = efficacy;</div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  best_end = i;</div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  best_min_contrib = min_contrib;</div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  best_size_divisor = size_divisor;</div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  }</div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  }</div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  <span class="keywordflow">if</span> (best_end != -1) {</div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">LinearConstraintBuilder</a> cut(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, best_min_contrib, <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>);</div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  <span class="keywordtype">bool</span> is_lifted = <span class="keyword">false</span>;</div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  <span class="keywordtype">bool</span> use_energy = <span class="keyword">false</span>;</div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i <= best_end; ++i) {</div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html">CtEvent</a>& <span class="keyword">event</span> = residual_tasks[i];</div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  is_lifted |= <span class="keyword">event</span>.<a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#a6382230ccc5d66808e87821bfcc3f6a4">lifted</a>;</div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  use_energy |= <span class="keyword">event</span>.use_energy;</div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(event.x_end, event.energy_min * best_size_divisor);</div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  }</div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  std::string full_name = cut_name;</div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  <span class="keywordflow">if</span> (is_lifted) full_name.append(<span class="stringliteral">"_lifted"</span>);</div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  <span class="keywordflow">if</span> (use_energy) full_name.append(<span class="stringliteral">"_energy"</span>);</div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  top_n_cuts.<a class="code" href="classoperations__research_1_1sat_1_1_top_n_cuts.html#a713bdb803c52b7b7ac3c52ba9b869530">AddCut</a>(cut.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">Build</a>(), full_name, lp_values);</div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  }</div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  }</div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  top_n_cuts.<a class="code" href="classoperations__research_1_1sat_1_1_top_n_cuts.html#afb0f85e921e0f240d59d2a739e6b5712">TransferToManager</a>(lp_values, manager);</div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span> }</div><div class="line"><a name="l01154"></a><span class="lineno"> 1154</span> </div><div class="line"><a name="l01155"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a18fe82932180e2e3bac0fbdf957f01a0"> 1155</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code" href="namespaceoperations__research_1_1sat.html#a18fe82932180e2e3bac0fbdf957f01a0">CreateNoOverlapCompletionTimeCutGenerator</a>(</div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& intervals, <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="l01157"></a><span class="lineno"> 1157</span>  <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span> </div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper =</div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>(intervals, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(helper);</div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span> </div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  AddIntegerVariableFromIntervals(helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, &result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  <a class="code" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span> </div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>();</div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span> </div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">generate_cuts</a> =</div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  [trail, helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>](</div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values,</div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  <span class="keywordflow">if</span> (trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() > 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span> </div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  <span class="keyword">auto</span> generate_cuts = [&lp_values, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, manager,</div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  helper](<span class="keyword">const</span> std::string& cut_name) {</div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  std::vector<CtEvent> events;</div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < helper->NumTasks(); ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  <span class="keywordflow">if</span> (!helper->IsPresent(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <span class="keyword">const</span> IntegerValue size_min = helper->SizeMin(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  <span class="keywordflow">if</span> (size_min > 0) {</div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> end_expr = helper->Ends()[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html">CtEvent</a> event;</div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  <span class="keyword">event</span>.<a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#aae5633dcc6f196817cf87ff999faa6af">x_start_min</a> = helper->StartMin(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  <span class="keyword">event</span>.x_size_min = size_min;</div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  <span class="keyword">event</span>.x_end = end_expr;</div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <span class="keyword">event</span>.x_lp_end = end_expr.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(lp_values);</div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  <span class="keyword">event</span>.y_start_min = IntegerValue(0);</div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  <span class="keyword">event</span>.y_end_max = IntegerValue(1);</div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  <span class="keyword">event</span>.energy_min = size_min;</div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  events.push_back(event);</div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  }</div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  }</div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a7181fb054123974741e1ead27c6cf635">GenerateCompletionTimeCuts</a>(cut_name, lp_values, std::move(events),</div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  <span class="comment">/*use_lifting=*/</span><span class="keyword">false</span>, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, manager);</div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  };</div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  <span class="keywordflow">if</span> (!helper->SynchronizeAndSetTimeDirection(<span class="keyword">true</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  generate_cuts(<span class="stringliteral">"NoOverlapCompletionTime"</span>);</div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  <span class="keywordflow">if</span> (!helper->SynchronizeAndSetTimeDirection(<span class="keyword">false</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  generate_cuts(<span class="stringliteral">"NoOverlapCompletionTimeMirror"</span>);</div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  };</div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span> }</div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span> </div><div class="line"><a name="l01205"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#aac7919596b8f8087a558d3d4d6430d00"> 1205</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code" href="namespaceoperations__research_1_1sat.html#aac7919596b8f8087a558d3d4d6430d00">CreateCumulativeCompletionTimeCutGenerator</a>(</div><div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& intervals,</div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a>& <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>,</div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  <span class="keyword">const</span> std::vector<AffineExpression>& demands,</div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  <span class="keyword">const</span> std::vector<LinearExpression>& energies, <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="l01210"></a><span class="lineno"> 1210</span>  <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div><div class="line"><a name="l01211"></a><span class="lineno"> 1211</span> </div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper =</div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>(intervals, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(helper);</div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span> </div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</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="l01217"></a><span class="lineno"> 1217</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a64dd4ef1984ac7dd7fdb25c7b2765554">AppendVariablesToCumulativeCut</a>(<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, demands, integer_trail, &result);</div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span> </div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  AddIntegerVariableFromIntervals(helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, &result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  <a class="code" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l01221"></a><span class="lineno"> 1221</span> </div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>();</div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span> </div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">generate_cuts</a> =</div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  [trail, integer_trail, helper, demands, energies, <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>](</div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values,</div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  <span class="keywordflow">if</span> (trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() > 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01229"></a><span class="lineno"> 1229</span> </div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  <span class="keyword">const</span> IntegerValue capacity_max = integer_trail->UpperBound(<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>);</div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  <span class="keyword">auto</span> generate_cuts = [&lp_values, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, manager, helper, capacity_max,</div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  integer_trail, &demands,</div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  &energies](<span class="keyword">const</span> std::string& cut_name) {</div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  std::vector<CtEvent> events;</div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < helper->NumTasks(); ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  <span class="keywordflow">if</span> (!helper->IsPresent(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  <span class="keywordflow">if</span> (helper->SizeMin(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) > 0 &&</div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  integer_trail->LowerBound(demands[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]) > 0) {</div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> end_expr = helper->Ends()[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  <span class="keyword">const</span> IntegerValue size_min = helper->SizeMin(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div><div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  <span class="keyword">const</span> IntegerValue demand_min =</div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  integer_trail->LowerBound(demands[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span> </div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html">CtEvent</a> event;</div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  <span class="keyword">event</span>.<a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#aae5633dcc6f196817cf87ff999faa6af">x_start_min</a> = helper->StartMin(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  <span class="keyword">event</span>.x_size_min = size_min;</div><div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  <span class="keyword">event</span>.x_end = end_expr;</div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  <span class="keyword">event</span>.x_lp_end = end_expr.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(lp_values);</div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  <span class="keyword">event</span>.y_start_min = IntegerValue(0);</div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  <span class="keyword">event</span>.y_end_max = IntegerValue(capacity_max);</div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  <span class="keyword">event</span>.energy_min = size_min * demand_min;</div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  <span class="comment">// TODO(user): Investigate and re-enable a correct version.</span></div><div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  <span class="keywordflow">if</span> (<span class="comment">/*DISABLES_CODE*/</span> (<span class="keyword">false</span>) &&</div><div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a88c8ab90d500702234707905c3b07ad2">ProductIsLinearized</a>(energies[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>])) {</div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  <span class="keyword">const</span> IntegerValue linearized_energy =</div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a14ed349a41e2b31bb1c15ea3c44a6bc0">LinExprLowerBound</a>(energies[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>], *integer_trail);</div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  <span class="keywordflow">if</span> (linearized_energy > event.<a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#a4f71e6fc95b8de0290911759804601d4">energy_min</a>) {</div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  <span class="keyword">event</span>.energy_min = linearized_energy;</div><div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  <span class="keyword">event</span>.use_energy = <span class="keyword">true</span>;</div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  }</div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  }</div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  events.push_back(event);</div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  }</div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  }</div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a7181fb054123974741e1ead27c6cf635">GenerateCompletionTimeCuts</a>(cut_name, lp_values, std::move(events),</div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  <span class="comment">/*use_lifting=*/</span><span class="keyword">true</span>, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, manager);</div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  };</div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  <span class="keywordflow">if</span> (!helper->SynchronizeAndSetTimeDirection(<span class="keyword">true</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  generate_cuts(<span class="stringliteral">"CumulativeCompletionTime"</span>);</div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  <span class="keywordflow">if</span> (!helper->SynchronizeAndSetTimeDirection(<span class="keyword">false</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  generate_cuts(<span class="stringliteral">"CumulativeCompletionTimeMirror"</span>);</div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  };</div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l01275"></a><span class="lineno"> 1275</span> }</div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span> </div><div class="line"><a name="l01277"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a7bd8a488b0a7ee7905bdab4c5984bd70"> 1277</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code" href="namespaceoperations__research_1_1sat.html#a7bd8a488b0a7ee7905bdab4c5984bd70">CreateNoOverlap2dCompletionTimeCutGenerator</a>(</div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& x_intervals,</div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& y_intervals, <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="l01280"></a><span class="lineno"> 1280</span>  <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span> </div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* x_helper =</div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>(x_intervals, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(x_helper);</div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span> </div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* y_helper =</div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>(y_intervals, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(y_helper);</div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span> </div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  AddIntegerVariableFromIntervals(x_helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, &result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  AddIntegerVariableFromIntervals(y_helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, &result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  <a class="code" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>);</div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span> </div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>();</div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span> </div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">generate_cuts</a> =</div><div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  [trail, x_helper, y_helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>](</div><div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values,</div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div><div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  <span class="keywordflow">if</span> (trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() > 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span> </div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  <span class="keywordflow">if</span> (!x_helper->SynchronizeAndSetTimeDirection(<span class="keyword">true</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  <span class="keywordflow">if</span> (!y_helper->SynchronizeAndSetTimeDirection(<span class="keyword">true</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span> </div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_rectangles = x_helper->NumTasks();</div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  std::vector<int> active_rectangles;</div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  std::vector<IntegerValue> cached_areas(num_rectangles);</div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  std::vector<Rectangle> cached_rectangles(num_rectangles);</div><div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> rect = 0; rect < num_rectangles; ++rect) {</div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  <span class="keywordflow">if</span> (!y_helper->IsPresent(rect) || !y_helper->IsPresent(rect))</div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span> </div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  cached_areas[rect] =</div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  x_helper->SizeMin(rect) * y_helper->SizeMin(rect);</div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  <span class="keywordflow">if</span> (cached_areas[rect] == 0) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span> </div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  <span class="comment">// TODO(user): It might be possible/better to use some shifted value</span></div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  <span class="comment">// here, but for now this code is not in the hot spot, so better be</span></div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  <span class="comment">// defensive and only do connected components on really disjoint</span></div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  <span class="comment">// rectangles.</span></div><div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  <a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html">Rectangle</a>& rectangle = cached_rectangles[rect];</div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  rectangle.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a1f62ae069f3793df9ae18399ba6d052c">x_min</a> = x_helper->StartMin(rect);</div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  rectangle.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a0cc9a3a200ee27bae9b9907d97b5718e">x_max</a> = x_helper->EndMax(rect);</div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  rectangle.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a379a897decc0711464cb15e8d02fd095">y_min</a> = y_helper->StartMin(rect);</div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  rectangle.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#ae39303b5b3149e1914834c36ad51fe8f">y_max</a> = y_helper->EndMax(rect);</div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span> </div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  active_rectangles.push_back(rect);</div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  }</div><div class="line"><a name="l01329"></a><span class="lineno"> 1329</span> </div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  <span class="keywordflow">if</span> (active_rectangles.size() <= 1) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span> </div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  std::vector<absl::Span<int>> components =</div><div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a3e2516c0d3fc4991896c6a9bbead80e7">GetOverlappingRectangleComponents</a>(</div><div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  cached_rectangles, absl::MakeSpan(active_rectangles));</div><div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  <span class="keywordflow">for</span> (absl::Span<int> rectangles : components) {</div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  <span class="keywordflow">if</span> (rectangles.size() <= 1) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span> </div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  <span class="keyword">auto</span> generate_cuts = [&lp_values, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, manager, &rectangles,</div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  &cached_areas](</div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  <span class="keyword">const</span> std::string& cut_name,</div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* x_helper,</div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* y_helper) {</div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  std::vector<CtEvent> events;</div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span> </div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> rect : rectangles) {</div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> x_end_expr = x_helper->Ends()[rect];</div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  <a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html">CtEvent</a> event;</div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  <span class="keyword">event</span>.<a class="code" href="structoperations__research_1_1sat_1_1_ct_event.html#aae5633dcc6f196817cf87ff999faa6af">x_start_min</a> = x_helper->ShiftedStartMin(rect);</div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  <span class="keyword">event</span>.x_size_min = x_helper->SizeMin(rect);</div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  <span class="keyword">event</span>.x_end = x_end_expr;</div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  <span class="keyword">event</span>.x_lp_end = x_end_expr.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">LpValue</a>(lp_values);</div><div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  <span class="keyword">event</span>.y_start_min = y_helper->ShiftedStartMin(rect);</div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  <span class="keyword">event</span>.y_end_max = y_helper->ShiftedEndMax(rect);</div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  <span class="keyword">event</span>.energy_min =</div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  x_helper->SizeMin(rect) * y_helper->SizeMin(rect);</div><div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  events.push_back(event);</div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  }</div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span> </div><div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a7181fb054123974741e1ead27c6cf635">GenerateCompletionTimeCuts</a>(cut_name, lp_values, std::move(events),</div><div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  <span class="comment">/*use_lifting=*/</span><span class="keyword">true</span>, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, manager);</div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  };</div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span> </div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  <span class="keywordflow">if</span> (!x_helper->SynchronizeAndSetTimeDirection(<span class="keyword">true</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  <span class="keywordflow">if</span> (!y_helper->SynchronizeAndSetTimeDirection(<span class="keyword">true</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  generate_cuts(<span class="stringliteral">"NoOverlap2dXCompletionTime"</span>, x_helper, y_helper);</div><div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  generate_cuts(<span class="stringliteral">"NoOverlap2dYCompletionTime"</span>, y_helper, x_helper);</div><div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  <span class="keywordflow">if</span> (!x_helper->SynchronizeAndSetTimeDirection(<span class="keyword">false</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  <span class="keywordflow">if</span> (!y_helper->SynchronizeAndSetTimeDirection(<span class="keyword">false</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  generate_cuts(<span class="stringliteral">"NoOverlap2dXCompletionTimeMirror"</span>, x_helper, y_helper);</div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  generate_cuts(<span class="stringliteral">"NoOverlap2dYCompletionTimeMirror"</span>, y_helper, x_helper);</div><div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  }</div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  };</div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span> }</div><div class="line"><a name="l01376"></a><span class="lineno"> 1376</span> </div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span> } <span class="comment">// namespace sat</span></div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_afdbd968230d01fa0e91bc15b6f5994e3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">operations_research::sat::SchedulingConstraintHelper::SizeMin</a></div><div class="ttdeci">IntegerValue SizeMin(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00226">intervals.h:226</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ab62fb8f885a68c653b586424aa5863c8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab62fb8f885a68c653b586424aa5863c8">operations_research::sat::CreateNoOverlapEnergyCutGenerator</a></div><div class="ttdeci">CutGenerator CreateNoOverlapEnergyCutGenerator(const std::vector< IntervalVariable > &intervals, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00480">scheduling_cuts.cc:480</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_a0dd6e2baf0ea9a1cbd252bed5a8890da"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#a0dd6e2baf0ea9a1cbd252bed5a8890da">operations_research::sat::EnergyEvent::x_end_min</a></div><div class="ttdeci">IntegerValue x_end_min</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00100">scheduling_cuts.cc:100</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ad8f69698386f241297b78589c1f57c3e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">operations_research::sat::SchedulingConstraintHelper::StartMax</a></div><div class="ttdeci">IntegerValue StartMax(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00233">intervals.h:233</a></div></div>
|
||
<div class="ttc" id="alldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_precedence_event_html_a42030b641a6e87057b56a8bcce50d74d"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_precedence_event.html#a42030b641a6e87057b56a8bcce50d74d">operations_research::sat::PrecedenceEvent::start_max</a></div><div class="ttdeci">IntegerValue start_max</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00833">scheduling_cuts.cc:833</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a14ed349a41e2b31bb1c15ea3c44a6bc0"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a14ed349a41e2b31bb1c15ea3c44a6bc0">operations_research::sat::LinExprLowerBound</a></div><div class="ttdeci">IntegerValue LinExprLowerBound(const LinearExpression &expr, const IntegerTrail &integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00348">sat/linear_constraint.cc:348</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a8e6fcd6ce93a128626dede9f9cc89348"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">operations_research::sat::SchedulingConstraintHelper::IsAbsent</a></div><div class="ttdeci">bool IsAbsent(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00483">intervals.h:483</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_precedence_event_html_adf60ac80f206800313d477b023b6fcf0"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_precedence_event.html#adf60ac80f206800313d477b023b6fcf0">operations_research::sat::PrecedenceEvent::end_max</a></div><div class="ttdeci">IntegerValue end_max</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00836">scheduling_cuts.cc:836</a></div></div>
|
||
<div class="ttc" id="stl__util_8h_html"><div class="ttname"><a href="stl__util_8h.html">stl_util.h</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_a227a649685aa74d3dbf82f5ff410f782"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#a227a649685aa74d3dbf82f5ff410f782">operations_research::sat::EnergyEvent::y_size</a></div><div class="ttdeci">AffineExpression y_size</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00105">scheduling_cuts.cc:105</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00038">sat/model.h:38</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_a90037a849f93aa8dddc93f0e19868d24"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#a90037a849f93aa8dddc93f0e19868d24">operations_research::sat::EnergyEvent::IsPresent</a></div><div class="ttdeci">bool IsPresent() const</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00124">scheduling_cuts.cc:124</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_a318e14075dca909780636f1eb7435ea2"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#a318e14075dca909780636f1eb7435ea2">operations_research::sat::EnergyEvent::presence_literal_index</a></div><div class="ttdeci">LiteralIndex presence_literal_index</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00110">scheduling_cuts.cc:110</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_top_n_cuts_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_top_n_cuts.html">operations_research::sat::TopNCuts</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint__manager_8h_source.html#l00294">linear_constraint_manager.h:294</a></div></div>
|
||
<div class="ttc" id="scheduling__cuts_8h_html"><div class="ttname"><a href="scheduling__cuts_8h.html">scheduling_cuts.h</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a355a62f25cfadeccfb164ab9fb867c81"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">operations_research::sat::kMinIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMinIntegerValue(-kMaxIntegerValue)</div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#a764be64f3029f8b8e23511061d8de355">operations_research::sat::EnergyEvent::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00134">scheduling_cuts.cc:134</a></div></div>
|
||
<div class="ttc" id="linear__constraint__manager_8h_html"><div class="ttname"><a href="linear__constraint__manager_8h.html">linear_constraint_manager.h</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_afa1aca9725da8adf5c56ea08e7636c32"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afa1aca9725da8adf5c56ea08e7636c32">operations_research::sat::SchedulingConstraintHelper::SizeMax</a></div><div class="ttdeci">IntegerValue SizeMax(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00227">intervals.h:227</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_intervals_repository_html_aa57420b719d949fc4e8fec48c0c41dcc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_intervals_repository.html#aa57420b719d949fc4e8fec48c0c41dcc">operations_research::sat::IntervalsRepository::Size</a></div><div class="ttdeci">AffineExpression Size(IntervalVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00094">intervals.h:94</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_cut_generator_html_a73e4094f2d4e2adbe5e8d79a5b61fcd1"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">operations_research::sat::CutGenerator::vars</a></div><div class="ttdeci">std::vector< IntegerVariable > vars</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00043">cuts.h:43</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_ct_event_html_ab8949d991a8939f5e7f84b1bdebcd7f2"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_ct_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">operations_research::sat::CtEvent::x_size_min</a></div><div class="ttdeci">IntegerValue x_size_min</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00985">scheduling_cuts.cc:985</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_literal_html_a4a11c7c4d7706c09de5e18707c3b5c62"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">operations_research::sat::Literal::Index</a></div><div class="ttdeci">LiteralIndex Index() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00086">sat_base.h:86</a></div></div>
|
||
<div class="ttc" id="time__limit_8h_html"><div class="ttname"><a href="time__limit_8h.html">time_limit.h</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_ab8949d991a8939f5e7f84b1bdebcd7f2"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#ab8949d991a8939f5e7f84b1bdebcd7f2">operations_research::sat::EnergyEvent::x_size_min</a></div><div class="ttdeci">IntegerValue x_size_min</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00113">scheduling_cuts.cc:113</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_builder_html_a49e8e4a987d39f4da335e1ed287bb8ad"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a49e8e4a987d39f4da335e1ed287bb8ad">operations_research::sat::LinearConstraintBuilder::AddLinearExpression</a></div><div class="ttdeci">void AddLinearExpression(const LinearExpression &expr)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00051">sat/linear_constraint.cc:51</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_precedence_event_html_a7c9fbb0345c1acfa72199617f10038ac"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_precedence_event.html#a7c9fbb0345c1acfa72199617f10038ac">operations_research::sat::PrecedenceEvent::end</a></div><div class="ttdeci">AffineExpression end</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00837">scheduling_cuts.cc:837</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a58ca51a90e49e887146f760ba5eb6520"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">operations_research::sat::SchedulingConstraintHelper::IsPresent</a></div><div class="ttdeci">bool IsPresent(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00478">intervals.h:478</a></div></div>
|
||
<div class="ttc" id="gurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00274">gurobi_interface.cc:274</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_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="structoperations__research_1_1sat_1_1_affine_expression_html_aa9c149604bc3f558e14c6d233ebc4b19"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#aa9c149604bc3f558e14c6d233ebc4b19">operations_research::sat::AffineExpression::LpValue</a></div><div class="ttdeci">double LpValue(const absl::StrongVector< IntegerVariable, double > &lp_values) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00272">integer.h:272</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00066">sat_base.h:66</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a775efd540e54bd3be662ce7ee8894c1e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a775efd540e54bd3be662ce7ee8894c1e">operations_research::sat::NewIntegerVariableFromLiteral</a></div><div class="ttdeci">std::function< IntegerVariable(Model *)> NewIntegerVariableFromLiteral(Literal lit)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01630">integer.h:1630</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_builder_html_a094a24aaf66d66b693e7e80a0222f040"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a094a24aaf66d66b693e7e80a0222f040">operations_research::sat::LinearConstraintBuilder::AddLiteralTerm</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool AddLiteralTerm(Literal lit, IntegerValue coeff)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00090">sat/linear_constraint.cc:90</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_rectangle_html_ae39303b5b3149e1914834c36ad51fe8f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html#ae39303b5b3149e1914834c36ad51fe8f">operations_research::sat::Rectangle::y_max</a></div><div class="ttdeci">IntegerValue y_max</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00033">diffn_util.h:33</a></div></div>
|
||
<div class="ttc" id="namespacegtl_html_a288a1dc92da5d3ad62d4bc4cec9e8b1d"><div class="ttname"><a href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a></div><div class="ttdeci">void STLSortAndRemoveDuplicates(T *v, const LessFunc &less_func)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00058">stl_util.h:58</a></div></div>
|
||
<div class="ttc" id="base_2logging_8h_html_ab4f56aa24c4c9cddc47a6abd2d747f9a"><div class="ttname"><a href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a></div><div class="ttdeci">#define DCHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00895">base/logging.h:895</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_linear_expression_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_expression.html">operations_research::sat::LinearExpression</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00088">sat/linear_constraint.h:88</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_rectangle_html_a0cc9a3a200ee27bae9b9907d97b5718e"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html#a0cc9a3a200ee27bae9b9907d97b5718e">operations_research::sat::Rectangle::x_max</a></div><div class="ttdeci">IntegerValue x_max</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00031">diffn_util.h:31</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a1227e67513602591fb959e35c9de66e8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">operations_research::sat::kMaxIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMaxIntegerValue(std::numeric_limits< IntegerValue::ValueType >::max() - 1)</div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_cut_generator_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_cut_generator.html">operations_research::sat::CutGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00042">cuts.h:42</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a0c1099fcb640b53078dba0e5b9bcd2ce"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0c1099fcb640b53078dba0e5b9bcd2ce">operations_research::sat::CreateNoOverlap2dEnergyCutGenerator</a></div><div class="ttdeci">CutGenerator CreateNoOverlap2dEnergyCutGenerator(const std::vector< IntervalVariable > &x_intervals, const std::vector< IntervalVariable > &y_intervals, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00623">scheduling_cuts.cc:623</a></div></div>
|
||
<div class="ttc" id="constraint__solver_2table_8cc_html_a9293e4d29cac928301645070dd307683"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a></div><div class="ttdeci">int64_t b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00047">constraint_solver/table.cc:47</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_precedence_event_html_a5370a7b26b844e14470a72da8356f542"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_precedence_event.html#a5370a7b26b844e14470a72da8356f542">operations_research::sat::PrecedenceEvent::end_min</a></div><div class="ttdeci">IntegerValue end_min</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00835">scheduling_cuts.cc:835</a></div></div>
|
||
<div class="ttc" id="integral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
||
<div class="ttc" id="sat_2linear__constraint_8h_html"><div class="ttname"><a href="sat_2linear__constraint_8h.html">linear_constraint.h</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aed77a1a7675c2f8568529a5a16247ec1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">operations_research::sat::ToDouble</a></div><div class="ttdeci">double ToDouble(IntegerValue value)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00071">integer.h:71</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html">operations_research::sat::EnergyEvent</a></div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00097">scheduling_cuts.cc:97</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a4afe32e790c8bdda016751c64074547e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a4afe32e790c8bdda016751c64074547e">operations_research::sat::GenerateNoOverlap2dEnergyCut</a></div><div class="ttdeci">void GenerateNoOverlap2dEnergyCut(const std::vector< LinearExpression > &energies, absl::Span< int > rectangles, const std::string &cut_name, const absl::StrongVector< IntegerVariable, double > &lp_values, Model *model, IntegerTrail *integer_trail, IntegerEncoder *encoder, LinearConstraintManager *manager, SchedulingConstraintHelper *x_helper, SchedulingConstraintHelper *y_helper)</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00546">scheduling_cuts.cc:546</a></div></div>
|
||
<div class="ttc" id="alldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
||
<div class="ttc" id="strong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_affine_expression_html_ac3740684133a43f28203f0b85ed847b7"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#ac3740684133a43f28203f0b85ed847b7">operations_research::sat::AffineExpression::DebugString</a></div><div class="ttdeci">const std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00278">integer.h:278</a></div></div>
|
||
<div class="ttc" id="sched__constraints_8cc_html_a0d94a083ebe1975ac196611f87a4e0a2"><div class="ttname"><a href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a></div><div class="ttdeci">Rev< int64_t > start_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="intervals_8h_html"><div class="ttname"><a href="intervals_8h.html">intervals.h</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_encoder_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html">operations_research::sat::IntegerEncoder</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00356">integer.h:356</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_ct_event_html_a5113c9bb6a8fa5f8213f4e3eeb93b5fb"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_ct_event.html#a5113c9bb6a8fa5f8213f4e3eeb93b5fb">operations_research::sat::CtEvent::y_start_min</a></div><div class="ttdeci">IntegerValue y_start_min</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00994">scheduling_cuts.cc:994</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_rectangle_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html">operations_research::sat::Rectangle</a></div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00029">diffn_util.h:29</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_ac6822fe3edb67cd39211bf3849d3332b"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#ac6822fe3edb67cd39211bf3849d3332b">operations_research::sat::EnergyEvent::MinOverlap</a></div><div class="ttdeci">IntegerValue MinOverlap(IntegerValue start, IntegerValue end) const</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00128">scheduling_cuts.cc:128</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_ac33aa2de38f159fcf7838830159d6c86"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#ac33aa2de38f159fcf7838830159d6c86">operations_research::sat::EnergyEvent::x_start_max</a></div><div class="ttdeci">IntegerValue x_start_max</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00099">scheduling_cuts.cc:99</a></div></div>
|
||
<div class="ttc" id="base_2logging_8h_html_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00891">base/logging.h:891</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_ct_event_html_a938bfef8e3fbad056a67e91392c95df8"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_ct_event.html#a938bfef8e3fbad056a67e91392c95df8">operations_research::sat::CtEvent::use_energy</a></div><div class="ttdeci">bool use_energy</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l01005">scheduling_cuts.cc:1005</a></div></div>
|
||
<div class="ttc" id="sched__constraints_8cc_html_ad3f96403731a9e915dad229813609e74"><div class="ttname"><a href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a></div><div class="ttdeci">Rev< int64_t > end_min</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00245">sched_constraints.cc:245</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html">operations_research::sat::IntegerTrail</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00613">integer.h:613</a></div></div>
|
||
<div class="ttc" id="resource_8cc_html_a29fb0dd9484d890b12b280c41c150e20"><div class="ttname"><a href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a></div><div class="ttdeci">int64_t demand</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00125">resource.cc:125</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_ct_event_html_a8aa9f672169eb8bb479c7f3e98e7a334"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_ct_event.html#a8aa9f672169eb8bb479c7f3e98e7a334">operations_research::sat::CtEvent::y_end_max</a></div><div class="ttdeci">IntegerValue y_end_max</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00997">scheduling_cuts.cc:997</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_precedence_event_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_precedence_event.html">operations_research::sat::PrecedenceEvent</a></div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00831">scheduling_cuts.cc:831</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_ct_event_html_aae5633dcc6f196817cf87ff999faa6af"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_ct_event.html#aae5633dcc6f196817cf87ff999faa6af">operations_research::sat::CtEvent::x_start_min</a></div><div class="ttdeci">IntegerValue x_start_min</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00982">scheduling_cuts.cc:982</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html">operations_research::sat::Trail</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00235">sat_base.h:235</a></div></div>
|
||
<div class="ttc" id="resource_8cc_html_a4a6149ef5bdc681a998b90bb5c165bf3"><div class="ttname"><a href="resource_8cc.html#a4a6149ef5bdc681a998b90bb5c165bf3">energy</a></div><div class="ttdeci">int64_t energy</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00354">resource.cc:354</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_ct_event_html_aafe035000b060515489304c1d769c1c8"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_ct_event.html#aafe035000b060515489304c1d769c1c8">operations_research::sat::CtEvent::x_end</a></div><div class="ttdeci">AffineExpression x_end</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00988">scheduling_cuts.cc:988</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_af8dee2e03e9b51a9149bad32c7ed4958"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#af8dee2e03e9b51a9149bad32c7ed4958">operations_research::sat::EnergyEvent::literal_lp</a></div><div class="ttdeci">double literal_lp</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00115">scheduling_cuts.cc:115</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_rectangle_html_a1f62ae069f3793df9ae18399ba6d052c"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html#a1f62ae069f3793df9ae18399ba6d052c">operations_research::sat::Rectangle::x_min</a></div><div class="ttdeci">IntegerValue x_min</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00030">diffn_util.h:30</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_top_n_cuts_html_afb0f85e921e0f240d59d2a739e6b5712"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_top_n_cuts.html#afb0f85e921e0f240d59d2a739e6b5712">operations_research::sat::TopNCuts::TransferToManager</a></div><div class="ttdeci">void TransferToManager(const absl::StrongVector< IntegerVariable, double > &lp_solution, LinearConstraintManager *manager)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint__manager_8cc_source.html#l00726">linear_constraint_manager.cc:726</a></div></div>
|
||
<div class="ttc" id="routing__flow_8cc_html_a2acb49f4df5288066c43610bede123ec"><div class="ttname"><a href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a></div><div class="ttdeci">int64_t capacity</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00151">routing_flow.cc:151</a></div></div>
|
||
<div class="ttc" id="pack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00509">pack.cc:509</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_a379a897decc0711464cb15e8d02fd095"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#a379a897decc0711464cb15e8d02fd095">operations_research::sat::EnergyEvent::y_min</a></div><div class="ttdeci">IntegerValue y_min</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00103">scheduling_cuts.cc:103</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_ct_event_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_ct_event.html#a764be64f3029f8b8e23511061d8de355">operations_research::sat::CtEvent::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l01011">scheduling_cuts.cc:1011</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ab3a2a28d08246d8f3432caa1a27811b8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">operations_research::sat::SchedulingConstraintHelper::StartMin</a></div><div class="ttdeci">IntegerValue StartMin(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00231">intervals.h:231</a></div></div>
|
||
<div class="ttc" id="base_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00894">base/logging.h:894</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a23849eabdcf8e9f6f90e7aa05b298dc9"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a23849eabdcf8e9f6f90e7aa05b298dc9">operations_research::sat::CreateNoOverlapPrecedenceCutGenerator</a></div><div class="ttdeci">CutGenerator CreateNoOverlapPrecedenceCutGenerator(const std::vector< IntervalVariable > &intervals, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00934">scheduling_cuts.cc:934</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_ae39303b5b3149e1914834c36ad51fe8f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#ae39303b5b3149e1914834c36ad51fe8f">operations_research::sat::EnergyEvent::y_max</a></div><div class="ttdeci">IntegerValue y_max</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00104">scheduling_cuts.cc:104</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_affine_expression_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html">operations_research::sat::AffineExpression</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00227">integer.h:227</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_builder_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">operations_research::sat::LinearConstraintBuilder</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00153">sat/linear_constraint.h:153</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_ct_event_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_ct_event.html">operations_research::sat::CtEvent</a></div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00980">scheduling_cuts.cc:980</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a3e2516c0d3fc4991896c6a9bbead80e7"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3e2516c0d3fc4991896c6a9bbead80e7">operations_research::sat::GetOverlappingRectangleComponents</a></div><div class="ttdeci">std::vector< absl::Span< int > > GetOverlappingRectangleComponents(const std::vector< Rectangle > &rectangles, absl::Span< int > active_rectangles)</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8cc_source.html#l00026">diffn_util.cc:26</a></div></div>
|
||
<div class="ttc" id="sat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a55f294666b4e56097efc1c955d6de181"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a55f294666b4e56097efc1c955d6de181">operations_research::sat::GenerateEnergeticCuts</a></div><div class="ttdeci">void GenerateEnergeticCuts(const std::string &cut_name, const absl::StrongVector< IntegerVariable, double > &lp_values, std::vector< EnergyEvent > events, const AffineExpression capacity, bool no_overlap_2d, Model *model, LinearConstraintManager *manager)</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00151">scheduling_cuts.cc:151</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a11b6d6eef1159c1801cfa033778f09db"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">operations_research::sat::SchedulingConstraintHelper::EndMin</a></div><div class="ttdeci">IntegerValue EndMin(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00232">intervals.h:232</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_ct_event_html_a6382230ccc5d66808e87821bfcc3f6a4"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_ct_event.html#a6382230ccc5d66808e87821bfcc3f6a4">operations_research::sat::CtEvent::lifted</a></div><div class="ttdeci">bool lifted</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l01009">scheduling_cuts.cc:1009</a></div></div>
|
||
<div class="ttc" id="sat_2util_8h_html"><div class="ttname"><a href="sat_2util_8h.html">util.h</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a9125ec8126e6035eacce8a5eb52b45c5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9125ec8126e6035eacce8a5eb52b45c5">operations_research::sat::SchedulingConstraintHelper::EndMax</a></div><div class="ttdeci">IntegerValue EndMax(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00234">intervals.h:234</a></div></div>
|
||
<div class="ttc" id="base_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00889">base/logging.h:889</a></div></div>
|
||
<div class="ttc" id="implied__bounds_8h_html"><div class="ttname"><a href="implied__bounds_8h.html">implied_bounds.h</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_acffeeeb7712a014c78029cb130da23da"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#acffeeeb7712a014c78029cb130da23da">operations_research::sat::EnergyEvent::y_size_min</a></div><div class="ttdeci">IntegerValue y_size_min</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00114">scheduling_cuts.cc:114</a></div></div>
|
||
<div class="ttc" id="classabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector< IntegerVariable, double ></a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a47064139cec9b2ea520361ee30f0f243"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a47064139cec9b2ea520361ee30f0f243">operations_research::sat::LinearizeInnerProduct</a></div><div class="ttdeci">void LinearizeInnerProduct(const std::vector< AffineExpression > &left, const std::vector< AffineExpression > &right, Model *model, std::vector< LinearExpression > *energies)</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8cc_source.html#l00444">implied_bounds.cc:444</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a6b12eb18e7becd3da4eda60b61182f95"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a6b12eb18e7becd3da4eda60b61182f95">operations_research::sat::CreateCumulativeTimeTableCutGenerator</a></div><div class="ttdeci">CutGenerator CreateCumulativeTimeTableCutGenerator(const std::vector< IntervalVariable > &intervals, const AffineExpression &capacity, const std::vector< AffineExpression > &demands, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00714">scheduling_cuts.cc:714</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_ct_event_html_abd3efe555c40cabd2d93bc58dc5d6f0f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_ct_event.html#abd3efe555c40cabd2d93bc58dc5d6f0f">operations_research::sat::CtEvent::x_lp_end</a></div><div class="ttdeci">double x_lp_end</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00991">scheduling_cuts.cc:991</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a11da691271c7e581ccc6383d8c25c666"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a11da691271c7e581ccc6383d8c25c666">operations_research::sat::GeneratePrecedenceCuts</a></div><div class="ttdeci">void GeneratePrecedenceCuts(const std::string &cut_name, const absl::StrongVector< IntegerVariable, double > &lp_values, std::vector< PrecedenceEvent > events, IntegerValue capacity_max, Model *model, LinearConstraintManager *manager)</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00841">scheduling_cuts.cc:841</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">operations_research::sat::SchedulingConstraintHelper</a></div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00173">intervals.h:173</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_builder_html_a8ef32d79f50eb45bb9305c8b436cf6c4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">operations_research::sat::LinearConstraintBuilder::Build</a></div><div class="ttdeci">LinearConstraint Build()</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00119">sat/linear_constraint.cc:119</a></div></div>
|
||
<div class="ttc" id="diffn__util_8h_html"><div class="ttname"><a href="diffn__util_8h.html">diffn_util.h</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ad9b4a962b743e358f3a7c4b2279f99c8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">operations_research::sat::SchedulingConstraintHelper::NumTasks</a></div><div class="ttdeci">int NumTasks() const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00204">intervals.h:204</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_a7feaa770019816070e3fcafcc0883e95"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#a7feaa770019816070e3fcafcc0883e95">operations_research::sat::EnergyEvent::x_size</a></div><div class="ttdeci">AffineExpression x_size</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00102">scheduling_cuts.cc:102</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a04d3913888ed0b200c1d1fa879c62804"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a04d3913888ed0b200c1d1fa879c62804">operations_research::sat::CreateCumulativeEnergyCutGenerator</a></div><div class="ttdeci">CutGenerator CreateCumulativeEnergyCutGenerator(const std::vector< IntervalVariable > &intervals, const AffineExpression &capacity, const std::vector< AffineExpression > &demands, const std::vector< LinearExpression > &energies, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00395">scheduling_cuts.cc:395</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_top_n_cuts_html_a713bdb803c52b7b7ac3c52ba9b869530"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_top_n_cuts.html#a713bdb803c52b7b7ac3c52ba9b869530">operations_research::sat::TopNCuts::AddCut</a></div><div class="ttdeci">void AddCut(LinearConstraint ct, const std::string &name, const absl::StrongVector< IntegerVariable, double > &lp_solution)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint__manager_8cc_source.html#l00715">linear_constraint_manager.cc:715</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_precedence_event_html_a79a74bd07a8525e729a55c74f7edf5a8"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_precedence_event.html#a79a74bd07a8525e729a55c74f7edf5a8">operations_research::sat::PrecedenceEvent::start_min</a></div><div class="ttdeci">IntegerValue start_min</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00832">scheduling_cuts.cc:832</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a64dd4ef1984ac7dd7fdb25c7b2765554"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a64dd4ef1984ac7dd7fdb25c7b2765554">operations_research::sat::AppendVariablesToCumulativeCut</a></div><div class="ttdeci">void AppendVariablesToCumulativeCut(const AffineExpression &capacity, const std::vector< AffineExpression > &demands, IntegerTrail *integer_trail, CutGenerator *result)</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00381">scheduling_cuts.cc:381</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a7181fb054123974741e1ead27c6cf635"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7181fb054123974741e1ead27c6cf635">operations_research::sat::GenerateCompletionTimeCuts</a></div><div class="ttdeci">void GenerateCompletionTimeCuts(const std::string &cut_name, const absl::StrongVector< IntegerVariable, double > &lp_values, std::vector< CtEvent > events, bool use_lifting, Model *model, LinearConstraintManager *manager)</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l01035">scheduling_cuts.cc:1035</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_aae5633dcc6f196817cf87ff999faa6af"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#aae5633dcc6f196817cf87ff999faa6af">operations_research::sat::EnergyEvent::x_start_min</a></div><div class="ttdeci">IntegerValue x_start_min</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00098">scheduling_cuts.cc:98</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aac7919596b8f8087a558d3d4d6430d00"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aac7919596b8f8087a558d3d4d6430d00">operations_research::sat::CreateCumulativeCompletionTimeCutGenerator</a></div><div class="ttdeci">CutGenerator CreateCumulativeCompletionTimeCutGenerator(const std::vector< IntervalVariable > &intervals, const AffineExpression &capacity, const std::vector< AffineExpression > &demands, const std::vector< LinearExpression > &energies, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l01205">scheduling_cuts.cc:1205</a></div></div>
|
||
<div class="ttc" id="integer_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a7bd8a488b0a7ee7905bdab4c5984bd70"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7bd8a488b0a7ee7905bdab4c5984bd70">operations_research::sat::CreateNoOverlap2dCompletionTimeCutGenerator</a></div><div class="ttdeci">CutGenerator CreateNoOverlap2dCompletionTimeCutGenerator(const std::vector< IntervalVariable > &x_intervals, const std::vector< IntervalVariable > &y_intervals, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l01277">scheduling_cuts.cc:1277</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a5bd8c44473618b7eafd33ba978db2f06"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">operations_research::sat::kNoIntegerVariable</a></div><div class="ttdeci">const IntegerVariable kNoIntegerVariable(-1)</div></div>
|
||
<div class="ttc" id="resource_8cc_html_aee52de7b225665566aa47246b9d6b8fa"><div class="ttname"><a href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a></div><div class="ttdeci">int64_t time</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01691">resource.cc:1691</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_a4807e6da5062c463e7f6c8cabe7d63c5"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#a4807e6da5062c463e7f6c8cabe7d63c5">operations_research::sat::EnergyEvent::x_end_max</a></div><div class="ttdeci">IntegerValue x_end_max</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00101">scheduling_cuts.cc:101</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_precedence_event_html_a766465a77b29d9d4c1401711b5e1083c"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_precedence_event.html#a766465a77b29d9d4c1401711b5e1083c">operations_research::sat::PrecedenceEvent::demand_min</a></div><div class="ttdeci">IntegerValue demand_min</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00838">scheduling_cuts.cc:838</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_a83f79d0fb389d59356fe4b7a7440d55a"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#a83f79d0fb389d59356fe4b7a7440d55a">operations_research::sat::EnergyEvent::energy_lp</a></div><div class="ttdeci">double energy_lp</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00109">scheduling_cuts.cc:109</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a2dbcb7017d468a17bdb30252af5c6c31"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">operations_research::sat::kNoLiteralIndex</a></div><div class="ttdeci">const LiteralIndex kNoLiteralIndex(-1)</div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_manager_html_a9456bb31790e4dae791914e3c065b460"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a9456bb31790e4dae791914e3c065b460">operations_research::sat::LinearConstraintManager::AddCut</a></div><div class="ttdeci">bool AddCut(LinearConstraint ct, std::string type_name, const absl::StrongVector< IntegerVariable, double > &lp_solution, std::string extra_info="")</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint__manager_8cc_source.html#l00210">linear_constraint_manager.cc:210</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_cut_generator_html_a79779673f2fe909d104c37f3b7cc5a48"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_cut_generator.html#a79779673f2fe909d104c37f3b7cc5a48">operations_research::sat::CutGenerator::generate_cuts</a></div><div class="ttdeci">std::function< bool(const absl::StrongVector< IntegerVariable, double > &lp_values, LinearConstraintManager *manager)> generate_cuts</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00047">cuts.h:47</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_builder_html_a96ececaa94026aaa3a46fb65df0a17a9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a96ececaa94026aaa3a46fb65df0a17a9">operations_research::sat::LinearConstraintBuilder::BuildExpression</a></div><div class="ttdeci">LinearExpression BuildExpression()</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00132">sat/linear_constraint.cc:132</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_a2e3ce74381be12a227ac6f04a7df9054"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#a2e3ce74381be12a227ac6f04a7df9054">operations_research::sat::EnergyEvent::y_spread</a></div><div class="ttdeci">IntegerValue y_spread</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00118">scheduling_cuts.cc:118</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a18fe82932180e2e3bac0fbdf957f01a0"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a18fe82932180e2e3bac0fbdf957f01a0">operations_research::sat::CreateNoOverlapCompletionTimeCutGenerator</a></div><div class="ttdeci">CutGenerator CreateNoOverlapCompletionTimeCutGenerator(const std::vector< IntervalVariable > &intervals, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l01155">scheduling_cuts.cc:1155</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ac8a0cc4c1cca9aefa21788b096954f31"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ac8a0cc4c1cca9aefa21788b096954f31">operations_research::sat::SchedulingConstraintHelper::PresenceLiteral</a></div><div class="ttdeci">Literal PresenceLiteral(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00339">intervals.h:339</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_intervals_repository_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_intervals_repository.html">operations_research::sat::IntervalsRepository</a></div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00047">intervals.h:47</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_energy_event_html_a419daefa95b40282f25dcff95c1f40e8"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_energy_event.html#a419daefa95b40282f25dcff95c1f40e8">operations_research::sat::EnergyEvent::energy</a></div><div class="ttdeci">std::optional< LinearExpression > energy</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00108">scheduling_cuts.cc:108</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_trail_html_ad63c4461a1384629cb99413c6df8b9ca"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">operations_research::sat::Trail::CurrentDecisionLevel</a></div><div class="ttdeci">int CurrentDecisionLevel() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00357">sat_base.h:357</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_rectangle_html_a379a897decc0711464cb15e8d02fd095"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html#a379a897decc0711464cb15e8d02fd095">operations_research::sat::Rectangle::y_min</a></div><div class="ttdeci">IntegerValue y_min</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00032">diffn_util.h:32</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a88c8ab90d500702234707905c3b07ad2"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a88c8ab90d500702234707905c3b07ad2">operations_research::sat::ProductIsLinearized</a></div><div class="ttdeci">bool ProductIsLinearized(const LinearExpression &expr)</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8cc_source.html#l00439">implied_bounds.cc:439</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_manager_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">operations_research::sat::LinearConstraintManager</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint__manager_8h_source.html#l00043">linear_constraint_manager.h:43</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a523501d854b2ca8034d37c15e7c89117"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">operations_research::sat::IntegerTrail::IsFixed</a></div><div class="ttdeci">bool IsFixed(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01443">integer.h:1443</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ade00ce69e73ccd8470ea0198961da58e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ade00ce69e73ccd8470ea0198961da58e">operations_research::sat::SchedulingConstraintHelper::Sizes</a></div><div class="ttdeci">const std::vector< AffineExpression > & Sizes() const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00338">intervals.h:338</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_builder_html_a7e251202babf951363efedbd30af45c5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a7e251202babf951363efedbd30af45c5">operations_research::sat::LinearConstraintBuilder::AddQuadraticLowerBound</a></div><div class="ttdeci">void AddQuadraticLowerBound(AffineExpression left, AffineExpression right, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00069">sat/linear_constraint.cc:69</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_ct_event_html_a4f71e6fc95b8de0290911759804601d4"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_ct_event.html#a4f71e6fc95b8de0290911759804601d4">operations_research::sat::CtEvent::energy_min</a></div><div class="ttdeci">IntegerValue energy_min</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l01001">scheduling_cuts.cc:1001</a></div></div>
|
||
<div class="ttc" id="constraint__solver_2table_8cc_html_acb18315d548212835cd8ed4287e6c0b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a></div><div class="ttdeci">int64_t a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00046">constraint_solver/table.cc:46</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ac8570d5d120d42444fded60c841c6616"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ac8570d5d120d42444fded60c841c6616">operations_research::sat::CreateCumulativePrecedenceCutGenerator</a></div><div class="ttdeci">CutGenerator CreateCumulativePrecedenceCutGenerator(const std::vector< IntervalVariable > &intervals, const AffineExpression &capacity, const std::vector< AffineExpression > &demands, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00889">scheduling_cuts.cc:889</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_precedence_event_html_a44f4c48334f8c6331c4529a8d3a24890"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_precedence_event.html#a44f4c48334f8c6331c4529a8d3a24890">operations_research::sat::PrecedenceEvent::start</a></div><div class="ttdeci">AffineExpression start</div><div class="ttdef"><b>Definition:</b> <a href="scheduling__cuts_8cc_source.html#l00834">scheduling_cuts.cc:834</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="scheduling__cuts_8cc.html">scheduling_cuts.cc</a></li>
|
||
<li class="footer">Generated by
|
||
<a href="http://www.doxygen.org/index.html">
|
||
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
|
||
</ul>
|
||
</div>
|
||
</body>
|
||
</html>
|