1213 lines
244 KiB
HTML
1213 lines
244 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.20"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: bop_ls.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">8.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.20 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('bop__ls_8cc_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">bop_ls.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="bop__ls_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-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="preprocessor">#include "<a class="code" href="bop__ls_8h.html">ortools/bop/bop_ls.h</a>"</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  </div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include "absl/memory/memory.h"</span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include "absl/strings/str_format.h"</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</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="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include "<a class="code" href="bop__util_8h.html">ortools/bop/bop_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="boolean__problem_8h.html">ortools/sat/boolean_problem.h</a>"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>  </div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="keyword">namespace </span>bop {</div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  </div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> using ::operations_research::sat::LinearBooleanConstraint;</div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> using ::operations_research::sat::LinearBooleanProblem;</div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> using ::operations_research::sat::LinearObjective;</div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  </div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">//------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// LocalSearchOptimizer</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">//------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  </div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_local_search_optimizer.html#abd80d05b43433461f15ef74312679af6"> 33</a></span> <a class="code" href="classoperations__research_1_1bop_1_1_local_search_optimizer.html#abd80d05b43433461f15ef74312679af6">LocalSearchOptimizer::LocalSearchOptimizer</a>(<span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>,</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordtype">int</span> max_num_decisions,</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</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="l00036"></a><span class="lineno"> 36</span>  : <a class="code" href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html">BopOptimizerBase</a>(<a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>),</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  state_update_stamp_(<a class="code" href="classoperations__research_1_1bop_1_1_problem_state.html">ProblemState</a>::kInitialStampValue),</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  max_num_decisions_(max_num_decisions),</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  sat_wrapper_(sat_propagator),</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  assignment_iterator_() {}</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  </div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_local_search_optimizer.html#adccc3ffb94c7359656258de436e713c2"> 42</a></span> <a class="code" href="classoperations__research_1_1bop_1_1_local_search_optimizer.html#adccc3ffb94c7359656258de436e713c2">LocalSearchOptimizer::~LocalSearchOptimizer</a>() {}</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="keywordtype">bool</span> LocalSearchOptimizer::ShouldBeRun(</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <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 </span>{</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordflow">return</span> problem_state.<a class="code" href="classoperations__research_1_1bop_1_1_problem_state.html#ac59ff8f3b21bdac22c9c53a7d82ba3ec">solution</a>().<a class="code" href="classoperations__research_1_1bop_1_1_bop_solution.html#a894d87c5fddfc463c3ca3c779ba7f997">IsFeasible</a>();</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> }</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  </div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <a class="code" href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">BopOptimizerBase::Status</a> LocalSearchOptimizer::Optimize(</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">const</span> BopParameters& <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>, <span class="keyword">const</span> ProblemState& problem_state,</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  LearnedInfo* learned_info, <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>) {</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(learned_info != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a> != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  learned_info->Clear();</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  </div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">if</span> (assignment_iterator_ == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  assignment_iterator_ = absl::make_unique<LocalSearchAssignmentIterator>(</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  problem_state, max_num_decisions_,</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.max_num_broken_constraints_in_ls(), &sat_wrapper_);</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  }</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  </div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordflow">if</span> (state_update_stamp_ != problem_state.update_stamp()) {</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="comment">// We have a new problem_state.</span></div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  state_update_stamp_ = problem_state.update_stamp();</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  assignment_iterator_->Synchronize(problem_state);</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  }</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  assignment_iterator_->SynchronizeSatWrapper();</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>  <span class="keywordtype">double</span> prev_deterministic_time = assignment_iterator_->deterministic_time();</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  assignment_iterator_->UseTranspositionTable(</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.use_transposition_table_in_ls());</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  assignment_iterator_->UsePotentialOneFlipRepairs(</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.use_potential_one_flip_repairs_in_ls());</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> num_assignments_to_explore =</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.max_number_of_explored_assignments_per_try_in_ls();</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  </div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">while</span> (!<a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>->LimitReached() && num_assignments_to_explore > 0 &&</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  assignment_iterator_->NextAssignment()) {</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>->AdvanceDeterministicTime(</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  assignment_iterator_->deterministic_time() - prev_deterministic_time);</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  prev_deterministic_time = assignment_iterator_->deterministic_time();</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  --num_assignments_to_explore;</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">if</span> (sat_wrapper_.<a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#ad2a33e1d9335cce63548abed6b5c8aab">IsModelUnsat</a>()) {</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">// TODO(user): we do that all the time, return an UNSAT satus instead and</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// do this only once.</span></div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">return</span> problem_state.solution().IsFeasible()</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  ? <a class="code" href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae276c6d6c33441e7bc41f349a9ba39e2">BopOptimizerBase::OPTIMAL_SOLUTION_FOUND</a></div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  : <a class="code" href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">BopOptimizerBase::INFEASIBLE</a>;</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  }</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">// TODO(user): properly abort when we found a new solution and then finished</span></div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// the ls? note that this is minor.</span></div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  sat_wrapper_.<a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#aa808ac715d17a9e4891930daf5d3ac62">ExtractLearnedInfo</a>(learned_info);</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">if</span> (assignment_iterator_->BetterSolutionHasBeenFound()) {</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="comment">// TODO(user): simply use vector<bool> instead of a BopSolution internally.</span></div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  learned_info->solution = assignment_iterator_->LastReferenceAssignment();</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba22ebbfba03095f407fb90f5a363a384b">BopOptimizerBase::SOLUTION_FOUND</a>;</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  }</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>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>->LimitReached()) {</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// The time limit is reached without finding a solution.</span></div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">BopOptimizerBase::LIMIT_REACHED</a>;</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>  </div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">if</span> (num_assignments_to_explore <= 0) {</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// Explore the remaining assignments in a future call to Optimize().</span></div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba49959dd441dcda75d6898cf2c68fb374">BopOptimizerBase::CONTINUE</a>;</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  }</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  </div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="comment">// All assignments reachable in max_num_decisions_ or less have been explored,</span></div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">// don't call optimize() with the same initial solution again.</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba781ad2788df9e25c59a70894c7832096">BopOptimizerBase::ABORT</a>;</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> }</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  </div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment">//------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment">// BacktrackableIntegerSet</span></div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment">//------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  </div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="keyword">template</span> <<span class="keyword">typename</span> IntType></div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5402f12b02fec7bf270f3df4eed00e0c"> 121</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5402f12b02fec7bf270f3df4eed00e0c">BacktrackableIntegerSet<IntType>::ClearAndResize</a>(IntType n) {</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  size_ = 0;</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  saved_sizes_.clear();</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  saved_stack_sizes_.clear();</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  stack_.clear();</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  in_stack_.assign(n.value(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> }</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="keyword">template</span> <<span class="keyword">typename</span> IntType></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#aba10677c63ecfdabe3116c4e08c31aa1"> 130</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#aba10677c63ecfdabe3116c4e08c31aa1">BacktrackableIntegerSet<IntType>::ChangeState</a>(IntType i,</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordtype">bool</span> should_be_inside) {</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  size_ += should_be_inside ? 1 : -1;</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">if</span> (!in_stack_[i.value()]) {</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  in_stack_[i.value()] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  stack_.push_back(i);</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> }</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  </div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="keyword">template</span> <<span class="keyword">typename</span> IntType></div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5ddd49b322ff7e6a3b502ab8df60ce98"> 140</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5ddd49b322ff7e6a3b502ab8df60ce98">BacktrackableIntegerSet<IntType>::AddBacktrackingLevel</a>() {</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  saved_stack_sizes_.push_back(stack_.size());</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  saved_sizes_.push_back(size_);</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>  </div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="keyword">template</span> <<span class="keyword">typename</span> IntType></div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5a82cd9f3923936066ceeb27a027fea6"> 146</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5a82cd9f3923936066ceeb27a027fea6">BacktrackableIntegerSet<IntType>::BacktrackOneLevel</a>() {</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">if</span> (saved_stack_sizes_.empty()) {</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  BacktrackAll();</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = saved_stack_sizes_.back(); i < stack_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  in_stack_[stack_[i].value()] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  }</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  stack_.resize(saved_stack_sizes_.back());</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  saved_stack_sizes_.pop_back();</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  size_ = saved_sizes_.back();</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  saved_sizes_.pop_back();</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  }</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> }</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  </div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="keyword">template</span> <<span class="keyword">typename</span> IntType></div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a66b3ae33b0200f399c9145d707ff7887"> 161</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a66b3ae33b0200f399c9145d707ff7887">BacktrackableIntegerSet<IntType>::BacktrackAll</a>() {</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < stack_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  in_stack_[stack_[i].value()] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5402f12b02fec7bf270f3df4eed00e0c"> 164</a></span>  }</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  stack_.clear();</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  saved_stack_sizes_.clear();</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  size_ = 0;</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  saved_sizes_.clear();</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#aba10677c63ecfdabe3116c4e08c31aa1"> 169</a></span> }</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  </div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment">// Explicit instantiation of BacktrackableIntegerSet.</span></div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="comment">// TODO(user): move the code in a separate .h and -inl.h to avoid this.</span></div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="keyword">template</span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html">BacktrackableIntegerSet<ConstraintIndex></a>;</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">//------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="comment">// AssignmentAndConstraintFeasibilityMaintainer</span></div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="comment">//------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  </div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a00f4006611a6be7146be3c212f390409"> 179</a></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="l00180"></a><span class="lineno"> 180</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="l00181"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5ddd49b322ff7e6a3b502ab8df60ce98"> 181</a></span>  <span class="keyword">const</span> LinearBooleanProblem& problem)</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5a82cd9f3923936066ceeb27a027fea6"> 182</a></span>  : by_variable_matrix_(problem.num_variables()),</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a66b3ae33b0200f399c9145d707ff7887"> 183</a></span>  constraint_lower_bounds_(),</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  constraint_upper_bounds_(),</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  assignment_(problem, <span class="stringliteral">"Assignment"</span>),</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  reference_(problem, <span class="stringliteral">"Assignment"</span>),</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  constraint_values_(),</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  flipped_var_trail_backtrack_levels_(),</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  flipped_var_trail_() {</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// Add the objective constraint as the first constraint.</span></div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keyword">const</span> LinearObjective& objective = problem.objective();</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(objective.literals_size(), objective.coefficients_size());</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < objective.literals_size(); ++i) {</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(objective.literals(i), 0);</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(objective.coefficients(i), 0);</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>  <span class="keyword">const</span> VariableIndex <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>(objective.literals(i) - 1);</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#ae42ca38a167164c07831993889216903">weight</a> = objective.coefficients(i);</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  by_variable_matrix_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>].push_back(</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  ConstraintEntry(<a class="code" href="namespaceoperations__research_1_1sat.html#aca25bc3ffa54b3f2668c6eeddffd8d1d">kObjectiveConstraint</a>, <a class="code" href="pack_8cc.html#ae42ca38a167164c07831993889216903">weight</a>));</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  }</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  constraint_lower_bounds_.push_back(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>);</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  constraint_values_.push_back(0);</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  constraint_upper_bounds_.push_back(<a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>);</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  </div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="comment">// Add each constraint.</span></div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  ConstraintIndex num_constraints_with_objective(1);</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> LinearBooleanConstraint& constraint : problem.constraints()) {</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">if</span> (constraint.literals_size() <= 2) {</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="comment">// Infeasible binary constraints are automatically repaired by propagation</span></div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="comment">// (when possible). Then there are no needs to consider the binary</span></div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="comment">// constraints here, the propagation is delegated to the SAT propagator.</span></div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  }</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  </div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(constraint.literals_size(), constraint.coefficients_size());</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < constraint.literals_size(); ++i) {</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keyword">const</span> VariableIndex <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>(constraint.literals(i) - 1);</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#ae42ca38a167164c07831993889216903">weight</a> = constraint.coefficients(i);</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  by_variable_matrix_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>].push_back(</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  ConstraintEntry(num_constraints_with_objective, <a class="code" href="pack_8cc.html#ae42ca38a167164c07831993889216903">weight</a>));</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  }</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  constraint_lower_bounds_.push_back(</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  constraint.has_lower_bound() ? constraint.lower_bound() : <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>);</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  constraint_values_.push_back(0);</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  constraint_upper_bounds_.push_back(</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  constraint.has_upper_bound() ? constraint.upper_bound() : <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>);</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  </div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  ++num_constraints_with_objective;</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  }</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  </div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">// Initialize infeasible_constraint_set_;</span></div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  infeasible_constraint_set_.ClearAndResize(</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  ConstraintIndex(constraint_values_.size()));</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  </div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(constraint_values_.size(), constraint_lower_bounds_.size());</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(constraint_values_.size(), constraint_upper_bounds_.size());</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span> }</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  </div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="keyword">const</span> ConstraintIndex</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a6d42dda42beefd330e80ddb25d415a1e">AssignmentAndConstraintFeasibilityMaintainer::kObjectiveConstraint</a>(0);</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  </div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a7ca2c696b5f31c5e2e575dddd31c3917"> 243</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a7ca2c696b5f31c5e2e575dddd31c3917">AssignmentAndConstraintFeasibilityMaintainer::SetReferenceSolution</a>(</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <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="l00245"></a><span class="lineno"> 245</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(reference_solution.<a class="code" href="classoperations__research_1_1bop_1_1_bop_solution.html#a894d87c5fddfc463c3ca3c779ba7f997">IsFeasible</a>());</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  infeasible_constraint_set_.<a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a66b3ae33b0200f399c9145d707ff7887">BacktrackAll</a>();</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  </div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  assignment_ = reference_solution;</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  reference_ = assignment_;</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  flipped_var_trail_backtrack_levels_.clear();</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  flipped_var_trail_.clear();</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a5ddd49b322ff7e6a3b502ab8df60ce98">AddBacktrackingLevel</a>(); <span class="comment">// To handle initial propagation.</span></div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  </div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="comment">// Recompute the value of all constraints.</span></div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  constraint_values_.<a class="code" href="classabsl_1_1_strong_vector.html#a184fe69018ae421dcf31c964bfe40576">assign</a>(<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a9117b996612a683ce794c5c2e250cf41">NumConstraints</a>(), 0);</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keywordflow">for</span> (VariableIndex <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>(0); <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> < assignment_.<a class="code" href="classoperations__research_1_1bop_1_1_bop_solution.html#a58f4b9e873b7c1c7d512bd9f7d1489d8">Size</a>(); ++<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">if</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="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ConstraintEntry& entry : by_variable_matrix_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]) {</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  constraint_values_[entry.constraint] += entry.weight;</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  }</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  }</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  }</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  </div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  MakeObjectiveConstraintInfeasible(1);</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span> }</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  </div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a63bf1cee69906b012fad61969f94b5b7"> 267</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a63bf1cee69906b012fad61969f94b5b7">AssignmentAndConstraintFeasibilityMaintainer::</a></div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</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="l00269"></a><span class="lineno"> 269</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> VariableIndex <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : flipped_var_trail_) {</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  reference_.<a class="code" href="classoperations__research_1_1bop_1_1_bop_solution.html#a157d7e03cf5ef624646b9a0a80912abc">SetValue</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, 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="l00271"></a><span class="lineno"> 271</span>  }</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  flipped_var_trail_.clear();</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  flipped_var_trail_backtrack_levels_.clear();</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a5ddd49b322ff7e6a3b502ab8df60ce98">AddBacktrackingLevel</a>(); <span class="comment">// To handle initial propagation.</span></div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  MakeObjectiveConstraintInfeasible(1);</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span> }</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  </div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span> <span class="keywordtype">void</span> AssignmentAndConstraintFeasibilityMaintainer::</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  MakeObjectiveConstraintInfeasible(<span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>) {</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a894d87c5fddfc463c3ca3c779ba7f997">IsFeasible</a>());</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(flipped_var_trail_.empty());</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  constraint_upper_bounds_[<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="l00283"></a><span class="lineno"> 283</span>  constraint_values_[<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a6d42dda42beefd330e80ddb25d415a1e">kObjectiveConstraint</a>] - <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>;</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  infeasible_constraint_set_.<a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a66b3ae33b0200f399c9145d707ff7887">BacktrackAll</a>();</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  infeasible_constraint_set_.<a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#aba10677c63ecfdabe3116c4e08c31aa1">ChangeState</a>(<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a6d42dda42beefd330e80ddb25d415a1e">kObjectiveConstraint</a>, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  infeasible_constraint_set_.<a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5ddd49b322ff7e6a3b502ab8df60ce98">AddBacktrackingLevel</a>();</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a9adc153e5f3b7c84fc529ec9f39ccc28">ConstraintIsFeasible</a>(<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="l00288"></a><span class="lineno"> 288</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a894d87c5fddfc463c3ca3c779ba7f997">IsFeasible</a>());</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keywordflow">for</span> (ConstraintIndex <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>(1); <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> < <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a9117b996612a683ce794c5c2e250cf41">NumConstraints</a>(); ++<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>) {</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a9adc153e5f3b7c84fc529ec9f39ccc28">ConstraintIsFeasible</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>));</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  }</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  }</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>  </div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#aec15c46ac9b8c2b89d91ccffdff6322a"> 296</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#aec15c46ac9b8c2b89d91ccffdff6322a">AssignmentAndConstraintFeasibilityMaintainer::Assign</a>(</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keyword">const</span> std::vector<sat::Literal>& literals) {</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">sat::Literal</a>& <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : literals) {</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keyword">const</span> VariableIndex <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable().value());</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> = <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.IsPositive();</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordflow">if</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>) != <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>) {</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  flipped_var_trail_.push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  assignment_.<a class="code" href="classoperations__research_1_1bop_1_1_bop_solution.html#a157d7e03cf5ef624646b9a0a80912abc">SetValue</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>);</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ConstraintEntry& entry : by_variable_matrix_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]) {</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> was_feasible = <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a9adc153e5f3b7c84fc529ec9f39ccc28">ConstraintIsFeasible</a>(entry.constraint);</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  constraint_values_[entry.constraint] +=</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> ? entry.weight : -entry.weight;</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a9adc153e5f3b7c84fc529ec9f39ccc28">ConstraintIsFeasible</a>(entry.constraint) != was_feasible) {</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  infeasible_constraint_set_.<a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#aba10677c63ecfdabe3116c4e08c31aa1">ChangeState</a>(entry.constraint,</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  was_feasible);</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  }</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  }</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>  }</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span> }</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</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#a5ddd49b322ff7e6a3b502ab8df60ce98"> 317</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a5ddd49b322ff7e6a3b502ab8df60ce98">AssignmentAndConstraintFeasibilityMaintainer::AddBacktrackingLevel</a>() {</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  flipped_var_trail_backtrack_levels_.push_back(flipped_var_trail_.size());</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  infeasible_constraint_set_.<a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5ddd49b322ff7e6a3b502ab8df60ce98">AddBacktrackingLevel</a>();</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span> }</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  </div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a5a82cd9f3923936066ceeb27a027fea6"> 322</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a5a82cd9f3923936066ceeb27a027fea6">AssignmentAndConstraintFeasibilityMaintainer::BacktrackOneLevel</a>() {</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="comment">// Backtrack each literal of the last level.</span></div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = flipped_var_trail_backtrack_levels_.back();</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  i < flipped_var_trail_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keyword">const</span> VariableIndex <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>(flipped_var_trail_[i]);</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> new_value = !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="l00328"></a><span class="lineno"> 328</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(new_value, reference_.<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="l00329"></a><span class="lineno"> 329</span>  assignment_.<a class="code" href="classoperations__research_1_1bop_1_1_bop_solution.html#a157d7e03cf5ef624646b9a0a80912abc">SetValue</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, new_value);</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ConstraintEntry& entry : by_variable_matrix_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]) {</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  constraint_values_[entry.constraint] +=</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  new_value ? entry.weight : -entry.weight;</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  }</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  }</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  flipped_var_trail_.resize(flipped_var_trail_backtrack_levels_.back());</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  flipped_var_trail_backtrack_levels_.pop_back();</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  infeasible_constraint_set_.<a class="code" href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html#a5a82cd9f3923936066ceeb27a027fea6">BacktrackOneLevel</a>();</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>  </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#a66b3ae33b0200f399c9145d707ff7887"> 340</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a66b3ae33b0200f399c9145d707ff7887">AssignmentAndConstraintFeasibilityMaintainer::BacktrackAll</a>() {</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">while</span> (!flipped_var_trail_backtrack_levels_.empty()) <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="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="keyword">const</span> std::vector<sat::Literal>&</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#afb026df531740780a7e4ada516a0cfdf"> 345</a></span> <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#afb026df531740780a7e4ada516a0cfdf">AssignmentAndConstraintFeasibilityMaintainer::PotentialOneFlipRepairs</a>() {</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">if</span> (!constraint_set_hasher_.<a class="code" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#a475d2bd8072f3c9df7b37581c4f1eca4">IsInitialized</a>()) {</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  InitializeConstraintSetHasher();</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>  </div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="comment">// First, we compute the hash that a Literal should have in order to repair</span></div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="comment">// all the infeasible constraint (ignoring the objective).</span></div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="comment">// TODO(user): If this starts to show-up in a performance profile, we can</span></div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="comment">// easily maintain this hash incrementally.</span></div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</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="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ConstraintIndex ci : <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a418cbfcbd37be7119a3eb807b91b8caf">PossiblyInfeasibleConstraints</a>()) {</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</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>(ci);</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordflow">if</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>(ci)) {</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <a class="code" href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a> ^= constraint_set_hasher_.<a class="code" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#abb732917fbdec3e61e513b984e67c5ec">Hash</a>(FromConstraintIndex(ci, <span class="keyword">false</span>));</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</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>(ci)) {</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <a class="code" href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a> ^= constraint_set_hasher_.<a class="code" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#abb732917fbdec3e61e513b984e67c5ec">Hash</a>(FromConstraintIndex(ci, <span class="keyword">true</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>  }</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>  tmp_potential_repairs_.clear();</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keyword">const</span> <span class="keyword">auto</span> it = hash_to_potential_repairs_.find(<a class="code" href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a>);</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordflow">if</span> (it != hash_to_potential_repairs_.end()) {</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">sat::Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : it->second) {</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="comment">// We only returns the flips.</span></div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">if</span> (assignment_.<a class="code" href="classoperations__research_1_1bop_1_1_bop_solution.html#a6cd00223d6f5614e7a88064c55fd6080">Value</a>(VariableIndex(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable().value())) !=</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.IsPositive()) {</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  tmp_potential_repairs_.push_back(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  }</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  }</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  }</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordflow">return</span> tmp_potential_repairs_;</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span> }</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  </div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a764be64f3029f8b8e23511061d8de355"> 379</a></span> std::string <a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a764be64f3029f8b8e23511061d8de355">AssignmentAndConstraintFeasibilityMaintainer::DebugString</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  std::string str;</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  str += <span class="stringliteral">"curr: "</span>;</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordflow">for</span> (<span class="keywordtype">bool</span> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> : assignment_) {</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  str += <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> ? <span class="stringliteral">" 1 "</span> : <span class="stringliteral">" 0 "</span>;</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  }</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  str += <span class="stringliteral">"\nFlipped variables: "</span>;</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="comment">// TODO(user): show the backtrack levels.</span></div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> VariableIndex <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : flipped_var_trail_) {</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  str += absl::StrFormat(<span class="stringliteral">" %d"</span>, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>.value());</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  }</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  str += <span class="stringliteral">"\nmin curr max\n"</span>;</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordflow">for</span> (ConstraintIndex <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>(0); <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> < constraint_values_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>(); ++<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>) {</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordflow">if</span> (constraint_lower_bounds_[<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>] == <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>) {</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  str += absl::StrFormat(<span class="stringliteral">"- %d %d\n"</span>, constraint_values_[<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>],</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  constraint_upper_bounds_[<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>]);</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  str +=</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  absl::StrFormat(<span class="stringliteral">"%d %d %d\n"</span>, constraint_lower_bounds_[<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>],</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  constraint_values_[<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>], constraint_upper_bounds_[<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>]);</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  }</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>  <span class="keywordflow">return</span> str;</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span> }</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="keywordtype">void</span> AssignmentAndConstraintFeasibilityMaintainer::</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  InitializeConstraintSetHasher() {</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_constraints_with_objective = constraint_upper_bounds_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>();</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  </div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="comment">// Initialize the potential one flip repair. Note that we ignore the</span></div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="comment">// objective constraint completely so that we consider a repair even if the</span></div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="comment">// objective constraint is not infeasible.</span></div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  constraint_set_hasher_.<a class="code" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#a5613775ea58662688e31056a3c7554be">Initialize</a>(2 * num_constraints_with_objective);</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  constraint_set_hasher_.<a class="code" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#ab9c5d0014188ebd40f5eee23c2c77db3">IgnoreElement</a>(</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  FromConstraintIndex(<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a6d42dda42beefd330e80ddb25d415a1e">kObjectiveConstraint</a>, <span class="keyword">true</span>));</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  constraint_set_hasher_.<a class="code" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#ab9c5d0014188ebd40f5eee23c2c77db3">IgnoreElement</a>(</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  FromConstraintIndex(<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a6d42dda42beefd330e80ddb25d415a1e">kObjectiveConstraint</a>, <span class="keyword">false</span>));</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordflow">for</span> (VariableIndex <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>(0); <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> < by_variable_matrix_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>(); ++<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="comment">// We add two entries, one for a positive flip (from false to true) and one</span></div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="comment">// for a negative flip (from true to false).</span></div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">bool</span> flip_is_positive : {<span class="keyword">true</span>, <span class="keyword">false</span>}) {</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</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="l00421"></a><span class="lineno"> 421</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ConstraintEntry& entry : by_variable_matrix_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]) {</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> coeff_is_positive = entry.weight > 0;</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <a class="code" href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a> ^= constraint_set_hasher_.<a class="code" href="classoperations__research_1_1bop_1_1_non_ordered_set_hasher.html#abb732917fbdec3e61e513b984e67c5ec">Hash</a>(FromConstraintIndex(</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  entry.constraint,</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="comment">/*up=*/</span>flip_is_positive ? coeff_is_positive : !coeff_is_positive));</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  }</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  hash_to_potential_repairs_[<a class="code" href="matrix__utils_8cc.html#ad96c5e641806a06a23e5d5b9fca20e89">hash</a>].push_back(</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  sat::Literal(sat::BooleanVariable(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>.value()), flip_is_positive));</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  }</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  }</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span> }</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  </div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="comment">//------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span> <span class="comment">// OneFlipConstraintRepairer</span></div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span> <span class="comment">//------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  </div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#ad010399ca9c7a1621b92dbfd409f39b8"> 437</a></span> <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#ad010399ca9c7a1621b92dbfd409f39b8">OneFlipConstraintRepairer::OneFlipConstraintRepairer</a>(</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keyword">const</span> LinearBooleanProblem& problem,</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</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="l00440"></a><span class="lineno"> 440</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="l00441"></a><span class="lineno"> 441</span>  : by_constraint_matrix_(problem.constraints_size() + 1),</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  maintainer_(maintainer),</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  sat_assignment_(sat_assignment) {</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="comment">// Fill the by_constraint_matrix_.</span></div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="comment">// IMPORTANT: The order of the constraint needs to exactly match the one of</span></div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="comment">// the constraint in the AssignmentAndConstraintFeasibilityMaintainer.</span></div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  </div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="comment">// Add the objective constraint as the first constraint.</span></div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  ConstraintIndex num_constraint(0);</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keyword">const</span> LinearObjective& objective = problem.objective();</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(objective.literals_size(), objective.coefficients_size());</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < objective.literals_size(); ++i) {</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(objective.literals(i), 0);</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(objective.coefficients(i), 0);</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  </div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keyword">const</span> VariableIndex <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>(objective.literals(i) - 1);</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#ae42ca38a167164c07831993889216903">weight</a> = objective.coefficients(i);</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  by_constraint_matrix_[num_constraint].push_back(</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html">ConstraintTerm</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="pack_8cc.html#ae42ca38a167164c07831993889216903">weight</a>));</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  }</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  </div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="comment">// Add the non-binary problem constraints.</span></div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> LinearBooleanConstraint& constraint : problem.constraints()) {</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keywordflow">if</span> (constraint.literals_size() <= 2) {</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="comment">// Infeasible binary constraints are automatically repaired by propagation</span></div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="comment">// (when possible). Then there are no needs to consider the binary</span></div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="comment">// constraints here, the propagation is delegated to the SAT propagator.</span></div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  }</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  </div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  ++num_constraint;</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(constraint.literals_size(), constraint.coefficients_size());</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < constraint.literals_size(); ++i) {</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keyword">const</span> VariableIndex <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>(constraint.literals(i) - 1);</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#ae42ca38a167164c07831993889216903">weight</a> = constraint.coefficients(i);</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  by_constraint_matrix_[num_constraint].push_back(</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html">ConstraintTerm</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="pack_8cc.html#ae42ca38a167164c07831993889216903">weight</a>));</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  }</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  }</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  </div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  SortTermsOfEachConstraints(problem.num_variables());</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">const</span> ConstraintIndex <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#aef041a7abdb31fc3a000cf8fe185f500">OneFlipConstraintRepairer::kInvalidConstraint</a>(-1);</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span> <span class="keyword">const</span> TermIndex <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#ac6c337ac6e849eec72ab424f88d35902">OneFlipConstraintRepairer::kInitTerm</a>(-1);</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span> <span class="keyword">const</span> TermIndex <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a21bf120b74c559d10caaea8309742eef">OneFlipConstraintRepairer::kInvalidTerm</a>(-2);</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  </div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a3ec353a099d08e3d7632a849f9c73a54"> 489</a></span> ConstraintIndex <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a3ec353a099d08e3d7632a849f9c73a54">OneFlipConstraintRepairer::ConstraintToRepair</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  ConstraintIndex selected_ct = <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#aef041a7abdb31fc3a000cf8fe185f500">kInvalidConstraint</a>;</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <a class="code" href="integral__types_8h.html#a56f1a81c92849566ae864511088eb7e8">int32</a> selected_num_branches = <a class="code" href="integral__types_8h.html#ab0cfc59ab5792086f6f8b9234320fd33">kint32max</a>;</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="keywordtype">int</span> num_infeasible_constraints_left = maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a6dce02aea549c1629b25b30c716faa6a">NumInfeasibleConstraints</a>();</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  </div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="comment">// Optimization: We inspect the constraints in reverse order because the</span></div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="comment">// objective one will always be first (in our current code) and with some</span></div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="comment">// luck, we will break early instead of fully exploring it.</span></div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keyword">const</span> std::vector<ConstraintIndex>& infeasible_constraints =</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a418cbfcbd37be7119a3eb807b91b8caf">PossiblyInfeasibleConstraints</a>();</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = infeasible_constraints.size() - 1; <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> >= 0; --<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keyword">const</span> ConstraintIndex& i = infeasible_constraints[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keywordflow">if</span> (maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a9adc153e5f3b7c84fc529ec9f39ccc28">ConstraintIsFeasible</a>(i)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  --num_infeasible_constraints_left;</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  </div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="comment">// Optimization: We return the only candidate without inspecting it.</span></div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="comment">// This is critical at the beginning of the search or later if the only</span></div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="comment">// candidate is the objective constraint which can be really long.</span></div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keywordflow">if</span> (num_infeasible_constraints_left == 0 &&</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  selected_ct == <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#aef041a7abdb31fc3a000cf8fe185f500">kInvalidConstraint</a>) {</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keywordflow">return</span> i;</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  }</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="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> constraint_value = maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#ac0722975b1eb23bbc040792588f97fd9">ConstraintValue</a>(i);</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lb = maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a2c61ed5387d5aea4b18cc222867db167">ConstraintLowerBound</a>(i);</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> ub = maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a8e6c048efa518679165adb2b1795eb4a">ConstraintUpperBound</a>(i);</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  </div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <a class="code" href="integral__types_8h.html#a56f1a81c92849566ae864511088eb7e8">int32</a> num_branches = 0;</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html">ConstraintTerm</a>& term : by_constraint_matrix_[i]) {</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="keywordflow">if</span> (sat_assignment_.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  sat::BooleanVariable(term.var.value()))) {</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  }</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_value =</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  constraint_value +</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  (maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#aba2b4531d3e07e40f22f2a40e527c7fd">Assignment</a>(term.var) ? -term.weight : term.weight);</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keywordflow">if</span> (new_value >= lb && new_value <= ub) {</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  ++num_branches;</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordflow">if</span> (num_branches >= selected_num_branches) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  }</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  }</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">// The constraint can't be repaired in one decision.</span></div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="keywordflow">if</span> (num_branches == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordflow">if</span> (num_branches < selected_num_branches) {</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  selected_ct = i;</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  selected_num_branches = num_branches;</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="keywordflow">if</span> (num_branches == 1) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  }</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  }</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keywordflow">return</span> selected_ct;</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"><a class="line" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a5d0b9ffea8ed57b145ffbb1013f11e4b"> 542</a></span> TermIndex <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a5d0b9ffea8ed57b145ffbb1013f11e4b">OneFlipConstraintRepairer::NextRepairingTerm</a>(</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  ConstraintIndex ct_index, TermIndex init_term_index,</div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  TermIndex start_term_index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<TermIndex, ConstraintTerm></a>& terms =</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  by_constraint_matrix_[ct_index];</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> constraint_value = maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#ac0722975b1eb23bbc040792588f97fd9">ConstraintValue</a>(ct_index);</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lb = maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a2c61ed5387d5aea4b18cc222867db167">ConstraintLowerBound</a>(ct_index);</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> ub = maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a8e6c048efa518679165adb2b1795eb4a">ConstraintUpperBound</a>(ct_index);</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  </div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="keyword">const</span> TermIndex end_term_index(terms.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>() + init_term_index + 1);</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keywordflow">for</span> (TermIndex loop_term_index(</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  start_term_index + 1 +</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  (start_term_index < init_term_index ? terms.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>() : 0));</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  loop_term_index < end_term_index; ++loop_term_index) {</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keyword">const</span> TermIndex term_index(loop_term_index % terms.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>());</div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html">ConstraintTerm</a> term = terms[term_index];</div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordflow">if</span> (sat_assignment_.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  sat::BooleanVariable(term.<a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#a40429d7fbb63c4c4a17dc9128fcea503">var</a>.value()))) {</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  }</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_value =</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  constraint_value +</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  (maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#aba2b4531d3e07e40f22f2a40e527c7fd">Assignment</a>(term.<a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#a40429d7fbb63c4c4a17dc9128fcea503">var</a>) ? -term.<a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#ae42ca38a167164c07831993889216903">weight</a> : term.<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="l00565"></a><span class="lineno"> 565</span>  <span class="keywordflow">if</span> (new_value >= lb && new_value <= ub) {</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="keywordflow">return</span> term_index;</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>  }</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a21bf120b74c559d10caaea8309742eef">kInvalidTerm</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>  </div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a4650b705d23b018917acd5d41475090c"> 572</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a4650b705d23b018917acd5d41475090c">OneFlipConstraintRepairer::RepairIsValid</a>(ConstraintIndex ct_index,</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  TermIndex term_index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keywordflow">if</span> (maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a9adc153e5f3b7c84fc529ec9f39ccc28">ConstraintIsFeasible</a>(ct_index)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html">ConstraintTerm</a> term = by_constraint_matrix_[ct_index][term_index];</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keywordflow">if</span> (sat_assignment_.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  sat::BooleanVariable(term.<a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#a40429d7fbb63c4c4a17dc9128fcea503">var</a>.value()))) {</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  }</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_value =</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#ac0722975b1eb23bbc040792588f97fd9">ConstraintValue</a>(ct_index) +</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  (maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#aba2b4531d3e07e40f22f2a40e527c7fd">Assignment</a>(term.<a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#a40429d7fbb63c4c4a17dc9128fcea503">var</a>) ? -term.<a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#ae42ca38a167164c07831993889216903">weight</a> : term.<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="l00583"></a><span class="lineno"> 583</span>  </div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lb = maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a2c61ed5387d5aea4b18cc222867db167">ConstraintLowerBound</a>(ct_index);</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> ub = maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a8e6c048efa518679165adb2b1795eb4a">ConstraintUpperBound</a>(ct_index);</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keywordflow">return</span> (new_value >= lb && new_value <= ub);</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span> }</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  </div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a015715e6448827ceac0b0cbbb4b7eaca"> 589</a></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">OneFlipConstraintRepairer::GetFlip</a>(ConstraintIndex ct_index,</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  TermIndex term_index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html">ConstraintTerm</a> term = by_constraint_matrix_[ct_index][term_index];</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> = maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#aba2b4531d3e07e40f22f2a40e527c7fd">Assignment</a>(term.<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="l00593"></a><span class="lineno"> 593</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">sat::Literal</a>(sat::BooleanVariable(term.<a class="code" href="structoperations__research_1_1bop_1_1_one_flip_constraint_repairer_1_1_constraint_term.html#a40429d7fbb63c4c4a17dc9128fcea503">var</a>.value()), !<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>);</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span> }</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="keywordtype">void</span> OneFlipConstraintRepairer::SortTermsOfEachConstraints(<span class="keywordtype">int</span> num_variables) {</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<VariableIndex, int64></a> objective(num_variables, 0);</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ConstraintTerm& term :</div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  by_constraint_matrix_[<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html">AssignmentAndConstraintFeasibilityMaintainer</a>::</div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#aca25bc3ffa54b3f2668c6eeddffd8d1d">kObjectiveConstraint</a>]) {</div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  objective[term.var] = std::abs(term.weight);</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  }</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keywordflow">for</span> (<a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<TermIndex, ConstraintTerm></a>& terms :</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  by_constraint_matrix_) {</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  std::sort(terms.begin(), terms.end(),</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  [&objective](<span class="keyword">const</span> ConstraintTerm& <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <span class="keyword">const</span> ConstraintTerm& <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  return objective[a.var] > objective[b.var];</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  });</div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  }</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span> }</div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</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">// SatWrapper</span></div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span> <span class="comment">//------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  </div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a3adc33c0c8891314820bd37a91653694"> 616</a></span> <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a3adc33c0c8891314820bd37a91653694">SatWrapper::SatWrapper</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">sat::SatSolver</a>* sat_solver) : sat_solver_(sat_solver) {}</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  </div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a66b3ae33b0200f399c9145d707ff7887"> 618</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a66b3ae33b0200f399c9145d707ff7887">SatWrapper::BacktrackAll</a>() { sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0); }</div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  </div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a72222e224336a01b889afd6cd47bee14"> 620</a></span> std::vector<sat::Literal> <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a72222e224336a01b889afd6cd47bee14">SatWrapper::FullSatTrail</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  std::vector<sat::Literal> propagated_literals;</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">sat::Trail</a>& trail = sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a01fd4c9f5286534866c6c5ee2c160fe9">LiteralTrail</a>();</div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> trail_index = 0; trail_index < trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>(); ++trail_index) {</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  propagated_literals.push_back(trail[trail_index]);</div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  }</div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="keywordflow">return</span> propagated_literals;</div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span> }</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  </div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a93950a274a35f37cbe2a5a0932232da6"> 629</a></span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a93950a274a35f37cbe2a5a0932232da6">SatWrapper::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="l00630"></a><span class="lineno"> 630</span>  std::vector<sat::Literal>* propagated_literals) {</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(</div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  decision_literal.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8">Variable</a>()));</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(propagated_literals != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  </div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  propagated_literals->clear();</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_decision_level = sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>();</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> new_trail_index =</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9ae69b015a43c1a94e8815ab0dd8189c">EnqueueDecisionAndBackjumpOnConflict</a>(decision_literal);</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keywordflow">if</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="l00640"></a><span class="lineno"> 640</span>  <span class="keywordflow">return</span> old_decision_level + 1;</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>  </div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="comment">// Return the propagated literals, whenever there is a conflict or not.</span></div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="comment">// In case of conflict, these literals will have to be added to the last</span></div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="comment">// decision point after backtrack.</span></div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">sat::Trail</a>& propagation_trail = sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a01fd4c9f5286534866c6c5ee2c160fe9">LiteralTrail</a>();</div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> trail_index = new_trail_index;</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  trail_index < propagation_trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>(); ++trail_index) {</div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  propagated_literals->push_back(propagation_trail[trail_index]);</div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  }</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  </div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keywordflow">return</span> old_decision_level + 1 - sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>();</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span> }</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  </div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a5a82cd9f3923936066ceeb27a027fea6"> 655</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a5a82cd9f3923936066ceeb27a027fea6">SatWrapper::BacktrackOneLevel</a>() {</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_decision_level = sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>();</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="keywordflow">if</span> (old_decision_level > 0) {</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(old_decision_level - 1);</div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  }</div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span> }</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  </div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#aa808ac715d17a9e4891930daf5d3ac62"> 662</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#aa808ac715d17a9e4891930daf5d3ac62">SatWrapper::ExtractLearnedInfo</a>(<a class="code" href="structoperations__research_1_1bop_1_1_learned_info.html">LearnedInfo</a>* info) {</div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <a class="code" href="namespaceoperations__research_1_1bop.html#a717f3da5a33db3ffe67861f8731b254a">bop::ExtractLearnedInfoFromSatSolver</a>(sat_solver_, info);</div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span> }</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  </div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#ae525d235b02bcfc962d845e28f5f0125"> 666</a></span> <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#ae525d235b02bcfc962d845e28f5f0125">SatWrapper::deterministic_time</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keywordflow">return</span> sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ae525d235b02bcfc962d845e28f5f0125">deterministic_time</a>();</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span> }</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  </div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span> <span class="comment">//------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span> <span class="comment">// LocalSearchAssignmentIterator</span></div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span> <span class="comment">//------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  </div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a4c13a1377925d2ceefaea09f0c5747ff"> 674</a></span> <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a4c13a1377925d2ceefaea09f0c5747ff">LocalSearchAssignmentIterator::LocalSearchAssignmentIterator</a>(</div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1bop_1_1_problem_state.html">ProblemState</a>& problem_state, <span class="keywordtype">int</span> max_num_decisions,</div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keywordtype">int</span> max_num_broken_constraints, <a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html">SatWrapper</a>* sat_wrapper)</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  : max_num_decisions_(max_num_decisions),</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  max_num_broken_constraints_(max_num_broken_constraints),</div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  maintainer_(problem_state.original_problem()),</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  sat_wrapper_(sat_wrapper),</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  repairer_(problem_state.original_problem(), maintainer_,</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  sat_wrapper->SatAssignment()),</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  search_nodes_(),</div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  initial_term_index_(</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  problem_state.original_problem().constraints_size() + 1,</div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html">OneFlipConstraintRepairer</a>::kInitTerm),</div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  use_transposition_table_(false),</div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  use_potential_one_flip_repairs_(false),</div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  num_nodes_(0),</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  num_skipped_nodes_(0),</div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  num_improvements_(0),</div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  num_improvements_by_one_flip_repairs_(0),</div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  num_inspected_one_flip_repairs_(0) {}</div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  </div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a3910f2e32fea60320d748418ce5b263a"> 695</a></span> <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a3910f2e32fea60320d748418ce5b263a">LocalSearchAssignmentIterator::~LocalSearchAssignmentIterator</a>() {</div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"LS "</span> << max_num_decisions_</div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  << <span class="stringliteral">"\n num improvements: "</span> << num_improvements_</div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  << <span class="stringliteral">"\n num improvements with one flip repairs: "</span></div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  << num_improvements_by_one_flip_repairs_</div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  << <span class="stringliteral">"\n num inspected one flip repairs: "</span></div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  << num_inspected_one_flip_repairs_;</div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span> }</div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  </div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a9f59c500f903e06edd072d136de593dd"> 704</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a9f59c500f903e06edd072d136de593dd">LocalSearchAssignmentIterator::Synchronize</a>(</div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <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="l00706"></a><span class="lineno"> 706</span>  better_solution_has_been_found_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a7ca2c696b5f31c5e2e575dddd31c3917">SetReferenceSolution</a>(problem_state.<a class="code" href="classoperations__research_1_1bop_1_1_problem_state.html#ac59ff8f3b21bdac22c9c53a7d82ba3ec">solution</a>());</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> SearchNode& node : search_nodes_) {</div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  initial_term_index_[node.constraint] = node.term_index;</div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  }</div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  search_nodes_.<a class="code" href="classabsl_1_1_strong_vector.html#ac8bb3912a3ce86b15842e79d0b421204">clear</a>();</div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  transposition_table_.clear();</div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  num_nodes_ = 0;</div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  num_skipped_nodes_ = 0;</div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span> }</div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  </div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span> <span class="comment">// In order to restore the synchronization from any state, we backtrack</span></div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span> <span class="comment">// everything and retry to take the same decisions as before. We stop at the</span></div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span> <span class="comment">// first one that can't be taken.</span></div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a4870d904356fd0dd17fba66908bcf76b"> 720</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a4870d904356fd0dd17fba66908bcf76b">LocalSearchAssignmentIterator::SynchronizeSatWrapper</a>() {</div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(better_solution_has_been_found_, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="keyword">const</span> std::vector<SearchNode> copy = search_nodes_;</div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  sat_wrapper_-><a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a66b3ae33b0200f399c9145d707ff7887">BacktrackAll</a>();</div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  maintainer_.<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="l00725"></a><span class="lineno"> 725</span>  </div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="comment">// Note(user): at this stage, the sat trail contains the fixed variables.</span></div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="comment">// There will almost always be at the same value in the reference solution.</span></div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="comment">// However since the objective may be over-constrained in the sat_solver, it</span></div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="comment">// is possible that some variable where propagated to some other values.</span></div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#aec15c46ac9b8c2b89d91ccffdff6322a">Assign</a>(sat_wrapper_-><a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a72222e224336a01b889afd6cd47bee14">FullSatTrail</a>());</div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  </div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  search_nodes_.clear();</div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> SearchNode& node : copy) {</div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <span class="keywordflow">if</span> (!repairer_.<a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a4650b705d23b018917acd5d41475090c">RepairIsValid</a>(node.constraint, node.term_index)) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  search_nodes_.push_back(node);</div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  ApplyDecision(repairer_.<a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a015715e6448827ceac0b0cbbb4b7eaca">GetFlip</a>(node.constraint, node.term_index));</div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  }</div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span> }</div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  </div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span> <span class="keywordtype">void</span> LocalSearchAssignmentIterator::UseCurrentStateAsReference() {</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  better_solution_has_been_found_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  maintainer_.<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="l00743"></a><span class="lineno"> 743</span>  sat_wrapper_-><a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a66b3ae33b0200f399c9145d707ff7887">BacktrackAll</a>();</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  </div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="comment">// Note(user): Here, there should be no discrepancies between the fixed</span></div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <span class="comment">// variable and the new reference, so there is no need to do:</span></div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="comment">// maintainer_.Assign(sat_wrapper_->FullSatTrail());</span></div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  </div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> SearchNode& node : search_nodes_) {</div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  initial_term_index_[node.constraint] = node.term_index;</div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  }</div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  search_nodes_.<a class="code" href="classabsl_1_1_strong_vector.html#ac8bb3912a3ce86b15842e79d0b421204">clear</a>();</div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  transposition_table_.clear();</div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  num_nodes_ = 0;</div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  num_skipped_nodes_ = 0;</div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  ++num_improvements_;</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span> }</div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  </div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#af283b6840eab8ab73202804b3bf0974b"> 759</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#af283b6840eab8ab73202804b3bf0974b">LocalSearchAssignmentIterator::NextAssignment</a>() {</div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="keywordflow">if</span> (sat_wrapper_-><a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#ad2a33e1d9335cce63548abed6b5c8aab">IsModelUnsat</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="keywordflow">if</span> (maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a894d87c5fddfc463c3ca3c779ba7f997">IsFeasible</a>()) {</div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  UseCurrentStateAsReference();</div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  }</div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  </div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="comment">// We only look for potential one flip repairs if we reached the end of the</span></div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="comment">// LS tree. I tried to do that at every level, but it didn't change the</span></div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  <span class="comment">// result much on the set-partitionning example I was using.</span></div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  <span class="comment">// TODO(user): Perform more experiments with this.</span></div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="keywordflow">if</span> (use_potential_one_flip_repairs_ &&</div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  search_nodes_.size() == max_num_decisions_) {</div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">sat::Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : maintainer_.<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="l00774"></a><span class="lineno"> 774</span>  <span class="keywordflow">if</span> (sat_wrapper_-><a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a0e914f0d8a37ed15807b39948650a842">SatAssignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(</div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable())) {</div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  }</div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  ++num_inspected_one_flip_repairs_;</div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  </div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="comment">// Temporarily apply the potential repair and see if it worked!</span></div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  ApplyDecision(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="keywordflow">if</span> (maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a894d87c5fddfc463c3ca3c779ba7f997">IsFeasible</a>()) {</div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  num_improvements_by_one_flip_repairs_++;</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  UseCurrentStateAsReference();</div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  }</div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  maintainer_.<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="l00788"></a><span class="lineno"> 788</span>  sat_wrapper_-><a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a5a82cd9f3923936066ceeb27a027fea6">BacktrackOneLevel</a>();</div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  }</div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  }</div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  </div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="comment">// If possible, go deeper, i.e. take one more decision.</span></div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="keywordflow">if</span> (!GoDeeper()) {</div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="comment">// If not, backtrack to the first node that still has untried way to fix</span></div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="comment">// its associated constraint. Update it to the next untried way.</span></div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  Backtrack();</div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  }</div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  </div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="comment">// All nodes have been explored.</span></div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="keywordflow">if</span> (search_nodes_.empty()) {</div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << std::string(27, <span class="charliteral">' '</span>) + <span class="stringliteral">"LS "</span> << max_num_decisions_</div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  << <span class="stringliteral">" finished."</span></div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  << <span class="stringliteral">" #explored:"</span> << num_nodes_</div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  << <span class="stringliteral">" #stored:"</span> << transposition_table_.size()</div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  << <span class="stringliteral">" #skipped:"</span> << num_skipped_nodes_;</div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  }</div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  </div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="comment">// Apply the next decision, i.e. the literal of the flipped variable.</span></div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keyword">const</span> SearchNode node = search_nodes_.back();</div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  ApplyDecision(repairer_.<a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a015715e6448827ceac0b0cbbb4b7eaca">GetFlip</a>(node.constraint, node.term_index));</div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span> }</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  </div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span> <span class="comment">// TODO(user): The 1.2 multiplier is an approximation only based on the time</span></div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span> <span class="comment">// spent in the SAT wrapper. So far experiments show a good</span></div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span> <span class="comment">// correlation with real time, but we might want to be more</span></div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span> <span class="comment">// accurate.</span></div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#ae525d235b02bcfc962d845e28f5f0125"> 819</a></span> <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#ae525d235b02bcfc962d845e28f5f0125">LocalSearchAssignmentIterator::deterministic_time</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="keywordflow">return</span> sat_wrapper_-><a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#ae525d235b02bcfc962d845e28f5f0125">deterministic_time</a>() * 1.2;</div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span> }</div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  </div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a764be64f3029f8b8e23511061d8de355"> 823</a></span> std::string <a class="code" href="classoperations__research_1_1bop_1_1_local_search_assignment_iterator.html#a764be64f3029f8b8e23511061d8de355">LocalSearchAssignmentIterator::DebugString</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  std::string str = <span class="stringliteral">"Search nodes:\n"</span>;</div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < search_nodes_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  str += absl::StrFormat(<span class="stringliteral">" %d: %d %d\n"</span>, i,</div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  search_nodes_[i].constraint.value(),</div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  search_nodes_[i].term_index.value());</div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  }</div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <span class="keywordflow">return</span> str;</div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span> }</div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  </div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span> <span class="keywordtype">void</span> LocalSearchAssignmentIterator::ApplyDecision(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">sat::Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>) {</div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  ++num_nodes_;</div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_backtracks =</div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  sat_wrapper_-><a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a93950a274a35f37cbe2a5a0932232da6">ApplyDecision</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>, &tmp_propagated_literals_);</div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  </div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="comment">// Sync the maintainer with SAT.</span></div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="keywordflow">if</span> (num_backtracks == 0) {</div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  maintainer_.<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="l00841"></a><span class="lineno"> 841</span>  maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#aec15c46ac9b8c2b89d91ccffdff6322a">Assign</a>(tmp_propagated_literals_);</div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(num_backtracks, 0);</div>
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(num_backtracks, search_nodes_.size());</div>
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  </div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="comment">// Only backtrack -1 decisions as the last one has not been pushed yet.</span></div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_backtracks - 1; ++i) {</div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  maintainer_.<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="l00849"></a><span class="lineno"> 849</span>  }</div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#aec15c46ac9b8c2b89d91ccffdff6322a">Assign</a>(tmp_propagated_literals_);</div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  search_nodes_.resize(search_nodes_.size() - num_backtracks);</div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  }</div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span> }</div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  </div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span> <span class="keywordtype">void</span> LocalSearchAssignmentIterator::InitializeTranspositionTableKey(</div>
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  std::array<int32, kStoredMaxDecisions>* <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>) {</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="keywordtype">int</span> i = 0;</div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> SearchNode& n : search_nodes_) {</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="comment">// Negated because we already fliped this variable, so GetFlip() will</span></div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="comment">// returns the old value.</span></div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  (*a)[i] = -repairer_.<a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a015715e6448827ceac0b0cbbb4b7eaca">GetFlip</a>(n.constraint, n.term_index).<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a44fc3f1a79635fadb162d04cec312341">SignedValue</a>();</div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  ++i;</div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  }</div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  </div>
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <span class="comment">// 'a' is not zero-initialized, so we need to complete it with zeros.</span></div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  <span class="keywordflow">while</span> (i < kStoredMaxDecisions) {</div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  (*a)[i] = 0;</div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  ++i;</div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  }</div>
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span> }</div>
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  </div>
|
|
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span> <span class="keywordtype">bool</span> LocalSearchAssignmentIterator::NewStateIsInTranspositionTable(</div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  sat::Literal l) {</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <span class="keywordflow">if</span> (search_nodes_.size() + 1 > kStoredMaxDecisions) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  </div>
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="comment">// Fill the transposition table element, i.e the array 'a' of decisions.</span></div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  std::array<int32, kStoredMaxDecisions> <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>;</div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  InitializeTranspositionTableKey(&<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>);</div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>[search_nodes_.size()] = l.SignedValue();</div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  std::sort(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.begin(), <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.begin() + 1 + search_nodes_.size());</div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  </div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <span class="keywordflow">if</span> (transposition_table_.find(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>) == transposition_table_.end()) {</div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  ++num_skipped_nodes_;</div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  }</div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span> }</div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  </div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span> <span class="keywordtype">void</span> LocalSearchAssignmentIterator::InsertInTranspositionTable() {</div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="comment">// If there is more decision that kStoredMaxDecisions, do nothing.</span></div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="keywordflow">if</span> (search_nodes_.size() > kStoredMaxDecisions) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  </div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="comment">// Fill the transposition table element, i.e the array 'a' of decisions.</span></div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  std::array<int32, kStoredMaxDecisions> <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>;</div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  InitializeTranspositionTableKey(&<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>);</div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  std::sort(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.begin(), <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.begin() + search_nodes_.size());</div>
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  </div>
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  transposition_table_.insert(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>);</div>
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span> }</div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  </div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span> <span class="keywordtype">bool</span> LocalSearchAssignmentIterator::EnqueueNextRepairingTermIfAny(</div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  ConstraintIndex ct_to_repair, TermIndex term_index) {</div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="keywordflow">if</span> (term_index == initial_term_index_[ct_to_repair]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="keywordflow">if</span> (term_index == <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a21bf120b74c559d10caaea8309742eef">OneFlipConstraintRepairer::kInvalidTerm</a>) {</div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  term_index = initial_term_index_[ct_to_repair];</div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  }</div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  term_index = repairer_.<a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a5d0b9ffea8ed57b145ffbb1013f11e4b">NextRepairingTerm</a>(</div>
|
|
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  ct_to_repair, initial_term_index_[ct_to_repair], term_index);</div>
|
|
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  <span class="keywordflow">if</span> (term_index == <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a21bf120b74c559d10caaea8309742eef">OneFlipConstraintRepairer::kInvalidTerm</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keywordflow">if</span> (!use_transposition_table_ ||</div>
|
|
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  !NewStateIsInTranspositionTable(</div>
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  repairer_.<a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a015715e6448827ceac0b0cbbb4b7eaca">GetFlip</a>(ct_to_repair, term_index))) {</div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  search_nodes_.push_back(SearchNode(ct_to_repair, term_index));</div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  }</div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <span class="keywordflow">if</span> (term_index == initial_term_index_[ct_to_repair]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  }</div>
|
|
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span> }</div>
|
|
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  </div>
|
|
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span> <span class="keywordtype">bool</span> LocalSearchAssignmentIterator::GoDeeper() {</div>
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="comment">// Can we add one more decision?</span></div>
|
|
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="keywordflow">if</span> (search_nodes_.size() >= max_num_decisions_) {</div>
|
|
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  }</div>
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  </div>
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  <span class="comment">// Is the number of infeasible constraints reasonable?</span></div>
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="comment">// TODO(user): Make this parameters dynamic. We can either try lower value</span></div>
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="comment">// first and increase it later, or try to dynamically change it during the</span></div>
|
|
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="comment">// search. Another idea is to have instead a "max number of constraints that</span></div>
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <span class="comment">// can be repaired in one decision" and to take into account the number of</span></div>
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  <span class="comment">// decisions left.</span></div>
|
|
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="keywordflow">if</span> (maintainer_.<a class="code" href="classoperations__research_1_1bop_1_1_assignment_and_constraint_feasibility_maintainer.html#a6dce02aea549c1629b25b30c716faa6a">NumInfeasibleConstraints</a>() > max_num_broken_constraints_) {</div>
|
|
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  }</div>
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  </div>
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  <span class="comment">// Can we find a constraint that can be repaired in one decision?</span></div>
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <span class="keyword">const</span> ConstraintIndex ct_to_repair = repairer_.<a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a3ec353a099d08e3d7632a849f9c73a54">ConstraintToRepair</a>();</div>
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  <span class="keywordflow">if</span> (ct_to_repair == <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#aef041a7abdb31fc3a000cf8fe185f500">OneFlipConstraintRepairer::kInvalidConstraint</a>) {</div>
|
|
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  }</div>
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  </div>
|
|
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="comment">// Add the new decision.</span></div>
|
|
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  <span class="comment">// TODO(user): Store the last explored term index to not start from -1 each</span></div>
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  <span class="comment">// time. This will be very useful when a backtrack occurred due to the SAT</span></div>
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <span class="comment">// propagator. Note however that this behavior is already enforced when we use</span></div>
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  <span class="comment">// the transposition table, since we will not explore again the branches</span></div>
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  <span class="comment">// already explored.</span></div>
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <span class="keywordflow">return</span> EnqueueNextRepairingTermIfAny(ct_to_repair,</div>
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <a class="code" href="classoperations__research_1_1bop_1_1_one_flip_constraint_repairer.html#a21bf120b74c559d10caaea8309742eef">OneFlipConstraintRepairer::kInvalidTerm</a>);</div>
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span> }</div>
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  </div>
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span> <span class="keywordtype">void</span> LocalSearchAssignmentIterator::Backtrack() {</div>
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  <span class="keywordflow">while</span> (!search_nodes_.empty()) {</div>
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  <span class="comment">// We finished exploring this node. Store it in the transposition table so</span></div>
|
|
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="comment">// that the same decisions will not be explored again. Note that the SAT</span></div>
|
|
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="comment">// solver may have learned more the second time the exact same decisions are</span></div>
|
|
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  <span class="comment">// seen, but we assume that it is not worth exploring again.</span></div>
|
|
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="keywordflow">if</span> (use_transposition_table_) InsertInTranspositionTable();</div>
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  </div>
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  <span class="keyword">const</span> SearchNode last_node = search_nodes_.back();</div>
|
|
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  search_nodes_.pop_back();</div>
|
|
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  maintainer_.<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="l00967"></a><span class="lineno"> 967</span>  sat_wrapper_-><a class="code" href="classoperations__research_1_1bop_1_1_sat_wrapper.html#a5a82cd9f3923936066ceeb27a027fea6">BacktrackOneLevel</a>();</div>
|
|
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  <span class="keywordflow">if</span> (EnqueueNextRepairingTermIfAny(last_node.constraint,</div>
|
|
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  last_node.term_index)) {</div>
|
|
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  }</div>
|
|
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  }</div>
|
|
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span> }</div>
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  </div>
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span> } <span class="comment">// namespace bop</span></div>
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span> } <span class="comment">// namespace operations_research</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<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_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="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="aclassoperations__research_1_1sat_1_1_literal_html_a6a5dcff82096cd7a7147bf996dbaa5a8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8">operations_research::sat::Literal::Variable</a></div><div class="ttdeci">BooleanVariable Variable() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00080">sat_base.h:80</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_backtrackable_integer_set_html"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_backtrackable_integer_set.html">operations_research::bop::BacktrackableIntegerSet< ConstraintIndex ></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="abase_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00978">base/logging.h:978</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_bop_optimizer_base_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba22ebbfba03095f407fb90f5a363a384b"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba22ebbfba03095f407fb90f5a363a384b">operations_research::bop::BopOptimizerBase::SOLUTION_FOUND</a></div><div class="ttdeci">@ SOLUTION_FOUND</div><div class="ttdef"><b>Definition:</b> <a href="bop__base_8h_source.html#l00064">bop_base.h:64</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_bop_solution_html_a58f4b9e873b7c1c7d512bd9f7d1489d8"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_bop_solution.html#a58f4b9e873b7c1c7d512bd9f7d1489d8">operations_research::bop::BopSolution::Size</a></div><div class="ttdeci">size_t Size() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__solution_8h_source.html#l00043">bop_solution.h:43</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_problem_state_html_ac59ff8f3b21bdac22c9c53a7d82ba3ec"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_problem_state.html#ac59ff8f3b21bdac22c9c53a7d82ba3ec">operations_research::bop::ProblemState::solution</a></div><div class="ttdeci">const BopSolution & solution() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__base_8h_source.html#l00194">bop_base.h:194</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="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="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="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_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_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_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_bop_optimizer_base_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">operations_research::bop::BopOptimizerBase::LIMIT_REACHED</a></div><div class="ttdeci">@ LIMIT_REACHED</div><div class="ttdef"><b>Definition:</b> <a href="bop__base_8h_source.html#l00066">bop_base.h:66</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_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_1sat_1_1_sat_solver_html_a9ae69b015a43c1a94e8815ab0dd8189c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a9ae69b015a43c1a94e8815ab0dd8189c">operations_research::sat::SatSolver::EnqueueDecisionAndBackjumpOnConflict</a></div><div class="ttdeci">int EnqueueDecisionAndBackjumpOnConflict(Literal true_literal)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00499">sat_solver.cc:499</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="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="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="abase_2logging_8h_html_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00702">base/logging.h:702</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="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="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_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_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="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="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="aintegral__types_8h_html_af458164b470cbba416d5ed579e00ff60"><div class="ttname"><a href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a></div><div class="ttdeci">static const int64 kint64min</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00060">integral_types.h:60</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_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_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_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="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="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_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="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="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="aclassoperations__research_1_1sat_1_1_literal_html_a44fc3f1a79635fadb162d04cec312341"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a44fc3f1a79635fadb162d04cec312341">operations_research::sat::Literal::SignedValue</a></div><div class="ttdeci">int SignedValue() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00087">sat_base.h:87</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="aclassabsl_1_1_strong_vector_html_a184fe69018ae421dcf31c964bfe40576"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a184fe69018ae421dcf31c964bfe40576">absl::StrongVector::assign</a></div><div class="ttdeci">void assign(size_type n, const value_type &val)</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00131">strong_vector.h:131</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_1sat_1_1_trail_html_a8ef12397d1682615bc3108c397734179"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">operations_research::sat::Trail::Index</a></div><div class="ttdeci">int Index() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00378">sat_base.h:378</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_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_1sat_1_1_sat_solver_html_ad63c4461a1384629cb99413c6df8b9ca"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">operations_research::sat::SatSolver::CurrentDecisionLevel</a></div><div class="ttdeci">int CurrentDecisionLevel() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00360">sat_solver.h:360</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="amacros_8h_html_a7f536a3b33f9bed8f75734e035d30725"><div class="ttname"><a href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a></div><div class="ttdeci">const bool DEBUG_MODE</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00024">macros.h:24</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="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="aclassoperations__research_1_1sat_1_1_sat_solver_html_a01fd4c9f5286534866c6c5ee2c160fe9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a01fd4c9f5286534866c6c5ee2c160fe9">operations_research::sat::SatSolver::LiteralTrail</a></div><div class="ttdeci">const Trail & LiteralTrail() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00361">sat_solver.h:361</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_ab0cfc59ab5792086f6f8b9234320fd33"><div class="ttname"><a href="integral__types_8h.html#ab0cfc59ab5792086f6f8b9234320fd33">kint32max</a></div><div class="ttdeci">static const int32 kint32max</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00059">integral_types.h:59</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_bop_optimizer_base_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">operations_research::bop::BopOptimizerBase::INFEASIBLE</a></div><div class="ttdeci">@ INFEASIBLE</div><div class="ttdef"><b>Definition:</b> <a href="bop__base_8h_source.html#l00065">bop_base.h:65</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#l02101">cp_model_solver.cc:2101</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="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="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_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="abase_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00697">base/logging.h:697</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="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_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_1sat_1_1_sat_solver_html_ae525d235b02bcfc962d845e28f5f0125"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ae525d235b02bcfc962d845e28f5f0125">operations_research::sat::SatSolver::deterministic_time</a></div><div class="ttdeci">double deterministic_time() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00092">sat_solver.cc:92</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="anamespaceoperations__research_1_1bop_html_a717f3da5a33db3ffe67861f8731b254a"><div class="ttname"><a href="namespaceoperations__research_1_1bop.html#a717f3da5a33db3ffe67861f8731b254a">operations_research::bop::ExtractLearnedInfoFromSatSolver</a></div><div class="ttdeci">void ExtractLearnedInfoFromSatSolver(sat::SatSolver *solver, LearnedInfo *info)</div><div class="ttdef"><b>Definition:</b> <a href="bop__util_8cc_source.html#l00098">bop_util.cc:98</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695"><div class="ttname"><a href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a></div><div class="ttdeci">const Constraint * ct</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00042">demon_profiler.cc:42</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_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_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="abop__util_8h_html"><div class="ttname"><a href="bop__util_8h.html">bop_util.h</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_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_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="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="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_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="abase_2logging_8h_html_ae4db23f10f5d4aad6d735f5a74cd6f8c"><div class="ttname"><a href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a></div><div class="ttdeci">#define CHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00699">base/logging.h:699</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_bop_optimizer_base_html_a67a0db04d321a74b7e7fcfd3f1a3f70bae276c6d6c33441e7bc41f349a9ba39e2"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae276c6d6c33441e7bc41f349a9ba39e2">operations_research::bop::BopOptimizerBase::OPTIMAL_SOLUTION_FOUND</a></div><div class="ttdeci">@ OPTIMAL_SOLUTION_FOUND</div><div class="ttdef"><b>Definition:</b> <a href="bop__base_8h_source.html#l00063">bop_base.h:63</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_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="aclassabsl_1_1_strong_vector_html_ac8bb3912a3ce86b15842e79d0b421204"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#ac8bb3912a3ce86b15842e79d0b421204">absl::StrongVector::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00170">strong_vector.h:170</a></div></div>
|
|
<div class="ttc" id="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_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_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="aclassabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector</a></div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00076">strong_vector.h:76</a></div></div>
|
|
<div class="ttc" id="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 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_bop_solution_html_a894d87c5fddfc463c3ca3c779ba7f997"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_bop_solution.html#a894d87c5fddfc463c3ca3c779ba7f997">operations_research::bop::BopSolution::IsFeasible</a></div><div class="ttdeci">bool IsFeasible() const</div><div class="ttdef"><b>Definition:</b> <a href="bop__solution_8h_source.html#l00070">bop_solution.h:70</a></div></div>
|
|
<div class="ttc" id="abop__ls_8h_html"><div class="ttname"><a href="bop__ls_8h.html">bop_ls.h</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_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_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_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_1sat_1_1_sat_solver_html_ac035378cea0ed7b0978105547402faa8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">operations_research::sat::SatSolver::Backtrack</a></div><div class="ttdeci">void Backtrack(int target_level)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00888">sat_solver.cc:888</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="abase_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00885">base/logging.h:885</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="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="aconstraint__solver_2table_8cc_html_a344010e26426d6a13411648d988bc9b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a></div><div class="ttdeci">int64 b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00043">constraint_solver/table.cc:43</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="aboolean__problem_8h_html"><div class="ttname"><a href="boolean__problem_8h.html">boolean_problem.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_a49e751eb6f0e9babd957889bb8e7472d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">operations_research::sat::VariablesAssignment::VariableIsAssigned</a></div><div class="ttdeci">bool VariableIsAssigned(BooleanVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00158">sat_base.h:158</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="abase_2logging_8h_html_ab25e01a2942b821d66371fc68d53f2eb"><div class="ttname"><a href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a></div><div class="ttdeci">#define CHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00698">base/logging.h:698</a></div></div>
|
|
<div class="ttc" id="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="anamespaceoperations__research_1_1sat_html_aca25bc3ffa54b3f2668c6eeddffd8d1d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aca25bc3ffa54b3f2668c6eeddffd8d1d">operations_research::sat::kObjectiveConstraint</a></div><div class="ttdeci">constexpr int kObjectiveConstraint</div><div class="ttdef"><b>Definition:</b> <a href="presolve__context_8h_source.html#l00035">presolve_context.h:35</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_bop_optimizer_base_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba49959dd441dcda75d6898cf2c68fb374"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba49959dd441dcda75d6898cf2c68fb374">operations_research::bop::BopOptimizerBase::CONTINUE</a></div><div class="ttdeci">@ CONTINUE</div><div class="ttdef"><b>Definition:</b> <a href="bop__base_8h_source.html#l00077">bop_base.h:77</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="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="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_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_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_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="abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
|
|
<div class="ttc" id="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="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="adefault__search_8cc_html_ac673bc430bdc3fdaa09f7becf98ef267"><div class="ttname"><a href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a></div><div class="ttdeci">const std::string name</div><div class="ttdef"><b>Definition:</b> <a href="default__search_8cc_source.html#l00808">default_search.cc:808</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_bop_optimizer_base_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba781ad2788df9e25c59a70894c7832096"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_bop_optimizer_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba781ad2788df9e25c59a70894c7832096">operations_research::bop::BopOptimizerBase::ABORT</a></div><div class="ttdeci">@ ABORT</div><div class="ttdef"><b>Definition:</b> <a href="bop__base_8h_source.html#l00081">bop_base.h:80</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1bop_1_1_bop_solution_html_a157d7e03cf5ef624646b9a0a80912abc"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_bop_solution.html#a157d7e03cf5ef624646b9a0a80912abc">operations_research::bop::BopSolution::SetValue</a></div><div class="ttdeci">void SetValue(VariableIndex var, bool value)</div><div class="ttdef"><b>Definition:</b> <a href="bop__solution_8h_source.html#l00037">bop_solution.h:37</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html">operations_research::sat::Trail</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00233">sat_base.h:233</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="aintegral__types_8h_html_a74ea76ea27f48fb1b6e148e1577b3719"><div class="ttname"><a href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a></div><div class="ttdeci">static const int64 kint64max</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00062">integral_types.h:62</a></div></div>
|
|
<!-- 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_8cc.html">bop_ls.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.20 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|