2295 lines
485 KiB
HTML
2295 lines
485 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.2"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: optimization.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.2 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('optimization_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">optimization.cc</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="optimization_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include "<a class="code" href="optimization_8h.html">ortools/sat/optimization.h</a>"</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span> </div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <cstdio></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <cstdlib></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <deque></span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include <map></span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include <set></span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> </div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "absl/random/random.h"</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include "absl/strings/str_cat.h"</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include "absl/strings/str_format.h"</span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include "<a class="code" href="cleanup_8h.html">ortools/base/cleanup.h</a>"</span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="preprocessor">#include "<a class="code" href="int__type_8h.html">ortools/base/int_type.h</a>"</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="preprocessor">#include "<a class="code" href="macros_8h.html">ortools/base/macros.h</a>"</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="preprocessor">#include "<a class="code" href="map__util_8h.html">ortools/base/map_util.h</a>"</span></div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="preprocessor">#include "<a class="code" href="stl__util_8h.html">ortools/base/stl_util.h</a>"</span></div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="preprocessor">#include "<a class="code" href="timer_8h.html">ortools/base/timer.h</a>"</span></div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="preprocessor">#if !defined(__PORTABLE_PLATFORM__) && defined(USE_SCIP)</span></div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="preprocessor">#include "<a class="code" href="linear__solver_8h.html">ortools/linear_solver/linear_solver.h</a>"</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="preprocessor">#include "<a class="code" href="linear__solver_8pb_8h.html">ortools/linear_solver/linear_solver.pb.h</a>"</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="preprocessor">#endif </span><span class="comment">// __PORTABLE_PLATFORM__</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="preprocessor">#include "<a class="code" href="random_8h.html">ortools/base/random.h</a>"</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="preprocessor">#include "<a class="code" href="port_2proto__utils_8h.html">ortools/port/proto_utils.h</a>"</span></div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</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 id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="preprocessor">#include "<a class="code" href="encoding_8h.html">ortools/sat/encoding.h</a>"</span></div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="preprocessor">#include "<a class="code" href="integer__expr_8h.html">ortools/sat/integer_expr.h</a>"</span></div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span><span class="preprocessor">#include "<a class="code" href="pb__constraint_8h.html">ortools/sat/pb_constraint.h</a>"</span></div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span><span class="preprocessor">#include "<a class="code" href="sat__parameters_8pb_8h.html">ortools/sat/sat_parameters.pb.h</a>"</span></div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span><span class="preprocessor">#include "<a class="code" href="sat_2util_8h.html">ortools/sat/util.h</a>"</span></div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span><span class="preprocessor">#include "<a class="code" href="time__limit_8h.html">ortools/util/time_limit.h</a>"</span></div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> </div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> </div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> </div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span><span class="comment">// Used to log messages to stdout or to the normal logging framework according</span></div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span><span class="comment">// to the given LogBehavior value.</span></div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span><span class="keyword">class </span>Logger {</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keyword">explicit</span> Logger(<a class="code hl_enumeration" href="namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238">LogBehavior</a> v) : use_stdout_(v == <a class="code hl_enumvalue" href="namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238a6c3f20e225309c66fdb5481433e5bd2f">STDOUT_LOG</a>) {}</div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordtype">void</span> Log(<span class="keyword">const</span> std::string& <a class="code hl_variable" href="trace_8cc.html#a36bd74109f547f7f8198faf5a12d2879">message</a>) {</div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordflow">if</span> (use_stdout_) {</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> absl::PrintF(<span class="stringliteral">"%s\n"</span>, <a class="code hl_variable" href="trace_8cc.html#a36bd74109f547f7f8198faf5a12d2879">message</a>);</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code hl_variable" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <a class="code hl_variable" href="trace_8cc.html#a36bd74109f547f7f8198faf5a12d2879">message</a>;</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> }</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> }</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> </div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keywordtype">bool</span> use_stdout_;</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span>};</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> </div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span><span class="comment">// Outputs the current objective value in the cnf output format.</span></div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="comment">// Note that this function scale the given objective.</span></div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span>std::string CnfObjectiveLine(<span class="keyword">const</span> LinearBooleanProblem& problem,</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> objective) {</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="keyword">const</span> <span class="keywordtype">double</span> scaled_objective =</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a16bcd287bd18e3a940d997aafb9321a9">AddOffsetAndScaleObjectiveValue</a>(problem, objective);</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"o %d"</span>, <span class="keyword">static_cast<</span>int64_t<span class="keyword">></span>(scaled_objective));</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span>}</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> </div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span><span class="keyword">struct </span>LiteralWithCoreIndex {</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> LiteralWithCoreIndex(Literal l, <span class="keywordtype">int</span> i) : <a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>(l), <a class="code hl_variable" href="optimization_8cc.html#a829582ce81a6c838e6f9c73c78814cff">core_index</a>(i) {}</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b"> 85</a></span> Literal <a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>;</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="optimization_8cc.html#a829582ce81a6c838e6f9c73c78814cff"> 86</a></span> <span class="keywordtype">int</span> <a class="code hl_variable" href="optimization_8cc.html#a829582ce81a6c838e6f9c73c78814cff">core_index</a>;</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span>};</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> </div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span><span class="comment">// Deletes the given indices from a vector. The given indices must be sorted in</span></div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span><span class="comment">// increasing order. The order of the non-deleted entries in the vector is</span></div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span><span class="comment">// preserved.</span></div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span><span class="keyword">template</span> <<span class="keyword">typename</span> Vector></div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span><span class="keywordtype">void</span> DeleteVectorIndices(<span class="keyword">const</span> std::vector<int>& indices, Vector* v) {</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keywordtype">int</span> new_size = 0;</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="keywordtype">int</span> indices_index = 0;</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < v->size(); ++i) {</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="keywordflow">if</span> (indices_index < indices.size() && i == indices[indices_index]) {</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> ++indices_index;</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> (*v)[new_size] = (*v)[i];</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> ++new_size;</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> }</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> }</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> v->resize(new_size);</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span>}</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> </div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span><span class="comment">// In the Fu & Malik algorithm (or in WPM1), when two cores overlap, we</span></div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span><span class="comment">// artificially introduce symmetries. More precisely:</span></div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span><span class="comment">// The picture below shows two cores with index 0 and 1, with one blocking</span></div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span><span class="comment">// variable per '-' and with the variables ordered from left to right (by their</span></div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span><span class="comment">// assumptions index). The blocking variables will be the one added to "relax"</span></div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span><span class="comment">// the core for the next iteration.</span></div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span><span class="comment">// 1: -------------------------------</span></div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span><span class="comment">// 0: ------------------------------------</span></div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span><span class="comment">// The 2 following assignment of the blocking variables are equivalent.</span></div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span><span class="comment">// Remember that exactly one blocking variable per core must be assigned to 1.</span></div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span><span class="comment">// 1: ----------------------1--------</span></div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span><span class="comment">// 0: --------1---------------------------</span></div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span><span class="comment">// and</span></div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span><span class="comment">// 1: ---------------------------1---</span></div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span><span class="comment">// 0: ---1--------------------------------</span></div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span><span class="comment">// This class allows to add binary constraints excluding the second possibility.</span></div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span><span class="comment">// Basically, each time a new core is added, if two of its blocking variables</span></div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span><span class="comment">// (b1, b2) have the same assumption index of two blocking variables from</span></div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span><span class="comment">// another core (c1, c2), then we forbid the assignment c1 true and b2 true.</span></div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span><span class="comment">// Reference: C Ansótegui, ML Bonet, J Levy, "Sat-based maxsat algorithms",</span></div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span><span class="comment">// Artificial Intelligence, 2013 - Elsevier.</span></div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span><span class="keyword">class </span>FuMalikSymmetryBreaker {</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> FuMalikSymmetryBreaker() {}</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> </div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="comment">// Must be called before a new core is processed.</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="keywordtype">void</span> StartResolvingNewCore(<span class="keywordtype">int</span> new_core_index) {</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> literal_by_core_.resize(new_core_index);</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < new_core_index; ++i) {</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> literal_by_core_[i].clear();</div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> }</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> }</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> </div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="comment">// This should be called for each blocking literal b of the new core. The</span></div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// assumption_index identify the soft clause associated to the given blocking</span></div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// literal. Note that between two StartResolvingNewCore() calls,</span></div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <span class="comment">// ProcessLiteral() is assumed to be called with different assumption_index.</span></div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// Changing the order of the calls will not change the correctness, but will</span></div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="comment">// change the symmetry-breaking clause produced.</span></div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="comment">// Returns a set of literals which can't be true at the same time as b (under</span></div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// symmetry breaking).</span></div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> std::vector<Literal> ProcessLiteral(<span class="keywordtype">int</span> assumption_index, Literal <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) {</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="keywordflow">if</span> (assumption_index >= info_by_assumption_index_.size()) {</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> info_by_assumption_index_.resize(assumption_index + 1);</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> }</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> </div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="comment">// Compute the function result.</span></div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="comment">// info_by_assumption_index_[assumption_index] will contain all the pairs</span></div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <span class="comment">// (blocking_literal, core) of the previous resolved cores at the same</span></div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="comment">// assumption index as b.</span></div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> std::vector<Literal> result;</div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <span class="keywordflow">for</span> (LiteralWithCoreIndex data :</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> info_by_assumption_index_[assumption_index]) {</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <span class="comment">// literal_by_core_ will contain all the blocking literal of a given core</span></div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="comment">// with an assumption_index that was used in one of the ProcessLiteral()</span></div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="comment">// calls since the last StartResolvingNewCore().</span></div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="comment">// Note that there can be only one such literal by core, so we will not</span></div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="comment">// add duplicates.</span></div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> result.insert(result.end(), literal_by_core_[data.core_index].begin(),</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> literal_by_core_[data.core_index].end());</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> }</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> </div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="comment">// Update the internal data structure.</span></div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="keywordflow">for</span> (LiteralWithCoreIndex data :</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> info_by_assumption_index_[assumption_index]) {</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> literal_by_core_[data.core_index].push_back(data.literal);</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> }</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> info_by_assumption_index_[assumption_index].push_back(</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> LiteralWithCoreIndex(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, literal_by_core_.size()));</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> }</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> </div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="comment">// Deletes the given assumption indices.</span></div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="keywordtype">void</span> DeleteIndices(<span class="keyword">const</span> std::vector<int>& indices) {</div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> DeleteVectorIndices(indices, &info_by_assumption_index_);</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> }</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> </div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="comment">// This is only used in WPM1 to forget all the information related to a given</span></div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="comment">// assumption_index.</span></div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <span class="keywordtype">void</span> ClearInfo(<span class="keywordtype">int</span> assumption_index) {</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <a class="code hl_define" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(assumption_index, info_by_assumption_index_.size());</div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> info_by_assumption_index_[assumption_index].clear();</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> }</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> </div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="comment">// This is only used in WPM1 when a new assumption_index is created.</span></div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="keywordtype">void</span> AddInfo(<span class="keywordtype">int</span> assumption_index, Literal <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) {</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(assumption_index, info_by_assumption_index_.size());</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> info_by_assumption_index_.resize(assumption_index + 1);</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> info_by_assumption_index_[assumption_index].push_back(</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> LiteralWithCoreIndex(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, literal_by_core_.size()));</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> }</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> </div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> std::vector<std::vector<LiteralWithCoreIndex>> info_by_assumption_index_;</div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> std::vector<std::vector<Literal>> literal_by_core_;</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> </div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <a class="code hl_define" href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a>(FuMalikSymmetryBreaker);</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span>};</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> </div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> </div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ab76a35e6ff810ad9ea8b58c7c11606cb"> 219</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ab76a35e6ff810ad9ea8b58c7c11606cb">MinimizeCoreWithPropagation</a>(<a class="code hl_class" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* limit, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver,</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> std::vector<Literal>* core) {</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <span class="keywordflow">if</span> (solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab">IsModelUnsat</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> std::set<LiteralIndex> moved_last;</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> std::vector<Literal> candidate(core->begin(), core->end());</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> </div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440">SetAssumptionLevel</a>(0);</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <span class="keywordflow">if</span> (!solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d">FinishPropagation</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> <span class="keywordflow">while</span> (!limit-><a class="code hl_function" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>()) {</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="comment">// We want each literal in candidate to appear last once in our propagation</span></div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="comment">// order. We want to do that while maximizing the reutilization of the</span></div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="comment">// current assignment prefix, that is minimizing the number of</span></div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="comment">// decision/progagation we need to perform.</span></div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <span class="keyword">const</span> <span class="keywordtype">int</span> target_level = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a2ef3eb1f5fe6506a5e24115f10d724fc">MoveOneUnprocessedLiteralLast</a>(</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> moved_last, solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), &candidate);</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <span class="keywordflow">if</span> (target_level == -1) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(target_level);</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <span class="keywordflow">while</span> (!solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab">IsModelUnsat</a>() && !limit-><a class="code hl_function" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>() &&</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() < candidate.size()) {</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> decision = candidate[solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>()];</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="keywordflow">if</span> (solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b">Assignment</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(decision)) {</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> candidate.erase(candidate.begin() + solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>());</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b">Assignment</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(decision)) {</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <span class="comment">// This is a "weird" API to get the subset of decisions that caused</span></div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <span class="comment">// this literal to be false with reason analysis.</span></div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ab63a08713131e63e9cc4109f98ecf859">EnqueueDecisionAndBacktrackOnConflict</a>(decision);</div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> candidate = solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#acfbfa9df611cb625ff79785c05784580">GetLastIncompatibleDecisions</a>();</div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9ae69b015a43c1a94e8815ab0dd8189c">EnqueueDecisionAndBackjumpOnConflict</a>(decision);</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> }</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> }</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <span class="keywordflow">if</span> (candidate.empty() || solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab">IsModelUnsat</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> moved_last.insert(candidate.back().Index());</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> }</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> </div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440">SetAssumptionLevel</a>(0);</div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> <span class="keywordflow">if</span> (candidate.size() < core->size()) {</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"minimization "</span> << core->size() << <span class="stringliteral">" -> "</span> << candidate.size();</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> core->assign(candidate.begin(), candidate.end());</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> }</div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span>}</div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> </div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span><span class="comment">// This algorithm works by exploiting the unsat core returned by the SAT solver</span></div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span><span class="comment">// when the problem is UNSAT. It starts by trying to solve the decision problem</span></div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span><span class="comment">// where all the objective variables are set to their value with minimal cost,</span></div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span><span class="comment">// and relax in each step some of these fixed variables until the problem</span></div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span><span class="comment">// becomes satisfiable.</span></div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ac8d4f52bbb23604c511dfeca406b1685"> 270</a></span><a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ac8d4f52bbb23604c511dfeca406b1685">SolveWithFuMalik</a>(<a class="code hl_enumeration" href="namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238">LogBehavior</a> log,</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html">LinearBooleanProblem</a>& problem,</div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver,</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> std::vector<bool>* solution) {</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> Logger logger(log);</div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> FuMalikSymmetryBreaker symmetry;</div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> </div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> <span class="comment">// blocking_clauses will contains a set of clauses that are currently added to</span></div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="comment">// the initial problem.</span></div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <span class="comment">// Initially, each clause just contains a literal associated to an objective</span></div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> <span class="comment">// variable with non-zero cost. Setting all these literals to true will lead</span></div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <span class="comment">// to the lowest possible objective.</span></div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> <span class="comment">// During the algorithm, "blocking" literals will be added to each clause.</span></div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> <span class="comment">// Moreover each clause will contain an extra "assumption" literal stored in</span></div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <span class="comment">// the separate assumptions vector (in its negated form).</span></div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <span class="comment">// The meaning of a given clause will always be:</span></div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> <span class="comment">// If the assumption literal and all blocking literals are false, then the</span></div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> <span class="comment">// "objective" literal (which is the first one in the clause) must be true.</span></div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <span class="comment">// When the "objective" literal is true, its variable (which have a non-zero</span></div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="comment">// cost) is set to the value that minimize the objective cost.</span></div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <span class="comment">// ex: If a variable "x" as a cost of 3, its cost contribution is smaller when</span></div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <span class="comment">// it is set to false (since it will contribute to zero instead of 3).</span></div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> std::vector<std::vector<Literal>> blocking_clauses;</div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> std::vector<Literal> assumptions;</div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> </div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="comment">// Initialize blocking_clauses and assumptions.</span></div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_objective.html">LinearObjective</a>& objective = problem.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a9fd8f81a798fd34a843b007c10e40d6b">objective</a>();</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> <a class="code hl_define" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(objective.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#afddea8f1f515fb9507a2e5c2ceb1b29e">coefficients_size</a>(), 0);</div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> unique_objective_coeff(std::abs(objective.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#a63e564949c709325f7c31376b8db8b64">coefficients</a>(0)));</div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < objective.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#a72d41feda9a93c11089d3d99d6270999">literals_size</a>(); ++i) {</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(std::abs(objective.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#a63e564949c709325f7c31376b8db8b64">coefficients</a>(i)), unique_objective_coeff)</div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> << <span class="stringliteral">"The basic Fu & Malik algorithm needs constant objective coeffs."</span>;</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>(objective.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#ae257a6514082fdcf3a9f33dda44c40b7">literals</a>(i));</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> </div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> <span class="comment">// We want to minimize the cost when this literal is true.</span></div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> min_literal =</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> objective.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#a63e564949c709325f7c31376b8db8b64">coefficients</a>(i) > 0 ? <a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>() : <a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>;</div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> blocking_clauses.push_back(std::vector<Literal>(1, min_literal));</div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> </div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> <span class="comment">// Note that initialy, we do not create any extra variables.</span></div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> assumptions.push_back(min_literal);</div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> }</div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> </div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> <span class="comment">// Print the number of variable with a non-zero cost.</span></div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> logger.Log(absl::StrFormat(<span class="stringliteral">"c #weights:%u #vars:%d #constraints:%d"</span>,</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> assumptions.size(), problem.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#aad5531f45ca462be2f1b7ee7a5cb1372">num_variables</a>(),</div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> problem.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#aeaf0da781ca9b370d96b7fbd3f74266a">constraints_size</a>()));</div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> </div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> <span class="comment">// Starts the algorithm. Each loop will solve the problem under the given</span></div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> <span class="comment">// assumptions, and if unsat, will relax exactly one of the objective</span></div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> <span class="comment">// variables (from the unsat core) to be in its "costly" state. When the</span></div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> <span class="comment">// algorithm terminates, the number of iterations is exactly the minimal</span></div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> <span class="comment">// objective value.</span></div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> iter = 0;; ++iter) {</div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> <span class="keyword">const</span> <a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> result =</div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a2abca6db0c780a4482d1ac9eb6365057">ResetAndSolveWithGivenAssumptions</a>(assumptions);</div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> <span class="keywordflow">if</span> (result == <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>) {</div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838">ExtractAssignment</a>(problem, *solver, solution);</div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> objective = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f">ComputeObjectiveValue</a>(problem, *solution);</div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> logger.Log(CnfObjectiveLine(problem, objective));</div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> }</div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> <span class="keywordflow">if</span> (result != <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885">SatSolver::ASSUMPTIONS_UNSAT</a>) <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> </div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> <span class="comment">// The interesting case: we have an unsat core.</span></div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> <span class="comment">// We need to add new "blocking" variables b_i for all the objective</span></div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> <span class="comment">// variable appearing in the core. Moreover, we will only relax as little</span></div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> <span class="comment">// as possible (to not miss the optimal), so we will enforce that the sum</span></div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> <span class="comment">// of the b_i is exactly one.</span></div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> std::vector<Literal> core = solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#acfbfa9df611cb625ff79785c05784580">GetLastIncompatibleDecisions</a>();</div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a6fb8349259fa849de0789a4ec58a8492">MinimizeCore</a>(solver, &core);</div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> </div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> <span class="comment">// Print the search progress.</span></div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> logger.Log(absl::StrFormat(<span class="stringliteral">"c iter:%d core:%u"</span>, iter, core.size()));</div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> </div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> <span class="comment">// Special case for a singleton core.</span></div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> <span class="keywordflow">if</span> (core.size() == 1) {</div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> <span class="comment">// Find the index of the "objective" variable that need to be fixed in</span></div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> <span class="comment">// its "costly" state.</span></div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> =</div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> std::find(assumptions.begin(), assumptions.end(), core[0]) -</div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> assumptions.begin();</div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, assumptions.size());</div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> </div>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> <span class="comment">// Fix it. We also fix all the associated blocking variables if any.</span></div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> <span class="keywordflow">if</span> (!solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9">AddUnitClause</a>(core[0].Negated())) {</div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> }</div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> <span class="keywordflow">for</span> (<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> : blocking_clauses[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]) {</div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> <span class="keywordflow">if</span> (!solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9">AddUnitClause</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.Negated())) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> }</div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> </div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> <span class="comment">// Erase this entry from the current "objective"</span></div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> std::vector<int> to_delete(1, <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> DeleteVectorIndices(to_delete, &assumptions);</div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> DeleteVectorIndices(to_delete, &blocking_clauses);</div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> symmetry.DeleteIndices(to_delete);</div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> symmetry.StartResolvingNewCore(iter);</div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> </div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> <span class="comment">// We will add 2 * |core.size()| variables.</span></div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> <span class="keyword">const</span> <span class="keywordtype">int</span> old_num_variables = solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2">NumVariables</a>();</div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> <span class="keywordflow">if</span> (core.size() == 2) {</div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> <span class="comment">// Special case. If core.size() == 2, we can use only one blocking</span></div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> <span class="comment">// variable (the other one beeing its negation). This actually do happen</span></div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> <span class="comment">// quite often in practice, so it is worth it.</span></div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb">SetNumVariables</a>(old_num_variables + 3);</div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb">SetNumVariables</a>(old_num_variables + 2 * core.size());</div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> }</div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> </div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> <span class="comment">// Temporary vectors for the constraint (sum new blocking variable == 1).</span></div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> std::vector<LiteralWithCoeff> at_most_one_constraint;</div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> std::vector<Literal> at_least_one_constraint;</div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> </div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> <span class="comment">// This will be set to false if the problem becomes unsat while adding a</span></div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> <span class="comment">// new clause. This is unlikely, but may be possible.</span></div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> <span class="keywordtype">bool</span> ok = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> </div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> <span class="comment">// Loop over the core.</span></div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0;</div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < core.size(); ++i) {</div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> <span class="comment">// Since the assumptions appear in order in the core, we can find the</span></div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> <span class="comment">// relevant "objective" variable efficiently with a simple linear scan</span></div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> <span class="comment">// in the assumptions vector (done with index).</span></div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> =</div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> std::find(assumptions.begin() + <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, assumptions.end(), core[i]) -</div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> assumptions.begin();</div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, assumptions.size());</div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> </div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> <span class="comment">// The new blocking and assumption variables for this core entry.</span></div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>(BooleanVariable(old_num_variables + i), <span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>(BooleanVariable(old_num_variables + core.size() + i), <span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> <span class="keywordflow">if</span> (core.size() == 2) {</div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> = <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(BooleanVariable(old_num_variables + 2), <span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> <span class="keywordflow">if</span> (i == 1) <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> = <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.Negated();</div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> }</div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> </div>
|
|
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span> <span class="comment">// Symmetry breaking clauses.</span></div>
|
|
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> <span class="keywordflow">for</span> (<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l : symmetry.ProcessLiteral(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>)) {</div>
|
|
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> ok &= solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(l.Negated(), <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.Negated());</div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> }</div>
|
|
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> </div>
|
|
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> <span class="comment">// Note(user): There is more than one way to encode the algorithm in</span></div>
|
|
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> <span class="comment">// SAT. Here we "delete" the old blocking clause and add a new one. In</span></div>
|
|
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> <span class="comment">// the WPM1 algorithm below, the blocking clause is decomposed into</span></div>
|
|
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span> <span class="comment">// 3-SAT and we don't need to delete anything.</span></div>
|
|
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> </div>
|
|
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span> <span class="comment">// First, fix the old "assumption" variable to false, which has the</span></div>
|
|
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> <span class="comment">// effect of deleting the old clause from the solver.</span></div>
|
|
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> <span class="keywordflow">if</span> (assumptions[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].Variable() >= problem.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#aad5531f45ca462be2f1b7ee7a5cb1372">num_variables</a>()) {</div>
|
|
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9">AddUnitClause</a>(assumptions[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].Negated()));</div>
|
|
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> }</div>
|
|
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> </div>
|
|
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> <span class="comment">// Add the new blocking variable.</span></div>
|
|
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> blocking_clauses[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].push_back(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div>
|
|
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> </div>
|
|
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> <span class="comment">// Add the new clause to the solver. Temporary including the</span></div>
|
|
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> <span class="comment">// assumption, but removing it right afterwards.</span></div>
|
|
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> blocking_clauses[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].push_back(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>);</div>
|
|
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> ok &= solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#af67fe279478772a6d1492a7f673bda5d">AddProblemClause</a>(blocking_clauses[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div>
|
|
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> blocking_clauses[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].pop_back();</div>
|
|
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> </div>
|
|
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> <span class="comment">// For the "== 1" constraint on the blocking literals.</span></div>
|
|
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> at_most_one_constraint.push_back(<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, 1.0));</div>
|
|
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> at_least_one_constraint.push_back(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div>
|
|
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> </div>
|
|
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> <span class="comment">// The new assumption variable replace the old one.</span></div>
|
|
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> assumptions[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.Negated();</div>
|
|
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> }</div>
|
|
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> </div>
|
|
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span> <span class="comment">// Add the "<= 1" side of the "== 1" constraint.</span></div>
|
|
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> ok &= solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653">AddLinearConstraint</a>(<span class="keyword">false</span>, <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>(0), <span class="keyword">true</span>,</div>
|
|
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>(1.0),</div>
|
|
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> &at_most_one_constraint);</div>
|
|
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> </div>
|
|
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span> <span class="comment">// TODO(user): The algorithm does not really need the >= 1 side of this</span></div>
|
|
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> <span class="comment">// constraint. Initial investigation shows that it doesn't really help,</span></div>
|
|
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> <span class="comment">// but investigate more.</span></div>
|
|
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span> <span class="keywordflow">if</span> (<span class="comment">/* DISABLES CODE */</span> (<span class="keyword">false</span>)) {</div>
|
|
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> ok &= solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#af67fe279478772a6d1492a7f673bda5d">AddProblemClause</a>(at_least_one_constraint);</div>
|
|
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"> 457</span> }</div>
|
|
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> </div>
|
|
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> <span class="keywordflow">if</span> (!ok) {</div>
|
|
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> <a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code hl_variable" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"Infeasible while adding a clause."</span>;</div>
|
|
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> }</div>
|
|
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> }</div>
|
|
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> }</div>
|
|
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span>}</div>
|
|
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> </div>
|
|
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#aa4fe3dc3bb5374a3ae58ae0f551be128"> 467</a></span><a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aa4fe3dc3bb5374a3ae58ae0f551be128">SolveWithWPM1</a>(<a class="code hl_enumeration" href="namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238">LogBehavior</a> log,</div>
|
|
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html">LinearBooleanProblem</a>& problem,</div>
|
|
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver,</div>
|
|
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span> std::vector<bool>* solution) {</div>
|
|
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span> Logger logger(log);</div>
|
|
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> FuMalikSymmetryBreaker symmetry;</div>
|
|
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> </div>
|
|
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span> <span class="comment">// The current lower_bound on the cost.</span></div>
|
|
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"> 475</span> <span class="comment">// It will be correct after the initialization.</span></div>
|
|
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>(<span class="keyword">static_cast<</span>int64_t<span class="keyword">></span>(problem.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a9fd8f81a798fd34a843b007c10e40d6b">objective</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#a96ffc785b7b2135c7980c985883ffdd3">offset</a>()));</div>
|
|
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>(<a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>());</div>
|
|
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> </div>
|
|
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"> 479</span> <span class="comment">// The assumption literals and their associated cost.</span></div>
|
|
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> std::vector<Literal> assumptions;</div>
|
|
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span> std::vector<Coefficient> costs;</div>
|
|
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> std::vector<Literal> reference;</div>
|
|
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> </div>
|
|
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> <span class="comment">// Initialization.</span></div>
|
|
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_objective.html">LinearObjective</a>& objective = problem.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a9fd8f81a798fd34a843b007c10e40d6b">objective</a>();</div>
|
|
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> <a class="code hl_define" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(objective.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#afddea8f1f515fb9507a2e5c2ceb1b29e">coefficients_size</a>(), 0);</div>
|
|
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < objective.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#a72d41feda9a93c11089d3d99d6270999">literals_size</a>(); ++i) {</div>
|
|
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>(objective.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#ae257a6514082fdcf3a9f33dda44c40b7">literals</a>(i));</div>
|
|
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> coeff(objective.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#a63e564949c709325f7c31376b8db8b64">coefficients</a>(i));</div>
|
|
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> </div>
|
|
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> <span class="comment">// We want to minimize the cost when the assumption is true.</span></div>
|
|
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> <span class="comment">// Note that initially, we do not create any extra variables.</span></div>
|
|
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> <span class="keywordflow">if</span> (coeff > 0) {</div>
|
|
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> assumptions.push_back(<a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>());</div>
|
|
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> costs.push_back(coeff);</div>
|
|
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> assumptions.push_back(<a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> costs.push_back(-coeff);</div>
|
|
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span> <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a> += coeff;</div>
|
|
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno"> 500</span> }</div>
|
|
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno"> 501</span> }</div>
|
|
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"> 502</span> reference = assumptions;</div>
|
|
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno"> 503</span> </div>
|
|
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> <span class="comment">// This is used by the "stratified" approach.</span></div>
|
|
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> stratified_lower_bound =</div>
|
|
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> *std::max_element(costs.begin(), costs.end());</div>
|
|
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span> </div>
|
|
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> <span class="comment">// Print the number of variables with a non-zero cost.</span></div>
|
|
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span> logger.Log(absl::StrFormat(<span class="stringliteral">"c #weights:%u #vars:%d #constraints:%d"</span>,</div>
|
|
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> assumptions.size(), problem.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#aad5531f45ca462be2f1b7ee7a5cb1372">num_variables</a>(),</div>
|
|
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span> problem.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#aeaf0da781ca9b370d96b7fbd3f74266a">constraints_size</a>()));</div>
|
|
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</span> </div>
|
|
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> iter = 0;; ++iter) {</div>
|
|
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"> 514</span> <span class="comment">// This is called "hardening" in the literature.</span></div>
|
|
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"> 515</span> <span class="comment">// Basically, we know that there is only hardening_threshold weight left</span></div>
|
|
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno"> 516</span> <span class="comment">// to distribute, so any assumption with a greater cost than this can never</span></div>
|
|
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> <span class="comment">// be false. We fix it instead of treating it as an assumption.</span></div>
|
|
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"> 519</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> hardening_threshold = <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> - <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>;</div>
|
|
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"> 520</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(hardening_threshold, 0);</div>
|
|
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno"> 521</span> std::vector<int> to_delete;</div>
|
|
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"> 522</span> <span class="keywordtype">int</span> num_above_threshold = 0;</div>
|
|
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < assumptions.size(); ++i) {</div>
|
|
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"> 524</span> <span class="keywordflow">if</span> (costs[i] > hardening_threshold) {</div>
|
|
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> <span class="keywordflow">if</span> (!solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9">AddUnitClause</a>(assumptions[i])) {</div>
|
|
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"> 526</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno"> 527</span> }</div>
|
|
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"> 528</span> to_delete.push_back(i);</div>
|
|
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno"> 529</span> ++num_above_threshold;</div>
|
|
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno"> 530</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"> 531</span> <span class="comment">// This impact the stratification heuristic.</span></div>
|
|
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno"> 532</span> <span class="keywordflow">if</span> (solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b">Assignment</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(assumptions[i])) {</div>
|
|
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno"> 533</span> to_delete.push_back(i);</div>
|
|
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"> 534</span> }</div>
|
|
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno"> 535</span> }</div>
|
|
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno"> 536</span> }</div>
|
|
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"> 537</span> <span class="keywordflow">if</span> (!to_delete.empty()) {</div>
|
|
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno"> 538</span> logger.Log(absl::StrFormat(<span class="stringliteral">"c fixed %u assumptions, %d with cost > %d"</span>,</div>
|
|
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno"> 539</span> to_delete.size(), num_above_threshold,</div>
|
|
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"> 540</span> hardening_threshold.value()));</div>
|
|
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno"> 541</span> DeleteVectorIndices(to_delete, &assumptions);</div>
|
|
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno"> 542</span> DeleteVectorIndices(to_delete, &costs);</div>
|
|
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno"> 543</span> DeleteVectorIndices(to_delete, &reference);</div>
|
|
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno"> 544</span> symmetry.DeleteIndices(to_delete);</div>
|
|
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno"> 545</span> }</div>
|
|
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno"> 546</span> </div>
|
|
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> <span class="comment">// This is the "stratification" part.</span></div>
|
|
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"> 548</span> <span class="comment">// Extract the assumptions with a cost >= stratified_lower_bound.</span></div>
|
|
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> std::vector<Literal> assumptions_subset;</div>
|
|
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno"> 550</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < assumptions.size(); ++i) {</div>
|
|
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"> 551</span> <span class="keywordflow">if</span> (costs[i] >= stratified_lower_bound) {</div>
|
|
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"> 552</span> assumptions_subset.push_back(assumptions[i]);</div>
|
|
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> }</div>
|
|
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno"> 554</span> }</div>
|
|
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno"> 555</span> </div>
|
|
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno"> 556</span> <span class="keyword">const</span> <a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> result =</div>
|
|
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"> 557</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a2abca6db0c780a4482d1ac9eb6365057">ResetAndSolveWithGivenAssumptions</a>(assumptions_subset);</div>
|
|
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno"> 558</span> <span class="keywordflow">if</span> (result == <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>) {</div>
|
|
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno"> 559</span> <span class="comment">// If not all assumptions were taken, continue with a lower stratified</span></div>
|
|
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"> 560</span> <span class="comment">// bound. Otherwise we have an optimal solution!</span></div>
|
|
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"> 561</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno"> 562</span> <span class="comment">// TODO(user): Try more advanced variant where the bound is lowered by</span></div>
|
|
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno"> 563</span> <span class="comment">// more than this minimal amount.</span></div>
|
|
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno"> 564</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> old_lower_bound = stratified_lower_bound;</div>
|
|
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno"> 565</span> <span class="keywordflow">for</span> (<a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> : costs) {</div>
|
|
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno"> 566</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> < old_lower_bound) {</div>
|
|
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno"> 567</span> <span class="keywordflow">if</span> (stratified_lower_bound == old_lower_bound ||</div>
|
|
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno"> 568</span> <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> > stratified_lower_bound) {</div>
|
|
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno"> 569</span> stratified_lower_bound = <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>;</div>
|
|
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno"> 570</span> }</div>
|
|
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno"> 571</span> }</div>
|
|
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno"> 572</span> }</div>
|
|
<div class="line"><a id="l00573" name="l00573"></a><span class="lineno"> 573</span> </div>
|
|
<div class="line"><a id="l00574" name="l00574"></a><span class="lineno"> 574</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838">ExtractAssignment</a>(problem, *solver, solution);</div>
|
|
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno"> 575</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1">IsAssignmentValid</a>(problem, *solution));</div>
|
|
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno"> 576</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> objective_offset(</div>
|
|
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"> 577</span> <span class="keyword">static_cast<</span>int64_t<span class="keyword">></span>(problem.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a9fd8f81a798fd34a843b007c10e40d6b">objective</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#a96ffc785b7b2135c7980c985883ffdd3">offset</a>()));</div>
|
|
<div class="line"><a id="l00578" name="l00578"></a><span class="lineno"> 578</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> objective = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f">ComputeObjectiveValue</a>(problem, *solution);</div>
|
|
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno"> 579</span> <span class="keywordflow">if</span> (objective + objective_offset < <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div>
|
|
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno"> 580</span> logger.Log(CnfObjectiveLine(problem, objective));</div>
|
|
<div class="line"><a id="l00581" name="l00581"></a><span class="lineno"> 581</span> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> = objective + objective_offset;</div>
|
|
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno"> 582</span> }</div>
|
|
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno"> 583</span> </div>
|
|
<div class="line"><a id="l00584" name="l00584"></a><span class="lineno"> 584</span> <span class="keywordflow">if</span> (stratified_lower_bound < old_lower_bound) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00585" name="l00585"></a><span class="lineno"> 585</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00586" name="l00586"></a><span class="lineno"> 586</span> }</div>
|
|
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno"> 587</span> <span class="keywordflow">if</span> (result != <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885">SatSolver::ASSUMPTIONS_UNSAT</a>) <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l00588" name="l00588"></a><span class="lineno"> 588</span> </div>
|
|
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno"> 589</span> <span class="comment">// The interesting case: we have an unsat core.</span></div>
|
|
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno"> 590</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno"> 591</span> <span class="comment">// We need to add new "blocking" variables b_i for all the objective</span></div>
|
|
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno"> 592</span> <span class="comment">// variables appearing in the core. Moreover, we will only relax as little</span></div>
|
|
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno"> 593</span> <span class="comment">// as possible (to not miss the optimal), so we will enforce that the sum</span></div>
|
|
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno"> 594</span> <span class="comment">// of the b_i is exactly one.</span></div>
|
|
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno"> 595</span> std::vector<Literal> core = solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#acfbfa9df611cb625ff79785c05784580">GetLastIncompatibleDecisions</a>();</div>
|
|
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno"> 596</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a6fb8349259fa849de0789a4ec58a8492">MinimizeCore</a>(solver, &core);</div>
|
|
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno"> 597</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno"> 598</span> </div>
|
|
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno"> 599</span> <span class="comment">// Compute the min cost of all the assertions in the core.</span></div>
|
|
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno"> 600</span> <span class="comment">// The lower bound will be updated by that much.</span></div>
|
|
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno"> 601</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> min_cost = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18">kCoefficientMax</a>;</div>
|
|
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno"> 602</span> {</div>
|
|
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno"> 603</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0;</div>
|
|
<div class="line"><a id="l00604" name="l00604"></a><span class="lineno"> 604</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < core.size(); ++i) {</div>
|
|
<div class="line"><a id="l00605" name="l00605"></a><span class="lineno"> 605</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> =</div>
|
|
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno"> 606</span> std::find(assumptions.begin() + <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, assumptions.end(), core[i]) -</div>
|
|
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno"> 607</span> assumptions.begin();</div>
|
|
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno"> 608</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, assumptions.size());</div>
|
|
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno"> 609</span> min_cost = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_cost, costs[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div>
|
|
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno"> 610</span> }</div>
|
|
<div class="line"><a id="l00611" name="l00611"></a><span class="lineno"> 611</span> }</div>
|
|
<div class="line"><a id="l00612" name="l00612"></a><span class="lineno"> 612</span> <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a> += min_cost;</div>
|
|
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno"> 613</span> </div>
|
|
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno"> 614</span> <span class="comment">// Print the search progress.</span></div>
|
|
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno"> 615</span> logger.Log(absl::StrFormat(</div>
|
|
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno"> 616</span> <span class="stringliteral">"c iter:%d core:%u lb:%d min_cost:%d strat:%d"</span>, iter, core.size(),</div>
|
|
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno"> 617</span> <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>.value(), min_cost.value(), stratified_lower_bound.value()));</div>
|
|
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno"> 618</span> </div>
|
|
<div class="line"><a id="l00619" name="l00619"></a><span class="lineno"> 619</span> <span class="comment">// This simple line helps a lot on the packup-wpms instances!</span></div>
|
|
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno"> 620</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno"> 621</span> <span class="comment">// TODO(user): That was because of a bug before in the way</span></div>
|
|
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno"> 622</span> <span class="comment">// stratified_lower_bound was decremented, not sure it helps that much now.</span></div>
|
|
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno"> 623</span> <span class="keywordflow">if</span> (min_cost > stratified_lower_bound) {</div>
|
|
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno"> 624</span> stratified_lower_bound = min_cost;</div>
|
|
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno"> 625</span> }</div>
|
|
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno"> 626</span> </div>
|
|
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno"> 627</span> <span class="comment">// Special case for a singleton core.</span></div>
|
|
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno"> 628</span> <span class="keywordflow">if</span> (core.size() == 1) {</div>
|
|
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno"> 629</span> <span class="comment">// Find the index of the "objective" variable that need to be fixed in</span></div>
|
|
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno"> 630</span> <span class="comment">// its "costly" state.</span></div>
|
|
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno"> 631</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> =</div>
|
|
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno"> 632</span> std::find(assumptions.begin(), assumptions.end(), core[0]) -</div>
|
|
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno"> 633</span> assumptions.begin();</div>
|
|
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno"> 634</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, assumptions.size());</div>
|
|
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno"> 635</span> </div>
|
|
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno"> 636</span> <span class="comment">// Fix it.</span></div>
|
|
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno"> 637</span> <span class="keywordflow">if</span> (!solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9">AddUnitClause</a>(core[0].Negated())) {</div>
|
|
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno"> 638</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno"> 639</span> }</div>
|
|
<div class="line"><a id="l00640" name="l00640"></a><span class="lineno"> 640</span> </div>
|
|
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno"> 641</span> <span class="comment">// Erase this entry from the current "objective".</span></div>
|
|
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno"> 642</span> std::vector<int> to_delete(1, <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno"> 643</span> DeleteVectorIndices(to_delete, &assumptions);</div>
|
|
<div class="line"><a id="l00644" name="l00644"></a><span class="lineno"> 644</span> DeleteVectorIndices(to_delete, &costs);</div>
|
|
<div class="line"><a id="l00645" name="l00645"></a><span class="lineno"> 645</span> DeleteVectorIndices(to_delete, &reference);</div>
|
|
<div class="line"><a id="l00646" name="l00646"></a><span class="lineno"> 646</span> symmetry.DeleteIndices(to_delete);</div>
|
|
<div class="line"><a id="l00647" name="l00647"></a><span class="lineno"> 647</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno"> 648</span> symmetry.StartResolvingNewCore(iter);</div>
|
|
<div class="line"><a id="l00649" name="l00649"></a><span class="lineno"> 649</span> </div>
|
|
<div class="line"><a id="l00650" name="l00650"></a><span class="lineno"> 650</span> <span class="comment">// We will add 2 * |core.size()| variables.</span></div>
|
|
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno"> 651</span> <span class="keyword">const</span> <span class="keywordtype">int</span> old_num_variables = solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2">NumVariables</a>();</div>
|
|
<div class="line"><a id="l00652" name="l00652"></a><span class="lineno"> 652</span> <span class="keywordflow">if</span> (core.size() == 2) {</div>
|
|
<div class="line"><a id="l00653" name="l00653"></a><span class="lineno"> 653</span> <span class="comment">// Special case. If core.size() == 2, we can use only one blocking</span></div>
|
|
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno"> 654</span> <span class="comment">// variable (the other one beeing its negation). This actually do happen</span></div>
|
|
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno"> 655</span> <span class="comment">// quite often in practice, so it is worth it.</span></div>
|
|
<div class="line"><a id="l00656" name="l00656"></a><span class="lineno"> 656</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb">SetNumVariables</a>(old_num_variables + 3);</div>
|
|
<div class="line"><a id="l00657" name="l00657"></a><span class="lineno"> 657</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00658" name="l00658"></a><span class="lineno"> 658</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb">SetNumVariables</a>(old_num_variables + 2 * core.size());</div>
|
|
<div class="line"><a id="l00659" name="l00659"></a><span class="lineno"> 659</span> }</div>
|
|
<div class="line"><a id="l00660" name="l00660"></a><span class="lineno"> 660</span> </div>
|
|
<div class="line"><a id="l00661" name="l00661"></a><span class="lineno"> 661</span> <span class="comment">// Temporary vectors for the constraint (sum new blocking variable == 1).</span></div>
|
|
<div class="line"><a id="l00662" name="l00662"></a><span class="lineno"> 662</span> std::vector<LiteralWithCoeff> at_most_one_constraint;</div>
|
|
<div class="line"><a id="l00663" name="l00663"></a><span class="lineno"> 663</span> std::vector<Literal> at_least_one_constraint;</div>
|
|
<div class="line"><a id="l00664" name="l00664"></a><span class="lineno"> 664</span> </div>
|
|
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno"> 665</span> <span class="comment">// This will be set to false if the problem becomes unsat while adding a</span></div>
|
|
<div class="line"><a id="l00666" name="l00666"></a><span class="lineno"> 666</span> <span class="comment">// new clause. This is unlikely, but may be possible.</span></div>
|
|
<div class="line"><a id="l00667" name="l00667"></a><span class="lineno"> 667</span> <span class="keywordtype">bool</span> ok = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno"> 668</span> </div>
|
|
<div class="line"><a id="l00669" name="l00669"></a><span class="lineno"> 669</span> <span class="comment">// Loop over the core.</span></div>
|
|
<div class="line"><a id="l00670" name="l00670"></a><span class="lineno"> 670</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0;</div>
|
|
<div class="line"><a id="l00671" name="l00671"></a><span class="lineno"> 671</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < core.size(); ++i) {</div>
|
|
<div class="line"><a id="l00672" name="l00672"></a><span class="lineno"> 672</span> <span class="comment">// Since the assumptions appear in order in the core, we can find the</span></div>
|
|
<div class="line"><a id="l00673" name="l00673"></a><span class="lineno"> 673</span> <span class="comment">// relevant "objective" variable efficiently with a simple linear scan</span></div>
|
|
<div class="line"><a id="l00674" name="l00674"></a><span class="lineno"> 674</span> <span class="comment">// in the assumptions vector (done with index).</span></div>
|
|
<div class="line"><a id="l00675" name="l00675"></a><span class="lineno"> 675</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> =</div>
|
|
<div class="line"><a id="l00676" name="l00676"></a><span class="lineno"> 676</span> std::find(assumptions.begin() + <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, assumptions.end(), core[i]) -</div>
|
|
<div class="line"><a id="l00677" name="l00677"></a><span class="lineno"> 677</span> assumptions.begin();</div>
|
|
<div class="line"><a id="l00678" name="l00678"></a><span class="lineno"> 678</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, assumptions.size());</div>
|
|
<div class="line"><a id="l00679" name="l00679"></a><span class="lineno"> 679</span> </div>
|
|
<div class="line"><a id="l00680" name="l00680"></a><span class="lineno"> 680</span> <span class="comment">// The new blocking and assumption variables for this core entry.</span></div>
|
|
<div class="line"><a id="l00681" name="l00681"></a><span class="lineno"> 681</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>(BooleanVariable(old_num_variables + i), <span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00682" name="l00682"></a><span class="lineno"> 682</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>(BooleanVariable(old_num_variables + core.size() + i), <span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00683" name="l00683"></a><span class="lineno"> 683</span> <span class="keywordflow">if</span> (core.size() == 2) {</div>
|
|
<div class="line"><a id="l00684" name="l00684"></a><span class="lineno"> 684</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> = <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(BooleanVariable(old_num_variables + 2), <span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00685" name="l00685"></a><span class="lineno"> 685</span> <span class="keywordflow">if</span> (i == 1) <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> = <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.Negated();</div>
|
|
<div class="line"><a id="l00686" name="l00686"></a><span class="lineno"> 686</span> }</div>
|
|
<div class="line"><a id="l00687" name="l00687"></a><span class="lineno"> 687</span> </div>
|
|
<div class="line"><a id="l00688" name="l00688"></a><span class="lineno"> 688</span> <span class="comment">// a false & b false => previous assumptions (which was false).</span></div>
|
|
<div class="line"><a id="l00689" name="l00689"></a><span class="lineno"> 689</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> old_a = assumptions[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a id="l00690" name="l00690"></a><span class="lineno"> 690</span> ok &= solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a0e8b0117614d340615ab66abec430d78">AddTernaryClause</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, old_a);</div>
|
|
<div class="line"><a id="l00691" name="l00691"></a><span class="lineno"> 691</span> </div>
|
|
<div class="line"><a id="l00692" name="l00692"></a><span class="lineno"> 692</span> <span class="comment">// Optional. Also add the two implications a => x and b => x where x is</span></div>
|
|
<div class="line"><a id="l00693" name="l00693"></a><span class="lineno"> 693</span> <span class="comment">// the negation of the previous assumption variable.</span></div>
|
|
<div class="line"><a id="l00694" name="l00694"></a><span class="lineno"> 694</span> ok &= solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.Negated(), old_a.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>());</div>
|
|
<div class="line"><a id="l00695" name="l00695"></a><span class="lineno"> 695</span> ok &= solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.Negated(), old_a.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>());</div>
|
|
<div class="line"><a id="l00696" name="l00696"></a><span class="lineno"> 696</span> </div>
|
|
<div class="line"><a id="l00697" name="l00697"></a><span class="lineno"> 697</span> <span class="comment">// Optional. Also add the implication a => not(b).</span></div>
|
|
<div class="line"><a id="l00698" name="l00698"></a><span class="lineno"> 698</span> ok &= solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.Negated(), <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.Negated());</div>
|
|
<div class="line"><a id="l00699" name="l00699"></a><span class="lineno"> 699</span> </div>
|
|
<div class="line"><a id="l00700" name="l00700"></a><span class="lineno"> 700</span> <span class="comment">// This is the difference with the Fu & Malik algorithm.</span></div>
|
|
<div class="line"><a id="l00701" name="l00701"></a><span class="lineno"> 701</span> <span class="comment">// If the soft clause protected by old_a has a cost greater than</span></div>
|
|
<div class="line"><a id="l00702" name="l00702"></a><span class="lineno"> 702</span> <span class="comment">// min_cost then:</span></div>
|
|
<div class="line"><a id="l00703" name="l00703"></a><span class="lineno"> 703</span> <span class="comment">// - its cost is disminished by min_cost.</span></div>
|
|
<div class="line"><a id="l00704" name="l00704"></a><span class="lineno"> 704</span> <span class="comment">// - an identical clause with cost min_cost is artificially added to</span></div>
|
|
<div class="line"><a id="l00705" name="l00705"></a><span class="lineno"> 705</span> <span class="comment">// the problem.</span></div>
|
|
<div class="line"><a id="l00706" name="l00706"></a><span class="lineno"> 706</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(costs[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>], min_cost);</div>
|
|
<div class="line"><a id="l00707" name="l00707"></a><span class="lineno"> 707</span> <span class="keywordflow">if</span> (costs[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] == min_cost) {</div>
|
|
<div class="line"><a id="l00708" name="l00708"></a><span class="lineno"> 708</span> <span class="comment">// The new assumption variable replaces the old one.</span></div>
|
|
<div class="line"><a id="l00709" name="l00709"></a><span class="lineno"> 709</span> assumptions[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.Negated();</div>
|
|
<div class="line"><a id="l00710" name="l00710"></a><span class="lineno"> 710</span> </div>
|
|
<div class="line"><a id="l00711" name="l00711"></a><span class="lineno"> 711</span> <span class="comment">// Symmetry breaking clauses.</span></div>
|
|
<div class="line"><a id="l00712" name="l00712"></a><span class="lineno"> 712</span> <span class="keywordflow">for</span> (<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l : symmetry.ProcessLiteral(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>)) {</div>
|
|
<div class="line"><a id="l00713" name="l00713"></a><span class="lineno"> 713</span> ok &= solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">AddBinaryClause</a>(l.Negated(), <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.Negated());</div>
|
|
<div class="line"><a id="l00714" name="l00714"></a><span class="lineno"> 714</span> }</div>
|
|
<div class="line"><a id="l00715" name="l00715"></a><span class="lineno"> 715</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00716" name="l00716"></a><span class="lineno"> 716</span> <span class="comment">// Since the cost of the given index changes, we need to start a new</span></div>
|
|
<div class="line"><a id="l00717" name="l00717"></a><span class="lineno"> 717</span> <span class="comment">// "equivalence" class for the symmetry breaking algo and clear the</span></div>
|
|
<div class="line"><a id="l00718" name="l00718"></a><span class="lineno"> 718</span> <span class="comment">// old one.</span></div>
|
|
<div class="line"><a id="l00719" name="l00719"></a><span class="lineno"> 719</span> symmetry.AddInfo(assumptions.size(), <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div>
|
|
<div class="line"><a id="l00720" name="l00720"></a><span class="lineno"> 720</span> symmetry.ClearInfo(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a id="l00721" name="l00721"></a><span class="lineno"> 721</span> </div>
|
|
<div class="line"><a id="l00722" name="l00722"></a><span class="lineno"> 722</span> <span class="comment">// Reduce the cost of the old assumption.</span></div>
|
|
<div class="line"><a id="l00723" name="l00723"></a><span class="lineno"> 723</span> costs[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] -= min_cost;</div>
|
|
<div class="line"><a id="l00724" name="l00724"></a><span class="lineno"> 724</span> </div>
|
|
<div class="line"><a id="l00725" name="l00725"></a><span class="lineno"> 725</span> <span class="comment">// We add the new assumption with a cost of min_cost.</span></div>
|
|
<div class="line"><a id="l00726" name="l00726"></a><span class="lineno"> 726</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00727" name="l00727"></a><span class="lineno"> 727</span> <span class="comment">// Note(user): I think it is nice that these are added after old_a</span></div>
|
|
<div class="line"><a id="l00728" name="l00728"></a><span class="lineno"> 728</span> <span class="comment">// because assuming old_a will implies all the derived assumptions to</span></div>
|
|
<div class="line"><a id="l00729" name="l00729"></a><span class="lineno"> 729</span> <span class="comment">// true, and thus they will never appear in a core until old_a is not</span></div>
|
|
<div class="line"><a id="l00730" name="l00730"></a><span class="lineno"> 730</span> <span class="comment">// an assumption anymore.</span></div>
|
|
<div class="line"><a id="l00731" name="l00731"></a><span class="lineno"> 731</span> assumptions.push_back(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.Negated());</div>
|
|
<div class="line"><a id="l00732" name="l00732"></a><span class="lineno"> 732</span> costs.push_back(min_cost);</div>
|
|
<div class="line"><a id="l00733" name="l00733"></a><span class="lineno"> 733</span> reference.push_back(reference[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div>
|
|
<div class="line"><a id="l00734" name="l00734"></a><span class="lineno"> 734</span> }</div>
|
|
<div class="line"><a id="l00735" name="l00735"></a><span class="lineno"> 735</span> </div>
|
|
<div class="line"><a id="l00736" name="l00736"></a><span class="lineno"> 736</span> <span class="comment">// For the "<= 1" constraint on the blocking literals.</span></div>
|
|
<div class="line"><a id="l00737" name="l00737"></a><span class="lineno"> 737</span> <span class="comment">// Note(user): we don't add the ">= 1" side because it is not needed for</span></div>
|
|
<div class="line"><a id="l00738" name="l00738"></a><span class="lineno"> 738</span> <span class="comment">// the correctness and it doesn't seems to help.</span></div>
|
|
<div class="line"><a id="l00739" name="l00739"></a><span class="lineno"> 739</span> at_most_one_constraint.push_back(<a class="code hl_struct" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>(<a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, 1.0));</div>
|
|
<div class="line"><a id="l00740" name="l00740"></a><span class="lineno"> 740</span> </div>
|
|
<div class="line"><a id="l00741" name="l00741"></a><span class="lineno"> 741</span> <span class="comment">// Because we have a core, we know that at least one of the initial</span></div>
|
|
<div class="line"><a id="l00742" name="l00742"></a><span class="lineno"> 742</span> <span class="comment">// problem variables must be true. This seems to help a bit.</span></div>
|
|
<div class="line"><a id="l00743" name="l00743"></a><span class="lineno"> 743</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00744" name="l00744"></a><span class="lineno"> 744</span> <span class="comment">// TODO(user): Experiment more.</span></div>
|
|
<div class="line"><a id="l00745" name="l00745"></a><span class="lineno"> 745</span> at_least_one_constraint.push_back(reference[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].Negated());</div>
|
|
<div class="line"><a id="l00746" name="l00746"></a><span class="lineno"> 746</span> }</div>
|
|
<div class="line"><a id="l00747" name="l00747"></a><span class="lineno"> 747</span> </div>
|
|
<div class="line"><a id="l00748" name="l00748"></a><span class="lineno"> 748</span> <span class="comment">// Add the "<= 1" side of the "== 1" constraint.</span></div>
|
|
<div class="line"><a id="l00749" name="l00749"></a><span class="lineno"> 749</span> ok &= solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653">AddLinearConstraint</a>(<span class="keyword">false</span>, <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>(0), <span class="keyword">true</span>,</div>
|
|
<div class="line"><a id="l00750" name="l00750"></a><span class="lineno"> 750</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>(1.0),</div>
|
|
<div class="line"><a id="l00751" name="l00751"></a><span class="lineno"> 751</span> &at_most_one_constraint);</div>
|
|
<div class="line"><a id="l00752" name="l00752"></a><span class="lineno"> 752</span> </div>
|
|
<div class="line"><a id="l00753" name="l00753"></a><span class="lineno"> 753</span> <span class="comment">// Optional. Add the ">= 1" constraint on the initial problem variables.</span></div>
|
|
<div class="line"><a id="l00754" name="l00754"></a><span class="lineno"> 754</span> ok &= solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#af67fe279478772a6d1492a7f673bda5d">AddProblemClause</a>(at_least_one_constraint);</div>
|
|
<div class="line"><a id="l00755" name="l00755"></a><span class="lineno"> 755</span> </div>
|
|
<div class="line"><a id="l00756" name="l00756"></a><span class="lineno"> 756</span> <span class="keywordflow">if</span> (!ok) {</div>
|
|
<div class="line"><a id="l00757" name="l00757"></a><span class="lineno"> 757</span> <a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code hl_variable" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"Unsat while adding a clause."</span>;</div>
|
|
<div class="line"><a id="l00758" name="l00758"></a><span class="lineno"> 758</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00759" name="l00759"></a><span class="lineno"> 759</span> }</div>
|
|
<div class="line"><a id="l00760" name="l00760"></a><span class="lineno"> 760</span> }</div>
|
|
<div class="line"><a id="l00761" name="l00761"></a><span class="lineno"> 761</span> }</div>
|
|
<div class="line"><a id="l00762" name="l00762"></a><span class="lineno"> 762</span>}</div>
|
|
<div class="line"><a id="l00763" name="l00763"></a><span class="lineno"> 763</span> </div>
|
|
<div class="line"><a id="l00764" name="l00764"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#adb8f016144f3565c4b693b59f9dc69b8"> 764</a></span><a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#adb8f016144f3565c4b693b59f9dc69b8">SolveWithRandomParameters</a>(<a class="code hl_enumeration" href="namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238">LogBehavior</a> log,</div>
|
|
<div class="line"><a id="l00765" name="l00765"></a><span class="lineno"> 765</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html">LinearBooleanProblem</a>& problem,</div>
|
|
<div class="line"><a id="l00766" name="l00766"></a><span class="lineno"> 766</span> <span class="keywordtype">int</span> num_times, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver,</div>
|
|
<div class="line"><a id="l00767" name="l00767"></a><span class="lineno"> 767</span> std::vector<bool>* solution) {</div>
|
|
<div class="line"><a id="l00768" name="l00768"></a><span class="lineno"> 768</span> Logger logger(log);</div>
|
|
<div class="line"><a id="l00769" name="l00769"></a><span class="lineno"> 769</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a> initial_parameters = solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9">parameters</a>();</div>
|
|
<div class="line"><a id="l00770" name="l00770"></a><span class="lineno"> 770</span> </div>
|
|
<div class="line"><a id="l00771" name="l00771"></a><span class="lineno"> 771</span> <a class="code hl_class" href="classoperations__research_1_1_m_t_random.html">MTRandom</a> random(<span class="stringliteral">"A random seed."</span>);</div>
|
|
<div class="line"><a id="l00772" name="l00772"></a><span class="lineno"> 772</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a> = initial_parameters;</div>
|
|
<div class="line"><a id="l00773" name="l00773"></a><span class="lineno"> 773</span> <a class="code hl_class" href="classoperations__research_1_1_time_limit.html">TimeLimit</a> <a class="code hl_variable" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>(<a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#ac1924f07faa4fdf4ca4e7f76813f7c2a">max_time_in_seconds</a>());</div>
|
|
<div class="line"><a id="l00774" name="l00774"></a><span class="lineno"> 774</span> </div>
|
|
<div class="line"><a id="l00775" name="l00775"></a><span class="lineno"> 775</span> <span class="comment">// We start with a low conflict limit and increase it until we are able to</span></div>
|
|
<div class="line"><a id="l00776" name="l00776"></a><span class="lineno"> 776</span> <span class="comment">// solve the problem at least once. After this, the limit stays the same.</span></div>
|
|
<div class="line"><a id="l00777" name="l00777"></a><span class="lineno"> 777</span> <span class="keywordtype">int</span> max_number_of_conflicts = 5;</div>
|
|
<div class="line"><a id="l00778" name="l00778"></a><span class="lineno"> 778</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#ab055fe5de5ab455c769387b42059f031">set_log_search_progress</a>(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00779" name="l00779"></a><span class="lineno"> 779</span> </div>
|
|
<div class="line"><a id="l00780" name="l00780"></a><span class="lineno"> 780</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> min_seen(<a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>());</div>
|
|
<div class="line"><a id="l00781" name="l00781"></a><span class="lineno"> 781</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> max_seen(<a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>());</div>
|
|
<div class="line"><a id="l00782" name="l00782"></a><span class="lineno"> 782</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> best(min_seen);</div>
|
|
<div class="line"><a id="l00783" name="l00783"></a><span class="lineno"> 783</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_times; ++i) {</div>
|
|
<div class="line"><a id="l00784" name="l00784"></a><span class="lineno"> 784</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a id="l00785" name="l00785"></a><span class="lineno"> 785</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aef1ea7e6296a28c0fa0752328d8cb900">RandomizeDecisionHeuristic</a>(&random, &<a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>);</div>
|
|
<div class="line"><a id="l00786" name="l00786"></a><span class="lineno"> 786</span> </div>
|
|
<div class="line"><a id="l00787" name="l00787"></a><span class="lineno"> 787</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a7120a9ef363b14f95108f17415c9c3d0">set_max_number_of_conflicts</a>(max_number_of_conflicts);</div>
|
|
<div class="line"><a id="l00788" name="l00788"></a><span class="lineno"> 788</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#ad7217afa0f5bd97642d0d2291068c7f9">set_max_time_in_seconds</a>(<a class="code hl_variable" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>.<a class="code hl_function" href="classoperations__research_1_1_shared_time_limit.html#a4273b83b06bfbf856393db6d0a9b8715">GetTimeLeft</a>());</div>
|
|
<div class="line"><a id="l00789" name="l00789"></a><span class="lineno"> 789</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#aa148eda9a432e6c798d9e2eecc8645f4">set_random_seed</a>(i);</div>
|
|
<div class="line"><a id="l00790" name="l00790"></a><span class="lineno"> 790</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9d584b84d7b882a6017b072b33475172">SetParameters</a>(<a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>);</div>
|
|
<div class="line"><a id="l00791" name="l00791"></a><span class="lineno"> 791</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a1dc177ee88f0a7ce2e46a032e5c3cf02">ResetDecisionHeuristic</a>();</div>
|
|
<div class="line"><a id="l00792" name="l00792"></a><span class="lineno"> 792</span> </div>
|
|
<div class="line"><a id="l00793" name="l00793"></a><span class="lineno"> 793</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> use_obj = absl::Bernoulli(random, 1.0 / 4);</div>
|
|
<div class="line"><a id="l00794" name="l00794"></a><span class="lineno"> 794</span> <span class="keywordflow">if</span> (use_obj) <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a40254eb00d4590a09d811fe94c727c2a">UseObjectiveForSatAssignmentPreference</a>(problem, solver);</div>
|
|
<div class="line"><a id="l00795" name="l00795"></a><span class="lineno"> 795</span> </div>
|
|
<div class="line"><a id="l00796" name="l00796"></a><span class="lineno"> 796</span> <span class="keyword">const</span> <a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> result = solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a2b006481369eb4f4cb7f3037dfdd8404">Solve</a>();</div>
|
|
<div class="line"><a id="l00797" name="l00797"></a><span class="lineno"> 797</span> <span class="keywordflow">if</span> (result == <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a id="l00798" name="l00798"></a><span class="lineno"> 798</span> <span class="comment">// If the problem is INFEASIBLE after we over-constrained the objective,</span></div>
|
|
<div class="line"><a id="l00799" name="l00799"></a><span class="lineno"> 799</span> <span class="comment">// then we found an optimal solution, otherwise, even the decision problem</span></div>
|
|
<div class="line"><a id="l00800" name="l00800"></a><span class="lineno"> 800</span> <span class="comment">// is INFEASIBLE.</span></div>
|
|
<div class="line"><a id="l00801" name="l00801"></a><span class="lineno"> 801</span> <span class="keywordflow">if</span> (best == <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18">kCoefficientMax</a>) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00802" name="l00802"></a><span class="lineno"> 802</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00803" name="l00803"></a><span class="lineno"> 803</span> }</div>
|
|
<div class="line"><a id="l00804" name="l00804"></a><span class="lineno"> 804</span> <span class="keywordflow">if</span> (result == <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>) {</div>
|
|
<div class="line"><a id="l00805" name="l00805"></a><span class="lineno"> 805</span> <span class="comment">// We augment the number of conflict until we have one feasible solution.</span></div>
|
|
<div class="line"><a id="l00806" name="l00806"></a><span class="lineno"> 806</span> <span class="keywordflow">if</span> (best == <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18">kCoefficientMax</a>) ++max_number_of_conflicts;</div>
|
|
<div class="line"><a id="l00807" name="l00807"></a><span class="lineno"> 807</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>.<a class="code hl_function" href="classoperations__research_1_1_shared_time_limit.html#ad837e6231722ead53bbaf1c6e8f66032">LimitReached</a>()) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>;</div>
|
|
<div class="line"><a id="l00808" name="l00808"></a><span class="lineno"> 808</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00809" name="l00809"></a><span class="lineno"> 809</span> }</div>
|
|
<div class="line"><a id="l00810" name="l00810"></a><span class="lineno"> 810</span> </div>
|
|
<div class="line"><a id="l00811" name="l00811"></a><span class="lineno"> 811</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(result, <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>);</div>
|
|
<div class="line"><a id="l00812" name="l00812"></a><span class="lineno"> 812</span> std::vector<bool> candidate;</div>
|
|
<div class="line"><a id="l00813" name="l00813"></a><span class="lineno"> 813</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838">ExtractAssignment</a>(problem, *solver, &candidate);</div>
|
|
<div class="line"><a id="l00814" name="l00814"></a><span class="lineno"> 814</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1">IsAssignmentValid</a>(problem, candidate));</div>
|
|
<div class="line"><a id="l00815" name="l00815"></a><span class="lineno"> 815</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> objective = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f">ComputeObjectiveValue</a>(problem, candidate);</div>
|
|
<div class="line"><a id="l00816" name="l00816"></a><span class="lineno"> 816</span> <span class="keywordflow">if</span> (objective < best) {</div>
|
|
<div class="line"><a id="l00817" name="l00817"></a><span class="lineno"> 817</span> *solution = candidate;</div>
|
|
<div class="line"><a id="l00818" name="l00818"></a><span class="lineno"> 818</span> best = objective;</div>
|
|
<div class="line"><a id="l00819" name="l00819"></a><span class="lineno"> 819</span> logger.Log(CnfObjectiveLine(problem, objective));</div>
|
|
<div class="line"><a id="l00820" name="l00820"></a><span class="lineno"> 820</span> </div>
|
|
<div class="line"><a id="l00821" name="l00821"></a><span class="lineno"> 821</span> <span class="comment">// Overconstrain the objective.</span></div>
|
|
<div class="line"><a id="l00822" name="l00822"></a><span class="lineno"> 822</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a id="l00823" name="l00823"></a><span class="lineno"> 823</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a07c4372fa55782d13edd24b86130e3ba">AddObjectiveConstraint</a>(problem, <span class="keyword">false</span>, <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>(0), <span class="keyword">true</span>,</div>
|
|
<div class="line"><a id="l00824" name="l00824"></a><span class="lineno"> 824</span> objective - 1, solver)) {</div>
|
|
<div class="line"><a id="l00825" name="l00825"></a><span class="lineno"> 825</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00826" name="l00826"></a><span class="lineno"> 826</span> }</div>
|
|
<div class="line"><a id="l00827" name="l00827"></a><span class="lineno"> 827</span> }</div>
|
|
<div class="line"><a id="l00828" name="l00828"></a><span class="lineno"> 828</span> min_seen = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_seen, objective);</div>
|
|
<div class="line"><a id="l00829" name="l00829"></a><span class="lineno"> 829</span> max_seen = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_seen, objective);</div>
|
|
<div class="line"><a id="l00830" name="l00830"></a><span class="lineno"> 830</span> </div>
|
|
<div class="line"><a id="l00831" name="l00831"></a><span class="lineno"> 831</span> logger.Log(absl::StrCat(</div>
|
|
<div class="line"><a id="l00832" name="l00832"></a><span class="lineno"> 832</span> <span class="stringliteral">"c "</span>, objective.value(), <span class="stringliteral">" ["</span>, min_seen.value(), <span class="stringliteral">", "</span>, max_seen.value(),</div>
|
|
<div class="line"><a id="l00833" name="l00833"></a><span class="lineno"> 833</span> <span class="stringliteral">"] objective_preference: "</span>, use_obj ? <span class="stringliteral">"true"</span> : <span class="stringliteral">"false"</span>, <span class="stringliteral">" "</span>,</div>
|
|
<div class="line"><a id="l00834" name="l00834"></a><span class="lineno"> 834</span> <a class="code hl_function" href="namespaceoperations__research.html#a87d7aa58897e0042898d1c2207deda18">ProtobufShortDebugString</a>(<a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>)));</div>
|
|
<div class="line"><a id="l00835" name="l00835"></a><span class="lineno"> 835</span> }</div>
|
|
<div class="line"><a id="l00836" name="l00836"></a><span class="lineno"> 836</span> </div>
|
|
<div class="line"><a id="l00837" name="l00837"></a><span class="lineno"> 837</span> <span class="comment">// Retore the initial parameter (with an updated time limit).</span></div>
|
|
<div class="line"><a id="l00838" name="l00838"></a><span class="lineno"> 838</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a> = initial_parameters;</div>
|
|
<div class="line"><a id="l00839" name="l00839"></a><span class="lineno"> 839</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#ad7217afa0f5bd97642d0d2291068c7f9">set_max_time_in_seconds</a>(<a class="code hl_variable" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>.<a class="code hl_function" href="classoperations__research_1_1_shared_time_limit.html#a4273b83b06bfbf856393db6d0a9b8715">GetTimeLeft</a>());</div>
|
|
<div class="line"><a id="l00840" name="l00840"></a><span class="lineno"> 840</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9d584b84d7b882a6017b072b33475172">SetParameters</a>(<a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>);</div>
|
|
<div class="line"><a id="l00841" name="l00841"></a><span class="lineno"> 841</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>;</div>
|
|
<div class="line"><a id="l00842" name="l00842"></a><span class="lineno"> 842</span>}</div>
|
|
<div class="line"><a id="l00843" name="l00843"></a><span class="lineno"> 843</span> </div>
|
|
<div class="line"><a id="l00844" name="l00844"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a5cafa03de29acf965c3fc23dfa7eba0a"> 844</a></span><a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5cafa03de29acf965c3fc23dfa7eba0a">SolveWithLinearScan</a>(<a class="code hl_enumeration" href="namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238">LogBehavior</a> log,</div>
|
|
<div class="line"><a id="l00845" name="l00845"></a><span class="lineno"> 845</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html">LinearBooleanProblem</a>& problem,</div>
|
|
<div class="line"><a id="l00846" name="l00846"></a><span class="lineno"> 846</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver,</div>
|
|
<div class="line"><a id="l00847" name="l00847"></a><span class="lineno"> 847</span> std::vector<bool>* solution) {</div>
|
|
<div class="line"><a id="l00848" name="l00848"></a><span class="lineno"> 848</span> Logger logger(log);</div>
|
|
<div class="line"><a id="l00849" name="l00849"></a><span class="lineno"> 849</span> </div>
|
|
<div class="line"><a id="l00850" name="l00850"></a><span class="lineno"> 850</span> <span class="comment">// This has a big positive impact on most problems.</span></div>
|
|
<div class="line"><a id="l00851" name="l00851"></a><span class="lineno"> 851</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a40254eb00d4590a09d811fe94c727c2a">UseObjectiveForSatAssignmentPreference</a>(problem, solver);</div>
|
|
<div class="line"><a id="l00852" name="l00852"></a><span class="lineno"> 852</span> </div>
|
|
<div class="line"><a id="l00853" name="l00853"></a><span class="lineno"> 853</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> objective = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18">kCoefficientMax</a>;</div>
|
|
<div class="line"><a id="l00854" name="l00854"></a><span class="lineno"> 854</span> <span class="keywordflow">if</span> (!solution->empty()) {</div>
|
|
<div class="line"><a id="l00855" name="l00855"></a><span class="lineno"> 855</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1">IsAssignmentValid</a>(problem, *solution));</div>
|
|
<div class="line"><a id="l00856" name="l00856"></a><span class="lineno"> 856</span> objective = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f">ComputeObjectiveValue</a>(problem, *solution);</div>
|
|
<div class="line"><a id="l00857" name="l00857"></a><span class="lineno"> 857</span> }</div>
|
|
<div class="line"><a id="l00858" name="l00858"></a><span class="lineno"> 858</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a id="l00859" name="l00859"></a><span class="lineno"> 859</span> <span class="keywordflow">if</span> (objective != <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18">kCoefficientMax</a>) {</div>
|
|
<div class="line"><a id="l00860" name="l00860"></a><span class="lineno"> 860</span> <span class="comment">// Over constrain the objective.</span></div>
|
|
<div class="line"><a id="l00861" name="l00861"></a><span class="lineno"> 861</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a id="l00862" name="l00862"></a><span class="lineno"> 862</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a07c4372fa55782d13edd24b86130e3ba">AddObjectiveConstraint</a>(problem, <span class="keyword">false</span>, <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a>(0), <span class="keyword">true</span>,</div>
|
|
<div class="line"><a id="l00863" name="l00863"></a><span class="lineno"> 863</span> objective - 1, solver)) {</div>
|
|
<div class="line"><a id="l00864" name="l00864"></a><span class="lineno"> 864</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00865" name="l00865"></a><span class="lineno"> 865</span> }</div>
|
|
<div class="line"><a id="l00866" name="l00866"></a><span class="lineno"> 866</span> }</div>
|
|
<div class="line"><a id="l00867" name="l00867"></a><span class="lineno"> 867</span> </div>
|
|
<div class="line"><a id="l00868" name="l00868"></a><span class="lineno"> 868</span> <span class="comment">// Solve the problem.</span></div>
|
|
<div class="line"><a id="l00869" name="l00869"></a><span class="lineno"> 869</span> <span class="keyword">const</span> <a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> result = solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a2b006481369eb4f4cb7f3037dfdd8404">Solve</a>();</div>
|
|
<div class="line"><a id="l00870" name="l00870"></a><span class="lineno"> 870</span> <a class="code hl_define" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(result, <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885">SatSolver::ASSUMPTIONS_UNSAT</a>);</div>
|
|
<div class="line"><a id="l00871" name="l00871"></a><span class="lineno"> 871</span> <span class="keywordflow">if</span> (result == <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a id="l00872" name="l00872"></a><span class="lineno"> 872</span> <span class="keywordflow">if</span> (objective == <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18">kCoefficientMax</a>) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00873" name="l00873"></a><span class="lineno"> 873</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00874" name="l00874"></a><span class="lineno"> 874</span> }</div>
|
|
<div class="line"><a id="l00875" name="l00875"></a><span class="lineno"> 875</span> <span class="keywordflow">if</span> (result == <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>) {</div>
|
|
<div class="line"><a id="l00876" name="l00876"></a><span class="lineno"> 876</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>;</div>
|
|
<div class="line"><a id="l00877" name="l00877"></a><span class="lineno"> 877</span> }</div>
|
|
<div class="line"><a id="l00878" name="l00878"></a><span class="lineno"> 878</span> </div>
|
|
<div class="line"><a id="l00879" name="l00879"></a><span class="lineno"> 879</span> <span class="comment">// Extract the new best solution.</span></div>
|
|
<div class="line"><a id="l00880" name="l00880"></a><span class="lineno"> 880</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(result, <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>);</div>
|
|
<div class="line"><a id="l00881" name="l00881"></a><span class="lineno"> 881</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838">ExtractAssignment</a>(problem, *solver, solution);</div>
|
|
<div class="line"><a id="l00882" name="l00882"></a><span class="lineno"> 882</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1">IsAssignmentValid</a>(problem, *solution));</div>
|
|
<div class="line"><a id="l00883" name="l00883"></a><span class="lineno"> 883</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> old_objective = objective;</div>
|
|
<div class="line"><a id="l00884" name="l00884"></a><span class="lineno"> 884</span> objective = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f">ComputeObjectiveValue</a>(problem, *solution);</div>
|
|
<div class="line"><a id="l00885" name="l00885"></a><span class="lineno"> 885</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(objective, old_objective);</div>
|
|
<div class="line"><a id="l00886" name="l00886"></a><span class="lineno"> 886</span> logger.Log(CnfObjectiveLine(problem, objective));</div>
|
|
<div class="line"><a id="l00887" name="l00887"></a><span class="lineno"> 887</span> }</div>
|
|
<div class="line"><a id="l00888" name="l00888"></a><span class="lineno"> 888</span>}</div>
|
|
<div class="line"><a id="l00889" name="l00889"></a><span class="lineno"> 889</span> </div>
|
|
<div class="line"><a id="l00890" name="l00890"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ae471a0701f750ca0c32a3fe8828f04f2"> 890</a></span><a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ae471a0701f750ca0c32a3fe8828f04f2">SolveWithCardinalityEncoding</a>(</div>
|
|
<div class="line"><a id="l00891" name="l00891"></a><span class="lineno"> 891</span> <a class="code hl_enumeration" href="namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238">LogBehavior</a> log, <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html">LinearBooleanProblem</a>& problem, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver,</div>
|
|
<div class="line"><a id="l00892" name="l00892"></a><span class="lineno"> 892</span> std::vector<bool>* solution) {</div>
|
|
<div class="line"><a id="l00893" name="l00893"></a><span class="lineno"> 893</span> Logger logger(log);</div>
|
|
<div class="line"><a id="l00894" name="l00894"></a><span class="lineno"> 894</span> std::deque<EncodingNode> repository;</div>
|
|
<div class="line"><a id="l00895" name="l00895"></a><span class="lineno"> 895</span> </div>
|
|
<div class="line"><a id="l00896" name="l00896"></a><span class="lineno"> 896</span> <span class="comment">// Create one initial node per variables with cost.</span></div>
|
|
<div class="line"><a id="l00897" name="l00897"></a><span class="lineno"> 897</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> offset(0);</div>
|
|
<div class="line"><a id="l00898" name="l00898"></a><span class="lineno"> 898</span> std::vector<EncodingNode*> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a> =</div>
|
|
<div class="line"><a id="l00899" name="l00899"></a><span class="lineno"> 899</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aea70549adb843d22d06bef763a0960c8">CreateInitialEncodingNodes</a>(problem.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a9fd8f81a798fd34a843b007c10e40d6b">objective</a>(), &offset, &repository);</div>
|
|
<div class="line"><a id="l00900" name="l00900"></a><span class="lineno"> 900</span> </div>
|
|
<div class="line"><a id="l00901" name="l00901"></a><span class="lineno"> 901</span> <span class="comment">// This algorithm only work with weights of the same magnitude.</span></div>
|
|
<div class="line"><a id="l00902" name="l00902"></a><span class="lineno"> 902</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.empty());</div>
|
|
<div class="line"><a id="l00903" name="l00903"></a><span class="lineno"> 903</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> reference = <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.front()->weight();</div>
|
|
<div class="line"><a id="l00904" name="l00904"></a><span class="lineno"> 904</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* n : <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>) <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(n->weight(), reference);</div>
|
|
<div class="line"><a id="l00905" name="l00905"></a><span class="lineno"> 905</span> </div>
|
|
<div class="line"><a id="l00906" name="l00906"></a><span class="lineno"> 906</span> <span class="comment">// Initialize the current objective.</span></div>
|
|
<div class="line"><a id="l00907" name="l00907"></a><span class="lineno"> 907</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> objective = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18">kCoefficientMax</a>;</div>
|
|
<div class="line"><a id="l00908" name="l00908"></a><span class="lineno"> 908</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18">kCoefficientMax</a>;</div>
|
|
<div class="line"><a id="l00909" name="l00909"></a><span class="lineno"> 909</span> <span class="keywordflow">if</span> (!solution->empty()) {</div>
|
|
<div class="line"><a id="l00910" name="l00910"></a><span class="lineno"> 910</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1">IsAssignmentValid</a>(problem, *solution));</div>
|
|
<div class="line"><a id="l00911" name="l00911"></a><span class="lineno"> 911</span> objective = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f">ComputeObjectiveValue</a>(problem, *solution);</div>
|
|
<div class="line"><a id="l00912" name="l00912"></a><span class="lineno"> 912</span> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> = objective + offset;</div>
|
|
<div class="line"><a id="l00913" name="l00913"></a><span class="lineno"> 913</span> }</div>
|
|
<div class="line"><a id="l00914" name="l00914"></a><span class="lineno"> 914</span> </div>
|
|
<div class="line"><a id="l00915" name="l00915"></a><span class="lineno"> 915</span> <span class="comment">// Print the number of variables with a non-zero cost.</span></div>
|
|
<div class="line"><a id="l00916" name="l00916"></a><span class="lineno"> 916</span> logger.Log(absl::StrFormat(<span class="stringliteral">"c #weights:%u #vars:%d #constraints:%d"</span>,</div>
|
|
<div class="line"><a id="l00917" name="l00917"></a><span class="lineno"> 917</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.size(), problem.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#aad5531f45ca462be2f1b7ee7a5cb1372">num_variables</a>(),</div>
|
|
<div class="line"><a id="l00918" name="l00918"></a><span class="lineno"> 918</span> problem.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#aeaf0da781ca9b370d96b7fbd3f74266a">constraints_size</a>()));</div>
|
|
<div class="line"><a id="l00919" name="l00919"></a><span class="lineno"> 919</span> </div>
|
|
<div class="line"><a id="l00920" name="l00920"></a><span class="lineno"> 920</span> <span class="comment">// Create the sorter network.</span></div>
|
|
<div class="line"><a id="l00921" name="l00921"></a><span class="lineno"> 921</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a id="l00922" name="l00922"></a><span class="lineno"> 922</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* root =</div>
|
|
<div class="line"><a id="l00923" name="l00923"></a><span class="lineno"> 923</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a29ff75f2188e0ac1c58fa4b0cf793a00">MergeAllNodesWithDeque</a>(<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, solver, &repository);</div>
|
|
<div class="line"><a id="l00924" name="l00924"></a><span class="lineno"> 924</span> logger.Log(absl::StrFormat(<span class="stringliteral">"c encoding depth:%d"</span>, root-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a6fdd73f8011695b97659f2bea29325cb">depth</a>()));</div>
|
|
<div class="line"><a id="l00925" name="l00925"></a><span class="lineno"> 925</span> </div>
|
|
<div class="line"><a id="l00926" name="l00926"></a><span class="lineno"> 926</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a id="l00927" name="l00927"></a><span class="lineno"> 927</span> <span class="keywordflow">if</span> (objective != <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18">kCoefficientMax</a>) {</div>
|
|
<div class="line"><a id="l00928" name="l00928"></a><span class="lineno"> 928</span> <span class="comment">// Over constrain the objective by fixing the variable index - 1 of the</span></div>
|
|
<div class="line"><a id="l00929" name="l00929"></a><span class="lineno"> 929</span> <span class="comment">// root node to 0.</span></div>
|
|
<div class="line"><a id="l00930" name="l00930"></a><span class="lineno"> 930</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = offset.value() + objective.value();</div>
|
|
<div class="line"><a id="l00931" name="l00931"></a><span class="lineno"> 931</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> == 0) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00932" name="l00932"></a><span class="lineno"> 932</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a id="l00933" name="l00933"></a><span class="lineno"> 933</span> <span class="keywordflow">if</span> (!solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9">AddUnitClause</a>(root-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">literal</a>(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> - 1).<a class="code hl_function" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>())) {</div>
|
|
<div class="line"><a id="l00934" name="l00934"></a><span class="lineno"> 934</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00935" name="l00935"></a><span class="lineno"> 935</span> }</div>
|
|
<div class="line"><a id="l00936" name="l00936"></a><span class="lineno"> 936</span> }</div>
|
|
<div class="line"><a id="l00937" name="l00937"></a><span class="lineno"> 937</span> </div>
|
|
<div class="line"><a id="l00938" name="l00938"></a><span class="lineno"> 938</span> <span class="comment">// Solve the problem.</span></div>
|
|
<div class="line"><a id="l00939" name="l00939"></a><span class="lineno"> 939</span> <span class="keyword">const</span> <a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> result = solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a2b006481369eb4f4cb7f3037dfdd8404">Solve</a>();</div>
|
|
<div class="line"><a id="l00940" name="l00940"></a><span class="lineno"> 940</span> <a class="code hl_define" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(result, <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885">SatSolver::ASSUMPTIONS_UNSAT</a>);</div>
|
|
<div class="line"><a id="l00941" name="l00941"></a><span class="lineno"> 941</span> <span class="keywordflow">if</span> (result == <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a id="l00942" name="l00942"></a><span class="lineno"> 942</span> <span class="keywordflow">if</span> (objective == <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18">kCoefficientMax</a>) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00943" name="l00943"></a><span class="lineno"> 943</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00944" name="l00944"></a><span class="lineno"> 944</span> }</div>
|
|
<div class="line"><a id="l00945" name="l00945"></a><span class="lineno"> 945</span> <span class="keywordflow">if</span> (result == <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>;</div>
|
|
<div class="line"><a id="l00946" name="l00946"></a><span class="lineno"> 946</span> </div>
|
|
<div class="line"><a id="l00947" name="l00947"></a><span class="lineno"> 947</span> <span class="comment">// Extract the new best solution.</span></div>
|
|
<div class="line"><a id="l00948" name="l00948"></a><span class="lineno"> 948</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(result, <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>);</div>
|
|
<div class="line"><a id="l00949" name="l00949"></a><span class="lineno"> 949</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838">ExtractAssignment</a>(problem, *solver, solution);</div>
|
|
<div class="line"><a id="l00950" name="l00950"></a><span class="lineno"> 950</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1">IsAssignmentValid</a>(problem, *solution));</div>
|
|
<div class="line"><a id="l00951" name="l00951"></a><span class="lineno"> 951</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> old_objective = objective;</div>
|
|
<div class="line"><a id="l00952" name="l00952"></a><span class="lineno"> 952</span> objective = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f">ComputeObjectiveValue</a>(problem, *solution);</div>
|
|
<div class="line"><a id="l00953" name="l00953"></a><span class="lineno"> 953</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(objective, old_objective);</div>
|
|
<div class="line"><a id="l00954" name="l00954"></a><span class="lineno"> 954</span> logger.Log(CnfObjectiveLine(problem, objective));</div>
|
|
<div class="line"><a id="l00955" name="l00955"></a><span class="lineno"> 955</span> }</div>
|
|
<div class="line"><a id="l00956" name="l00956"></a><span class="lineno"> 956</span>}</div>
|
|
<div class="line"><a id="l00957" name="l00957"></a><span class="lineno"> 957</span> </div>
|
|
<div class="line"><a id="l00958" name="l00958"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a1b36a95b81f69a73d04b1b42fd40c4db"> 958</a></span><a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1b36a95b81f69a73d04b1b42fd40c4db">SolveWithCardinalityEncodingAndCore</a>(</div>
|
|
<div class="line"><a id="l00959" name="l00959"></a><span class="lineno"> 959</span> <a class="code hl_enumeration" href="namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238">LogBehavior</a> log, <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html">LinearBooleanProblem</a>& problem, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver,</div>
|
|
<div class="line"><a id="l00960" name="l00960"></a><span class="lineno"> 960</span> std::vector<bool>* solution) {</div>
|
|
<div class="line"><a id="l00961" name="l00961"></a><span class="lineno"> 961</span> Logger logger(log);</div>
|
|
<div class="line"><a id="l00962" name="l00962"></a><span class="lineno"> 962</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a> = solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9">parameters</a>();</div>
|
|
<div class="line"><a id="l00963" name="l00963"></a><span class="lineno"> 963</span> </div>
|
|
<div class="line"><a id="l00964" name="l00964"></a><span class="lineno"> 964</span> <span class="comment">// Create one initial nodes per variables with cost.</span></div>
|
|
<div class="line"><a id="l00965" name="l00965"></a><span class="lineno"> 965</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> offset(0);</div>
|
|
<div class="line"><a id="l00966" name="l00966"></a><span class="lineno"> 966</span> std::deque<EncodingNode> repository;</div>
|
|
<div class="line"><a id="l00967" name="l00967"></a><span class="lineno"> 967</span> std::vector<EncodingNode*> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a> =</div>
|
|
<div class="line"><a id="l00968" name="l00968"></a><span class="lineno"> 968</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aea70549adb843d22d06bef763a0960c8">CreateInitialEncodingNodes</a>(problem.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a9fd8f81a798fd34a843b007c10e40d6b">objective</a>(), &offset, &repository);</div>
|
|
<div class="line"><a id="l00969" name="l00969"></a><span class="lineno"> 969</span> </div>
|
|
<div class="line"><a id="l00970" name="l00970"></a><span class="lineno"> 970</span> <span class="comment">// Initialize the bounds.</span></div>
|
|
<div class="line"><a id="l00971" name="l00971"></a><span class="lineno"> 971</span> <span class="comment">// This is in term of number of variables not at their minimal value.</span></div>
|
|
<div class="line"><a id="l00972" name="l00972"></a><span class="lineno"> 972</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>(0);</div>
|
|
<div class="line"><a id="l00973" name="l00973"></a><span class="lineno"> 973</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>(<a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>());</div>
|
|
<div class="line"><a id="l00974" name="l00974"></a><span class="lineno"> 974</span> <span class="keywordflow">if</span> (!solution->empty()) {</div>
|
|
<div class="line"><a id="l00975" name="l00975"></a><span class="lineno"> 975</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1">IsAssignmentValid</a>(problem, *solution));</div>
|
|
<div class="line"><a id="l00976" name="l00976"></a><span class="lineno"> 976</span> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f">ComputeObjectiveValue</a>(problem, *solution) + offset;</div>
|
|
<div class="line"><a id="l00977" name="l00977"></a><span class="lineno"> 977</span> }</div>
|
|
<div class="line"><a id="l00978" name="l00978"></a><span class="lineno"> 978</span> </div>
|
|
<div class="line"><a id="l00979" name="l00979"></a><span class="lineno"> 979</span> <span class="comment">// Print the number of variables with a non-zero cost.</span></div>
|
|
<div class="line"><a id="l00980" name="l00980"></a><span class="lineno"> 980</span> logger.Log(absl::StrFormat(<span class="stringliteral">"c #weights:%u #vars:%d #constraints:%d"</span>,</div>
|
|
<div class="line"><a id="l00981" name="l00981"></a><span class="lineno"> 981</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.size(), problem.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#aad5531f45ca462be2f1b7ee7a5cb1372">num_variables</a>(),</div>
|
|
<div class="line"><a id="l00982" name="l00982"></a><span class="lineno"> 982</span> problem.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#aeaf0da781ca9b370d96b7fbd3f74266a">constraints_size</a>()));</div>
|
|
<div class="line"><a id="l00983" name="l00983"></a><span class="lineno"> 983</span> </div>
|
|
<div class="line"><a id="l00984" name="l00984"></a><span class="lineno"> 984</span> <span class="comment">// This is used by the "stratified" approach.</span></div>
|
|
<div class="line"><a id="l00985" name="l00985"></a><span class="lineno"> 985</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> stratified_lower_bound(0);</div>
|
|
<div class="line"><a id="l00986" name="l00986"></a><span class="lineno"> 986</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a9479680f1c22d80a33b60eff204ae3d0">max_sat_stratification</a>() ==</div>
|
|
<div class="line"><a id="l00987" name="l00987"></a><span class="lineno"> 987</span> <a class="code hl_variable" href="classoperations__research_1_1sat_1_1_sat_parameters.html#af6f976229a42f4f7eb42c392d94ed964">SatParameters::STRATIFICATION_DESCENT</a>) {</div>
|
|
<div class="line"><a id="l00988" name="l00988"></a><span class="lineno"> 988</span> <span class="comment">// In this case, we initialize it to the maximum assumption weights.</span></div>
|
|
<div class="line"><a id="l00989" name="l00989"></a><span class="lineno"> 989</span> <span class="keywordflow">for</span> (<a class="code hl_class" href="classoperations__research_1_1sat_1_1_encoding_node.html">EncodingNode</a>* n : <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>) {</div>
|
|
<div class="line"><a id="l00990" name="l00990"></a><span class="lineno"> 990</span> stratified_lower_bound = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(stratified_lower_bound, n->weight());</div>
|
|
<div class="line"><a id="l00991" name="l00991"></a><span class="lineno"> 991</span> }</div>
|
|
<div class="line"><a id="l00992" name="l00992"></a><span class="lineno"> 992</span> }</div>
|
|
<div class="line"><a id="l00993" name="l00993"></a><span class="lineno"> 993</span> </div>
|
|
<div class="line"><a id="l00994" name="l00994"></a><span class="lineno"> 994</span> <span class="comment">// Start the algorithm.</span></div>
|
|
<div class="line"><a id="l00995" name="l00995"></a><span class="lineno"> 995</span> <span class="keywordtype">int</span> max_depth = 0;</div>
|
|
<div class="line"><a id="l00996" name="l00996"></a><span class="lineno"> 996</span> std::string previous_core_info = <span class="stringliteral">""</span>;</div>
|
|
<div class="line"><a id="l00997" name="l00997"></a><span class="lineno"> 997</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> iter = 0;; ++iter) {</div>
|
|
<div class="line"><a id="l00998" name="l00998"></a><span class="lineno"> 998</span> <span class="keyword">const</span> std::vector<Literal> assumptions = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a3c7b9fb850d243d90ea59790db13a676">ReduceNodesAndExtractAssumptions</a>(</div>
|
|
<div class="line"><a id="l00999" name="l00999"></a><span class="lineno"> 999</span> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, stratified_lower_bound, &<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, &<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, solver);</div>
|
|
<div class="line"><a id="l01000" name="l01000"></a><span class="lineno"> 1000</span> <span class="keywordflow">if</span> (assumptions.empty()) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>;</div>
|
|
<div class="line"><a id="l01001" name="l01001"></a><span class="lineno"> 1001</span> </div>
|
|
<div class="line"><a id="l01002" name="l01002"></a><span class="lineno"> 1002</span> <span class="comment">// Display the progress.</span></div>
|
|
<div class="line"><a id="l01003" name="l01003"></a><span class="lineno"> 1003</span> <span class="keyword">const</span> std::string gap_string =</div>
|
|
<div class="line"><a id="l01004" name="l01004"></a><span class="lineno"> 1004</span> (<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> == <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18">kCoefficientMax</a>)</div>
|
|
<div class="line"><a id="l01005" name="l01005"></a><span class="lineno"> 1005</span> ? <span class="stringliteral">""</span></div>
|
|
<div class="line"><a id="l01006" name="l01006"></a><span class="lineno"> 1006</span> : absl::StrFormat(<span class="stringliteral">" gap:%d"</span>, (<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> - <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>).value());</div>
|
|
<div class="line"><a id="l01007" name="l01007"></a><span class="lineno"> 1007</span> logger.Log(</div>
|
|
<div class="line"><a id="l01008" name="l01008"></a><span class="lineno"> 1008</span> absl::StrFormat(<span class="stringliteral">"c iter:%d [%s] lb:%d%s assumptions:%u depth:%d"</span>, iter,</div>
|
|
<div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span> previous_core_info,</div>
|
|
<div class="line"><a id="l01010" name="l01010"></a><span class="lineno"> 1010</span> <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>.value() - offset.value() +</div>
|
|
<div class="line"><a id="l01011" name="l01011"></a><span class="lineno"> 1011</span> <span class="keyword">static_cast<</span>int64_t<span class="keyword">></span>(problem.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a9fd8f81a798fd34a843b007c10e40d6b">objective</a>().<a class="code hl_function" href="classoperations__research_1_1sat_1_1_linear_objective.html#a96ffc785b7b2135c7980c985883ffdd3">offset</a>()),</div>
|
|
<div class="line"><a id="l01012" name="l01012"></a><span class="lineno"> 1012</span> gap_string, <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.size(), max_depth));</div>
|
|
<div class="line"><a id="l01013" name="l01013"></a><span class="lineno"> 1013</span> </div>
|
|
<div class="line"><a id="l01014" name="l01014"></a><span class="lineno"> 1014</span> <span class="comment">// Solve under the assumptions.</span></div>
|
|
<div class="line"><a id="l01015" name="l01015"></a><span class="lineno"> 1015</span> <span class="keyword">const</span> <a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> result =</div>
|
|
<div class="line"><a id="l01016" name="l01016"></a><span class="lineno"> 1016</span> solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a2abca6db0c780a4482d1ac9eb6365057">ResetAndSolveWithGivenAssumptions</a>(assumptions);</div>
|
|
<div class="line"><a id="l01017" name="l01017"></a><span class="lineno"> 1017</span> <span class="keywordflow">if</span> (result == <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>) {</div>
|
|
<div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span> <span class="comment">// Extract the new solution and save it if it is the best found so far.</span></div>
|
|
<div class="line"><a id="l01019" name="l01019"></a><span class="lineno"> 1019</span> std::vector<bool> temp_solution;</div>
|
|
<div class="line"><a id="l01020" name="l01020"></a><span class="lineno"> 1020</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838">ExtractAssignment</a>(problem, *solver, &temp_solution);</div>
|
|
<div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1">IsAssignmentValid</a>(problem, temp_solution));</div>
|
|
<div class="line"><a id="l01022" name="l01022"></a><span class="lineno"> 1022</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> obj = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f">ComputeObjectiveValue</a>(problem, temp_solution);</div>
|
|
<div class="line"><a id="l01023" name="l01023"></a><span class="lineno"> 1023</span> <span class="keywordflow">if</span> (obj + offset < <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div>
|
|
<div class="line"><a id="l01024" name="l01024"></a><span class="lineno"> 1024</span> *solution = temp_solution;</div>
|
|
<div class="line"><a id="l01025" name="l01025"></a><span class="lineno"> 1025</span> logger.Log(CnfObjectiveLine(problem, obj));</div>
|
|
<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"> 1026</span> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> = obj + offset;</div>
|
|
<div class="line"><a id="l01027" name="l01027"></a><span class="lineno"> 1027</span> }</div>
|
|
<div class="line"><a id="l01028" name="l01028"></a><span class="lineno"> 1028</span> </div>
|
|
<div class="line"><a id="l01029" name="l01029"></a><span class="lineno"> 1029</span> <span class="comment">// If not all assumptions were taken, continue with a lower stratified</span></div>
|
|
<div class="line"><a id="l01030" name="l01030"></a><span class="lineno"> 1030</span> <span class="comment">// bound. Otherwise we have an optimal solution.</span></div>
|
|
<div class="line"><a id="l01031" name="l01031"></a><span class="lineno"> 1031</span> stratified_lower_bound =</div>
|
|
<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ad6c9cfad7e2fa7ae1bbff31720394436">MaxNodeWeightSmallerThan</a>(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, stratified_lower_bound);</div>
|
|
<div class="line"><a id="l01033" name="l01033"></a><span class="lineno"> 1033</span> <span class="keywordflow">if</span> (stratified_lower_bound > 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01034" name="l01034"></a><span class="lineno"> 1034</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>;</div>
|
|
<div class="line"><a id="l01035" name="l01035"></a><span class="lineno"> 1035</span> }</div>
|
|
<div class="line"><a id="l01036" name="l01036"></a><span class="lineno"> 1036</span> <span class="keywordflow">if</span> (result != <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885">SatSolver::ASSUMPTIONS_UNSAT</a>) <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l01037" name="l01037"></a><span class="lineno"> 1037</span> </div>
|
|
<div class="line"><a id="l01038" name="l01038"></a><span class="lineno"> 1038</span> <span class="comment">// We have a new core.</span></div>
|
|
<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span> std::vector<Literal> core = solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#acfbfa9df611cb625ff79785c05784580">GetLastIncompatibleDecisions</a>();</div>
|
|
<div class="line"><a id="l01040" name="l01040"></a><span class="lineno"> 1040</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a13b1e4908507488f6954c89d70522ff9">minimize_core</a>()) <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a6fb8349259fa849de0789a4ec58a8492">MinimizeCore</a>(solver, &core);</div>
|
|
<div class="line"><a id="l01041" name="l01041"></a><span class="lineno"> 1041</span> </div>
|
|
<div class="line"><a id="l01042" name="l01042"></a><span class="lineno"> 1042</span> <span class="comment">// Compute the min weight of all the nodes in the core.</span></div>
|
|
<div class="line"><a id="l01043" name="l01043"></a><span class="lineno"> 1043</span> <span class="comment">// The lower bound will be increased by that much.</span></div>
|
|
<div class="line"><a id="l01044" name="l01044"></a><span class="lineno"> 1044</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">Coefficient</a> min_weight = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1c9d74b9b207b6e5513334dd135a00a9">ComputeCoreMinWeight</a>(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, core);</div>
|
|
<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span> previous_core_info =</div>
|
|
<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span> absl::StrFormat(<span class="stringliteral">"core:%u mw:%d"</span>, core.size(), min_weight.value());</div>
|
|
<div class="line"><a id="l01047" name="l01047"></a><span class="lineno"> 1047</span> </div>
|
|
<div class="line"><a id="l01048" name="l01048"></a><span class="lineno"> 1048</span> <span class="comment">// Increase stratified_lower_bound according to the parameters.</span></div>
|
|
<div class="line"><a id="l01049" name="l01049"></a><span class="lineno"> 1049</span> <span class="keywordflow">if</span> (stratified_lower_bound < min_weight &&</div>
|
|
<div class="line"><a id="l01050" name="l01050"></a><span class="lineno"> 1050</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a9479680f1c22d80a33b60eff204ae3d0">max_sat_stratification</a>() ==</div>
|
|
<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span> <a class="code hl_variable" href="classoperations__research_1_1sat_1_1_sat_parameters.html#adcb34fa5277922f4ef41267b2ab38847">SatParameters::STRATIFICATION_ASCENT</a>) {</div>
|
|
<div class="line"><a id="l01052" name="l01052"></a><span class="lineno"> 1052</span> stratified_lower_bound = min_weight;</div>
|
|
<div class="line"><a id="l01053" name="l01053"></a><span class="lineno"> 1053</span> }</div>
|
|
<div class="line"><a id="l01054" name="l01054"></a><span class="lineno"> 1054</span> </div>
|
|
<div class="line"><a id="l01055" name="l01055"></a><span class="lineno"> 1055</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ab87119f7f6691eca8af4c552828fc4c4">ProcessCore</a>(core, min_weight, &repository, &<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, solver);</div>
|
|
<div class="line"><a id="l01056" name="l01056"></a><span class="lineno"> 1056</span> max_depth = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_depth, <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.back()->depth());</div>
|
|
<div class="line"><a id="l01057" name="l01057"></a><span class="lineno"> 1057</span> }</div>
|
|
<div class="line"><a id="l01058" name="l01058"></a><span class="lineno"> 1058</span>}</div>
|
|
<div class="line"><a id="l01059" name="l01059"></a><span class="lineno"> 1059</span> </div>
|
|
<div class="line"><a id="l01060" name="l01060"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#affe1669ec9e0e7cbd54e895bbbff43af"> 1060</a></span><a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#affe1669ec9e0e7cbd54e895bbbff43af">MinimizeIntegerVariableWithLinearScanAndLazyEncoding</a>(</div>
|
|
<div class="line"><a id="l01061" name="l01061"></a><span class="lineno"> 1061</span> IntegerVariable objective_var,</div>
|
|
<div class="line"><a id="l01062" name="l01062"></a><span class="lineno"> 1062</span> <span class="keyword">const</span> std::function<<span class="keywordtype">void</span>()>& feasible_solution_observer, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a id="l01063" name="l01063"></a><span class="lineno"> 1063</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* sat_solver = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>();</div>
|
|
<div class="line"><a id="l01064" name="l01064"></a><span class="lineno"> 1064</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div>
|
|
<div class="line"><a id="l01065" name="l01065"></a><span class="lineno"> 1065</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>& <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a> = *(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>());</div>
|
|
<div class="line"><a id="l01066" name="l01066"></a><span class="lineno"> 1066</span> </div>
|
|
<div class="line"><a id="l01067" name="l01067"></a><span class="lineno"> 1067</span> <span class="comment">// Simple linear scan algorithm to find the optimal.</span></div>
|
|
<div class="line"><a id="l01068" name="l01068"></a><span class="lineno"> 1068</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a id="l01069" name="l01069"></a><span class="lineno"> 1069</span> <span class="keyword">const</span> <a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> result = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a8bea9a6a0de60c8fdab99ad7dfdf8498">SolveIntegerProblem</a>(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a id="l01070" name="l01070"></a><span class="lineno"> 1070</span> <span class="keywordflow">if</span> (result != <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>) <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l01071" name="l01071"></a><span class="lineno"> 1071</span> </div>
|
|
<div class="line"><a id="l01072" name="l01072"></a><span class="lineno"> 1072</span> <span class="comment">// The objective is the current lower bound of the objective_var.</span></div>
|
|
<div class="line"><a id="l01073" name="l01073"></a><span class="lineno"> 1073</span> <span class="keyword">const</span> IntegerValue objective = integer_trail->LowerBound(objective_var);</div>
|
|
<div class="line"><a id="l01074" name="l01074"></a><span class="lineno"> 1074</span> </div>
|
|
<div class="line"><a id="l01075" name="l01075"></a><span class="lineno"> 1075</span> <span class="comment">// We have a solution!</span></div>
|
|
<div class="line"><a id="l01076" name="l01076"></a><span class="lineno"> 1076</span> <span class="keywordflow">if</span> (feasible_solution_observer != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l01077" name="l01077"></a><span class="lineno"> 1077</span> feasible_solution_observer();</div>
|
|
<div class="line"><a id="l01078" name="l01078"></a><span class="lineno"> 1078</span> }</div>
|
|
<div class="line"><a id="l01079" name="l01079"></a><span class="lineno"> 1079</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a32f3ed6806ec24e1818093f9f9c77f1a">stop_after_first_solution</a>()) {</div>
|
|
<div class="line"><a id="l01080" name="l01080"></a><span class="lineno"> 1080</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>;</div>
|
|
<div class="line"><a id="l01081" name="l01081"></a><span class="lineno"> 1081</span> }</div>
|
|
<div class="line"><a id="l01082" name="l01082"></a><span class="lineno"> 1082</span> </div>
|
|
<div class="line"><a id="l01083" name="l01083"></a><span class="lineno"> 1083</span> <span class="comment">// Restrict the objective.</span></div>
|
|
<div class="line"><a id="l01084" name="l01084"></a><span class="lineno"> 1084</span> sat_solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a id="l01085" name="l01085"></a><span class="lineno"> 1085</span> <span class="keywordflow">if</span> (!integer_trail->Enqueue(</div>
|
|
<div class="line"><a id="l01086" name="l01086"></a><span class="lineno"> 1086</span> <a class="code hl_function" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(objective_var, objective - 1), {},</div>
|
|
<div class="line"><a id="l01087" name="l01087"></a><span class="lineno"> 1087</span> {})) {</div>
|
|
<div class="line"><a id="l01088" name="l01088"></a><span class="lineno"> 1088</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l01089" name="l01089"></a><span class="lineno"> 1089</span> }</div>
|
|
<div class="line"><a id="l01090" name="l01090"></a><span class="lineno"> 1090</span> }</div>
|
|
<div class="line"><a id="l01091" name="l01091"></a><span class="lineno"> 1091</span>}</div>
|
|
<div class="line"><a id="l01092" name="l01092"></a><span class="lineno"> 1092</span> </div>
|
|
<div class="line"><a id="l01093" name="l01093"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a166c4d1be17bdfcad1986b1f72c49e52"> 1093</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a166c4d1be17bdfcad1986b1f72c49e52">RestrictObjectiveDomainWithBinarySearch</a>(</div>
|
|
<div class="line"><a id="l01094" name="l01094"></a><span class="lineno"> 1094</span> IntegerVariable objective_var,</div>
|
|
<div class="line"><a id="l01095" name="l01095"></a><span class="lineno"> 1095</span> <span class="keyword">const</span> std::function<<span class="keywordtype">void</span>()>& feasible_solution_observer, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a id="l01096" name="l01096"></a><span class="lineno"> 1096</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a> old_params = *<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>();</div>
|
|
<div class="line"><a id="l01097" name="l01097"></a><span class="lineno"> 1097</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* sat_solver = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>();</div>
|
|
<div class="line"><a id="l01098" name="l01098"></a><span class="lineno"> 1098</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div>
|
|
<div class="line"><a id="l01099" name="l01099"></a><span class="lineno"> 1099</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>* integer_encoder = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>();</div>
|
|
<div class="line"><a id="l01100" name="l01100"></a><span class="lineno"> 1100</span> </div>
|
|
<div class="line"><a id="l01101" name="l01101"></a><span class="lineno"> 1101</span> <span class="comment">// Set the requested conflict limit.</span></div>
|
|
<div class="line"><a id="l01102" name="l01102"></a><span class="lineno"> 1102</span> {</div>
|
|
<div class="line"><a id="l01103" name="l01103"></a><span class="lineno"> 1103</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a> new_params = old_params;</div>
|
|
<div class="line"><a id="l01104" name="l01104"></a><span class="lineno"> 1104</span> new_params.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a7120a9ef363b14f95108f17415c9c3d0">set_max_number_of_conflicts</a>(</div>
|
|
<div class="line"><a id="l01105" name="l01105"></a><span class="lineno"> 1105</span> old_params.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a1a2b6695ed16232e46adc8d31983e637">binary_search_num_conflicts</a>());</div>
|
|
<div class="line"><a id="l01106" name="l01106"></a><span class="lineno"> 1106</span> *<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>() = new_params;</div>
|
|
<div class="line"><a id="l01107" name="l01107"></a><span class="lineno"> 1107</span> }</div>
|
|
<div class="line"><a id="l01108" name="l01108"></a><span class="lineno"> 1108</span> </div>
|
|
<div class="line"><a id="l01109" name="l01109"></a><span class="lineno"> 1109</span> <span class="comment">// The assumption (objective <= value) for values in</span></div>
|
|
<div class="line"><a id="l01110" name="l01110"></a><span class="lineno"> 1110</span> <span class="comment">// [unknown_min, unknown_max] reached the conflict limit.</span></div>
|
|
<div class="line"><a id="l01111" name="l01111"></a><span class="lineno"> 1111</span> <span class="keywordtype">bool</span> loop = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01112" name="l01112"></a><span class="lineno"> 1112</span> IntegerValue unknown_min = integer_trail->UpperBound(objective_var);</div>
|
|
<div class="line"><a id="l01113" name="l01113"></a><span class="lineno"> 1113</span> IntegerValue unknown_max = integer_trail->LowerBound(objective_var);</div>
|
|
<div class="line"><a id="l01114" name="l01114"></a><span class="lineno"> 1114</span> <span class="keywordflow">while</span> (loop) {</div>
|
|
<div class="line"><a id="l01115" name="l01115"></a><span class="lineno"> 1115</span> sat_solver->Backtrack(0);</div>
|
|
<div class="line"><a id="l01116" name="l01116"></a><span class="lineno"> 1116</span> <span class="keyword">const</span> IntegerValue lb = integer_trail->LowerBound(objective_var);</div>
|
|
<div class="line"><a id="l01117" name="l01117"></a><span class="lineno"> 1117</span> <span class="keyword">const</span> IntegerValue ub = integer_trail->UpperBound(objective_var);</div>
|
|
<div class="line"><a id="l01118" name="l01118"></a><span class="lineno"> 1118</span> unknown_min = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(unknown_min, ub);</div>
|
|
<div class="line"><a id="l01119" name="l01119"></a><span class="lineno"> 1119</span> unknown_max = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(unknown_max, lb);</div>
|
|
<div class="line"><a id="l01120" name="l01120"></a><span class="lineno"> 1120</span> </div>
|
|
<div class="line"><a id="l01121" name="l01121"></a><span class="lineno"> 1121</span> <span class="comment">// We first refine the lower bound and then the upper bound.</span></div>
|
|
<div class="line"><a id="l01122" name="l01122"></a><span class="lineno"> 1122</span> IntegerValue target;</div>
|
|
<div class="line"><a id="l01123" name="l01123"></a><span class="lineno"> 1123</span> <span class="keywordflow">if</span> (lb < unknown_min) {</div>
|
|
<div class="line"><a id="l01124" name="l01124"></a><span class="lineno"> 1124</span> target = lb + (unknown_min - lb) / 2;</div>
|
|
<div class="line"><a id="l01125" name="l01125"></a><span class="lineno"> 1125</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (unknown_max < ub) {</div>
|
|
<div class="line"><a id="l01126" name="l01126"></a><span class="lineno"> 1126</span> target = ub - (ub - unknown_max) / 2;</div>
|
|
<div class="line"><a id="l01127" name="l01127"></a><span class="lineno"> 1127</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01128" name="l01128"></a><span class="lineno"> 1128</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Binary-search, done."</span>;</div>
|
|
<div class="line"><a id="l01129" name="l01129"></a><span class="lineno"> 1129</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01130" name="l01130"></a><span class="lineno"> 1130</span> }</div>
|
|
<div class="line"><a id="l01131" name="l01131"></a><span class="lineno"> 1131</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Binary-search, objective: ["</span> << lb << <span class="stringliteral">","</span> << ub << <span class="stringliteral">"]"</span></div>
|
|
<div class="line"><a id="l01132" name="l01132"></a><span class="lineno"> 1132</span> << <span class="stringliteral">" tried: ["</span> << unknown_min << <span class="stringliteral">","</span> << unknown_max << <span class="stringliteral">"]"</span></div>
|
|
<div class="line"><a id="l01133" name="l01133"></a><span class="lineno"> 1133</span> << <span class="stringliteral">" target: obj<="</span> << target;</div>
|
|
<div class="line"><a id="l01134" name="l01134"></a><span class="lineno"> 1134</span> <a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> result;</div>
|
|
<div class="line"><a id="l01135" name="l01135"></a><span class="lineno"> 1135</span> <span class="keywordflow">if</span> (target < ub) {</div>
|
|
<div class="line"><a id="l01136" name="l01136"></a><span class="lineno"> 1136</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> assumption = integer_encoder->GetOrCreateAssociatedLiteral(</div>
|
|
<div class="line"><a id="l01137" name="l01137"></a><span class="lineno"> 1137</span> <a class="code hl_function" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(objective_var, target));</div>
|
|
<div class="line"><a id="l01138" name="l01138"></a><span class="lineno"> 1138</span> result = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a">ResetAndSolveIntegerProblem</a>({assumption}, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a id="l01139" name="l01139"></a><span class="lineno"> 1139</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01140" name="l01140"></a><span class="lineno"> 1140</span> result = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a">ResetAndSolveIntegerProblem</a>({}, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a id="l01141" name="l01141"></a><span class="lineno"> 1141</span> }</div>
|
|
<div class="line"><a id="l01142" name="l01142"></a><span class="lineno"> 1142</span> </div>
|
|
<div class="line"><a id="l01143" name="l01143"></a><span class="lineno"> 1143</span> <span class="keywordflow">switch</span> (result) {</div>
|
|
<div class="line"><a id="l01144" name="l01144"></a><span class="lineno"> 1144</span> <span class="keywordflow">case</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>: {</div>
|
|
<div class="line"><a id="l01145" name="l01145"></a><span class="lineno"> 1145</span> loop = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01146" name="l01146"></a><span class="lineno"> 1146</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01147" name="l01147"></a><span class="lineno"> 1147</span> }</div>
|
|
<div class="line"><a id="l01148" name="l01148"></a><span class="lineno"> 1148</span> <span class="keywordflow">case</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885">SatSolver::ASSUMPTIONS_UNSAT</a>: {</div>
|
|
<div class="line"><a id="l01149" name="l01149"></a><span class="lineno"> 1149</span> <span class="comment">// Update the objective lower bound.</span></div>
|
|
<div class="line"><a id="l01150" name="l01150"></a><span class="lineno"> 1150</span> sat_solver->Backtrack(0);</div>
|
|
<div class="line"><a id="l01151" name="l01151"></a><span class="lineno"> 1151</span> <span class="keywordflow">if</span> (!integer_trail->Enqueue(</div>
|
|
<div class="line"><a id="l01152" name="l01152"></a><span class="lineno"> 1152</span> <a class="code hl_function" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(objective_var, target + 1), {},</div>
|
|
<div class="line"><a id="l01153" name="l01153"></a><span class="lineno"> 1153</span> {})) {</div>
|
|
<div class="line"><a id="l01154" name="l01154"></a><span class="lineno"> 1154</span> loop = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01155" name="l01155"></a><span class="lineno"> 1155</span> }</div>
|
|
<div class="line"><a id="l01156" name="l01156"></a><span class="lineno"> 1156</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01157" name="l01157"></a><span class="lineno"> 1157</span> }</div>
|
|
<div class="line"><a id="l01158" name="l01158"></a><span class="lineno"> 1158</span> <span class="keywordflow">case</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>: {</div>
|
|
<div class="line"><a id="l01159" name="l01159"></a><span class="lineno"> 1159</span> <span class="comment">// The objective is the current lower bound of the objective_var.</span></div>
|
|
<div class="line"><a id="l01160" name="l01160"></a><span class="lineno"> 1160</span> <span class="keyword">const</span> IntegerValue objective = integer_trail->LowerBound(objective_var);</div>
|
|
<div class="line"><a id="l01161" name="l01161"></a><span class="lineno"> 1161</span> <span class="keywordflow">if</span> (feasible_solution_observer != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l01162" name="l01162"></a><span class="lineno"> 1162</span> feasible_solution_observer();</div>
|
|
<div class="line"><a id="l01163" name="l01163"></a><span class="lineno"> 1163</span> }</div>
|
|
<div class="line"><a id="l01164" name="l01164"></a><span class="lineno"> 1164</span> </div>
|
|
<div class="line"><a id="l01165" name="l01165"></a><span class="lineno"> 1165</span> <span class="comment">// We have a solution, restrict the objective upper bound to only look</span></div>
|
|
<div class="line"><a id="l01166" name="l01166"></a><span class="lineno"> 1166</span> <span class="comment">// for better ones now.</span></div>
|
|
<div class="line"><a id="l01167" name="l01167"></a><span class="lineno"> 1167</span> sat_solver->Backtrack(0);</div>
|
|
<div class="line"><a id="l01168" name="l01168"></a><span class="lineno"> 1168</span> <span class="keywordflow">if</span> (!integer_trail->Enqueue(</div>
|
|
<div class="line"><a id="l01169" name="l01169"></a><span class="lineno"> 1169</span> <a class="code hl_function" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(objective_var, objective - 1), {},</div>
|
|
<div class="line"><a id="l01170" name="l01170"></a><span class="lineno"> 1170</span> {})) {</div>
|
|
<div class="line"><a id="l01171" name="l01171"></a><span class="lineno"> 1171</span> loop = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01172" name="l01172"></a><span class="lineno"> 1172</span> }</div>
|
|
<div class="line"><a id="l01173" name="l01173"></a><span class="lineno"> 1173</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01174" name="l01174"></a><span class="lineno"> 1174</span> }</div>
|
|
<div class="line"><a id="l01175" name="l01175"></a><span class="lineno"> 1175</span> <span class="keywordflow">case</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>: {</div>
|
|
<div class="line"><a id="l01176" name="l01176"></a><span class="lineno"> 1176</span> unknown_min = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(target, unknown_min);</div>
|
|
<div class="line"><a id="l01177" name="l01177"></a><span class="lineno"> 1177</span> unknown_max = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(target, unknown_max);</div>
|
|
<div class="line"><a id="l01178" name="l01178"></a><span class="lineno"> 1178</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01179" name="l01179"></a><span class="lineno"> 1179</span> }</div>
|
|
<div class="line"><a id="l01180" name="l01180"></a><span class="lineno"> 1180</span> }</div>
|
|
<div class="line"><a id="l01181" name="l01181"></a><span class="lineno"> 1181</span> }</div>
|
|
<div class="line"><a id="l01182" name="l01182"></a><span class="lineno"> 1182</span> </div>
|
|
<div class="line"><a id="l01183" name="l01183"></a><span class="lineno"> 1183</span> sat_solver->Backtrack(0);</div>
|
|
<div class="line"><a id="l01184" name="l01184"></a><span class="lineno"> 1184</span> *<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>() = old_params;</div>
|
|
<div class="line"><a id="l01185" name="l01185"></a><span class="lineno"> 1185</span>}</div>
|
|
<div class="line"><a id="l01186" name="l01186"></a><span class="lineno"> 1186</span> </div>
|
|
<div class="line"><a id="l01187" name="l01187"></a><span class="lineno"> 1187</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l01188" name="l01188"></a><span class="lineno"> 1188</span> </div>
|
|
<div class="line"><a id="l01189" name="l01189"></a><span class="lineno"> 1189</span><span class="comment">// If the given model is unsat under the given assumptions, returns one or more</span></div>
|
|
<div class="line"><a id="l01190" name="l01190"></a><span class="lineno"> 1190</span><span class="comment">// non-overlapping set of assumptions, each set making the problem infeasible on</span></div>
|
|
<div class="line"><a id="l01191" name="l01191"></a><span class="lineno"> 1191</span><span class="comment">// its own (the cores).</span></div>
|
|
<div class="line"><a id="l01192" name="l01192"></a><span class="lineno"> 1192</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l01193" name="l01193"></a><span class="lineno"> 1193</span><span class="comment">// In presence of weights, we "generalize" the notions of disjoints core using</span></div>
|
|
<div class="line"><a id="l01194" name="l01194"></a><span class="lineno"> 1194</span><span class="comment">// the WCE idea describe in "Weight-Aware Core Extraction in SAT-Based MaxSAT</span></div>
|
|
<div class="line"><a id="l01195" name="l01195"></a><span class="lineno"> 1195</span><span class="comment">// solving" Jeremias Berg And Matti Jarvisalo.</span></div>
|
|
<div class="line"><a id="l01196" name="l01196"></a><span class="lineno"> 1196</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l01197" name="l01197"></a><span class="lineno"> 1197</span><span class="comment">// The returned status can be either:</span></div>
|
|
<div class="line"><a id="l01198" name="l01198"></a><span class="lineno"> 1198</span><span class="comment">// - ASSUMPTIONS_UNSAT if the set of returned core perfectly cover the given</span></div>
|
|
<div class="line"><a id="l01199" name="l01199"></a><span class="lineno"> 1199</span><span class="comment">// assumptions, in this case, we don't bother trying to find a SAT solution</span></div>
|
|
<div class="line"><a id="l01200" name="l01200"></a><span class="lineno"> 1200</span><span class="comment">// with no assumptions.</span></div>
|
|
<div class="line"><a id="l01201" name="l01201"></a><span class="lineno"> 1201</span><span class="comment">// - FEASIBLE if after finding zero or more core we have a solution.</span></div>
|
|
<div class="line"><a id="l01202" name="l01202"></a><span class="lineno"> 1202</span><span class="comment">// - LIMIT_REACHED if we reached the time-limit before one of the two status</span></div>
|
|
<div class="line"><a id="l01203" name="l01203"></a><span class="lineno"> 1203</span><span class="comment">// above could be decided.</span></div>
|
|
<div class="line"><a id="l01204" name="l01204"></a><span class="lineno"> 1204</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l01205" name="l01205"></a><span class="lineno"> 1205</span><span class="comment">// TODO(user): There is many way to combine the WCE and stratification</span></div>
|
|
<div class="line"><a id="l01206" name="l01206"></a><span class="lineno"> 1206</span><span class="comment">// heuristics. I didn't had time to properly compare the different approach. See</span></div>
|
|
<div class="line"><a id="l01207" name="l01207"></a><span class="lineno"> 1207</span><span class="comment">// the WCE papers for some ideas, but there is many more ways to try to find a</span></div>
|
|
<div class="line"><a id="l01208" name="l01208"></a><span class="lineno"> 1208</span><span class="comment">// lot of core at once and try to minimize the minimum weight of each of the</span></div>
|
|
<div class="line"><a id="l01209" name="l01209"></a><span class="lineno"> 1209</span><span class="comment">// cores.</span></div>
|
|
<div class="line"><a id="l01210" name="l01210"></a><span class="lineno"> 1210</span><a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> FindCores(std::vector<Literal> assumptions,</div>
|
|
<div class="line"><a id="l01211" name="l01211"></a><span class="lineno"> 1211</span> std::vector<IntegerValue> assumption_weights,</div>
|
|
<div class="line"><a id="l01212" name="l01212"></a><span class="lineno"> 1212</span> IntegerValue stratified_threshold, Model* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a id="l01213" name="l01213"></a><span class="lineno"> 1213</span> std::vector<std::vector<Literal>>* cores) {</div>
|
|
<div class="line"><a id="l01214" name="l01214"></a><span class="lineno"> 1214</span> cores->clear();</div>
|
|
<div class="line"><a id="l01215" name="l01215"></a><span class="lineno"> 1215</span> SatSolver* sat_solver = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<SatSolver>();</div>
|
|
<div class="line"><a id="l01216" name="l01216"></a><span class="lineno"> 1216</span> <a class="code hl_class" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* limit = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>>();</div>
|
|
<div class="line"><a id="l01217" name="l01217"></a><span class="lineno"> 1217</span> <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><a id="l01218" name="l01218"></a><span class="lineno"> 1218</span> <span class="keywordflow">if</span> (limit->LimitReached()) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>;</div>
|
|
<div class="line"><a id="l01219" name="l01219"></a><span class="lineno"> 1219</span> </div>
|
|
<div class="line"><a id="l01220" name="l01220"></a><span class="lineno"> 1220</span> <span class="keyword">const</span> <a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> result =</div>
|
|
<div class="line"><a id="l01221" name="l01221"></a><span class="lineno"> 1221</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a">ResetAndSolveIntegerProblem</a>(assumptions, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a id="l01222" name="l01222"></a><span class="lineno"> 1222</span> <span class="keywordflow">if</span> (result != <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885">SatSolver::ASSUMPTIONS_UNSAT</a>) <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l01223" name="l01223"></a><span class="lineno"> 1223</span> std::vector<Literal> core = sat_solver->GetLastIncompatibleDecisions();</div>
|
|
<div class="line"><a id="l01224" name="l01224"></a><span class="lineno"> 1224</span> <span class="keywordflow">if</span> (sat_solver->parameters().minimize_core()) {</div>
|
|
<div class="line"><a id="l01225" name="l01225"></a><span class="lineno"> 1225</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ab76a35e6ff810ad9ea8b58c7c11606cb">MinimizeCoreWithPropagation</a>(limit, sat_solver, &core);</div>
|
|
<div class="line"><a id="l01226" name="l01226"></a><span class="lineno"> 1226</span> }</div>
|
|
<div class="line"><a id="l01227" name="l01227"></a><span class="lineno"> 1227</span> <span class="keywordflow">if</span> (core.empty()) <span class="keywordflow">return</span> sat_solver->UnsatStatus();</div>
|
|
<div class="line"><a id="l01228" name="l01228"></a><span class="lineno"> 1228</span> cores->push_back(core);</div>
|
|
<div class="line"><a id="l01229" name="l01229"></a><span class="lineno"> 1229</span> <span class="keywordflow">if</span> (!sat_solver->parameters().find_multiple_cores()) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01230" name="l01230"></a><span class="lineno"> 1230</span> </div>
|
|
<div class="line"><a id="l01231" name="l01231"></a><span class="lineno"> 1231</span> <span class="comment">// Recover the original indices of the assumptions that are part of the</span></div>
|
|
<div class="line"><a id="l01232" name="l01232"></a><span class="lineno"> 1232</span> <span class="comment">// core.</span></div>
|
|
<div class="line"><a id="l01233" name="l01233"></a><span class="lineno"> 1233</span> std::vector<int> indices;</div>
|
|
<div class="line"><a id="l01234" name="l01234"></a><span class="lineno"> 1234</span> {</div>
|
|
<div class="line"><a id="l01235" name="l01235"></a><span class="lineno"> 1235</span> std::set<Literal> temp(core.begin(), core.end());</div>
|
|
<div class="line"><a id="l01236" name="l01236"></a><span class="lineno"> 1236</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < assumptions.size(); ++i) {</div>
|
|
<div class="line"><a id="l01237" name="l01237"></a><span class="lineno"> 1237</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(temp, assumptions[i])) {</div>
|
|
<div class="line"><a id="l01238" name="l01238"></a><span class="lineno"> 1238</span> indices.push_back(i);</div>
|
|
<div class="line"><a id="l01239" name="l01239"></a><span class="lineno"> 1239</span> }</div>
|
|
<div class="line"><a id="l01240" name="l01240"></a><span class="lineno"> 1240</span> }</div>
|
|
<div class="line"><a id="l01241" name="l01241"></a><span class="lineno"> 1241</span> }</div>
|
|
<div class="line"><a id="l01242" name="l01242"></a><span class="lineno"> 1242</span> </div>
|
|
<div class="line"><a id="l01243" name="l01243"></a><span class="lineno"> 1243</span> <span class="comment">// Remove min_weight from the weights of all the assumptions in the core.</span></div>
|
|
<div class="line"><a id="l01244" name="l01244"></a><span class="lineno"> 1244</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l01245" name="l01245"></a><span class="lineno"> 1245</span> <span class="comment">// TODO(user): push right away the objective bound by that much? This should</span></div>
|
|
<div class="line"><a id="l01246" name="l01246"></a><span class="lineno"> 1246</span> <span class="comment">// be better in a multi-threading context as we can share more quickly the</span></div>
|
|
<div class="line"><a id="l01247" name="l01247"></a><span class="lineno"> 1247</span> <span class="comment">// better bound.</span></div>
|
|
<div class="line"><a id="l01248" name="l01248"></a><span class="lineno"> 1248</span> IntegerValue min_weight = assumption_weights[indices.front()];</div>
|
|
<div class="line"><a id="l01249" name="l01249"></a><span class="lineno"> 1249</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> i : indices) {</div>
|
|
<div class="line"><a id="l01250" name="l01250"></a><span class="lineno"> 1250</span> min_weight = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_weight, assumption_weights[i]);</div>
|
|
<div class="line"><a id="l01251" name="l01251"></a><span class="lineno"> 1251</span> }</div>
|
|
<div class="line"><a id="l01252" name="l01252"></a><span class="lineno"> 1252</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> i : indices) {</div>
|
|
<div class="line"><a id="l01253" name="l01253"></a><span class="lineno"> 1253</span> assumption_weights[i] -= min_weight;</div>
|
|
<div class="line"><a id="l01254" name="l01254"></a><span class="lineno"> 1254</span> }</div>
|
|
<div class="line"><a id="l01255" name="l01255"></a><span class="lineno"> 1255</span> </div>
|
|
<div class="line"><a id="l01256" name="l01256"></a><span class="lineno"> 1256</span> <span class="comment">// Remove from assumptions all the one with a new weight smaller than the</span></div>
|
|
<div class="line"><a id="l01257" name="l01257"></a><span class="lineno"> 1257</span> <span class="comment">// current stratification threshold and see if we can find another core.</span></div>
|
|
<div class="line"><a id="l01258" name="l01258"></a><span class="lineno"> 1258</span> <span class="keywordtype">int</span> new_size = 0;</div>
|
|
<div class="line"><a id="l01259" name="l01259"></a><span class="lineno"> 1259</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < assumptions.size(); ++i) {</div>
|
|
<div class="line"><a id="l01260" name="l01260"></a><span class="lineno"> 1260</span> <span class="keywordflow">if</span> (assumption_weights[i] < stratified_threshold) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01261" name="l01261"></a><span class="lineno"> 1261</span> assumptions[new_size] = assumptions[i];</div>
|
|
<div class="line"><a id="l01262" name="l01262"></a><span class="lineno"> 1262</span> assumption_weights[new_size] = assumption_weights[i];</div>
|
|
<div class="line"><a id="l01263" name="l01263"></a><span class="lineno"> 1263</span> ++new_size;</div>
|
|
<div class="line"><a id="l01264" name="l01264"></a><span class="lineno"> 1264</span> }</div>
|
|
<div class="line"><a id="l01265" name="l01265"></a><span class="lineno"> 1265</span> assumptions.resize(new_size);</div>
|
|
<div class="line"><a id="l01266" name="l01266"></a><span class="lineno"> 1266</span> assumption_weights.resize(new_size);</div>
|
|
<div class="line"><a id="l01267" name="l01267"></a><span class="lineno"> 1267</span> } <span class="keywordflow">while</span> (!assumptions.empty());</div>
|
|
<div class="line"><a id="l01268" name="l01268"></a><span class="lineno"> 1268</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885">SatSolver::ASSUMPTIONS_UNSAT</a>;</div>
|
|
<div class="line"><a id="l01269" name="l01269"></a><span class="lineno"> 1269</span>}</div>
|
|
<div class="line"><a id="l01270" name="l01270"></a><span class="lineno"> 1270</span> </div>
|
|
<div class="line"><a id="l01271" name="l01271"></a><span class="lineno"> 1271</span><span class="comment">// Slightly different algo than FindCores() which aim to extract more cores, but</span></div>
|
|
<div class="line"><a id="l01272" name="l01272"></a><span class="lineno"> 1272</span><span class="comment">// not necessarily non-overlaping ones.</span></div>
|
|
<div class="line"><a id="l01273" name="l01273"></a><span class="lineno"> 1273</span><a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> FindMultipleCoresForMaxHs(</div>
|
|
<div class="line"><a id="l01274" name="l01274"></a><span class="lineno"> 1274</span> std::vector<Literal> assumptions, Model* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a id="l01275" name="l01275"></a><span class="lineno"> 1275</span> std::vector<std::vector<Literal>>* cores) {</div>
|
|
<div class="line"><a id="l01276" name="l01276"></a><span class="lineno"> 1276</span> cores->clear();</div>
|
|
<div class="line"><a id="l01277" name="l01277"></a><span class="lineno"> 1277</span> SatSolver* sat_solver = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<SatSolver>();</div>
|
|
<div class="line"><a id="l01278" name="l01278"></a><span class="lineno"> 1278</span> TimeLimit* limit = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<TimeLimit>();</div>
|
|
<div class="line"><a id="l01279" name="l01279"></a><span class="lineno"> 1279</span> <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><a id="l01280" name="l01280"></a><span class="lineno"> 1280</span> <span class="keywordflow">if</span> (limit->LimitReached()) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>;</div>
|
|
<div class="line"><a id="l01281" name="l01281"></a><span class="lineno"> 1281</span> </div>
|
|
<div class="line"><a id="l01282" name="l01282"></a><span class="lineno"> 1282</span> <span class="keyword">const</span> <a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> result =</div>
|
|
<div class="line"><a id="l01283" name="l01283"></a><span class="lineno"> 1283</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a">ResetAndSolveIntegerProblem</a>(assumptions, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a id="l01284" name="l01284"></a><span class="lineno"> 1284</span> <span class="keywordflow">if</span> (result != <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885">SatSolver::ASSUMPTIONS_UNSAT</a>) <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l01285" name="l01285"></a><span class="lineno"> 1285</span> std::vector<Literal> core = sat_solver->GetLastIncompatibleDecisions();</div>
|
|
<div class="line"><a id="l01286" name="l01286"></a><span class="lineno"> 1286</span> <span class="keywordflow">if</span> (sat_solver->parameters().minimize_core()) {</div>
|
|
<div class="line"><a id="l01287" name="l01287"></a><span class="lineno"> 1287</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ab76a35e6ff810ad9ea8b58c7c11606cb">MinimizeCoreWithPropagation</a>(limit, sat_solver, &core);</div>
|
|
<div class="line"><a id="l01288" name="l01288"></a><span class="lineno"> 1288</span> }</div>
|
|
<div class="line"><a id="l01289" name="l01289"></a><span class="lineno"> 1289</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!core.empty());</div>
|
|
<div class="line"><a id="l01290" name="l01290"></a><span class="lineno"> 1290</span> cores->push_back(core);</div>
|
|
<div class="line"><a id="l01291" name="l01291"></a><span class="lineno"> 1291</span> <span class="keywordflow">if</span> (!sat_solver->parameters().find_multiple_cores()) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01292" name="l01292"></a><span class="lineno"> 1292</span> </div>
|
|
<div class="line"><a id="l01293" name="l01293"></a><span class="lineno"> 1293</span> <span class="comment">// Pick a random literal from the core and remove it from the set of</span></div>
|
|
<div class="line"><a id="l01294" name="l01294"></a><span class="lineno"> 1294</span> <span class="comment">// assumptions.</span></div>
|
|
<div class="line"><a id="l01295" name="l01295"></a><span class="lineno"> 1295</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!core.empty());</div>
|
|
<div class="line"><a id="l01296" name="l01296"></a><span class="lineno"> 1296</span> <span class="keyword">auto</span>* random = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<ModelRandomGenerator>();</div>
|
|
<div class="line"><a id="l01297" name="l01297"></a><span class="lineno"> 1297</span> <span class="keyword">const</span> Literal random_literal =</div>
|
|
<div class="line"><a id="l01298" name="l01298"></a><span class="lineno"> 1298</span> core[absl::Uniform<int>(*random, 0, core.size())];</div>
|
|
<div class="line"><a id="l01299" name="l01299"></a><span class="lineno"> 1299</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < assumptions.size(); ++i) {</div>
|
|
<div class="line"><a id="l01300" name="l01300"></a><span class="lineno"> 1300</span> <span class="keywordflow">if</span> (assumptions[i] == random_literal) {</div>
|
|
<div class="line"><a id="l01301" name="l01301"></a><span class="lineno"> 1301</span> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(assumptions[i], assumptions.back());</div>
|
|
<div class="line"><a id="l01302" name="l01302"></a><span class="lineno"> 1302</span> assumptions.pop_back();</div>
|
|
<div class="line"><a id="l01303" name="l01303"></a><span class="lineno"> 1303</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01304" name="l01304"></a><span class="lineno"> 1304</span> }</div>
|
|
<div class="line"><a id="l01305" name="l01305"></a><span class="lineno"> 1305</span> }</div>
|
|
<div class="line"><a id="l01306" name="l01306"></a><span class="lineno"> 1306</span> } <span class="keywordflow">while</span> (!assumptions.empty());</div>
|
|
<div class="line"><a id="l01307" name="l01307"></a><span class="lineno"> 1307</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885">SatSolver::ASSUMPTIONS_UNSAT</a>;</div>
|
|
<div class="line"><a id="l01308" name="l01308"></a><span class="lineno"> 1308</span>}</div>
|
|
<div class="line"><a id="l01309" name="l01309"></a><span class="lineno"> 1309</span> </div>
|
|
<div class="line"><a id="l01310" name="l01310"></a><span class="lineno"> 1310</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l01311" name="l01311"></a><span class="lineno"> 1311</span> </div>
|
|
<div class="line"><a id="l01312" name="l01312"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_core_based_optimizer.html#a02a9dc1603fd32ca7d13e2db95316bb2"> 1312</a></span><a class="code hl_function" href="classoperations__research_1_1sat_1_1_core_based_optimizer.html#a02a9dc1603fd32ca7d13e2db95316bb2">CoreBasedOptimizer::CoreBasedOptimizer</a>(</div>
|
|
<div class="line"><a id="l01313" name="l01313"></a><span class="lineno"> 1313</span> IntegerVariable objective_var,</div>
|
|
<div class="line"><a id="l01314" name="l01314"></a><span class="lineno"> 1314</span> <span class="keyword">const</span> std::vector<IntegerVariable>& variables,</div>
|
|
<div class="line"><a id="l01315" name="l01315"></a><span class="lineno"> 1315</span> <span class="keyword">const</span> std::vector<IntegerValue>& <a class="code hl_variable" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>,</div>
|
|
<div class="line"><a id="l01316" name="l01316"></a><span class="lineno"> 1316</span> std::function<<span class="keywordtype">void</span>()> feasible_solution_observer, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)</div>
|
|
<div class="line"><a id="l01317" name="l01317"></a><span class="lineno"> 1317</span> : parameters_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>()),</div>
|
|
<div class="line"><a id="l01318" name="l01318"></a><span class="lineno"> 1318</span> sat_solver_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>()),</div>
|
|
<div class="line"><a id="l01319" name="l01319"></a><span class="lineno"> 1319</span> time_limit_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>>()),</div>
|
|
<div class="line"><a id="l01320" name="l01320"></a><span class="lineno"> 1320</span> integer_trail_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>()),</div>
|
|
<div class="line"><a id="l01321" name="l01321"></a><span class="lineno"> 1321</span> integer_encoder_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>()),</div>
|
|
<div class="line"><a id="l01322" name="l01322"></a><span class="lineno"> 1322</span> model_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>),</div>
|
|
<div class="line"><a id="l01323" name="l01323"></a><span class="lineno"> 1323</span> objective_var_(objective_var),</div>
|
|
<div class="line"><a id="l01324" name="l01324"></a><span class="lineno"> 1324</span> feasible_solution_observer_(<a class="code hl_namespace" href="namespacestd.html">std</a>::move(feasible_solution_observer)) {</div>
|
|
<div class="line"><a id="l01325" name="l01325"></a><span class="lineno"> 1325</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(variables.size(), <a class="code hl_variable" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>.size());</div>
|
|
<div class="line"><a id="l01326" name="l01326"></a><span class="lineno"> 1326</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < variables.size(); ++i) {</div>
|
|
<div class="line"><a id="l01327" name="l01327"></a><span class="lineno"> 1327</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i] > 0) {</div>
|
|
<div class="line"><a id="l01328" name="l01328"></a><span class="lineno"> 1328</span> terms_.push_back({variables[i], <a class="code hl_variable" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i]});</div>
|
|
<div class="line"><a id="l01329" name="l01329"></a><span class="lineno"> 1329</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i] < 0) {</div>
|
|
<div class="line"><a id="l01330" name="l01330"></a><span class="lineno"> 1330</span> terms_.push_back({<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(variables[i]), -<a class="code hl_variable" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i]});</div>
|
|
<div class="line"><a id="l01331" name="l01331"></a><span class="lineno"> 1331</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01332" name="l01332"></a><span class="lineno"> 1332</span> <span class="keywordflow">continue</span>; <span class="comment">// coefficients[i] == 0</span></div>
|
|
<div class="line"><a id="l01333" name="l01333"></a><span class="lineno"> 1333</span> }</div>
|
|
<div class="line"><a id="l01334" name="l01334"></a><span class="lineno"> 1334</span> terms_.back().depth = 0;</div>
|
|
<div class="line"><a id="l01335" name="l01335"></a><span class="lineno"> 1335</span> }</div>
|
|
<div class="line"><a id="l01336" name="l01336"></a><span class="lineno"> 1336</span> </div>
|
|
<div class="line"><a id="l01337" name="l01337"></a><span class="lineno"> 1337</span> <span class="comment">// This is used by the "stratified" approach. We will only consider terms with</span></div>
|
|
<div class="line"><a id="l01338" name="l01338"></a><span class="lineno"> 1338</span> <span class="comment">// a weight not lower than this threshold. The threshold will decrease as the</span></div>
|
|
<div class="line"><a id="l01339" name="l01339"></a><span class="lineno"> 1339</span> <span class="comment">// algorithm progress.</span></div>
|
|
<div class="line"><a id="l01340" name="l01340"></a><span class="lineno"> 1340</span> stratification_threshold_ = parameters_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a9479680f1c22d80a33b60eff204ae3d0">max_sat_stratification</a>() ==</div>
|
|
<div class="line"><a id="l01341" name="l01341"></a><span class="lineno"> 1341</span> <a class="code hl_variable" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a71ebe8b239aabd3a075a7dcfa2d6d525">SatParameters::STRATIFICATION_NONE</a></div>
|
|
<div class="line"><a id="l01342" name="l01342"></a><span class="lineno"> 1342</span> ? IntegerValue(1)</div>
|
|
<div class="line"><a id="l01343" name="l01343"></a><span class="lineno"> 1343</span> : <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div>
|
|
<div class="line"><a id="l01344" name="l01344"></a><span class="lineno"> 1344</span>}</div>
|
|
<div class="line"><a id="l01345" name="l01345"></a><span class="lineno"> 1345</span> </div>
|
|
<div class="line"><a id="l01346" name="l01346"></a><span class="lineno"> 1346</span><span class="keywordtype">bool</span> CoreBasedOptimizer::ProcessSolution() {</div>
|
|
<div class="line"><a id="l01347" name="l01347"></a><span class="lineno"> 1347</span> <span class="comment">// We don't assume that objective_var is linked with its linear term, so</span></div>
|
|
<div class="line"><a id="l01348" name="l01348"></a><span class="lineno"> 1348</span> <span class="comment">// we recompute the objective here.</span></div>
|
|
<div class="line"><a id="l01349" name="l01349"></a><span class="lineno"> 1349</span> IntegerValue objective(0);</div>
|
|
<div class="line"><a id="l01350" name="l01350"></a><span class="lineno"> 1350</span> <span class="keywordflow">for</span> (ObjectiveTerm& term : terms_) {</div>
|
|
<div class="line"><a id="l01351" name="l01351"></a><span class="lineno"> 1351</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(term.var);</div>
|
|
<div class="line"><a id="l01352" name="l01352"></a><span class="lineno"> 1352</span> objective += term.weight * <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>;</div>
|
|
<div class="line"><a id="l01353" name="l01353"></a><span class="lineno"> 1353</span> </div>
|
|
<div class="line"><a id="l01354" name="l01354"></a><span class="lineno"> 1354</span> <span class="comment">// Also keep in term.cover_ub the minimum value for term.var that we have</span></div>
|
|
<div class="line"><a id="l01355" name="l01355"></a><span class="lineno"> 1355</span> <span class="comment">// seens amongst all the feasible solutions found so far.</span></div>
|
|
<div class="line"><a id="l01356" name="l01356"></a><span class="lineno"> 1356</span> term.cover_ub = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(term.cover_ub, <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a id="l01357" name="l01357"></a><span class="lineno"> 1357</span> }</div>
|
|
<div class="line"><a id="l01358" name="l01358"></a><span class="lineno"> 1358</span> </div>
|
|
<div class="line"><a id="l01359" name="l01359"></a><span class="lineno"> 1359</span> <span class="comment">// We use the level zero upper bound of the objective to indicate an upper</span></div>
|
|
<div class="line"><a id="l01360" name="l01360"></a><span class="lineno"> 1360</span> <span class="comment">// limit for the solution objective we are looking for. Again, because the</span></div>
|
|
<div class="line"><a id="l01361" name="l01361"></a><span class="lineno"> 1361</span> <span class="comment">// objective_var is not assumed to be linked, it could take any value in the</span></div>
|
|
<div class="line"><a id="l01362" name="l01362"></a><span class="lineno"> 1362</span> <span class="comment">// current solution.</span></div>
|
|
<div class="line"><a id="l01363" name="l01363"></a><span class="lineno"> 1363</span> <span class="keywordflow">if</span> (objective > integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(objective_var_)) {</div>
|
|
<div class="line"><a id="l01364" name="l01364"></a><span class="lineno"> 1364</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01365" name="l01365"></a><span class="lineno"> 1365</span> }</div>
|
|
<div class="line"><a id="l01366" name="l01366"></a><span class="lineno"> 1366</span> </div>
|
|
<div class="line"><a id="l01367" name="l01367"></a><span class="lineno"> 1367</span> <span class="keywordflow">if</span> (feasible_solution_observer_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l01368" name="l01368"></a><span class="lineno"> 1368</span> feasible_solution_observer_();</div>
|
|
<div class="line"><a id="l01369" name="l01369"></a><span class="lineno"> 1369</span> }</div>
|
|
<div class="line"><a id="l01370" name="l01370"></a><span class="lineno"> 1370</span> <span class="keywordflow">if</span> (parameters_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a32f3ed6806ec24e1818093f9f9c77f1a">stop_after_first_solution</a>()) {</div>
|
|
<div class="line"><a id="l01371" name="l01371"></a><span class="lineno"> 1371</span> stop_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01372" name="l01372"></a><span class="lineno"> 1372</span> }</div>
|
|
<div class="line"><a id="l01373" name="l01373"></a><span class="lineno"> 1373</span> </div>
|
|
<div class="line"><a id="l01374" name="l01374"></a><span class="lineno"> 1374</span> <span class="comment">// Constrain objective_var. This has a better result when objective_var is</span></div>
|
|
<div class="line"><a id="l01375" name="l01375"></a><span class="lineno"> 1375</span> <span class="comment">// used in an LP relaxation for instance.</span></div>
|
|
<div class="line"><a id="l01376" name="l01376"></a><span class="lineno"> 1376</span> sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a id="l01377" name="l01377"></a><span class="lineno"> 1377</span> sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440">SetAssumptionLevel</a>(0);</div>
|
|
<div class="line"><a id="l01378" name="l01378"></a><span class="lineno"> 1378</span> <span class="keywordflow">return</span> integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(</div>
|
|
<div class="line"><a id="l01379" name="l01379"></a><span class="lineno"> 1379</span> <a class="code hl_function" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(objective_var_, objective - 1), {}, {});</div>
|
|
<div class="line"><a id="l01380" name="l01380"></a><span class="lineno"> 1380</span>}</div>
|
|
<div class="line"><a id="l01381" name="l01381"></a><span class="lineno"> 1381</span> </div>
|
|
<div class="line"><a id="l01382" name="l01382"></a><span class="lineno"> 1382</span><span class="keywordtype">bool</span> CoreBasedOptimizer::PropagateObjectiveBounds() {</div>
|
|
<div class="line"><a id="l01383" name="l01383"></a><span class="lineno"> 1383</span> <span class="comment">// We assumes all terms (modulo stratification) at their lower-bound.</span></div>
|
|
<div class="line"><a id="l01384" name="l01384"></a><span class="lineno"> 1384</span> <span class="keywordtype">bool</span> some_bound_were_tightened = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01385" name="l01385"></a><span class="lineno"> 1385</span> <span class="keywordflow">while</span> (some_bound_were_tightened) {</div>
|
|
<div class="line"><a id="l01386" name="l01386"></a><span class="lineno"> 1386</span> some_bound_were_tightened = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01387" name="l01387"></a><span class="lineno"> 1387</span> <span class="keywordflow">if</span> (!sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029">ResetToLevelZero</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01388" name="l01388"></a><span class="lineno"> 1388</span> </div>
|
|
<div class="line"><a id="l01389" name="l01389"></a><span class="lineno"> 1389</span> <span class="comment">// Compute implied lb.</span></div>
|
|
<div class="line"><a id="l01390" name="l01390"></a><span class="lineno"> 1390</span> IntegerValue implied_objective_lb(0);</div>
|
|
<div class="line"><a id="l01391" name="l01391"></a><span class="lineno"> 1391</span> <span class="keywordflow">for</span> (ObjectiveTerm& term : terms_) {</div>
|
|
<div class="line"><a id="l01392" name="l01392"></a><span class="lineno"> 1392</span> <span class="keyword">const</span> IntegerValue var_lb = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(term.var);</div>
|
|
<div class="line"><a id="l01393" name="l01393"></a><span class="lineno"> 1393</span> term.old_var_lb = var_lb;</div>
|
|
<div class="line"><a id="l01394" name="l01394"></a><span class="lineno"> 1394</span> implied_objective_lb += term.weight * var_lb.value();</div>
|
|
<div class="line"><a id="l01395" name="l01395"></a><span class="lineno"> 1395</span> }</div>
|
|
<div class="line"><a id="l01396" name="l01396"></a><span class="lineno"> 1396</span> </div>
|
|
<div class="line"><a id="l01397" name="l01397"></a><span class="lineno"> 1397</span> <span class="comment">// Update the objective lower bound with our current bound.</span></div>
|
|
<div class="line"><a id="l01398" name="l01398"></a><span class="lineno"> 1398</span> <span class="keywordflow">if</span> (implied_objective_lb > integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(objective_var_)) {</div>
|
|
<div class="line"><a id="l01399" name="l01399"></a><span class="lineno"> 1399</span> <span class="keywordflow">if</span> (!integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(<a class="code hl_function" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(</div>
|
|
<div class="line"><a id="l01400" name="l01400"></a><span class="lineno"> 1400</span> objective_var_, implied_objective_lb),</div>
|
|
<div class="line"><a id="l01401" name="l01401"></a><span class="lineno"> 1401</span> {}, {})) {</div>
|
|
<div class="line"><a id="l01402" name="l01402"></a><span class="lineno"> 1402</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01403" name="l01403"></a><span class="lineno"> 1403</span> }</div>
|
|
<div class="line"><a id="l01404" name="l01404"></a><span class="lineno"> 1404</span> </div>
|
|
<div class="line"><a id="l01405" name="l01405"></a><span class="lineno"> 1405</span> some_bound_were_tightened = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01406" name="l01406"></a><span class="lineno"> 1406</span> }</div>
|
|
<div class="line"><a id="l01407" name="l01407"></a><span class="lineno"> 1407</span> </div>
|
|
<div class="line"><a id="l01408" name="l01408"></a><span class="lineno"> 1408</span> <span class="comment">// The gap is used to propagate the upper-bound of all variable that are</span></div>
|
|
<div class="line"><a id="l01409" name="l01409"></a><span class="lineno"> 1409</span> <span class="comment">// in the current objective (Exactly like done in the propagation of a</span></div>
|
|
<div class="line"><a id="l01410" name="l01410"></a><span class="lineno"> 1410</span> <span class="comment">// linear constraint with the slack). When this fix a variable to its</span></div>
|
|
<div class="line"><a id="l01411" name="l01411"></a><span class="lineno"> 1411</span> <span class="comment">// lower bound, it is called "hardening" in the max-sat literature. This</span></div>
|
|
<div class="line"><a id="l01412" name="l01412"></a><span class="lineno"> 1412</span> <span class="comment">// has a really beneficial effect on some weighted max-sat problems like</span></div>
|
|
<div class="line"><a id="l01413" name="l01413"></a><span class="lineno"> 1413</span> <span class="comment">// the haplotyping-pedigrees ones.</span></div>
|
|
<div class="line"><a id="l01414" name="l01414"></a><span class="lineno"> 1414</span> <span class="keyword">const</span> IntegerValue gap =</div>
|
|
<div class="line"><a id="l01415" name="l01415"></a><span class="lineno"> 1415</span> integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(objective_var_) - implied_objective_lb;</div>
|
|
<div class="line"><a id="l01416" name="l01416"></a><span class="lineno"> 1416</span> </div>
|
|
<div class="line"><a id="l01417" name="l01417"></a><span class="lineno"> 1417</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> ObjectiveTerm& term : terms_) {</div>
|
|
<div class="line"><a id="l01418" name="l01418"></a><span class="lineno"> 1418</span> <span class="keywordflow">if</span> (term.weight == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01419" name="l01419"></a><span class="lineno"> 1419</span> <span class="keyword">const</span> IntegerValue var_lb = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(term.var);</div>
|
|
<div class="line"><a id="l01420" name="l01420"></a><span class="lineno"> 1420</span> <span class="keyword">const</span> IntegerValue var_ub = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(term.var);</div>
|
|
<div class="line"><a id="l01421" name="l01421"></a><span class="lineno"> 1421</span> <span class="keywordflow">if</span> (var_lb == var_ub) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01422" name="l01422"></a><span class="lineno"> 1422</span> </div>
|
|
<div class="line"><a id="l01423" name="l01423"></a><span class="lineno"> 1423</span> <span class="comment">// Hardening. This basically just propagate the implied upper bound on</span></div>
|
|
<div class="line"><a id="l01424" name="l01424"></a><span class="lineno"> 1424</span> <span class="comment">// term.var from the current best solution. Note that the gap is</span></div>
|
|
<div class="line"><a id="l01425" name="l01425"></a><span class="lineno"> 1425</span> <span class="comment">// non-negative and the weight positive here. The test is done in order</span></div>
|
|
<div class="line"><a id="l01426" name="l01426"></a><span class="lineno"> 1426</span> <span class="comment">// to avoid any integer overflow provided (ub - lb) do not overflow, but</span></div>
|
|
<div class="line"><a id="l01427" name="l01427"></a><span class="lineno"> 1427</span> <span class="comment">// this is a precondition in our cp-model.</span></div>
|
|
<div class="line"><a id="l01428" name="l01428"></a><span class="lineno"> 1428</span> <span class="keywordflow">if</span> (gap / term.weight < var_ub - var_lb) {</div>
|
|
<div class="line"><a id="l01429" name="l01429"></a><span class="lineno"> 1429</span> some_bound_were_tightened = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01430" name="l01430"></a><span class="lineno"> 1430</span> <span class="keyword">const</span> IntegerValue new_ub = var_lb + gap / term.weight;</div>
|
|
<div class="line"><a id="l01431" name="l01431"></a><span class="lineno"> 1431</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(new_ub, var_ub);</div>
|
|
<div class="line"><a id="l01432" name="l01432"></a><span class="lineno"> 1432</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a309d057e12c8d4d393f13975eea2e2a9">IsCurrentlyIgnored</a>(term.var));</div>
|
|
<div class="line"><a id="l01433" name="l01433"></a><span class="lineno"> 1433</span> <span class="keywordflow">if</span> (!integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(</div>
|
|
<div class="line"><a id="l01434" name="l01434"></a><span class="lineno"> 1434</span> <a class="code hl_function" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(term.var, new_ub), {}, {})) {</div>
|
|
<div class="line"><a id="l01435" name="l01435"></a><span class="lineno"> 1435</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01436" name="l01436"></a><span class="lineno"> 1436</span> }</div>
|
|
<div class="line"><a id="l01437" name="l01437"></a><span class="lineno"> 1437</span> }</div>
|
|
<div class="line"><a id="l01438" name="l01438"></a><span class="lineno"> 1438</span> }</div>
|
|
<div class="line"><a id="l01439" name="l01439"></a><span class="lineno"> 1439</span> }</div>
|
|
<div class="line"><a id="l01440" name="l01440"></a><span class="lineno"> 1440</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01441" name="l01441"></a><span class="lineno"> 1441</span>}</div>
|
|
<div class="line"><a id="l01442" name="l01442"></a><span class="lineno"> 1442</span> </div>
|
|
<div class="line"><a id="l01443" name="l01443"></a><span class="lineno"> 1443</span><span class="comment">// A basic algorithm is to take the next one, or at least the next one</span></div>
|
|
<div class="line"><a id="l01444" name="l01444"></a><span class="lineno"> 1444</span><span class="comment">// that invalidate the current solution. But to avoid corner cases for</span></div>
|
|
<div class="line"><a id="l01445" name="l01445"></a><span class="lineno"> 1445</span><span class="comment">// problem with a lot of terms all with different objective weights (in</span></div>
|
|
<div class="line"><a id="l01446" name="l01446"></a><span class="lineno"> 1446</span><span class="comment">// which case we will kind of introduce only one assumption per loop</span></div>
|
|
<div class="line"><a id="l01447" name="l01447"></a><span class="lineno"> 1447</span><span class="comment">// which is little), we use an heuristic and take the 90% percentile of</span></div>
|
|
<div class="line"><a id="l01448" name="l01448"></a><span class="lineno"> 1448</span><span class="comment">// the unique weights not yet included.</span></div>
|
|
<div class="line"><a id="l01449" name="l01449"></a><span class="lineno"> 1449</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l01450" name="l01450"></a><span class="lineno"> 1450</span><span class="comment">// TODO(user): There is many other possible heuristics here, and I</span></div>
|
|
<div class="line"><a id="l01451" name="l01451"></a><span class="lineno"> 1451</span><span class="comment">// didn't have the time to properly compare them.</span></div>
|
|
<div class="line"><a id="l01452" name="l01452"></a><span class="lineno"> 1452</span><span class="keywordtype">void</span> CoreBasedOptimizer::ComputeNextStratificationThreshold() {</div>
|
|
<div class="line"><a id="l01453" name="l01453"></a><span class="lineno"> 1453</span> std::vector<IntegerValue> weights;</div>
|
|
<div class="line"><a id="l01454" name="l01454"></a><span class="lineno"> 1454</span> <span class="keywordflow">for</span> (ObjectiveTerm& term : terms_) {</div>
|
|
<div class="line"><a id="l01455" name="l01455"></a><span class="lineno"> 1455</span> <span class="keywordflow">if</span> (term.weight >= stratification_threshold_) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01456" name="l01456"></a><span class="lineno"> 1456</span> <span class="keywordflow">if</span> (term.weight == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01457" name="l01457"></a><span class="lineno"> 1457</span> </div>
|
|
<div class="line"><a id="l01458" name="l01458"></a><span class="lineno"> 1458</span> <span class="keyword">const</span> IntegerValue var_lb = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(term.var);</div>
|
|
<div class="line"><a id="l01459" name="l01459"></a><span class="lineno"> 1459</span> <span class="keyword">const</span> IntegerValue var_ub = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(term.var);</div>
|
|
<div class="line"><a id="l01460" name="l01460"></a><span class="lineno"> 1460</span> <span class="keywordflow">if</span> (var_lb == var_ub) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01461" name="l01461"></a><span class="lineno"> 1461</span> </div>
|
|
<div class="line"><a id="l01462" name="l01462"></a><span class="lineno"> 1462</span> weights.push_back(term.weight);</div>
|
|
<div class="line"><a id="l01463" name="l01463"></a><span class="lineno"> 1463</span> }</div>
|
|
<div class="line"><a id="l01464" name="l01464"></a><span class="lineno"> 1464</span> <span class="keywordflow">if</span> (weights.empty()) {</div>
|
|
<div class="line"><a id="l01465" name="l01465"></a><span class="lineno"> 1465</span> stratification_threshold_ = IntegerValue(0);</div>
|
|
<div class="line"><a id="l01466" name="l01466"></a><span class="lineno"> 1466</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l01467" name="l01467"></a><span class="lineno"> 1467</span> }</div>
|
|
<div class="line"><a id="l01468" name="l01468"></a><span class="lineno"> 1468</span> </div>
|
|
<div class="line"><a id="l01469" name="l01469"></a><span class="lineno"> 1469</span> <a class="code hl_function" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&weights);</div>
|
|
<div class="line"><a id="l01470" name="l01470"></a><span class="lineno"> 1470</span> stratification_threshold_ =</div>
|
|
<div class="line"><a id="l01471" name="l01471"></a><span class="lineno"> 1471</span> weights[<span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(std::floor(0.9 * weights.size()))];</div>
|
|
<div class="line"><a id="l01472" name="l01472"></a><span class="lineno"> 1472</span>}</div>
|
|
<div class="line"><a id="l01473" name="l01473"></a><span class="lineno"> 1473</span> </div>
|
|
<div class="line"><a id="l01474" name="l01474"></a><span class="lineno"> 1474</span><span class="keywordtype">bool</span> CoreBasedOptimizer::CoverOptimization() {</div>
|
|
<div class="line"><a id="l01475" name="l01475"></a><span class="lineno"> 1475</span> <span class="comment">// We set a fix deterministic time limit per all sub-solve and skip to the</span></div>
|
|
<div class="line"><a id="l01476" name="l01476"></a><span class="lineno"> 1476</span> <span class="comment">// next core if the sum of the subsolve is also over this limit.</span></div>
|
|
<div class="line"><a id="l01477" name="l01477"></a><span class="lineno"> 1477</span> <span class="keyword">constexpr</span> <span class="keywordtype">double</span> max_dtime_per_core = 0.5;</div>
|
|
<div class="line"><a id="l01478" name="l01478"></a><span class="lineno"> 1478</span> <span class="keyword">const</span> <span class="keywordtype">double</span> old_time_limit = parameters_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a042e4456dbde45ef0da51857b8b3650a">max_deterministic_time</a>();</div>
|
|
<div class="line"><a id="l01479" name="l01479"></a><span class="lineno"> 1479</span> parameters_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a89082aa97657e1720a8c241a4afb4de8">set_max_deterministic_time</a>(max_dtime_per_core);</div>
|
|
<div class="line"><a id="l01480" name="l01480"></a><span class="lineno"> 1480</span> <span class="keyword">auto</span> cleanup = <a class="code hl_function" href="namespaceabsl.html#a01547ab811df98c71089487f394ec259">::absl::MakeCleanup</a>([old_time_limit, <span class="keyword">this</span>]() {</div>
|
|
<div class="line"><a id="l01481" name="l01481"></a><span class="lineno"> 1481</span> parameters_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a89082aa97657e1720a8c241a4afb4de8">set_max_deterministic_time</a>(old_time_limit);</div>
|
|
<div class="line"><a id="l01482" name="l01482"></a><span class="lineno"> 1482</span> });</div>
|
|
<div class="line"><a id="l01483" name="l01483"></a><span class="lineno"> 1483</span> </div>
|
|
<div class="line"><a id="l01484" name="l01484"></a><span class="lineno"> 1484</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> ObjectiveTerm& term : terms_) {</div>
|
|
<div class="line"><a id="l01485" name="l01485"></a><span class="lineno"> 1485</span> <span class="comment">// We currently skip the initial objective terms as there could be many</span></div>
|
|
<div class="line"><a id="l01486" name="l01486"></a><span class="lineno"> 1486</span> <span class="comment">// of them. TODO(user): provide an option to cover-optimize them? I</span></div>
|
|
<div class="line"><a id="l01487" name="l01487"></a><span class="lineno"> 1487</span> <span class="comment">// fear that this will slow down the solver too much though.</span></div>
|
|
<div class="line"><a id="l01488" name="l01488"></a><span class="lineno"> 1488</span> <span class="keywordflow">if</span> (term.depth == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01489" name="l01489"></a><span class="lineno"> 1489</span> </div>
|
|
<div class="line"><a id="l01490" name="l01490"></a><span class="lineno"> 1490</span> <span class="comment">// Find out the true lower bound of var. This is called "cover</span></div>
|
|
<div class="line"><a id="l01491" name="l01491"></a><span class="lineno"> 1491</span> <span class="comment">// optimization" in some of the max-SAT literature. It can helps on some</span></div>
|
|
<div class="line"><a id="l01492" name="l01492"></a><span class="lineno"> 1492</span> <span class="comment">// problem families and hurt on others, but the overall impact is</span></div>
|
|
<div class="line"><a id="l01493" name="l01493"></a><span class="lineno"> 1493</span> <span class="comment">// positive.</span></div>
|
|
<div class="line"><a id="l01494" name="l01494"></a><span class="lineno"> 1494</span> <span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = term.var;</div>
|
|
<div class="line"><a id="l01495" name="l01495"></a><span class="lineno"> 1495</span> IntegerValue best =</div>
|
|
<div class="line"><a id="l01496" name="l01496"></a><span class="lineno"> 1496</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(term.cover_ub, integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a id="l01497" name="l01497"></a><span class="lineno"> 1497</span> </div>
|
|
<div class="line"><a id="l01498" name="l01498"></a><span class="lineno"> 1498</span> <span class="comment">// Note(user): this can happen in some corner case because each time we</span></div>
|
|
<div class="line"><a id="l01499" name="l01499"></a><span class="lineno"> 1499</span> <span class="comment">// find a solution, we constrain the objective to be smaller than it, so</span></div>
|
|
<div class="line"><a id="l01500" name="l01500"></a><span class="lineno"> 1500</span> <span class="comment">// it is possible that a previous best is now infeasible.</span></div>
|
|
<div class="line"><a id="l01501" name="l01501"></a><span class="lineno"> 1501</span> <span class="keywordflow">if</span> (best <= integer_trail_-><a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a3ad49ae9019c528851f6fd084479a567">LowerBound</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01502" name="l01502"></a><span class="lineno"> 1502</span> </div>
|
|
<div class="line"><a id="l01503" name="l01503"></a><span class="lineno"> 1503</span> <span class="comment">// Compute the global deterministic time for this core cover</span></div>
|
|
<div class="line"><a id="l01504" name="l01504"></a><span class="lineno"> 1504</span> <span class="comment">// optimization.</span></div>
|
|
<div class="line"><a id="l01505" name="l01505"></a><span class="lineno"> 1505</span> <span class="keyword">const</span> <span class="keywordtype">double</span> deterministic_limit =</div>
|
|
<div class="line"><a id="l01506" name="l01506"></a><span class="lineno"> 1506</span> time_limit_-><a class="code hl_function" href="classoperations__research_1_1_time_limit.html#ac7e861414a70fc937d18bc7ca743fc98">GetElapsedDeterministicTime</a>() + max_dtime_per_core;</div>
|
|
<div class="line"><a id="l01507" name="l01507"></a><span class="lineno"> 1507</span> </div>
|
|
<div class="line"><a id="l01508" name="l01508"></a><span class="lineno"> 1508</span> <span class="comment">// Simple linear scan algorithm to find the optimal of var.</span></div>
|
|
<div class="line"><a id="l01509" name="l01509"></a><span class="lineno"> 1509</span> <a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> result;</div>
|
|
<div class="line"><a id="l01510" name="l01510"></a><span class="lineno"> 1510</span> <span class="keywordflow">while</span> (best > integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) {</div>
|
|
<div class="line"><a id="l01511" name="l01511"></a><span class="lineno"> 1511</span> <span class="keyword">const</span> Literal assumption = integer_encoder_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_encoder.html#afcd4038298bec97a2f7a61274c6ef8c7">GetOrCreateAssociatedLiteral</a>(</div>
|
|
<div class="line"><a id="l01512" name="l01512"></a><span class="lineno"> 1512</span> <a class="code hl_function" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, best - 1));</div>
|
|
<div class="line"><a id="l01513" name="l01513"></a><span class="lineno"> 1513</span> result = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a">ResetAndSolveIntegerProblem</a>({assumption}, model_);</div>
|
|
<div class="line"><a id="l01514" name="l01514"></a><span class="lineno"> 1514</span> <span class="keywordflow">if</span> (result != <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01515" name="l01515"></a><span class="lineno"> 1515</span> </div>
|
|
<div class="line"><a id="l01516" name="l01516"></a><span class="lineno"> 1516</span> best = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a id="l01517" name="l01517"></a><span class="lineno"> 1517</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"cover_opt var:"</span> << <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> << <span class="stringliteral">" domain:["</span></div>
|
|
<div class="line"><a id="l01518" name="l01518"></a><span class="lineno"> 1518</span> << integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) << <span class="stringliteral">","</span> << best << <span class="stringliteral">"]"</span>;</div>
|
|
<div class="line"><a id="l01519" name="l01519"></a><span class="lineno"> 1519</span> <span class="keywordflow">if</span> (!ProcessSolution()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01520" name="l01520"></a><span class="lineno"> 1520</span> <span class="keywordflow">if</span> (!sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029">ResetToLevelZero</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01521" name="l01521"></a><span class="lineno"> 1521</span> <span class="keywordflow">if</span> (stop_ ||</div>
|
|
<div class="line"><a id="l01522" name="l01522"></a><span class="lineno"> 1522</span> time_limit_-><a class="code hl_function" href="classoperations__research_1_1_time_limit.html#ac7e861414a70fc937d18bc7ca743fc98">GetElapsedDeterministicTime</a>() > deterministic_limit) {</div>
|
|
<div class="line"><a id="l01523" name="l01523"></a><span class="lineno"> 1523</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01524" name="l01524"></a><span class="lineno"> 1524</span> }</div>
|
|
<div class="line"><a id="l01525" name="l01525"></a><span class="lineno"> 1525</span> }</div>
|
|
<div class="line"><a id="l01526" name="l01526"></a><span class="lineno"> 1526</span> <span class="keywordflow">if</span> (result == <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01527" name="l01527"></a><span class="lineno"> 1527</span> <span class="keywordflow">if</span> (result == <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885">SatSolver::ASSUMPTIONS_UNSAT</a>) {</div>
|
|
<div class="line"><a id="l01528" name="l01528"></a><span class="lineno"> 1528</span> <span class="comment">// TODO(user): If we improve the lower bound of var, we should check</span></div>
|
|
<div class="line"><a id="l01529" name="l01529"></a><span class="lineno"> 1529</span> <span class="comment">// if our global lower bound reached our current best solution in</span></div>
|
|
<div class="line"><a id="l01530" name="l01530"></a><span class="lineno"> 1530</span> <span class="comment">// order to abort early if the optimal is proved.</span></div>
|
|
<div class="line"><a id="l01531" name="l01531"></a><span class="lineno"> 1531</span> <span class="keywordflow">if</span> (!integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(<a class="code hl_function" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, best),</div>
|
|
<div class="line"><a id="l01532" name="l01532"></a><span class="lineno"> 1532</span> {}, {})) {</div>
|
|
<div class="line"><a id="l01533" name="l01533"></a><span class="lineno"> 1533</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01534" name="l01534"></a><span class="lineno"> 1534</span> }</div>
|
|
<div class="line"><a id="l01535" name="l01535"></a><span class="lineno"> 1535</span> }</div>
|
|
<div class="line"><a id="l01536" name="l01536"></a><span class="lineno"> 1536</span> }</div>
|
|
<div class="line"><a id="l01537" name="l01537"></a><span class="lineno"> 1537</span> </div>
|
|
<div class="line"><a id="l01538" name="l01538"></a><span class="lineno"> 1538</span> <span class="keywordflow">if</span> (!PropagateObjectiveBounds()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01539" name="l01539"></a><span class="lineno"> 1539</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01540" name="l01540"></a><span class="lineno"> 1540</span>}</div>
|
|
<div class="line"><a id="l01541" name="l01541"></a><span class="lineno"> 1541</span> </div>
|
|
<div class="line"><a id="l01542" name="l01542"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_core_based_optimizer.html#a4398d89730acb3b628a3c81d55bac96f"> 1542</a></span><a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_core_based_optimizer.html#a4398d89730acb3b628a3c81d55bac96f">CoreBasedOptimizer::Optimize</a>() {</div>
|
|
<div class="line"><a id="l01543" name="l01543"></a><span class="lineno"> 1543</span> <span class="comment">// TODO(user): The core is returned in the same order as the assumptions,</span></div>
|
|
<div class="line"><a id="l01544" name="l01544"></a><span class="lineno"> 1544</span> <span class="comment">// so we don't really need this map, we could just do a linear scan to</span></div>
|
|
<div class="line"><a id="l01545" name="l01545"></a><span class="lineno"> 1545</span> <span class="comment">// recover which node are part of the core. This however needs to be properly</span></div>
|
|
<div class="line"><a id="l01546" name="l01546"></a><span class="lineno"> 1546</span> <span class="comment">// unit tested before usage.</span></div>
|
|
<div class="line"><a id="l01547" name="l01547"></a><span class="lineno"> 1547</span> std::map<LiteralIndex, int> literal_to_term_index;</div>
|
|
<div class="line"><a id="l01548" name="l01548"></a><span class="lineno"> 1548</span> </div>
|
|
<div class="line"><a id="l01549" name="l01549"></a><span class="lineno"> 1549</span> <span class="comment">// Start the algorithm.</span></div>
|
|
<div class="line"><a id="l01550" name="l01550"></a><span class="lineno"> 1550</span> stop_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01551" name="l01551"></a><span class="lineno"> 1551</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a id="l01552" name="l01552"></a><span class="lineno"> 1552</span> <span class="comment">// TODO(user): This always resets the solver to level zero.</span></div>
|
|
<div class="line"><a id="l01553" name="l01553"></a><span class="lineno"> 1553</span> <span class="comment">// Because of that we don't resume a solve in "chunk" perfectly. Fix.</span></div>
|
|
<div class="line"><a id="l01554" name="l01554"></a><span class="lineno"> 1554</span> <span class="keywordflow">if</span> (!PropagateObjectiveBounds()) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l01555" name="l01555"></a><span class="lineno"> 1555</span> </div>
|
|
<div class="line"><a id="l01556" name="l01556"></a><span class="lineno"> 1556</span> <span class="comment">// Bulk cover optimization.</span></div>
|
|
<div class="line"><a id="l01557" name="l01557"></a><span class="lineno"> 1557</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l01558" name="l01558"></a><span class="lineno"> 1558</span> <span class="comment">// TODO(user): If the search is aborted during this phase and we solve in</span></div>
|
|
<div class="line"><a id="l01559" name="l01559"></a><span class="lineno"> 1559</span> <span class="comment">// "chunk", we don't resume perfectly from where it was. Fix.</span></div>
|
|
<div class="line"><a id="l01560" name="l01560"></a><span class="lineno"> 1560</span> <span class="keywordflow">if</span> (parameters_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a767ec8a1eb70a96791e5f1789464be03">cover_optimization</a>()) {</div>
|
|
<div class="line"><a id="l01561" name="l01561"></a><span class="lineno"> 1561</span> <span class="keywordflow">if</span> (!CoverOptimization()) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l01562" name="l01562"></a><span class="lineno"> 1562</span> <span class="keywordflow">if</span> (stop_) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>;</div>
|
|
<div class="line"><a id="l01563" name="l01563"></a><span class="lineno"> 1563</span> }</div>
|
|
<div class="line"><a id="l01564" name="l01564"></a><span class="lineno"> 1564</span> </div>
|
|
<div class="line"><a id="l01565" name="l01565"></a><span class="lineno"> 1565</span> <span class="comment">// We assumes all terms (modulo stratification) at their lower-bound.</span></div>
|
|
<div class="line"><a id="l01566" name="l01566"></a><span class="lineno"> 1566</span> std::vector<int> term_indices;</div>
|
|
<div class="line"><a id="l01567" name="l01567"></a><span class="lineno"> 1567</span> std::vector<IntegerLiteral> integer_assumptions;</div>
|
|
<div class="line"><a id="l01568" name="l01568"></a><span class="lineno"> 1568</span> std::vector<IntegerValue> assumption_weights;</div>
|
|
<div class="line"><a id="l01569" name="l01569"></a><span class="lineno"> 1569</span> IntegerValue objective_offset(0);</div>
|
|
<div class="line"><a id="l01570" name="l01570"></a><span class="lineno"> 1570</span> <span class="keywordtype">bool</span> some_assumptions_were_skipped = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01571" name="l01571"></a><span class="lineno"> 1571</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < terms_.size(); ++i) {</div>
|
|
<div class="line"><a id="l01572" name="l01572"></a><span class="lineno"> 1572</span> <span class="keyword">const</span> ObjectiveTerm term = terms_[i];</div>
|
|
<div class="line"><a id="l01573" name="l01573"></a><span class="lineno"> 1573</span> </div>
|
|
<div class="line"><a id="l01574" name="l01574"></a><span class="lineno"> 1574</span> <span class="comment">// TODO(user): These can be simply removed from the list.</span></div>
|
|
<div class="line"><a id="l01575" name="l01575"></a><span class="lineno"> 1575</span> <span class="keywordflow">if</span> (term.weight == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01576" name="l01576"></a><span class="lineno"> 1576</span> </div>
|
|
<div class="line"><a id="l01577" name="l01577"></a><span class="lineno"> 1577</span> <span class="comment">// Skip fixed terms.</span></div>
|
|
<div class="line"><a id="l01578" name="l01578"></a><span class="lineno"> 1578</span> <span class="comment">// We still keep them around for a proper lower-bound computation.</span></div>
|
|
<div class="line"><a id="l01579" name="l01579"></a><span class="lineno"> 1579</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l01580" name="l01580"></a><span class="lineno"> 1580</span> <span class="comment">// TODO(user): we could keep an objective offset instead.</span></div>
|
|
<div class="line"><a id="l01581" name="l01581"></a><span class="lineno"> 1581</span> <span class="keyword">const</span> IntegerValue var_lb = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(term.var);</div>
|
|
<div class="line"><a id="l01582" name="l01582"></a><span class="lineno"> 1582</span> <span class="keyword">const</span> IntegerValue var_ub = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(term.var);</div>
|
|
<div class="line"><a id="l01583" name="l01583"></a><span class="lineno"> 1583</span> <span class="keywordflow">if</span> (var_lb == var_ub) {</div>
|
|
<div class="line"><a id="l01584" name="l01584"></a><span class="lineno"> 1584</span> objective_offset += term.weight * var_lb.value();</div>
|
|
<div class="line"><a id="l01585" name="l01585"></a><span class="lineno"> 1585</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01586" name="l01586"></a><span class="lineno"> 1586</span> }</div>
|
|
<div class="line"><a id="l01587" name="l01587"></a><span class="lineno"> 1587</span> </div>
|
|
<div class="line"><a id="l01588" name="l01588"></a><span class="lineno"> 1588</span> <span class="comment">// Only consider the terms above the threshold.</span></div>
|
|
<div class="line"><a id="l01589" name="l01589"></a><span class="lineno"> 1589</span> <span class="keywordflow">if</span> (term.weight >= stratification_threshold_) {</div>
|
|
<div class="line"><a id="l01590" name="l01590"></a><span class="lineno"> 1590</span> integer_assumptions.push_back(</div>
|
|
<div class="line"><a id="l01591" name="l01591"></a><span class="lineno"> 1591</span> <a class="code hl_function" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(term.var, var_lb));</div>
|
|
<div class="line"><a id="l01592" name="l01592"></a><span class="lineno"> 1592</span> assumption_weights.push_back(term.weight);</div>
|
|
<div class="line"><a id="l01593" name="l01593"></a><span class="lineno"> 1593</span> term_indices.push_back(i);</div>
|
|
<div class="line"><a id="l01594" name="l01594"></a><span class="lineno"> 1594</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01595" name="l01595"></a><span class="lineno"> 1595</span> some_assumptions_were_skipped = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01596" name="l01596"></a><span class="lineno"> 1596</span> }</div>
|
|
<div class="line"><a id="l01597" name="l01597"></a><span class="lineno"> 1597</span> }</div>
|
|
<div class="line"><a id="l01598" name="l01598"></a><span class="lineno"> 1598</span> </div>
|
|
<div class="line"><a id="l01599" name="l01599"></a><span class="lineno"> 1599</span> <span class="comment">// No assumptions with the current stratification? use the next one.</span></div>
|
|
<div class="line"><a id="l01600" name="l01600"></a><span class="lineno"> 1600</span> <span class="keywordflow">if</span> (term_indices.empty() && some_assumptions_were_skipped) {</div>
|
|
<div class="line"><a id="l01601" name="l01601"></a><span class="lineno"> 1601</span> ComputeNextStratificationThreshold();</div>
|
|
<div class="line"><a id="l01602" name="l01602"></a><span class="lineno"> 1602</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01603" name="l01603"></a><span class="lineno"> 1603</span> }</div>
|
|
<div class="line"><a id="l01604" name="l01604"></a><span class="lineno"> 1604</span> </div>
|
|
<div class="line"><a id="l01605" name="l01605"></a><span class="lineno"> 1605</span> <span class="comment">// If there is only one or two assumptions left, we switch the algorithm.</span></div>
|
|
<div class="line"><a id="l01606" name="l01606"></a><span class="lineno"> 1606</span> <span class="keywordflow">if</span> (term_indices.size() <= 2 && !some_assumptions_were_skipped) {</div>
|
|
<div class="line"><a id="l01607" name="l01607"></a><span class="lineno"> 1607</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Switching to linear scan..."</span>;</div>
|
|
<div class="line"><a id="l01608" name="l01608"></a><span class="lineno"> 1608</span> <span class="keywordflow">if</span> (!already_switched_to_linear_scan_) {</div>
|
|
<div class="line"><a id="l01609" name="l01609"></a><span class="lineno"> 1609</span> already_switched_to_linear_scan_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01610" name="l01610"></a><span class="lineno"> 1610</span> std::vector<IntegerVariable> constraint_vars;</div>
|
|
<div class="line"><a id="l01611" name="l01611"></a><span class="lineno"> 1611</span> std::vector<int64_t> constraint_coeffs;</div>
|
|
<div class="line"><a id="l01612" name="l01612"></a><span class="lineno"> 1612</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> : term_indices) {</div>
|
|
<div class="line"><a id="l01613" name="l01613"></a><span class="lineno"> 1613</span> constraint_vars.push_back(terms_[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a id="l01614" name="l01614"></a><span class="lineno"> 1614</span> constraint_coeffs.push_back(terms_[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].<a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a>.value());</div>
|
|
<div class="line"><a id="l01615" name="l01615"></a><span class="lineno"> 1615</span> }</div>
|
|
<div class="line"><a id="l01616" name="l01616"></a><span class="lineno"> 1616</span> constraint_vars.push_back(objective_var_);</div>
|
|
<div class="line"><a id="l01617" name="l01617"></a><span class="lineno"> 1617</span> constraint_coeffs.push_back(-1);</div>
|
|
<div class="line"><a id="l01618" name="l01618"></a><span class="lineno"> 1618</span> model_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_model.html#a7b8d774b566431b8932ba0f3c921ec7d">Add</a>(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a2d7fdf5a1e3a1a9f3c4b893227f2f523">WeightedSumLowerOrEqual</a>(constraint_vars, constraint_coeffs,</div>
|
|
<div class="line"><a id="l01619" name="l01619"></a><span class="lineno"> 1619</span> -objective_offset.value()));</div>
|
|
<div class="line"><a id="l01620" name="l01620"></a><span class="lineno"> 1620</span> }</div>
|
|
<div class="line"><a id="l01621" name="l01621"></a><span class="lineno"> 1621</span> </div>
|
|
<div class="line"><a id="l01622" name="l01622"></a><span class="lineno"> 1622</span> <span class="keywordflow">return</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#affe1669ec9e0e7cbd54e895bbbff43af">MinimizeIntegerVariableWithLinearScanAndLazyEncoding</a>(</div>
|
|
<div class="line"><a id="l01623" name="l01623"></a><span class="lineno"> 1623</span> objective_var_, feasible_solution_observer_, model_);</div>
|
|
<div class="line"><a id="l01624" name="l01624"></a><span class="lineno"> 1624</span> }</div>
|
|
<div class="line"><a id="l01625" name="l01625"></a><span class="lineno"> 1625</span> </div>
|
|
<div class="line"><a id="l01626" name="l01626"></a><span class="lineno"> 1626</span> <span class="comment">// Display the progress.</span></div>
|
|
<div class="line"><a id="l01627" name="l01627"></a><span class="lineno"> 1627</span> <span class="keywordflow">if</span> (<a class="code hl_define" href="vlog__is__on_8h.html#a956152cad330225654d128f35c00efce">VLOG_IS_ON</a>(1)) {</div>
|
|
<div class="line"><a id="l01628" name="l01628"></a><span class="lineno"> 1628</span> <span class="keywordtype">int</span> max_depth = 0;</div>
|
|
<div class="line"><a id="l01629" name="l01629"></a><span class="lineno"> 1629</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> ObjectiveTerm& term : terms_) {</div>
|
|
<div class="line"><a id="l01630" name="l01630"></a><span class="lineno"> 1630</span> max_depth = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_depth, term.depth);</div>
|
|
<div class="line"><a id="l01631" name="l01631"></a><span class="lineno"> 1631</span> }</div>
|
|
<div class="line"><a id="l01632" name="l01632"></a><span class="lineno"> 1632</span> <span class="keyword">const</span> int64_t lb = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(objective_var_).value();</div>
|
|
<div class="line"><a id="l01633" name="l01633"></a><span class="lineno"> 1633</span> <span class="keyword">const</span> int64_t ub = integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(objective_var_).value();</div>
|
|
<div class="line"><a id="l01634" name="l01634"></a><span class="lineno"> 1634</span> <span class="keyword">const</span> <span class="keywordtype">int</span> gap =</div>
|
|
<div class="line"><a id="l01635" name="l01635"></a><span class="lineno"> 1635</span> lb == ub</div>
|
|
<div class="line"><a id="l01636" name="l01636"></a><span class="lineno"> 1636</span> ? 0</div>
|
|
<div class="line"><a id="l01637" name="l01637"></a><span class="lineno"> 1637</span> : <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(std::ceil(</div>
|
|
<div class="line"><a id="l01638" name="l01638"></a><span class="lineno"> 1638</span> 100.0 * (ub - lb) / <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(std::abs(ub), std::abs(lb))));</div>
|
|
<div class="line"><a id="l01639" name="l01639"></a><span class="lineno"> 1639</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << absl::StrCat(<span class="stringliteral">"unscaled_next_obj_range:["</span>, lb, <span class="stringliteral">","</span>, ub,</div>
|
|
<div class="line"><a id="l01640" name="l01640"></a><span class="lineno"> 1640</span> <span class="stringliteral">"]"</span></div>
|
|
<div class="line"><a id="l01641" name="l01641"></a><span class="lineno"> 1641</span> <span class="stringliteral">" gap:"</span>,</div>
|
|
<div class="line"><a id="l01642" name="l01642"></a><span class="lineno"> 1642</span> gap, <span class="stringliteral">"%"</span>, <span class="stringliteral">" assumptions:"</span>, term_indices.size(),</div>
|
|
<div class="line"><a id="l01643" name="l01643"></a><span class="lineno"> 1643</span> <span class="stringliteral">" strat:"</span>, stratification_threshold_.value(),</div>
|
|
<div class="line"><a id="l01644" name="l01644"></a><span class="lineno"> 1644</span> <span class="stringliteral">" depth:"</span>, max_depth);</div>
|
|
<div class="line"><a id="l01645" name="l01645"></a><span class="lineno"> 1645</span> }</div>
|
|
<div class="line"><a id="l01646" name="l01646"></a><span class="lineno"> 1646</span> </div>
|
|
<div class="line"><a id="l01647" name="l01647"></a><span class="lineno"> 1647</span> <span class="comment">// Convert integer_assumptions to Literals.</span></div>
|
|
<div class="line"><a id="l01648" name="l01648"></a><span class="lineno"> 1648</span> std::vector<Literal> assumptions;</div>
|
|
<div class="line"><a id="l01649" name="l01649"></a><span class="lineno"> 1649</span> literal_to_term_index.clear();</div>
|
|
<div class="line"><a id="l01650" name="l01650"></a><span class="lineno"> 1650</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < integer_assumptions.size(); ++i) {</div>
|
|
<div class="line"><a id="l01651" name="l01651"></a><span class="lineno"> 1651</span> assumptions.push_back(integer_encoder_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_encoder.html#afcd4038298bec97a2f7a61274c6ef8c7">GetOrCreateAssociatedLiteral</a>(</div>
|
|
<div class="line"><a id="l01652" name="l01652"></a><span class="lineno"> 1652</span> integer_assumptions[i]));</div>
|
|
<div class="line"><a id="l01653" name="l01653"></a><span class="lineno"> 1653</span> </div>
|
|
<div class="line"><a id="l01654" name="l01654"></a><span class="lineno"> 1654</span> <span class="comment">// Tricky: In some rare case, it is possible that the same literal</span></div>
|
|
<div class="line"><a id="l01655" name="l01655"></a><span class="lineno"> 1655</span> <span class="comment">// correspond to more that one assumptions. In this case, we can just</span></div>
|
|
<div class="line"><a id="l01656" name="l01656"></a><span class="lineno"> 1656</span> <span class="comment">// pick one of them when converting back a core to term indices.</span></div>
|
|
<div class="line"><a id="l01657" name="l01657"></a><span class="lineno"> 1657</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l01658" name="l01658"></a><span class="lineno"> 1658</span> <span class="comment">// TODO(user): We can probably be smarter about the cost of the</span></div>
|
|
<div class="line"><a id="l01659" name="l01659"></a><span class="lineno"> 1659</span> <span class="comment">// assumptions though.</span></div>
|
|
<div class="line"><a id="l01660" name="l01660"></a><span class="lineno"> 1660</span> literal_to_term_index[assumptions.back().Index()] = term_indices[i];</div>
|
|
<div class="line"><a id="l01661" name="l01661"></a><span class="lineno"> 1661</span> }</div>
|
|
<div class="line"><a id="l01662" name="l01662"></a><span class="lineno"> 1662</span> </div>
|
|
<div class="line"><a id="l01663" name="l01663"></a><span class="lineno"> 1663</span> <span class="comment">// Solve under the assumptions.</span></div>
|
|
<div class="line"><a id="l01664" name="l01664"></a><span class="lineno"> 1664</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l01665" name="l01665"></a><span class="lineno"> 1665</span> <span class="comment">// TODO(user): If the "search" is interrupted while computing cores, we</span></div>
|
|
<div class="line"><a id="l01666" name="l01666"></a><span class="lineno"> 1666</span> <span class="comment">// currently do not resume it flawlessly. We however add any cores we found</span></div>
|
|
<div class="line"><a id="l01667" name="l01667"></a><span class="lineno"> 1667</span> <span class="comment">// before aborting.</span></div>
|
|
<div class="line"><a id="l01668" name="l01668"></a><span class="lineno"> 1668</span> std::vector<std::vector<Literal>> cores;</div>
|
|
<div class="line"><a id="l01669" name="l01669"></a><span class="lineno"> 1669</span> <span class="keyword">const</span> <a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> result =</div>
|
|
<div class="line"><a id="l01670" name="l01670"></a><span class="lineno"> 1670</span> FindCores(assumptions, assumption_weights, stratification_threshold_,</div>
|
|
<div class="line"><a id="l01671" name="l01671"></a><span class="lineno"> 1671</span> model_, &cores);</div>
|
|
<div class="line"><a id="l01672" name="l01672"></a><span class="lineno"> 1672</span> <span class="keywordflow">if</span> (result == <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l01673" name="l01673"></a><span class="lineno"> 1673</span> <span class="keywordflow">if</span> (result == <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>) {</div>
|
|
<div class="line"><a id="l01674" name="l01674"></a><span class="lineno"> 1674</span> <span class="keywordflow">if</span> (!ProcessSolution()) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l01675" name="l01675"></a><span class="lineno"> 1675</span> <span class="keywordflow">if</span> (stop_) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>;</div>
|
|
<div class="line"><a id="l01676" name="l01676"></a><span class="lineno"> 1676</span> <span class="keywordflow">if</span> (cores.empty()) {</div>
|
|
<div class="line"><a id="l01677" name="l01677"></a><span class="lineno"> 1677</span> ComputeNextStratificationThreshold();</div>
|
|
<div class="line"><a id="l01678" name="l01678"></a><span class="lineno"> 1678</span> <span class="keywordflow">if</span> (stratification_threshold_ == 0) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l01679" name="l01679"></a><span class="lineno"> 1679</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01680" name="l01680"></a><span class="lineno"> 1680</span> }</div>
|
|
<div class="line"><a id="l01681" name="l01681"></a><span class="lineno"> 1681</span> }</div>
|
|
<div class="line"><a id="l01682" name="l01682"></a><span class="lineno"> 1682</span> </div>
|
|
<div class="line"><a id="l01683" name="l01683"></a><span class="lineno"> 1683</span> <span class="comment">// Process the cores by creating new variables and transferring the minimum</span></div>
|
|
<div class="line"><a id="l01684" name="l01684"></a><span class="lineno"> 1684</span> <span class="comment">// weight of each core to it.</span></div>
|
|
<div class="line"><a id="l01685" name="l01685"></a><span class="lineno"> 1685</span> <span class="keywordflow">if</span> (!sat_solver_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029">ResetToLevelZero</a>()) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l01686" name="l01686"></a><span class="lineno"> 1686</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> std::vector<Literal>& core : cores) {</div>
|
|
<div class="line"><a id="l01687" name="l01687"></a><span class="lineno"> 1687</span> <span class="comment">// This just increase the lower-bound of the corresponding node, which</span></div>
|
|
<div class="line"><a id="l01688" name="l01688"></a><span class="lineno"> 1688</span> <span class="comment">// should already be done by the solver.</span></div>
|
|
<div class="line"><a id="l01689" name="l01689"></a><span class="lineno"> 1689</span> <span class="keywordflow">if</span> (core.size() == 1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01690" name="l01690"></a><span class="lineno"> 1690</span> </div>
|
|
<div class="line"><a id="l01691" name="l01691"></a><span class="lineno"> 1691</span> <span class="comment">// Compute the min weight of all the terms in the core. The lower bound</span></div>
|
|
<div class="line"><a id="l01692" name="l01692"></a><span class="lineno"> 1692</span> <span class="comment">// will be increased by that much because at least one assumption in the</span></div>
|
|
<div class="line"><a id="l01693" name="l01693"></a><span class="lineno"> 1693</span> <span class="comment">// core must be true. This is also why we can start at 1 for new_var_lb.</span></div>
|
|
<div class="line"><a id="l01694" name="l01694"></a><span class="lineno"> 1694</span> <span class="keywordtype">bool</span> ignore_this_core = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01695" name="l01695"></a><span class="lineno"> 1695</span> IntegerValue min_weight = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div>
|
|
<div class="line"><a id="l01696" name="l01696"></a><span class="lineno"> 1696</span> IntegerValue max_weight(0);</div>
|
|
<div class="line"><a id="l01697" name="l01697"></a><span class="lineno"> 1697</span> IntegerValue new_var_lb(1);</div>
|
|
<div class="line"><a id="l01698" name="l01698"></a><span class="lineno"> 1698</span> IntegerValue new_var_ub(0);</div>
|
|
<div class="line"><a id="l01699" name="l01699"></a><span class="lineno"> 1699</span> <span class="keywordtype">int</span> new_depth = 0;</div>
|
|
<div class="line"><a id="l01700" name="l01700"></a><span class="lineno"> 1700</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> lit : core) {</div>
|
|
<div class="line"><a id="l01701" name="l01701"></a><span class="lineno"> 1701</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = <a class="code hl_function" href="namespacegtl.html#a73f41ac11336b94768fdd41594153d59">gtl::FindOrDie</a>(literal_to_term_index, lit.Index());</div>
|
|
<div class="line"><a id="l01702" name="l01702"></a><span class="lineno"> 1702</span> </div>
|
|
<div class="line"><a id="l01703" name="l01703"></a><span class="lineno"> 1703</span> <span class="comment">// When this happen, the core is now trivially "minimized" by the new</span></div>
|
|
<div class="line"><a id="l01704" name="l01704"></a><span class="lineno"> 1704</span> <span class="comment">// bound on this variable, so there is no point in adding it.</span></div>
|
|
<div class="line"><a id="l01705" name="l01705"></a><span class="lineno"> 1705</span> <span class="keywordflow">if</span> (terms_[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].old_var_lb <</div>
|
|
<div class="line"><a id="l01706" name="l01706"></a><span class="lineno"> 1706</span> integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(terms_[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].var)) {</div>
|
|
<div class="line"><a id="l01707" name="l01707"></a><span class="lineno"> 1707</span> ignore_this_core = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01708" name="l01708"></a><span class="lineno"> 1708</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01709" name="l01709"></a><span class="lineno"> 1709</span> }</div>
|
|
<div class="line"><a id="l01710" name="l01710"></a><span class="lineno"> 1710</span> </div>
|
|
<div class="line"><a id="l01711" name="l01711"></a><span class="lineno"> 1711</span> <span class="keyword">const</span> IntegerValue <a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a> = terms_[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].weight;</div>
|
|
<div class="line"><a id="l01712" name="l01712"></a><span class="lineno"> 1712</span> min_weight = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_weight, <a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a>);</div>
|
|
<div class="line"><a id="l01713" name="l01713"></a><span class="lineno"> 1713</span> max_weight = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_weight, <a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a>);</div>
|
|
<div class="line"><a id="l01714" name="l01714"></a><span class="lineno"> 1714</span> new_depth = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(new_depth, terms_[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].depth + 1);</div>
|
|
<div class="line"><a id="l01715" name="l01715"></a><span class="lineno"> 1715</span> new_var_lb += integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(terms_[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a id="l01716" name="l01716"></a><span class="lineno"> 1716</span> new_var_ub += integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(terms_[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a id="l01717" name="l01717"></a><span class="lineno"> 1717</span> }</div>
|
|
<div class="line"><a id="l01718" name="l01718"></a><span class="lineno"> 1718</span> <span class="keywordflow">if</span> (ignore_this_core) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01719" name="l01719"></a><span class="lineno"> 1719</span> </div>
|
|
<div class="line"><a id="l01720" name="l01720"></a><span class="lineno"> 1720</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << absl::StrFormat(</div>
|
|
<div class="line"><a id="l01721" name="l01721"></a><span class="lineno"> 1721</span> <span class="stringliteral">"core:%u weight:[%d,%d] domain:[%d,%d] depth:%d"</span>, core.size(),</div>
|
|
<div class="line"><a id="l01722" name="l01722"></a><span class="lineno"> 1722</span> min_weight.value(), max_weight.value(), new_var_lb.value(),</div>
|
|
<div class="line"><a id="l01723" name="l01723"></a><span class="lineno"> 1723</span> new_var_ub.value(), new_depth);</div>
|
|
<div class="line"><a id="l01724" name="l01724"></a><span class="lineno"> 1724</span> </div>
|
|
<div class="line"><a id="l01725" name="l01725"></a><span class="lineno"> 1725</span> <span class="comment">// We will "transfer" min_weight from all the variables of the core</span></div>
|
|
<div class="line"><a id="l01726" name="l01726"></a><span class="lineno"> 1726</span> <span class="comment">// to a new variable.</span></div>
|
|
<div class="line"><a id="l01727" name="l01727"></a><span class="lineno"> 1727</span> <span class="keyword">const</span> IntegerVariable new_var =</div>
|
|
<div class="line"><a id="l01728" name="l01728"></a><span class="lineno"> 1728</span> integer_trail_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa2d7b702e17a5cd4108b465385dd9acd">AddIntegerVariable</a>(new_var_lb, new_var_ub);</div>
|
|
<div class="line"><a id="l01729" name="l01729"></a><span class="lineno"> 1729</span> terms_.push_back({new_var, min_weight, new_depth});</div>
|
|
<div class="line"><a id="l01730" name="l01730"></a><span class="lineno"> 1730</span> terms_.back().cover_ub = new_var_ub;</div>
|
|
<div class="line"><a id="l01731" name="l01731"></a><span class="lineno"> 1731</span> </div>
|
|
<div class="line"><a id="l01732" name="l01732"></a><span class="lineno"> 1732</span> <span class="comment">// Sum variables in the core <= new_var.</span></div>
|
|
<div class="line"><a id="l01733" name="l01733"></a><span class="lineno"> 1733</span> {</div>
|
|
<div class="line"><a id="l01734" name="l01734"></a><span class="lineno"> 1734</span> std::vector<IntegerVariable> constraint_vars;</div>
|
|
<div class="line"><a id="l01735" name="l01735"></a><span class="lineno"> 1735</span> std::vector<int64_t> constraint_coeffs;</div>
|
|
<div class="line"><a id="l01736" name="l01736"></a><span class="lineno"> 1736</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> lit : core) {</div>
|
|
<div class="line"><a id="l01737" name="l01737"></a><span class="lineno"> 1737</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = <a class="code hl_function" href="namespacegtl.html#a73f41ac11336b94768fdd41594153d59">gtl::FindOrDie</a>(literal_to_term_index, lit.Index());</div>
|
|
<div class="line"><a id="l01738" name="l01738"></a><span class="lineno"> 1738</span> terms_[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].weight -= min_weight;</div>
|
|
<div class="line"><a id="l01739" name="l01739"></a><span class="lineno"> 1739</span> constraint_vars.push_back(terms_[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a id="l01740" name="l01740"></a><span class="lineno"> 1740</span> constraint_coeffs.push_back(1);</div>
|
|
<div class="line"><a id="l01741" name="l01741"></a><span class="lineno"> 1741</span> }</div>
|
|
<div class="line"><a id="l01742" name="l01742"></a><span class="lineno"> 1742</span> constraint_vars.push_back(new_var);</div>
|
|
<div class="line"><a id="l01743" name="l01743"></a><span class="lineno"> 1743</span> constraint_coeffs.push_back(-1);</div>
|
|
<div class="line"><a id="l01744" name="l01744"></a><span class="lineno"> 1744</span> model_-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_model.html#a7b8d774b566431b8932ba0f3c921ec7d">Add</a>(</div>
|
|
<div class="line"><a id="l01745" name="l01745"></a><span class="lineno"> 1745</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a2d7fdf5a1e3a1a9f3c4b893227f2f523">WeightedSumLowerOrEqual</a>(constraint_vars, constraint_coeffs, 0));</div>
|
|
<div class="line"><a id="l01746" name="l01746"></a><span class="lineno"> 1746</span> }</div>
|
|
<div class="line"><a id="l01747" name="l01747"></a><span class="lineno"> 1747</span> }</div>
|
|
<div class="line"><a id="l01748" name="l01748"></a><span class="lineno"> 1748</span> </div>
|
|
<div class="line"><a id="l01749" name="l01749"></a><span class="lineno"> 1749</span> <span class="comment">// Abort if we reached the time limit. Note that we still add any cores we</span></div>
|
|
<div class="line"><a id="l01750" name="l01750"></a><span class="lineno"> 1750</span> <span class="comment">// found in case the solve is splitted in "chunk".</span></div>
|
|
<div class="line"><a id="l01751" name="l01751"></a><span class="lineno"> 1751</span> <span class="keywordflow">if</span> (result == <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>) <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l01752" name="l01752"></a><span class="lineno"> 1752</span> }</div>
|
|
<div class="line"><a id="l01753" name="l01753"></a><span class="lineno"> 1753</span>}</div>
|
|
<div class="line"><a id="l01754" name="l01754"></a><span class="lineno"> 1754</span> </div>
|
|
<div class="line"><a id="l01755" name="l01755"></a><span class="lineno"> 1755</span><span class="comment">// TODO(user): take the MPModelRequest or MPModelProto directly, so that we can</span></div>
|
|
<div class="line"><a id="l01756" name="l01756"></a><span class="lineno"> 1756</span><span class="comment">// have initial constraints!</span></div>
|
|
<div class="line"><a id="l01757" name="l01757"></a><span class="lineno"> 1757</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l01758" name="l01758"></a><span class="lineno"> 1758</span><span class="comment">// TODO(user): remove code duplication with MinimizeWithCoreAndLazyEncoding();</span></div>
|
|
<div class="line"><a id="l01759" name="l01759"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a7d1c65f24756bb9dad18da1f5e82bb9c"> 1759</a></span><a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a7d1c65f24756bb9dad18da1f5e82bb9c">MinimizeWithHittingSetAndLazyEncoding</a>(</div>
|
|
<div class="line"><a id="l01760" name="l01760"></a><span class="lineno"> 1760</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_objective_definition.html">ObjectiveDefinition</a>& objective_definition,</div>
|
|
<div class="line"><a id="l01761" name="l01761"></a><span class="lineno"> 1761</span> <span class="keyword">const</span> std::function<<span class="keywordtype">void</span>()>& feasible_solution_observer, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a id="l01762" name="l01762"></a><span class="lineno"> 1762</span><span class="preprocessor">#if !defined(__PORTABLE_PLATFORM__) && defined(USE_SCIP)</span></div>
|
|
<div class="line"><a id="l01763" name="l01763"></a><span class="lineno"> 1763</span> </div>
|
|
<div class="line"><a id="l01764" name="l01764"></a><span class="lineno"> 1764</span> IntegerVariable objective_var = objective_definition.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_objective_definition.html#aa3c0b31567c91babfffd5f9afc3161dc">objective_var</a>;</div>
|
|
<div class="line"><a id="l01765" name="l01765"></a><span class="lineno"> 1765</span> std::vector<IntegerVariable> variables = objective_definition.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_objective_definition.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>;</div>
|
|
<div class="line"><a id="l01766" name="l01766"></a><span class="lineno"> 1766</span> std::vector<IntegerValue> <a class="code hl_variable" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a> = objective_definition.<a class="code hl_variable" href="structoperations__research_1_1sat_1_1_objective_definition.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>;</div>
|
|
<div class="line"><a id="l01767" name="l01767"></a><span class="lineno"> 1767</span> </div>
|
|
<div class="line"><a id="l01768" name="l01768"></a><span class="lineno"> 1768</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* sat_solver = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>();</div>
|
|
<div class="line"><a id="l01769" name="l01769"></a><span class="lineno"> 1769</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div>
|
|
<div class="line"><a id="l01770" name="l01770"></a><span class="lineno"> 1770</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>* integer_encoder = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>();</div>
|
|
<div class="line"><a id="l01771" name="l01771"></a><span class="lineno"> 1771</span> </div>
|
|
<div class="line"><a id="l01772" name="l01772"></a><span class="lineno"> 1772</span> <span class="comment">// This will be called each time a feasible solution is found.</span></div>
|
|
<div class="line"><a id="l01773" name="l01773"></a><span class="lineno"> 1773</span> <span class="keyword">const</span> <span class="keyword">auto</span> process_solution = [&]() {</div>
|
|
<div class="line"><a id="l01774" name="l01774"></a><span class="lineno"> 1774</span> <span class="comment">// We don't assume that objective_var is linked with its linear term, so</span></div>
|
|
<div class="line"><a id="l01775" name="l01775"></a><span class="lineno"> 1775</span> <span class="comment">// we recompute the objective here.</span></div>
|
|
<div class="line"><a id="l01776" name="l01776"></a><span class="lineno"> 1776</span> IntegerValue objective(0);</div>
|
|
<div class="line"><a id="l01777" name="l01777"></a><span class="lineno"> 1777</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < variables.size(); ++i) {</div>
|
|
<div class="line"><a id="l01778" name="l01778"></a><span class="lineno"> 1778</span> objective +=</div>
|
|
<div class="line"><a id="l01779" name="l01779"></a><span class="lineno"> 1779</span> <a class="code hl_variable" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i] * IntegerValue(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">Value</a>(variables[i])));</div>
|
|
<div class="line"><a id="l01780" name="l01780"></a><span class="lineno"> 1780</span> }</div>
|
|
<div class="line"><a id="l01781" name="l01781"></a><span class="lineno"> 1781</span> <span class="keywordflow">if</span> (objective > integer_trail->UpperBound(objective_var)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01782" name="l01782"></a><span class="lineno"> 1782</span> </div>
|
|
<div class="line"><a id="l01783" name="l01783"></a><span class="lineno"> 1783</span> <span class="keywordflow">if</span> (feasible_solution_observer != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l01784" name="l01784"></a><span class="lineno"> 1784</span> feasible_solution_observer();</div>
|
|
<div class="line"><a id="l01785" name="l01785"></a><span class="lineno"> 1785</span> }</div>
|
|
<div class="line"><a id="l01786" name="l01786"></a><span class="lineno"> 1786</span> </div>
|
|
<div class="line"><a id="l01787" name="l01787"></a><span class="lineno"> 1787</span> <span class="comment">// Constrain objective_var. This has a better result when objective_var is</span></div>
|
|
<div class="line"><a id="l01788" name="l01788"></a><span class="lineno"> 1788</span> <span class="comment">// used in an LP relaxation for instance.</span></div>
|
|
<div class="line"><a id="l01789" name="l01789"></a><span class="lineno"> 1789</span> sat_solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a id="l01790" name="l01790"></a><span class="lineno"> 1790</span> sat_solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440">SetAssumptionLevel</a>(0);</div>
|
|
<div class="line"><a id="l01791" name="l01791"></a><span class="lineno"> 1791</span> <span class="keywordflow">if</span> (!integer_trail->Enqueue(</div>
|
|
<div class="line"><a id="l01792" name="l01792"></a><span class="lineno"> 1792</span> <a class="code hl_function" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(objective_var, objective - 1), {},</div>
|
|
<div class="line"><a id="l01793" name="l01793"></a><span class="lineno"> 1793</span> {})) {</div>
|
|
<div class="line"><a id="l01794" name="l01794"></a><span class="lineno"> 1794</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01795" name="l01795"></a><span class="lineno"> 1795</span> }</div>
|
|
<div class="line"><a id="l01796" name="l01796"></a><span class="lineno"> 1796</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01797" name="l01797"></a><span class="lineno"> 1797</span> };</div>
|
|
<div class="line"><a id="l01798" name="l01798"></a><span class="lineno"> 1798</span> </div>
|
|
<div class="line"><a id="l01799" name="l01799"></a><span class="lineno"> 1799</span> <span class="comment">// This is the "generalized" hitting set problem we will solve. Each time</span></div>
|
|
<div class="line"><a id="l01800" name="l01800"></a><span class="lineno"> 1800</span> <span class="comment">// we find a core, a new constraint will be added to this problem.</span></div>
|
|
<div class="line"><a id="l01801" name="l01801"></a><span class="lineno"> 1801</span> <a class="code hl_class" href="classoperations__research_1_1_m_p_model_request.html">MPModelRequest</a> request;</div>
|
|
<div class="line"><a id="l01802" name="l01802"></a><span class="lineno"> 1802</span> request.<a class="code hl_function" href="classoperations__research_1_1_m_p_model_request.html#a7e6d0619ceb2fc4dad0819a723d8c075">set_solver_specific_parameters</a>(<span class="stringliteral">"limits/gap = 0"</span>);</div>
|
|
<div class="line"><a id="l01803" name="l01803"></a><span class="lineno"> 1803</span> request.<a class="code hl_function" href="classoperations__research_1_1_m_p_model_request.html#a65cb3cf3fc5b133269d86bc638ffa106">set_solver_type</a>(<a class="code hl_variable" href="classoperations__research_1_1_m_p_model_request.html#a6f6bbefc174344cdacd3d27afc9336d6">MPModelRequest::SCIP_MIXED_INTEGER_PROGRAMMING</a>);</div>
|
|
<div class="line"><a id="l01804" name="l01804"></a><span class="lineno"> 1804</span> </div>
|
|
<div class="line"><a id="l01805" name="l01805"></a><span class="lineno"> 1805</span> <a class="code hl_class" href="classoperations__research_1_1_m_p_model_proto.html">MPModelProto</a>& hs_model = *request.<a class="code hl_function" href="classoperations__research_1_1_m_p_model_request.html#a367238eef2713ff41df6866652a30d59">mutable_model</a>();</div>
|
|
<div class="line"><a id="l01806" name="l01806"></a><span class="lineno"> 1806</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_variables_in_objective = variables.size();</div>
|
|
<div class="line"><a id="l01807" name="l01807"></a><span class="lineno"> 1807</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_variables_in_objective; ++i) {</div>
|
|
<div class="line"><a id="l01808" name="l01808"></a><span class="lineno"> 1808</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i] < 0) {</div>
|
|
<div class="line"><a id="l01809" name="l01809"></a><span class="lineno"> 1809</span> variables[i] = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(variables[i]);</div>
|
|
<div class="line"><a id="l01810" name="l01810"></a><span class="lineno"> 1810</span> <a class="code hl_variable" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i] = -<a class="code hl_variable" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i];</div>
|
|
<div class="line"><a id="l01811" name="l01811"></a><span class="lineno"> 1811</span> }</div>
|
|
<div class="line"><a id="l01812" name="l01812"></a><span class="lineno"> 1812</span> <span class="keyword">const</span> IntegerVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = variables[i];</div>
|
|
<div class="line"><a id="l01813" name="l01813"></a><span class="lineno"> 1813</span> <a class="code hl_class" href="classoperations__research_1_1_m_p_variable_proto.html">MPVariableProto</a>* var_proto = hs_model.<a class="code hl_function" href="classoperations__research_1_1_m_p_model_proto.html#a4c6815e5419d4e4f94565b345eb38b9f">add_variable</a>();</div>
|
|
<div class="line"><a id="l01814" name="l01814"></a><span class="lineno"> 1814</span> var_proto-><a class="code hl_function" href="classoperations__research_1_1_m_p_variable_proto.html#a77bf5d8610054e5bd74cf0048bce5f25">set_lower_bound</a>(integer_trail->LowerBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).value());</div>
|
|
<div class="line"><a id="l01815" name="l01815"></a><span class="lineno"> 1815</span> var_proto-><a class="code hl_function" href="classoperations__research_1_1_m_p_variable_proto.html#ac91622e1f864308bd349b37d5b1a9528">set_upper_bound</a>(integer_trail->UpperBound(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).value());</div>
|
|
<div class="line"><a id="l01816" name="l01816"></a><span class="lineno"> 1816</span> var_proto-><a class="code hl_function" href="classoperations__research_1_1_m_p_variable_proto.html#a4b8844c0490b3c525060762f8bc11a8c">set_objective_coefficient</a>(<a class="code hl_variable" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i].<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>());</div>
|
|
<div class="line"><a id="l01817" name="l01817"></a><span class="lineno"> 1817</span> var_proto-><a class="code hl_function" href="classoperations__research_1_1_m_p_variable_proto.html#a03ba55fe410af563250a79463d9eb7c6">set_is_integer</a>(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l01818" name="l01818"></a><span class="lineno"> 1818</span> }</div>
|
|
<div class="line"><a id="l01819" name="l01819"></a><span class="lineno"> 1819</span> </div>
|
|
<div class="line"><a id="l01820" name="l01820"></a><span class="lineno"> 1820</span> <a class="code hl_class" href="classoperations__research_1_1_m_p_solution_response.html">MPSolutionResponse</a> <a class="code hl_variable" href="cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829">response</a>;</div>
|
|
<div class="line"><a id="l01821" name="l01821"></a><span class="lineno"> 1821</span> </div>
|
|
<div class="line"><a id="l01822" name="l01822"></a><span class="lineno"> 1822</span> <span class="comment">// This is used by the "stratified" approach. We will only consider terms with</span></div>
|
|
<div class="line"><a id="l01823" name="l01823"></a><span class="lineno"> 1823</span> <span class="comment">// a weight not lower than this threshold. The threshold will decrease as the</span></div>
|
|
<div class="line"><a id="l01824" name="l01824"></a><span class="lineno"> 1824</span> <span class="comment">// algorithm progress.</span></div>
|
|
<div class="line"><a id="l01825" name="l01825"></a><span class="lineno"> 1825</span> IntegerValue stratified_threshold = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div>
|
|
<div class="line"><a id="l01826" name="l01826"></a><span class="lineno"> 1826</span> </div>
|
|
<div class="line"><a id="l01827" name="l01827"></a><span class="lineno"> 1827</span> <span class="comment">// TODO(user): The core is returned in the same order as the assumptions,</span></div>
|
|
<div class="line"><a id="l01828" name="l01828"></a><span class="lineno"> 1828</span> <span class="comment">// so we don't really need this map, we could just do a linear scan to</span></div>
|
|
<div class="line"><a id="l01829" name="l01829"></a><span class="lineno"> 1829</span> <span class="comment">// recover which node are part of the core.</span></div>
|
|
<div class="line"><a id="l01830" name="l01830"></a><span class="lineno"> 1830</span> std::map<LiteralIndex, std::vector<int>> assumption_to_indices;</div>
|
|
<div class="line"><a id="l01831" name="l01831"></a><span class="lineno"> 1831</span> </div>
|
|
<div class="line"><a id="l01832" name="l01832"></a><span class="lineno"> 1832</span> <span class="comment">// New Booleans variable in the MIP model to represent X >= cte.</span></div>
|
|
<div class="line"><a id="l01833" name="l01833"></a><span class="lineno"> 1833</span> std::map<std::pair<int, double>, <span class="keywordtype">int</span>> created_var;</div>
|
|
<div class="line"><a id="l01834" name="l01834"></a><span class="lineno"> 1834</span> </div>
|
|
<div class="line"><a id="l01835" name="l01835"></a><span class="lineno"> 1835</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>& <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a> = *(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>());</div>
|
|
<div class="line"><a id="l01836" name="l01836"></a><span class="lineno"> 1836</span> </div>
|
|
<div class="line"><a id="l01837" name="l01837"></a><span class="lineno"> 1837</span> <span class="comment">// Start the algorithm.</span></div>
|
|
<div class="line"><a id="l01838" name="l01838"></a><span class="lineno"> 1838</span> <a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> result;</div>
|
|
<div class="line"><a id="l01839" name="l01839"></a><span class="lineno"> 1839</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> iter = 0;; ++iter) {</div>
|
|
<div class="line"><a id="l01840" name="l01840"></a><span class="lineno"> 1840</span> <span class="comment">// TODO(user): Even though we keep the same solver, currently the solve is</span></div>
|
|
<div class="line"><a id="l01841" name="l01841"></a><span class="lineno"> 1841</span> <span class="comment">// not really done incrementally. It might be hard to improve though.</span></div>
|
|
<div class="line"><a id="l01842" name="l01842"></a><span class="lineno"> 1842</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l01843" name="l01843"></a><span class="lineno"> 1843</span> <span class="comment">// TODO(user): deal with time limit.</span></div>
|
|
<div class="line"><a id="l01844" name="l01844"></a><span class="lineno"> 1844</span> <a class="code hl_function" href="classoperations__research_1_1_m_p_solver.html#aad8e8f47697c2149ae4ee449bcc3142c">MPSolver::SolveWithProto</a>(request, &<a class="code hl_variable" href="cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829">response</a>);</div>
|
|
<div class="line"><a id="l01845" name="l01845"></a><span class="lineno"> 1845</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code hl_variable" href="cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829">response</a>.status(), <a class="code hl_enumvalue" href="namespaceoperations__research.html#aeaeaf340789f2dd271dcf9204279cb1ba9cff14a44a54cc44f4b91d65e8cd73b1">MPSolverResponseStatus::MPSOLVER_OPTIMAL</a>);</div>
|
|
<div class="line"><a id="l01846" name="l01846"></a><span class="lineno"> 1846</span> </div>
|
|
<div class="line"><a id="l01847" name="l01847"></a><span class="lineno"> 1847</span> <span class="keyword">const</span> IntegerValue mip_objective(</div>
|
|
<div class="line"><a id="l01848" name="l01848"></a><span class="lineno"> 1848</span> <span class="keyword">static_cast<</span>int64_t<span class="keyword">></span>(std::round(<a class="code hl_variable" href="cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829">response</a>.objective_value())));</div>
|
|
<div class="line"><a id="l01849" name="l01849"></a><span class="lineno"> 1849</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"constraints: "</span> << hs_model.<a class="code hl_function" href="classoperations__research_1_1_m_p_model_proto.html#ae3687769a11bd922a263d0135f84a064">constraint_size</a>()</div>
|
|
<div class="line"><a id="l01850" name="l01850"></a><span class="lineno"> 1850</span> << <span class="stringliteral">" variables: "</span> << hs_model.<a class="code hl_function" href="classoperations__research_1_1_m_p_model_proto.html#a233b16fc13c9664e5b818158019af13d">variable_size</a>() << <span class="stringliteral">" hs_lower_bound: "</span></div>
|
|
<div class="line"><a id="l01851" name="l01851"></a><span class="lineno"> 1851</span> << objective_definition.<a class="code hl_function" href="structoperations__research_1_1sat_1_1_objective_definition.html#adb0775f26a8a26bbd760d700d66c5281">ScaleIntegerObjective</a>(mip_objective)</div>
|
|
<div class="line"><a id="l01852" name="l01852"></a><span class="lineno"> 1852</span> << <span class="stringliteral">" strat: "</span> << stratified_threshold;</div>
|
|
<div class="line"><a id="l01853" name="l01853"></a><span class="lineno"> 1853</span> </div>
|
|
<div class="line"><a id="l01854" name="l01854"></a><span class="lineno"> 1854</span> <span class="comment">// Update the objective lower bound with our current bound.</span></div>
|
|
<div class="line"><a id="l01855" name="l01855"></a><span class="lineno"> 1855</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l01856" name="l01856"></a><span class="lineno"> 1856</span> <span class="comment">// Note(user): This is not needed for correctness, but it might cause</span></div>
|
|
<div class="line"><a id="l01857" name="l01857"></a><span class="lineno"> 1857</span> <span class="comment">// more propagation and is nice to have for reporting/logging purpose.</span></div>
|
|
<div class="line"><a id="l01858" name="l01858"></a><span class="lineno"> 1858</span> <span class="keywordflow">if</span> (!integer_trail->Enqueue(</div>
|
|
<div class="line"><a id="l01859" name="l01859"></a><span class="lineno"> 1859</span> <a class="code hl_function" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(objective_var, mip_objective), {},</div>
|
|
<div class="line"><a id="l01860" name="l01860"></a><span class="lineno"> 1860</span> {})) {</div>
|
|
<div class="line"><a id="l01861" name="l01861"></a><span class="lineno"> 1861</span> result = <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l01862" name="l01862"></a><span class="lineno"> 1862</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01863" name="l01863"></a><span class="lineno"> 1863</span> }</div>
|
|
<div class="line"><a id="l01864" name="l01864"></a><span class="lineno"> 1864</span> </div>
|
|
<div class="line"><a id="l01865" name="l01865"></a><span class="lineno"> 1865</span> sat_solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a id="l01866" name="l01866"></a><span class="lineno"> 1866</span> sat_solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440">SetAssumptionLevel</a>(0);</div>
|
|
<div class="line"><a id="l01867" name="l01867"></a><span class="lineno"> 1867</span> std::vector<Literal> assumptions;</div>
|
|
<div class="line"><a id="l01868" name="l01868"></a><span class="lineno"> 1868</span> assumption_to_indices.clear();</div>
|
|
<div class="line"><a id="l01869" name="l01869"></a><span class="lineno"> 1869</span> IntegerValue next_stratified_threshold(0);</div>
|
|
<div class="line"><a id="l01870" name="l01870"></a><span class="lineno"> 1870</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_variables_in_objective; ++i) {</div>
|
|
<div class="line"><a id="l01871" name="l01871"></a><span class="lineno"> 1871</span> <span class="keyword">const</span> IntegerValue hs_value(</div>
|
|
<div class="line"><a id="l01872" name="l01872"></a><span class="lineno"> 1872</span> <span class="keyword">static_cast<</span>int64_t<span class="keyword">></span>(<a class="code hl_variable" href="cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829">response</a>.variable_value(i)));</div>
|
|
<div class="line"><a id="l01873" name="l01873"></a><span class="lineno"> 1873</span> <span class="keywordflow">if</span> (hs_value == integer_trail->UpperBound(variables[i])) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01874" name="l01874"></a><span class="lineno"> 1874</span> </div>
|
|
<div class="line"><a id="l01875" name="l01875"></a><span class="lineno"> 1875</span> <span class="comment">// Only consider the terms above the threshold.</span></div>
|
|
<div class="line"><a id="l01876" name="l01876"></a><span class="lineno"> 1876</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i] < stratified_threshold) {</div>
|
|
<div class="line"><a id="l01877" name="l01877"></a><span class="lineno"> 1877</span> next_stratified_threshold =</div>
|
|
<div class="line"><a id="l01878" name="l01878"></a><span class="lineno"> 1878</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(next_stratified_threshold, <a class="code hl_variable" href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a>[i]);</div>
|
|
<div class="line"><a id="l01879" name="l01879"></a><span class="lineno"> 1879</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01880" name="l01880"></a><span class="lineno"> 1880</span> <span class="comment">// It is possible that different variables have the same associated</span></div>
|
|
<div class="line"><a id="l01881" name="l01881"></a><span class="lineno"> 1881</span> <span class="comment">// literal. So we do need to consider this case.</span></div>
|
|
<div class="line"><a id="l01882" name="l01882"></a><span class="lineno"> 1882</span> assumptions.push_back(integer_encoder->GetOrCreateAssociatedLiteral(</div>
|
|
<div class="line"><a id="l01883" name="l01883"></a><span class="lineno"> 1883</span> <a class="code hl_function" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(variables[i], hs_value)));</div>
|
|
<div class="line"><a id="l01884" name="l01884"></a><span class="lineno"> 1884</span> assumption_to_indices[assumptions.back().Index()].push_back(i);</div>
|
|
<div class="line"><a id="l01885" name="l01885"></a><span class="lineno"> 1885</span> }</div>
|
|
<div class="line"><a id="l01886" name="l01886"></a><span class="lineno"> 1886</span> }</div>
|
|
<div class="line"><a id="l01887" name="l01887"></a><span class="lineno"> 1887</span> </div>
|
|
<div class="line"><a id="l01888" name="l01888"></a><span class="lineno"> 1888</span> <span class="comment">// No assumptions with the current stratified_threshold? use the new one.</span></div>
|
|
<div class="line"><a id="l01889" name="l01889"></a><span class="lineno"> 1889</span> <span class="keywordflow">if</span> (assumptions.empty() && next_stratified_threshold > 0) {</div>
|
|
<div class="line"><a id="l01890" name="l01890"></a><span class="lineno"> 1890</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(next_stratified_threshold, stratified_threshold);</div>
|
|
<div class="line"><a id="l01891" name="l01891"></a><span class="lineno"> 1891</span> stratified_threshold = next_stratified_threshold;</div>
|
|
<div class="line"><a id="l01892" name="l01892"></a><span class="lineno"> 1892</span> --iter; <span class="comment">// "false" iteration, the lower bound does not increase.</span></div>
|
|
<div class="line"><a id="l01893" name="l01893"></a><span class="lineno"> 1893</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01894" name="l01894"></a><span class="lineno"> 1894</span> }</div>
|
|
<div class="line"><a id="l01895" name="l01895"></a><span class="lineno"> 1895</span> </div>
|
|
<div class="line"><a id="l01896" name="l01896"></a><span class="lineno"> 1896</span> <span class="comment">// TODO(user): we could also randomly shuffle the assumptions to find more</span></div>
|
|
<div class="line"><a id="l01897" name="l01897"></a><span class="lineno"> 1897</span> <span class="comment">// cores for only one MIP solve.</span></div>
|
|
<div class="line"><a id="l01898" name="l01898"></a><span class="lineno"> 1898</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l01899" name="l01899"></a><span class="lineno"> 1899</span> <span class="comment">// TODO(user): Use the real weights and exploit the extra cores.</span></div>
|
|
<div class="line"><a id="l01900" name="l01900"></a><span class="lineno"> 1900</span> std::vector<std::vector<Literal>> cores;</div>
|
|
<div class="line"><a id="l01901" name="l01901"></a><span class="lineno"> 1901</span> result = FindMultipleCoresForMaxHs(assumptions, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, &cores);</div>
|
|
<div class="line"><a id="l01902" name="l01902"></a><span class="lineno"> 1902</span> <span class="keywordflow">if</span> (result == <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>) {</div>
|
|
<div class="line"><a id="l01903" name="l01903"></a><span class="lineno"> 1903</span> <span class="keywordflow">if</span> (!process_solution()) <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l01904" name="l01904"></a><span class="lineno"> 1904</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a32f3ed6806ec24e1818093f9f9c77f1a">stop_after_first_solution</a>()) {</div>
|
|
<div class="line"><a id="l01905" name="l01905"></a><span class="lineno"> 1905</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">SatSolver::LIMIT_REACHED</a>;</div>
|
|
<div class="line"><a id="l01906" name="l01906"></a><span class="lineno"> 1906</span> }</div>
|
|
<div class="line"><a id="l01907" name="l01907"></a><span class="lineno"> 1907</span> <span class="keywordflow">if</span> (cores.empty()) {</div>
|
|
<div class="line"><a id="l01908" name="l01908"></a><span class="lineno"> 1908</span> <span class="comment">// If not all assumptions were taken, continue with a lower stratified</span></div>
|
|
<div class="line"><a id="l01909" name="l01909"></a><span class="lineno"> 1909</span> <span class="comment">// bound. Otherwise we have an optimal solution.</span></div>
|
|
<div class="line"><a id="l01910" name="l01910"></a><span class="lineno"> 1910</span> stratified_threshold = next_stratified_threshold;</div>
|
|
<div class="line"><a id="l01911" name="l01911"></a><span class="lineno"> 1911</span> <span class="keywordflow">if</span> (stratified_threshold == 0) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01912" name="l01912"></a><span class="lineno"> 1912</span> --iter; <span class="comment">// "false" iteration, the lower bound does not increase.</span></div>
|
|
<div class="line"><a id="l01913" name="l01913"></a><span class="lineno"> 1913</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01914" name="l01914"></a><span class="lineno"> 1914</span> }</div>
|
|
<div class="line"><a id="l01915" name="l01915"></a><span class="lineno"> 1915</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (result != <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885">SatSolver::ASSUMPTIONS_UNSAT</a>) {</div>
|
|
<div class="line"><a id="l01916" name="l01916"></a><span class="lineno"> 1916</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01917" name="l01917"></a><span class="lineno"> 1917</span> }</div>
|
|
<div class="line"><a id="l01918" name="l01918"></a><span class="lineno"> 1918</span> </div>
|
|
<div class="line"><a id="l01919" name="l01919"></a><span class="lineno"> 1919</span> sat_solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a id="l01920" name="l01920"></a><span class="lineno"> 1920</span> sat_solver-><a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440">SetAssumptionLevel</a>(0);</div>
|
|
<div class="line"><a id="l01921" name="l01921"></a><span class="lineno"> 1921</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> std::vector<Literal>& core : cores) {</div>
|
|
<div class="line"><a id="l01922" name="l01922"></a><span class="lineno"> 1922</span> <span class="keywordflow">if</span> (core.size() == 1) {</div>
|
|
<div class="line"><a id="l01923" name="l01923"></a><span class="lineno"> 1923</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> :</div>
|
|
<div class="line"><a id="l01924" name="l01924"></a><span class="lineno"> 1924</span> <a class="code hl_function" href="namespacegtl.html#a73f41ac11336b94768fdd41594153d59">gtl::FindOrDie</a>(assumption_to_indices, core.front().Index())) {</div>
|
|
<div class="line"><a id="l01925" name="l01925"></a><span class="lineno"> 1925</span> hs_model.<a class="code hl_function" href="classoperations__research_1_1_m_p_model_proto.html#a6255cadc7041d64f5e850a5e3786b3fd">mutable_variable</a>(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)-><a class="code hl_function" href="classoperations__research_1_1_m_p_variable_proto.html#a77bf5d8610054e5bd74cf0048bce5f25">set_lower_bound</a>(</div>
|
|
<div class="line"><a id="l01926" name="l01926"></a><span class="lineno"> 1926</span> integer_trail->LowerBound(variables[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]).value());</div>
|
|
<div class="line"><a id="l01927" name="l01927"></a><span class="lineno"> 1927</span> }</div>
|
|
<div class="line"><a id="l01928" name="l01928"></a><span class="lineno"> 1928</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01929" name="l01929"></a><span class="lineno"> 1929</span> }</div>
|
|
<div class="line"><a id="l01930" name="l01930"></a><span class="lineno"> 1930</span> </div>
|
|
<div class="line"><a id="l01931" name="l01931"></a><span class="lineno"> 1931</span> <span class="comment">// Add the corresponding constraint to hs_model.</span></div>
|
|
<div class="line"><a id="l01932" name="l01932"></a><span class="lineno"> 1932</span> <a class="code hl_class" href="classoperations__research_1_1_m_p_constraint_proto.html">MPConstraintProto</a>* <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = hs_model.<a class="code hl_function" href="classoperations__research_1_1_m_p_model_proto.html#ad84385236dc87ac3b0adc4c28246d1d5">add_constraint</a>();</div>
|
|
<div class="line"><a id="l01933" name="l01933"></a><span class="lineno"> 1933</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->set_lower_bound(1.0);</div>
|
|
<div class="line"><a id="l01934" name="l01934"></a><span class="lineno"> 1934</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> lit : core) {</div>
|
|
<div class="line"><a id="l01935" name="l01935"></a><span class="lineno"> 1935</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> :</div>
|
|
<div class="line"><a id="l01936" name="l01936"></a><span class="lineno"> 1936</span> <a class="code hl_function" href="namespacegtl.html#a73f41ac11336b94768fdd41594153d59">gtl::FindOrDie</a>(assumption_to_indices, lit.Index())) {</div>
|
|
<div class="line"><a id="l01937" name="l01937"></a><span class="lineno"> 1937</span> <span class="keyword">const</span> <span class="keywordtype">double</span> lb = integer_trail->LowerBound(variables[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]).value();</div>
|
|
<div class="line"><a id="l01938" name="l01938"></a><span class="lineno"> 1938</span> <span class="keyword">const</span> <span class="keywordtype">double</span> hs_value = <a class="code hl_variable" href="cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829">response</a>.variable_value(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a id="l01939" name="l01939"></a><span class="lineno"> 1939</span> <span class="keywordflow">if</span> (hs_value == lb) {</div>
|
|
<div class="line"><a id="l01940" name="l01940"></a><span class="lineno"> 1940</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->add_var_index(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a id="l01941" name="l01941"></a><span class="lineno"> 1941</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->add_coefficient(1.0);</div>
|
|
<div class="line"><a id="l01942" name="l01942"></a><span class="lineno"> 1942</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->set_lower_bound(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->lower_bound() + lb);</div>
|
|
<div class="line"><a id="l01943" name="l01943"></a><span class="lineno"> 1943</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01944" name="l01944"></a><span class="lineno"> 1944</span> <span class="keyword">const</span> std::pair<int, double> key = {<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, hs_value};</div>
|
|
<div class="line"><a id="l01945" name="l01945"></a><span class="lineno"> 1945</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(created_var, key)) {</div>
|
|
<div class="line"><a id="l01946" name="l01946"></a><span class="lineno"> 1946</span> <span class="keyword">const</span> <span class="keywordtype">int</span> new_var_index = hs_model.<a class="code hl_function" href="classoperations__research_1_1_m_p_model_proto.html#a233b16fc13c9664e5b818158019af13d">variable_size</a>();</div>
|
|
<div class="line"><a id="l01947" name="l01947"></a><span class="lineno"> 1947</span> created_var[key] = new_var_index;</div>
|
|
<div class="line"><a id="l01948" name="l01948"></a><span class="lineno"> 1948</span> </div>
|
|
<div class="line"><a id="l01949" name="l01949"></a><span class="lineno"> 1949</span> <a class="code hl_class" href="classoperations__research_1_1_m_p_variable_proto.html">MPVariableProto</a>* new_var = hs_model.<a class="code hl_function" href="classoperations__research_1_1_m_p_model_proto.html#a4c6815e5419d4e4f94565b345eb38b9f">add_variable</a>();</div>
|
|
<div class="line"><a id="l01950" name="l01950"></a><span class="lineno"> 1950</span> new_var-><a class="code hl_function" href="classoperations__research_1_1_m_p_variable_proto.html#a77bf5d8610054e5bd74cf0048bce5f25">set_lower_bound</a>(0);</div>
|
|
<div class="line"><a id="l01951" name="l01951"></a><span class="lineno"> 1951</span> new_var-><a class="code hl_function" href="classoperations__research_1_1_m_p_variable_proto.html#ac91622e1f864308bd349b37d5b1a9528">set_upper_bound</a>(1);</div>
|
|
<div class="line"><a id="l01952" name="l01952"></a><span class="lineno"> 1952</span> new_var-><a class="code hl_function" href="classoperations__research_1_1_m_p_variable_proto.html#a03ba55fe410af563250a79463d9eb7c6">set_is_integer</a>(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l01953" name="l01953"></a><span class="lineno"> 1953</span> </div>
|
|
<div class="line"><a id="l01954" name="l01954"></a><span class="lineno"> 1954</span> <span class="comment">// (new_var == 1) => x > hs_value.</span></div>
|
|
<div class="line"><a id="l01955" name="l01955"></a><span class="lineno"> 1955</span> <span class="comment">// (x - lb) - (hs_value - lb + 1) * new_var >= 0.</span></div>
|
|
<div class="line"><a id="l01956" name="l01956"></a><span class="lineno"> 1956</span> <a class="code hl_class" href="classoperations__research_1_1_m_p_constraint_proto.html">MPConstraintProto</a>* implication = hs_model.<a class="code hl_function" href="classoperations__research_1_1_m_p_model_proto.html#ad84385236dc87ac3b0adc4c28246d1d5">add_constraint</a>();</div>
|
|
<div class="line"><a id="l01957" name="l01957"></a><span class="lineno"> 1957</span> implication-><a class="code hl_function" href="classoperations__research_1_1_m_p_constraint_proto.html#a77bf5d8610054e5bd74cf0048bce5f25">set_lower_bound</a>(lb);</div>
|
|
<div class="line"><a id="l01958" name="l01958"></a><span class="lineno"> 1958</span> implication-><a class="code hl_function" href="classoperations__research_1_1_m_p_constraint_proto.html#aa38eaf33d95ea399d9b1fc7ee9c996fd">add_var_index</a>(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a id="l01959" name="l01959"></a><span class="lineno"> 1959</span> implication-><a class="code hl_function" href="classoperations__research_1_1_m_p_constraint_proto.html#ab6d1169646b89c2fb993c5b2e40eb925">add_coefficient</a>(1.0);</div>
|
|
<div class="line"><a id="l01960" name="l01960"></a><span class="lineno"> 1960</span> implication-><a class="code hl_function" href="classoperations__research_1_1_m_p_constraint_proto.html#aa38eaf33d95ea399d9b1fc7ee9c996fd">add_var_index</a>(new_var_index);</div>
|
|
<div class="line"><a id="l01961" name="l01961"></a><span class="lineno"> 1961</span> implication-><a class="code hl_function" href="classoperations__research_1_1_m_p_constraint_proto.html#ab6d1169646b89c2fb993c5b2e40eb925">add_coefficient</a>(lb - hs_value - 1);</div>
|
|
<div class="line"><a id="l01962" name="l01962"></a><span class="lineno"> 1962</span> }</div>
|
|
<div class="line"><a id="l01963" name="l01963"></a><span class="lineno"> 1963</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->add_var_index(<a class="code hl_function" href="namespacegtl.html#a9093d3af795feb9332cea022c20550f8">gtl::FindOrDieNoPrint</a>(created_var, key));</div>
|
|
<div class="line"><a id="l01964" name="l01964"></a><span class="lineno"> 1964</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->add_coefficient(1.0);</div>
|
|
<div class="line"><a id="l01965" name="l01965"></a><span class="lineno"> 1965</span> }</div>
|
|
<div class="line"><a id="l01966" name="l01966"></a><span class="lineno"> 1966</span> }</div>
|
|
<div class="line"><a id="l01967" name="l01967"></a><span class="lineno"> 1967</span> }</div>
|
|
<div class="line"><a id="l01968" name="l01968"></a><span class="lineno"> 1968</span> }</div>
|
|
<div class="line"><a id="l01969" name="l01969"></a><span class="lineno"> 1969</span> }</div>
|
|
<div class="line"><a id="l01970" name="l01970"></a><span class="lineno"> 1970</span> </div>
|
|
<div class="line"><a id="l01971" name="l01971"></a><span class="lineno"> 1971</span> <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l01972" name="l01972"></a><span class="lineno"> 1972</span><span class="preprocessor">#else </span><span class="comment">// !__PORTABLE_PLATFORM__ && USE_SCIP</span></div>
|
|
<div class="line"><a id="l01973" name="l01973"></a><span class="lineno"> 1973</span> <a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code hl_variable" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Not supported."</span>;</div>
|
|
<div class="line"><a id="l01974" name="l01974"></a><span class="lineno"> 1974</span><span class="preprocessor">#endif </span><span class="comment">// !__PORTABLE_PLATFORM__ && USE_SCIP</span></div>
|
|
<div class="line"><a id="l01975" name="l01975"></a><span class="lineno"> 1975</span>}</div>
|
|
<div class="line"><a id="l01976" name="l01976"></a><span class="lineno"> 1976</span> </div>
|
|
<div class="line"><a id="l01977" name="l01977"></a><span class="lineno"> 1977</span>} <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a id="l01978" name="l01978"></a><span class="lineno"> 1978</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00491">base/logging.h:491</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a4bd2e815ca2f702a4b6aa744b1ff3b82"><div class="ttname"><a href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a></div><div class="ttdeci">#define CHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00701">base/logging.h:701</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#l00698">base/logging.h:698</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00702">base/logging.h:702</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#l00703">base/logging.h:703</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#l00699">base/logging.h:699</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00416">base/logging.h:416</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</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="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#l00700">base/logging.h:700</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#l00979">base/logging.h:979</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_1_m_p_constraint_proto_html"><div class="ttname"><a href="classoperations__research_1_1_m_p_constraint_proto.html">operations_research::MPConstraintProto</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l00507">linear_solver.pb.h:508</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_constraint_proto_html_a77bf5d8610054e5bd74cf0048bce5f25"><div class="ttname"><a href="classoperations__research_1_1_m_p_constraint_proto.html#a77bf5d8610054e5bd74cf0048bce5f25">operations_research::MPConstraintProto::set_lower_bound</a></div><div class="ttdeci">void set_lower_bound(double value)</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l05069">linear_solver.pb.h:5069</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_constraint_proto_html_aa38eaf33d95ea399d9b1fc7ee9c996fd"><div class="ttname"><a href="classoperations__research_1_1_m_p_constraint_proto.html#aa38eaf33d95ea399d9b1fc7ee9c996fd">operations_research::MPConstraintProto::add_var_index</a></div><div class="ttdeci">void add_var_index(::PROTOBUF_NAMESPACE_ID::int32 value)</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l04976">linear_solver.pb.h:4976</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_constraint_proto_html_ab6d1169646b89c2fb993c5b2e40eb925"><div class="ttname"><a href="classoperations__research_1_1_m_p_constraint_proto.html#ab6d1169646b89c2fb993c5b2e40eb925">operations_research::MPConstraintProto::add_coefficient</a></div><div class="ttdeci">void add_coefficient(double value)</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l05023">linear_solver.pb.h:5023</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_model_proto_html"><div class="ttname"><a href="classoperations__research_1_1_m_p_model_proto.html">operations_research::MPModelProto</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l02767">linear_solver.pb.h:2768</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_model_proto_html_a233b16fc13c9664e5b818158019af13d"><div class="ttname"><a href="classoperations__research_1_1_m_p_model_proto.html#a233b16fc13c9664e5b818158019af13d">operations_research::MPModelProto::variable_size</a></div><div class="ttdeci">int variable_size() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l06920">linear_solver.pb.h:6920</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_model_proto_html_a4c6815e5419d4e4f94565b345eb38b9f"><div class="ttname"><a href="classoperations__research_1_1_m_p_model_proto.html#a4c6815e5419d4e4f94565b345eb38b9f">operations_research::MPModelProto::add_variable</a></div><div class="ttdeci">::operations_research::MPVariableProto * add_variable()</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l06945">linear_solver.pb.h:6945</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_model_proto_html_a6255cadc7041d64f5e850a5e3786b3fd"><div class="ttname"><a href="classoperations__research_1_1_m_p_model_proto.html#a6255cadc7041d64f5e850a5e3786b3fd">operations_research::MPModelProto::mutable_variable</a></div><div class="ttdeci">::operations_research::MPVariableProto * mutable_variable(int index)</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l06926">linear_solver.pb.h:6926</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_model_proto_html_ad84385236dc87ac3b0adc4c28246d1d5"><div class="ttname"><a href="classoperations__research_1_1_m_p_model_proto.html#ad84385236dc87ac3b0adc4c28246d1d5">operations_research::MPModelProto::add_constraint</a></div><div class="ttdeci">::operations_research::MPConstraintProto * add_constraint()</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l06985">linear_solver.pb.h:6985</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_model_proto_html_ae3687769a11bd922a263d0135f84a064"><div class="ttname"><a href="classoperations__research_1_1_m_p_model_proto.html#ae3687769a11bd922a263d0135f84a064">operations_research::MPModelProto::constraint_size</a></div><div class="ttdeci">int constraint_size() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l06960">linear_solver.pb.h:6960</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_model_request_html"><div class="ttname"><a href="classoperations__research_1_1_m_p_model_request.html">operations_research::MPModelRequest</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l03744">linear_solver.pb.h:3745</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_model_request_html_a367238eef2713ff41df6866652a30d59"><div class="ttname"><a href="classoperations__research_1_1_m_p_model_request.html#a367238eef2713ff41df6866652a30d59">operations_research::MPModelRequest::mutable_model</a></div><div class="ttdeci">::operations_research::MPModelProto * mutable_model()</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l07916">linear_solver.pb.h:7916</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_model_request_html_a65cb3cf3fc5b133269d86bc638ffa106"><div class="ttname"><a href="classoperations__research_1_1_m_p_model_request.html#a65cb3cf3fc5b133269d86bc638ffa106">operations_research::MPModelRequest::set_solver_type</a></div><div class="ttdeci">void set_solver_type(::operations_research::MPModelRequest_SolverType value)</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l07965">linear_solver.pb.h:7965</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_model_request_html_a6f6bbefc174344cdacd3d27afc9336d6"><div class="ttname"><a href="classoperations__research_1_1_m_p_model_request.html#a6f6bbefc174344cdacd3d27afc9336d6">operations_research::MPModelRequest::SCIP_MIXED_INTEGER_PROGRAMMING</a></div><div class="ttdeci">static constexpr SolverType SCIP_MIXED_INTEGER_PROGRAMMING</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l03880">linear_solver.pb.h:3880</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_model_request_html_a7e6d0619ceb2fc4dad0819a723d8c075"><div class="ttname"><a href="classoperations__research_1_1_m_p_model_request.html#a7e6d0619ceb2fc4dad0819a723d8c075">operations_research::MPModelRequest::set_solver_specific_parameters</a></div><div class="ttdeci">void set_solver_specific_parameters(ArgT0 &&arg0, ArgT... args)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_solution_response_html"><div class="ttname"><a href="classoperations__research_1_1_m_p_solution_response.html">operations_research::MPSolutionResponse</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l04424">linear_solver.pb.h:4425</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_solver_html_aad8e8f47697c2149ae4ee449bcc3142c"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#aad8e8f47697c2149ae4ee449bcc3142c">operations_research::MPSolver::SolveWithProto</a></div><div class="ttdeci">static void SolveWithProto(const MPModelRequest &model_request, MPSolutionResponse *response, std::atomic< bool > *interrupt=nullptr)</div><div class="ttdoc">Solves the model encoded by a MPModelRequest protocol buffer and fills the solution encoded as a MPSo...</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8cc_source.html#l00860">linear_solver.cc:860</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_variable_proto_html"><div class="ttname"><a href="classoperations__research_1_1_m_p_variable_proto.html">operations_research::MPVariableProto</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l00272">linear_solver.pb.h:273</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_variable_proto_html_a03ba55fe410af563250a79463d9eb7c6"><div class="ttname"><a href="classoperations__research_1_1_m_p_variable_proto.html#a03ba55fe410af563250a79463d9eb7c6">operations_research::MPVariableProto::set_is_integer</a></div><div class="ttdeci">void set_is_integer(bool value)</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l04857">linear_solver.pb.h:4857</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_variable_proto_html_a4b8844c0490b3c525060762f8bc11a8c"><div class="ttname"><a href="classoperations__research_1_1_m_p_variable_proto.html#a4b8844c0490b3c525060762f8bc11a8c">operations_research::MPVariableProto::set_objective_coefficient</a></div><div class="ttdeci">void set_objective_coefficient(double value)</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l04829">linear_solver.pb.h:4829</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_variable_proto_html_a77bf5d8610054e5bd74cf0048bce5f25"><div class="ttname"><a href="classoperations__research_1_1_m_p_variable_proto.html#a77bf5d8610054e5bd74cf0048bce5f25">operations_research::MPVariableProto::set_lower_bound</a></div><div class="ttdeci">void set_lower_bound(double value)</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l04773">linear_solver.pb.h:4773</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_p_variable_proto_html_ac91622e1f864308bd349b37d5b1a9528"><div class="ttname"><a href="classoperations__research_1_1_m_p_variable_proto.html#ac91622e1f864308bd349b37d5b1a9528">operations_research::MPVariableProto::set_upper_bound</a></div><div class="ttdeci">void set_upper_bound(double value)</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l04801">linear_solver.pb.h:4801</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_m_t_random_html"><div class="ttname"><a href="classoperations__research_1_1_m_t_random.html">operations_research::MTRandom</a></div><div class="ttdef"><b>Definition:</b> <a href="random_8h_source.html#l00055">random.h:55</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_shared_time_limit_html_a4273b83b06bfbf856393db6d0a9b8715"><div class="ttname"><a href="classoperations__research_1_1_shared_time_limit.html#a4273b83b06bfbf856393db6d0a9b8715">operations_research::SharedTimeLimit::GetTimeLeft</a></div><div class="ttdeci">double GetTimeLeft() const</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00379">time_limit.h:379</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_shared_time_limit_html_ad837e6231722ead53bbaf1c6e8f66032"><div class="ttname"><a href="classoperations__research_1_1_shared_time_limit.html#ad837e6231722ead53bbaf1c6e8f66032">operations_research::SharedTimeLimit::LimitReached</a></div><div class="ttdeci">bool LimitReached() const</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00357">time_limit.h:357</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html">operations_research::TimeLimit</a></div><div class="ttdoc">A simple class to enforce both an elapsed time limit and a deterministic time limit in the same threa...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00105">time_limit.h:105</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html_a810d5f7aaf80cc09cf5a094e20c1aaca"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">operations_research::TimeLimit::LimitReached</a></div><div class="ttdeci">bool LimitReached()</div><div class="ttdoc">Returns true when the external limit is true, or the deterministic time is over the deterministic lim...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00533">time_limit.h:533</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html_ac7e861414a70fc937d18bc7ca743fc98"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html#ac7e861414a70fc937d18bc7ca743fc98">operations_research::TimeLimit::GetElapsedDeterministicTime</a></div><div class="ttdeci">double GetElapsedDeterministicTime() const</div><div class="ttdoc">Returns the elapsed deterministic time since the construction of this object.</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00260">time_limit.h:260</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_core_based_optimizer_html_a02a9dc1603fd32ca7d13e2db95316bb2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_core_based_optimizer.html#a02a9dc1603fd32ca7d13e2db95316bb2">operations_research::sat::CoreBasedOptimizer::CoreBasedOptimizer</a></div><div class="ttdeci">CoreBasedOptimizer(IntegerVariable objective_var, const std::vector< IntegerVariable > &variables, const std::vector< IntegerValue > &coefficients, std::function< void()> feasible_solution_observer, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l01312">optimization.cc:1312</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_core_based_optimizer_html_a4398d89730acb3b628a3c81d55bac96f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_core_based_optimizer.html#a4398d89730acb3b628a3c81d55bac96f">operations_research::sat::CoreBasedOptimizer::Optimize</a></div><div class="ttdeci">SatSolver::Status Optimize()</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l01542">optimization.cc:1542</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html">operations_research::sat::EncodingNode</a></div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00054">encoding.h:54</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a6fdd73f8011695b97659f2bea29325cb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a6fdd73f8011695b97659f2bea29325cb">operations_research::sat::EncodingNode::depth</a></div><div class="ttdeci">int depth() const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00109">encoding.h:109</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_encoding_node_html_a8d59d3e1fa9887ff055c7a6853055198"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198">operations_research::sat::EncodingNode::literal</a></div><div class="ttdeci">Literal literal(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8h_source.html#l00079">encoding.h:79</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_encoder_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html">operations_research::sat::IntegerEncoder</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00306">integer.h:306</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_encoder_html_afcd4038298bec97a2f7a61274c6ef8c7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html#afcd4038298bec97a2f7a61274c6ef8c7">operations_research::sat::IntegerEncoder::GetOrCreateAssociatedLiteral</a></div><div class="ttdeci">Literal GetOrCreateAssociatedLiteral(IntegerLiteral i_lit)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00238">integer.cc:238</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html">operations_research::sat::IntegerTrail</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00574">integer.h:574</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a05e837bb93eeabbbd94e8f690dd59d32"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">operations_research::sat::IntegerTrail::Enqueue</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool Enqueue(IntegerLiteral i_lit, absl::Span< const Literal > literal_reason, absl::Span< const IntegerLiteral > integer_reason)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01028">integer.cc:1028</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a309d057e12c8d4d393f13975eea2e2a9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a309d057e12c8d4d393f13975eea2e2a9">operations_research::sat::IntegerTrail::IsCurrentlyIgnored</a></div><div class="ttdeci">bool IsCurrentlyIgnored(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00659">integer.h:659</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a8b6d5a25e6ad3d28a85b1924471e2cac"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">operations_research::sat::IntegerTrail::UpperBound</a></div><div class="ttdeci">IntegerValue UpperBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01349">integer.h:1349</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a9ab880b5e67213a0607c5c3935da9f08"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">operations_research::sat::IntegerTrail::LevelZeroUpperBound</a></div><div class="ttdeci">IntegerValue LevelZeroUpperBound(IntegerVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01412">integer.h:1412</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_aa2d7b702e17a5cd4108b465385dd9acd"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#aa2d7b702e17a5cd4108b465385dd9acd">operations_research::sat::IntegerTrail::AddIntegerVariable</a></div><div class="ttdeci">IntegerVariable AddIntegerVariable(IntegerValue lower_bound, IntegerValue upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00640">integer.cc:640</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_aa68cc40c827bff2fb311040e2b848f9b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">operations_research::sat::IntegerTrail::LevelZeroLowerBound</a></div><div class="ttdeci">IntegerValue LevelZeroLowerBound(IntegerVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01407">integer.h:1407</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_ab857cd2aead68952d9fe92a8ad8d3ac9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">operations_research::sat::IntegerTrail::LowerBound</a></div><div class="ttdeci">IntegerValue LowerBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01345">integer.h:1345</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_boolean_problem_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html">operations_research::sat::LinearBooleanProblem</a></div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l00702">boolean_problem.pb.h:703</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_boolean_problem_html_a9fd8f81a798fd34a843b007c10e40d6b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a9fd8f81a798fd34a843b007c10e40d6b">operations_research::sat::LinearBooleanProblem::objective</a></div><div class="ttdeci">const ::operations_research::sat::LinearObjective & objective() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01548">boolean_problem.pb.h:1548</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_boolean_problem_html_aad5531f45ca462be2f1b7ee7a5cb1372"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#aad5531f45ca462be2f1b7ee7a5cb1372">operations_research::sat::LinearBooleanProblem::num_variables</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::int32 num_variables() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01477">boolean_problem.pb.h:1477</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_boolean_problem_html_aeaf0da781ca9b370d96b7fbd3f74266a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#aeaf0da781ca9b370d96b7fbd3f74266a">operations_research::sat::LinearBooleanProblem::constraints_size</a></div><div class="ttdeci">int constraints_size() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01494">boolean_problem.pb.h:1494</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_objective_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html">operations_research::sat::LinearObjective</a></div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l00321">boolean_problem.pb.h:322</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_objective_html_a63e564949c709325f7c31376b8db8b64"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a63e564949c709325f7c31376b8db8b64">operations_research::sat::LinearObjective::coefficients</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::int64 coefficients(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01259">boolean_problem.pb.h:1259</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_objective_html_a72d41feda9a93c11089d3d99d6270999"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a72d41feda9a93c11089d3d99d6270999">operations_research::sat::LinearObjective::literals_size</a></div><div class="ttdeci">int literals_size() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01203">boolean_problem.pb.h:1203</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_objective_html_a96ffc785b7b2135c7980c985883ffdd3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a96ffc785b7b2135c7980c985883ffdd3">operations_research::sat::LinearObjective::offset</a></div><div class="ttdeci">double offset() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01308">boolean_problem.pb.h:1308</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_objective_html_ae257a6514082fdcf3a9f33dda44c40b7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#ae257a6514082fdcf3a9f33dda44c40b7">operations_research::sat::LinearObjective::literals</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::int32 literals(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01212">boolean_problem.pb.h:1212</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_objective_html_afddea8f1f515fb9507a2e5c2ceb1b29e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#afddea8f1f515fb9507a2e5c2ceb1b29e">operations_research::sat::LinearObjective::coefficients_size</a></div><div class="ttdeci">int coefficients_size() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01250">boolean_problem.pb.h:1250</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#l00065">sat_base.h:65</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html_a886e9c024f7209181c0a850b6e90c644"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">operations_research::sat::Literal::Negated</a></div><div class="ttdeci">Literal Negated() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00092">sat_base.h:92</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00038">sat/model.h:38</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_html_a7b8d774b566431b8932ba0f3c921ec7d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html#a7b8d774b566431b8932ba0f3c921ec7d">operations_research::sat::Model::Add</a></div><div class="ttdeci">T Add(std::function< T(Model *)> f)</div><div class="ttdoc">This makes it possible to have a nicer API on the client side, and it allows both of these forms:</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00081">sat/model.h:81</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html">operations_research::sat::SatParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00347">sat_parameters.pb.h:348</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_a042e4456dbde45ef0da51857b8b3650a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a042e4456dbde45ef0da51857b8b3650a">operations_research::sat::SatParameters::max_deterministic_time</a></div><div class="ttdeci">double max_deterministic_time() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l04715">sat_parameters.pb.h:4715</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_a13b1e4908507488f6954c89d70522ff9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a13b1e4908507488f6954c89d70522ff9">operations_research::sat::SatParameters::minimize_core</a></div><div class="ttdeci">bool minimize_core() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l05921">sat_parameters.pb.h:5921</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_a1a2b6695ed16232e46adc8d31983e637"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a1a2b6695ed16232e46adc8d31983e637">operations_research::sat::SatParameters::binary_search_num_conflicts</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::int32 binary_search_num_conflicts() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l07184">sat_parameters.pb.h:7184</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_a32f3ed6806ec24e1818093f9f9c77f1a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a32f3ed6806ec24e1818093f9f9c77f1a">operations_research::sat::SatParameters::stop_after_first_solution</a></div><div class="ttdeci">bool stop_after_first_solution() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l07380">sat_parameters.pb.h:7380</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_a7120a9ef363b14f95108f17415c9c3d0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a7120a9ef363b14f95108f17415c9c3d0">operations_research::sat::SatParameters::set_max_number_of_conflicts</a></div><div class="ttdeci">void set_max_number_of_conflicts(::PROTOBUF_NAMESPACE_ID::int64 value)</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l04751">sat_parameters.pb.h:4751</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_a71ebe8b239aabd3a075a7dcfa2d6d525"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a71ebe8b239aabd3a075a7dcfa2d6d525">operations_research::sat::SatParameters::STRATIFICATION_NONE</a></div><div class="ttdeci">static constexpr MaxSatStratificationAlgorithm STRATIFICATION_NONE</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00739">sat_parameters.pb.h:739</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_a767ec8a1eb70a96791e5f1789464be03"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a767ec8a1eb70a96791e5f1789464be03">operations_research::sat::SatParameters::cover_optimization</a></div><div class="ttdeci">bool cover_optimization() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l05977">sat_parameters.pb.h:5977</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_a89082aa97657e1720a8c241a4afb4de8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a89082aa97657e1720a8c241a4afb4de8">operations_research::sat::SatParameters::set_max_deterministic_time</a></div><div class="ttdeci">void set_max_deterministic_time(double value)</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l04723">sat_parameters.pb.h:4723</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_a9479680f1c22d80a33b60eff204ae3d0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a9479680f1c22d80a33b60eff204ae3d0">operations_research::sat::SatParameters::max_sat_stratification</a></div><div class="ttdeci">::operations_research::sat::SatParameters_MaxSatStratificationAlgorithm max_sat_stratification() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l06062">sat_parameters.pb.h:6062</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_aa148eda9a432e6c798d9e2eecc8645f4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#aa148eda9a432e6c798d9e2eecc8645f4">operations_research::sat::SatParameters::set_random_seed</a></div><div class="ttdeci">void set_random_seed(::PROTOBUF_NAMESPACE_ID::int32 value)</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l04891">sat_parameters.pb.h:4891</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_ab055fe5de5ab455c769387b42059f031"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#ab055fe5de5ab455c769387b42059f031">operations_research::sat::SatParameters::set_log_search_progress</a></div><div class="ttdeci">void set_log_search_progress(bool value)</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l05003">sat_parameters.pb.h:5003</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_ac1924f07faa4fdf4ca4e7f76813f7c2a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#ac1924f07faa4fdf4ca4e7f76813f7c2a">operations_research::sat::SatParameters::max_time_in_seconds</a></div><div class="ttdeci">double max_time_in_seconds() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l04687">sat_parameters.pb.h:4687</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_ad7217afa0f5bd97642d0d2291068c7f9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#ad7217afa0f5bd97642d0d2291068c7f9">operations_research::sat::SatParameters::set_max_time_in_seconds</a></div><div class="ttdeci">void set_max_time_in_seconds(double value)</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l04695">sat_parameters.pb.h:4695</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_adcb34fa5277922f4ef41267b2ab38847"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#adcb34fa5277922f4ef41267b2ab38847">operations_research::sat::SatParameters::STRATIFICATION_ASCENT</a></div><div class="ttdeci">static constexpr MaxSatStratificationAlgorithm STRATIFICATION_ASCENT</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00743">sat_parameters.pb.h:743</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_parameters_html_af6f976229a42f4f7eb42c392d94ed964"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#af6f976229a42f4f7eb42c392d94ed964">operations_research::sat::SatParameters::STRATIFICATION_DESCENT</a></div><div class="ttdeci">static constexpr MaxSatStratificationAlgorithm STRATIFICATION_DESCENT</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00741">sat_parameters.pb.h:741</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html">operations_research::sat::SatSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00058">sat_solver.h:58</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a05c49a95f6af6f8d873c96cae6ab6653"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653">operations_research::sat::SatSolver::AddLinearConstraint</a></div><div class="ttdeci">bool AddLinearConstraint(bool use_lower_bound, Coefficient lower_bound, bool use_upper_bound, Coefficient upper_bound, std::vector< LiteralWithCoeff > *cst)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00300">sat_solver.cc:300</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a0b58ef3a397720b272662f8bc45585cb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb">operations_research::sat::SatSolver::SetNumVariables</a></div><div class="ttdeci">void SetNumVariables(int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00065">sat_solver.cc:65</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a0e8b0117614d340615ab66abec430d78"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a0e8b0117614d340615ab66abec430d78">operations_research::sat::SatSolver::AddTernaryClause</a></div><div class="ttdeci">bool AddTernaryClause(Literal a, Literal b, Literal c)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00192">sat_solver.cc:192</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a1a5e26554d014197de9434d2c39e07e9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9">operations_research::sat::SatSolver::parameters</a></div><div class="ttdeci">const SatParameters & parameters() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00111">sat_solver.cc:111</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a1dc177ee88f0a7ce2e46a032e5c3cf02"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a1dc177ee88f0a7ce2e46a032e5c3cf02">operations_research::sat::SatSolver::ResetDecisionHeuristic</a></div><div class="ttdeci">void ResetDecisionHeuristic()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00157">sat_solver.h:157</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a2abca6db0c780a4482d1ac9eb6365057"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a2abca6db0c780a4482d1ac9eb6365057">operations_research::sat::SatSolver::ResetAndSolveWithGivenAssumptions</a></div><div class="ttdeci">Status ResetAndSolveWithGivenAssumptions(const std::vector< Literal > &assumptions)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00948">sat_solver.cc:948</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a2b006481369eb4f4cb7f3037dfdd8404"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a2b006481369eb4f4cb7f3037dfdd8404">operations_research::sat::SatSolver::Solve</a></div><div class="ttdeci">Status Solve()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00973">sat_solver.cc:973</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a4793952607a98dfddfbcc17abfabbb4b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b">operations_research::sat::SatSolver::Assignment</a></div><div class="ttdeci">const VariablesAssignment & Assignment() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00363">sat_solver.h:363</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a5ca47674a4a0b5e7f40eb430ab474440"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440">operations_research::sat::SatSolver::SetAssumptionLevel</a></div><div class="ttdeci">void SetAssumptionLevel(int assumption_level)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00963">sat_solver.cc:963</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a607d97ccada862073f297bc2d495124d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d">operations_research::sat::SatSolver::FinishPropagation</a></div><div class="ttdeci">bool FinishPropagation()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00522">sat_solver.cc:522</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">operations_research::sat::SatSolver::Status</a></div><div class="ttdeci">Status</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00181">sat_solver.h:181</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">operations_research::sat::SatSolver::FEASIBLE</a></div><div class="ttdeci">@ FEASIBLE</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00184">sat_solver.h:184</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">operations_research::sat::SatSolver::INFEASIBLE</a></div><div class="ttdeci">@ INFEASIBLE</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00183">sat_solver.h:183</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">operations_research::sat::SatSolver::LIMIT_REACHED</a></div><div class="ttdeci">@ LIMIT_REACHED</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00185">sat_solver.h:185</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885">operations_research::sat::SatSolver::ASSUMPTIONS_UNSAT</a></div><div class="ttdeci">@ ASSUMPTIONS_UNSAT</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00182">sat_solver.h:182</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#l00500">sat_solver.cc:500</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a9d3beb2afe4ae647674b054bf29290e2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2">operations_research::sat::SatSolver::NumVariables</a></div><div class="ttdeci">int NumVariables() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00083">sat_solver.h:83</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a9d584b84d7b882a6017b072b33475172"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a9d584b84d7b882a6017b072b33475172">operations_research::sat::SatSolver::SetParameters</a></div><div class="ttdeci">void SetParameters(const SatParameters &parameters)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00116">sat_solver.cc:116</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a9da38c8d2910442d551db5e360423029"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029">operations_research::sat::SatSolver::ResetToLevelZero</a></div><div class="ttdeci">bool ResetToLevelZero()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00530">sat_solver.cc:530</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_aac912e9410b8989493f492fcbb2d9094"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">operations_research::sat::SatSolver::AddBinaryClause</a></div><div class="ttdeci">bool AddBinaryClause(Literal a, Literal b)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00181">sat_solver.cc:181</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_ab63a08713131e63e9cc4109f98ecf859"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ab63a08713131e63e9cc4109f98ecf859">operations_research::sat::SatSolver::EnqueueDecisionAndBacktrackOnConflict</a></div><div class="ttdeci">int EnqueueDecisionAndBacktrackOnConflict(Literal true_literal)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00862">sat_solver.cc:862</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#l00889">sat_solver.cc:889</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_acfbfa9df611cb625ff79785c05784580"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#acfbfa9df611cb625ff79785c05784580">operations_research::sat::SatSolver::GetLastIncompatibleDecisions</a></div><div class="ttdeci">std::vector< Literal > GetLastIncompatibleDecisions()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l01273">sat_solver.cc:1273</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#l00137">sat_solver.h:137</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#l00361">sat_solver.h:361</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_af67fe279478772a6d1492a7f673bda5d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#af67fe279478772a6d1492a7f673bda5d">operations_research::sat::SatSolver::AddProblemClause</a></div><div class="ttdeci">bool AddProblemClause(absl::Span< const Literal > literals)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00204">sat_solver.cc:204</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_afbbbc2f0845a82a5a5cfb3f00a61abe9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9">operations_research::sat::SatSolver::AddUnitClause</a></div><div class="ttdeci">bool AddUnitClause(Literal true_literal)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00165">sat_solver.cc:165</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_a5300129913f51dcb0b1c531e3248490e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">operations_research::sat::VariablesAssignment::LiteralIsTrue</a></div><div class="ttdeci">bool LiteralIsTrue(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00151">sat_base.h:151</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_acfd1646011e643f58fd7dc66d9cc90a5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">operations_research::sat::VariablesAssignment::LiteralIsFalse</a></div><div class="ttdeci">bool LiteralIsFalse(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00148">sat_base.h:148</a></div></div>
|
|
<div class="ttc" id="acleanup_8h_html"><div class="ttname"><a href="cleanup_8h.html">cleanup.h</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a9293e4d29cac928301645070dd307683"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a></div><div class="ttdeci">int64_t b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00047">constraint_solver/table.cc:47</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_acb18315d548212835cd8ed4287e6c0b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a></div><div class="ttdeci">int64_t a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00046">constraint_solver/table.cc:46</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#l00116">cp_model_fz_solver.cc:116</a></div></div>
|
|
<div class="ttc" id="acp__model__solver_8cc_html_abcd33b18ce6d5a90a4ba5c37cfa58829"><div class="ttname"><a href="cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829">response</a></div><div class="ttdeci">SharedResponseManager * response</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02015">cp_model_solver.cc:2015</a></div></div>
|
|
<div class="ttc" id="acp__model__solver_8cc_html_aec8af5c1be4e1b6d4330e1161028de21"><div class="ttname"><a href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a></div><div class="ttdeci">ModelSharedTimeLimit * time_limit</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02013">cp_model_solver.cc:2013</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#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
|
|
<div class="ttc" id="aencoding_8h_html"><div class="ttname"><a href="encoding_8h.html">encoding.h</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="agscip__solver_8cc_html_a1ba5ca0f61f2fa13bd23bf0f89004f35"><div class="ttname"><a href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a></div><div class="ttdeci">double upper_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00126">gscip_solver.cc:126</a></div></div>
|
|
<div class="ttc" id="agscip__solver_8cc_html_a1e2f9a2352c1d9a6cada9544898fceec"><div class="ttname"><a href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a></div><div class="ttdeci">double lower_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00125">gscip_solver.cc:125</a></div></div>
|
|
<div class="ttc" id="agscip__solver_8cc_html_aa59e74cc299dbf75fa6e2234dd0849a2"><div class="ttname"><a href="gscip__solver_8cc.html#aa59e74cc299dbf75fa6e2234dd0849a2">coefficients</a></div><div class="ttdeci">absl::Span< const double > coefficients</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00129">gscip_solver.cc:129</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00273">gurobi_interface.cc:273</a></div></div>
|
|
<div class="ttc" id="aint__type_8h_html"><div class="ttname"><a href="int__type_8h.html">int_type.h</a></div></div>
|
|
<div class="ttc" id="ainteger__expr_8h_html"><div class="ttname"><a href="integer__expr_8h.html">integer_expr.h</a></div></div>
|
|
<div class="ttc" id="alinear__solver_8h_html"><div class="ttname"><a href="linear__solver_8h.html">linear_solver.h</a></div><div class="ttdoc">A C++ wrapper that provides a simple and unified interface to several linear programming and mixed in...</div></div>
|
|
<div class="ttc" id="alinear__solver_8pb_8h_html"><div class="ttname"><a href="linear__solver_8pb_8h.html">linear_solver.pb.h</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_ab4a2cbab234914b320b7fae11b6e8cb9"><div class="ttname"><a href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a></div><div class="ttdeci">const int INFO</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00031">log_severity.h:31</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_acdd38e3c9f22f127d7776920e3079eda"><div class="ttname"><a href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a></div><div class="ttdeci">const int FATAL</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00032">log_severity.h:32</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html_af8df3547bfde53a5acb93e2607b0034a"><div class="ttname"><a href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a></div><div class="ttdeci">#define DISALLOW_COPY_AND_ASSIGN(TypeName)</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00029">macros.h:29</a></div></div>
|
|
<div class="ttc" id="amap__util_8h_html"><div class="ttname"><a href="map__util_8h.html">map_util.h</a></div></div>
|
|
<div class="ttc" id="anamespaceabsl_html_a01547ab811df98c71089487f394ec259"><div class="ttname"><a href="namespaceabsl.html#a01547ab811df98c71089487f394ec259">absl::MakeCleanup</a></div><div class="ttdeci">absl::Cleanup< absl::decay_t< Callback > > MakeCleanup(Callback &&callback)</div><div class="ttdef"><b>Definition:</b> <a href="cleanup_8h_source.html#l00120">cleanup.h:120</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a288a1dc92da5d3ad62d4bc4cec9e8b1d"><div class="ttname"><a href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a></div><div class="ttdeci">void STLSortAndRemoveDuplicates(T *v, const LessFunc &less_func)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00058">stl_util.h:58</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a73f41ac11336b94768fdd41594153d59"><div class="ttname"><a href="namespacegtl.html#a73f41ac11336b94768fdd41594153d59">gtl::FindOrDie</a></div><div class="ttdeci">const Collection::value_type::second_type & FindOrDie(const Collection &collection, const typename Collection::value_type::first_type &key)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00206">map_util.h:206</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a9093d3af795feb9332cea022c20550f8"><div class="ttname"><a href="namespacegtl.html#a9093d3af795feb9332cea022c20550f8">gtl::FindOrDieNoPrint</a></div><div class="ttdeci">const Collection::value_type::second_type & FindOrDieNoPrint(const Collection &collection, const typename Collection::value_type::first_type &key)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00216">map_util.h:216</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_aae28e97bd1fa93cb0032642550da7455"><div class="ttname"><a href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a></div><div class="ttdeci">bool ContainsKey(const Collection &collection, const Key &key)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00200">map_util.h:200</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a5de89a1f6e3f80a49a0d76136d8044e2"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">operations_research::math_opt::swap</a></div><div class="ttdeci">void swap(IdMap< K, V > &a, IdMap< K, V > &b)</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00263">id_map.h:263</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ab61209db5b13f0d424da009e414298fc"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">operations_research::math_opt::Coefficient</a></div><div class="ttdeci">std::tuple< int64_t, int64_t, const double > Coefficient</div><div class="ttdef"><b>Definition:</b> <a href="sparse__collection__matchers_8h_source.html#l00061">sparse_collection_matchers.h:61</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a07c4372fa55782d13edd24b86130e3ba"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a07c4372fa55782d13edd24b86130e3ba">operations_research::sat::AddObjectiveConstraint</a></div><div class="ttdeci">bool AddObjectiveConstraint(const LinearBooleanProblem &problem, bool use_lower_bound, Coefficient lower_bound, bool use_upper_bound, Coefficient upper_bound, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00338">boolean_problem.cc:338</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1227e67513602591fb959e35c9de66e8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">operations_research::sat::kMaxIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMaxIntegerValue(std::numeric_limits< IntegerValue::ValueType >::max() - 1)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a166c4d1be17bdfcad1986b1f72c49e52"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a166c4d1be17bdfcad1986b1f72c49e52">operations_research::sat::RestrictObjectiveDomainWithBinarySearch</a></div><div class="ttdeci">void RestrictObjectiveDomainWithBinarySearch(IntegerVariable objective_var, const std::function< void()> &feasible_solution_observer, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l01093">optimization.cc:1093</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a16bcd287bd18e3a940d997aafb9321a9"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a16bcd287bd18e3a940d997aafb9321a9">operations_research::sat::AddOffsetAndScaleObjectiveValue</a></div><div class="ttdeci">double AddOffsetAndScaleObjectiveValue(const LinearBooleanProblem &problem, Coefficient v)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8h_source.html#l00039">boolean_problem.h:39</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a17b20b0845d9e02829d417294aded36a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a">operations_research::sat::ResetAndSolveIntegerProblem</a></div><div class="ttdeci">SatSolver::Status ResetAndSolveIntegerProblem(const std::vector< Literal > &assumptions, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l01044">integer_search.cc:1044</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1b36a95b81f69a73d04b1b42fd40c4db"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1b36a95b81f69a73d04b1b42fd40c4db">operations_research::sat::SolveWithCardinalityEncodingAndCore</a></div><div class="ttdeci">SatSolver::Status SolveWithCardinalityEncodingAndCore(LogBehavior log, const LinearBooleanProblem &problem, SatSolver *solver, std::vector< bool > *solution)</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00958">optimization.cc:958</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1c9d74b9b207b6e5513334dd135a00a9"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1c9d74b9b207b6e5513334dd135a00a9">operations_research::sat::ComputeCoreMinWeight</a></div><div class="ttdeci">Coefficient ComputeCoreMinWeight(const std::vector< EncodingNode * > &nodes, const std::vector< Literal > &core)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00419">encoding.cc:419</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a29ff75f2188e0ac1c58fa4b0cf793a00"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a29ff75f2188e0ac1c58fa4b0cf793a00">operations_research::sat::MergeAllNodesWithDeque</a></div><div class="ttdeci">EncodingNode * MergeAllNodesWithDeque(Coefficient upper_bound, const std::vector< EncodingNode * > &nodes, SatSolver *solver, std::deque< EncodingNode > *repository)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00264">encoding.cc:264</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a2d7fdf5a1e3a1a9f3c4b893227f2f523"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a2d7fdf5a1e3a1a9f3c4b893227f2f523">operations_research::sat::WeightedSumLowerOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> WeightedSumLowerOrEqual(const std::vector< IntegerVariable > &vars, const VectorInt &coefficients, int64_t upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00298">integer_expr.h:298</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a2ef3eb1f5fe6506a5e24115f10d724fc"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a2ef3eb1f5fe6506a5e24115f10d724fc">operations_research::sat::MoveOneUnprocessedLiteralLast</a></div><div class="ttdeci">int MoveOneUnprocessedLiteralLast(const std::set< LiteralIndex > &processed, int relevant_prefix_size, std::vector< Literal > *literals)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00025">sat/util.cc:25</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a3ad49ae9019c528851f6fd084479a567"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3ad49ae9019c528851f6fd084479a567">operations_research::sat::LowerBound</a></div><div class="ttdeci">std::function< int64_t(const Model &)> LowerBound(IntegerVariable v)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01524">integer.h:1524</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a3c7b9fb850d243d90ea59790db13a676"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3c7b9fb850d243d90ea59790db13a676">operations_research::sat::ReduceNodesAndExtractAssumptions</a></div><div class="ttdeci">std::vector< Literal > ReduceNodesAndExtractAssumptions(Coefficient upper_bound, Coefficient stratified_lower_bound, Coefficient *lower_bound, std::vector< EncodingNode * > *nodes, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00367">encoding.cc:367</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a40254eb00d4590a09d811fe94c727c2a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a40254eb00d4590a09d811fe94c727c2a">operations_research::sat::UseObjectiveForSatAssignmentPreference</a></div><div class="ttdeci">void UseObjectiveForSatAssignmentPreference(const LinearBooleanProblem &problem, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00309">boolean_problem.cc:309</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a5cafa03de29acf965c3fc23dfa7eba0a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5cafa03de29acf965c3fc23dfa7eba0a">operations_research::sat::SolveWithLinearScan</a></div><div class="ttdeci">SatSolver::Status SolveWithLinearScan(LogBehavior log, const LinearBooleanProblem &problem, SatSolver *solver, std::vector< bool > *solution)</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00844">optimization.cc:844</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a6fb8349259fa849de0789a4ec58a8492"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a6fb8349259fa849de0789a4ec58a8492">operations_research::sat::MinimizeCore</a></div><div class="ttdeci">void MinimizeCore(SatSolver *solver, std::vector< Literal > *core)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l02553">sat_solver.cc:2553</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a7d1c65f24756bb9dad18da1f5e82bb9c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7d1c65f24756bb9dad18da1f5e82bb9c">operations_research::sat::MinimizeWithHittingSetAndLazyEncoding</a></div><div class="ttdeci">SatSolver::Status MinimizeWithHittingSetAndLazyEncoding(const ObjectiveDefinition &objective_definition, const std::function< void()> &feasible_solution_observer, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l01759">optimization.cc:1759</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a8bea9a6a0de60c8fdab99ad7dfdf8498"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8bea9a6a0de60c8fdab99ad7dfdf8498">operations_research::sat::SolveIntegerProblem</a></div><div class="ttdeci">SatSolver::Status SolveIntegerProblem(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__search_8cc_source.html#l00900">integer_search.cc:900</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a96eab70b5ead3894afac4d4fff0fd984"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">operations_research::sat::Value</a></div><div class="ttdeci">std::function< int64_t(const Model &)> Value(IntegerVariable v)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01544">integer.h:1544</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aa4fe3dc3bb5374a3ae58ae0f551be128"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa4fe3dc3bb5374a3ae58ae0f551be128">operations_research::sat::SolveWithWPM1</a></div><div class="ttdeci">SatSolver::Status SolveWithWPM1(LogBehavior log, const LinearBooleanProblem &problem, SatSolver *solver, std::vector< bool > *solution)</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00467">optimization.cc:467</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aab5216003fbe0c2f21e7433084d358e1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1">operations_research::sat::IsAssignmentValid</a></div><div class="ttdeci">bool IsAssignmentValid(const LinearBooleanProblem &problem, const std::vector< bool > &assignment)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00362">boolean_problem.cc:362</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aae43e784db06c0974ce59ebbe8dd2b22"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">operations_research::sat::NegationOf</a></div><div class="ttdeci">std::vector< IntegerVariable > NegationOf(const std::vector< IntegerVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00029">integer.cc:29</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ab76a35e6ff810ad9ea8b58c7c11606cb"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab76a35e6ff810ad9ea8b58c7c11606cb">operations_research::sat::MinimizeCoreWithPropagation</a></div><div class="ttdeci">void MinimizeCoreWithPropagation(TimeLimit *limit, SatSolver *solver, std::vector< Literal > *core)</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00219">optimization.cc:219</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ab87119f7f6691eca8af4c552828fc4c4"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab87119f7f6691eca8af4c552828fc4c4">operations_research::sat::ProcessCore</a></div><div class="ttdeci">void ProcessCore(const std::vector< Literal > &core, Coefficient min_weight, std::deque< EncodingNode > *repository, std::vector< EncodingNode * > *nodes, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00446">encoding.cc:446</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_abb66766a5d79e878ff67851bc55ca24f"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f">operations_research::sat::ComputeObjectiveValue</a></div><div class="ttdeci">Coefficient ComputeObjectiveValue(const LinearBooleanProblem &problem, const std::vector< bool > &assignment)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00348">boolean_problem.cc:348</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ac8d4f52bbb23604c511dfeca406b1685"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ac8d4f52bbb23604c511dfeca406b1685">operations_research::sat::SolveWithFuMalik</a></div><div class="ttdeci">SatSolver::Status SolveWithFuMalik(LogBehavior log, const LinearBooleanProblem &problem, SatSolver *solver, std::vector< bool > *solution)</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00270">optimization.cc:270</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ad6c9cfad7e2fa7ae1bbff31720394436"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ad6c9cfad7e2fa7ae1bbff31720394436">operations_research::sat::MaxNodeWeightSmallerThan</a></div><div class="ttdeci">Coefficient MaxNodeWeightSmallerThan(const std::vector< EncodingNode * > &nodes, Coefficient upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00434">encoding.cc:434</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_adb8f016144f3565c4b693b59f9dc69b8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#adb8f016144f3565c4b693b59f9dc69b8">operations_research::sat::SolveWithRandomParameters</a></div><div class="ttdeci">SatSolver::Status SolveWithRandomParameters(LogBehavior log, const LinearBooleanProblem &problem, int num_times, SatSolver *solver, std::vector< bool > *solution)</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00764">optimization.cc:764</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ae471a0701f750ca0c32a3fe8828f04f2"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae471a0701f750ca0c32a3fe8828f04f2">operations_research::sat::SolveWithCardinalityEncoding</a></div><div class="ttdeci">SatSolver::Status SolveWithCardinalityEncoding(LogBehavior log, const LinearBooleanProblem &problem, SatSolver *solver, std::vector< bool > *solution)</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00890">optimization.cc:890</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ae787aad51dac94ee684cf971def30838"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838">operations_research::sat::ExtractAssignment</a></div><div class="ttdeci">void ExtractAssignment(const LinearBooleanProblem &problem, const SatSolver &solver, std::vector< bool > *assignment)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00052">boolean_problem.cc:52</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aea70549adb843d22d06bef763a0960c8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aea70549adb843d22d06bef763a0960c8">operations_research::sat::CreateInitialEncodingNodes</a></div><div class="ttdeci">std::vector< EncodingNode * > CreateInitialEncodingNodes(const std::vector< Literal > &literals, const std::vector< Coefficient > &coeffs, Coefficient *offset, std::deque< EncodingNode > *repository)</div><div class="ttdef"><b>Definition:</b> <a href="encoding_8cc_source.html#l00303">encoding.cc:303</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aef1ea7e6296a28c0fa0752328d8cb900"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aef1ea7e6296a28c0fa0752328d8cb900">operations_research::sat::RandomizeDecisionHeuristic</a></div><div class="ttdeci">void RandomizeDecisionHeuristic(URBG *random, SatParameters *parameters)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8h_source.html#l00109">sat/util.h:109</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_af6b2a98aa9ebc72821c544fac3e01238"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238">operations_research::sat::LogBehavior</a></div><div class="ttdeci">LogBehavior</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8h_source.html#l00047">optimization.h:47</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_af6b2a98aa9ebc72821c544fac3e01238a6c3f20e225309c66fdb5481433e5bd2f"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238a6c3f20e225309c66fdb5481433e5bd2f">operations_research::sat::STDOUT_LOG</a></div><div class="ttdeci">@ STDOUT_LOG</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8h_source.html#l00047">optimization.h:47</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_afd482f2c4b9533b4d1f7379a578e9b18"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18">operations_research::sat::kCoefficientMax</a></div><div class="ttdeci">const Coefficient kCoefficientMax(std::numeric_limits< Coefficient::ValueType >::max())</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_affe1669ec9e0e7cbd54e895bbbff43af"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#affe1669ec9e0e7cbd54e895bbbff43af">operations_research::sat::MinimizeIntegerVariableWithLinearScanAndLazyEncoding</a></div><div class="ttdeci">SatSolver::Status MinimizeIntegerVariableWithLinearScanAndLazyEncoding(IntegerVariable objective_var, const std::function< void()> &feasible_solution_observer, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l01060">optimization.cc:1060</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a87d7aa58897e0042898d1c2207deda18"><div class="ttname"><a href="namespaceoperations__research.html#a87d7aa58897e0042898d1c2207deda18">operations_research::ProtobufShortDebugString</a></div><div class="ttdeci">std::string ProtobufShortDebugString(const P &message)</div><div class="ttdef"><b>Definition:</b> <a href="port_2proto__utils_8h_source.html#l00037">port/proto_utils.h:37</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aeaeaf340789f2dd271dcf9204279cb1ba9cff14a44a54cc44f4b91d65e8cd73b1"><div class="ttname"><a href="namespaceoperations__research.html#aeaeaf340789f2dd271dcf9204279cb1ba9cff14a44a54cc44f4b91d65e8cd73b1">operations_research::MPSOLVER_OPTIMAL</a></div><div class="ttdeci">@ MPSOLVER_OPTIMAL</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l00236">linear_solver.pb.h:236</a></div></div>
|
|
<div class="ttc" id="anamespacestd_html"><div class="ttname"><a href="namespacestd.html">std</a></div><div class="ttdoc">STL namespace.</div></div>
|
|
<div class="ttc" id="aoptimization_8cc_html_a829582ce81a6c838e6f9c73c78814cff"><div class="ttname"><a href="optimization_8cc.html#a829582ce81a6c838e6f9c73c78814cff">core_index</a></div><div class="ttdeci">int core_index</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00086">optimization.cc:86</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#l00085">optimization.cc:85</a></div></div>
|
|
<div class="ttc" id="aoptimization_8h_html"><div class="ttname"><a href="optimization_8h.html">optimization.h</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_a4255f714cea26cdd64f6a0ee72d34a8c"><div class="ttname"><a href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a></div><div class="ttdeci">int64_t weight</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00510">pack.cc:510</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00509">pack.cc:509</a></div></div>
|
|
<div class="ttc" id="apb__constraint_8h_html"><div class="ttname"><a href="pb__constraint_8h.html">pb_constraint.h</a></div></div>
|
|
<div class="ttc" id="aport_2proto__utils_8h_html"><div class="ttname"><a href="port_2proto__utils_8h.html">proto_utils.h</a></div></div>
|
|
<div class="ttc" id="arandom_8h_html"><div class="ttname"><a href="random_8h.html">random.h</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a75d7b5e4cab1e156cc7a2c5eba1e16f1"><div class="ttname"><a href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a></div><div class="ttdeci">int64_t cost</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00152">routing_flow.cc:152</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_a6b7983ccd32c86cbbc3d4d9cda4cac17"><div class="ttname"><a href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a></div><div class="ttdeci">int nodes</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03686">routing_search.cc:3686</a></div></div>
|
|
<div class="ttc" id="asat_2util_8h_html"><div class="ttname"><a href="sat_2util_8h.html">util.h</a></div></div>
|
|
<div class="ttc" id="asat__parameters_8pb_8h_html"><div class="ttname"><a href="sat__parameters_8pb_8h.html">sat_parameters.pb.h</a></div></div>
|
|
<div class="ttc" id="astl__util_8h_html"><div class="ttname"><a href="stl__util_8h.html">stl_util.h</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_integer_literal_html_a3e2eb445631727dd4abf1d5343f16b2f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">operations_research::sat::IntegerLiteral::LowerOrEqual</a></div><div class="ttdeci">static IntegerLiteral LowerOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01315">integer.h:1315</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_integer_literal_html_a6c233aafac25ea66d69de93a83c9be63"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">operations_research::sat::IntegerLiteral::GreaterOrEqual</a></div><div class="ttdeci">static IntegerLiteral GreaterOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01309">integer.h:1309</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_literal_with_coeff_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">operations_research::sat::LiteralWithCoeff</a></div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00050">pb_constraint.h:50</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_objective_definition_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_objective_definition.html">operations_research::sat::ObjectiveDefinition</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__mapping_8h_source.html#l00040">cp_model_mapping.h:40</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_objective_definition_html_a4053d5aed2a34995e0aeb2042878ca7a"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_objective_definition.html#a4053d5aed2a34995e0aeb2042878ca7a">operations_research::sat::ObjectiveDefinition::coeffs</a></div><div class="ttdeci">std::vector< IntegerValue > coeffs</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__mapping_8h_source.html#l00050">cp_model_mapping.h:50</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_objective_definition_html_a73e4094f2d4e2adbe5e8d79a5b61fcd1"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_objective_definition.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">operations_research::sat::ObjectiveDefinition::vars</a></div><div class="ttdeci">std::vector< IntegerVariable > vars</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__mapping_8h_source.html#l00049">cp_model_mapping.h:49</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_objective_definition_html_aa3c0b31567c91babfffd5f9afc3161dc"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_objective_definition.html#aa3c0b31567c91babfffd5f9afc3161dc">operations_research::sat::ObjectiveDefinition::objective_var</a></div><div class="ttdeci">IntegerVariable objective_var</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__mapping_8h_source.html#l00043">cp_model_mapping.h:43</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_objective_definition_html_adb0775f26a8a26bbd760d700d66c5281"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_objective_definition.html#adb0775f26a8a26bbd760d700d66c5281">operations_research::sat::ObjectiveDefinition::ScaleIntegerObjective</a></div><div class="ttdeci">double ScaleIntegerObjective(IntegerValue value) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__mapping_8h_source.html#l00057">cp_model_mapping.h:57</a></div></div>
|
|
<div class="ttc" id="atime__limit_8h_html"><div class="ttname"><a href="time__limit_8h.html">time_limit.h</a></div></div>
|
|
<div class="ttc" id="atimer_8h_html"><div class="ttname"><a href="timer_8h.html">timer.h</a></div></div>
|
|
<div class="ttc" id="atrace_8cc_html_a36bd74109f547f7f8198faf5a12d2879"><div class="ttname"><a href="trace_8cc.html#a36bd74109f547f7f8198faf5a12d2879">message</a></div><div class="ttdeci">std::string message</div><div class="ttdef"><b>Definition:</b> <a href="trace_8cc_source.html#l00398">trace.cc:398</a></div></div>
|
|
<div class="ttc" id="avlog__is__on_8h_html_a956152cad330225654d128f35c00efce"><div class="ttname"><a href="vlog__is__on_8h.html#a956152cad330225654d128f35c00efce">VLOG_IS_ON</a></div><div class="ttdeci">#define VLOG_IS_ON(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="vlog__is__on_8h_source.html#l00041">vlog_is_on.h:41</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="optimization_8cc.html">optimization.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.2 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|