757 lines
140 KiB
HTML
757 lines
140 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.3"/>
|
|
<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>
|
|
<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.3</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.3 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('lb__tree__search_8cc_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">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 id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include "<a class="code" href="lb__tree__search_8h.html">ortools/sat/lb_tree_search.h</a>"</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span> </div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <functional></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span> </div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include "absl/random/distributions.h"</span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include "absl/strings/str_cat.h"</span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include "absl/time/clock.h"</span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include "absl/time/time.h"</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include "<a class="code" href="strong__vector_8h.html">ortools/base/strong_vector.h</a>"</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</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 id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>"</span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="preprocessor">#include "<a class="code" href="integer__expr_8h.html">ortools/sat/integer_expr.h</a>"</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</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 id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="preprocessor">#include "<a class="code" href="linear__programming__constraint_8h.html">ortools/sat/linear_programming_constraint.h</a>"</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="preprocessor">#include "<a class="code" href="sat_2model_8h.html">ortools/sat/model.h</a>"</span></div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="preprocessor">#include "<a class="code" href="sat__base_8h.html">ortools/sat/sat_base.h</a>"</span></div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</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 id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="preprocessor">#include "ortools/sat/sat_parameters.pb.h"</span></div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="preprocessor">#include "<a class="code" href="sat__solver_8h.html">ortools/sat/sat_solver.h</a>"</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="preprocessor">#include "<a class="code" href="synchronization_8h.html">ortools/sat/synchronization.h</a>"</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="preprocessor">#include "<a class="code" href="sat_2util_8h.html">ortools/sat/util.h</a>"</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="preprocessor">#include "<a class="code" href="strong__integers_8h.html">ortools/util/strong_integers.h</a>"</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="preprocessor">#include "<a class="code" href="time__limit_8h.html">ortools/util/time_limit.h</a>"</span></div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> </div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> </div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_lb_tree_search.html#a85d4342cd27dc4032928d0e6986a0110"> 48</a></span><a class="code hl_function" href="classoperations__research_1_1sat_1_1_lb_tree_search.html#a85d4342cd27dc4032928d0e6986a0110">LbTreeSearch::LbTreeSearch</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> : time_limit_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>>()),</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> random_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model_random_generator.html">ModelRandomGenerator</a>>()),</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> sat_solver_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>()),</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> integer_encoder_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>()),</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> integer_trail_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>()),</div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> shared_response_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_shared_response_manager.html">SharedResponseManager</a>>()),</div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> sat_decision_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html">SatDecisionPolicy</a>>()),</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> search_helper_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_search_helper.html">IntegerSearchHelper</a>>()),</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> parameters_(*<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<SatParameters>()) {</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// We should create this class only in the presence of an objective.</span></div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="comment">// TODO(user): Starts with an initial variable score for all variable in</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// the objective at their minimum value? this should emulate the first step of</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// the core approach and gives a similar bound.</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_objective_definition.html">ObjectiveDefinition</a>* objective = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_objective_definition.html">ObjectiveDefinition</a>>();</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(objective != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> objective_var_ = objective-><a class="code hl_variable" href="structoperations__research_1_1sat_1_1_objective_definition.html#aa3c0b31567c91babfffd5f9afc3161dc">objective_var</a>;</div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> </div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="comment">// Identify an LP with the same objective variable.</span></div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// TODO(user): if we have many independent LP, this will find nothing.</span></div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keywordflow">for</span> (<a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html">LinearProgrammingConstraint</a>* lp :</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> *<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_programming_constraint_collection.html">LinearProgrammingConstraintCollection</a>>()) {</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keywordflow">if</span> (lp->ObjectiveVariable() == objective_var_) {</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> lp_constraint_ = lp;</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> }</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> }</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> </div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// We use the normal SAT search but we will bump the variable activity</span></div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="comment">// slightly differently. In addition to the conflicts, we also bump it each</span></div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="comment">// time the objective lower bound increase in a sub-node.</span></div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> search_heuristic_ =</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a2acd1aef8e418e20032fd893668c04a6">SequentialSearch</a>({<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a8f18cefafff72d70f6e96ed3f2ef84aa">SatSolverHeuristic</a>(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>),</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_search_heuristics.html">SearchHeuristics</a>>()->fixed_search});</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> </div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> last_logging_time_ = absl::Now();</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span>}</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> </div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span><span class="keywordtype">void</span> LbTreeSearch::UpdateParentObjective(<span class="keywordtype">int</span> level) {</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(level, 0);</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(level, current_branch_.size());</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="keywordflow">if</span> (level == 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> parent_index = current_branch_[level - 1];</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> Node& parent = nodes_[parent_index];</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> child_index = current_branch_[level];</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keyword">const</span> Node& child = nodes_[child_index];</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="keywordflow">if</span> (parent.true_child == child_index) {</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> parent.UpdateTrueObjective(child.MinObjective());</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(parent.false_child, child_index);</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> parent.UpdateFalseObjective(child.MinObjective());</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> }</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span>}</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> </div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span><span class="keywordtype">void</span> LbTreeSearch::UpdateObjectiveFromParent(<span class="keywordtype">int</span> level) {</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(level, 0);</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(level, current_branch_.size());</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="keywordflow">if</span> (level == 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> parent_index = current_branch_[level - 1];</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keyword">const</span> Node& parent = nodes_[parent_index];</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(parent.MinObjective(), current_objective_lb_);</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> child_index = current_branch_[level];</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> Node& child = nodes_[child_index];</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="keywordflow">if</span> (parent.true_child == child_index) {</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> child.UpdateObjective(parent.true_objective);</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(parent.false_child, child_index);</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> child.UpdateObjective(parent.false_objective);</div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> }</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span>}</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> </div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span><span class="keywordtype">void</span> LbTreeSearch::DebugDisplayTree(<a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> root)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="keywordtype">int</span> num_nodes = 0;</div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keyword">const</span> IntegerValue root_lb = nodes_[root].MinObjective();</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="keyword">const</span> <span class="keyword">auto</span> shifted_lb = [root_lb](IntegerValue lb) {</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordflow">return</span> std::max<int64_t>(0, (lb - root_lb).<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>());</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> };</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> </div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<NodeIndex, int></a> level(nodes_.<a class="code hl_function" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>(), 0);</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> std::vector<NodeIndex> to_explore = {root};</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="keywordflow">while</span> (!to_explore.empty()) {</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n = to_explore.back();</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> to_explore.pop_back();</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> </div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> ++num_nodes;</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="keyword">const</span> Node& node = nodes_[n];</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> </div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> std::string s(level[n], <span class="charliteral">' '</span>);</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> absl::StrAppend(&s, <span class="stringliteral">"#"</span>, n.value());</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> </div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="keywordflow">if</span> (node.true_child < nodes_.<a class="code hl_function" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) {</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> absl::StrAppend(&s, <span class="stringliteral">" [t:#"</span>, node.true_child.value(), <span class="stringliteral">" "</span>,</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> shifted_lb(node.true_objective), <span class="stringliteral">"]"</span>);</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> to_explore.push_back(node.true_child);</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> level[node.true_child] = level[n] + 1;</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> absl::StrAppend(&s, <span class="stringliteral">" [t:## "</span>, shifted_lb(node.true_objective), <span class="stringliteral">"]"</span>);</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> }</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="keywordflow">if</span> (node.false_child < nodes_.<a class="code hl_function" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) {</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> absl::StrAppend(&s, <span class="stringliteral">" [f:#"</span>, node.false_child.value(), <span class="stringliteral">" "</span>,</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> shifted_lb(node.false_objective), <span class="stringliteral">"]"</span>);</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> to_explore.push_back(node.false_child);</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> level[node.false_child] = level[n] + 1;</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> absl::StrAppend(&s, <span class="stringliteral">" [f:## "</span>, shifted_lb(node.false_objective), <span class="stringliteral">"]"</span>);</div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> }</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code hl_variable" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << s;</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> }</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code hl_variable" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"num_nodes: "</span> << num_nodes;</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span>}</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> </div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_lb_tree_search.html#ad7093536412144723604fcfe56ffeb3c"> 160</a></span><a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_lb_tree_search.html#ad7093536412144723604fcfe56ffeb3c">LbTreeSearch::Search</a>(</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="keyword">const</span> std::function<<span class="keywordtype">void</span>()>& feasible_solution_observer) {</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="keywordflow">if</span> (!sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac714aeb75f0f6dd87e52e5d1a0d6edc7">RestoreSolverToAssumptionLevel</a>()) {</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="keywordflow">return</span> sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5bbe13ebae8aa11a8a4ac1cb01bc66ad">UnsatStatus</a>();</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> }</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> </div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="comment">// We currently restart the search tree from scratch from time to times:</span></div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="comment">// - At most every kNumBranchesBeforePeriodicRestarts branches explored for</span></div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <span class="comment">// at most kMaxNumInitialRestarts times.</span></div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="comment">// - Every time we backtrack to level zero, we count how many nodes are</span></div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <span class="comment">// worse than the best known objective lower bound. If this is true for more</span></div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="comment">// than half of the existing nodes, we restart and clear all nodes.</span></div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="comment">// If if this happens during the initial restarts phase, it reset the above</span></div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="comment">// counter and uses 1 of the available initial restarts.</span></div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="comment">// This has 2 advantages:</span></div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="comment">// - It allows our "pseudo-cost" to kick in and experimentally result in</span></div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="comment">// smaller trees down the road.</span></div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="comment">// - It removes large inefficient search trees.</span></div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="comment">// TODO(user): a strong branching initial start, or allowing a few decision</span></div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="comment">// per nodes might be a better approach.</span></div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</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 id="l00184" name="l00184"></a><span class="lineno"> 184</span> <span class="comment">// even more.</span></div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="keyword">const</span> int64_t kNumBranchesBeforePeriodicRestarts = 1000;</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> int64_t num_restarts = 0;</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="keyword">const</span> <span class="keywordtype">int</span> kMaxNumInitialRestarts = 10;</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> </div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="keywordflow">while</span> (!time_limit_-><a class="code hl_function" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>() && !shared_response_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_shared_response_manager.html#a04fec1c4d1006a272706e2f483a48f3c">ProblemIsSolved</a>()) {</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="comment">// This is the current bound we try to improve. We cache it here to avoid</span></div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="comment">// getting the lock many times and it is also easier to follow the code if</span></div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <span class="comment">// this is assumed constant for one iteration.</span></div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> current_objective_lb_ = shared_response_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_shared_response_manager.html#ae431b0e8c0f74f95c31ba38f3c534126">GetInnerObjectiveLowerBound</a>();</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> </div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="comment">// Propagate upward in the tree the new objective lb.</span></div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="keywordflow">if</span> (!current_branch_.empty()) {</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <span class="comment">// Our branch is always greater or equal to the level.</span></div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <span class="comment">// We increase the objective_lb of the current node if needed.</span></div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> {</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="keyword">const</span> <span class="keywordtype">int</span> current_level = sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>();</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(current_branch_.size(), current_level);</div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < current_level; ++i) {</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b">Assignment</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a142694366986039454f53b38e8378815">LiteralIsAssigned</a>(</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> nodes_[current_branch_[i]].literal));</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> }</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="keywordflow">if</span> (current_level < current_branch_.size()) {</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> nodes_[current_branch_[current_level]].UpdateObjective(</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(objective_var_));</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> }</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> </div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> <span class="comment">// Minor optim: sometimes, because of the LP and cuts, the reason for</span></div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <span class="comment">// objective_var_ only contains lower level literals, so we can exploit</span></div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <span class="comment">// that.</span></div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="comment">// TODO(user): No point checking that if the objective lb wasn't</span></div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="comment">// assigned at this level.</span></div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <span class="comment">// TODO(user): Exploit the reasons further.</span></div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <span class="keywordflow">if</span> (integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(objective_var_) ></div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(objective_var_)) {</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <span class="keyword">const</span> std::vector<Literal> reason =</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a430eb799926e49f2339d7f52c01d038b">ReasonFor</a>(<a class="code hl_function" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> objective_var_, integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(objective_var_)));</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <span class="keywordtype">int</span> max_level = 0;</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l : reason) {</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> max_level = std::max<int>(</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> max_level,</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5b06f24fb581de78b321dfd793931439">LiteralTrail</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_trail.html#aba78b12088909fb59dbdd0cb064412ae">Info</a>(l.Variable()).<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_assignment_info.html#a6a330c3b2adf87bfa27e9a9450d8bc40">level</a>);</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> }</div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="keywordflow">if</span> (max_level < current_level) {</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> nodes_[current_branch_[max_level]].UpdateObjective(</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(objective_var_));</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> }</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> }</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> }</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> </div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <span class="comment">// Propagate upward and then forward any new bounds.</span></div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> level = current_branch_.size(); --level > 0;) {</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> UpdateParentObjective(level);</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> }</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> nodes_[current_branch_[0]].UpdateObjective(current_objective_lb_);</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> level = 1; level < current_branch_.size(); ++level) {</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> UpdateObjectiveFromParent(level);</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> }</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> </div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> <span class="comment">// If the root lb increased, update global shared objective lb.</span></div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a> = nodes_[current_branch_[0]].MinObjective();</div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a> > current_objective_lb_) {</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> shared_response_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_shared_response_manager.html#afcc9de6240a7eb2da97d08787d53df55">UpdateInnerObjectiveBounds</a>(</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> absl::StrCat(<span class="stringliteral">"lb_tree_search #nodes:"</span>, nodes_.<a class="code hl_function" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>(),</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="stringliteral">" #rc:"</span>, num_rc_detected_, <span class="stringliteral">" #imports:"</span>, num_imports_,</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> <span class="stringliteral">" #restarts:"</span>, num_restarts),</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <a class="code hl_variable" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a>, integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(objective_var_));</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> current_objective_lb_ = <a class="code hl_variable" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a>;</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <span class="keywordflow">if</span> (<a class="code hl_define" href="vlog__is__on_8h.html#a956152cad330225654d128f35c00efce">VLOG_IS_ON</a>(3)) DebugDisplayTree(current_branch_[0]);</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> }</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> }</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> </div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> <span class="comment">// Each time we are back here, we bump the activities of the variable that</span></div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="comment">// are part of the objective lower bound reason.</span></div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> <span class="comment">// Note that this is why we prefer not to increase the lower zero lower</span></div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> <span class="comment">// bound of objective_var_ with the tree root lower bound, so we can exploit</span></div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> <span class="comment">// more reasons.</span></div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> <span class="comment">// TODO(user): This is slightly different than bumping each time we</span></div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="comment">// push a decision that result in an LB increase. This is also called on</span></div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> <span class="comment">// backjump for instance.</span></div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <span class="keywordflow">if</span> (integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(objective_var_) ></div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(objective_var_)) {</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> std::vector<Literal> reason =</div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a430eb799926e49f2339d7f52c01d038b">ReasonFor</a>(<a class="code hl_function" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> objective_var_, integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(objective_var_)));</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> sat_decision_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#aab615de1a3b2016b0a8b8cdf05e9cf0b">BumpVariableActivities</a>(reason);</div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> sat_decision_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a8bc0829ef9f6099106cab480e71ab847">UpdateVariableActivityIncrement</a>();</div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> }</div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> </div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="comment">// Forget the whole tree and restart.</span></div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> <span class="comment">// We will do it periodically at the beginning of the search each time we</span></div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <span class="comment">// cross the k * kNumBranchesBeforeInitialRestarts branches explored.</span></div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> <span class="comment">// This will happen at most kMaxNumInitialRestarts times.</span></div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <span class="keywordflow">if</span> (num_decisions_taken_ >= num_decisions_taken_at_last_restart_ +</div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> kNumBranchesBeforePeriodicRestarts &&</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> num_restarts < kMaxNumInitialRestarts) {</div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> ++num_restarts;</div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> num_decisions_taken_at_last_restart_ = num_decisions_taken_;</div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"lb_tree_search initial_restart nodes: "</span> << nodes_.<a class="code hl_function" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()</div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> << <span class="stringliteral">", branches:"</span> << num_decisions_taken_</div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> << <span class="stringliteral">", restarts: "</span> << num_restarts;</div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> nodes_.<a class="code hl_function" href="classabsl_1_1_strong_vector.html#ac8bb3912a3ce86b15842e79d0b421204">clear</a>();</div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> current_branch_.clear();</div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="keywordflow">if</span> (!sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac714aeb75f0f6dd87e52e5d1a0d6edc7">RestoreSolverToAssumptionLevel</a>()) {</div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> <span class="keywordflow">return</span> sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5bbe13ebae8aa11a8a4ac1cb01bc66ad">UnsatStatus</a>();</div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> }</div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> }</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> </div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> <span class="comment">// Backtrack if needed.</span></div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="comment">// Our algorithm stop exploring a branch as soon as its objective lower</span></div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> <span class="comment">// bound is greater than the root lower bound. We then backtrack to the</span></div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> <span class="comment">// first node in the branch that is not yet closed under this bound.</span></div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> <span class="comment">// TODO(user): If we remember how far we can backjump for both true/false</span></div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> <span class="comment">// branch, we could be more efficient.</span></div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> <span class="keywordflow">while</span> (current_branch_.size() > sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() + 1 ||</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> (current_branch_.size() > 1 &&</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> nodes_[current_branch_.back()].MinObjective() ></div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> current_objective_lb_)) {</div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> current_branch_.pop_back();</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> }</div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> </div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> <span class="comment">// Backtrack the solver.</span></div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> {</div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> <span class="keywordtype">int</span> backtrack_level =</div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(0, <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(current_branch_.size()) - 1);</div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> </div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> <span class="comment">// Periodic restart.</span></div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> <span class="keywordflow">if</span> (num_decisions_taken_ >= num_decisions_taken_at_last_import_ + 10000) {</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> backtrack_level = 0;</div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> }</div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> </div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(backtrack_level);</div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> <span class="keywordflow">if</span> (!sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d">FinishPropagation</a>()) {</div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> <span class="keywordflow">return</span> sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5bbe13ebae8aa11a8a4ac1cb01bc66ad">UnsatStatus</a>();</div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> }</div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> }</div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> </div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> <span class="comment">// This will import other workers bound if we are back to level zero.</span></div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> <span class="keywordflow">if</span> (sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == 0) {</div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> ++num_imports_;</div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> num_decisions_taken_at_last_import_ = num_decisions_taken_;</div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> }</div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> <span class="keywordflow">if</span> (!search_helper_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#a918e2c1a7965a933b914ceaceb847a0c">BeforeTakingDecision</a>()) {</div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> <span class="keywordflow">return</span> sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5bbe13ebae8aa11a8a4ac1cb01bc66ad">UnsatStatus</a>();</div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> }</div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> </div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> <span class="comment">// If the search has not just been restarted (in which case nodes_ would be</span></div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> <span class="comment">// empty), and if we are at level zero (either naturally, or if the</span></div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> <span class="comment">// backtrack level was set to zero in the above code), let's run a different</span></div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> <span class="comment">// heuristic to decide whether to retart the search from scratch or not.</span></div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> <span class="comment">// We ignore small search trees.</span></div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> <span class="keywordflow">if</span> (sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == 0 && nodes_.<a class="code hl_function" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>() > 50) {</div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> <span class="comment">// Let's count how many nodes have worse objective bounds than the best</span></div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> <span class="comment">// known external objective lower bound.</span></div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <span class="keyword">const</span> IntegerValue latest_lb =</div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> shared_response_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_shared_response_manager.html#ae431b0e8c0f74f95c31ba38f3c534126">GetInnerObjectiveLowerBound</a>();</div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> <span class="keywordtype">int</span> num_nodes_with_lower_objective = 0;</div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> Node& node : nodes_) {</div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> <span class="keywordflow">if</span> (node.MinObjective() < latest_lb) num_nodes_with_lower_objective++;</div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> }</div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> <span class="keywordflow">if</span> (num_nodes_with_lower_objective * 2 > nodes_.size()) {</div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> ++num_restarts;</div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> num_decisions_taken_at_last_restart_ = num_decisions_taken_;</div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"lb_tree_search restart nodes: "</span></div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> << num_nodes_with_lower_objective << <span class="stringliteral">"/"</span> << nodes_.size()</div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> << <span class="stringliteral">" : "</span></div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> << 100.0 * num_nodes_with_lower_objective / nodes_.size() << <span class="stringliteral">"%"</span></div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> << <span class="stringliteral">", branches:"</span> << num_decisions_taken_</div>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> << <span class="stringliteral">", restarts: "</span> << num_restarts;</div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> nodes_.clear();</div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> current_branch_.clear();</div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> }</div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> }</div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> </div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> <span class="comment">// Dive: Follow the branch with lowest objective.</span></div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> <span class="comment">// Note that we do not creates new nodes here.</span></div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> <span class="keywordflow">while</span> (current_branch_.size() == sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() + 1) {</div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> <span class="keyword">const</span> <span class="keywordtype">int</span> level = current_branch_.size() - 1;</div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(level, sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>());</div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> Node& node = nodes_[current_branch_[level]];</div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> node.UpdateObjective(<a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(</div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> current_objective_lb_, integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(objective_var_)));</div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> <span class="keywordflow">if</span> (node.MinObjective() > current_objective_lb_) {</div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> }</div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(node.MinObjective(), current_objective_lb_) << level;</div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> </div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> <span class="comment">// This will be set to the next node index.</span></div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n;</div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> </div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> <span class="comment">// If the variable is already fixed, we bypass the node and connect</span></div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> <span class="comment">// its parent directly to the relevant child.</span></div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> <span class="keywordflow">if</span> (sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b">Assignment</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a142694366986039454f53b38e8378815">LiteralIsAssigned</a>(node.literal)) {</div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> IntegerValue new_lb;</div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> <span class="keywordflow">if</span> (sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b">Assignment</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(node.literal)) {</div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> n = node.true_child;</div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> new_lb = node.true_objective;</div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> n = node.false_child;</div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> new_lb = node.false_objective;</div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> }</div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> </div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> <span class="comment">// We jump directly to the subnode.</span></div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> <span class="comment">// Else we will change the root.</span></div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> current_branch_.pop_back();</div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> <span class="keywordflow">if</span> (!current_branch_.empty()) {</div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> parent = current_branch_.back();</div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> <span class="keywordflow">if</span> (sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b">Assignment</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(nodes_[parent].literal)) {</div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> nodes_[parent].true_child = n;</div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> nodes_[parent].UpdateTrueObjective(new_lb);</div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b">Assignment</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(</div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> nodes_[parent].literal));</div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> nodes_[parent].false_child = n;</div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> nodes_[parent].UpdateFalseObjective(new_lb);</div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> }</div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> <span class="keywordflow">if</span> (nodes_[parent].MinObjective() > current_objective_lb_) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> }</div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> <span class="comment">// If both lower bound are the same, we pick a random sub-branch.</span></div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> <span class="keywordtype">bool</span> choose_true = node.true_objective < node.false_objective;</div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> <span class="keywordflow">if</span> (node.true_objective == node.false_objective) {</div>
|
|
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span> choose_true = absl::Bernoulli(*random_, 0.5);</div>
|
|
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> }</div>
|
|
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> <span class="keywordflow">if</span> (choose_true) {</div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> n = node.true_child;</div>
|
|
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> search_helper_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#aaad5f63041d2eb2fee1a5b6d1cac8424">TakeDecision</a>(node.literal);</div>
|
|
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> n = node.false_child;</div>
|
|
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> search_helper_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#aaad5f63041d2eb2fee1a5b6d1cac8424">TakeDecision</a>(node.literal.Negated());</div>
|
|
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span> }</div>
|
|
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> </div>
|
|
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span> num_decisions_taken_++;</div>
|
|
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> </div>
|
|
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> <span class="comment">// Conflict?</span></div>
|
|
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> <span class="keywordflow">if</span> (current_branch_.size() != sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>()) {</div>
|
|
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> <span class="keywordflow">if</span> (choose_true) {</div>
|
|
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> node.UpdateTrueObjective(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>);</div>
|
|
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> node.UpdateFalseObjective(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>);</div>
|
|
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> }</div>
|
|
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> }</div>
|
|
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> </div>
|
|
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> <span class="comment">// Update the proper field and abort the dive if we crossed the</span></div>
|
|
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> <span class="comment">// threshold.</span></div>
|
|
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> <span class="keyword">const</span> IntegerValue lb = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(objective_var_);</div>
|
|
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> <span class="keywordflow">if</span> (choose_true) {</div>
|
|
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> node.UpdateTrueObjective(lb);</div>
|
|
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> node.UpdateFalseObjective(lb);</div>
|
|
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> }</div>
|
|
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> <span class="keywordflow">if</span> (lb > current_objective_lb_) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> }</div>
|
|
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> </div>
|
|
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span> shared_response_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_shared_response_manager.html#a8836125c65463bdd48d3bce9263c0046">LogPeriodicMessage</a>(</div>
|
|
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> <span class="stringliteral">"TreeS"</span>,</div>
|
|
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> absl::StrCat(<span class="stringliteral">"#nodes:"</span>, nodes_.<a class="code hl_function" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>(), <span class="stringliteral">" #branches:"</span>,</div>
|
|
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> num_decisions_taken_, <span class="stringliteral">" #imports:"</span>, num_imports_),</div>
|
|
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> &last_logging_time_);</div>
|
|
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span> </div>
|
|
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> <span class="keywordflow">if</span> (n < nodes_.<a class="code hl_function" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) {</div>
|
|
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> current_branch_.push_back(n);</div>
|
|
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"> 457</span> }</div>
|
|
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> }</div>
|
|
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> </div>
|
|
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> <span class="comment">// If a conflict occurred, we will backtrack.</span></div>
|
|
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> <span class="keywordflow">if</span> (current_branch_.size() != sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>()) {</div>
|
|
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> }</div>
|
|
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> </div>
|
|
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> <span class="comment">// This test allow to not take a decision when the branch is already closed</span></div>
|
|
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> <span class="comment">// (i.e. the true branch or false branch lb is high enough). Adding it</span></div>
|
|
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> <span class="comment">// basically changes if we take the decision later when we explore the</span></div>
|
|
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> <span class="comment">// branch or right now.</span></div>
|
|
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span> <span class="comment">// I feel taking it later is better. It also avoid creating uneeded nodes.</span></div>
|
|
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span> <span class="comment">// It does change the behavior on a few problem though. For instance on</span></div>
|
|
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> <span class="comment">// irp.mps.gz, the search works better without this, whatever the random</span></div>
|
|
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> <span class="comment">// seed. Not sure why, maybe it creates more diversity?</span></div>
|
|
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"> 475</span> <span class="comment">// Another difference is that if the search is done and we have a feasible</span></div>
|
|
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> <span class="comment">// solution, we will not report it because of this test (except if we are</span></div>
|
|
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span> <span class="comment">// at the optimal).</span></div>
|
|
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> <span class="keywordflow">if</span> (integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(objective_var_) > current_objective_lb_) {</div>
|
|
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"> 479</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> }</div>
|
|
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span> </div>
|
|
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> <span class="comment">// Increase the size of the tree by exploring a new decision.</span></div>
|
|
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> <span class="keyword">const</span> LiteralIndex decision =</div>
|
|
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> search_helper_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#ab47c89fedb27c73cf9ab768b913d1dfe">GetDecision</a>(search_heuristic_);</div>
|
|
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> </div>
|
|
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> <span class="comment">// No new decision: search done.</span></div>
|
|
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> <span class="keywordflow">if</span> (time_limit_-><a class="code hl_function" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>()) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>;</div>
|
|
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> <span class="keywordflow">if</span> (decision == <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) {</div>
|
|
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> feasible_solution_observer();</div>
|
|
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> }</div>
|
|
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> </div>
|
|
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> <span class="comment">// Create a new node.</span></div>
|
|
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> <span class="comment">// Note that the decision will be pushed to the solver on the next loop.</span></div>
|
|
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> n(nodes_.<a class="code hl_function" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>());</div>
|
|
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> nodes_.<a class="code hl_function" href="classabsl_1_1_strong_vector.html#ac294eba73765b9a72a7399d64e8ecd9a">emplace_back</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(decision),</div>
|
|
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(current_objective_lb_,</div>
|
|
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(objective_var_)));</div>
|
|
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span> <span class="keywordflow">if</span> (!current_branch_.empty()) {</div>
|
|
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno"> 500</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> parent = current_branch_.back();</div>
|
|
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno"> 501</span> <span class="keywordflow">if</span> (sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b">Assignment</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(nodes_[parent].literal)) {</div>
|
|
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"> 502</span> nodes_[parent].true_child = n;</div>
|
|
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno"> 503</span> nodes_[parent].UpdateTrueObjective(nodes_.<a class="code hl_function" href="classabsl_1_1_strong_vector.html#af71e6c1eccbc12e9339c00a86a981a43">back</a>().MinObjective());</div>
|
|
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b">Assignment</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(nodes_[parent].literal));</div>
|
|
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> nodes_[parent].false_child = n;</div>
|
|
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span> nodes_[parent].UpdateFalseObjective(nodes_.<a class="code hl_function" href="classabsl_1_1_strong_vector.html#af71e6c1eccbc12e9339c00a86a981a43">back</a>().MinObjective());</div>
|
|
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> }</div>
|
|
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span> }</div>
|
|
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> current_branch_.push_back(n);</div>
|
|
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span> </div>
|
|
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</span> <span class="comment">// Looking at the reduced costs, we can already have a bound for one of the</span></div>
|
|
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span> <span class="comment">// branch. Increasing the corresponding objective can save some branches,</span></div>
|
|
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"> 514</span> <span class="comment">// and also allow for a more incremental LP solving since we do less back</span></div>
|
|
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"> 515</span> <span class="comment">// and forth.</span></div>
|
|
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno"> 516</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> <span class="comment">// TODO(user): The code to recover that is a bit convoluted. Alternatively</span></div>
|
|
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span> <span class="comment">// Maybe we should do a "fast" propagation without the LP in each branch.</span></div>
|
|
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"> 519</span> <span class="comment">// That will work as long as we keep these optimal LP constraints around</span></div>
|
|
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"> 520</span> <span class="comment">// and propagate them.</span></div>
|
|
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno"> 521</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"> 522</span> <span class="comment">// TODO(user): Incorporate this in the heuristic so we choose more Boolean</span></div>
|
|
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> <span class="comment">// inside these LP explanations?</span></div>
|
|
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"> 524</span> <span class="keywordflow">if</span> (lp_constraint_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> <span class="comment">// Note that this return literal EQUIVALENT to the decision, not just</span></div>
|
|
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"> 526</span> <span class="comment">// implied by it. We need that for correctness.</span></div>
|
|
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno"> 527</span> <span class="keywordtype">int</span> num_tests = 0;</div>
|
|
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"> 528</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> integer_literal :</div>
|
|
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno"> 529</span> integer_encoder_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_encoder.html#ae6b172fced38b40193e6e6b73f0e7de9">GetIntegerLiterals</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(decision))) {</div>
|
|
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno"> 530</span> <span class="keywordflow">if</span> (integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a309d057e12c8d4d393f13975eea2e2a9">IsCurrentlyIgnored</a>(integer_literal.var)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"> 531</span> </div>
|
|
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno"> 532</span> <span class="comment">// To avoid bad corner case. Not sure it ever triggers.</span></div>
|
|
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno"> 533</span> <span class="keywordflow">if</span> (++num_tests > 10) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"> 534</span> </div>
|
|
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno"> 535</span> <span class="comment">// TODO(user): we could consider earlier constraint instead of just</span></div>
|
|
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno"> 536</span> <span class="comment">// looking at the last one, but experiments didn't really show a big</span></div>
|
|
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"> 537</span> <span class="comment">// gain.</span></div>
|
|
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno"> 538</span> <span class="keyword">const</span> <span class="keyword">auto</span>& cts = lp_constraint_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#adb1e1d5124a8acfe3e8dee3be6d505b8">OptimalConstraints</a>();</div>
|
|
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno"> 539</span> <span class="keywordflow">if</span> (cts.empty()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"> 540</span> </div>
|
|
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno"> 541</span> <span class="keyword">const</span> std::unique_ptr<IntegerSumLE>& rc = cts.back();</div>
|
|
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno"> 542</span> <span class="keyword">const</span> std::pair<IntegerValue, IntegerValue> <a class="code hl_variable" href="cp__model__solver_8cc.html#a06dad0852d85b0686e01c084207c03a7">bounds</a> =</div>
|
|
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno"> 543</span> rc->ConditionalLb(integer_literal, objective_var_);</div>
|
|
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno"> 544</span> Node& node = nodes_[n];</div>
|
|
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno"> 545</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="cp__model__solver_8cc.html#a06dad0852d85b0686e01c084207c03a7">bounds</a>.first > node.false_objective) {</div>
|
|
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno"> 546</span> ++num_rc_detected_;</div>
|
|
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> node.UpdateFalseObjective(<a class="code hl_variable" href="cp__model__solver_8cc.html#a06dad0852d85b0686e01c084207c03a7">bounds</a>.first);</div>
|
|
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"> 548</span> }</div>
|
|
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="cp__model__solver_8cc.html#a06dad0852d85b0686e01c084207c03a7">bounds</a>.second > node.true_objective) {</div>
|
|
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno"> 550</span> ++num_rc_detected_;</div>
|
|
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"> 551</span> node.UpdateTrueObjective(<a class="code hl_variable" href="cp__model__solver_8cc.html#a06dad0852d85b0686e01c084207c03a7">bounds</a>.second);</div>
|
|
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"> 552</span> }</div>
|
|
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> }</div>
|
|
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno"> 554</span> }</div>
|
|
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno"> 555</span> }</div>
|
|
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno"> 556</span> </div>
|
|
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"> 557</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>;</div>
|
|
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno"> 558</span>}</div>
|
|
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno"> 559</span> </div>
|
|
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"> 560</span>} <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"> 561</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
|
|
<div class="ttc" id="abase_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#l00706">base/logging.h:706</a></div></div>
|
|
<div class="ttc" id="abase_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#l00703">base/logging.h:703</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00707">base/logging.h:707</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00420">base/logging.h:420</a></div></div>
|
|
<div class="ttc" id="abase_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#l00984">base/logging.h:984</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector</a></div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00076">strong_vector.h:76</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_a60304b65bf89363bcc3165d3cde67f86"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">absl::StrongVector::size</a></div><div class="ttdeci">size_type size() const</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00147">strong_vector.h:147</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_ac294eba73765b9a72a7399d64e8ecd9a"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#ac294eba73765b9a72a7399d64e8ecd9a">absl::StrongVector::emplace_back</a></div><div class="ttdeci">void emplace_back(Args &&... args)</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00161">strong_vector.h:161</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_ac8bb3912a3ce86b15842e79d0b421204"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#ac8bb3912a3ce86b15842e79d0b421204">absl::StrongVector::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00170">strong_vector.h:170</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_af71e6c1eccbc12e9339c00a86a981a43"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#af71e6c1eccbc12e9339c00a86a981a43">absl::StrongVector::back</a></div><div class="ttdeci">reference back()</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00174">strong_vector.h:174</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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="aclassoperations__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#l00546">time_limit.h:546</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_encoder_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html">operations_research::sat::IntegerEncoder</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00362">integer.h:362</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_encoder_html_ae6b172fced38b40193e6e6b73f0e7de9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html#ae6b172fced38b40193e6e6b73f0e7de9">operations_research::sat::IntegerEncoder::GetIntegerLiterals</a></div><div class="ttdeci">const InlinedIntegerLiteralVector & GetIntegerLiterals(Literal lit) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00469">integer.h:469</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00250">integer_search.h:250</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00793">integer_search.cc:793</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00879">integer_search.cc:879</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00828">integer_search.cc:828</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html">operations_research::sat::IntegerTrail</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00620">integer.h:620</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00705">integer.h:705</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l01637">integer.cc:1637</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a9ab880b5e67213a0607c5c3935da9f08"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">operations_research::sat::IntegerTrail::LevelZeroUpperBound</a></div><div class="ttdeci">IntegerValue LevelZeroUpperBound(IntegerVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01534">integer.h:1534</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l01529">integer.h:1529</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_ab857cd2aead68952d9fe92a8ad8d3ac9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">operations_research::sat::IntegerTrail::LowerBound</a></div><div class="ttdeci">IntegerValue LowerBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01445">integer.h:1445</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00048">lb_tree_search.cc:48</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00160">lb_tree_search.cc:160</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00572">linear_programming_constraint.h:573</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00137">linear_programming_constraint.h:138</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_constraint_html_adb1e1d5124a8acfe3e8dee3be6d505b8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#adb1e1d5124a8acfe3e8dee3be6d505b8">operations_research::sat::LinearProgrammingConstraint::OptimalConstraints</a></div><div class="ttdeci">const std::vector< std::unique_ptr< IntegerSumLE > > & OptimalConstraints() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00240">linear_programming_constraint.h:240</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00067">sat_base.h:67</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00042">sat/model.h:42</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00115">sat/util.h:115</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00036">sat_decision.h:36</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00347">sat_decision.cc:347</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00302">sat_decision.cc:302</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html">operations_research::sat::SatSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00061">sat_solver.h:61</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a4793952607a98dfddfbcc17abfabbb4b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b">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#l00378">sat_solver.h:378</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a5b06f24fb581de78b321dfd793931439"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a5b06f24fb581de78b321dfd793931439">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#l00377">sat_solver.h:377</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00325">sat_solver.h:325</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00561">sat_solver.cc:561</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00183">sat_solver.h:183</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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="ttdeci">@ LIMIT_REACHED</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00187">sat_solver.h:187</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00991">sat_solver.cc:991</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00551">sat_solver.cc:551</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00376">sat_solver.h:376</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00181">synchronization.h:181</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00697">synchronization.cc:697</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_shared_response_manager_html_a8836125c65463bdd48d3bce9263c0046"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_response_manager.html#a8836125c65463bdd48d3bce9263c0046">operations_research::sat::SharedResponseManager::LogPeriodicMessage</a></div><div class="ttdeci">void LogPeriodicMessage(const std::string &prefix, const std::string &message, absl::Time *last_logging_time)</div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8cc_source.html#l00167">synchronization.cc:167</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_shared_response_manager_html_ae431b0e8c0f74f95c31ba38f3c534126"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_response_manager.html#ae431b0e8c0f74f95c31ba38f3c534126">operations_research::sat::SharedResponseManager::GetInnerObjectiveLowerBound</a></div><div class="ttdeci">IntegerValue GetInnerObjectiveLowerBound()</div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8cc_source.html#l00365">synchronization.cc:365</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00277">synchronization.cc:277</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_aba78b12088909fb59dbdd0cb064412ae"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#aba78b12088909fb59dbdd0cb064412ae">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#l00384">sat_base.h:384</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00156">sat_base.h:156</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00153">sat_base.h:153</a></div></div>
|
|
<div class="ttc" id="aclassoperations__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#l00150">sat_base.h:150</a></div></div>
|
|
<div class="ttc" id="acp__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="acp__model__solver_8cc_html_a06dad0852d85b0686e01c084207c03a7"><div class="ttname"><a href="cp__model__solver_8cc.html#a06dad0852d85b0686e01c084207c03a7">bounds</a></div><div class="ttdeci">SharedBoundsManager * bounds</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02051">cp_model_solver.cc:2051</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00274">gurobi_interface.cc:274</a></div></div>
|
|
<div class="ttc" id="ainteger_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
|
|
<div class="ttc" id="ainteger__expr_8h_html"><div class="ttname"><a href="integer__expr_8h.html">integer_expr.h</a></div></div>
|
|
<div class="ttc" id="ainteger__search_8h_html"><div class="ttname"><a href="integer__search_8h.html">integer_search.h</a></div></div>
|
|
<div class="ttc" id="alb__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="alinear__programming__constraint_8h_html"><div class="ttname"><a href="linear__programming__constraint_8h.html">linear_programming_constraint.h</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_ab4a2cbab234914b320b7fae11b6e8cb9"><div class="ttname"><a href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a></div><div class="ttdeci">const int INFO</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00031">log_severity.h:31</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1227e67513602591fb959e35c9de66e8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">operations_research::sat::kMaxIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMaxIntegerValue(std::numeric_limits< IntegerValue::ValueType >::max() - 1)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a2acd1aef8e418e20032fd893668c04a6"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a2acd1aef8e418e20032fd893668c04a6">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#l00202">integer_search.cc:202</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__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="anamespaceoperations__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#l00330">integer_search.cc:330</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a7ae31ba4c3b4899478e53ca13df35dfc"><div class="ttname"><a href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">operations_research::NodeIndex</a></div><div class="ttdeci">int32_t NodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00201">ebert_graph.h:193</a></div></div>
|
|
<div class="ttc" id="arouting__filters_8cc_html_a4f1e8002734902ae1c65ccc3fc30c98e"><div class="ttname"><a href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a></div><div class="ttdeci">int64_t bound</div><div class="ttdef"><b>Definition:</b> <a href="routing__filters_8cc_source.html#l00968">routing_filters.cc:968</a></div></div>
|
|
<div class="ttc" id="asat_2model_8h_html"><div class="ttname"><a href="sat_2model_8h.html">model.h</a></div></div>
|
|
<div class="ttc" id="asat_2util_8h_html"><div class="ttname"><a href="sat_2util_8h.html">util.h</a></div></div>
|
|
<div class="ttc" id="asat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</a></div></div>
|
|
<div class="ttc" id="asat__decision_8h_html"><div class="ttname"><a href="sat__decision_8h.html">sat_decision.h</a></div></div>
|
|
<div class="ttc" id="asat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
|
|
<div class="ttc" id="astrong__integers_8h_html"><div class="ttname"><a href="strong__integers_8h.html">strong_integers.h</a></div></div>
|
|
<div class="ttc" id="astrong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_assignment_info_html_a6a330c3b2adf87bfa27e9a9450d8bc40"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_assignment_info.html#a6a330c3b2adf87bfa27e9a9450d8bc40">operations_research::sat::AssignmentInfo::level</a></div><div class="ttdeci">uint32_t level</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00202">sat_base.h:202</a></div></div>
|
|
<div class="ttc" id="astructoperations__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#l00174">integer.h:174</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_integer_literal_html_a6c233aafac25ea66d69de93a83c9be63"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">operations_research::sat::IntegerLiteral::GreaterOrEqual</a></div><div class="ttdeci">static IntegerLiteral GreaterOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01387">integer.h:1387</a></div></div>
|
|
<div class="ttc" id="astructoperations__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#l00041">cp_model_mapping.h:41</a></div></div>
|
|
<div class="ttc" id="astructoperations__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#l00044">cp_model_mapping.h:44</a></div></div>
|
|
<div class="ttc" id="astructoperations__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#l00076">integer_search.h:76</a></div></div>
|
|
<div class="ttc" id="asynchronization_8h_html"><div class="ttname"><a href="synchronization_8h.html">synchronization.h</a></div></div>
|
|
<div class="ttc" id="atime__limit_8h_html"><div class="ttname"><a href="time__limit_8h.html">time_limit.h</a></div></div>
|
|
<div class="ttc" id="avlog__is__on_8h_html_a956152cad330225654d128f35c00efce"><div class="ttname"><a href="vlog__is__on_8h.html#a956152cad330225654d128f35c00efce">VLOG_IS_ON</a></div><div class="ttdeci">#define VLOG_IS_ON(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="vlog__is__on_8h_source.html#l00044">vlog_is_on.h:44</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.9.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|