866 lines
173 KiB
HTML
866 lines
173 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.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: bop_ls.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">8.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search','.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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('bop__ls_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">bop_ls.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="bop__ls_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// This file defines the needed classes to efficiently perform Local Search in</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// Bop.</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Local Search is a technique used to locally improve an existing solution by</span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// flipping a limited number of variables. To be successful the produced</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// solution has to satisfy all constraints of the problem and improve the</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">// objective cost.</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// The class BopLocalSearchOptimizer is the only public interface for Local</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// Search in Bop. For unit-testing purposes this file also contains the four</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// internal classes AssignmentAndConstraintFeasibilityMaintainer,</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">// OneFlipConstraintRepairer, SatWrapper and LocalSearchAssignmentIterator.</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// They are implementation details and should not be used outside of bop_ls.</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  </div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#ifndef OR_TOOLS_BOP_BOP_LS_H_</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#define OR_TOOLS_BOP_BOP_LS_H_</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  </div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include <array></span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  </div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include "absl/random/random.h"</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include "<a class="code" href="hash_8h.html">ortools/base/hash.h</a>"</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include "<a class="code" href="random_8h.html">ortools/base/random.h</a>"</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include "<a class="code" href="strong__vector_8h.html">ortools/base/strong_vector.h</a>"</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include "<a class="code" href="bop__base_8h.html">ortools/bop/bop_base.h</a>"</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include "<a class="code" href="bop__solution_8h.html">ortools/bop/bop_solution.h</a>"</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor">#include "<a class="code" href="bop__types_8h.html">ortools/bop/bop_types.h</a>"</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#include "<a class="code" href="boolean__problem_8pb_8h.html">ortools/sat/boolean_problem.pb.h</a>"</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#include "<a class="code" href="sat__solver_8h.html">ortools/sat/sat_solver.h</a>"</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  </div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="keyword">namespace </span>bop {</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  </div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// This class is used to ease the connection with the SAT solver.</span></div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// TODO(user): remove? the meat of the logic is used in just one place, so I am</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// not sure having this extra layer improve the readability.</span></div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_sat_wrapper.html"> 51</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html">SatWrapper</a> {</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a3adc33c0c8891314820bd37a91653694">SatWrapper</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">sat::SatSolver</a>* sat_solver);</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  </div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">// Returns the current state of the solver propagation trail.</span></div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  std::vector<sat::Literal> <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a72222e224336a01b889afd6cd47bee14">FullSatTrail</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  </div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// Returns true if the problem is UNSAT.</span></div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="comment">// Note that an UNSAT problem might not be marked as UNSAT at first because</span></div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// the SAT solver is not able to prove it; After some decisions / learned</span></div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// conflicts, the SAT solver might be able to prove UNSAT and so this will</span></div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">// return true.</span></div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#ad2a33e1d9335cce63548abed6b5c8aab"> 63</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#ad2a33e1d9335cce63548abed6b5c8aab">IsModelUnsat</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab">IsModelUnsat</a>(); }</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  </div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// Return the current solver VariablesAssignment.</span></div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a0e914f0d8a37ed15807b39948650a842"> 66</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html">sat::VariablesAssignment</a>& <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a0e914f0d8a37ed15807b39948650a842">SatAssignment</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">return</span> sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>();</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  }</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  </div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="comment">// Applies the decision that makes the given literal true and returns the</span></div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">// number of decisions to backtrack due to conflicts if any.</span></div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// Two cases:</span></div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// - No conflicts: Returns 0 and fills the propagated_literals with the</span></div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// literals that have been propagated due to the decision including the</span></div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">// the decision itself.</span></div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// - Conflicts: Returns the number of decisions to backtrack (the current</span></div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// decision included, i.e. returned value > 0) and fills the</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="comment">// propagated_literals with the literals that the conflicts propagated.</span></div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="comment">// Note that the decision variable should not be already assigned in SAT.</span></div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a93950a274a35f37cbe2a5a0932232da6">ApplyDecision</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">sat::Literal</a> decision_literal,</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  std::vector<sat::Literal>* propagated_literals);</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  </div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// Backtracks the last decision if any.</span></div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a5a82cd9f3923936066ceeb27a027fea6">BacktrackOneLevel</a>();</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  </div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// Bactracks all the decisions.</span></div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a66b3ae33b0200f399c9145d707ff7887">BacktrackAll</a>();</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  </div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="comment">// Extracts any new information learned during the search.</span></div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#aa808ac715d17a9e4891930daf5d3ac62">ExtractLearnedInfo</a>(<a class="code" href="structoperations__research_1_1bop_1_1_learned_info.html">LearnedInfo</a>* info);</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  </div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">// Returns a deterministic number that should be correlated with the time</span></div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// spent in the SAT wrapper. The order of magnitude should be close to the</span></div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// time in seconds.</span></div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#ae525d235b02bcfc962d845e28f5f0125">deterministic_time</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  </div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">sat::SatSolver</a>* sat_solver_;</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html">SatWrapper</a>);</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> };</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  </div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment">// Forward declaration.</span></div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="keyword">class </span>LocalSearchAssignmentIterator;</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  </div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment">// This class defines a Local Search optimizer. The goal is to find a new</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// solution with a better cost than the given solution by iterating on all</span></div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment">// assignments that can be reached in max_num_decisions decisions or less.</span></div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment">// The bop parameter max_number_of_explored_assignments_per_try_in_ls can be</span></div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// used to specify the number of new assignments to iterate on each time the</span></div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment">// method Optimize() is called. Limiting that parameter allows to reduce the</span></div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment">// time spent in the Optimize() method at once, and still explore all the</span></div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment">// reachable assignments (if Optimize() is called enough times).</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment">// Note that due to propagation, the number of variables with a different value</span></div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// in the new solution can be greater than max_num_decisions.</span></div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_local_search_optimizer.html"> 115</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1bop_1_1_local_search_optimizer.html">LocalSearchOptimizer</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html">BopOptimizerBase</a> {</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <a class="code" href="classoperations__research_1_1bop_1_1_local_search_optimizer.html#abd80d05b43433461f15ef74312679af6">LocalSearchOptimizer</a>(<span class="keyword">const</span> std::string& <a class="code" href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html#ad8227ba86a01f26e4f173cd5e219d5d1">name</a>, <span class="keywordtype">int</span> max_num_decisions,</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">sat::SatSolver</a>* sat_propagator);</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <a class="code" href="classoperations__research_1_1bop_1_1_local_search_optimizer.html#adccc3ffb94c7359656258de436e713c2">~LocalSearchOptimizer</a>() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  </div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordtype">bool</span> ShouldBeRun(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1bop_1_1_problem_state.html">ProblemState</a>& problem_state) <span class="keyword">const override</span>;</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <a class="code" href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">Status</a> Optimize(<span class="keyword">const</span> BopParameters& <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>,</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1bop_1_1_problem_state.html">ProblemState</a>& problem_state, <a class="code" href="structoperations__research_1_1bop_1_1_learned_info.html">LearnedInfo</a>* learned_info,</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  </div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> state_update_stamp_;</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  </div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="comment">// Maximum number of decisions the Local Search can take.</span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="comment">// Note that there is no limit on the number of changed variables due to</span></div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="comment">// propagation.</span></div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> max_num_decisions_;</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  </div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="comment">// A wrapper around the given sat_propagator.</span></div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html">SatWrapper</a> sat_wrapper_;</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  </div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="comment">// Iterator on all reachable assignments.</span></div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">// Note that this iterator is only reset when Synchronize() is called, i.e.</span></div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">// the iterator continues its iteration of the next assignments each time</span></div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">// Optimize() is called until everything is explored or a solution is found.</span></div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  std::unique_ptr<LocalSearchAssignmentIterator> assignment_iterator_;</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> };</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  </div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment">//------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// Implementation details. The declarations of those utility classes are in</span></div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment">// the .h for testing reasons.</span></div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment">//------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  </div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// Maintains some information on a sparse set of integers in [0, n). More</span></div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// specifically this class:</span></div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment">// - Allows to dynamically add/remove element from the set.</span></div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment">// - Has a backtracking support.</span></div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// - Maintains the number of elements in the set.</span></div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment">// - Maintains a superset of the elements of the set that contains all the</span></div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment">// modified elements.</span></div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="keyword">template</span> <<span class="keyword">typename</span> IntType></div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html"> 157</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html">BacktrackableIntegerSet</a> {</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#aaa644c003fae9e1c570e85eece6ea597"> 159</a></span>  <a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#aaa644c003fae9e1c570e85eece6ea597">BacktrackableIntegerSet</a>() {}</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  </div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="comment">// Prepares the class for integers in [0, n) and initializes the set to the</span></div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="comment">// empty one. Note that this run in O(n). Once resized, it is better to call</span></div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="comment">// BacktrackAll() instead of this to clear the set.</span></div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5402f12b02fec7bf270f3df4eed00e0c">ClearAndResize</a>(IntType n);</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  </div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// Changes the state of the given integer i to be either inside or outside the</span></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="comment">// set. Important: this should only be called with the opposite state of the</span></div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">// current one, otherwise size() will not be correct.</span></div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#aba10677c63ecfdabe3116c4e08c31aa1">ChangeState</a>(IntType i, <span class="keywordtype">bool</span> should_be_inside);</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  </div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="comment">// Returns the current number of elements in the set.</span></div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// Note that this is not its maximum size n.</span></div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#af9593d4a5ff4274efaf429cb4f9e57cc"> 173</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#af9593d4a5ff4274efaf429cb4f9e57cc">size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> size_; }</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  </div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="comment">// Returns a superset of the current set of integers.</span></div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a2cef754c519a5025a6b21c41082e1fef"> 176</a></span>  <span class="keyword">const</span> std::vector<IntType>& <a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a2cef754c519a5025a6b21c41082e1fef">Superset</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> stack_; }</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  </div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="comment">// BacktrackOneLevel() backtracks to the state the class was in when the</span></div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">// last AddBacktrackingLevel() was called. BacktrackAll() just restore the</span></div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="comment">// class to its state just after the last ClearAndResize().</span></div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5ddd49b322ff7e6a3b502ab8df60ce98">AddBacktrackingLevel</a>();</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5a82cd9f3923936066ceeb27a027fea6">BacktrackOneLevel</a>();</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a66b3ae33b0200f399c9145d707ff7887">BacktrackAll</a>();</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  </div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordtype">int</span> size_;</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  </div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">// Contains the elements whose status has been changed at least once.</span></div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  std::vector<IntType> stack_;</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  std::vector<bool> in_stack_;</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  </div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">// Used for backtracking. Contains the size_ and the stack_.size() at the time</span></div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="comment">// of each call to AddBacktrackingLevel() that is not yet backtracked over.</span></div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  std::vector<int> saved_sizes_;</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  std::vector<int> saved_stack_sizes_;</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span> };</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  </div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment">// A simple and efficient class to hash a given set of integers in [0, n).</span></div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment">// It uses O(n) memory and produces a good hash (random linear function).</span></div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="keyword">template</span> <<span class="keyword">typename</span> IntType></div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html"> 201</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html">NonOrderedSetHasher</a> {</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#a777cce5accc5ae0a8cea4ec88b26f9d7"> 203</a></span>  <a class="code" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#a777cce5accc5ae0a8cea4ec88b26f9d7">NonOrderedSetHasher</a>() : random_(<span class="stringliteral">"Random seed"</span>) {}</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  </div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="comment">// Initializes the NonOrderedSetHasher to hash sets of integer in [0, n).</span></div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#a5613775ea58662688e31056a3c7554be"> 206</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#a5613775ea58662688e31056a3c7554be">Initialize</a>(<span class="keywordtype">int</span> size) {</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  hashes_.<a class="code" href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(size);</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">for</span> (IntType i(0); i < size; ++i) {</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  hashes_[i] = random_.<a class="code" href="classoperations__research_1_1_a_c_m_random.html#a4255fd71a068483f3e6249282ac61b40">Rand64</a>();</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  }</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  }</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  </div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="comment">// Ignores the given set element in all subsequent hash computation. Note that</span></div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="comment">// this will be reset by the next call to Initialize().</span></div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#ab9c5d0014188ebd40f5eee23c2c77db3"> 215</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#ab9c5d0014188ebd40f5eee23c2c77db3">IgnoreElement</a>(IntType e) { hashes_[e] = 0; }</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  </div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="comment">// Returns the hash of the given set. The hash is independent of the set</span></div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">// order, but there must be no duplicate element in the set. This uses a</span></div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="comment">// simple random linear function which has really good hashing properties.</span></div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#abb732917fbdec3e61e513b984e67c5ec"> 220</a></span>  <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> <a class="code" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#abb732917fbdec3e61e513b984e67c5ec">Hash</a>(<span class="keyword">const</span> std::vector<IntType>& set)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> <a class="code" href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a> = 0;</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntType i : set) <a class="code" href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a> ^= hashes_[i];</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">return</span> <a class="code" href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a>;</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  }</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  </div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="comment">// The hash of a set is simply the XOR of all its elements. This allows</span></div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="comment">// to compute an hash incrementally or without the need of a vector<>.</span></div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#a2eccd8e8b229d0264eb5b50042ffe66a"> 228</a></span>  <a class="code" href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a> <a class="code" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#a2eccd8e8b229d0264eb5b50042ffe66a">Hash</a>(IntType e)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> hashes_[e]; }</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  </div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="comment">// Returns true if Initialize() has been called with a non-zero size.</span></div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#a475d2bd8072f3c9df7b37581c4f1eca4"> 231</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#a475d2bd8072f3c9df7b37581c4f1eca4">IsInitialized</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> !hashes_.<a class="code" href="classabsl_1_1_strong_vector.html#a644718bb2fb240de962dc3c9a1fdf0dc">empty</a>(); }</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  </div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <a class="code" href="classoperations__research_1_1_m_t_random.html">MTRandom</a> random_;</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntType, uint64></a> hashes_;</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span> };</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  </div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="comment">// This class is used to incrementally maintain an assignment and the</span></div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="comment">// feasibility of the constraints of a given LinearBooleanProblem.</span></div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span> <span class="comment">// The current assignment is initialized using a feasible reference solution,</span></div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span> <span class="comment">// i.e. the reference solution satisfies all the constraints of the problem.</span></div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span> <span class="comment">// The current assignment is updated using the Assign() method.</span></div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="comment">// Note that the current assignment is not a solution in the sense that it</span></div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="comment">// might not be feasible, ie. violates some constraints.</span></div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span> <span class="comment">// The assignment can be accessed at any time using Assignment().</span></div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="comment">// The set of infeasible constraints can be accessed at any time using</span></div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="comment">// PossiblyInfeasibleConstraints().</span></div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="comment">// Note that this class is reversible, i.e. it is possible to backtrack to</span></div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="comment">// previously added backtracking levels.</span></div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="comment">// levels. Consider for instance variable a, b, c, and d.</span></div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment">// Method called Assigned after method call</span></div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="comment">// 1- Assign({a, b}) a b</span></div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="comment">// 2- AddBacktrackingLevel() a b |</span></div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="comment">// 3- Assign({c}) a b | c</span></div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="comment">// 4- Assign({d}) a b | c d</span></div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment">// 5- BacktrackOneLevel() a b</span></div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment">// 6- Assign({c}) a b c</span></div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment">// 7- BacktrackOneLevel()</span></div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html"> 263</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html">AssignmentAndConstraintFeasibilityMaintainer</a> {</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="comment">// Note that the constraint indices used in this class are not the same as</span></div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="comment">// the one used in the given LinearBooleanProblem here.</span></div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a00f4006611a6be7146be3c212f390409">AssignmentAndConstraintFeasibilityMaintainer</a>(</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keyword">const</span> sat::LinearBooleanProblem& problem);</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  </div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="comment">// When we construct the problem, we treat the objective as one constraint.</span></div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="comment">// This is the index of this special "objective" constraint.</span></div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a6d42dda42beefd330e80ddb25d415a1e"> 272</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> ConstraintIndex <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a6d42dda42beefd330e80ddb25d415a1e">kObjectiveConstraint</a>;</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  </div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="comment">// Sets a new reference solution and reverts all internal structures to their</span></div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">// initial state. Note that the reference solution has to be feasible.</span></div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a7ca2c696b5f31c5e2e575dddd31c3917">SetReferenceSolution</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1bop_1_1_bop_solution.html">BopSolution</a>& reference_solution);</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  </div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">// Behaves exactly like SetReferenceSolution() where the passed reference</span></div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="comment">// is the current assignment held by this class. Note that the current</span></div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="comment">// assignment must be feasible (i.e. IsFeasible() is true).</span></div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a63bf1cee69906b012fad61969f94b5b7">UseCurrentStateAsReference</a>();</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  </div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="comment">// Assigns all literals. That updates the assignment, the constraint values,</span></div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="comment">// and the infeasible constraints.</span></div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="comment">// Note that the assignment of those literals can be reverted thanks to</span></div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="comment">// AddBacktrackingLevel() and BacktrackOneLevel().</span></div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="comment">// Note that a variable can't be assigned twice, even for the same literal.</span></div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#aec15c46ac9b8c2b89d91ccffdff6322a">Assign</a>(<span class="keyword">const</span> std::vector<sat::Literal>& literals);</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  </div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="comment">// Adds a new backtracking level to specify the state that will be restored</span></div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="comment">// by BacktrackOneLevel().</span></div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="comment">// See the example in the class comment.</span></div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a5ddd49b322ff7e6a3b502ab8df60ce98">AddBacktrackingLevel</a>();</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  </div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="comment">// Backtracks internal structures to the previous level defined by</span></div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="comment">// AddBacktrackingLevel(). As a consequence the state will be exactly as</span></div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="comment">// before the previous call to AddBacktrackingLevel().</span></div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="comment">// Note that backtracking the initial state has no effect.</span></div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a5a82cd9f3923936066ceeb27a027fea6">BacktrackOneLevel</a>();</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a66b3ae33b0200f399c9145d707ff7887">BacktrackAll</a>();</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  </div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="comment">// This returns the list of literal that appear in exactly all the current</span></div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="comment">// infeasible constraints (ignoring the objective) and correspond to a flip in</span></div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="comment">// a good direction for all the infeasible constraint. Performing this flip</span></div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="comment">// may repair the problem without any propagations.</span></div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="comment">// Important: The returned reference is only valid until the next</span></div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="comment">// PotentialOneFlipRepairs() call.</span></div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keyword">const</span> std::vector<sat::Literal>& <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#afb026df531740780a7e4ada516a0cfdf">PotentialOneFlipRepairs</a>();</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  </div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="comment">// Returns true if there is no infeasible constraint in the current state.</span></div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a894d87c5fddfc463c3ca3c779ba7f997"> 312</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a894d87c5fddfc463c3ca3c779ba7f997">IsFeasible</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> infeasible_constraint_set_.<a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#af9593d4a5ff4274efaf429cb4f9e57cc">size</a>() == 0; }</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  </div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="comment">// Returns the *exact* number of infeasible constraints.</span></div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="comment">// Note that PossiblyInfeasibleConstraints() will potentially return a larger</span></div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="comment">// number of constraints.</span></div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a6dce02aea549c1629b25b30c716faa6a"> 317</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a6dce02aea549c1629b25b30c716faa6a">NumInfeasibleConstraints</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordflow">return</span> infeasible_constraint_set_.<a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#af9593d4a5ff4274efaf429cb4f9e57cc">size</a>();</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  }</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  </div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="comment">// Returns a superset of all the infeasible constraints in the current state.</span></div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a418cbfcbd37be7119a3eb807b91b8caf"> 322</a></span>  <span class="keyword">const</span> std::vector<ConstraintIndex>& <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a418cbfcbd37be7119a3eb807b91b8caf">PossiblyInfeasibleConstraints</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordflow">return</span> infeasible_constraint_set_.<a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a2cef754c519a5025a6b21c41082e1fef">Superset</a>();</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  }</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  </div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="comment">// Returns the number of constraints of the problem, objective included,</span></div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="comment">// i.e. the number of constraint in the problem + 1.</span></div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a9117b996612a683ce794c5c2e250cf41"> 328</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a9117b996612a683ce794c5c2e250cf41">NumConstraints</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> constraint_lower_bounds_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>(); }</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  </div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="comment">// Returns the value of the var in the assignment.</span></div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="comment">// As the assignment is initialized with the reference solution, if the</span></div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="comment">// variable has not been assigned through Assign(), the returned value is</span></div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="comment">// the value of the variable in the reference solution.</span></div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#aba2b4531d3e07e40f22f2a40e527c7fd"> 334</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#aba2b4531d3e07e40f22f2a40e527c7fd">Assignment</a>(VariableIndex <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> assignment_.<a class="code" href="classoperations__research_1_1bop_1_1_bop_solution.html#a6cd00223d6f5614e7a88064c55fd6080">Value</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>); }</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  </div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="comment">// Returns the current assignment.</span></div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a0f82979a079f74b77326c9d95aa02434"> 337</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1bop_1_1_bop_solution.html">BopSolution</a>& <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a0f82979a079f74b77326c9d95aa02434">reference</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> reference_; }</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  </div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="comment">// Returns the lower bound of the constraint.</span></div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a2c61ed5387d5aea4b18cc222867db167"> 340</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a2c61ed5387d5aea4b18cc222867db167">ConstraintLowerBound</a>(ConstraintIndex constraint)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">return</span> constraint_lower_bounds_[constraint];</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  }</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  </div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="comment">// Returns the upper bound of the constraint.</span></div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a8e6c048efa518679165adb2b1795eb4a"> 345</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a8e6c048efa518679165adb2b1795eb4a">ConstraintUpperBound</a>(ConstraintIndex constraint)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">return</span> constraint_upper_bounds_[constraint];</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  }</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  </div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="comment">// Returns the value of the constraint. The value is computed using the</span></div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="comment">// variable values in the assignment. Note that a constraint is feasible iff</span></div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="comment">// its value is between its two bounds (inclusive).</span></div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#ac0722975b1eb23bbc040792588f97fd9"> 352</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#ac0722975b1eb23bbc040792588f97fd9">ConstraintValue</a>(ConstraintIndex constraint)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keywordflow">return</span> constraint_values_[constraint];</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  }</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  </div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="comment">// Returns true if the given constraint is currently feasible.</span></div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a9adc153e5f3b7c84fc529ec9f39ccc28"> 357</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a9adc153e5f3b7c84fc529ec9f39ccc28">ConstraintIsFeasible</a>(ConstraintIndex constraint)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> = <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#ac0722975b1eb23bbc040792588f97fd9">ConstraintValue</a>(constraint);</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordflow">return</span> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> >= <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a2c61ed5387d5aea4b18cc222867db167">ConstraintLowerBound</a>(constraint) &&</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> <= <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a8e6c048efa518679165adb2b1795eb4a">ConstraintUpperBound</a>(constraint);</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  }</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  </div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  std::string <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  </div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="comment">// This is lazily called by PotentialOneFlipRepairs() once.</span></div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordtype">void</span> InitializeConstraintSetHasher();</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  </div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="comment">// This is used by PotentialOneFlipRepairs(). It encodes a ConstraintIndex</span></div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="comment">// together with a "repair" direction depending on the bound that make a</span></div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="comment">// constraint infeasible. An "up" direction means that the constraint activity</span></div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="comment">// is lower than the lower bound and we need to make the activity move up to</span></div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="comment">// fix the infeasibility.</span></div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  DEFINE_INT_TYPE(ConstraintIndexWithDirection, <a class="code" href="integral__types_8h.html#a56f1a81c92849566ae864511088eb7e8">int32</a>);</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  ConstraintIndexWithDirection FromConstraintIndex(ConstraintIndex <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>,</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordtype">bool</span> up)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">return</span> ConstraintIndexWithDirection(2 * <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>.value() + (up ? 1 : 0));</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  }</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  </div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="comment">// Over constrains the objective cost by the given delta. This should only be</span></div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="comment">// called on a feasible reference solution and a fully backtracked state.</span></div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordtype">void</span> MakeObjectiveConstraintInfeasible(<span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>);</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  </div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="comment">// Local structure to represent the sparse matrix by variable used for fast</span></div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="comment">// update of the contraint values.</span></div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keyword">struct </span>ConstraintEntry {</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  ConstraintEntry(ConstraintIndex c, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> w) : constraint(c), <a class="code" href="pack_8cc.html#ae42ca38a167164c07831993889216903">weight</a>(w) {}</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  ConstraintIndex constraint;</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#ae42ca38a167164c07831993889216903">weight</a>;</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  };</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  </div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector</a><VariableIndex,</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<EntryIndex, ConstraintEntry></a>></div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  by_variable_matrix_;</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<ConstraintIndex, int64></a> constraint_lower_bounds_;</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<ConstraintIndex, int64></a> constraint_upper_bounds_;</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  </div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  BopSolution assignment_;</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  BopSolution reference_;</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  </div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<ConstraintIndex, int64></a> constraint_values_;</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  BacktrackableIntegerSet<ConstraintIndex> infeasible_constraint_set_;</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  </div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="comment">// This contains the list of variable flipped in assignment_.</span></div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="comment">// flipped_var_trail_backtrack_levels_[i-1] is the index in flipped_var_trail_</span></div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="comment">// of the first variable flipped after the i-th AddBacktrackingLevel() call.</span></div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  std::vector<int> flipped_var_trail_backtrack_levels_;</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  std::vector<VariableIndex> flipped_var_trail_;</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  </div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="comment">// Members used by PotentialOneFlipRepairs().</span></div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  std::vector<sat::Literal> tmp_potential_repairs_;</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  NonOrderedSetHasher<ConstraintIndexWithDirection> constraint_set_hasher_;</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  absl::flat_hash_map<uint64, std::vector<sat::Literal>></div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  hash_to_potential_repairs_;</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  </div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a00f4006611a6be7146be3c212f390409">AssignmentAndConstraintFeasibilityMaintainer</a>);</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span> };</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  </div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span> <span class="comment">// This class is an utility class used to select which infeasible constraint to</span></div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span> <span class="comment">// repair and identify one variable to flip to actually repair the constraint.</span></div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span> <span class="comment">// A constraint 'lb <= sum_i(w_i * x_i) <= ub', with 'lb' the lower bound,</span></div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="comment">// 'ub' the upper bound, 'w_i' the weight of the i-th term and 'x_i' the</span></div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="comment">// boolean variable appearing in the i-th term, is infeasible for a given</span></div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="comment">// assignment iff its value 'sum_i(w_i * x_i)' is outside of the bounds.</span></div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="comment">// Repairing-a-constraint-in-one-flip means making the constraint feasible by</span></div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="comment">// just flipping the value of one unassigned variable of the current assignment</span></div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="comment">// from the AssignmentAndConstraintFeasibilityMaintainer.</span></div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="comment">// For performance reasons, the pairs weight / variable (w_i, x_i) are stored</span></div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="comment">// in a sparse manner as a vector of terms (w_i, x_i). In the following the</span></div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="comment">// TermIndex term_index refers to the position of the term in the vector.</span></div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html"> 431</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html">OneFlipConstraintRepairer</a> {</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="comment">// Note that the constraint indices used in this class follow the same</span></div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="comment">// convention as the one used in the</span></div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="comment">// AssignmentAndConstraintFeasibilityMaintainer.</span></div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="comment">// TODO(user): maybe merge the two classes? maintaining this implicit indices</span></div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="comment">// convention between the two classes sounds like a bad idea.</span></div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#ad010399ca9c7a1621b92dbfd409f39b8">OneFlipConstraintRepairer</a>(</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keyword">const</span> sat::LinearBooleanProblem& problem,</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html">AssignmentAndConstraintFeasibilityMaintainer</a>& maintainer,</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html">sat::VariablesAssignment</a>& sat_assignment);</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  </div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#aef041a7abdb31fc3a000cf8fe185f500"> 444</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> ConstraintIndex <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#aef041a7abdb31fc3a000cf8fe185f500">kInvalidConstraint</a>;</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#ac6c337ac6e849eec72ab424f88d35902"> 445</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> TermIndex <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#ac6c337ac6e849eec72ab424f88d35902">kInitTerm</a>;</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a21bf120b74c559d10caaea8309742eef"> 446</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> TermIndex <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a21bf120b74c559d10caaea8309742eef">kInvalidTerm</a>;</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  </div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="comment">// Returns the index of a constraint to repair. This will always return the</span></div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="comment">// index of a constraint that can be repaired in one flip if there is one.</span></div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="comment">// Note however that if there is only one possible candidate, it will be</span></div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="comment">// returned without checking that it can indeed be repaired in one flip.</span></div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="comment">// This is because the later check can be expensive, and is not needed in our</span></div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="comment">// context.</span></div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  ConstraintIndex <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a3ec353a099d08e3d7632a849f9c73a54">ConstraintToRepair</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  </div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="comment">// Returns the index of the next term which repairs the constraint when the</span></div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="comment">// value of its variable is flipped. This method explores terms with an</span></div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="comment">// index strictly greater than start_term_index and then terms with an index</span></div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="comment">// smaller than or equal to init_term_index if any.</span></div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="comment">// Returns kInvalidTerm when no reparing terms are found.</span></div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="comment">// Note that if init_term_index == start_term_index, then all the terms will</span></div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="comment">// be explored. Both TermIndex arguments can take values in [-1, constraint</span></div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="comment">// size).</span></div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  TermIndex <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a5d0b9ffea8ed57b145ffbb1013f11e4b">NextRepairingTerm</a>(ConstraintIndex ct_index,</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  TermIndex init_term_index,</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  TermIndex start_term_index) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  </div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="comment">// Returns true if the constraint is infeasible and if flipping the variable</span></div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="comment">// at the given index will repair it.</span></div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a4650b705d23b018917acd5d41475090c">RepairIsValid</a>(ConstraintIndex ct_index, TermIndex term_index) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  </div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="comment">// Returns the literal formed by the variable at the given constraint term and</span></div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="comment">// assigned to the opposite value of this variable in the current assignment.</span></div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">sat::Literal</a> <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a015715e6448827ceac0b0cbbb4b7eaca">GetFlip</a>(ConstraintIndex ct_index, TermIndex term_index) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  </div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="comment">// Local structure to represent the sparse matrix by constraint used for fast</span></div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="comment">// lookups.</span></div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"><a class="line" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html"> 479</a></span>  <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html">ConstraintTerm</a> {</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"><a class="line" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#acccc950bdfbd34dd853c1229924ebebb"> 480</a></span>  <a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#acccc950bdfbd34dd853c1229924ebebb">ConstraintTerm</a>(VariableIndex v, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> w) : <a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#a40429d7fbb63c4c4a17dc9128fcea503">var</a>(v), <a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#ae42ca38a167164c07831993889216903">weight</a>(w) {}</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"><a class="line" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#a40429d7fbb63c4c4a17dc9128fcea503"> 481</a></span>  VariableIndex <a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#a40429d7fbb63c4c4a17dc9128fcea503">var</a>;</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"><a class="line" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#ae42ca38a167164c07831993889216903"> 482</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#ae42ca38a167164c07831993889216903">weight</a>;</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  };</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  </div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="comment">// Sorts the terms of each constraints in the by_constraint_matrix_ to iterate</span></div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="comment">// on most promising variables first.</span></div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordtype">void</span> SortTermsOfEachConstraints(<span class="keywordtype">int</span> num_variables);</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  </div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector</a><ConstraintIndex,</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<TermIndex, ConstraintTerm></a>></div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  by_constraint_matrix_;</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html">AssignmentAndConstraintFeasibilityMaintainer</a>& maintainer_;</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html">sat::VariablesAssignment</a>& sat_assignment_;</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  </div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html">OneFlipConstraintRepairer</a>);</div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span> };</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  </div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span> <span class="comment">// This class is used to iterate on all assignments that can be obtained by</span></div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span> <span class="comment">// deliberately flipping 'n' variables from the reference solution, 'n' being</span></div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span> <span class="comment">// smaller than or equal to max_num_decisions.</span></div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span> <span class="comment">// Note that one deliberate variable flip may lead to many other flips due to</span></div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span> <span class="comment">// constraint propagation, those additional flips are not counted in 'n'.</span></div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html"> 504</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html">LocalSearchAssignmentIterator</a> {</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a4c13a1377925d2ceefaea09f0c5747ff">LocalSearchAssignmentIterator</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1bop_1_1_problem_state.html">ProblemState</a>& problem_state,</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keywordtype">int</span> max_num_decisions,</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordtype">int</span> max_num_broken_constraints,</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html">SatWrapper</a>* sat_wrapper);</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a3910f2e32fea60320d748418ce5b263a">~LocalSearchAssignmentIterator</a>();</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  </div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="comment">// Parameters of the LS algorithm.</span></div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a5fff4dd0a189641f7b3702bbb73f2bbd"> 513</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a5fff4dd0a189641f7b3702bbb73f2bbd">UseTranspositionTable</a>(<span class="keywordtype">bool</span> v) { use_transposition_table_ = v; }</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a8f1bfe319bc18b89e2640d2ef1ec349a"> 514</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a8f1bfe319bc18b89e2640d2ef1ec349a">UsePotentialOneFlipRepairs</a>(<span class="keywordtype">bool</span> v) {</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  use_potential_one_flip_repairs_ = v;</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  }</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  </div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="comment">// Synchronizes the iterator with the problem state, e.g. set fixed variables,</span></div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="comment">// set the reference solution. Call this only when a new solution has been</span></div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="comment">// found. This will restart the LS.</span></div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a9f59c500f903e06edd072d136de593dd">Synchronize</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1bop_1_1_problem_state.html">ProblemState</a>& problem_state);</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  </div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="comment">// Synchronize the SatWrapper with our current search state. This needs to be</span></div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="comment">// called before calls to NextAssignment() if the underlying SatWrapper was</span></div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="comment">// used by someone else than this class.</span></div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a4870d904356fd0dd17fba66908bcf76b">SynchronizeSatWrapper</a>();</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  </div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="comment">// Move to the next assignment. Returns false when the search is finished.</span></div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#af283b6840eab8ab73202804b3bf0974b">NextAssignment</a>();</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  </div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="comment">// Returns the last feasible assignment.</span></div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#aef904b2f3010bffbd5e8fa35fdf2db63"> 532</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1bop_1_1_bop_solution.html">BopSolution</a>& <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#aef904b2f3010bffbd5e8fa35fdf2db63">LastReferenceAssignment</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordflow">return</span> maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a0f82979a079f74b77326c9d95aa02434">reference</a>();</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  }</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  </div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="comment">// Returns true if the current assignment has a better solution than the one</span></div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="comment">// passed to the last Synchronize() call.</span></div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#aef968fbdffce2e0ebe8fe66dc9a0922c"> 538</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#aef968fbdffce2e0ebe8fe66dc9a0922c">BetterSolutionHasBeenFound</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keywordflow">return</span> better_solution_has_been_found_;</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  }</div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  </div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="comment">// Returns a deterministic number that should be correlated with the time</span></div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="comment">// spent in the iterator. The order of magnitude should be close to the time</span></div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="comment">// in seconds.</span></div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#ae525d235b02bcfc962d845e28f5f0125">deterministic_time</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  </div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  std::string <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  </div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="comment">// This is called when a better solution has been found to restore the search</span></div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="comment">// to the new "root" node.</span></div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keywordtype">void</span> UseCurrentStateAsReference();</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  </div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="comment">// See transposition_table_ below.</span></div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keyword">static</span> constexpr <span class="keywordtype">size_t</span> kStoredMaxDecisions = 4;</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  </div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="comment">// Internal structure used to represent a node of the search tree during local</span></div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="comment">// search.</span></div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keyword">struct </span>SearchNode {</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  SearchNode()</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  : constraint(<a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html">OneFlipConstraintRepairer</a>::kInvalidConstraint),</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  term_index(<a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html">OneFlipConstraintRepairer</a>::kInvalidTerm) {}</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  SearchNode(ConstraintIndex c, TermIndex t) : constraint(c), term_index(t) {}</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  ConstraintIndex constraint;</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  TermIndex term_index;</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  };</div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  </div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="comment">// Applies the decision. Automatically backtracks when SAT detects conflicts.</span></div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keywordtype">void</span> ApplyDecision(sat::Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  </div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="comment">// Adds one more decision to repair infeasible constraints.</span></div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="comment">// Returns true in case of success.</span></div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keywordtype">bool</span> GoDeeper();</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  </div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="comment">// Backtracks and moves to the next decision in the search tree.</span></div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keywordtype">void</span> Backtrack();</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  </div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="comment">// Looks if the current decisions (in search_nodes_) plus the new one (given</span></div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="comment">// by l) lead to a position already present in transposition_table_.</span></div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keywordtype">bool</span> NewStateIsInTranspositionTable(sat::Literal l);</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  </div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="comment">// Inserts the current set of decisions in transposition_table_.</span></div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordtype">void</span> InsertInTranspositionTable();</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  </div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="comment">// Initializes the given array with the current decisions in search_nodes_ and</span></div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="comment">// by filling the other positions with 0.</span></div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordtype">void</span> InitializeTranspositionTableKey(</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  std::array<int32, kStoredMaxDecisions>* <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>);</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  </div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="comment">// Looks for the next repairing term in the given constraints while skipping</span></div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="comment">// the position already present in transposition_table_. A given TermIndex of</span></div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="comment">// -1 means that this is the first time we explore this constraint.</span></div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keywordtype">bool</span> EnqueueNextRepairingTermIfAny(ConstraintIndex ct_to_repair,</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  TermIndex <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  </div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> max_num_decisions_;</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> max_num_broken_constraints_;</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="keywordtype">bool</span> better_solution_has_been_found_;</div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  AssignmentAndConstraintFeasibilityMaintainer maintainer_;</div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  SatWrapper* <span class="keyword">const</span> sat_wrapper_;</div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  OneFlipConstraintRepairer repairer_;</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  std::vector<SearchNode> search_nodes_;</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<ConstraintIndex, TermIndex></a> initial_term_index_;</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  </div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="comment">// Temporary vector used by ApplyDecision().</span></div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  std::vector<sat::Literal> tmp_propagated_literals_;</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  </div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="comment">// For each set of explored decisions, we store it in this table so that we</span></div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="comment">// don't explore decisions (a, b) and later (b, a) for instance. The decisions</span></div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="comment">// are converted to int32, sorted and padded with 0 before beeing inserted</span></div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="comment">// here.</span></div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="comment">// TODO(user): We may still miss some equivalent states because it is possible</span></div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="comment">// that completely differents decisions lead to exactly the same state.</span></div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="comment">// However this is more time consuming to detect because we must apply the</span></div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="comment">// last decision first before trying to compare the states.</span></div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="comment">// TODO(user): Currently, we only store kStoredMaxDecisions or less decisions.</span></div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="comment">// Ideally, this should be related to the maximum number of decision in the</span></div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="comment">// LS, but that requires templating the whole LS optimizer.</span></div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="keywordtype">bool</span> use_transposition_table_;</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  absl::flat_hash_set<std::array<int32, kStoredMaxDecisions>></div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  transposition_table_;</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  </div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keywordtype">bool</span> use_potential_one_flip_repairs_;</div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  </div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="comment">// The number of explored nodes.</span></div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> num_nodes_;</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  </div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="comment">// The number of skipped nodes thanks to the transposition table.</span></div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> num_skipped_nodes_;</div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  </div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="comment">// The overall number of better solution found. And the ones found by the</span></div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="comment">// use_potential_one_flip_repairs_ heuristic.</span></div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> num_improvements_;</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> num_improvements_by_one_flip_repairs_;</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> num_inspected_one_flip_repairs_;</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  </div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a4c13a1377925d2ceefaea09f0c5747ff">LocalSearchAssignmentIterator</a>);</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span> };</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  </div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span> } <span class="comment">// namespace bop</span></div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span> <span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_BOP_BOP_LS_H_</span></div>
|
|
<div class="ttc" id="aboolean__problem_8pb_8h_html"><div class="ttname"><a href="boolean__problem_8pb_8h.html">boolean_problem.pb.h</a></div></div>
|
|
<div class="ttc" id="abop__base_8h_html"><div class="ttname"><a href="bop__base_8h.html">bop_base.h</a></div></div>
|
|
<div class="ttc" id="abop__solution_8h_html"><div class="ttname"><a href="bop__solution_8h.html">bop_solution.h</a></div></div>
|
|
<div class="ttc" id="abop__types_8h_html"><div class="ttname"><a href="bop__types_8h.html">bop_types.h</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector< IntType, uint64 ></a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_a4e3670a285a3642eaa07f66766cffa72"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">absl::StrongVector::resize</a></div><div class="ttdeci">void resize(size_type new_size)</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00150">strong_vector.h:150</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_a60304b65bf89363bcc3165d3cde67f86"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">absl::StrongVector::size</a></div><div class="ttdeci">size_type size() const</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00147">strong_vector.h:147</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_a644718bb2fb240de962dc3c9a1fdf0dc"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a644718bb2fb240de962dc3c9a1fdf0dc">absl::StrongVector::empty</a></div><div class="ttdeci">bool empty() const</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00156">strong_vector.h:156</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_a_c_m_random_html_a4255fd71a068483f3e6249282ac61b40"><div class="ttname"><a href="classoperations__research_1_1_a_c_m_random.html#a4255fd71a068483f3e6249282ac61b40">operations_research::ACMRandom::Rand64</a></div><div class="ttdeci">uint64 Rand64()</div><div class="ttdef"><b>Definition:</b> <a href="random_8h_source.html#l00033">random.h:33</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_t_random_html"><div class="ttname"><a href="classoperations__research_1_1_m_t_random.html">operations_research::MTRandom</a></div><div class="ttdef"><b>Definition:</b> <a href="random_8h_source.html#l00055">random.h:55</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html">operations_research::TimeLimit</a></div><div class="ttdoc">A simple class to enforce both an elapsed time limit and a deterministic time limit in the same threa...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00105">time_limit.h:105</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer</a></div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00263">bop_ls.h:263</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_a00f4006611a6be7146be3c212f390409"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a00f4006611a6be7146be3c212f390409">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::AssignmentAndConstraintFeasibilityMaintainer</a></div><div class="ttdeci">AssignmentAndConstraintFeasibilityMaintainer(const sat::LinearBooleanProblem &problem)</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00179">bop_ls.cc:180</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_a0f82979a079f74b77326c9d95aa02434"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a0f82979a079f74b77326c9d95aa02434">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::reference</a></div><div class="ttdeci">const BopSolution & reference() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00337">bop_ls.h:337</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_a2c61ed5387d5aea4b18cc222867db167"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a2c61ed5387d5aea4b18cc222867db167">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::ConstraintLowerBound</a></div><div class="ttdeci">int64 ConstraintLowerBound(ConstraintIndex constraint) const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00340">bop_ls.h:340</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_a418cbfcbd37be7119a3eb807b91b8caf"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a418cbfcbd37be7119a3eb807b91b8caf">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::PossiblyInfeasibleConstraints</a></div><div class="ttdeci">const std::vector< ConstraintIndex > & PossiblyInfeasibleConstraints() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00322">bop_ls.h:322</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_a5a82cd9f3923936066ceeb27a027fea6"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a5a82cd9f3923936066ceeb27a027fea6">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::BacktrackOneLevel</a></div><div class="ttdeci">void BacktrackOneLevel()</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00322">bop_ls.cc:322</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_a5ddd49b322ff7e6a3b502ab8df60ce98"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a5ddd49b322ff7e6a3b502ab8df60ce98">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::AddBacktrackingLevel</a></div><div class="ttdeci">void AddBacktrackingLevel()</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00317">bop_ls.cc:317</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_a63bf1cee69906b012fad61969f94b5b7"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a63bf1cee69906b012fad61969f94b5b7">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::UseCurrentStateAsReference</a></div><div class="ttdeci">void UseCurrentStateAsReference()</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00267">bop_ls.cc:268</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_a66b3ae33b0200f399c9145d707ff7887"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a66b3ae33b0200f399c9145d707ff7887">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::BacktrackAll</a></div><div class="ttdeci">void BacktrackAll()</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00340">bop_ls.cc:340</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_a6d42dda42beefd330e80ddb25d415a1e"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a6d42dda42beefd330e80ddb25d415a1e">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::kObjectiveConstraint</a></div><div class="ttdeci">static const ConstraintIndex kObjectiveConstraint</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00272">bop_ls.h:272</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_a6dce02aea549c1629b25b30c716faa6a"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a6dce02aea549c1629b25b30c716faa6a">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::NumInfeasibleConstraints</a></div><div class="ttdeci">int NumInfeasibleConstraints() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00317">bop_ls.h:317</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a764be64f3029f8b8e23511061d8de355">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00379">bop_ls.cc:379</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_a7ca2c696b5f31c5e2e575dddd31c3917"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a7ca2c696b5f31c5e2e575dddd31c3917">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::SetReferenceSolution</a></div><div class="ttdeci">void SetReferenceSolution(const BopSolution &reference_solution)</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00243">bop_ls.cc:243</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_a894d87c5fddfc463c3ca3c779ba7f997"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a894d87c5fddfc463c3ca3c779ba7f997">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::IsFeasible</a></div><div class="ttdeci">bool IsFeasible() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00312">bop_ls.h:312</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_a8e6c048efa518679165adb2b1795eb4a"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a8e6c048efa518679165adb2b1795eb4a">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::ConstraintUpperBound</a></div><div class="ttdeci">int64 ConstraintUpperBound(ConstraintIndex constraint) const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00345">bop_ls.h:345</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_a9117b996612a683ce794c5c2e250cf41"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a9117b996612a683ce794c5c2e250cf41">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::NumConstraints</a></div><div class="ttdeci">size_t NumConstraints() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00328">bop_ls.h:328</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_a9adc153e5f3b7c84fc529ec9f39ccc28"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a9adc153e5f3b7c84fc529ec9f39ccc28">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::ConstraintIsFeasible</a></div><div class="ttdeci">bool ConstraintIsFeasible(ConstraintIndex constraint) const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00357">bop_ls.h:357</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_aba2b4531d3e07e40f22f2a40e527c7fd"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#aba2b4531d3e07e40f22f2a40e527c7fd">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::Assignment</a></div><div class="ttdeci">bool Assignment(VariableIndex var) const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00334">bop_ls.h:334</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_ac0722975b1eb23bbc040792588f97fd9"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#ac0722975b1eb23bbc040792588f97fd9">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::ConstraintValue</a></div><div class="ttdeci">int64 ConstraintValue(ConstraintIndex constraint) const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00352">bop_ls.h:352</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_aec15c46ac9b8c2b89d91ccffdff6322a"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#aec15c46ac9b8c2b89d91ccffdff6322a">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::Assign</a></div><div class="ttdeci">void Assign(const std::vector< sat::Literal > &literals)</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00296">bop_ls.cc:296</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer_html_afb026df531740780a7e4ada516a0cfdf"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#afb026df531740780a7e4ada516a0cfdf">operations_research::bop::AssignmentAndConstraintFeasibilityMaintainer::PotentialOneFlipRepairs</a></div><div class="ttdeci">const std::vector< sat::Literal > & PotentialOneFlipRepairs()</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00345">bop_ls.cc:345</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_backtrackable_integer_set_html"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html">operations_research::bop::BacktrackableIntegerSet</a></div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00157">bop_ls.h:157</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_backtrackable_integer_set_html_a2cef754c519a5025a6b21c41082e1fef"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a2cef754c519a5025a6b21c41082e1fef">operations_research::bop::BacktrackableIntegerSet::Superset</a></div><div class="ttdeci">const std::vector< IntType > & Superset() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00176">bop_ls.h:176</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_backtrackable_integer_set_html_a5402f12b02fec7bf270f3df4eed00e0c"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5402f12b02fec7bf270f3df4eed00e0c">operations_research::bop::BacktrackableIntegerSet::ClearAndResize</a></div><div class="ttdeci">void ClearAndResize(IntType n)</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00121">bop_ls.cc:121</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_backtrackable_integer_set_html_a5a82cd9f3923936066ceeb27a027fea6"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5a82cd9f3923936066ceeb27a027fea6">operations_research::bop::BacktrackableIntegerSet::BacktrackOneLevel</a></div><div class="ttdeci">void BacktrackOneLevel()</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00146">bop_ls.cc:146</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_backtrackable_integer_set_html_a5ddd49b322ff7e6a3b502ab8df60ce98"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5ddd49b322ff7e6a3b502ab8df60ce98">operations_research::bop::BacktrackableIntegerSet::AddBacktrackingLevel</a></div><div class="ttdeci">void AddBacktrackingLevel()</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00140">bop_ls.cc:140</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_backtrackable_integer_set_html_a66b3ae33b0200f399c9145d707ff7887"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a66b3ae33b0200f399c9145d707ff7887">operations_research::bop::BacktrackableIntegerSet::BacktrackAll</a></div><div class="ttdeci">void BacktrackAll()</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00161">bop_ls.cc:161</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_backtrackable_integer_set_html_aaa644c003fae9e1c570e85eece6ea597"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#aaa644c003fae9e1c570e85eece6ea597">operations_research::bop::BacktrackableIntegerSet::BacktrackableIntegerSet</a></div><div class="ttdeci">BacktrackableIntegerSet()</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00159">bop_ls.h:159</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_backtrackable_integer_set_html_aba10677c63ecfdabe3116c4e08c31aa1"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#aba10677c63ecfdabe3116c4e08c31aa1">operations_research::bop::BacktrackableIntegerSet::ChangeState</a></div><div class="ttdeci">void ChangeState(IntType i, bool should_be_inside)</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00130">bop_ls.cc:130</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_backtrackable_integer_set_html_af9593d4a5ff4274efaf429cb4f9e57cc"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#af9593d4a5ff4274efaf429cb4f9e57cc">operations_research::bop::BacktrackableIntegerSet::size</a></div><div class="ttdeci">int size() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00173">bop_ls.h:173</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_bop_optimizer_base_html"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html">operations_research::bop::BopOptimizerBase</a></div><div class="ttdef"><b>Definition:</b> <a href="bop__base_8h_source.html#l00041">bop_base.h:41</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_bop_optimizer_base_html_a67a0db04d321a74b7e7fcfd3f1a3f70b"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">operations_research::bop::BopOptimizerBase::Status</a></div><div class="ttdeci">Status</div><div class="ttdef"><b>Definition:</b> <a href="bop__base_8h_source.html#l00062">bop_base.h:62</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_bop_optimizer_base_html_ad8227ba86a01f26e4f173cd5e219d5d1"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html#ad8227ba86a01f26e4f173cd5e219d5d1">operations_research::bop::BopOptimizerBase::name</a></div><div class="ttdeci">const std::string & name() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__base_8h_source.html#l00047">bop_base.h:47</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_bop_solution_html"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_bop_solution.html">operations_research::bop::BopSolution</a></div><div class="ttdef"><b>Definition:</b> <a href="bop__solution_8h_source.html#l00032">bop_solution.h:32</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_bop_solution_html_a6cd00223d6f5614e7a88064c55fd6080"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_bop_solution.html#a6cd00223d6f5614e7a88064c55fd6080">operations_research::bop::BopSolution::Value</a></div><div class="ttdeci">bool Value(VariableIndex var) const</div><div class="ttdef"><b>Definition:</b> <a href="bop__solution_8h_source.html#l00044">bop_solution.h:44</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_local_search_assignment_iterator_html"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html">operations_research::bop::LocalSearchAssignmentIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00504">bop_ls.h:504</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_local_search_assignment_iterator_html_a3910f2e32fea60320d748418ce5b263a"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a3910f2e32fea60320d748418ce5b263a">operations_research::bop::LocalSearchAssignmentIterator::~LocalSearchAssignmentIterator</a></div><div class="ttdeci">~LocalSearchAssignmentIterator()</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00695">bop_ls.cc:695</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_local_search_assignment_iterator_html_a4870d904356fd0dd17fba66908bcf76b"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a4870d904356fd0dd17fba66908bcf76b">operations_research::bop::LocalSearchAssignmentIterator::SynchronizeSatWrapper</a></div><div class="ttdeci">void SynchronizeSatWrapper()</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00720">bop_ls.cc:720</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_local_search_assignment_iterator_html_a4c13a1377925d2ceefaea09f0c5747ff"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a4c13a1377925d2ceefaea09f0c5747ff">operations_research::bop::LocalSearchAssignmentIterator::LocalSearchAssignmentIterator</a></div><div class="ttdeci">LocalSearchAssignmentIterator(const ProblemState &problem_state, int max_num_decisions, int max_num_broken_constraints, SatWrapper *sat_wrapper)</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00674">bop_ls.cc:674</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_local_search_assignment_iterator_html_a5fff4dd0a189641f7b3702bbb73f2bbd"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a5fff4dd0a189641f7b3702bbb73f2bbd">operations_research::bop::LocalSearchAssignmentIterator::UseTranspositionTable</a></div><div class="ttdeci">void UseTranspositionTable(bool v)</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00513">bop_ls.h:513</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_local_search_assignment_iterator_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a764be64f3029f8b8e23511061d8de355">operations_research::bop::LocalSearchAssignmentIterator::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00823">bop_ls.cc:823</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_local_search_assignment_iterator_html_a8f1bfe319bc18b89e2640d2ef1ec349a"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a8f1bfe319bc18b89e2640d2ef1ec349a">operations_research::bop::LocalSearchAssignmentIterator::UsePotentialOneFlipRepairs</a></div><div class="ttdeci">void UsePotentialOneFlipRepairs(bool v)</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00514">bop_ls.h:514</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_local_search_assignment_iterator_html_a9f59c500f903e06edd072d136de593dd"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a9f59c500f903e06edd072d136de593dd">operations_research::bop::LocalSearchAssignmentIterator::Synchronize</a></div><div class="ttdeci">void Synchronize(const ProblemState &problem_state)</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00704">bop_ls.cc:704</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_local_search_assignment_iterator_html_ae525d235b02bcfc962d845e28f5f0125"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#ae525d235b02bcfc962d845e28f5f0125">operations_research::bop::LocalSearchAssignmentIterator::deterministic_time</a></div><div class="ttdeci">double deterministic_time() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00819">bop_ls.cc:819</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_local_search_assignment_iterator_html_aef904b2f3010bffbd5e8fa35fdf2db63"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#aef904b2f3010bffbd5e8fa35fdf2db63">operations_research::bop::LocalSearchAssignmentIterator::LastReferenceAssignment</a></div><div class="ttdeci">const BopSolution & LastReferenceAssignment() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00532">bop_ls.h:532</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_local_search_assignment_iterator_html_aef968fbdffce2e0ebe8fe66dc9a0922c"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#aef968fbdffce2e0ebe8fe66dc9a0922c">operations_research::bop::LocalSearchAssignmentIterator::BetterSolutionHasBeenFound</a></div><div class="ttdeci">bool BetterSolutionHasBeenFound() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00538">bop_ls.h:538</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_local_search_assignment_iterator_html_af283b6840eab8ab73202804b3bf0974b"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#af283b6840eab8ab73202804b3bf0974b">operations_research::bop::LocalSearchAssignmentIterator::NextAssignment</a></div><div class="ttdeci">bool NextAssignment()</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00759">bop_ls.cc:759</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_local_search_optimizer_html"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_local_search_optimizer.html">operations_research::bop::LocalSearchOptimizer</a></div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00115">bop_ls.h:115</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_local_search_optimizer_html_abd80d05b43433461f15ef74312679af6"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_local_search_optimizer.html#abd80d05b43433461f15ef74312679af6">operations_research::bop::LocalSearchOptimizer::LocalSearchOptimizer</a></div><div class="ttdeci">LocalSearchOptimizer(const std::string &name, int max_num_decisions, sat::SatSolver *sat_propagator)</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00033">bop_ls.cc:33</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_local_search_optimizer_html_adccc3ffb94c7359656258de436e713c2"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_local_search_optimizer.html#adccc3ffb94c7359656258de436e713c2">operations_research::bop::LocalSearchOptimizer::~LocalSearchOptimizer</a></div><div class="ttdeci">~LocalSearchOptimizer() override</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00042">bop_ls.cc:42</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_non_ordered_set_hasher_html"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html">operations_research::bop::NonOrderedSetHasher</a></div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00201">bop_ls.h:201</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_non_ordered_set_hasher_html_a2eccd8e8b229d0264eb5b50042ffe66a"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#a2eccd8e8b229d0264eb5b50042ffe66a">operations_research::bop::NonOrderedSetHasher::Hash</a></div><div class="ttdeci">uint64 Hash(IntType e) const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00228">bop_ls.h:228</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_non_ordered_set_hasher_html_a475d2bd8072f3c9df7b37581c4f1eca4"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#a475d2bd8072f3c9df7b37581c4f1eca4">operations_research::bop::NonOrderedSetHasher::IsInitialized</a></div><div class="ttdeci">bool IsInitialized() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00231">bop_ls.h:231</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_non_ordered_set_hasher_html_a5613775ea58662688e31056a3c7554be"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#a5613775ea58662688e31056a3c7554be">operations_research::bop::NonOrderedSetHasher::Initialize</a></div><div class="ttdeci">void Initialize(int size)</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00206">bop_ls.h:206</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_non_ordered_set_hasher_html_a777cce5accc5ae0a8cea4ec88b26f9d7"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#a777cce5accc5ae0a8cea4ec88b26f9d7">operations_research::bop::NonOrderedSetHasher::NonOrderedSetHasher</a></div><div class="ttdeci">NonOrderedSetHasher()</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00203">bop_ls.h:203</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_non_ordered_set_hasher_html_ab9c5d0014188ebd40f5eee23c2c77db3"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#ab9c5d0014188ebd40f5eee23c2c77db3">operations_research::bop::NonOrderedSetHasher::IgnoreElement</a></div><div class="ttdeci">void IgnoreElement(IntType e)</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00215">bop_ls.h:215</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_non_ordered_set_hasher_html_abb732917fbdec3e61e513b984e67c5ec"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#abb732917fbdec3e61e513b984e67c5ec">operations_research::bop::NonOrderedSetHasher::Hash</a></div><div class="ttdeci">uint64 Hash(const std::vector< IntType > &set) const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00220">bop_ls.h:220</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_one_flip_constraint_repairer_html"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html">operations_research::bop::OneFlipConstraintRepairer</a></div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00431">bop_ls.h:431</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_one_flip_constraint_repairer_html_a015715e6448827ceac0b0cbbb4b7eaca"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a015715e6448827ceac0b0cbbb4b7eaca">operations_research::bop::OneFlipConstraintRepairer::GetFlip</a></div><div class="ttdeci">sat::Literal GetFlip(ConstraintIndex ct_index, TermIndex term_index) const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00589">bop_ls.cc:589</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_one_flip_constraint_repairer_html_a21bf120b74c559d10caaea8309742eef"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a21bf120b74c559d10caaea8309742eef">operations_research::bop::OneFlipConstraintRepairer::kInvalidTerm</a></div><div class="ttdeci">static const TermIndex kInvalidTerm</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00446">bop_ls.h:446</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_one_flip_constraint_repairer_html_a3ec353a099d08e3d7632a849f9c73a54"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a3ec353a099d08e3d7632a849f9c73a54">operations_research::bop::OneFlipConstraintRepairer::ConstraintToRepair</a></div><div class="ttdeci">ConstraintIndex ConstraintToRepair() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00489">bop_ls.cc:489</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_one_flip_constraint_repairer_html_a4650b705d23b018917acd5d41475090c"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a4650b705d23b018917acd5d41475090c">operations_research::bop::OneFlipConstraintRepairer::RepairIsValid</a></div><div class="ttdeci">bool RepairIsValid(ConstraintIndex ct_index, TermIndex term_index) const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00572">bop_ls.cc:572</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_one_flip_constraint_repairer_html_a5d0b9ffea8ed57b145ffbb1013f11e4b"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a5d0b9ffea8ed57b145ffbb1013f11e4b">operations_research::bop::OneFlipConstraintRepairer::NextRepairingTerm</a></div><div class="ttdeci">TermIndex NextRepairingTerm(ConstraintIndex ct_index, TermIndex init_term_index, TermIndex start_term_index) const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00542">bop_ls.cc:542</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_one_flip_constraint_repairer_html_ac6c337ac6e849eec72ab424f88d35902"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#ac6c337ac6e849eec72ab424f88d35902">operations_research::bop::OneFlipConstraintRepairer::kInitTerm</a></div><div class="ttdeci">static const TermIndex kInitTerm</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00445">bop_ls.h:445</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_one_flip_constraint_repairer_html_ad010399ca9c7a1621b92dbfd409f39b8"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#ad010399ca9c7a1621b92dbfd409f39b8">operations_research::bop::OneFlipConstraintRepairer::OneFlipConstraintRepairer</a></div><div class="ttdeci">OneFlipConstraintRepairer(const sat::LinearBooleanProblem &problem, const AssignmentAndConstraintFeasibilityMaintainer &maintainer, const sat::VariablesAssignment &sat_assignment)</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00437">bop_ls.cc:437</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_one_flip_constraint_repairer_html_aef041a7abdb31fc3a000cf8fe185f500"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#aef041a7abdb31fc3a000cf8fe185f500">operations_research::bop::OneFlipConstraintRepairer::kInvalidConstraint</a></div><div class="ttdeci">static const ConstraintIndex kInvalidConstraint</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00444">bop_ls.h:444</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_problem_state_html"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_problem_state.html">operations_research::bop::ProblemState</a></div><div class="ttdef"><b>Definition:</b> <a href="bop__base_8h_source.html#l00112">bop_base.h:112</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_sat_wrapper_html"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_sat_wrapper.html">operations_research::bop::SatWrapper</a></div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00051">bop_ls.h:51</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_sat_wrapper_html_a0e914f0d8a37ed15807b39948650a842"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a0e914f0d8a37ed15807b39948650a842">operations_research::bop::SatWrapper::SatAssignment</a></div><div class="ttdeci">const sat::VariablesAssignment & SatAssignment() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00066">bop_ls.h:66</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_sat_wrapper_html_a3adc33c0c8891314820bd37a91653694"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a3adc33c0c8891314820bd37a91653694">operations_research::bop::SatWrapper::SatWrapper</a></div><div class="ttdeci">SatWrapper(sat::SatSolver *sat_solver)</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00616">bop_ls.cc:616</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_sat_wrapper_html_a5a82cd9f3923936066ceeb27a027fea6"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a5a82cd9f3923936066ceeb27a027fea6">operations_research::bop::SatWrapper::BacktrackOneLevel</a></div><div class="ttdeci">void BacktrackOneLevel()</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00655">bop_ls.cc:655</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_sat_wrapper_html_a66b3ae33b0200f399c9145d707ff7887"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a66b3ae33b0200f399c9145d707ff7887">operations_research::bop::SatWrapper::BacktrackAll</a></div><div class="ttdeci">void BacktrackAll()</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00618">bop_ls.cc:618</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_sat_wrapper_html_a72222e224336a01b889afd6cd47bee14"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a72222e224336a01b889afd6cd47bee14">operations_research::bop::SatWrapper::FullSatTrail</a></div><div class="ttdeci">std::vector< sat::Literal > FullSatTrail() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00620">bop_ls.cc:620</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_sat_wrapper_html_a93950a274a35f37cbe2a5a0932232da6"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a93950a274a35f37cbe2a5a0932232da6">operations_research::bop::SatWrapper::ApplyDecision</a></div><div class="ttdeci">int ApplyDecision(sat::Literal decision_literal, std::vector< sat::Literal > *propagated_literals)</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00629">bop_ls.cc:629</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_sat_wrapper_html_aa808ac715d17a9e4891930daf5d3ac62"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_sat_wrapper.html#aa808ac715d17a9e4891930daf5d3ac62">operations_research::bop::SatWrapper::ExtractLearnedInfo</a></div><div class="ttdeci">void ExtractLearnedInfo(LearnedInfo *info)</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00662">bop_ls.cc:662</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_sat_wrapper_html_ad2a33e1d9335cce63548abed6b5c8aab"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_sat_wrapper.html#ad2a33e1d9335cce63548abed6b5c8aab">operations_research::bop::SatWrapper::IsModelUnsat</a></div><div class="ttdeci">bool IsModelUnsat() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00063">bop_ls.h:63</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_sat_wrapper_html_ae525d235b02bcfc962d845e28f5f0125"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_sat_wrapper.html#ae525d235b02bcfc962d845e28f5f0125">operations_research::bop::SatWrapper::deterministic_time</a></div><div class="ttdeci">double deterministic_time() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8cc_source.html#l00666">bop_ls.cc:666</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#l00064">sat_base.h:64</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#l00057">sat_solver.h:57</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a9789bf03dba611e9be5679d6e902d0c8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">operations_research::sat::SatSolver::Assignment</a></div><div class="ttdeci">const VariablesAssignment & Assignment() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00362">sat_solver.h:362</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_ad2a33e1d9335cce63548abed6b5c8aab"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab">operations_research::sat::SatSolver::IsModelUnsat</a></div><div class="ttdeci">bool IsModelUnsat() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00136">sat_solver.h:136</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html">operations_research::sat::VariablesAssignment</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00122">sat_base.h:122</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_af730895c6c6ef6e03caaf6251192dfd2"><div class="ttname"><a href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a></div><div class="ttdeci">int64 a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00042">constraint_solver/table.cc:42</a></div></div>
|
|
<div class="ttc" id="acp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a></div><div class="ttdeci">SatParameters parameters</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00108">cp_model_fz_solver.cc:108</a></div></div>
|
|
<div class="ttc" id="acp__model__solver_8cc_html_ac3cf9db02b23ea1455b5ae6955d03e47"><div class="ttname"><a href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a></div><div class="ttdeci">SharedTimeLimit * time_limit</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02106">cp_model_solver.cc:2106</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a21edc7ca4cc5802c8779d68556bc09cf"><div class="ttname"><a href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a></div><div class="ttdeci">int64 value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="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#l01858">expr_array.cc:1858</a></div></div>
|
|
<div class="ttc" id="ahash_8h_html"><div class="ttname"><a href="hash_8h.html">hash.h</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a56f1a81c92849566ae864511088eb7e8"><div class="ttname"><a href="integral__types_8h.html#a56f1a81c92849566ae864511088eb7e8">int32</a></div><div class="ttdeci">int int32</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00033">integral_types.h:33</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_abc0f5bc07737e498f287334775dff2b6"><div class="ttname"><a href="integral__types_8h.html#abc0f5bc07737e498f287334775dff2b6">uint64</a></div><div class="ttdeci">uint64_t uint64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00039">integral_types.h:39</a></div></div>
|
|
<div class="ttc" id="amatrix__utils_8cc_html_ad96c5e641806a06a23e5d5b9fca20e89"><div class="ttname"><a href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a></div><div class="ttdeci">int64 hash</div><div class="ttdef"><b>Definition:</b> <a href="matrix__utils_8cc_source.html#l00060">matrix_utils.cc:60</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">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</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="aoptimization_8cc_html_af63dcc00f2023fdf498e0829e6fb8a6b"><div class="ttname"><a href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a></div><div class="ttdeci">Literal literal</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00084">optimization.cc:84</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#l00508">pack.cc:508</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_ae42ca38a167164c07831993889216903"><div class="ttname"><a href="pack_8cc.html#ae42ca38a167164c07831993889216903">weight</a></div><div class="ttdeci">int64 weight</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00509">pack.cc:509</a></div></div>
|
|
<div class="ttc" id="arandom_8h_html"><div class="ttname"><a href="random_8h.html">random.h</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_a73461c37822b6ebb75b54ba1a9ffb442"><div class="ttname"><a href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a></div><div class="ttdeci">int64 delta</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01684">resource.cc:1684</a></div></div>
|
|
<div class="ttc" id="asat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
|
|
<div class="ttc" id="astrong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1bop_1_1_learned_info_html"><div class="ttname"><a href="structoperations__research_1_1bop_1_1_learned_info.html">operations_research::bop::LearnedInfo</a></div><div class="ttdef"><b>Definition:</b> <a href="bop__base_8h_source.html#l00246">bop_base.h:246</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term_html"><div class="ttname"><a href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html">operations_research::bop::OneFlipConstraintRepairer::ConstraintTerm</a></div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00479">bop_ls.h:479</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term_html_a40429d7fbb63c4c4a17dc9128fcea503"><div class="ttname"><a href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#a40429d7fbb63c4c4a17dc9128fcea503">operations_research::bop::OneFlipConstraintRepairer::ConstraintTerm::var</a></div><div class="ttdeci">VariableIndex var</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00481">bop_ls.h:481</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term_html_acccc950bdfbd34dd853c1229924ebebb"><div class="ttname"><a href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#acccc950bdfbd34dd853c1229924ebebb">operations_research::bop::OneFlipConstraintRepairer::ConstraintTerm::ConstraintTerm</a></div><div class="ttdeci">ConstraintTerm(VariableIndex v, int64 w)</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00480">bop_ls.h:480</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term_html_ae42ca38a167164c07831993889216903"><div class="ttname"><a href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#ae42ca38a167164c07831993889216903">operations_research::bop::OneFlipConstraintRepairer::ConstraintTerm::weight</a></div><div class="ttdeci">int64 weight</div><div class="ttdef"><b>Definition:</b> <a href="bop__ls_8h_source.html#l00482">bop_ls.h:482</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_749f8352630e023f1ab8040461e5d795.html">bop</a></li><li class="navelem"><a class="el" href="bop__ls_8h.html">bop_ls.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.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|