134 lines
32 KiB
HTML
134 lines
32 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.15"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: lb_tree_search.h Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('lb__tree__search_8h_source.html','');});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">lb_tree_search.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="lb__tree__search_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2021 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#ifndef OR_TOOLS_SAT_LB_TREE_SEARCH_H_</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#define OR_TOOLS_SAT_LB_TREE_SEARCH_H_</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <limits></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>"</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="integer__search_8h.html">ortools/sat/integer_search.h</a>"</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="sat__base_8h.html">ortools/sat/sat_base.h</a>"</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="sat__solver_8h.html">ortools/sat/sat_solver.h</a>"</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="synchronization_8h.html">ortools/sat/synchronization.h</a>"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="keyword">namespace </span>sat {</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> </div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// Implement a "classic" MIP tree search by having an exhaustive list of open</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// nodes.</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">//</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// The goal of this subsolver is to improve the objective lower bound. It is</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// meant to be used in a multi-thread portfolio, and as such it really do not</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// care about finding solution. It is all about improving the lower bound.</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">//</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// TODO(user): What this is doing is really similar to asking a SAT solver if</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// the current objective lower bound is reachable by solving a SAT problem.</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// However, this code handle on the side all the "conflict" of the form</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// objective > current_lb. As a result, when it is UNSAT, we can bump the lower</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// bound by a bigger amount than one. We also do not completely loose everything</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// learned so far for the next iteration.</span></div><div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_lb_tree_search.html"> 42</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_lb_tree_search.html">LbTreeSearch</a> {</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_lb_tree_search.html#a85d4342cd27dc4032928d0e6986a0110">LbTreeSearch</a>(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> </div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="comment">// Explores the search space.</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code" href="classoperations__research_1_1sat_1_1_lb_tree_search.html#ad7093536412144723604fcfe56ffeb3c">Search</a>(</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">const</span> std::function<<span class="keywordtype">void</span>()>& feasible_solution_observer);</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> </div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// Code a binary tree.</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">struct </span>Node {</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  Node(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l, IntegerValue lb)</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  : <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>(l),</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  objective_lb(lb),</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  true_objective(lb),</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  false_objective(lb) {}</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="comment">// Invariant: the objective bounds only increase.</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordtype">void</span> UpdateObjective() {</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  objective_lb =</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(objective_lb, <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(true_objective, false_objective));</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  }</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordtype">void</span> UpdateTrueObjective(IntegerValue v) {</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  true_objective = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(true_objective, v);</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  UpdateObjective();</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  }</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordtype">void</span> UpdateFalseObjective(IntegerValue v) {</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  false_objective = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(false_objective, v);</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  UpdateObjective();</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  }</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> </div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// The decision for the true and false branch under this node.</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">/*const*/</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>;</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> </div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// The objective lower bound at this node.</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  IntegerValue objective_lb;</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> </div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="comment">// The objective lower bound in both branches.</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">// This is only updated when we backtrack over this node.</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  IntegerValue true_objective;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  IntegerValue false_objective;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> </div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// Points to adjacent nodes in the tree. Large if no connection.</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordtype">int</span> true_child = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int32_t>::max</a>();</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordtype">int</span> false_child = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int32_t>::max</a>();</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> </div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// Instead of storing the full reason for an objective LB increase in one</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="comment">// the branches (which can lead to a quadratic memory usage), we stores the</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// level of the highest decision needed, not counting this node literal.</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// Basically, the reason for true_objective without {literal} only includes</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">// literal with levels in [0, true_level].</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">//</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// This allows us to slighlty reduce the size of the overall tree. If both</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// branches have a low enough level, then we can backjump in the search tree</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="comment">// and skip all the nodes in-between by connecting directly the correct</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">// ancestor to this node. Note that when we do that, the level of the nodes</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">// in the sub-branch change, but this still work.</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordtype">int</span> true_level = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int32_t>::max</a>();</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordtype">int</span> false_level = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int32_t>::max</a>();</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  };</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> </div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// Returns true if this node objective lb is greater than the root level</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// objective lower bound.</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordtype">bool</span> NodeImprovesLowerBound(<span class="keyword">const</span> LbTreeSearch::Node& node);</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> </div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// Model singleton class used here.</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* time_limit_;</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <a class="code" href="classoperations__research_1_1sat_1_1_model_random_generator.html">ModelRandomGenerator</a>* random_;</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* sat_solver_;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail_;</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <a class="code" href="classoperations__research_1_1sat_1_1_shared_response_manager.html">SharedResponseManager</a>* shared_response_;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html">SatDecisionPolicy</a>* sat_decision_;</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_search_helper.html">IntegerSearchHelper</a>* search_helper_;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  IntegerVariable objective_var_;</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// Memory for all the nodes.</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  std::vector<Node> nodes_;</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// The list of nodes in the current branch, in order from the root.</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  std::vector<int> current_branch_;</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> </div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="comment">// Our heuristic used to explore the tree. See code for detail.</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  std::function<<a class="code" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> search_heuristic_;</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> };</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> </div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> } <span class="comment">// namespace sat</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> } <span class="comment">// namespace operations_research</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> </div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="preprocessor">#endif // OR_TOOLS_SAT_LB_TREE_SEARCH_H_</span></div><div class="ttc" id="classoperations__research_1_1_time_limit_html"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html">operations_research::TimeLimit</a></div><div class="ttdoc">A simple class to enforce both an elapsed time limit and a deterministic time limit in the same threa...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00105">time_limit.h:105</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00038">sat/model.h:38</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_shared_response_manager_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_response_manager.html">operations_research::sat::SharedResponseManager</a></div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8h_source.html#l00173">synchronization.h:173</a></div></div>
|
|
<div class="ttc" id="gurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00273">gurobi_interface.cc:273</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00065">sat_base.h:65</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_lb_tree_search_html_a85d4342cd27dc4032928d0e6986a0110"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_lb_tree_search.html#a85d4342cd27dc4032928d0e6986a0110">operations_research::sat::LbTreeSearch::LbTreeSearch</a></div><div class="ttdeci">LbTreeSearch(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="lb__tree__search_8cc_source.html#l00023">lb_tree_search.cc:23</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_boolean_or_integer_literal_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">operations_research::sat::BooleanOrIntegerLiteral</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00041">integer_search.h:41</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="sat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html">operations_research::sat::IntegerTrail</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00574">integer.h:574</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_decision_policy_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html">operations_research::sat::SatDecisionPolicy</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8h_source.html#l00035">sat_decision.h:35</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_model_random_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model_random_generator.html">operations_research::sat::ModelRandomGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8h_source.html#l00041">sat/util.h:41</a></div></div>
|
|
<div class="ttc" id="sat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_search_helper_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_search_helper.html">operations_research::sat::IntegerSearchHelper</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00237">integer_search.h:237</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html">operations_research::sat::SatSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00058">sat_solver.h:58</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_lb_tree_search_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_lb_tree_search.html">operations_research::sat::LbTreeSearch</a></div><div class="ttdef"><b>Definition:</b> <a href="lb__tree__search_8h_source.html#l00042">lb_tree_search.h:42</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_lb_tree_search_html_ad7093536412144723604fcfe56ffeb3c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_lb_tree_search.html#ad7093536412144723604fcfe56ffeb3c">operations_research::sat::LbTreeSearch::Search</a></div><div class="ttdeci">SatSolver::Status Search(const std::function< void()> &feasible_solution_observer)</div><div class="ttdef"><b>Definition:</b> <a href="lb__tree__search_8cc_source.html#l00053">lb_tree_search.cc:53</a></div></div>
|
|
<div class="ttc" id="integer__search_8h_html"><div class="ttname"><a href="integer__search_8h.html">integer_search.h</a></div></div>
|
|
<div class="ttc" id="integer_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="synchronization_8h_html"><div class="ttname"><a href="synchronization_8h.html">synchronization.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">operations_research::sat::SatSolver::Status</a></div><div class="ttdeci">Status</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00181">sat_solver.h:181</a></div></div>
|
|
<div class="ttc" id="optimization_8cc_html_af63dcc00f2023fdf498e0829e6fb8a6b"><div class="ttname"><a href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a></div><div class="ttdeci">Literal literal</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00085">optimization.cc:85</a></div></div>
|
|
</div><!-- 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_8h.html">lb_tree_search.h</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|