167 lines
89 KiB
HTML
167 lines
89 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: lb_tree_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.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('lb__tree__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">lb_tree_search.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="lb__tree__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="lb__tree__search_8h.html">ortools/sat/lb_tree_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 <cstdint></span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div><div class="line"><a name="l00018"></a><span class="lineno"> 18</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="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="keyword">namespace </span>sat {</div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div><div class="line"><a name="l00023"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_lb_tree_search.html#a85d4342cd27dc4032928d0e6986a0110"> 23</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_lb_tree_search.html#a85d4342cd27dc4032928d0e6986a0110">LbTreeSearch::LbTreeSearch</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="l00024"></a><span class="lineno"> 24</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="l00025"></a><span class="lineno"> 25</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="l00026"></a><span class="lineno"> 26</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="l00027"></a><span class="lineno"> 27</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="l00028"></a><span class="lineno"> 28</span>  shared_response_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_shared_response_manager.html">SharedResponseManager</a>>()),</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</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="l00030"></a><span class="lineno"> 30</span>  search_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="l00031"></a><span class="lineno"> 31</span>  <span class="comment">// We should create this class only in the presence of an objective.</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="comment">//</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="comment">// TODO(user): Starts with an initial variable score for all variable in</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="comment">// the objective at their minimum value? this should emulate the first step of</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="comment">// the core approach and gives a similar bound.</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</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="l00037"></a><span class="lineno"> 37</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(objective != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</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="l00039"></a><span class="lineno"> 39</span> </div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="comment">// We use the normal SAT search but we will bump the variable activity</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">// slightly differently. In addition to the conflicts, we also bump it each</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="comment">// time the objective lower bound increase in a sub-node.</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  search_heuristic_ =</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <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="l00045"></a><span class="lineno"> 45</span>  <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>>()->fixed_search});</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> }</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> </div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="keywordtype">bool</span> LbTreeSearch::NodeImprovesLowerBound(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_node.html">Node</a>& node) {</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">return</span> node.objective_lb ></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(objective_var_);</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> }</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> </div><div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_lb_tree_search.html#ad7093536412144723604fcfe56ffeb3c"> 53</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code" href="classoperations__research_1_1sat_1_1_lb_tree_search.html#ad7093536412144723604fcfe56ffeb3c">LbTreeSearch::Search</a>(</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">const</span> std::function<<span class="keywordtype">void</span>()>& feasible_solution_observer) {</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</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="l00056"></a><span class="lineno"> 56</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="l00057"></a><span class="lineno"> 57</span>  }</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="comment">// We currently restart the search tree from scratch a few time. This is to</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// allow our "pseudo-cost" to kick in and experimentally result in smaller</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// trees down the road.</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">//</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="comment">// TODO(user): a strong branching initial start, or allowing a few decision</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">// per nodes might be a better approach.</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">//</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="comment">// TODO(user): It would also be cool to exploit the reason for the LB increase</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="comment">// even more.</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  int64_t restart = 100;</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  int64_t num_restart = 1;</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> kNumRestart = 10;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> </div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">while</span> (!time_limit_-><a class="code" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>() && !shared_response_-><a class="code" href="classoperations__research_1_1sat_1_1_shared_response_manager.html#a04fec1c4d1006a272706e2f483a48f3c">ProblemIsSolved</a>()) {</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// Each time we are back here, we bump the activities of the variable that</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// are part of the objective lower bound reason.</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">//</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// TODO(user): This is slightly different than bumping each time we</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// push a decision that result in an LB increase, I am not sure why.</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">if</span> (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="l00079"></a><span class="lineno"> 79</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(objective_var_)) {</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  std::vector<Literal> reason =</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a430eb799926e49f2339d7f52c01d038b">ReasonFor</a>(<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  objective_var_, 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="l00083"></a><span class="lineno"> 83</span>  sat_decision_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#aab615de1a3b2016b0a8b8cdf05e9cf0b">BumpVariableActivities</a>(reason);</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  sat_decision_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a8bc0829ef9f6099106cab480e71ab847">UpdateVariableActivityIncrement</a>();</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> </div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// Optimization. Record what level is needed for this reason and try to</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// reduce the search tree if this node decision could have been taken</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// earlier.</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> current_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="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">if</span> (current_branch_.size() == current_level) {</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// TODO(user): We should probably expand the reason.</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordtype">int</span> max_level = 0;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  Node& node = nodes_[current_branch_.back()];</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l : reason) {</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">if</span> (l.Variable() == node.literal.Variable()) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  max_level = std::max<int>(</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  max_level, sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a01fd4c9f5286534866c6c5ee2c160fe9">LiteralTrail</a>().<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(l.Variable()).level);</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  }</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</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#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(node.literal)) {</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  node.true_level = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(node.true_level, max_level);</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(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#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(node.literal));</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  node.false_level = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(node.false_level, max_level);</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  }</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> level = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(node.true_level, node.false_level);</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">if</span> (level < current_level - 1) {</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// We Skip a part of the tree and connect directly "ancestor" to</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// "node".</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">if</span> (level > 0) {</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  Node& ancestor = nodes_[current_branch_[level - 1]];</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</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#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(ancestor.literal)) {</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  ancestor.true_child = current_branch_.back();</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  ancestor.UpdateTrueObjective(node.objective_lb);</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(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#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(ancestor.literal));</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  ancestor.false_child = current_branch_.back();</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  ancestor.UpdateFalseObjective(node.objective_lb);</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  current_branch_.resize(level);</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keyword">const</span> Node copy = node;</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  nodes_ = {copy};</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  current_branch_ = {0};</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  }</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(level);</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">if</span> (!sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d">FinishPropagation</a>()) {</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</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="l00128"></a><span class="lineno"> 128</span>  }</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  }</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  }</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  }</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>  <span class="comment">// Forget the whole tree and restart?</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">if</span> (nodes_.size() > num_restart * restart && num_restart < kNumRestart) {</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  nodes_.clear();</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  current_branch_.clear();</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</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="l00138"></a><span class="lineno"> 138</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="l00139"></a><span class="lineno"> 139</span>  }</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  ++num_restart;</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="keywordflow">if</span> (!search_helper_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#a918e2c1a7965a933b914ceaceb847a0c">BeforeTakingDecision</a>()) {</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</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="l00145"></a><span class="lineno"> 145</span>  }</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> </div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// Backtrack if needed.</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="comment">//</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="comment">// Our algorithm stop exploring a branch as soon as its objective lower</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="comment">// bound is greater than the root lower bound. We then backtrack to the</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="comment">// first node in the branch that is not yet closed under this bound.</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="comment">//</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="comment">// TODO(user): If we remember how far we can backjump for both true/false</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// branch, we could be more efficient.</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">while</span> (current_branch_.size() > 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="l00156"></a><span class="lineno"> 156</span>  (current_branch_.size() > 1 &&</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  NodeImprovesLowerBound(nodes_[current_branch_.back()]))) {</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> child = current_branch_.back();</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  current_branch_.pop_back();</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> </div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="comment">// By construction, we never backtrack over the root node here.</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!current_branch_.empty());</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  Node& node = nodes_[current_branch_.back()];</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">if</span> (node.true_child == child) {</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  node.UpdateTrueObjective(nodes_[child].objective_lb);</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(node.false_child, child);</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  node.UpdateFalseObjective(nodes_[child].objective_lb);</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  }</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  }</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> </div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// Backtrack the solver.</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(0, static_cast<int>(current_branch_.size()) - 1));</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">if</span> (!sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d">FinishPropagation</a>()) {</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</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="l00177"></a><span class="lineno"> 177</span>  }</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">// If we are back to the root node, update the global objective LB.</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</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 && !current_branch_.empty()) {</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordflow">if</span> (NodeImprovesLowerBound(nodes_[current_branch_[0]])) {</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  shared_response_-><a class="code" href="classoperations__research_1_1sat_1_1_shared_response_manager.html#afcc9de6240a7eb2da97d08787d53df55">UpdateInnerObjectiveBounds</a>(</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  absl::StrCat(<span class="stringliteral">"lb_tree_search #nodes:"</span>, nodes_.size()),</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  nodes_[current_branch_[0]].objective_lb,</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  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="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  objective_var_, nodes_[current_branch_[0]].objective_lb),</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  {}, {})) {</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">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="l00191"></a><span class="lineno"> 191</span>  }</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">if</span> (!sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d">FinishPropagation</a>()) {</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</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="l00194"></a><span class="lineno"> 194</span>  }</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"> 198</span>  <span class="comment">// Follow the branch with lowest objective.</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">while</span> (current_branch_.size() == 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="l00200"></a><span class="lineno"> 200</span>  Node& node = nodes_[current_branch_.back()];</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  node.objective_lb = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(node.objective_lb,</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  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="l00203"></a><span class="lineno"> 203</span>  node.UpdateTrueObjective(node.objective_lb);</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  node.UpdateFalseObjective(node.objective_lb);</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">if</span> (NodeImprovesLowerBound(node)) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> </div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="comment">// This will be set to the next index.</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordtype">int</span> n;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> </div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="comment">// If the variable is already fixed, we bypass the node and connect</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="comment">// its parent directly to the relevant child.</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</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>(node.literal)) {</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  IntegerValue new_lb;</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</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#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(node.literal)) {</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  n = node.true_child;</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  new_lb = node.true_objective;</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  n = node.false_child;</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  new_lb = node.false_objective;</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  }</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> </div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="comment">// We jump directly to the subnode.</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  current_branch_.pop_back();</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> </div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="comment">// Else we will change the root.</span></div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordflow">if</span> (!current_branch_.empty()) {</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> parent = current_branch_.back();</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</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#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(nodes_[parent].<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) {</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  nodes_[parent].true_child = n;</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  nodes_[parent].UpdateTrueObjective(new_lb);</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(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#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  nodes_[parent].<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>));</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  nodes_[parent].false_child = n;</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  nodes_[parent].UpdateFalseObjective(new_lb);</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  }</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">if</span> (NodeImprovesLowerBound(nodes_[parent])) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  }</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// If both lower bound are the same, we pick a random sub-branch.</span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordtype">bool</span> choose_true = node.true_objective < node.false_objective;</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">if</span> (node.true_objective == node.false_objective) {</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  choose_true = absl::Bernoulli(*random_, 0.5);</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  }</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">if</span> (choose_true) {</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(node.true_objective,</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(objective_var_));</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  n = node.true_child;</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  search_helper_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#aaad5f63041d2eb2fee1a5b6d1cac8424">TakeDecision</a>(node.literal);</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(node.false_objective,</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(objective_var_));</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  n = node.false_child;</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  search_helper_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#aaad5f63041d2eb2fee1a5b6d1cac8424">TakeDecision</a>(node.literal.Negated());</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">// Conflict?</span></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">if</span> (current_branch_.size() != sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>()) {</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keywordflow">if</span> (choose_true) {</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  node.UpdateTrueObjective(<a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>);</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  node.UpdateFalseObjective(<a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>);</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  }</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  }</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordflow">if</span> (choose_true) {</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  node.UpdateTrueObjective(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="l00269"></a><span class="lineno"> 269</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  node.UpdateFalseObjective(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="l00271"></a><span class="lineno"> 271</span>  }</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordflow">if</span> (NodeImprovesLowerBound(node)) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordflow">if</span> (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="l00274"></a><span class="lineno"> 274</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(objective_var_)) {</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">break</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>  }</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> </div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">if</span> (n < nodes_.size()) {</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  current_branch_.push_back(n);</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  }</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  }</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> </div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="comment">// If conflict or the objective lower bound increased, we will backtrack.</span></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordflow">if</span> (current_branch_.size() != sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() ||</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  (!current_branch_.empty() &&</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  NodeImprovesLowerBound(nodes_[current_branch_.back()]))) {</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  }</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> </div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="comment">// This test allow to not take a decision when the branch is already closed</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="comment">// (i.e. the true branch or false branch lb is high enough). Adding it</span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="comment">// basically changes if we take the decision later when we explore the</span></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="comment">// branch or right now.</span></div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="comment">//</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="comment">// I feel taking it later is better. It also avoid creating uneeded nodes.</span></div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="comment">// It does change the behavior on a few problem though. For instance on</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="comment">// irp.mps.gz, the search works better without this, whatever the random</span></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="comment">// seed. Not sure why, maybe it creates more diversity?</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="comment">//</span></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="comment">// Another difference is that if the search is done and we have a feasible</span></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="comment">// solution, we will not report it because of this test (except if we are</span></div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="comment">// at the optimal).</span></div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">if</span> (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="l00307"></a><span class="lineno"> 307</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(objective_var_)) {</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordflow">continue</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="comment">// Increase the size of the tree by exploring a new decision.</span></div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keyword">const</span> LiteralIndex decision =</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  search_helper_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#ab47c89fedb27c73cf9ab768b913d1dfe">GetDecision</a>(search_heuristic_);</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> </div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="comment">// No new decision: search done.</span></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">if</span> (time_limit_-><a class="code" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">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="l00317"></a><span class="lineno"> 317</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="l00318"></a><span class="lineno"> 318</span>  feasible_solution_observer();</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  }</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> </div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="comment">// Create a new node.</span></div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="comment">// Note that the decision will be pushed to the solver on the next loop.</span></div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> n = nodes_.size();</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  nodes_.emplace_back(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(decision),</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  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="l00327"></a><span class="lineno"> 327</span>  <span class="keywordflow">if</span> (!current_branch_.empty()) {</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> parent = current_branch_.back();</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</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#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(nodes_[parent].<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) {</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  nodes_[parent].true_child = n;</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  nodes_[parent].UpdateTrueObjective(nodes_.back().objective_lb);</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(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#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(nodes_[parent].<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>));</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  nodes_[parent].false_child = n;</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  nodes_[parent].UpdateFalseObjective(nodes_.back().objective_lb);</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  }</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  }</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  current_branch_.push_back(n);</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  }</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> </div><div class="line"><a name="l00341"></a><span class="lineno"> 341</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="l00342"></a><span class="lineno"> 342</span> }</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span> </div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> } <span class="comment">// namespace sat</span></div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="base_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00491">base/logging.h:491</a></div></div>
|
|
<div class="ttc" id="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#l00105">time_limit.h:105</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="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="lb__tree__search_8h_html"><div class="ttname"><a href="lb__tree__search_8h.html">lb_tree_search.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_decision_policy_html_a8bc0829ef9f6099106cab480e71ab847"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a8bc0829ef9f6099106cab480e71ab847">operations_research::sat::SatDecisionPolicy::UpdateVariableActivityIncrement</a></div><div class="ttdeci">void UpdateVariableActivityIncrement()</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00334">sat_decision.cc:334</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_ab857cd2aead68952d9fe92a8ad8d3ac9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">operations_research::sat::IntegerTrail::LowerBound</a></div><div class="ttdeci">IntegerValue LowerBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01345">integer.h:1345</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_variables_assignment_html_acfd1646011e643f58fd7dc66d9cc90a5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">operations_research::sat::VariablesAssignment::LiteralIsFalse</a></div><div class="ttdeci">bool LiteralIsFalse(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00148">sat_base.h:148</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_variables_assignment_html_a5300129913f51dcb0b1c531e3248490e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">operations_research::sat::VariablesAssignment::LiteralIsTrue</a></div><div class="ttdeci">bool LiteralIsTrue(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00151">sat_base.h:151</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="gurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00273">gurobi_interface.cc:273</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00065">sat_base.h:65</a></div></div>
|
|
<div class="ttc" id="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_lb_tree_search_html_a85d4342cd27dc4032928d0e6986a0110"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_lb_tree_search.html#a85d4342cd27dc4032928d0e6986a0110">operations_research::sat::LbTreeSearch::LbTreeSearch</a></div><div class="ttdeci">LbTreeSearch(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="lb__tree__search_8cc_source.html#l00023">lb_tree_search.cc:23</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="classoperations__research_1_1sat_1_1_integer_trail_html_a430eb799926e49f2339d7f52c01d038b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a430eb799926e49f2339d7f52c01d038b">operations_research::sat::IntegerTrail::ReasonFor</a></div><div class="ttdeci">std::vector< Literal > ReasonFor(IntegerLiteral literal) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01617">integer.cc:1617</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a05e837bb93eeabbbd94e8f690dd59d32"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">operations_research::sat::IntegerTrail::Enqueue</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool Enqueue(IntegerLiteral i_lit, absl::Span< const Literal > literal_reason, absl::Span< const IntegerLiteral > integer_reason)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01028">integer.cc:1028</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_shared_response_manager_html_afcc9de6240a7eb2da97d08787d53df55"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_response_manager.html#afcc9de6240a7eb2da97d08787d53df55">operations_research::sat::SharedResponseManager::UpdateInnerObjectiveBounds</a></div><div class="ttdeci">void UpdateInnerObjectiveBounds(const std::string &update_info, IntegerValue lb, IntegerValue ub)</div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8cc_source.html#l00226">synchronization.cc:226</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="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="classoperations__research_1_1sat_1_1_shared_response_manager_html_a04fec1c4d1006a272706e2f483a48f3c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_response_manager.html#a04fec1c4d1006a272706e2f483a48f3c">operations_research::sat::SharedResponseManager::ProblemIsSolved</a></div><div class="ttdeci">bool ProblemIsSolved() const</div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8cc_source.html#l00608">synchronization.cc:608</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html">operations_research::sat::IntegerTrail</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00574">integer.h:574</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_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_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#l00041">sat/util.h:41</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#l00154">sat_base.h:154</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_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_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="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#l00698">base/logging.h:698</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="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_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="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="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#l00533">time_limit.h:533</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#l00886">base/logging.h:886</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_decision_policy_html_aab615de1a3b2016b0a8b8cdf05e9cf0b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#aab615de1a3b2016b0a8b8cdf05e9cf0b">operations_research::sat::SatDecisionPolicy::BumpVariableActivities</a></div><div class="ttdeci">void BumpVariableActivities(const std::vector< Literal > &literals)</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00289">sat_decision.cc:289</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_lb_tree_search_html_ad7093536412144723604fcfe56ffeb3c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_lb_tree_search.html#ad7093536412144723604fcfe56ffeb3c">operations_research::sat::LbTreeSearch::Search</a></div><div class="ttdeci">SatSolver::Status Search(const std::function< void()> &feasible_solution_observer)</div><div class="ttdef"><b>Definition:</b> <a href="lb__tree__search_8cc_source.html#l00053">lb_tree_search.cc:53</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="classoperations__research_1_1sat_1_1_integer_trail_html_a8b6d5a25e6ad3d28a85b1924471e2cac"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">operations_research::sat::IntegerTrail::UpperBound</a></div><div class="ttdeci">IntegerValue UpperBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01349">integer.h:1349</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_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="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="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="structoperations__research_1_1sat_1_1_integer_literal_html_a6c233aafac25ea66d69de93a83c9be63"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">operations_research::sat::IntegerLiteral::GreaterOrEqual</a></div><div class="ttdeci">static IntegerLiteral GreaterOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01309">integer.h:1309</a></div></div>
|
|
<div class="ttc" id="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_sat_solver_html_a01fd4c9f5286534866c6c5ee2c160fe9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a01fd4c9f5286534866c6c5ee2c160fe9">operations_research::sat::SatSolver::LiteralTrail</a></div><div class="ttdeci">const Trail & LiteralTrail() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00362">sat_solver.h:362</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="classoperations__research_1_1_node_html"><div class="ttname"><a href="classoperations__research_1_1_node.html">operations_research::Node</a></div><div class="ttdef"><b>Definition:</b> <a href="flow__problem_8pb_8h_source.html#l00297">flow_problem.pb.h:297</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_aa68cc40c827bff2fb311040e2b848f9b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">operations_research::sat::IntegerTrail::LevelZeroLowerBound</a></div><div class="ttdeci">IntegerValue LevelZeroLowerBound(IntegerVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01407">integer.h:1407</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="optimization_8cc_html_af63dcc00f2023fdf498e0829e6fb8a6b"><div class="ttname"><a href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a></div><div class="ttdeci">Literal literal</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00085">optimization.cc:85</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_trail_html_a29be1a6b9ba823a6fffb927609d18599"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">operations_research::sat::Trail::Info</a></div><div class="ttdeci">const AssignmentInfo & Info(BooleanVariable var) 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="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><!-- 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="lb__tree__search_8cc.html">lb_tree_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>
|