290 lines
333 KiB
HTML
290 lines
333 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: integer_search.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('integer__search_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">integer_search.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="integer__search_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="integer__search_8h.html">ortools/sat/integer_search.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 <cmath></span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <cstdint></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <functional></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "absl/types/span.h"</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="cp__model__mapping_8h.html">ortools/sat/cp_model_mapping.h</a>"</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</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="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>"</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="probing_8h.html">ortools/sat/probing.h</a>"</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="rins_8h.html">ortools/sat/rins.h</a>"</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="sat__base_8h.html">ortools/sat/sat_base.h</a>"</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="sat__decision_8h.html">ortools/sat/sat_decision.h</a>"</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="sat__inprocessing_8h.html">ortools/sat/sat_inprocessing.h</a>"</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="sat__parameters_8pb_8h.html">ortools/sat/sat_parameters.pb.h</a>"</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include "<a class="code" href="synchronization_8h.html">ortools/sat/synchronization.h</a>"</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</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="l00034"></a><span class="lineno"> 34</span> </div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">namespace </span>sat {</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> </div><div class="line"><a name="l00038"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a304417ca7c3964cc928b771620b2dc53"> 38</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> <a class="code" href="namespaceoperations__research_1_1sat.html#a304417ca7c3964cc928b771620b2dc53">AtMinValue</a>(IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail) {</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a309d057e12c8d4d393f13975eea2e2a9">IsCurrentlyIgnored</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keyword">const</span> IntegerValue lb = integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(lb, integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keywordflow">if</span> (lb == integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a>();</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, lb);</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> </div><div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a71fa416b44768076a0e7dd7777ab433d"> 46</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> <a class="code" href="namespaceoperations__research_1_1sat.html#a71fa416b44768076a0e7dd7777ab433d">ChooseBestObjectiveValue</a>(IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <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="l00047"></a><span class="lineno"> 47</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& variables =</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="structoperations__research_1_1sat_1_1_objective_definition.html">ObjectiveDefinition</a>>()->objective_impacting_variables;</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keyword">auto</span>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keywordflow">if</span> (variables.contains(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) {</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a304417ca7c3964cc928b771620b2dc53">AtMinValue</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, integer_trail);</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (variables.contains(<a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>))) {</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a304417ca7c3964cc928b771620b2dc53">AtMinValue</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>), integer_trail);</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  }</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a>();</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> }</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a3f4df9da99787316bfb5029b7a6b92b7"> 58</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> <a class="code" href="namespaceoperations__research_1_1sat.html#a3f4df9da99787316bfb5029b7a6b92b7">GreaterOrEqualToMiddleValue</a>(IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>,</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail) {</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">const</span> IntegerValue var_lb = integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keyword">const</span> IntegerValue var_ub = integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(var_lb, var_ub);</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> </div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">const</span> IntegerValue chosen_value =</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  var_lb + <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(IntegerValue(1), (var_ub - var_lb) / IntegerValue(2));</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, chosen_value);</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> }</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a46cb4c07c4971a99724693260c92fd5b"> 69</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> <a class="code" href="namespaceoperations__research_1_1sat.html#a46cb4c07c4971a99724693260c92fd5b">SplitAroundGivenValue</a>(IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, IntegerValue <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>,</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">auto</span>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keyword">const</span> IntegerValue lb = integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keyword">const</span> IntegerValue ub = integer_trail->UpperBound(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> </div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">const</span> absl::flat_hash_set<IntegerVariable>& variables =</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="structoperations__research_1_1sat_1_1_objective_definition.html">ObjectiveDefinition</a>>()->objective_impacting_variables;</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> </div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="comment">// Heuristic: Prefer the objective direction first. Reference: Conflict-Driven</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="comment">// Heuristics for Mixed Integer Programming (2019) by Jakob Witzig and Ambros</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">// Gleixner.</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="comment">// NOTE: The value might be out of bounds. In that case we return</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">// kNoLiteralIndex.</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> branch_down_feasible = <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> >= lb && <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> < ub;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> branch_up_feasible = <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> > lb && <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> <= ub;</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">if</span> (variables.contains(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) && branch_down_feasible) {</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (variables.contains(<a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) && branch_up_feasible) {</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (branch_down_feasible) {</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (branch_up_feasible) {</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</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>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a>();</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</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="namespaceoperations__research_1_1sat.html#ac0774a1df651b83339b00fee0bde1cd8"> 97</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> <a class="code" href="namespaceoperations__research_1_1sat.html#ac0774a1df651b83339b00fee0bde1cd8">SplitAroundLpValue</a>(IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <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="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">auto</span>* <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a> = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>();</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">auto</span>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">auto</span>* lp_dispatcher = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_dispatcher.html">LinearProgrammingDispatcher</a>>();</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!integer_trail->IsCurrentlyIgnored(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> </div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">const</span> IntegerVariable positive_var = <a class="code" href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">PositiveVariable</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html">LinearProgrammingConstraint</a>* lp =</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <a class="code" href="namespacegtl.html#abc18f60961e36340e64e428827c0e38e">gtl::FindWithDefault</a>(*lp_dispatcher, positive_var, <span class="keyword">nullptr</span>);</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">// We only use this if the sub-lp has a solution, and depending on the value</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// of exploit_all_lp_solution() if it is a pure-integer solution.</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">if</span> (lp == <span class="keyword">nullptr</span> || !lp-><a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#ac7edc397b78de116072e89fe0ad89266">HasSolution</a>()) <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a>();</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">if</span> (!<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>-><a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a0111ae24346ddd398aaaf891b887a6fa">exploit_all_lp_solution</a>() && !lp-><a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a700f8f1db38fcb59cab04ff2d75a915f">SolutionIsInteger</a>()) {</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a>();</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">// TODO(user): Depending if we branch up or down, this might not exclude the</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">// LP value, which is potentially a bad thing.</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="comment">//</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// TODO(user): Why is the reduced cost doing things differently?</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = IntegerValue(</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  static_cast<int64_t>(std::round(lp-><a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a460fe5216ff7f997841e588d432be744">GetSolutionValue</a>(positive_var))));</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> </div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="comment">// Because our lp solution might be from higher up in the tree, it</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="comment">// is possible that value is now outside the domain of positive_var.</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="comment">// In this case, this function will return an invalid literal.</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a46cb4c07c4971a99724693260c92fd5b">SplitAroundGivenValue</a>(positive_var, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</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> </div><div class="line"><a name="l00127"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ac4a25d47a029efe205efbc015f7c7e7c"> 127</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> <a class="code" href="namespaceoperations__research_1_1sat.html#ac4a25d47a029efe205efbc015f7c7e7c">SplitUsingBestSolutionValueInRepository</a>(</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_shared_solution_repository.html">SharedSolutionRepository<int64_t></a>& solution_repo,</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">if</span> (solution_repo.<a class="code" href="classoperations__research_1_1sat_1_1_shared_solution_repository.html#a6d2b6f7951b60c786fdbefcbe7c3571f">NumSolutions</a>() == 0) {</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a>();</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"> 134</span>  <span class="keyword">const</span> IntegerVariable positive_var = <a class="code" href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">PositiveVariable</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> proto_var =</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get<<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_mapping.html">CpModelMapping</a>>()->GetProtoVariableFromIntegerVariable(</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  positive_var);</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">if</span> (proto_var < 0) {</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a>();</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  }</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> </div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>(solution_repo.<a class="code" href="classoperations__research_1_1sat_1_1_shared_solution_repository.html#ad3280cfa83b844b02b9194550b18b058">GetVariableValueInSolution</a>(</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  proto_var, <span class="comment">/*solution_index=*/</span>0));</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a46cb4c07c4971a99724693260c92fd5b">SplitAroundGivenValue</a>(positive_var, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</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> </div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment">// TODO(user): the complexity caused by the linear scan in this heuristic and</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// the one below is ok when search_branching is set to SAT_SEARCH because it is</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// not executed often, but otherwise it is done for each search decision,</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment">// which seems expensive. Improve.</span></div><div class="line"><a name="l00152"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a0b08971dbb223f77e7fc9c41a77fdc7b"> 152</a></span> std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code" href="namespaceoperations__research_1_1sat.html#a0b08971dbb223f77e7fc9c41a77fdc7b">FirstUnassignedVarAtItsMinHeuristic</a>(</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& vars, <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="l00154"></a><span class="lineno"> 154</span>  <span class="keyword">auto</span>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">return</span> [<span class="comment">/*copy*/</span> vars, integer_trail]() {</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars) {</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="comment">// Note that there is no point trying to fix a currently ignored variable.</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">if</span> (integer_trail->IsCurrentlyIgnored(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> decision = <a class="code" href="namespaceoperations__research_1_1sat.html#a304417ca7c3964cc928b771620b2dc53">AtMinValue</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, integer_trail);</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">if</span> (decision.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#ac532c4b500b1a85ea22217f2c65a70ed">IsValid</a>()) <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>(decision);</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  }</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>();</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> </div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> std::function<BooleanOrIntegerLiteral()></div><div class="line"><a name="l00167"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a4713f8fb7e1ccddece18a374886ad866"> 167</a></span> <a class="code" href="namespaceoperations__research_1_1sat.html#a4713f8fb7e1ccddece18a374886ad866">UnassignedVarWithLowestMinAtItsMinHeuristic</a>(</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& vars, <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="l00169"></a><span class="lineno"> 169</span>  <span class="keyword">auto</span>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">return</span> [<span class="comment">/*copy */</span> vars, integer_trail]() {</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  IntegerVariable candidate = <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>;</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  IntegerValue candidate_lb;</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars) {</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">if</span> (integer_trail->IsCurrentlyIgnored(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keyword">const</span> IntegerValue lb = integer_trail->LowerBound(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">if</span> (lb < integer_trail-><a class="code" href="namespaceoperations__research_1_1sat.html#a0ee70f9d17fac333fb71c0ab6423f58c">UpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) &&</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  (candidate == <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a> || lb < candidate_lb)) {</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  candidate = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>;</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  candidate_lb = lb;</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  }</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  }</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">if</span> (candidate == <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>();</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#a304417ca7c3964cc928b771620b2dc53">AtMinValue</a>(candidate, integer_trail));</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> </div><div class="line"><a name="l00187"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#abcf8d0c663710a1e395489e62de487b1"> 187</a></span> std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code" href="namespaceoperations__research_1_1sat.html#abcf8d0c663710a1e395489e62de487b1">SequentialSearch</a>(</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  std::vector<std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()>> heuristics) {</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">return</span> [heuristics]() {</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& h : heuristics) {</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a> decision = h();</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">if</span> (decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#ae26b73bbf70dc88433be39df364ca7c1">HasValue</a>()) <span class="keywordflow">return</span> decision;</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  }</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>();</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  };</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> }</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div><div class="line"><a name="l00198"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#afc647a54403bf1bedce9b09841748c91"> 198</a></span> std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code" href="namespaceoperations__research_1_1sat.html#afc647a54403bf1bedce9b09841748c91">SequentialValueSelection</a>(</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  std::vector<std::function<<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a>(IntegerVariable)>></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  value_selection_heuristics,</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> var_selection_heuristic,</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keyword">auto</span>* encoder = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>();</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keyword">auto</span>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">auto</span>* sat_policy = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html">SatDecisionPolicy</a>>();</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">return</span> [=]() {</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="comment">// Get the current decision.</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a> current_decision = var_selection_heuristic();</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">if</span> (!current_decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#ae26b73bbf70dc88433be39df364ca7c1">HasValue</a>()) <span class="keywordflow">return</span> current_decision;</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">// When we are in the "stable" phase, we prefer to follow the SAT polarity</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="comment">// heuristic.</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">if</span> (current_decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#a3c6f3ae96a90c7fcef34dd0f1ce0297e">boolean_literal_index</a> != <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a> &&</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  sat_policy->InStablePhase()) {</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">return</span> current_decision;</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  }</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> </div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">// IntegerLiteral case.</span></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">if</span> (current_decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#a3c6f3ae96a90c7fcef34dd0f1ce0297e">boolean_literal_index</a> == <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) {</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& value_heuristic : value_selection_heuristics) {</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> decision =</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  value_heuristic(current_decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#aee356429e37f0750e38ee17ae1464a00">integer_literal</a>.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#ab6516f556b715738034b30d290c40214">var</a>);</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">if</span> (decision.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#ac532c4b500b1a85ea22217f2c65a70ed">IsValid</a>()) <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>(decision);</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  }</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">return</span> current_decision;</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  }</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> </div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="comment">// Boolean case. We try to decode the Boolean decision to see if it is</span></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="comment">// associated with an integer variable.</span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> l : encoder->GetAllIntegerLiterals(</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(current_decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#a3c6f3ae96a90c7fcef34dd0f1ce0297e">boolean_literal_index</a>))) {</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordflow">if</span> (integer_trail->IsCurrentlyIgnored(l.var)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> </div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="comment">// Sequentially try the value selection heuristics.</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& value_heuristic : value_selection_heuristics) {</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> decision = value_heuristic(l.var);</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">if</span> (decision.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#ac532c4b500b1a85ea22217f2c65a70ed">IsValid</a>()) <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>(decision);</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> </div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">return</span> current_decision;</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  };</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> }</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> </div><div class="line"><a name="l00245"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#aeaaccdd218e3f0aa5c218d3a0cc5c3f1"> 245</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research_1_1sat.html#aeaaccdd218e3f0aa5c218d3a0cc5c3f1">LinearizedPartIsLarge</a>(<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="l00246"></a><span class="lineno"> 246</span>  <span class="keyword">auto</span>* lp_constraints =</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint_collection.html">LinearProgrammingConstraintCollection</a>>();</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordtype">int</span> num_lp_variables = 0;</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html">LinearProgrammingConstraint</a>* lp : *lp_constraints) {</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  num_lp_variables += lp->NumVariables();</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  }</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_integer_variables =</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <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>>()->NumIntegerVariables().value() / 2;</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">return</span> (num_integer_variables <= 2 * num_lp_variables);</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> </div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="comment">// TODO(user): Experiment more with value selection heuristics.</span></div><div class="line"><a name="l00258"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a88ab44e20ce09e9942f6b8411452df27"> 258</a></span> std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code" href="namespaceoperations__research_1_1sat.html#a88ab44e20ce09e9942f6b8411452df27">IntegerValueSelectionHeuristic</a>(</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> var_selection_heuristic,</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>& <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a> = *(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>());</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  std::vector<std::function<<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a>(IntegerVariable)>></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  value_selection_heuristics;</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="comment">// LP based value.</span></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="comment">//</span></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="comment">// Note that we only do this if a big enough percentage of the problem</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="comment">// variables appear in the LP relaxation.</span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research_1_1sat.html#aeaaccdd218e3f0aa5c218d3a0cc5c3f1">LinearizedPartIsLarge</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) &&</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  (<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a9cc386e96ee7dac2309e95bc03f438ef">exploit_integer_lp_solution</a>() ||</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a0111ae24346ddd398aaaf891b887a6fa">exploit_all_lp_solution</a>())) {</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  value_selection_heuristics.push_back([<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>](IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#ac0774a1df651b83339b00fee0bde1cd8">SplitAroundLpValue</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">PositiveVariable</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  });</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  }</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> </div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">// Solution based value.</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a907df69b7551f6d72100dfb858d25300">exploit_best_solution</a>()) {</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keyword">auto</span>* response_manager = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get<<a class="code" href="classoperations__research_1_1sat_1_1_shared_response_manager.html">SharedResponseManager</a>>();</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">if</span> (response_manager != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) << <span class="stringliteral">"Using best solution value selection heuristic."</span>;</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  value_selection_heuristics.push_back(</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  [<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, response_manager](IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#ac4a25d47a029efe205efbc015f7c7e7c">SplitUsingBestSolutionValueInRepository</a>(</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, response_manager->SolutionsRepository(), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  });</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  }</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span> </div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="comment">// Relaxation Solution based value.</span></div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#af00b4e8985ea79330bc3f378208ad024">exploit_relaxation_solution</a>()) {</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keyword">auto</span>* <a class="code" href="cp__model__solver_8cc.html#a2a2278bd1fb787198e496b7d443a05e8">relaxation_solutions</a> =</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get<<a class="code" href="classoperations__research_1_1sat_1_1_shared_relaxation_solution_repository.html">SharedRelaxationSolutionRepository</a>>();</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__solver_8cc.html#a2a2278bd1fb787198e496b7d443a05e8">relaxation_solutions</a> != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  value_selection_heuristics.push_back(</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  [<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code" href="cp__model__solver_8cc.html#a2a2278bd1fb787198e496b7d443a05e8">relaxation_solutions</a>](IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) << <span class="stringliteral">"Using relaxation solution value selection heuristic."</span>;</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#ac4a25d47a029efe205efbc015f7c7e7c">SplitUsingBestSolutionValueInRepository</a>(</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, *<a class="code" href="cp__model__solver_8cc.html#a2a2278bd1fb787198e496b7d443a05e8">relaxation_solutions</a>, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  });</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  }</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  }</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> </div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="comment">// Objective based value.</span></div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#ad20f833d4b2b9b1416fb25ac4d12cd84">exploit_objective</a>()) {</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  value_selection_heuristics.push_back([<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>](IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a71fa416b44768076a0e7dd7777ab433d">ChooseBestObjectiveValue</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  });</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  }</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> </div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#afc647a54403bf1bedce9b09841748c91">SequentialValueSelection</a>(value_selection_heuristics,</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  var_selection_heuristic, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</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"><a class="line" href="namespaceoperations__research_1_1sat.html#a8f18cefafff72d70f6e96ed3f2ef84aa"> 315</a></span> std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code" href="namespaceoperations__research_1_1sat.html#a8f18cefafff72d70f6e96ed3f2ef84aa">SatSolverHeuristic</a>(<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="l00316"></a><span class="lineno"> 316</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* sat_solver = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>();</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</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="l00318"></a><span class="lineno"> 318</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html">SatDecisionPolicy</a>* decision_policy = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html">SatDecisionPolicy</a>>();</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keywordflow">return</span> [sat_solver, trail, decision_policy] {</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> all_assigned = trail->Index() == sat_solver->NumVariables();</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keywordflow">if</span> (all_assigned) <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>();</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> result = decision_policy->NextBranch();</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!sat_solver->Assignment().LiteralIsAssigned(result));</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>(result.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>());</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  };</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> }</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> </div><div class="line"><a name="l00328"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#aefab46ecc02eb059ed853ee0213be7fb"> 328</a></span> std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code" href="namespaceoperations__research_1_1sat.html#aefab46ecc02eb059ed853ee0213be7fb">PseudoCost</a>(<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="l00329"></a><span class="lineno"> 329</span>  <span class="keyword">auto</span>* objective = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get<<a class="code" href="structoperations__research_1_1sat_1_1_objective_definition.html">ObjectiveDefinition</a>>();</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> has_objective =</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  objective != <span class="keyword">nullptr</span> && objective-><a class="code" href="structoperations__research_1_1sat_1_1_objective_definition.html#aa3c0b31567c91babfffd5f9afc3161dc">objective_var</a> != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>;</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">if</span> (!has_objective) {</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">return</span> []() { <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>(); };</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> </div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keyword">auto</span>* pseudo_costs = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_pseudo_costs.html">PseudoCosts</a>>();</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keyword">auto</span>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">return</span> [pseudo_costs, integer_trail]() {</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keyword">const</span> IntegerVariable chosen_var = pseudo_costs->GetBestDecisionVar();</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keywordflow">if</span> (chosen_var == <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>();</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> </div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="comment">// TODO(user): This will be overidden by the value decision heuristic in</span></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="comment">// almost all cases.</span></div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>(</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a3f4df9da99787316bfb5029b7a6b92b7">GreaterOrEqualToMiddleValue</a>(chosen_var, integer_trail));</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  };</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</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> <span class="comment">// A simple heuristic for scheduling models.</span></div><div class="line"><a name="l00350"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a6c01e08a9089e0d5fed2507f479bbadc"> 350</a></span> std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code" href="namespaceoperations__research_1_1sat.html#a6c01e08a9089e0d5fed2507f479bbadc">SchedulingSearchHeuristic</a>(</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keyword">auto</span>* repo = <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="l00353"></a><span class="lineno"> 353</span>  <span class="keyword">auto</span>* heuristic = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html">SearchHeuristics</a>>();</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keyword">auto</span>* 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="l00355"></a><span class="lineno"> 355</span>  <span class="keyword">auto</span>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">return</span> [repo, heuristic, trail, integer_trail]() {</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keyword">struct </span>ToSchedule {</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="comment">// Variable to fix.</span></div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  LiteralIndex presence = <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>;</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> start;</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> end;</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> </div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="comment">// Information to select best.</span></div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  IntegerValue size_min = <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  IntegerValue <a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</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>  ToSchedule best;</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="comment">// TODO(user): we should also precompute fixed precedences and only fix</span></div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="comment">// interval that have all their predecessors fixed.</span></div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_intervals = repo->NumIntervals();</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordflow">for</span> (IntervalVariable i(0); i < num_intervals; ++i) {</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keywordflow">if</span> (repo->IsAbsent(i)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keywordflow">if</span> (!repo->IsPresent(i) || !integer_trail->IsFixed(repo->Start(i)) ||</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  !integer_trail->IsFixed(repo->End(i))) {</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  IntegerValue <a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> = integer_trail->LowerBound(repo->Start(i));</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">if</span> (repo-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#acc1aaae243ed4381e84f8309aacb3bbc">IsOptional</a>(i)) {</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="comment">// For task whose presence is still unknown, our propagators should</span></div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="comment">// have propagated the minimium time as if it was present. So this</span></div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="comment">// should reflect the earliest time at which this interval can be</span></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="comment">// scheduled.</span></div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(<a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>, integer_trail->ConditionalLowerBound(</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  repo->PresenceLiteral(i), repo->Start(i)));</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  }</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> </div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="comment">// For variable size, we compute the min size once the start is fixed</span></div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="comment">// to time. This is needed to never pick the "artificial" makespan</span></div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="comment">// interval at the end in priority compared to intervals that still</span></div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="comment">// need to be scheduled.</span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keyword">const</span> IntegerValue size_min =</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(integer_trail->LowerBound(repo->Size(i)),</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  integer_trail->LowerBound(repo->End(i)) - <a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>);</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> < best.time ||</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  (<a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> == best.time && size_min < best.size_min)) {</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  best.presence = repo-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#acc1aaae243ed4381e84f8309aacb3bbc">IsOptional</a>(i) ? repo->PresenceLiteral(i).<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>()</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  : <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>;</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  best.start = repo->Start(i);</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  best.end = repo->End(i);</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  best.time = <a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>;</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  best.size_min = size_min;</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>  }</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  }</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordflow">if</span> (best.time == <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>) <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>();</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>  <span class="comment">// Use the next_decision_override to fix in turn all the variables from</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="comment">// the selected interval.</span></div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keywordtype">int</span> num_times = 0;</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  heuristic->next_decision_override = [trail, integer_trail, best,</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  num_times]() <span class="keyword">mutable</span> {</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">if</span> (++num_times > 5) {</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="comment">// We have been trying to fix this interval for a while. Do we miss</span></div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="comment">// some propagation? In any case, try to see if the heuristic above</span></div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="comment">// would select something else.</span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) << <span class="stringliteral">"Skipping ... "</span>;</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>();</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  }</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> </div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="comment">// First make sure the interval is present.</span></div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keywordflow">if</span> (best.presence != <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) {</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keywordflow">if</span> (!trail->Assignment().LiteralIsAssigned(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(best.presence))) {</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) << <span class="stringliteral">"assign "</span> << best.presence;</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>(best.presence);</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  }</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keywordflow">if</span> (trail->Assignment().LiteralIsFalse(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(best.presence))) {</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"unperformed."</span>;</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>();</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</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>  <span class="comment">// We assume that start_min is propagated by now.</span></div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keywordflow">if</span> (!integer_trail->IsFixed(best.start)) {</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a> = integer_trail->LowerBound(best.start);</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) << <span class="stringliteral">"start == "</span> << <a class="code" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a>;</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>(best.start.LowerOrEqual(<a class="code" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a>));</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  }</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> </div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="comment">// We assume that end_min is propagated by now.</span></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordflow">if</span> (!integer_trail->IsFixed(best.end)) {</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a> = integer_trail->LowerBound(best.end);</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) << <span class="stringliteral">"end == "</span> << <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a>;</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>(best.end.LowerOrEqual(<a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a>));</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> </div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="comment">// Everything is fixed, dettach the override.</span></div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keyword">const</span> IntegerValue start = integer_trail->LowerBound(best.start);</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"Fixed @["</span> << start << <span class="stringliteral">","</span></div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  << integer_trail->LowerBound(best.end) << <span class="stringliteral">"]"</span></div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  << (best.presence != <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a></div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  ? absl::StrCat(<span class="stringliteral">" presence="</span>,</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(best.presence).<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>())</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  : <span class="stringliteral">""</span>)</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  << (best.time < start</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  ? absl::StrCat(<span class="stringliteral">" start_at_selection="</span>, best.time.value())</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  : <span class="stringliteral">""</span>);</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>();</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  };</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span> </div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordflow">return</span> heuristic->next_decision_override();</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  };</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span> }</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> </div><div class="line"><a name="l00463"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a744ac200820f62ff97a4da72223cbb54"> 463</a></span> std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code" href="namespaceoperations__research_1_1sat.html#a744ac200820f62ff97a4da72223cbb54">RandomizeOnRestartHeuristic</a>(</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* sat_solver = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>();</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html">SatDecisionPolicy</a>* decision_policy = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html">SatDecisionPolicy</a>>();</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> </div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="comment">// TODO(user): Add other policy and perform more experiments.</span></div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> sat_policy =</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a8f18cefafff72d70f6e96ed3f2ef84aa">SatSolverHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  std::vector<std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()>> policies{</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  sat_policy, <a class="code" href="namespaceoperations__research_1_1sat.html#abcf8d0c663710a1e395489e62de487b1">SequentialSearch</a>({<a class="code" href="namespaceoperations__research_1_1sat.html#aefab46ecc02eb059ed853ee0213be7fb">PseudoCost</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>), sat_policy})};</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="comment">// The higher weight for the sat policy is because this policy actually</span></div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="comment">// contains a lot of variation as we randomize the sat parameters.</span></div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="comment">// TODO(user): Do more experiments to find better distribution.</span></div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  std::discrete_distribution<int> var_dist{3 <span class="comment">/*sat_policy*/</span>, 1 <span class="comment">/*Pseudo cost*/</span>};</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span> </div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="comment">// Value selection.</span></div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  std::vector<std::function<<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a>(IntegerVariable)>></div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  value_selection_heuristics;</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  std::vector<int> value_selection_weight;</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span> </div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="comment">// LP Based value.</span></div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  value_selection_heuristics.push_back([<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>](IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#ac0774a1df651b83339b00fee0bde1cd8">SplitAroundLpValue</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">PositiveVariable</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  });</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  value_selection_weight.push_back(8);</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span> </div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="comment">// Solution based value.</span></div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keyword">auto</span>* response_manager = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get<<a class="code" href="classoperations__research_1_1sat_1_1_shared_response_manager.html">SharedResponseManager</a>>();</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="keywordflow">if</span> (response_manager != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  value_selection_heuristics.push_back(</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  [<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, response_manager](IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#ac4a25d47a029efe205efbc015f7c7e7c">SplitUsingBestSolutionValueInRepository</a>(</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, response_manager->SolutionsRepository(), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  });</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  value_selection_weight.push_back(5);</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  }</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span> </div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="comment">// Relaxation solution based value.</span></div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keyword">auto</span>* <a class="code" href="cp__model__solver_8cc.html#a2a2278bd1fb787198e496b7d443a05e8">relaxation_solutions</a> = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get<<a class="code" href="classoperations__research_1_1sat_1_1_shared_relaxation_solution_repository.html">SharedRelaxationSolutionRepository</a>>();</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__solver_8cc.html#a2a2278bd1fb787198e496b7d443a05e8">relaxation_solutions</a> != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  value_selection_heuristics.push_back(</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  [<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code" href="cp__model__solver_8cc.html#a2a2278bd1fb787198e496b7d443a05e8">relaxation_solutions</a>](IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#ac4a25d47a029efe205efbc015f7c7e7c">SplitUsingBestSolutionValueInRepository</a>(</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, *<a class="code" href="cp__model__solver_8cc.html#a2a2278bd1fb787198e496b7d443a05e8">relaxation_solutions</a>, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</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>  value_selection_weight.push_back(3);</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  }</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span> </div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="comment">// Middle value.</span></div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keyword">auto</span>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  value_selection_heuristics.push_back([integer_trail](IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a3f4df9da99787316bfb5029b7a6b92b7">GreaterOrEqualToMiddleValue</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, integer_trail);</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  });</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  value_selection_weight.push_back(1);</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span> </div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="comment">// Min value.</span></div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  value_selection_heuristics.push_back([integer_trail](IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a304417ca7c3964cc928b771620b2dc53">AtMinValue</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, integer_trail);</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  });</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  value_selection_weight.push_back(1);</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span> </div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="comment">// Special case: Don't change the decision value.</span></div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  value_selection_weight.push_back(10);</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span> </div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="comment">// TODO(user): These distribution values are just guessed values. They need</span></div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="comment">// to be tuned.</span></div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  std::discrete_distribution<int> val_dist(value_selection_weight.begin(),</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  value_selection_weight.end());</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span> </div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="keywordtype">int</span> policy_index = 0;</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordtype">int</span> val_policy_index = 0;</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keyword">auto</span>* encoder = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>();</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="keywordflow">return</span> [=]() <span class="keyword">mutable</span> {</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="keywordflow">if</span> (sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == 0) {</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keyword">auto</span>* random = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_model_random_generator.html">ModelRandomGenerator</a>>();</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a0441e1a54fe203c0707131e587de8fae">RandomizeDecisionHeuristic</a>(*random, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>());</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  decision_policy->ResetDecisionHeuristic();</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span> </div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="comment">// Select the variable selection heuristic.</span></div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  policy_index = var_dist(*(random));</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span> </div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="comment">// Select the value selection heuristic.</span></div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  val_policy_index = val_dist(*(random));</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  }</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span> </div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="comment">// Get the current decision.</span></div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a> current_decision = policies[policy_index]();</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keywordflow">if</span> (!current_decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#ae26b73bbf70dc88433be39df364ca7c1">HasValue</a>()) <span class="keywordflow">return</span> current_decision;</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span> </div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="comment">// Special case: Don't override the decision value.</span></div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="keywordflow">if</span> (val_policy_index >= value_selection_heuristics.size()) {</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keywordflow">return</span> current_decision;</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  }</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span> </div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keywordflow">if</span> (current_decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#a3c6f3ae96a90c7fcef34dd0f1ce0297e">boolean_literal_index</a> == <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) {</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> new_decision =</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  value_selection_heuristics[val_policy_index](</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  current_decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#aee356429e37f0750e38ee17ae1464a00">integer_literal</a>.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#ab6516f556b715738034b30d290c40214">var</a>);</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordflow">if</span> (new_decision.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#ac532c4b500b1a85ea22217f2c65a70ed">IsValid</a>()) <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>(new_decision);</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keywordflow">return</span> current_decision;</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  }</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span> </div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="comment">// Decode the decision and get the variable.</span></div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> l : encoder->GetAllIntegerLiterals(</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(current_decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#a3c6f3ae96a90c7fcef34dd0f1ce0297e">boolean_literal_index</a>))) {</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keywordflow">if</span> (integer_trail->IsCurrentlyIgnored(l.var)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span> </div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="comment">// Try the selected policy.</span></div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> new_decision =</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  value_selection_heuristics[val_policy_index](l.var);</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keywordflow">if</span> (new_decision.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#ac532c4b500b1a85ea22217f2c65a70ed">IsValid</a>()) <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>(new_decision);</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  }</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span> </div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="comment">// Selected policy failed. Revert back to original decision.</span></div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keywordflow">return</span> current_decision;</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  };</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span> }</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span> </div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> <span class="comment">// TODO(user): Avoid the quadratic algorithm!!</span></div><div class="line"><a name="l00582"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a5c07862681284286ab67401730668f38"> 582</a></span> std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code" href="namespaceoperations__research_1_1sat.html#a5c07862681284286ab67401730668f38">FollowHint</a>(</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keyword">const</span> std::vector<BooleanOrIntegerVariable>& vars,</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keyword">const</span> std::vector<IntegerValue>& 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="l00585"></a><span class="lineno"> 585</span>  <span class="keyword">const</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="l00586"></a><span class="lineno"> 586</span>  <span class="keyword">const</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="l00587"></a><span class="lineno"> 587</span>  <span class="keywordflow">return</span> [=] { <span class="comment">// copy</span></div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < vars.size(); ++i) {</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = values[i];</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordflow">if</span> (vars[i].bool_var != <a class="code" href="namespaceoperations__research_1_1sat.html#add67896a84f6372a648154c5770a0ae0">kNoBooleanVariable</a>) {</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordflow">if</span> (trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(vars[i].bool_var)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>(</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(vars[i].bool_var, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> == 1).<a class="code" href="namespaceoperations__research_1_1glop.html#ac89c7b45754e9a6bdabc08bea586fc4e">Index</a>());</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keyword">const</span> IntegerVariable integer_var = vars[i].int_var;</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordflow">if</span> (integer_trail->IsCurrentlyIgnored(integer_var)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keywordflow">if</span> (integer_trail->IsFixed(integer_var)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span> </div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="keyword">const</span> IntegerVariable positive_var = <a class="code" href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">PositiveVariable</a>(integer_var);</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> decision = <a class="code" href="namespaceoperations__research_1_1sat.html#a46cb4c07c4971a99724693260c92fd5b">SplitAroundGivenValue</a>(</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  positive_var, positive_var != integer_var ? -<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> : <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keywordflow">if</span> (decision.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#ac532c4b500b1a85ea22217f2c65a70ed">IsValid</a>()) <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>(decision);</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span> </div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="comment">// If the value is outside the current possible domain, we skip it.</span></div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</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="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>();</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  };</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span> }</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span> </div><div class="line"><a name="l00612"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a5fcdf1d56a24d096d0c381a9708d4fa9"> 612</a></span> std::function<bool()> <a class="code" href="namespaceoperations__research_1_1sat.html#a5fcdf1d56a24d096d0c381a9708d4fa9">RestartEveryKFailures</a>(<span class="keywordtype">int</span> k, <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver) {</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="keywordtype">bool</span> reset_at_next_call = <span class="keyword">true</span>;</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="keywordtype">int</span> next_num_failures = 0;</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="keywordflow">return</span> [=]() <span class="keyword">mutable</span> {</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="keywordflow">if</span> (reset_at_next_call) {</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  next_num_failures = solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#acace892b69b55e3ee219e2893f34ef8f">num_failures</a>() + k;</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  reset_at_next_call = <span class="keyword">false</span>;</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#acace892b69b55e3ee219e2893f34ef8f">num_failures</a>() >= next_num_failures) {</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  reset_at_next_call = <span class="keyword">true</span>;</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>  <span class="keywordflow">return</span> reset_at_next_call;</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  };</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span> }</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span> </div><div class="line"><a name="l00626"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a527a6ee26b7f573def70daf9b2a9e577"> 626</a></span> std::function<bool()> <a class="code" href="namespaceoperations__research_1_1sat.html#a527a6ee26b7f573def70daf9b2a9e577">SatSolverRestartPolicy</a>(<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="l00627"></a><span class="lineno"> 627</span>  <span class="keyword">auto</span> policy = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_restart_policy.html">RestartPolicy</a>>();</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="keywordflow">return</span> [policy]() { <span class="keywordflow">return</span> policy-><a class="code" href="classoperations__research_1_1sat_1_1_restart_policy.html#a9a4dbc2c6849f437d4f08288eeffbfed">ShouldRestart</a>(); };</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span> }</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> <span class="keyword">namespace </span>{</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span> </div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span> std::function<BooleanOrIntegerLiteral()> WrapIntegerLiteralHeuristic(</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  std::function<IntegerLiteral()> f) {</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="keywordflow">return</span> [f]() { <span class="keywordflow">return</span> BooleanOrIntegerLiteral(f()); };</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span> }</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> } <span class="comment">// namespace</span></div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span> </div><div class="line"><a name="l00640"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a7ac1d9dc3254d77ade7bdbf984884b7e"> 640</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a7ac1d9dc3254d77ade7bdbf984884b7e">ConfigureSearchHeuristics</a>(<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="l00641"></a><span class="lineno"> 641</span>  <a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html">SearchHeuristics</a>& heuristics = *<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html">SearchHeuristics</a>>();</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a984249b5c2efe8f16e6942b54be739a5">fixed_search</a> != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af2155539e87804108c670c32478e123d">policy_index</a> = 0;</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">decision_policies</a>.clear();</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a0d0b8f29f3557e2ee84f53b45d817e02">restart_policies</a>.clear();</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span> </div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>& <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a> = *(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>());</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="keywordflow">switch</span> (<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a257e99b653bc762af5410936511fc5da">search_branching</a>()) {</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#ab620cb0acc7c1245958c5783e1b4767e">SatParameters::AUTOMATIC_SEARCH</a>: {</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> decision_policy;</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#ae535d7515d701373438ee5c103cd3031">randomize_search</a>()) {</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  decision_policy = <a class="code" href="namespaceoperations__research_1_1sat.html#a744ac200820f62ff97a4da72223cbb54">RandomizeOnRestartHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  decision_policy = <a class="code" href="namespaceoperations__research_1_1sat.html#a8f18cefafff72d70f6e96ed3f2ef84aa">SatSolverHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</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>  decision_policy =</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#abcf8d0c663710a1e395489e62de487b1">SequentialSearch</a>({decision_policy, heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a984249b5c2efe8f16e6942b54be739a5">fixed_search</a>});</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  decision_policy = <a class="code" href="namespaceoperations__research_1_1sat.html#a88ab44e20ce09e9942f6b8411452df27">IntegerValueSelectionHeuristic</a>(decision_policy, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">decision_policies</a> = {decision_policy};</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a0d0b8f29f3557e2ee84f53b45d817e02">restart_policies</a> = {<a class="code" href="namespaceoperations__research_1_1sat.html#a527a6ee26b7f573def70daf9b2a9e577">SatSolverRestartPolicy</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)};</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  }</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#afc7419e2f33992c4a7b8b0decd1dc3e0">SatParameters::FIXED_SEARCH</a>: {</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="comment">// Not all Boolean might appear in fixed_search(), so once there is no</span></div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="comment">// decision left, we fix all Booleans that are still undecided.</span></div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">decision_policies</a> = {<a class="code" href="namespaceoperations__research_1_1sat.html#abcf8d0c663710a1e395489e62de487b1">SequentialSearch</a>(</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  {heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a984249b5c2efe8f16e6942b54be739a5">fixed_search</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#a8f18cefafff72d70f6e96ed3f2ef84aa">SatSolverHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)})};</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span> </div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#ae535d7515d701373438ee5c103cd3031">randomize_search</a>()) {</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a0d0b8f29f3557e2ee84f53b45d817e02">restart_policies</a> = {<a class="code" href="namespaceoperations__research_1_1sat.html#a527a6ee26b7f573def70daf9b2a9e577">SatSolverRestartPolicy</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)};</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  }</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span> </div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="comment">// TODO(user): We might want to restart if external info is available.</span></div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="comment">// Code a custom restart for this?</span></div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keyword">auto</span> no_restart = []() { <span class="keywordflow">return</span> <span class="keyword">false</span>; };</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a0d0b8f29f3557e2ee84f53b45d817e02">restart_policies</a> = {no_restart};</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  }</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#ad443a9789397f553a38f9d27f85195c0">SatParameters::HINT_SEARCH</a>: {</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a3ef187fb1a44e4df4e66c2a59304000e">hint_search</a> != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">decision_policies</a> = {</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#abcf8d0c663710a1e395489e62de487b1">SequentialSearch</a>({heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a3ef187fb1a44e4df4e66c2a59304000e">hint_search</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#a8f18cefafff72d70f6e96ed3f2ef84aa">SatSolverHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>),</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a984249b5c2efe8f16e6942b54be739a5">fixed_search</a>})};</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keyword">auto</span> no_restart = []() { <span class="keywordflow">return</span> <span class="keyword">false</span>; };</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a0d0b8f29f3557e2ee84f53b45d817e02">restart_policies</a> = {no_restart};</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  }</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a5b7170787801b1851c20c4c0a21e3e74">SatParameters::PORTFOLIO_SEARCH</a>: {</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="comment">// TODO(user): This is not used in any of our default config. remove?</span></div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="comment">// It make also no sense to choose a value in the LP heuristic and then</span></div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="comment">// override it with IntegerValueSelectionHeuristic(), clean that up.</span></div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  std::vector<std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()>> base_heuristics;</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  base_heuristics.push_back(heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a984249b5c2efe8f16e6942b54be739a5">fixed_search</a>);</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> :</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  *(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint_collection.html">LinearProgrammingConstraintCollection</a>>())) {</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  base_heuristics.push_back(WrapIntegerLiteralHeuristic(</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->HeuristicLpReducedCostBinary(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)));</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  base_heuristics.push_back(WrapIntegerLiteralHeuristic(</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->HeuristicLpMostInfeasibleBinary(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)));</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  }</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">decision_policies</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#a7e0c6e9c16089229f5ae7a34ec631604">CompleteHeuristics</a>(</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  base_heuristics, <a class="code" href="namespaceoperations__research_1_1sat.html#abcf8d0c663710a1e395489e62de487b1">SequentialSearch</a>({<a class="code" href="namespaceoperations__research_1_1sat.html#a8f18cefafff72d70f6e96ed3f2ef84aa">SatSolverHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>),</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a984249b5c2efe8f16e6942b54be739a5">fixed_search</a>}));</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span>& ref : heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">decision_policies</a>) {</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  ref = <a class="code" href="namespaceoperations__research_1_1sat.html#a88ab44e20ce09e9942f6b8411452df27">IntegerValueSelectionHeuristic</a>(ref, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</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>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a0d0b8f29f3557e2ee84f53b45d817e02">restart_policies</a>.assign(heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">decision_policies</a>.size(),</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a527a6ee26b7f573def70daf9b2a9e577">SatSolverRestartPolicy</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>));</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  }</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#aa1f93c70c349b5f740fefe5317b7f9fc">SatParameters::LP_SEARCH</a>: {</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  std::vector<std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()>> lp_heuristics;</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> :</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  *(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint_collection.html">LinearProgrammingConstraintCollection</a>>())) {</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  lp_heuristics.push_back(WrapIntegerLiteralHeuristic(</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->HeuristicLpReducedCostAverageBranching()));</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  }</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="keywordflow">if</span> (lp_heuristics.empty()) { <span class="comment">// Revert to fixed search.</span></div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">decision_policies</a> = {<a class="code" href="namespaceoperations__research_1_1sat.html#abcf8d0c663710a1e395489e62de487b1">SequentialSearch</a>(</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  {heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a984249b5c2efe8f16e6942b54be739a5">fixed_search</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#a8f18cefafff72d70f6e96ed3f2ef84aa">SatSolverHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)})},</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a0d0b8f29f3557e2ee84f53b45d817e02">restart_policies</a> = {<a class="code" href="namespaceoperations__research_1_1sat.html#a527a6ee26b7f573def70daf9b2a9e577">SatSolverRestartPolicy</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)};</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  }</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">decision_policies</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#a7e0c6e9c16089229f5ae7a34ec631604">CompleteHeuristics</a>(</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  lp_heuristics, <a class="code" href="namespaceoperations__research_1_1sat.html#abcf8d0c663710a1e395489e62de487b1">SequentialSearch</a>({<a class="code" href="namespaceoperations__research_1_1sat.html#a8f18cefafff72d70f6e96ed3f2ef84aa">SatSolverHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>),</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a984249b5c2efe8f16e6942b54be739a5">fixed_search</a>}));</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a0d0b8f29f3557e2ee84f53b45d817e02">restart_policies</a>.assign(heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">decision_policies</a>.size(),</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a527a6ee26b7f573def70daf9b2a9e577">SatSolverRestartPolicy</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>));</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  }</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a17a5aa1f5b9e992c1ffb4db39988f542">SatParameters::PSEUDO_COST_SEARCH</a>: {</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> search =</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#abcf8d0c663710a1e395489e62de487b1">SequentialSearch</a>({<a class="code" href="namespaceoperations__research_1_1sat.html#aefab46ecc02eb059ed853ee0213be7fb">PseudoCost</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>), <a class="code" href="namespaceoperations__research_1_1sat.html#a8f18cefafff72d70f6e96ed3f2ef84aa">SatSolverHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>),</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a984249b5c2efe8f16e6942b54be739a5">fixed_search</a>});</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">decision_policies</a> = {</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a88ab44e20ce09e9942f6b8411452df27">IntegerValueSelectionHeuristic</a>(search, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)};</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a0d0b8f29f3557e2ee84f53b45d817e02">restart_policies</a> = {<a class="code" href="namespaceoperations__research_1_1sat.html#a527a6ee26b7f573def70daf9b2a9e577">SatSolverRestartPolicy</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)};</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  }</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a59349c6ff18c51a1487ae271c9c577ee">SatParameters::PORTFOLIO_WITH_QUICK_RESTART_SEARCH</a>: {</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> search = <a class="code" href="namespaceoperations__research_1_1sat.html#abcf8d0c663710a1e395489e62de487b1">SequentialSearch</a>(</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  {<a class="code" href="namespaceoperations__research_1_1sat.html#a744ac200820f62ff97a4da72223cbb54">RandomizeOnRestartHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>), heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a984249b5c2efe8f16e6942b54be739a5">fixed_search</a>});</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">decision_policies</a> = {search};</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a0d0b8f29f3557e2ee84f53b45d817e02">restart_policies</a> = {</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a5fcdf1d56a24d096d0c381a9708d4fa9">RestartEveryKFailures</a>(10, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>())};</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  }</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</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> </div><div class="line"><a name="l00752"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a7e0c6e9c16089229f5ae7a34ec631604"> 752</a></span> std::vector<std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()>> <a class="code" href="namespaceoperations__research_1_1sat.html#a7e0c6e9c16089229f5ae7a34ec631604">CompleteHeuristics</a>(</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <span class="keyword">const</span> std::vector<std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()>>&</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  incomplete_heuristics,</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keyword">const</span> std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()>& completion_heuristic) {</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  std::vector<std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()>> complete_heuristics;</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  complete_heuristics.reserve(incomplete_heuristics.size());</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& incomplete : incomplete_heuristics) {</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  complete_heuristics.push_back(</div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#abcf8d0c663710a1e395489e62de487b1">SequentialSearch</a>({incomplete, completion_heuristic}));</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>  <span class="keywordflow">return</span> complete_heuristics;</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span> }</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span> </div><div class="line"><a name="l00765"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#a3da0daf61b8c11b7503a7d8f49e964d8"> 765</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#a3da0daf61b8c11b7503a7d8f49e964d8">IntegerSearchHelper::IntegerSearchHelper</a>(<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="l00766"></a><span class="lineno"> 766</span>  : model_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>),</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  sat_solver_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>()),</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  integer_trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>()),</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  encoder_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>()),</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  implied_bounds_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html">ImpliedBounds</a>>()),</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  time_limit_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>>()),</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  pseudo_costs_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_pseudo_costs.html">PseudoCosts</a>>()) {</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="comment">// This is needed for recording the pseudo-costs.</span></div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_objective_definition.html">ObjectiveDefinition</a>* objective = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get<<a class="code" href="structoperations__research_1_1sat_1_1_objective_definition.html">ObjectiveDefinition</a>>();</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="keywordflow">if</span> (objective != <span class="keyword">nullptr</span>) objective_var_ = objective-><a class="code" href="structoperations__research_1_1sat_1_1_objective_definition.html#aa3c0b31567c91babfffd5f9afc3161dc">objective_var</a>;</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span> }</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span> </div><div class="line"><a name="l00778"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#a918e2c1a7965a933b914ceaceb847a0c"> 778</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#a918e2c1a7965a933b914ceaceb847a0c">IntegerSearchHelper::BeforeTakingDecision</a>() {</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  <span class="comment">// If we pushed root level deductions, we restart to incorporate them.</span></div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="comment">// Note that in the present of assumptions, it is important to return to</span></div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  <span class="comment">// the level zero first ! otherwise, the new deductions will not be</span></div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="comment">// incorporated and the solver will loop forever.</span></div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac4fc75eea42e935951c766549cf8aa3c">HasPendingRootLevelDeduction</a>()) {</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  <span class="keywordflow">if</span> (!sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac714aeb75f0f6dd87e52e5d1a0d6edc7">RestoreSolverToAssumptionLevel</a>()) {</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  }</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  }</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span> </div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="keywordflow">if</span> (sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == 0) {</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="keywordflow">if</span> (!implied_bounds_-><a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html#a0e2d0bf17ef8f8ea329a2faec4583377">EnqueueNewDeductions</a>()) {</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4f7251fc4692363cf55796a6f3e267ea">NotifyThatModelIsUnsat</a>();</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  }</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span> </div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="keyword">auto</span>* level_zero_callbacks = model_-><a class="code" href="classoperations__research_1_1sat_1_1_model.html#a8d72645353ea6770911c4e0724995ed6">GetOrCreate</a><<a class="code" href="structoperations__research_1_1sat_1_1_level_zero_callback_helper.html">LevelZeroCallbackHelper</a>>();</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& cb : level_zero_callbacks->callbacks) {</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <span class="keywordflow">if</span> (!cb()) {</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4f7251fc4692363cf55796a6f3e267ea">NotifyThatModelIsUnsat</a>();</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  }</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  }</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span> </div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keywordflow">if</span> (model_-><a class="code" href="classoperations__research_1_1sat_1_1_model.html#a8d72645353ea6770911c4e0724995ed6">GetOrCreate</a><<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>()-><a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a650e44c677a43fe4914817b66b5ddb8e">use_sat_inprocessing</a>() &&</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  !model_-><a class="code" href="classoperations__research_1_1sat_1_1_model.html#a8d72645353ea6770911c4e0724995ed6">GetOrCreate</a><<a class="code" href="classoperations__research_1_1sat_1_1_inprocessing.html">Inprocessing</a>>()->InprocessingRound()) {</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4f7251fc4692363cf55796a6f3e267ea">NotifyThatModelIsUnsat</a>();</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  }</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  }</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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"><a class="line" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#ab47c89fedb27c73cf9ab768b913d1dfe"> 813</a></span> LiteralIndex <a class="code" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#ab47c89fedb27c73cf9ab768b913d1dfe">IntegerSearchHelper::GetDecision</a>(</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <span class="keyword">const</span> std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()>& f) {</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  LiteralIndex decision = <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>;</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  <span class="keywordflow">while</span> (!time_limit_-><a class="code" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>()) {</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a> new_decision;</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a697964c4df6330b5d4720be3658ac35a">InPropagationLoop</a>()) {</div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> =</div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8ae8e206270e3bb10251a6fadbdc06e7">NextVariableToBranchOnInPropagationLoop</a>();</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  new_decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#aee356429e37f0750e38ee17ae1464a00">integer_literal</a> =</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a3f4df9da99787316bfb5029b7a6b92b7">GreaterOrEqualToMiddleValue</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, integer_trail_);</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>  }</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <span class="keywordflow">if</span> (!new_decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#ae26b73bbf70dc88433be39df364ca7c1">HasValue</a>()) {</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  new_decision = f();</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>  <span class="keywordflow">if</span> (!new_decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#ae26b73bbf70dc88433be39df364ca7c1">HasValue</a>() &&</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a6554c3addb8705b1ba60140a175de110">CurrentBranchHadAnIncompletePropagation</a>()) {</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05cc8990d6a349e0c5960019ee47b687">FirstUnassignedVariable</a>();</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  new_decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#aee356429e37f0750e38ee17ae1464a00">integer_literal</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#a304417ca7c3964cc928b771620b2dc53">AtMinValue</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, integer_trail_);</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  }</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  }</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  <span class="keywordflow">if</span> (!new_decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#ae26b73bbf70dc88433be39df364ca7c1">HasValue</a>()) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span> </div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="comment">// Convert integer decision to literal one if needed.</span></div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="comment">//</span></div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="comment">// TODO(user): Ideally it would be cool to delay the creation even more</span></div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="comment">// until we have a conflict with these decisions, but it is currrently</span></div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="comment">// hard to do so.</span></div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="keywordflow">if</span> (new_decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#a3c6f3ae96a90c7fcef34dd0f1ce0297e">boolean_literal_index</a> != <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) {</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  decision = new_decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#a3c6f3ae96a90c7fcef34dd0f1ce0297e">boolean_literal_index</a>;</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  decision =</div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  encoder_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html#afcd4038298bec97a2f7a61274c6ef8c7">GetOrCreateAssociatedLiteral</a>(new_decision.<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#aee356429e37f0750e38ee17ae1464a00">integer_literal</a>)</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  .<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>();</div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  }</div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="keywordflow">if</span> (sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a142694366986039454f53b38e8378815">LiteralIsAssigned</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(decision))) {</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="comment">// TODO(user): It would be nicer if this can never happen. For now, it</span></div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <span class="comment">// does because of the Propagate() not reaching the fixed point as</span></div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <span class="comment">// mentionned in a TODO above. As a work-around, we display a message</span></div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="comment">// but do not crash and recall the decision heuristic.</span></div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Trying to take a decision that is already assigned!"</span></div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  << <span class="stringliteral">" Fix this. Continuing for now..."</span>;</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  }</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  }</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keywordflow">return</span> decision;</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> </div><div class="line"><a name="l00864"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#aaad5f63041d2eb2fee1a5b6d1cac8424"> 864</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#aaad5f63041d2eb2fee1a5b6d1cac8424">IntegerSearchHelper::TakeDecision</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> decision) {</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <span class="comment">// Record the changelist and objective bounds for updating pseudo costs.</span></div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  <span class="keyword">const</span> std::vector<PseudoCosts::VariableBoundChange> bound_changes =</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a98bb3bb08c5a9f5c119cf0973bbe5cf8">GetBoundChanges</a>(decision.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>(), model_);</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  IntegerValue old_obj_lb = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  IntegerValue old_obj_ub = <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  <span class="keywordflow">if</span> (objective_var_ != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  old_obj_lb = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(objective_var_);</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  old_obj_ub = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(objective_var_);</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  }</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_level = sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>();</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span> </div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="comment">// TODO(user): on some problems, this function can be quite long. Expand</span></div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="comment">// so that we can check the time limit at each step?</span></div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9ae69b015a43c1a94e8815ab0dd8189c">EnqueueDecisionAndBackjumpOnConflict</a>(decision);</div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span> </div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="comment">// Update the implied bounds each time we enqueue a literal at level zero.</span></div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="comment">// This is "almost free", so we might as well do it.</span></div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <span class="keywordflow">if</span> (old_level == 0 && sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == 1) {</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  implied_bounds_-><a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html#af55df3ca81000daf46c6096a71778c40">ProcessIntegerTrail</a>(decision);</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>  <span class="comment">// Update the pseudo costs.</span></div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="keywordflow">if</span> (sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() > old_level &&</div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  objective_var_ != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="keyword">const</span> IntegerValue new_obj_lb = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(objective_var_);</div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keyword">const</span> IntegerValue new_obj_ub = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(objective_var_);</div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="keyword">const</span> IntegerValue objective_bound_change =</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  (new_obj_lb - old_obj_lb) + (old_obj_ub - new_obj_ub);</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  pseudo_costs_-><a class="code" href="classoperations__research_1_1sat_1_1_pseudo_costs.html#aa64c6ffef5c1b7402acad774c70bab08">UpdateCost</a>(bound_changes, objective_bound_change);</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> </div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a705eddd5baee23097daf34b73e66eae3">AdvanceDeterministicTime</a>(time_limit_);</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keywordflow">return</span> sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad28cbdd5735a0c111a642f39524d969e">ReapplyAssumptionsIfNeeded</a>();</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> </div><div class="line"><a name="l00900"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a8bea9a6a0de60c8fdab99ad7dfdf8498"> 900</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code" href="namespaceoperations__research_1_1sat.html#a8bea9a6a0de60c8fdab99ad7dfdf8498">SolveIntegerProblem</a>(<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="l00901"></a><span class="lineno"> 901</span>  <a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a> = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>>();</div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>-><a class="code" href="classoperations__research_1_1_shared_time_limit.html#ad837e6231722ead53bbaf1c6e8f66032">LimitReached</a>()) <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>;</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span> </div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html">SearchHeuristics</a>& heuristics = *<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html">SearchHeuristics</a>>();</div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_policies = heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">decision_policies</a>.size();</div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(num_policies, 0);</div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(num_policies, heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a0d0b8f29f3557e2ee84f53b45d817e02">restart_policies</a>.size());</div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span> </div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="keyword">auto</span>* helper = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_search_helper.html">IntegerSearchHelper</a>>();</div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span> </div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  <span class="comment">// This is needed for recording the pseudo-costs.</span></div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  IntegerVariable objective_var = <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>;</div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  {</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_objective_definition.html">ObjectiveDefinition</a>* objective = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get<<a class="code" href="structoperations__research_1_1sat_1_1_objective_definition.html">ObjectiveDefinition</a>>();</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="keywordflow">if</span> (objective != <span class="keyword">nullptr</span>) objective_var = objective-><a class="code" href="structoperations__research_1_1sat_1_1_objective_definition.html#aa3c0b31567c91babfffd5f9afc3161dc">objective_var</a>;</div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  }</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span> </div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <span class="comment">// Note that it is important to do the level-zero propagation if it wasn't</span></div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="comment">// already done because EnqueueDecisionAndBackjumpOnConflict() assumes that</span></div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <span class="comment">// the solver is in a "propagated" state.</span></div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* <span class="keyword">const</span> sat_solver = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>();</div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span> </div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="comment">// TODO(user): We have the issue that at level zero. calling the propagation</span></div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="comment">// loop more than once can propagate more! This is because we call the LP</span></div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="comment">// again and again on each level zero propagation. This is causing some</span></div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="comment">// CHECKs() to fail in multithread (rarely) because when we associate new</span></div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  <span class="comment">// literals to integer ones, Propagate() is indirectly called. Not sure yet</span></div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  <span class="comment">// how to fix.</span></div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  <span class="keywordflow">if</span> (!sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d">FinishPropagation</a>()) <span class="keywordflow">return</span> sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5bbe13ebae8aa11a8a4ac1cb01bc66ad">UnsatStatus</a>();</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="keyword">auto</span>* prober = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_prober.html">Prober</a>>();</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>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>& sat_parameters = *(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>());</div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span> </div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="comment">// Main search loop.</span></div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="keyword">const</span> int64_t old_num_conflicts = sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#acace892b69b55e3ee219e2893f34ef8f">num_failures</a>();</div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="keyword">const</span> int64_t conflict_limit = sat_parameters.max_number_of_conflicts();</div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  int64_t num_decisions_since_last_lp_record_ = 0;</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  int64_t num_decisions_without_probing = 0;</div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <span class="keywordflow">while</span> (!<a class="code" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>-><a class="code" href="classoperations__research_1_1_shared_time_limit.html#ad837e6231722ead53bbaf1c6e8f66032">LimitReached</a>() &&</div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  (sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#acace892b69b55e3ee219e2893f34ef8f">num_failures</a>() - old_num_conflicts < conflict_limit)) {</div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="comment">// If needed, restart and switch decision_policy.</span></div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  <span class="keywordflow">if</span> (heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a0d0b8f29f3557e2ee84f53b45d817e02">restart_policies</a>[heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af2155539e87804108c670c32478e123d">policy_index</a>]()) {</div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  <span class="keywordflow">if</span> (!sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac714aeb75f0f6dd87e52e5d1a0d6edc7">RestoreSolverToAssumptionLevel</a>()) {</div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="keywordflow">return</span> sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5bbe13ebae8aa11a8a4ac1cb01bc66ad">UnsatStatus</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>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af2155539e87804108c670c32478e123d">policy_index</a> = (heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af2155539e87804108c670c32478e123d">policy_index</a> + 1) % num_policies;</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  }</div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span> </div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  <span class="keywordflow">if</span> (!helper->BeforeTakingDecision()) <span class="keywordflow">return</span> sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5bbe13ebae8aa11a8a4ac1cb01bc66ad">UnsatStatus</a>();</div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span> </div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  LiteralIndex decision = <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>;</div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <span class="keywordflow">if</span> (heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#aa1668e07fb6607c61474310ad1045657">next_decision_override</a> != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <span class="comment">// Note that to properly count the num_times, we do not want to move</span></div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  <span class="comment">// this function, but actually call that copy.</span></div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  decision = helper->GetDecision(heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#aa1668e07fb6607c61474310ad1045657">next_decision_override</a>);</div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  <span class="keywordflow">if</span> (decision == <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) {</div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#aa1668e07fb6607c61474310ad1045657">next_decision_override</a> = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  }</div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  }</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="keywordflow">if</span> (decision == <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) {</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  decision = helper->GetDecision(</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">decision_policies</a>[heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af2155539e87804108c670c32478e123d">policy_index</a>]);</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> </div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="comment">// Probing?</span></div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  <span class="comment">//</span></div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <span class="comment">// TODO(user): Be smarter about what variables we probe, we can</span></div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  <span class="comment">// also do more than one.</span></div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  <span class="keywordflow">if</span> (decision != <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a> &&</div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == 0 &&</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  sat_parameters.probing_period_at_root() > 0 &&</div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  ++num_decisions_without_probing >=</div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  sat_parameters.probing_period_at_root()) {</div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  num_decisions_without_probing = 0;</div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  <span class="keywordflow">if</span> (!prober->ProbeOneVariable(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(decision).Variable())) {</div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  }</div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span> </div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  <span class="comment">// We need to check after the probing that the literal is not fixed,</span></div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  <span class="comment">// otherwise we just go to the next decision.</span></div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  <span class="keywordflow">if</span> (sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a142694366986039454f53b38e8378815">LiteralIsAssigned</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(decision))) {</div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="keywordflow">continue</span>;</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>  }</div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  <span class="keywordflow">break</span>;</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> </div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  <span class="comment">// No decision means that we reached a leave of the search tree and that</span></div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <span class="comment">// we have a feasible solution.</span></div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <span class="comment">//</span></div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  <span class="comment">// Tricky: If the time limit is reached during the final propagation when</span></div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  <span class="comment">// all variables are fixed, there is no guarantee that the propagation</span></div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  <span class="comment">// responsible for testing the validity of the solution was run to</span></div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  <span class="comment">// completion. So we cannot report a feasible solution.</span></div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>-><a class="code" href="classoperations__research_1_1_shared_time_limit.html#ad837e6231722ead53bbaf1c6e8f66032">LimitReached</a>()) <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>;</div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <span class="keywordflow">if</span> (decision == <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) {</div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  <span class="comment">// Save the current polarity of all Booleans in the solution. It will be</span></div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  <span class="comment">// followed for the next SAT decisions. This is known to be a good policy</span></div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  <span class="comment">// for optimization problem. Note that for decision problem we don't care</span></div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  <span class="comment">// since we are just done as soon as a solution is found.</span></div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="comment">//</span></div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  <span class="comment">// This idea is kind of "well known", see for instance the "LinSBPS"</span></div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  <span class="comment">// submission to the maxSAT 2018 competition by Emir Demirovic and Peter</span></div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <span class="comment">// Stuckey where they show it is a good idea and provide more references.</span></div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="keywordflow">if</span> (<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>()-><a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a1635a2dbd56096bb62e0581cd949cceb">use_optimization_hints</a>()) {</div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  <span class="keyword">auto</span>* sat_decision = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html">SatDecisionPolicy</a>>();</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& 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="l01011"></a><span class="lineno"> 1011</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < trail.Index(); ++i) {</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  sat_decision->SetAssignmentPreference(trail[i], 0.0);</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  }</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  }</div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>;</div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  }</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span> </div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <span class="keywordflow">if</span> (!helper->TakeDecision(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(decision))) {</div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="keywordflow">return</span> sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5bbe13ebae8aa11a8a4ac1cb01bc66ad">UnsatStatus</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>  <span class="comment">// TODO(user): Experiment more around dynamically changing the</span></div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  <span class="comment">// threshold for storing LP solutions in the pool. Alternatively expose</span></div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  <span class="comment">// this as parameter so this can be tuned later.</span></div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  <span class="comment">//</span></div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  <span class="comment">// TODO(user): Avoid adding the same solution many time if the LP didn't</span></div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  <span class="comment">// change. Avoid adding solution that are too deep in the tree (most</span></div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="comment">// variable fixed). Also use a callback rather than having this here, we</span></div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="comment">// don't want this file to depend on cp_model.proto.</span></div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  <span class="keywordflow">if</span> (<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get<<a class="code" href="classoperations__research_1_1sat_1_1_shared_l_p_solution_repository.html">SharedLPSolutionRepository</a>>() != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  num_decisions_since_last_lp_record_++;</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  <span class="keywordflow">if</span> (num_decisions_since_last_lp_record_ >= 100) {</div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  <span class="comment">// NOTE: We can actually record LP solutions more frequently. However</span></div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  <span class="comment">// this process is time consuming and workers waste a lot of time doing</span></div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  <span class="comment">// this. To avoid this we don't record solutions after each decision.</span></div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a334bf93d91912354ff5d0f161a64c273">RecordLPRelaxationValues</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  num_decisions_since_last_lp_record_ = 0;</div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  }</div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  }</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  }</div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  <span class="keywordflow">return</span> SatSolver::Status::LIMIT_REACHED;</div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span> }</div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span> </div><div class="line"><a name="l01044"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a"> 1044</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code" href="namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a">ResetAndSolveIntegerProblem</a>(</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  <span class="keyword">const</span> std::vector<Literal>& assumptions, <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="l01046"></a><span class="lineno"> 1046</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* <span class="keyword">const</span> solver = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>();</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span> </div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <span class="comment">// Sync the bound first.</span></div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="keywordflow">if</span> (!solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029">ResetToLevelZero</a>()) <span class="keywordflow">return</span> solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5bbe13ebae8aa11a8a4ac1cb01bc66ad">UnsatStatus</a>();</div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  <span class="keyword">auto</span>* level_zero_callbacks = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="structoperations__research_1_1sat_1_1_level_zero_callback_helper.html">LevelZeroCallbackHelper</a>>();</div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& cb : level_zero_callbacks->callbacks) {</div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  <span class="keywordflow">if</span> (!cb()) {</div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4f7251fc4692363cf55796a6f3e267ea">NotifyThatModelIsUnsat</a>();</div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  <span class="keywordflow">return</span> solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5bbe13ebae8aa11a8a4ac1cb01bc66ad">UnsatStatus</a>();</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  }</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> </div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  <span class="comment">// Add the assumptions if any and solve.</span></div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  <span class="keywordflow">if</span> (!solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad4494c6831942d344ed1d9758f0e6cd9">ResetWithGivenAssumptions</a>(assumptions)) {</div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  <span class="keywordflow">return</span> solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5bbe13ebae8aa11a8a4ac1cb01bc66ad">UnsatStatus</a>();</div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  }</div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a8bea9a6a0de60c8fdab99ad7dfdf8498">SolveIntegerProblem</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span> }</div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span> </div><div class="line"><a name="l01065"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a48d1aae59a778d6f39609f9add7cd0a5"> 1065</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code" href="namespaceoperations__research_1_1sat.html#a48d1aae59a778d6f39609f9add7cd0a5">SolveIntegerProblemWithLazyEncoding</a>(<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="l01066"></a><span class="lineno"> 1066</span>  <span class="keyword">const</span> IntegerVariable num_vars =</div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <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>>()->NumIntegerVariables();</div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  std::vector<IntegerVariable> all_variables;</div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  <span class="keywordflow">for</span> (IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>(0); <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> < num_vars; ++<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  all_variables.push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  }</div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span> </div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  <a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html">SearchHeuristics</a>& heuristics = *<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html">SearchHeuristics</a>>();</div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af2155539e87804108c670c32478e123d">policy_index</a> = 0;</div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">decision_policies</a> = {<a class="code" href="namespaceoperations__research_1_1sat.html#abcf8d0c663710a1e395489e62de487b1">SequentialSearch</a>(</div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  {<a class="code" href="namespaceoperations__research_1_1sat.html#a8f18cefafff72d70f6e96ed3f2ef84aa">SatSolverHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>),</div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a0b08971dbb223f77e7fc9c41a77fdc7b">FirstUnassignedVarAtItsMinHeuristic</a>(all_variables, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)})};</div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  heuristics.<a class="code" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a0d0b8f29f3557e2ee84f53b45d817e02">restart_policies</a> = {<a class="code" href="namespaceoperations__research_1_1sat.html#a527a6ee26b7f573def70daf9b2a9e577">SatSolverRestartPolicy</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)};</div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a">ResetAndSolveIntegerProblem</a>(<span class="comment">/*assumptions=*/</span>{}, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span> }</div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span> </div><div class="line"><a name="l01082"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#abb234c348ddabb307c1170b3e4c7f2b9"> 1082</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code" href="namespaceoperations__research_1_1sat.html#abb234c348ddabb307c1170b3e4c7f2b9">ContinuousProbing</a>(</div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  <span class="keyword">const</span> std::vector<BooleanVariable>& bool_vars,</div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& int_vars,</div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  <span class="keyword">const</span> std::function<<span class="keywordtype">void</span>()>& feasible_solution_observer, <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="l01086"></a><span class="lineno"> 1086</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"Start continuous probing with "</span> << bool_vars.size()</div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  << <span class="stringliteral">" Boolean variables, and "</span> << int_vars.size()</div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  << <span class="stringliteral">" integer variables"</span>;</div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span> </div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>();</div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  <a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a> = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>>();</div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</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="l01093"></a><span class="lineno"> 1093</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="l01094"></a><span class="lineno"> 1094</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>& sat_parameters = *(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>());</div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  <span class="keyword">auto</span>* level_zero_callbacks = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="structoperations__research_1_1sat_1_1_level_zero_callback_helper.html">LevelZeroCallbackHelper</a>>();</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  <a class="code" href="classoperations__research_1_1sat_1_1_prober.html">Prober</a>* prober = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_prober.html">Prober</a>>();</div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span> </div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  std::vector<BooleanVariable> active_vars;</div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  std::vector<BooleanVariable> integer_bounds;</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  absl::flat_hash_set<BooleanVariable> integer_bounds_set;</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span> </div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <span class="keywordtype">int</span> loop = 0;</div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  <span class="keywordflow">while</span> (!<a class="code" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>-><a class="code" href="classoperations__research_1_1_shared_time_limit.html#ad837e6231722ead53bbaf1c6e8f66032">LimitReached</a>()) {</div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"Probing loop "</span> << loop++;</div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span> </div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  <span class="comment">// Sync the bounds first.</span></div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  <span class="keyword">auto</span> SyncBounds = [solver, &level_zero_callbacks]() {</div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="keywordflow">if</span> (!solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029">ResetToLevelZero</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& cb : level_zero_callbacks->callbacks) {</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <span class="keywordflow">if</span> (!cb()) {</div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4f7251fc4692363cf55796a6f3e267ea">NotifyThatModelIsUnsat</a>();</div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  }</div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  }</div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  };</div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  <span class="keywordflow">if</span> (!SyncBounds()) {</div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  }</div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span> </div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  <span class="comment">// Run sat in-processing to reduce the size of the clause database.</span></div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  <span class="keywordflow">if</span> (sat_parameters.use_sat_inprocessing() &&</div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  !<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_inprocessing.html">Inprocessing</a>>()->InprocessingRound()) {</div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  }</div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span> </div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  <span class="comment">// TODO(user): Explore fast probing methods.</span></div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span> </div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  <span class="comment">// Probe each Boolean variable at most once per loop.</span></div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  absl::flat_hash_set<BooleanVariable> probed;</div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span> </div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  <span class="comment">// Probe variable bounds.</span></div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  <span class="comment">// TODO(user): Probe optional variables.</span></div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable int_var : int_vars) {</div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  <span class="keywordflow">if</span> (integer_trail->IsFixed(int_var) ||</div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  integer_trail->IsOptional(int_var)) {</div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  }</div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span> </div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <span class="keyword">const</span> BooleanVariable shave_lb =</div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  encoder</div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  ->GetOrCreateAssociatedLiteral(<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(</div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  int_var, integer_trail->LowerBound(int_var)))</div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  .Variable();</div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  <span class="keywordflow">if</span> (!probed.contains(shave_lb)) {</div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  probed.insert(shave_lb);</div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  <span class="keywordflow">if</span> (!prober->ProbeOneVariable(shave_lb)) {</div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  }</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>  <span class="keyword">const</span> BooleanVariable shave_ub =</div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  encoder</div><div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  ->GetOrCreateAssociatedLiteral(<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(</div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  int_var, integer_trail->UpperBound(int_var)))</div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  .Variable();</div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  <span class="keywordflow">if</span> (!probed.contains(shave_ub)) {</div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  probed.insert(shave_ub);</div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  <span class="keywordflow">if</span> (!prober->ProbeOneVariable(shave_ub)) {</div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  }</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> </div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  <span class="keywordflow">if</span> (!SyncBounds()) {</div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  }</div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>-><a class="code" href="classoperations__research_1_1_shared_time_limit.html#ad837e6231722ead53bbaf1c6e8f66032">LimitReached</a>()) {</div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>;</div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  }</div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  }</div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span> </div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  <span class="comment">// Probe Boolean variables from the model.</span></div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> BooleanVariable& bool_var : bool_vars) {</div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  <span class="keywordflow">if</span> (solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(bool_var)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>-><a class="code" href="classoperations__research_1_1_shared_time_limit.html#ad837e6231722ead53bbaf1c6e8f66032">LimitReached</a>()) {</div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>;</div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  }</div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  <span class="keywordflow">if</span> (!SyncBounds()) {</div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  }</div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <span class="keywordflow">if</span> (!probed.contains(bool_var)) {</div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  probed.insert(bool_var);</div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  <span class="keywordflow">if</span> (!prober->ProbeOneVariable(bool_var)) {</div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  }</div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  }</div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  }</div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  }</div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>;</div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span> }</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> } <span class="comment">// namespace sat</span></div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="sat__inprocessing_8h_html"><div class="ttname"><a href="sat__inprocessing_8h.html">sat_inprocessing.h</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_pseudo_costs_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pseudo_costs.html">operations_research::sat::PseudoCosts</a></div><div class="ttdef"><b>Definition:</b> <a href="pseudo__costs_8h_source.html#l00028">pseudo_costs.h:28</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_time_limit_html"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html">operations_research::TimeLimit</a></div><div class="ttdoc">A simple class to enforce both an elapsed time limit and a deterministic time limit in the same threa...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00106">time_limit.h:106</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a0441e1a54fe203c0707131e587de8fae"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0441e1a54fe203c0707131e587de8fae">operations_research::sat::RandomizeDecisionHeuristic</a></div><div class="ttdeci">void RandomizeDecisionHeuristic(absl::BitGenRef random, SatParameters *parameters)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00038">sat/util.cc:38</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_ac4fc75eea42e935951c766549cf8aa3c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ac4fc75eea42e935951c766549cf8aa3c">operations_research::sat::IntegerTrail::HasPendingRootLevelDeduction</a></div><div class="ttdeci">bool HasPendingRootLevelDeduction() const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00971">integer.h:971</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html">operations_research::sat::IntegerLiteral</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00168">integer.h:168</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_aa1f93c70c349b5f740fefe5317b7f9fc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#aa1f93c70c349b5f740fefe5317b7f9fc">operations_research::sat::SatParameters::LP_SEARCH</a></div><div class="ttdeci">static constexpr SearchBranching LP_SEARCH</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00780">sat_parameters.pb.h:780</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html">operations_research::sat::LinearProgrammingConstraint</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00131">linear_programming_constraint.h:131</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="cp__model__solver_8cc_html_aec8af5c1be4e1b6d4330e1161028de21"><div class="ttname"><a href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a></div><div class="ttdeci">ModelSharedTimeLimit * time_limit</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l01951">cp_model_solver.cc:1951</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a700f8f1db38fcb59cab04ff2d75a915f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a700f8f1db38fcb59cab04ff2d75a915f">operations_research::sat::LinearProgrammingConstraint::SolutionIsInteger</a></div><div class="ttdeci">bool SolutionIsInteger() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00162">linear_programming_constraint.h:162</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="classoperations__research_1_1sat_1_1_sat_parameters_html_a0111ae24346ddd398aaaf891b887a6fa"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a0111ae24346ddd398aaaf891b887a6fa">operations_research::sat::SatParameters::exploit_all_lp_solution</a></div><div class="ttdeci">bool exploit_all_lp_solution() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l06930">sat_parameters.pb.h:6930</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">operations_research::sat::SatSolver::FEASIBLE</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00184">sat_solver.h:184</a></div></div>
|
|
<div class="ttc" id="sat__decision_8h_html"><div class="ttname"><a href="sat__decision_8h.html">sat_decision.h</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html_a3e2eb445631727dd4abf1d5343f16b2f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">operations_research::sat::IntegerLiteral::LowerOrEqual</a></div><div class="ttdeci">static IntegerLiteral LowerOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01383">integer.h:1383</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00983">base/logging.h:983</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_model_html_a8d72645353ea6770911c4e0724995ed6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html#a8d72645353ea6770911c4e0724995ed6">operations_research::sat::Model::GetOrCreate</a></div><div class="ttdeci">T * GetOrCreate()</div><div class="ttdoc">Returns an object of type T that is unique to this model (like a "local" singleton).</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00106">sat/model.h:106</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_ab857cd2aead68952d9fe92a8ad8d3ac9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">operations_research::sat::IntegerTrail::LowerBound</a></div><div class="ttdeci">IntegerValue LowerBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01435">integer.h:1435</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_literal_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a764be64f3029f8b8e23511061d8de355">operations_research::sat::Literal::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00095">sat_base.h:95</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_a1635a2dbd56096bb62e0581cd949cceb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a1635a2dbd56096bb62e0581cd949cceb">operations_research::sat::SatParameters::use_optimization_hints</a></div><div class="ttdeci">bool use_optimization_hints() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l05835">sat_parameters.pb.h:5835</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="classoperations__research_1_1sat_1_1_shared_response_manager_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_response_manager.html">operations_research::sat::SharedResponseManager</a></div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8h_source.html#l00173">synchronization.h:173</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a48d1aae59a778d6f39609f9add7cd0a5"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a48d1aae59a778d6f39609f9add7cd0a5">operations_research::sat::SolveIntegerProblemWithLazyEncoding</a></div><div class="ttdeci">SatSolver::Status SolveIntegerProblemWithLazyEncoding(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l01065">integer_search.cc:1065</a></div></div>
|
|
<div class="ttc" id="sched__constraints_8cc_html_a826c744af066625acb241b17ae3e2be9"><div class="ttname"><a href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a></div><div class="ttdeci">Rev< int64_t > start_min</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00243">sched_constraints.cc:243</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_restart_policy_html_a9a4dbc2c6849f437d4f08288eeffbfed"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_restart_policy.html#a9a4dbc2c6849f437d4f08288eeffbfed">operations_research::sat::RestartPolicy::ShouldRestart</a></div><div class="ttdeci">bool ShouldRestart()</div><div class="ttdef"><b>Definition:</b> <a href="restart_8cc_source.html#l00081">restart.cc:81</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_shared_l_p_solution_repository_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_l_p_solution_repository.html">operations_research::sat::SharedLPSolutionRepository</a></div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8h_source.html#l00139">synchronization.h:139</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="structoperations__research_1_1sat_1_1_integer_literal_html_ab6516f556b715738034b30d290c40214"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#ab6516f556b715738034b30d290c40214">operations_research::sat::IntegerLiteral::var</a></div><div class="ttdeci">IntegerVariable var</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00211">integer.h:211</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a7e0c6e9c16089229f5ae7a34ec631604"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7e0c6e9c16089229f5ae7a34ec631604">operations_research::sat::CompleteHeuristics</a></div><div class="ttdeci">std::vector< std::function< BooleanOrIntegerLiteral()> > CompleteHeuristics(const std::vector< std::function< BooleanOrIntegerLiteral()>> &incomplete_heuristics, const std::function< BooleanOrIntegerLiteral()> &completion_heuristic)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00752">integer_search.cc:752</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_af00b4e8985ea79330bc3f378208ad024"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#af00b4e8985ea79330bc3f378208ad024">operations_research::sat::SatParameters::exploit_relaxation_solution</a></div><div class="ttdeci">bool exploit_relaxation_solution() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l06986">sat_parameters.pb.h:6986</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_a257e99b653bc762af5410936511fc5da"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a257e99b653bc762af5410936511fc5da">operations_research::sat::SatParameters::search_branching</a></div><div class="ttdeci">::operations_research::sat::SatParameters_SearchBranching search_branching() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l06789">sat_parameters.pb.h:6789</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_objective_definition_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_objective_definition.html">operations_research::sat::ObjectiveDefinition</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__mapping_8h_source.html#l00040">cp_model_mapping.h:40</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_implied_bounds_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html">operations_research::sat::ImpliedBounds</a></div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8h_source.html#l00079">implied_bounds.h:79</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_search_helper_html_a3da0daf61b8c11b7503a7d8f49e964d8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_search_helper.html#a3da0daf61b8c11b7503a7d8f49e964d8">operations_research::sat::IntegerSearchHelper::IntegerSearchHelper</a></div><div class="ttdeci">IntegerSearchHelper(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00765">integer_search.cc:765</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_boolean_or_integer_literal_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">operations_research::sat::BooleanOrIntegerLiteral</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00041">integer_search.h:41</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_acace892b69b55e3ee219e2893f34ef8f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#acace892b69b55e3ee219e2893f34ef8f">operations_research::sat::SatSolver::num_failures</a></div><div class="ttdeci">int64_t num_failures() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00085">sat_solver.cc:85</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ac4a25d47a029efe205efbc015f7c7e7c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ac4a25d47a029efe205efbc015f7c7e7c">operations_research::sat::SplitUsingBestSolutionValueInRepository</a></div><div class="ttdeci">IntegerLiteral SplitUsingBestSolutionValueInRepository(IntegerVariable var, const SharedSolutionRepository< int64_t > &solution_repo, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00127">integer_search.cc:127</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_a5b7170787801b1851c20c4c0a21e3e74"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a5b7170787801b1851c20c4c0a21e3e74">operations_research::sat::SatParameters::PORTFOLIO_SEARCH</a></div><div class="ttdeci">static constexpr SearchBranching PORTFOLIO_SEARCH</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00778">sat_parameters.pb.h:778</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="namespaceoperations__research_1_1sat_html_abb234c348ddabb307c1170b3e4c7f2b9"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#abb234c348ddabb307c1170b3e4c7f2b9">operations_research::sat::ContinuousProbing</a></div><div class="ttdeci">SatSolver::Status ContinuousProbing(const std::vector< BooleanVariable > &bool_vars, const std::vector< IntegerVariable > &int_vars, const std::function< void()> &feasible_solution_observer, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l01082">integer_search.cc:1082</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a8ae8e206270e3bb10251a6fadbdc06e7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a8ae8e206270e3bb10251a6fadbdc06e7">operations_research::sat::IntegerTrail::NextVariableToBranchOnInPropagationLoop</a></div><div class="ttdeci">IntegerVariable NextVariableToBranchOnInPropagationLoop() const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01211">integer.cc:1211</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_a17a5aa1f5b9e992c1ffb4db39988f542"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a17a5aa1f5b9e992c1ffb4db39988f542">operations_research::sat::SatParameters::PSEUDO_COST_SEARCH</a></div><div class="ttdeci">static constexpr SearchBranching PSEUDO_COST_SEARCH</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00782">sat_parameters.pb.h:782</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a6554c3addb8705b1ba60140a175de110"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a6554c3addb8705b1ba60140a175de110">operations_research::sat::IntegerTrail::CurrentBranchHadAnIncompletePropagation</a></div><div class="ttdeci">bool CurrentBranchHadAnIncompletePropagation()</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01240">integer.cc:1240</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_a59349c6ff18c51a1487ae271c9c577ee"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a59349c6ff18c51a1487ae271c9c577ee">operations_research::sat::SatParameters::PORTFOLIO_WITH_QUICK_RESTART_SEARCH</a></div><div class="ttdeci">static constexpr SearchBranching PORTFOLIO_WITH_QUICK_RESTART_SEARCH</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00784">sat_parameters.pb.h:784</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a4bd2e815ca2f702a4b6aa744b1ff3b82"><div class="ttname"><a href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a></div><div class="ttdeci">#define CHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00705">base/logging.h:705</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a7f1ac774d4646a83631f8117f4ea03f5"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">operations_research::sat::PositiveVariable</a></div><div class="ttdeci">IntegerVariable PositiveVariable(IntegerVariable i)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00143">integer.h:143</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_mapping_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_mapping.html">operations_research::sat::CpModelMapping</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__mapping_8h_source.html#l00065">cp_model_mapping.h:65</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a8f18cefafff72d70f6e96ed3f2ef84aa"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8f18cefafff72d70f6e96ed3f2ef84aa">operations_research::sat::SatSolverHeuristic</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> SatSolverHeuristic(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00315">integer_search.cc:315</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_collection_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint_collection.html">operations_research::sat::LinearProgrammingConstraintCollection</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00559">linear_programming_constraint.h:559</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a5fcdf1d56a24d096d0c381a9708d4fa9"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5fcdf1d56a24d096d0c381a9708d4fa9">operations_research::sat::RestartEveryKFailures</a></div><div class="ttdeci">std::function< bool()> RestartEveryKFailures(int k, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00612">integer_search.cc:612</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="structoperations__research_1_1sat_1_1_search_heuristics_html_a984249b5c2efe8f16e6942b54be739a5"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_search_heuristics.html#a984249b5c2efe8f16e6942b54be739a5">operations_research::sat::SearchHeuristics::fixed_search</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> fixed_search</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00074">integer_search.h:74</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_shared_relaxation_solution_repository_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_relaxation_solution_repository.html">operations_research::sat::SharedRelaxationSolutionRepository</a></div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8h_source.html#l00130">synchronization.h:130</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_ad28cbdd5735a0c111a642f39524d969e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ad28cbdd5735a0c111a642f39524d969e">operations_research::sat::SatSolver::ReapplyAssumptionsIfNeeded</a></div><div class="ttdeci">bool ReapplyAssumptionsIfNeeded()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00555">sat_solver.cc:555</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a5c07862681284286ab67401730668f38"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5c07862681284286ab67401730668f38">operations_research::sat::FollowHint</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> FollowHint(const std::vector< BooleanOrIntegerVariable > &vars, const std::vector< IntegerValue > &values, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00582">integer_search.cc:582</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_level_zero_callback_helper_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_level_zero_callback_helper.html">operations_research::sat::LevelZeroCallbackHelper</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00091">integer_search.h:91</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_boolean_or_integer_literal_html_a3c6f3ae96a90c7fcef34dd0f1ce0297e"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#a3c6f3ae96a90c7fcef34dd0f1ce0297e">operations_research::sat::BooleanOrIntegerLiteral::boolean_literal_index</a></div><div class="ttdeci">LiteralIndex boolean_literal_index</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00053">integer_search.h:53</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_encoder_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html">operations_research::sat::IntegerEncoder</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00356">integer.h:356</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a7ac1d9dc3254d77ade7bdbf984884b7e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7ac1d9dc3254d77ade7bdbf984884b7e">operations_research::sat::ConfigureSearchHeuristics</a></div><div class="ttdeci">void ConfigureSearchHeuristics(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00640">integer_search.cc:640</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a5bbe13ebae8aa11a8a4ac1cb01bc66ad"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a5bbe13ebae8aa11a8a4ac1cb01bc66ad">operations_research::sat::SatSolver::UnsatStatus</a></div><div class="ttdeci">Status UnsatStatus() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00310">sat_solver.h:310</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a527a6ee26b7f573def70daf9b2a9e577"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a527a6ee26b7f573def70daf9b2a9e577">operations_research::sat::SatSolverRestartPolicy</a></div><div class="ttdeci">std::function< bool()> SatSolverRestartPolicy(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00626">integer_search.cc:626</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_add67896a84f6372a648154c5770a0ae0"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#add67896a84f6372a648154c5770a0ae0">operations_research::sat::kNoBooleanVariable</a></div><div class="ttdeci">const BooleanVariable kNoBooleanVariable(-1)</div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_shared_solution_repository_html_ad3280cfa83b844b02b9194550b18b058"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_solution_repository.html#ad3280cfa83b844b02b9194550b18b058">operations_research::sat::SharedSolutionRepository::GetVariableValueInSolution</a></div><div class="ttdeci">ValueType GetVariableValueInSolution(int var_index, int solution_index) const</div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8h_source.html#l00483">synchronization.h:483</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_encoder_html_afcd4038298bec97a2f7a61274c6ef8c7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html#afcd4038298bec97a2f7a61274c6ef8c7">operations_research::sat::IntegerEncoder::GetOrCreateAssociatedLiteral</a></div><div class="ttdeci">Literal GetOrCreateAssociatedLiteral(IntegerLiteral i_lit)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00220">integer.cc:220</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html_ac532c4b500b1a85ea22217f2c65a70ed"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#ac532c4b500b1a85ea22217f2c65a70ed">operations_research::sat::IntegerLiteral::IsValid</a></div><div class="ttdeci">bool IsValid() const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00190">integer.h:190</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a9ae69b015a43c1a94e8815ab0dd8189c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a9ae69b015a43c1a94e8815ab0dd8189c">operations_research::sat::SatSolver::EnqueueDecisionAndBackjumpOnConflict</a></div><div class="ttdeci">int EnqueueDecisionAndBackjumpOnConflict(Literal true_literal)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00500">sat_solver.cc:500</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_search_heuristics_html_af925e41205032e143d718455bfeede3c"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">operations_research::sat::SearchHeuristics::decision_policies</a></div><div class="ttdeci">std::vector< std::function< BooleanOrIntegerLiteral()> > decision_policies</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00066">integer_search.h:66</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_ad4494c6831942d344ed1d9758f0e6cd9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ad4494c6831942d344ed1d9758f0e6cd9">operations_research::sat::SatSolver::ResetWithGivenAssumptions</a></div><div class="ttdeci">bool ResetWithGivenAssumptions(const std::vector< Literal > &assumptions)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00537">sat_solver.cc:537</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_variables_assignment_html_a49e751eb6f0e9babd957889bb8e7472d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">operations_research::sat::VariablesAssignment::VariableIsAssigned</a></div><div class="ttdeci">bool VariableIsAssigned(BooleanVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00160">sat_base.h:160</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="classoperations__research_1_1_shared_time_limit_html_ad837e6231722ead53bbaf1c6e8f66032"><div class="ttname"><a href="classoperations__research_1_1_shared_time_limit.html#ad837e6231722ead53bbaf1c6e8f66032">operations_research::SharedTimeLimit::LimitReached</a></div><div class="ttdeci">bool LimitReached() const</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00358">time_limit.h:358</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_decision_policy_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html">operations_research::sat::SatDecisionPolicy</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8h_source.html#l00035">sat_decision.h:35</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_implied_bounds_html_af55df3ca81000daf46c6096a71778c40"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html#af55df3ca81000daf46c6096a71778c40">operations_research::sat::ImpliedBounds::ProcessIntegerTrail</a></div><div class="ttdeci">void ProcessIntegerTrail(Literal first_decision)</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8cc_source.html#l00197">implied_bounds.cc:197</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="structoperations__research_1_1sat_1_1_search_heuristics_html_a3ef187fb1a44e4df4e66c2a59304000e"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_search_heuristics.html#a3ef187fb1a44e4df4e66c2a59304000e">operations_research::sat::SearchHeuristics::hint_search</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> hint_search</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00075">integer_search.h:75</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_model_random_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model_random_generator.html">operations_research::sat::ModelRandomGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8h_source.html#l00090">sat/util.h:90</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_variables_assignment_html_a142694366986039454f53b38e8378815"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a142694366986039454f53b38e8378815">operations_research::sat::VariablesAssignment::LiteralIsAssigned</a></div><div class="ttdeci">bool LiteralIsAssigned(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00155">sat_base.h:155</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_ad20f833d4b2b9b1416fb25ac4d12cd84"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#ad20f833d4b2b9b1416fb25ac4d12cd84">operations_research::sat::SatParameters::exploit_objective</a></div><div class="ttdeci">bool exploit_objective() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l07014">sat_parameters.pb.h:7014</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_objective_definition_html_aa3c0b31567c91babfffd5f9afc3161dc"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_objective_definition.html#aa3c0b31567c91babfffd5f9afc3161dc">operations_research::sat::ObjectiveDefinition::objective_var</a></div><div class="ttdeci">IntegerVariable objective_var</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__mapping_8h_source.html#l00043">cp_model_mapping.h:43</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_a907df69b7551f6d72100dfb858d25300"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a907df69b7551f6d72100dfb858d25300">operations_research::sat::SatParameters::exploit_best_solution</a></div><div class="ttdeci">bool exploit_best_solution() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l06958">sat_parameters.pb.h:6958</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a705eddd5baee23097daf34b73e66eae3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a705eddd5baee23097daf34b73e66eae3">operations_research::sat::SatSolver::AdvanceDeterministicTime</a></div><div class="ttdeci">void AdvanceDeterministicTime(TimeLimit *limit)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00423">sat_solver.h:423</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a71fa416b44768076a0e7dd7777ab433d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a71fa416b44768076a0e7dd7777ab433d">operations_research::sat::ChooseBestObjectiveValue</a></div><div class="ttdeci">IntegerLiteral ChooseBestObjectiveValue(IntegerVariable var, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00046">integer_search.cc:46</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_a650e44c677a43fe4914817b66b5ddb8e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a650e44c677a43fe4914817b66b5ddb8e">operations_research::sat::SatParameters::use_sat_inprocessing</a></div><div class="ttdeci">bool use_sat_inprocessing() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l05555">sat_parameters.pb.h:5555</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_afc647a54403bf1bedce9b09841748c91"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#afc647a54403bf1bedce9b09841748c91">operations_research::sat::SequentialValueSelection</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> SequentialValueSelection(std::vector< std::function< IntegerLiteral(IntegerVariable)>> value_selection_heuristics, std::function< BooleanOrIntegerLiteral()> var_selection_heuristic, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00198">integer_search.cc:198</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">operations_research::sat::SatSolver::LIMIT_REACHED</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00185">sat_solver.h:185</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a697964c4df6330b5d4720be3658ac35a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a697964c4df6330b5d4720be3658ac35a">operations_research::sat::IntegerTrail::InPropagationLoop</a></div><div class="ttdeci">bool InPropagationLoop() const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01201">integer.cc:1201</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_ac035378cea0ed7b0978105547402faa8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">operations_research::sat::SatSolver::Backtrack</a></div><div class="ttdeci">void Backtrack(int target_level)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00889">sat_solver.cc:889</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_search_helper_html_a918e2c1a7965a933b914ceaceb847a0c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_search_helper.html#a918e2c1a7965a933b914ceaceb847a0c">operations_research::sat::IntegerSearchHelper::BeforeTakingDecision</a></div><div class="ttdeci">bool BeforeTakingDecision()</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00778">integer_search.cc:778</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="namespaceoperations__research_1_1sat_html_a3f4df9da99787316bfb5029b7a6b92b7"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3f4df9da99787316bfb5029b7a6b92b7">operations_research::sat::GreaterOrEqualToMiddleValue</a></div><div class="ttdeci">IntegerLiteral GreaterOrEqualToMiddleValue(IntegerVariable var, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00058">integer_search.cc:58</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_ab620cb0acc7c1245958c5783e1b4767e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#ab620cb0acc7c1245958c5783e1b4767e">operations_research::sat::SatParameters::AUTOMATIC_SEARCH</a></div><div class="ttdeci">static constexpr SearchBranching AUTOMATIC_SEARCH</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00774">sat_parameters.pb.h:774</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_acc1aaae243ed4381e84f8309aacb3bbc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#acc1aaae243ed4381e84f8309aacb3bbc">operations_research::sat::IntegerTrail::IsOptional</a></div><div class="ttdeci">bool IsOptional(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00695">integer.h:695</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00702">base/logging.h:702</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a6c01e08a9089e0d5fed2507f479bbadc"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a6c01e08a9089e0d5fed2507f479bbadc">operations_research::sat::SchedulingSearchHeuristic</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> SchedulingSearchHeuristic(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00350">integer_search.cc:350</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_a0ee70f9d17fac333fb71c0ab6423f58c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0ee70f9d17fac333fb71c0ab6423f58c">operations_research::sat::UpperBound</a></div><div class="ttdeci">std::function< int64_t(const Model &)> UpperBound(IntegerVariable v)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01659">integer.h:1659</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_ac714aeb75f0f6dd87e52e5d1a0d6edc7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ac714aeb75f0f6dd87e52e5d1a0d6edc7">operations_research::sat::SatSolver::RestoreSolverToAssumptionLevel</a></div><div class="ttdeci">bool RestoreSolverToAssumptionLevel()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00512">sat_solver.cc:512</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_search_helper_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_search_helper.html">operations_research::sat::IntegerSearchHelper</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00237">integer_search.h:237</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a304417ca7c3964cc928b771620b2dc53"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a304417ca7c3964cc928b771620b2dc53">operations_research::sat::AtMinValue</a></div><div class="ttdeci">IntegerLiteral AtMinValue(IntegerVariable var, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00038">integer_search.cc:38</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html">operations_research::sat::SatSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00058">sat_solver.h:58</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_prober_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_prober.html">operations_research::sat::Prober</a></div><div class="ttdef"><b>Definition:</b> <a href="probing_8h_source.html#l00029">probing.h:29</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a607d97ccada862073f297bc2d495124d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d">operations_research::sat::SatSolver::FinishPropagation</a></div><div class="ttdeci">bool FinishPropagation()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00522">sat_solver.cc:522</a></div></div>
|
|
<div class="ttc" id="sat__parameters_8pb_8h_html"><div class="ttname"><a href="sat__parameters_8pb_8h.html">sat_parameters.pb.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a8ef12397d1682615bc3108c397734179"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a8ef12397d1682615bc3108c397734179">operations_research::sat::IntegerTrail::Index</a></div><div class="ttdeci">int Index() const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00944">integer.h:944</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aae43e784db06c0974ce59ebbe8dd2b22"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">operations_research::sat::NegationOf</a></div><div class="ttdeci">std::vector< IntegerVariable > NegationOf(const std::vector< IntegerVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00030">integer.cc:30</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a9789bf03dba611e9be5679d6e902d0c8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">operations_research::sat::SatSolver::Assignment</a></div><div class="ttdeci">const VariablesAssignment & Assignment() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00363">sat_solver.h:363</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_sat_parameters_html_ad443a9789397f553a38f9d27f85195c0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#ad443a9789397f553a38f9d27f85195c0">operations_research::sat::SatParameters::HINT_SEARCH</a></div><div class="ttdeci">static constexpr SearchBranching HINT_SEARCH</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00786">sat_parameters.pb.h:786</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_restart_policy_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_restart_policy.html">operations_research::sat::RestartPolicy</a></div><div class="ttdef"><b>Definition:</b> <a href="restart_8h_source.html#l00029">restart.h:29</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="namespacegtl_html_abc18f60961e36340e64e428827c0e38e"><div class="ttname"><a href="namespacegtl.html#abc18f60961e36340e64e428827c0e38e">gtl::FindWithDefault</a></div><div class="ttdeci">const Collection::value_type::second_type & FindWithDefault(const Collection &collection, const typename Collection::value_type::first_type &key, const typename Collection::value_type::second_type &value)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00029">map_util.h:29</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a8bea9a6a0de60c8fdab99ad7dfdf8498"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8bea9a6a0de60c8fdab99ad7dfdf8498">operations_research::sat::SolveIntegerProblem</a></div><div class="ttdeci">SatSolver::Status SolveIntegerProblem(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00900">integer_search.cc:900</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="classoperations__research_1_1sat_1_1_shared_solution_repository_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_solution_repository.html">operations_research::sat::SharedSolutionRepository< int64_t ></a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a17b20b0845d9e02829d417294aded36a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a">operations_research::sat::ResetAndSolveIntegerProblem</a></div><div class="ttdeci">SatSolver::Status ResetAndSolveIntegerProblem(const std::vector< Literal > &assumptions, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l01044">integer_search.cc:1044</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_time_limit_html_a810d5f7aaf80cc09cf5a094e20c1aaca"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">operations_research::TimeLimit::LimitReached</a></div><div class="ttdeci">bool LimitReached()</div><div class="ttdoc">Returns true when the external limit is true, or the deterministic time is over the deterministic lim...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00534">time_limit.h:534</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_pseudo_costs_html_aa64c6ffef5c1b7402acad774c70bab08"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pseudo_costs.html#aa64c6ffef5c1b7402acad774c70bab08">operations_research::sat::PseudoCosts::UpdateCost</a></div><div class="ttdeci">void UpdateCost(const std::vector< VariableBoundChange > &bound_changes, IntegerValue obj_bound_improvement)</div><div class="ttdef"><b>Definition:</b> <a href="pseudo__costs_8cc_source.html#l00044">pseudo_costs.cc:44</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00890">base/logging.h:890</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a309d057e12c8d4d393f13975eea2e2a9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a309d057e12c8d4d393f13975eea2e2a9">operations_research::sat::IntegerTrail::IsCurrentlyIgnored</a></div><div class="ttdeci">bool IsCurrentlyIgnored(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00698">integer.h:698</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a9da38c8d2910442d551db5e360423029"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029">operations_research::sat::SatSolver::ResetToLevelZero</a></div><div class="ttdeci">bool ResetToLevelZero()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00530">sat_solver.cc:530</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_search_heuristics_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_search_heuristics.html">operations_research::sat::SearchHeuristics</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00062">integer_search.h:62</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a4395e95bab44e222cb2e77251017a0e2"><div class="ttname"><a href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a></div><div class="ttdeci">#define DCHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00892">base/logging.h:892</a></div></div>
|
|
<div class="ttc" id="integer__search_8h_html"><div class="ttname"><a href="integer__search_8h.html">integer_search.h</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_boolean_or_integer_literal_html_aee356429e37f0750e38ee17ae1464a00"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#aee356429e37f0750e38ee17ae1464a00">operations_research::sat::BooleanOrIntegerLiteral::integer_literal</a></div><div class="ttdeci">IntegerLiteral integer_literal</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00054">integer_search.h:54</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a8b6d5a25e6ad3d28a85b1924471e2cac"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">operations_research::sat::IntegerTrail::UpperBound</a></div><div class="ttdeci">IntegerValue UpperBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01439">integer.h:1439</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_ad63c4461a1384629cb99413c6df8b9ca"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">operations_research::sat::SatSolver::CurrentDecisionLevel</a></div><div class="ttdeci">int CurrentDecisionLevel() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00361">sat_solver.h:361</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a46cb4c07c4971a99724693260c92fd5b"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a46cb4c07c4971a99724693260c92fd5b">operations_research::sat::SplitAroundGivenValue</a></div><div class="ttdeci">IntegerLiteral SplitAroundGivenValue(IntegerVariable var, IntegerValue value, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00069">integer_search.cc:69</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">operations_research::sat::SatSolver::INFEASIBLE</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00183">sat_solver.h:183</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_afc7419e2f33992c4a7b8b0decd1dc3e0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#afc7419e2f33992c4a7b8b0decd1dc3e0">operations_research::sat::SatParameters::FIXED_SEARCH</a></div><div class="ttdeci">static constexpr SearchBranching FIXED_SEARCH</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00776">sat_parameters.pb.h:776</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="rins_8h_html"><div class="ttname"><a href="rins_8h.html">rins.h</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_search_heuristics_html_aa1668e07fb6607c61474310ad1045657"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_search_heuristics.html#aa1668e07fb6607c61474310ad1045657">operations_research::sat::SearchHeuristics::next_decision_override</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> next_decision_override</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00080">integer_search.h:80</a></div></div>
|
|
<div class="ttc" id="cp__model__solver_8cc_html_a2a2278bd1fb787198e496b7d443a05e8"><div class="ttname"><a href="cp__model__solver_8cc.html#a2a2278bd1fb787198e496b7d443a05e8">relaxation_solutions</a></div><div class="ttdeci">SharedRelaxationSolutionRepository * relaxation_solutions</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l01954">cp_model_solver.cc:1954</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="probing_8h_html"><div class="ttname"><a href="probing_8h.html">probing.h</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="namespaceoperations__research_1_1sat_html_a334bf93d91912354ff5d0f161a64c273"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a334bf93d91912354ff5d0f161a64c273">operations_research::sat::RecordLPRelaxationValues</a></div><div class="ttdeci">void RecordLPRelaxationValues(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="rins_8cc_source.html#l00026">rins.cc:26</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a88ab44e20ce09e9942f6b8411452df27"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a88ab44e20ce09e9942f6b8411452df27">operations_research::sat::IntegerValueSelectionHeuristic</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> IntegerValueSelectionHeuristic(std::function< BooleanOrIntegerLiteral()> var_selection_heuristic, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00258">integer_search.cc:258</a></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="classoperations__research_1_1sat_1_1_sat_solver_html_a4f7251fc4692363cf55796a6f3e267ea"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a4f7251fc4692363cf55796a6f3e267ea">operations_research::sat::SatSolver::NotifyThatModelIsUnsat</a></div><div class="ttdeci">void NotifyThatModelIsUnsat()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00402">sat_solver.h:402</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_ac7edc397b78de116072e89fe0ad89266"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#ac7edc397b78de116072e89fe0ad89266">operations_research::sat::LinearProgrammingConstraint::HasSolution</a></div><div class="ttdeci">bool HasSolution() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00158">linear_programming_constraint.h:158</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html_a6c233aafac25ea66d69de93a83c9be63"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">operations_research::sat::IntegerLiteral::GreaterOrEqual</a></div><div class="ttdeci">static IntegerLiteral GreaterOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01377">integer.h:1377</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aefab46ecc02eb059ed853ee0213be7fb"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aefab46ecc02eb059ed853ee0213be7fb">operations_research::sat::PseudoCost</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> PseudoCost(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00328">integer_search.cc:328</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_dispatcher_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_dispatcher.html">operations_research::sat::LinearProgrammingDispatcher</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00551">linear_programming_constraint.h:551</a></div></div>
|
|
<div class="ttc" id="cp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a></div><div class="ttdeci">SatParameters parameters</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00120">cp_model_fz_solver.cc:120</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a98bb3bb08c5a9f5c119cf0973bbe5cf8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a98bb3bb08c5a9f5c119cf0973bbe5cf8">operations_research::sat::GetBoundChanges</a></div><div class="ttdeci">std::vector< PseudoCosts::VariableBoundChange > GetBoundChanges(LiteralIndex decision, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="pseudo__costs_8cc_source.html#l00099">pseudo_costs.cc:99</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_trail_html_a9789bf03dba611e9be5679d6e902d0c8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">operations_research::sat::Trail::Assignment</a></div><div class="ttdeci">const VariablesAssignment & Assignment() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00382">sat_base.h:382</a></div></div>
|
|
<div class="ttc" id="expr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a05cc8990d6a349e0c5960019ee47b687"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a05cc8990d6a349e0c5960019ee47b687">operations_research::sat::IntegerTrail::FirstUnassignedVariable</a></div><div class="ttdeci">IntegerVariable FirstUnassignedVariable() const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01244">integer.cc:1244</a></div></div>
|
|
<div class="ttc" id="synchronization_8h_html"><div class="ttname"><a href="synchronization_8h.html">synchronization.h</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_search_heuristics_html_af2155539e87804108c670c32478e123d"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_search_heuristics.html#af2155539e87804108c670c32478e123d">operations_research::sat::SearchHeuristics::policy_index</a></div><div class="ttdeci">int policy_index</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00070">integer_search.h:70</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ac0774a1df651b83339b00fee0bde1cd8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ac0774a1df651b83339b00fee0bde1cd8">operations_research::sat::SplitAroundLpValue</a></div><div class="ttdeci">IntegerLiteral SplitAroundLpValue(IntegerVariable var, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00097">integer_search.cc:97</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_boolean_or_integer_literal_html_ae26b73bbf70dc88433be39df364ca7c1"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#ae26b73bbf70dc88433be39df364ca7c1">operations_research::sat::BooleanOrIntegerLiteral::HasValue</a></div><div class="ttdeci">bool HasValue() const</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00048">integer_search.h:48</a></div></div>
|
|
<div class="ttc" id="cp__model__mapping_8h_html"><div class="ttname"><a href="cp__model__mapping_8h.html">cp_model_mapping.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_search_helper_html_aaad5f63041d2eb2fee1a5b6d1cac8424"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_search_helper.html#aaad5f63041d2eb2fee1a5b6d1cac8424">operations_research::sat::IntegerSearchHelper::TakeDecision</a></div><div class="ttdeci">bool TakeDecision(Literal decision)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00864">integer_search.cc:864</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a744ac200820f62ff97a4da72223cbb54"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a744ac200820f62ff97a4da72223cbb54">operations_research::sat::RandomizeOnRestartHeuristic</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> RandomizeOnRestartHeuristic(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00463">integer_search.cc:463</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a4713f8fb7e1ccddece18a374886ad866"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a4713f8fb7e1ccddece18a374886ad866">operations_research::sat::UnassignedVarWithLowestMinAtItsMinHeuristic</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> UnassignedVarWithLowestMinAtItsMinHeuristic(const std::vector< IntegerVariable > &vars, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00167">integer_search.cc:167</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_ae535d7515d701373438ee5c103cd3031"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#ae535d7515d701373438ee5c103cd3031">operations_research::sat::SatParameters::randomize_search</a></div><div class="ttdeci">bool randomize_search() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l07827">sat_parameters.pb.h:7827</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_inprocessing_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_inprocessing.html">operations_research::sat::Inprocessing</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__inprocessing_8h_source.html#l00089">sat_inprocessing.h:89</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html">operations_research::sat::SatParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00347">sat_parameters.pb.h:347</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_intervals_repository_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_intervals_repository.html">operations_research::sat::IntervalsRepository</a></div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00047">intervals.h:47</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_shared_solution_repository_html_a6d2b6f7951b60c786fdbefcbe7c3571f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_solution_repository.html#a6d2b6f7951b60c786fdbefcbe7c3571f">operations_research::sat::SharedSolutionRepository::NumSolutions</a></div><div class="ttdeci">int NumSolutions() const</div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8h_source.html#l00470">synchronization.h:470</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a0b08971dbb223f77e7fc9c41a77fdc7b"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0b08971dbb223f77e7fc9c41a77fdc7b">operations_research::sat::FirstUnassignedVarAtItsMinHeuristic</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> FirstUnassignedVarAtItsMinHeuristic(const std::vector< IntegerVariable > &vars, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00152">integer_search.cc:152</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">operations_research::sat::SatSolver::Status</a></div><div class="ttdeci">Status</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00181">sat_solver.h:181</a></div></div>
|
|
<div class="ttc" id="demon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aeaaccdd218e3f0aa5c218d3a0cc5c3f1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aeaaccdd218e3f0aa5c218d3a0cc5c3f1">operations_research::sat::LinearizedPartIsLarge</a></div><div class="ttdeci">bool LinearizedPartIsLarge(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00245">integer_search.cc:245</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_implied_bounds_html_a0e2d0bf17ef8f8ea329a2faec4583377"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html#a0e2d0bf17ef8f8ea329a2faec4583377">operations_research::sat::ImpliedBounds::EnqueueNewDeductions</a></div><div class="ttdeci">bool EnqueueNewDeductions()</div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8cc_source.html#l00229">implied_bounds.cc:229</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_search_heuristics_html_a0d0b8f29f3557e2ee84f53b45d817e02"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_search_heuristics.html#a0d0b8f29f3557e2ee84f53b45d817e02">operations_research::sat::SearchHeuristics::restart_policies</a></div><div class="ttdeci">std::vector< std::function< bool()> > restart_policies</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00067">integer_search.h:67</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ab25e01a2942b821d66371fc68d53f2eb"><div class="ttname"><a href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a></div><div class="ttdeci">#define CHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00703">base/logging.h:703</a></div></div>
|
|
<div class="ttc" id="demon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695"><div class="ttname"><a href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a></div><div class="ttdeci">const Constraint * ct</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_abcf8d0c663710a1e395489e62de487b1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#abcf8d0c663710a1e395489e62de487b1">operations_research::sat::SequentialSearch</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> SequentialSearch(std::vector< std::function< BooleanOrIntegerLiteral()>> heuristics)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00187">integer_search.cc:187</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_search_helper_html_ab47c89fedb27c73cf9ab768b913d1dfe"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_search_helper.html#ab47c89fedb27c73cf9ab768b913d1dfe">operations_research::sat::IntegerSearchHelper::GetDecision</a></div><div class="ttdeci">LiteralIndex GetDecision(const std::function< BooleanOrIntegerLiteral()> &f)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00813">integer_search.cc:813</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a460fe5216ff7f997841e588d432be744"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a460fe5216ff7f997841e588d432be744">operations_research::sat::LinearProgrammingConstraint::GetSolutionValue</a></div><div class="ttdeci">double GetSolutionValue(IntegerVariable variable) const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00615">linear_programming_constraint.cc:615</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_a9cc386e96ee7dac2309e95bc03f438ef"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a9cc386e96ee7dac2309e95bc03f438ef">operations_research::sat::SatParameters::exploit_integer_lp_solution</a></div><div class="ttdeci">bool exploit_integer_lp_solution() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l06902">sat_parameters.pb.h:6902</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1glop_html_ac89c7b45754e9a6bdabc08bea586fc4e"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#ac89c7b45754e9a6bdabc08bea586fc4e">operations_research::glop::Index</a></div><div class="ttdeci">int32_t Index</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00038">lp_types.h:38</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="integer__search_8cc.html">integer_search.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>
|