445 lines
94 KiB
HTML
445 lines
94 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: integer_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>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.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('integer__search_8h_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">integer_search.h</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="integer__search_8h.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="comment">// This file contains all the top-level logic responsible for driving the search</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="comment">// of a satisfiability integer problem. What decision we take next, which new</span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="comment">// Literal associated to an IntegerLiteral we create and when we restart.</span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="comment">// For an optimization problem, our algorithm solves a sequence of decision</span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="comment">// problem using this file as an entry point. Note that some heuristics here</span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="comment">// still use the objective if there is one in order to orient the search towards</span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="comment">// good feasible solution though.</span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span> </div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#ifndef OR_TOOLS_SAT_INTEGER_SEARCH_H_</span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#define OR_TOOLS_SAT_INTEGER_SEARCH_H_</span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span> </div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> </div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.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="linear__programming__constraint_8h.html">ortools/sat/linear_programming_constraint.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="pseudo__costs_8h.html">ortools/sat/pseudo_costs.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="sat__base_8h.html">ortools/sat/sat_base.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="sat__solver_8h.html">ortools/sat/sat_solver.h</a>"</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> </div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> </div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="comment">// This is used to hold the next decision the solver will take. It is either</span></div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="comment">// a pure Boolean literal decision or correspond to an IntegerLiteral one.</span></div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="comment">// At most one of the two options should be set.</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html"> 41</a></span><span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a> {</div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#ae524bf12eec388724545b7f47e3538ef"> 42</a></span> <a class="code hl_function" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#ae524bf12eec388724545b7f47e3538ef">BooleanOrIntegerLiteral</a>() {}</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#a706766402ca4c78519e6c10eb76c8db3"> 43</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#a706766402ca4c78519e6c10eb76c8db3">BooleanOrIntegerLiteral</a>(LiteralIndex <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> : <a class="code hl_variable" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#a3c6f3ae96a90c7fcef34dd0f1ce0297e">boolean_literal_index</a>(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {}</div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#afcfb0c6902e66dba068a76719658550d"> 45</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#afcfb0c6902e66dba068a76719658550d">BooleanOrIntegerLiteral</a>(<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> i_lit)</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> : <a class="code hl_variable" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#aee356429e37f0750e38ee17ae1464a00">integer_literal</a>(i_lit) {}</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="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#ae26b73bbf70dc88433be39df364ca7c1"> 48</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#ae26b73bbf70dc88433be39df364ca7c1">HasValue</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#a3c6f3ae96a90c7fcef34dd0f1ce0297e">boolean_literal_index</a> != <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a> ||</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <a class="code hl_variable" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#aee356429e37f0750e38ee17ae1464a00">integer_literal</a>.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_integer_literal.html#ab6516f556b715738034b30d290c40214">var</a> != <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>;</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> }</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> </div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#a3c6f3ae96a90c7fcef34dd0f1ce0297e"> 53</a></span> LiteralIndex <a class="code hl_variable" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#a3c6f3ae96a90c7fcef34dd0f1ce0297e">boolean_literal_index</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>;</div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#aee356429e37f0750e38ee17ae1464a00"> 54</a></span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> <a class="code hl_variable" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#aee356429e37f0750e38ee17ae1464a00">integer_literal</a> = <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a>();</div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span>};</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> </div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span><span class="comment">// Model struct that contains the search heuristics used to find a feasible</span></div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span><span class="comment">// solution to an integer problem.</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">// This is reset by ConfigureSearchHeuristics() and used by</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span><span class="comment">// SolveIntegerProblem(), see below.</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_search_heuristics.html"> 62</a></span><span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_search_heuristics.html">SearchHeuristics</a> {</div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="comment">// Decision and restart heuristics. The two vectors must be of the same size</span></div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="comment">// and restart_policies[i] will always be used in conjunction with</span></div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="comment">// decision_policies[i].</span></div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c"> 66</a></span> std::vector<std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()>> <a class="code hl_variable" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">decision_policies</a>;</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a0d0b8f29f3557e2ee84f53b45d817e02"> 67</a></span> std::vector<std::function<bool()>> <a class="code hl_variable" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a0d0b8f29f3557e2ee84f53b45d817e02">restart_policies</a>;</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> </div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// Index in the vectors above that indicate the current configuration.</span></div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af2155539e87804108c670c32478e123d"> 70</a></span> <span class="keywordtype">int</span> <a class="code hl_variable" href="structoperations__research_1_1sat_1_1_search_heuristics.html#af2155539e87804108c670c32478e123d">policy_index</a>;</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> </div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// Two special decision functions that are constructed at loading time.</span></div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="comment">// These are used by ConfigureSearchHeuristics() to fill the policies above.</span></div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a984249b5c2efe8f16e6942b54be739a5"> 74</a></span> std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code hl_variable" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a984249b5c2efe8f16e6942b54be739a5">fixed_search</a> = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a3ef187fb1a44e4df4e66c2a59304000e"> 75</a></span> std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code hl_variable" href="structoperations__research_1_1sat_1_1_search_heuristics.html#a3ef187fb1a44e4df4e66c2a59304000e">hint_search</a> = <span class="keyword">nullptr</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">// Some search strategy need to take more than one decision at once. They can</span></div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="comment">// set this function that will be called on the next decision. It will be</span></div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="comment">// automatically deleted the first time it returns an empty decision.</span></div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_search_heuristics.html#aa1668e07fb6607c61474310ad1045657"> 80</a></span> std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code hl_variable" href="structoperations__research_1_1sat_1_1_search_heuristics.html#aa1668e07fb6607c61474310ad1045657">next_decision_override</a> = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span>};</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> </div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span><span class="comment">// Given a base "fixed_search" function that should mainly control in which</span></div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span><span class="comment">// order integer variables are lazily instantiated (and at what value), this</span></div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span><span class="comment">// uses the current solver parameters to set the SearchHeuristics class in the</span></div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span><span class="comment">// given model.</span></div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a7ac1d9dc3254d77ade7bdbf984884b7e">ConfigureSearchHeuristics</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="l00088" name="l00088"></a><span class="lineno"> 88</span> </div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span><span class="comment">// Callbacks that will be called when the search goes back to level 0.</span></div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span><span class="comment">// Callbacks should return false if the propagation fails.</span></div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_level_zero_callback_helper.html"> 91</a></span><span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_level_zero_callback_helper.html">LevelZeroCallbackHelper</a> {</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_level_zero_callback_helper.html#ac008fdb20ed4a9c84c490d4cbff755ac"> 92</a></span> std::vector<std::function<bool()>> <a class="code hl_variable" href="structoperations__research_1_1sat_1_1_level_zero_callback_helper.html#ac008fdb20ed4a9c84c490d4cbff755ac">callbacks</a>;</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span>};</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> </div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span><span class="comment">// Tries to find a feasible solution to the current model.</span></div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span><span class="comment">// This function continues from the current state of the solver and loop until</span></div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span><span class="comment">// all variables are instantiated (i.e. the next decision is kNoLiteralIndex) or</span></div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span><span class="comment">// a search limit is reached. It uses the heuristic from the SearchHeuristics</span></div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span><span class="comment">// class in the model to decide when to restart and what next decision to take.</span></div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span><span class="comment">// Each time a restart happen, this increment the policy index modulo the number</span></div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span><span class="comment">// of heuristics to act as a portfolio search.</span></div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</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="namespaceoperations__research_1_1sat.html#a8bea9a6a0de60c8fdab99ad7dfdf8498">SolveIntegerProblem</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="l00105" name="l00105"></a><span class="lineno"> 105</span> </div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span><span class="comment">// Resets the solver to the given assumptions before calling</span></div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span><span class="comment">// SolveIntegerProblem().</span></div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</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="namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a">ResetAndSolveIntegerProblem</a>(</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="keyword">const</span> std::vector<Literal>& assumptions, <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="l00110" name="l00110"></a><span class="lineno"> 110</span> </div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span><span class="comment">// Only used in tests. Move to a test utility file.</span></div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span><span class="comment">// This configures the model SearchHeuristics with a simple default heuristic</span></div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span><span class="comment">// and then call ResetAndSolveIntegerProblem() without any assumptions.</span></div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</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="namespaceoperations__research_1_1sat.html#a48d1aae59a778d6f39609f9add7cd0a5">SolveIntegerProblemWithLazyEncoding</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="l00116" name="l00116"></a><span class="lineno"> 116</span> </div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span><span class="comment">// Returns decision corresponding to var at its lower bound.</span></div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span><span class="comment">// Returns an invalid literal if the variable is fixed.</span></div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a304417ca7c3964cc928b771620b2dc53">AtMinValue</a>(IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail);</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> </div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span><span class="comment">// If a variable appear in the objective, branch on its best objective value.</span></div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a71fa416b44768076a0e7dd7777ab433d">ChooseBestObjectiveValue</a>(IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</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="l00123" name="l00123"></a><span class="lineno"> 123</span> </div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span><span class="comment">// Returns decision corresponding to var >= lb + max(1, (ub - lb) / 2). It also</span></div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span><span class="comment">// CHECKs that the variable is not fixed.</span></div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a3f4df9da99787316bfb5029b7a6b92b7">GreaterOrEqualToMiddleValue</a>(IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>,</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail);</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> </div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span><span class="comment">// This method first tries var <= value. If this does not reduce the domain it</span></div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span><span class="comment">// tries var >= value. If that also does not reduce the domain then returns</span></div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span><span class="comment">// an invalid literal.</span></div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a46cb4c07c4971a99724693260c92fd5b">SplitAroundGivenValue</a>(IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, IntegerValue <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>,</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> <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="l00134" name="l00134"></a><span class="lineno"> 134</span> </div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span><span class="comment">// Returns decision corresponding to var <= round(lp_value). If the variable</span></div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span><span class="comment">// does not appear in the LP, this method returns an invalid literal.</span></div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ac0774a1df651b83339b00fee0bde1cd8">SplitAroundLpValue</a>(IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</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="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="comment">// Returns decision corresponding to var <= best_solution[var]. If no solution</span></div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span><span class="comment">// has been found, this method returns a literal with kNoIntegerVariable. This</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span><span class="comment">// was suggested in paper: "Solution-Based Phase Saving for CP" (2018) by Emir</span></div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span><span class="comment">// Demirovic, Geoffrey Chu, and Peter J. Stuckey.</span></div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a872297a32bd1f4a91bbcebd1c47b3751"> 143</a></span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a872297a32bd1f4a91bbcebd1c47b3751">SplitDomainUsingBestSolutionValue</a>(IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>,</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <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="l00145" name="l00145"></a><span class="lineno"> 145</span> </div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span><span class="comment">// Decision heuristic for SolveIntegerProblemWithLazyEncoding(). Returns a</span></div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span><span class="comment">// function that will return the literal corresponding to the fact that the</span></div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span><span class="comment">// first currently non-fixed variable value is <= its min. The function will</span></div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span><span class="comment">// return kNoLiteralIndex if all the given variables are fixed.</span></div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span><span class="comment">// Note that this function will create the associated literal if needed.</span></div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span>std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a0b08971dbb223f77e7fc9c41a77fdc7b">FirstUnassignedVarAtItsMinHeuristic</a>(</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="keyword">const</span> std::vector<IntegerVariable>& vars, <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="l00154" name="l00154"></a><span class="lineno"> 154</span> </div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span><span class="comment">// Decision heuristic for SolveIntegerProblemWithLazyEncoding(). Like</span></div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span><span class="comment">// FirstUnassignedVarAtItsMinHeuristic() but the function will return the</span></div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span><span class="comment">// literal corresponding to the fact that the currently non-assigned variable</span></div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span><span class="comment">// with the lowest min has a value <= this min.</span></div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span>std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()></div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span><a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a4713f8fb7e1ccddece18a374886ad866">UnassignedVarWithLowestMinAtItsMinHeuristic</a>(</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="keyword">const</span> std::vector<IntegerVariable>& vars, <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="l00162" name="l00162"></a><span class="lineno"> 162</span> </div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span><span class="comment">// Set the first unassigned Literal/Variable to its value.</span></div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span><span class="comment">// TODO(user): This is currently quadratic as we scan all variables to find the</span></div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span><span class="comment">// first unassigned one. Fix. Note that this is also the case in many other</span></div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span><span class="comment">// heuristics and should be fixed.</span></div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_boolean_or_integer_variable.html"> 168</a></span><span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_variable.html">BooleanOrIntegerVariable</a> {</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_boolean_or_integer_variable.html#aa5d493d0ceaa64f8e71d9aa540db7d90"> 169</a></span> BooleanVariable <a class="code hl_variable" href="structoperations__research_1_1sat_1_1_boolean_or_integer_variable.html#aa5d493d0ceaa64f8e71d9aa540db7d90">bool_var</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#add67896a84f6372a648154c5770a0ae0">kNoBooleanVariable</a>;</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_boolean_or_integer_variable.html#ae5143331fa20cd81b3339d4279826439"> 170</a></span> IntegerVariable <a class="code hl_variable" href="structoperations__research_1_1sat_1_1_boolean_or_integer_variable.html#ae5143331fa20cd81b3339d4279826439">int_var</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>;</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span>};</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span>std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5c07862681284286ab67401730668f38">FollowHint</a>(</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="keyword">const</span> std::vector<BooleanOrIntegerVariable>& vars,</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="keyword">const</span> std::vector<IntegerValue>& values, <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="l00175" name="l00175"></a><span class="lineno"> 175</span> </div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span><span class="comment">// Combines search heuristics in order: if the i-th one returns kNoLiteralIndex,</span></div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span><span class="comment">// ask the (i+1)-th. If every heuristic returned kNoLiteralIndex,</span></div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span><span class="comment">// returns kNoLiteralIndex.</span></div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span>std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a2acd1aef8e418e20032fd893668c04a6">SequentialSearch</a>(</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> std::vector<std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()>> heuristics);</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> </div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span><span class="comment">// Changes the value of the given decision by 'var_selection_heuristic'. We try</span></div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span><span class="comment">// to see if the decision is "associated" with an IntegerVariable, and if it is</span></div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span><span class="comment">// the case, we choose the new value by the first 'value_selection_heuristics'</span></div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span><span class="comment">// that is applicable. If none of the heuristics are applicable then the given</span></div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span><span class="comment">// decision by 'var_selection_heuristic' is returned.</span></div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span>std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1e222e7822b62559452fb087e852bcf0">SequentialValueSelection</a>(</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> std::vector<std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a>(IntegerVariable)>></div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> value_selection_heuristics,</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> var_selection_heuristic,</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <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="l00192" name="l00192"></a><span class="lineno"> 192</span> </div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span><span class="comment">// Changes the value of the given decision by 'var_selection_heuristic'</span></div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span><span class="comment">// according to various value selection heuristics. Looks at the code to know</span></div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span><span class="comment">// exactly what heuristic we use.</span></div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span>std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a88ab44e20ce09e9942f6b8411452df27">IntegerValueSelectionHeuristic</a>(</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> var_selection_heuristic,</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <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="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="comment">// Returns the BooleanOrIntegerLiteral advised by the underliying SAT solver.</span></div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span>std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a8f18cefafff72d70f6e96ed3f2ef84aa">SatSolverHeuristic</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="l00202" name="l00202"></a><span class="lineno"> 202</span> </div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span><span class="comment">// Gets the branching variable using pseudo costs and combines it with a value</span></div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span><span class="comment">// for branching.</span></div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span>std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aefab46ecc02eb059ed853ee0213be7fb">PseudoCost</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="l00206" name="l00206"></a><span class="lineno"> 206</span> </div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span><span class="comment">// Simple scheduling heuristic that looks at all the no-overlap constraints</span></div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span><span class="comment">// and try to assign and perform the intervals that can be scheduled first.</span></div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span>std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a6c01e08a9089e0d5fed2507f479bbadc">SchedulingSearchHeuristic</a>(</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <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="l00211" name="l00211"></a><span class="lineno"> 211</span> </div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span><span class="comment">// Returns true if the number of variables in the linearized part represent</span></div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span><span class="comment">// a large enough proportion of all the problem variables.</span></div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aeaaccdd218e3f0aa5c218d3a0cc5c3f1">LinearizedPartIsLarge</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="l00215" name="l00215"></a><span class="lineno"> 215</span> </div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span><span class="comment">// A restart policy that restarts every k failures.</span></div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span>std::function<bool()> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5fcdf1d56a24d096d0c381a9708d4fa9">RestartEveryKFailures</a>(<span class="keywordtype">int</span> k, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver);</div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> </div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span><span class="comment">// A restart policy that uses the underlying sat solver's policy.</span></div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span>std::function<bool()> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a527a6ee26b7f573def70daf9b2a9e577">SatSolverRestartPolicy</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="l00221" name="l00221"></a><span class="lineno"> 221</span> </div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span><span class="comment">// Concatenates each input_heuristic with a default heuristic that instantiate</span></div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span><span class="comment">// all the problem's Boolean variables, into a new vector.</span></div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span>std::vector<std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()>> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a04f971e1062428f1b552f1f6295da939">CompleteHeuristics</a>(</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="keyword">const</span> std::vector<std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()>>&</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> incomplete_heuristics,</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <span class="keyword">const</span> std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()>& completion_heuristic);</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> </div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span><span class="comment">// Specialized search that will continuously probe Boolean variables and bounds</span></div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span><span class="comment">// of integer variables.</span></div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</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="namespaceoperations__research_1_1sat.html#abb234c348ddabb307c1170b3e4c7f2b9">ContinuousProbing</a>(</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="keyword">const</span> std::vector<BooleanVariable>& bool_vars,</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <span class="keyword">const</span> std::vector<IntegerVariable>& int_vars,</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <span class="keyword">const</span> std::function<<span class="keywordtype">void</span>()>& feasible_solution_observer, <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="l00235" name="l00235"></a><span class="lineno"> 235</span> </div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span><span class="comment">// An helper class to share the code used by the different kind of search.</span></div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_integer_search_helper.html"> 237</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_search_helper.html">IntegerSearchHelper</a> {</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="keyword">explicit</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#a3da0daf61b8c11b7503a7d8f49e964d8">IntegerSearchHelper</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="l00240" name="l00240"></a><span class="lineno"> 240</span> </div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="comment">// Executes some code before a new decision.</span></div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <span class="comment">// Returns false if model is UNSAT.</span></div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <span class="keywordtype">bool</span> <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="l00244" name="l00244"></a><span class="lineno"> 244</span> </div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <span class="comment">// Calls the decision heuristics and extract a non-fixed literal.</span></div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> <span class="comment">// Note that we do not want to copy the function here.</span></div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> LiteralIndex <a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#ab47c89fedb27c73cf9ab768b913d1dfe">GetDecision</a>(<span class="keyword">const</span> std::function<<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html">BooleanOrIntegerLiteral</a>()>& f);</div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> </div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <span class="comment">// Tries to take the current decision, this might backjump.</span></div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> <span class="comment">// Returns false if the model is UNSAT.</span></div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_search_helper.html#aaad5f63041d2eb2fee1a5b6d1cac8424">TakeDecision</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> decision);</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> </div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* model_;</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* sat_solver_;</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail_;</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>* encoder_;</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_implied_bounds.html">ImpliedBounds</a>* implied_bounds_;</div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> <a class="code hl_class" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* time_limit_;</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_pseudo_costs.html">PseudoCosts</a>* pseudo_costs_;</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> IntegerVariable objective_var_ = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>;</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span>};</div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> </div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span>} <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> </div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_SAT_INTEGER_SEARCH_H_</span></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_1sat_1_1_implied_bounds_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html">operations_research::sat::ImpliedBounds</a></div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8h_source.html#l00079">implied_bounds.h:79</a></div></div>
|
|
<div class="ttc" id="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#l00356">integer.h:356</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#l00237">integer_search.h:237</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_search_helper_html_a3da0daf61b8c11b7503a7d8f49e964d8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_search_helper.html#a3da0daf61b8c11b7503a7d8f49e964d8">operations_research::sat::IntegerSearchHelper::IntegerSearchHelper</a></div><div class="ttdeci">IntegerSearchHelper(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00765">integer_search.cc:765</a></div></div>
|
|
<div class="ttc" id="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#l00778">integer_search.cc:778</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#l00864">integer_search.cc:864</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#l00813">integer_search.cc:813</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#l00613">integer.h:613</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#l00066">sat_base.h:66</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#l00038">sat/model.h:38</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pseudo_costs_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pseudo_costs.html">operations_research::sat::PseudoCosts</a></div><div class="ttdef"><b>Definition:</b> <a href="pseudo__costs_8h_source.html#l00028">pseudo_costs.h:28</a></div></div>
|
|
<div class="ttc" id="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#l00058">sat_solver.h:58</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#l00181">sat_solver.h:181</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="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="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="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="anamespaceoperations__research_1_1sat_html_a04f971e1062428f1b552f1f6295da939"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a04f971e1062428f1b552f1f6295da939">operations_research::sat::CompleteHeuristics</a></div><div class="ttdeci">std::vector< std::function< BooleanOrIntegerLiteral()> > CompleteHeuristics(const std::vector< std::function< BooleanOrIntegerLiteral()> > &incomplete_heuristics, const std::function< BooleanOrIntegerLiteral()> &completion_heuristic)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00752">integer_search.cc:752</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a0b08971dbb223f77e7fc9c41a77fdc7b"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0b08971dbb223f77e7fc9c41a77fdc7b">operations_research::sat::FirstUnassignedVarAtItsMinHeuristic</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> FirstUnassignedVarAtItsMinHeuristic(const std::vector< IntegerVariable > &vars, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00152">integer_search.cc:152</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a17b20b0845d9e02829d417294aded36a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a">operations_research::sat::ResetAndSolveIntegerProblem</a></div><div class="ttdeci">SatSolver::Status ResetAndSolveIntegerProblem(const std::vector< Literal > &assumptions, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l01044">integer_search.cc:1044</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1e222e7822b62559452fb087e852bcf0"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1e222e7822b62559452fb087e852bcf0">operations_research::sat::SequentialValueSelection</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> SequentialValueSelection(std::vector< std::function< IntegerLiteral(IntegerVariable)> > value_selection_heuristics, std::function< BooleanOrIntegerLiteral()> var_selection_heuristic, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00198">integer_search.cc:198</a></div></div>
|
|
<div class="ttc" id="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#l00187">integer_search.cc:187</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_a304417ca7c3964cc928b771620b2dc53"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a304417ca7c3964cc928b771620b2dc53">operations_research::sat::AtMinValue</a></div><div class="ttdeci">IntegerLiteral AtMinValue(IntegerVariable var, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00038">integer_search.cc:38</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a3f4df9da99787316bfb5029b7a6b92b7"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3f4df9da99787316bfb5029b7a6b92b7">operations_research::sat::GreaterOrEqualToMiddleValue</a></div><div class="ttdeci">IntegerLiteral GreaterOrEqualToMiddleValue(IntegerVariable var, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00058">integer_search.cc:58</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a46cb4c07c4971a99724693260c92fd5b"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a46cb4c07c4971a99724693260c92fd5b">operations_research::sat::SplitAroundGivenValue</a></div><div class="ttdeci">IntegerLiteral SplitAroundGivenValue(IntegerVariable var, IntegerValue value, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00069">integer_search.cc:69</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a4713f8fb7e1ccddece18a374886ad866"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a4713f8fb7e1ccddece18a374886ad866">operations_research::sat::UnassignedVarWithLowestMinAtItsMinHeuristic</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> UnassignedVarWithLowestMinAtItsMinHeuristic(const std::vector< IntegerVariable > &vars, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00167">integer_search.cc:167</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a48d1aae59a778d6f39609f9add7cd0a5"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a48d1aae59a778d6f39609f9add7cd0a5">operations_research::sat::SolveIntegerProblemWithLazyEncoding</a></div><div class="ttdeci">SatSolver::Status SolveIntegerProblemWithLazyEncoding(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l01065">integer_search.cc:1065</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a527a6ee26b7f573def70daf9b2a9e577"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a527a6ee26b7f573def70daf9b2a9e577">operations_research::sat::SatSolverRestartPolicy</a></div><div class="ttdeci">std::function< bool()> SatSolverRestartPolicy(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00626">integer_search.cc:626</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a5bd8c44473618b7eafd33ba978db2f06"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">operations_research::sat::kNoIntegerVariable</a></div><div class="ttdeci">const IntegerVariable kNoIntegerVariable(-1)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a5c07862681284286ab67401730668f38"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5c07862681284286ab67401730668f38">operations_research::sat::FollowHint</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> FollowHint(const std::vector< BooleanOrIntegerVariable > &vars, const std::vector< IntegerValue > &values, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00582">integer_search.cc:582</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a5fcdf1d56a24d096d0c381a9708d4fa9"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5fcdf1d56a24d096d0c381a9708d4fa9">operations_research::sat::RestartEveryKFailures</a></div><div class="ttdeci">std::function< bool()> RestartEveryKFailures(int k, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00612">integer_search.cc:612</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a6c01e08a9089e0d5fed2507f479bbadc"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a6c01e08a9089e0d5fed2507f479bbadc">operations_research::sat::SchedulingSearchHeuristic</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> SchedulingSearchHeuristic(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00350">integer_search.cc:350</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a71fa416b44768076a0e7dd7777ab433d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a71fa416b44768076a0e7dd7777ab433d">operations_research::sat::ChooseBestObjectiveValue</a></div><div class="ttdeci">IntegerLiteral ChooseBestObjectiveValue(IntegerVariable var, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00046">integer_search.cc:46</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a7ac1d9dc3254d77ade7bdbf984884b7e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7ac1d9dc3254d77ade7bdbf984884b7e">operations_research::sat::ConfigureSearchHeuristics</a></div><div class="ttdeci">void ConfigureSearchHeuristics(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00640">integer_search.cc:640</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a872297a32bd1f4a91bbcebd1c47b3751"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a872297a32bd1f4a91bbcebd1c47b3751">operations_research::sat::SplitDomainUsingBestSolutionValue</a></div><div class="ttdeci">IntegerLiteral SplitDomainUsingBestSolutionValue(IntegerVariable var, Model *model)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a88ab44e20ce09e9942f6b8411452df27"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a88ab44e20ce09e9942f6b8411452df27">operations_research::sat::IntegerValueSelectionHeuristic</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> IntegerValueSelectionHeuristic(std::function< BooleanOrIntegerLiteral()> var_selection_heuristic, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00258">integer_search.cc:258</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a8bea9a6a0de60c8fdab99ad7dfdf8498"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8bea9a6a0de60c8fdab99ad7dfdf8498">operations_research::sat::SolveIntegerProblem</a></div><div class="ttdeci">SatSolver::Status SolveIntegerProblem(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00900">integer_search.cc:900</a></div></div>
|
|
<div class="ttc" id="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#l00315">integer_search.cc:315</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_abb234c348ddabb307c1170b3e4c7f2b9"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#abb234c348ddabb307c1170b3e4c7f2b9">operations_research::sat::ContinuousProbing</a></div><div class="ttdeci">SatSolver::Status ContinuousProbing(const std::vector< BooleanVariable > &bool_vars, const std::vector< IntegerVariable > &int_vars, const std::function< void()> &feasible_solution_observer, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l01082">integer_search.cc:1082</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ac0774a1df651b83339b00fee0bde1cd8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ac0774a1df651b83339b00fee0bde1cd8">operations_research::sat::SplitAroundLpValue</a></div><div class="ttdeci">IntegerLiteral SplitAroundLpValue(IntegerVariable var, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00097">integer_search.cc:97</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_add67896a84f6372a648154c5770a0ae0"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#add67896a84f6372a648154c5770a0ae0">operations_research::sat::kNoBooleanVariable</a></div><div class="ttdeci">const BooleanVariable kNoBooleanVariable(-1)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aeaaccdd218e3f0aa5c218d3a0cc5c3f1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aeaaccdd218e3f0aa5c218d3a0cc5c3f1">operations_research::sat::LinearizedPartIsLarge</a></div><div class="ttdeci">bool LinearizedPartIsLarge(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00245">integer_search.cc:245</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aefab46ecc02eb059ed853ee0213be7fb"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aefab46ecc02eb059ed853ee0213be7fb">operations_research::sat::PseudoCost</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> PseudoCost(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00328">integer_search.cc:328</a></div></div>
|
|
<div class="ttc" id="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="apack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00509">pack.cc:509</a></div></div>
|
|
<div class="ttc" id="apseudo__costs_8h_html"><div class="ttname"><a href="pseudo__costs_8h.html">pseudo_costs.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__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
|
|
<div class="ttc" id="astructoperations__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="astructoperations__research_1_1sat_1_1_boolean_or_integer_literal_html_a3c6f3ae96a90c7fcef34dd0f1ce0297e"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#a3c6f3ae96a90c7fcef34dd0f1ce0297e">operations_research::sat::BooleanOrIntegerLiteral::boolean_literal_index</a></div><div class="ttdeci">LiteralIndex boolean_literal_index</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00053">integer_search.h:53</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_boolean_or_integer_literal_html_a706766402ca4c78519e6c10eb76c8db3"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#a706766402ca4c78519e6c10eb76c8db3">operations_research::sat::BooleanOrIntegerLiteral::BooleanOrIntegerLiteral</a></div><div class="ttdeci">BooleanOrIntegerLiteral(LiteralIndex index)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00043">integer_search.h:43</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_boolean_or_integer_literal_html_ae26b73bbf70dc88433be39df364ca7c1"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#ae26b73bbf70dc88433be39df364ca7c1">operations_research::sat::BooleanOrIntegerLiteral::HasValue</a></div><div class="ttdeci">bool HasValue() const</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00048">integer_search.h:48</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_boolean_or_integer_literal_html_ae524bf12eec388724545b7f47e3538ef"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#ae524bf12eec388724545b7f47e3538ef">operations_research::sat::BooleanOrIntegerLiteral::BooleanOrIntegerLiteral</a></div><div class="ttdeci">BooleanOrIntegerLiteral()</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00042">integer_search.h:42</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_boolean_or_integer_literal_html_aee356429e37f0750e38ee17ae1464a00"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#aee356429e37f0750e38ee17ae1464a00">operations_research::sat::BooleanOrIntegerLiteral::integer_literal</a></div><div class="ttdeci">IntegerLiteral integer_literal</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00054">integer_search.h:54</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_boolean_or_integer_literal_html_afcfb0c6902e66dba068a76719658550d"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_boolean_or_integer_literal.html#afcfb0c6902e66dba068a76719658550d">operations_research::sat::BooleanOrIntegerLiteral::BooleanOrIntegerLiteral</a></div><div class="ttdeci">BooleanOrIntegerLiteral(IntegerLiteral i_lit)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00045">integer_search.h:45</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_boolean_or_integer_variable_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_boolean_or_integer_variable.html">operations_research::sat::BooleanOrIntegerVariable</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00168">integer_search.h:168</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_boolean_or_integer_variable_html_aa5d493d0ceaa64f8e71d9aa540db7d90"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_boolean_or_integer_variable.html#aa5d493d0ceaa64f8e71d9aa540db7d90">operations_research::sat::BooleanOrIntegerVariable::bool_var</a></div><div class="ttdeci">BooleanVariable bool_var</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00169">integer_search.h:169</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_boolean_or_integer_variable_html_ae5143331fa20cd81b3339d4279826439"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_boolean_or_integer_variable.html#ae5143331fa20cd81b3339d4279826439">operations_research::sat::BooleanOrIntegerVariable::int_var</a></div><div class="ttdeci">IntegerVariable int_var</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00170">integer_search.h:170</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#l00168">integer.h:168</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_integer_literal_html_ab6516f556b715738034b30d290c40214"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#ab6516f556b715738034b30d290c40214">operations_research::sat::IntegerLiteral::var</a></div><div class="ttdeci">IntegerVariable var</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00211">integer.h:211</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_level_zero_callback_helper_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_level_zero_callback_helper.html">operations_research::sat::LevelZeroCallbackHelper</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00091">integer_search.h:91</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_level_zero_callback_helper_html_ac008fdb20ed4a9c84c490d4cbff755ac"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_level_zero_callback_helper.html#ac008fdb20ed4a9c84c490d4cbff755ac">operations_research::sat::LevelZeroCallbackHelper::callbacks</a></div><div class="ttdeci">std::vector< std::function< bool()> > callbacks</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00092">integer_search.h:92</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#l00062">integer_search.h:62</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_search_heuristics_html_a0d0b8f29f3557e2ee84f53b45d817e02"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_search_heuristics.html#a0d0b8f29f3557e2ee84f53b45d817e02">operations_research::sat::SearchHeuristics::restart_policies</a></div><div class="ttdeci">std::vector< std::function< bool()> > restart_policies</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00067">integer_search.h:67</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_search_heuristics_html_a3ef187fb1a44e4df4e66c2a59304000e"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_search_heuristics.html#a3ef187fb1a44e4df4e66c2a59304000e">operations_research::sat::SearchHeuristics::hint_search</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> hint_search</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00075">integer_search.h:75</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_search_heuristics_html_a984249b5c2efe8f16e6942b54be739a5"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_search_heuristics.html#a984249b5c2efe8f16e6942b54be739a5">operations_research::sat::SearchHeuristics::fixed_search</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> fixed_search</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00074">integer_search.h:74</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_search_heuristics_html_aa1668e07fb6607c61474310ad1045657"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_search_heuristics.html#aa1668e07fb6607c61474310ad1045657">operations_research::sat::SearchHeuristics::next_decision_override</a></div><div class="ttdeci">std::function< BooleanOrIntegerLiteral()> next_decision_override</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00080">integer_search.h:80</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_search_heuristics_html_af2155539e87804108c670c32478e123d"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_search_heuristics.html#af2155539e87804108c670c32478e123d">operations_research::sat::SearchHeuristics::policy_index</a></div><div class="ttdeci">int policy_index</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00070">integer_search.h:70</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_search_heuristics_html_af925e41205032e143d718455bfeede3c"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_search_heuristics.html#af925e41205032e143d718455bfeede3c">operations_research::sat::SearchHeuristics::decision_policies</a></div><div class="ttdeci">std::vector< std::function< BooleanOrIntegerLiteral()> > decision_policies</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8h_source.html#l00066">integer_search.h:66</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="integer__search_8h.html">integer_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.9.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|