3149 lines
608 KiB
HTML
3149 lines
608 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.20"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: linear_programming_constraint.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">8.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.20 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('linear__programming__constraint_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">linear_programming_constraint.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="linear__programming__constraint_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="linear__programming__constraint_8h.html">ortools/sat/linear_programming_constraint.h</a>"</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  </div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <cmath></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <iterator></span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  </div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "absl/numeric/int128.h"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="commandlineflags_8h.html">ortools/base/commandlineflags.h</a>"</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</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 name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="mathutil_8h.html">ortools/base/mathutil.h</a>"</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</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 name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include "<a class="code" href="strong__vector_8h.html">ortools/base/strong_vector.h</a>"</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include "<a class="code" href="parameters_8pb_8h.html">ortools/glop/parameters.pb.h</a>"</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include "<a class="code" href="preprocessor_8h.html">ortools/glop/preprocessor.h</a>"</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include "<a class="code" href="status_8h.html">ortools/glop/status.h</a>"</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include "<a class="code" href="strongly__connected__components_8h.html">ortools/graph/strongly_connected_components.h</a>"</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include "<a class="code" href="lp__types_8h.html">ortools/lp_data/lp_types.h</a>"</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include "<a class="code" href="implied__bounds_8h.html">ortools/sat/implied_bounds.h</a>"</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>"</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor">#include "<a class="code" href="zero__half__cuts_8h.html">ortools/sat/zero_half_cuts.h</a>"</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#include "<a class="code" href="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.h</a>"</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  </div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  </div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="keyword">using</span> glop::ColIndex;</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="keyword">using</span> <a class="code" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">glop::Fractional</a>;</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="keyword">using</span> glop::RowIndex;</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  </div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="keyword">const</span> <span class="keywordtype">double</span> LinearProgrammingConstraint::kCpEpsilon = 1e-4;</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="keyword">const</span> <span class="keywordtype">double</span> LinearProgrammingConstraint::kLpEpsilon = 1e-6;</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  </div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#ab2fc4510692e040b62507dce522e0e31"> 53</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#ab2fc4510692e040b62507dce522e0e31">ScatteredIntegerVector::ClearAndResize</a>(<span class="keywordtype">int</span> size) {</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">if</span> (is_sparse_) {</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> glop::ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> : non_zeros_) {</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  dense_vector_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = IntegerValue(0);</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  }</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  dense_vector_.<a class="code" href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(size, IntegerValue(0));</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  dense_vector_.<a class="code" href="classabsl_1_1_strong_vector.html#a184fe69018ae421dcf31c964bfe40576">assign</a>(size, IntegerValue(0));</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  }</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> glop::ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> : non_zeros_) {</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  is_zeros_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  }</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  is_zeros_.<a class="code" href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(size, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  non_zeros_.clear();</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  is_sparse_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> }</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  </div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#a4940f758f3c0e757a4bcb5bbf795ce67"> 70</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#a4940f758f3c0e757a4bcb5bbf795ce67">ScatteredIntegerVector::Add</a>(glop::ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>, IntegerValue <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>) {</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> add = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>.value(), dense_vector_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>].value());</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">if</span> (add == <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a> || add == <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  dense_vector_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = IntegerValue(add);</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">if</span> (is_sparse_ && is_zeros_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>]) {</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  is_zeros_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  non_zeros_.push_back(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>);</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  }</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> }</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  </div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#aeb3044e58e1e28e857c5265734ae7e30"> 81</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#aeb3044e58e1e28e857c5265734ae7e30">ScatteredIntegerVector::AddLinearExpressionMultiple</a>(</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  IntegerValue multiplier,</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keyword">const</span> std::vector<std::pair<glop::ColIndex, IntegerValue>>& terms) {</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> threshold = 0.1 * <span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(dense_vector_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>());</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">if</span> (is_sparse_ && <span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(terms.size()) < threshold) {</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair<glop::ColIndex, IntegerValue> term : terms) {</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">if</span> (is_zeros_[term.first]) {</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  is_zeros_[term.first] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  non_zeros_.push_back(term.first);</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  }</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">AddProductTo</a>(multiplier, term.second, &dense_vector_[term.first])) {</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  }</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  }</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">if</span> (<span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(non_zeros_.size()) < threshold) {</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  is_sparse_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  is_sparse_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair<glop::ColIndex, IntegerValue> term : terms) {</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">AddProductTo</a>(multiplier, term.second, &dense_vector_[term.first])) {</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  }</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  }</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> }</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  </div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#a1077b795353fa06d7705f43377bedfe9"> 109</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#a1077b795353fa06d7705f43377bedfe9">ScatteredIntegerVector::ConvertToLinearConstraint</a>(</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& integer_variables,</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  IntegerValue upper_bound, <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>* result) {</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  result-><a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.clear();</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  result-><a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>.clear();</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">if</span> (is_sparse_) {</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  std::sort(non_zeros_.begin(), non_zeros_.end());</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> glop::ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> : non_zeros_) {</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keyword">const</span> IntegerValue coeff = dense_vector_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>];</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">if</span> (coeff == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  result-><a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.push_back(integer_variables[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>.value()]);</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  result-><a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>.push_back(coeff);</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  }</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = dense_vector_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>();</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">for</span> (glop::ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>(0); <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < size; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">const</span> IntegerValue coeff = dense_vector_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>];</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">if</span> (coeff == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  result-><a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.push_back(integer_variables[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>.value()]);</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  result-><a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>.push_back(coeff);</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  }</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  }</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  result-><a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">lb</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  result-><a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a> = upper_bound;</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> }</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  </div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> std::vector<std::pair<glop::ColIndex, IntegerValue>></div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#abd20bd618d3e097f3b59958764460578"> 136</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#abd20bd618d3e097f3b59958764460578">ScatteredIntegerVector::GetTerms</a>() {</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  std::vector<std::pair<glop::ColIndex, IntegerValue>> result;</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordflow">if</span> (is_sparse_) {</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  std::sort(non_zeros_.begin(), non_zeros_.end());</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> glop::ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> : non_zeros_) {</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">const</span> IntegerValue coeff = dense_vector_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>];</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">if</span> (coeff != 0) result.push_back({<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>, coeff});</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  }</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = dense_vector_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>();</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">for</span> (glop::ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>(0); <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < size; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">const</span> IntegerValue coeff = dense_vector_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>];</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">if</span> (coeff != 0) result.push_back({<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>, coeff});</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  }</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  }</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> }</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  </div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment">// TODO(user): make SatParameters singleton too, otherwise changing them after</span></div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment">// a constraint was added will have no effect on this class.</span></div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a8172ae7d172bec9d3a417ddcaab7c474"> 156</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a8172ae7d172bec9d3a417ddcaab7c474">LinearProgrammingConstraint::LinearProgrammingConstraint</a>(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  : constraint_manager_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>),</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  sat_parameters_(*(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<SatParameters>())),</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  model_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>),</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  time_limit_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>>()),</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  integer_trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>()),</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>()),</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  integer_encoder_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>()),</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  random_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_model_random_generator.html">ModelRandomGenerator</a>>()),</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  implied_bounds_processor_({}, integer_trail_,</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds.html">ImpliedBounds</a>>()),</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  dispatcher_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_dispatcher.html">LinearProgrammingDispatcher</a>>()),</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  expanded_lp_solution_(</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  *<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="structoperations__research_1_1sat_1_1_linear_programming_constraint_lp_solution.html">LinearProgrammingConstraintLpSolution</a>>()) {</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// Tweak the default parameters to make the solve incremental.</span></div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  glop::GlopParameters <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>;</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.set_use_dual_simplex(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  simplex_.SetParameters(<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>);</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">if</span> (sat_parameters_.use_branching_in_lp() ||</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  sat_parameters_.search_branching() == SatParameters::LP_SEARCH) {</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  compute_reduced_cost_averages_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  }</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  </div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">// Register our local rev int repository.</span></div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  integer_trail_->RegisterReversibleClass(&rc_rev_int_repository_);</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span> }</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  </div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a9128c8abe6a695b34a5fa05169114c39"> 183</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a9128c8abe6a695b34a5fa05169114c39">LinearProgrammingConstraint::~LinearProgrammingConstraint</a>() {</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Total number of simplex iterations: "</span></div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  << total_num_simplex_iterations_;</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_solves_by_status_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">if</span> (num_solves_by_status_[i] == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"#"</span> << <a class="code" href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9">glop::ProblemStatus</a>(i) << <span class="stringliteral">" : "</span></div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  << num_solves_by_status_[i];</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  }</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span> }</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  </div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#aaac2d8dee4d7fc8d5e9a1b1cfc3021bc"> 193</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#aaac2d8dee4d7fc8d5e9a1b1cfc3021bc">LinearProgrammingConstraint::AddLinearConstraint</a>(</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>) {</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!lp_constraint_is_registered_);</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  constraint_manager_.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a40e3f0f21a2c16b673c84f734ba6d095">Add</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  </div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// We still create the mirror variable right away though.</span></div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="comment">// TODO(user): clean this up? Note that it is important that the variable</span></div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="comment">// in lp_data_ never changes though, so we can restart from the current</span></div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">// lp solution and be incremental (even if the constraints changed).</span></div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.vars) {</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  GetOrCreateMirrorVariable(<a class="code" href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">PositiveVariable</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  }</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span> }</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  </div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span> glop::ColIndex LinearProgrammingConstraint::GetOrCreateMirrorVariable(</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  IntegerVariable positive_variable) {</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#ae2544d2a3a5ef4c78f8e5891f104ab41">VariableIsPositive</a>(positive_variable));</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keyword">const</span> <span class="keyword">auto</span> it = mirror_lp_variable_.find(positive_variable);</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">if</span> (it == mirror_lp_variable_.end()) {</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keyword">const</span> glop::ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>(integer_variables_.size());</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  implied_bounds_processor_.<a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#a07e1de12d9a4b00c96911544e72b86d4">AddLpVariable</a>(positive_variable);</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  mirror_lp_variable_[positive_variable] = <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>;</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  integer_variables_.push_back(positive_variable);</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  lp_solution_.push_back(std::numeric_limits<double>::infinity());</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  lp_reduced_cost_.push_back(0.0);</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  (*dispatcher_)[positive_variable] = <span class="keyword">this</span>;</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  </div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(positive_variable.value(),</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(positive_variable).<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>());</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> >= expanded_lp_solution_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) {</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  expanded_lp_solution_.<a class="code" href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> + 1, 0.0);</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  }</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordflow">return</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>;</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  }</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">return</span> it->second;</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span> }</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  </div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#ae384be06329c4c8f8fd62af7335dae2e"> 231</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#ae384be06329c4c8f8fd62af7335dae2e">LinearProgrammingConstraint::SetObjectiveCoefficient</a>(IntegerVariable ivar,</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  IntegerValue coeff) {</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!lp_constraint_is_registered_);</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  objective_is_defined_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  IntegerVariable pos_var = <a class="code" href="namespaceoperations__research_1_1sat.html#ae2544d2a3a5ef4c78f8e5891f104ab41">VariableIsPositive</a>(ivar) ? ivar : <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(ivar);</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">if</span> (ivar != pos_var) coeff = -coeff;</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  </div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  constraint_manager_.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a36295bfe464bcdb6465fe796a43d02bf">SetObjectiveCoefficient</a>(pos_var, coeff);</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keyword">const</span> glop::ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = GetOrCreateMirrorVariable(pos_var);</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  integer_objective_.push_back({<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>, coeff});</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  objective_infinity_norm_ =</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(objective_infinity_norm_, <a class="code" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(coeff));</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span> }</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  </div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="comment">// TODO(user): As the search progress, some variables might get fixed. Exploit</span></div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="comment">// this to reduce the number of variables in the LP and in the</span></div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="comment">// ConstraintManager? We might also detect during the search that two variable</span></div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span> <span class="comment">// are equivalent.</span></div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="comment">// TODO(user): On TSP/VRP with a lot of cuts, this can take 20% of the overall</span></div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="comment">// running time. We should be able to almost remove most of this from the</span></div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="comment">// profile by being more incremental (modulo LP scaling).</span></div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="comment">// TODO(user): A longer term idea for LP with a lot of variables is to not</span></div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment">// add all variables to each LP solve and do some "sifting". That can be useful</span></div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="comment">// for TSP for instance where the number of edges is large, but only a small</span></div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="comment">// fraction will be used in the optimal solution.</span></div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="keywordtype">bool</span> LinearProgrammingConstraint::CreateLpFromConstraintManager() {</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="comment">// Fill integer_lp_.</span></div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  integer_lp_.<a class="code" href="classabsl_1_1_strong_vector.html#ac8bb3912a3ce86b15842e79d0b421204">clear</a>();</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  infinity_norms_.<a class="code" href="classabsl_1_1_strong_vector.html#ac8bb3912a3ce86b15842e79d0b421204">clear</a>();</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& all_constraints = constraint_manager_.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a71a79a003419f05324e7951f69265701">AllConstraints</a>();</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> : constraint_manager_.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a84ae5ff883fcce91f758a729af446864">LpConstraints</a>()) {</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = all_constraints[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].constraint;</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  </div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  integer_lp_.<a class="code" href="classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(LinearConstraintInternal());</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  LinearConstraintInternal& new_ct = integer_lp_.<a class="code" href="classabsl_1_1_strong_vector.html#af71e6c1eccbc12e9339c00a86a981a43">back</a>();</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  new_ct.lb = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.lb;</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  new_ct.ub = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.ub;</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.vars.size();</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  IntegerValue infinity_norm(0);</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordflow">if</span> (<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.lb > <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.ub) {</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Trivial infeasible bound in an LP constraint"</span>;</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  }</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keywordflow">if</span> (<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.lb > <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>) {</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  infinity_norm = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(infinity_norm, <a class="code" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.lb));</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  }</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">if</span> (<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.ub < <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>) {</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  infinity_norm = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(infinity_norm, <a class="code" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.ub));</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  }</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="comment">// We only use positive variable inside this class.</span></div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.vars[i];</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  IntegerValue coeff = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.coeffs[i];</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research_1_1sat.html#ae2544d2a3a5ef4c78f8e5891f104ab41">VariableIsPositive</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) {</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  coeff = -coeff;</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  }</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  infinity_norm = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(infinity_norm, <a class="code" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(coeff));</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  new_ct.terms.push_back({GetOrCreateMirrorVariable(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>), coeff});</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  }</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  infinity_norms_.<a class="code" href="classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(infinity_norm);</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  </div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="comment">// Important to keep lp_data_ "clean".</span></div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  std::sort(new_ct.terms.begin(), new_ct.terms.end());</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  }</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  </div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="comment">// Copy the integer_lp_ into lp_data_.</span></div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < integer_variables_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(glop::ColIndex(i), lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a695ac3d8db5a986f572711f2ef3a6a39">CreateNewVariable</a>());</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  }</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  </div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="comment">// We remove fixed variables from the objective. This should help the LP</span></div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="comment">// scaling, but also our integer reason computation.</span></div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordtype">int</span> new_size = 0;</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  objective_infinity_norm_ = 0;</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> entry : integer_objective_) {</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = integer_variables_[entry.first.value()];</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac746d3665776d57cb5ecd46fbdda7de7">IsFixedAtLevelZero</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) {</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  integer_objective_offset_ +=</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  entry.second * integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  }</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  objective_infinity_norm_ =</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(objective_infinity_norm_, <a class="code" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(entry.second));</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  integer_objective_[new_size++] = entry;</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#ab5af7f232cddcd91f70be84c0d398ba9">SetObjectiveCoefficient</a>(entry.first, <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(entry.second));</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  }</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  objective_infinity_norm_ =</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(objective_infinity_norm_, <a class="code" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(integer_objective_offset_));</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  integer_objective_.resize(new_size);</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a2a29cc40908e09b0c565ceea15b77d89">SetObjectiveOffset</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_objective_offset_));</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  </div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> LinearConstraintInternal& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> : integer_lp_) {</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a67a7327915e66c0514cfa465a0475be1">ConstraintIndex</a> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#ad9d564651057c77b3f2ca1293134557f">CreateNewConstraint</a>();</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a62b98dec38b6506442f9fc63f1a9b88f">SetConstraintBounds</a>(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.lb), <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.ub));</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& term : <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.terms) {</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a2d695f450ae446d5d9c225b991f8d88e">SetCoefficient</a>(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, term.first, <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(term.second));</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  }</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  }</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#aab451f1144133e621abdcd566c048a8d">NotifyThatColumnsAreClean</a>();</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  </div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="comment">// We scale the LP using the level zero bounds that we later override</span></div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="comment">// with the current ones.</span></div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="comment">// TODO(user): As part of the scaling, we may also want to shift the initial</span></div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="comment">// variable bounds so that each variable contain the value zero in their</span></div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="comment">// domain. Maybe just once and for all at the beginning.</span></div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = integer_variables_.size();</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; i++) {</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keyword">const</span> IntegerVariable cp_var = integer_variables_[i];</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lb = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(cp_var));</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> ub = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(cp_var));</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a0fe7ba825c8c6cd1efdcff6dec631093">SetVariableBounds</a>(glop::ColIndex(i), lb, ub);</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  }</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  </div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="comment">// TODO(user): As we have an idea of the LP optimal after the first solves,</span></div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="comment">// maybe we can adapt the scaling accordingly.</span></div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  glop::GlopParameters params;</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  params.set_cost_scaling(glop::GlopParameters::MEAN_COST_SCALING);</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  scaler_.<a class="code" href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a306cb123e8da242a6daf1c397dfe6e73">Scale</a>(params, &lp_data_);</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  UpdateBoundsOfLpVariables();</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  </div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="comment">// Set the information for the step to polish the LP basis. All our variables</span></div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="comment">// are integer, but for now, we just try to minimize the fractionality of the</span></div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="comment">// binary variables.</span></div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordflow">if</span> (sat_parameters_.polish_lp_solution()) {</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#aa4dc78f942e63df8b0bf3b95c7af7068">ClearIntegralityScales</a>();</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; ++i) {</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keyword">const</span> IntegerVariable cp_var = integer_variables_[i];</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keyword">const</span> IntegerValue lb = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(cp_var);</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keyword">const</span> IntegerValue ub = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(cp_var);</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">if</span> (lb != 0 || ub != 1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a2638e7353203c8cb214228147a5e504a">SetIntegralityScale</a>(</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  glop::ColIndex(i),</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  1.0 / scaler_.<a class="code" href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a5eb3e38eae8f5143d627e8c85aff8cd7">VariableScalingFactor</a>(glop::ColIndex(i)));</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  }</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  }</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  </div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#aab451f1144133e621abdcd566c048a8d">NotifyThatColumnsAreClean</a>();</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#aa23a76f0f582369176688b458cda07dc">AddSlackVariablesWhereNecessary</a>(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"LP relaxation: "</span> << lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#adcc58612f6a1dc35ff3ffdb34188f299">GetDimensionString</a>() << <span class="stringliteral">". "</span></div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  << constraint_manager_.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a71a79a003419f05324e7951f69265701">AllConstraints</a>().size()</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  << <span class="stringliteral">" Managed constraints."</span>;</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span> }</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  </div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span> LPSolveInfo LinearProgrammingConstraint::SolveLpForBranching() {</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  LPSolveInfo info;</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  glop::BasisState basis_state = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#adfbae19f81ecf38f67643dc8b7dcec25">GetState</a>();</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  </div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keyword">const</span> glop::Status status = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a866a68af5afd0355fb348f7a59eeff9e">Solve</a>(lp_data_, time_limit_);</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  total_num_simplex_iterations_ += simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a3269053b931945d67fbd50f3bd95f37f">GetNumberOfIterations</a>();</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ac4d90743acfe39707571f84f096a58d7">LoadStateForNextSolve</a>(basis_state);</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">if</span> (!status.ok()) {</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"The LP solver encountered an error: "</span> << status.error_message();</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  info.status = <a class="code" href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9a88ec4386a3c49b50819358a579fb9adb">glop::ProblemStatus::ABNORMAL</a>;</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordflow">return</span> info;</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  }</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  info.status = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>();</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordflow">if</span> (info.status == <a class="code" href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9af00c8dbdd6e1f11bdae06be94277d293">glop::ProblemStatus::OPTIMAL</a> ||</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  info.status == glop::ProblemStatus::DUAL_FEASIBLE) {</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="comment">// Record the objective bound.</span></div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  info.lp_objective = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a96c1f660991b5007ca24564f69cd27b8">GetObjectiveValue</a>();</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  info.new_obj_bound = IntegerValue(</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keyword">static_cast<</span><a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a><span class="keyword">></span>(std::ceil(info.lp_objective - kCpEpsilon)));</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  }</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">return</span> info;</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span> }</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  </div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span> <span class="keywordtype">void</span> LinearProgrammingConstraint::FillReducedCostReasonIn(</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research_1_1glop.html#a4dc8ae0f97c4110f3cc770715b2bbd12">glop::DenseRow</a>& reduced_costs,</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  std::vector<IntegerLiteral>* integer_reason) {</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  integer_reason->clear();</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = integer_variables_.size();</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; i++) {</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> rc = reduced_costs[glop::ColIndex(i)];</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordflow">if</span> (rc > kLpEpsilon) {</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  integer_reason->push_back(</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(integer_variables_[i]));</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rc < -kLpEpsilon) {</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  integer_reason->push_back(</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(integer_variables_[i]));</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  }</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  }</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  </div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#adfce09ac65fc660f8a4f019f4072c6a7">RemoveLevelZeroBounds</a>(integer_reason);</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span> }</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  </div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="keywordtype">bool</span> LinearProgrammingConstraint::BranchOnVar(IntegerVariable positive_var) {</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="comment">// From the current LP solution, branch on the given var if fractional.</span></div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(lp_solution_is_set_);</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> current_value = <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a460fe5216ff7f997841e588d432be744">GetSolutionValue</a>(positive_var);</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(std::abs(current_value - std::round(current_value)), kCpEpsilon);</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  </div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="comment">// Used as empty reason in this method.</span></div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  integer_reason_.clear();</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  </div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordtype">bool</span> deductions_were_made = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  </div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  UpdateBoundsOfLpVariables();</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  </div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keyword">const</span> IntegerValue current_obj_lb = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(objective_cp_);</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="comment">// This will try to branch in both direction around the LP value of the</span></div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="comment">// given variable and push any deduction done this way.</span></div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  </div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keyword">const</span> glop::ColIndex lp_var = GetOrCreateMirrorVariable(positive_var);</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> current_lb = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(positive_var));</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> current_ub = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(positive_var));</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> factor = scaler_.<a class="code" href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a5eb3e38eae8f5143d627e8c85aff8cd7">VariableScalingFactor</a>(lp_var);</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keywordflow">if</span> (current_value < current_lb || current_value > current_ub) {</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  }</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  </div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="comment">// Form LP1 var <= floor(current_value)</span></div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> new_ub = std::floor(current_value);</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a0fe7ba825c8c6cd1efdcff6dec631093">SetVariableBounds</a>(lp_var, current_lb * factor, new_ub * factor);</div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  </div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  LPSolveInfo lower_branch_info = SolveLpForBranching();</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordflow">if</span> (lower_branch_info.status != <a class="code" href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9af00c8dbdd6e1f11bdae06be94277d293">glop::ProblemStatus::OPTIMAL</a> &&</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  lower_branch_info.status != glop::ProblemStatus::DUAL_FEASIBLE &&</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  lower_branch_info.status != glop::ProblemStatus::DUAL_UNBOUNDED) {</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  }</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  </div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keywordflow">if</span> (lower_branch_info.status == glop::ProblemStatus::DUAL_UNBOUNDED) {</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="comment">// Push the other branch.</span></div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keyword">const</span> IntegerLiteral deduction = <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  positive_var, IntegerValue(std::ceil(current_value)));</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(deduction, {}, integer_reason_)) {</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  }</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  deductions_were_made = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (lower_branch_info.new_obj_bound <= current_obj_lb) {</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  }</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  </div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="comment">// Form LP2 var >= ceil(current_value)</span></div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> new_lb = std::ceil(current_value);</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a0fe7ba825c8c6cd1efdcff6dec631093">SetVariableBounds</a>(lp_var, new_lb * factor, current_ub * factor);</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  </div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  LPSolveInfo upper_branch_info = SolveLpForBranching();</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keywordflow">if</span> (upper_branch_info.status != <a class="code" href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9af00c8dbdd6e1f11bdae06be94277d293">glop::ProblemStatus::OPTIMAL</a> &&</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  upper_branch_info.status != glop::ProblemStatus::DUAL_FEASIBLE &&</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  upper_branch_info.status != glop::ProblemStatus::DUAL_UNBOUNDED) {</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keywordflow">return</span> deductions_were_made;</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  }</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  </div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordflow">if</span> (upper_branch_info.status == glop::ProblemStatus::DUAL_UNBOUNDED) {</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="comment">// Push the other branch if not infeasible.</span></div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordflow">if</span> (lower_branch_info.status != glop::ProblemStatus::DUAL_UNBOUNDED) {</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keyword">const</span> IntegerLiteral deduction = <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  positive_var, IntegerValue(std::floor(current_value)));</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(deduction, {}, integer_reason_)) {</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="keywordflow">return</span> deductions_were_made;</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  }</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  deductions_were_made = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  }</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (upper_branch_info.new_obj_bound <= current_obj_lb) {</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="keywordflow">return</span> deductions_were_made;</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  }</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  </div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  IntegerValue approximate_obj_lb = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  </div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keywordflow">if</span> (lower_branch_info.status == glop::ProblemStatus::DUAL_UNBOUNDED &&</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  upper_branch_info.status == glop::ProblemStatus::DUAL_UNBOUNDED) {</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a6d55b5b9adc499095dd57dd0c2b6c7df">ReportConflict</a>(integer_reason_);</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (lower_branch_info.status == glop::ProblemStatus::DUAL_UNBOUNDED) {</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  approximate_obj_lb = upper_branch_info.new_obj_bound;</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (upper_branch_info.status == glop::ProblemStatus::DUAL_UNBOUNDED) {</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  approximate_obj_lb = lower_branch_info.new_obj_bound;</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  approximate_obj_lb = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(lower_branch_info.new_obj_bound,</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  upper_branch_info.new_obj_bound);</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  }</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  </div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="comment">// NOTE: On some problems, the approximate_obj_lb could be inexact which add</span></div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="comment">// some tolerance to CP-SAT where currently there is none.</span></div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordflow">if</span> (approximate_obj_lb <= current_obj_lb) <span class="keywordflow">return</span> deductions_were_made;</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  </div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="comment">// Push the bound to the trail.</span></div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keyword">const</span> IntegerLiteral deduction =</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(objective_cp_, approximate_obj_lb);</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(deduction, {}, integer_reason_)) {</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordflow">return</span> deductions_were_made;</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  }</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  </div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span> }</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  </div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a51cf34a6b42aa05c92f9b0b971b03dc9"> 523</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a51cf34a6b42aa05c92f9b0b971b03dc9">LinearProgrammingConstraint::RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!lp_constraint_is_registered_);</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  lp_constraint_is_registered_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint_collection.html">LinearProgrammingConstraintCollection</a>>()->push_back(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  </div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="comment">// Note fdid, this is not really needed by should lead to better cache</span></div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="comment">// locality.</span></div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  std::sort(integer_objective_.begin(), integer_objective_.end());</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  </div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="comment">// Set the LP to its initial content.</span></div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordflow">if</span> (!sat_parameters_.add_lp_constraints_lazily()) {</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  constraint_manager_.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a87cc96a3e72099107712a0386d89d851">AddAllConstraintsToLp</a>();</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  }</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="keywordflow">if</span> (!CreateLpFromConstraintManager()) {</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>()->NotifyThatModelIsUnsat();</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  }</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  </div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>();</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> watcher_id = watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adeee4ac52bfe0f1b48ee8958bb88b4e3">Register</a>(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = integer_variables_.size();</div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; i++) {</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ab2c396c33db5bd5eab32d398c3d55646">WatchIntegerVariable</a>(integer_variables_[i], watcher_id, i);</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  }</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keywordflow">if</span> (objective_is_defined_) {</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ac9d426060b1b7eee72e9e5345379f111">WatchUpperBound</a>(objective_cp_, watcher_id);</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  }</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adc5598223a363c10d95c00395145bcc6">SetPropagatorPriority</a>(watcher_id, 2);</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a2f8078e3c74ab15964ea42801732313a">AlwaysCallAtLevelZero</a>(watcher_id);</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  </div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="comment">// Registering it with the trail make sure this class is always in sync when</span></div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="comment">// it is used in the decision heuristics.</span></div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ae517412fa6f592ccb7c8e0f1569ba983">RegisterReversibleClass</a>(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8963fd33e7bd70e749b2a37060ef1274">RegisterReversibleInt</a>(watcher_id, &rev_optimal_constraints_size_);</div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span> }</div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  </div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#abd4d63996bf53e4b9251cc9fac30040d"> 559</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#abd4d63996bf53e4b9251cc9fac30040d">LinearProgrammingConstraint::SetLevel</a>(<span class="keywordtype">int</span> level) {</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  optimal_constraints_.resize(rev_optimal_constraints_size_);</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordflow">if</span> (lp_solution_is_set_ && level < lp_solution_level_) {</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  lp_solution_is_set_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  }</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  </div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="comment">// Special case for level zero, we "reload" any previously known optimal</span></div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="comment">// solution from that level.</span></div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="comment">// TODO(user): Keep all optimal solution in the current branch?</span></div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="comment">// TODO(user): Still try to add cuts/constraints though!</span></div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="keywordflow">if</span> (level == 0 && !level_zero_lp_solution_.empty()) {</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  lp_solution_is_set_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  lp_solution_ = level_zero_lp_solution_;</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  lp_solution_level_ = 0;</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < lp_solution_.size(); i++) {</div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  expanded_lp_solution_[integer_variables_[i]] = lp_solution_[i];</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  expanded_lp_solution_[<a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(integer_variables_[i])] =</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  -lp_solution_[i];</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  }</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  }</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span> }</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  </div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#aefa083730af18963c9bfd9915b5cd187"> 582</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#aefa083730af18963c9bfd9915b5cd187">LinearProgrammingConstraint::AddCutGenerator</a>(<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> generator) {</div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : generator.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>) {</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  GetOrCreateMirrorVariable(<a class="code" href="namespaceoperations__research_1_1sat.html#ae2544d2a3a5ef4c78f8e5891f104ab41">VariableIsPositive</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) ? <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  }</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  cut_generators_.push_back(std::move(generator));</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span> }</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  </div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#aadd64e5df937ad4d29342ef997d6b9fc"> 589</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#aadd64e5df937ad4d29342ef997d6b9fc">LinearProgrammingConstraint::IncrementalPropagate</a>(</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keyword">const</span> std::vector<int>& watch_indices) {</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordflow">if</span> (!lp_solution_is_set_) <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a0010273383670a7c67b3b8f2660aa06b">Propagate</a>();</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  </div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="comment">// At level zero, if there is still a chance to add cuts or lazy constraints,</span></div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="comment">// we re-run the LP.</span></div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == 0 && !lp_at_level_zero_is_final_) {</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a0010273383670a7c67b3b8f2660aa06b">Propagate</a>();</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  }</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  </div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="comment">// Check whether the change breaks the current LP solution. If it does, call</span></div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="comment">// Propagate() on the current LP.</span></div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> : watch_indices) {</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lb =</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(integer_variables_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]));</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> ub =</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(integer_variables_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]));</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> = lp_solution_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keywordflow">if</span> (value < lb - kCpEpsilon || value > ub + kCpEpsilon) <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a0010273383670a7c67b3b8f2660aa06b">Propagate</a>();</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  }</div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  </div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="comment">// TODO(user): The saved lp solution is still valid given the current variable</span></div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="comment">// bounds, so the LP optimal didn't change. However we might still want to add</span></div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="comment">// new cuts or new lazy constraints?</span></div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="comment">// TODO(user): Propagate the last optimal_constraint? Note that we need</span></div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="comment">// to be careful since the reversible int in IntegerSumLE are not registered.</span></div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="comment">// However, because we delete "optimalconstraints" on backtrack, we might not</span></div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="comment">// care.</span></div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span> }</div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  </div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span> <a class="code" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">glop::Fractional</a> LinearProgrammingConstraint::GetVariableValueAtCpScale(</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  glop::ColIndex <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="keywordflow">return</span> scaler_.<a class="code" href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a60d41c66b603be0ec7517d437e5c63ec">UnscaleVariableValue</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a201108c6e8d9fb5104697bdd0a8bd085">GetVariableValue</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span> }</div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  </div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a460fe5216ff7f997841e588d432be744"> 626</a></span> <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a460fe5216ff7f997841e588d432be744">LinearProgrammingConstraint::GetSolutionValue</a>(</div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  IntegerVariable variable)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="keywordflow">return</span> lp_solution_[<a class="code" href="namespacegtl.html#abce27d097bc5680207b294bdad75f59f">gtl::FindOrDie</a>(mirror_lp_variable_, variable).value()];</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span> }</div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  </div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#aeb58dc2ca6b2d8f627b837fcfaa4955a"> 631</a></span> <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#aeb58dc2ca6b2d8f627b837fcfaa4955a">LinearProgrammingConstraint::GetSolutionReducedCost</a>(</div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  IntegerVariable variable)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="keywordflow">return</span> lp_reduced_cost_[<a class="code" href="namespacegtl.html#abce27d097bc5680207b294bdad75f59f">gtl::FindOrDie</a>(mirror_lp_variable_, variable)</div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  .value()];</div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span> }</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  </div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span> <span class="keywordtype">void</span> LinearProgrammingConstraint::UpdateBoundsOfLpVariables() {</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = integer_variables_.size();</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; i++) {</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keyword">const</span> IntegerVariable cp_var = integer_variables_[i];</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lb = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(cp_var));</div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> ub = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(cp_var));</div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> factor = scaler_.<a class="code" href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a5eb3e38eae8f5143d627e8c85aff8cd7">VariableScalingFactor</a>(glop::ColIndex(i));</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a0fe7ba825c8c6cd1efdcff6dec631093">SetVariableBounds</a>(glop::ColIndex(i), lb * factor, ub * factor);</div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  }</div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span> }</div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  </div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span> <span class="keywordtype">bool</span> LinearProgrammingConstraint::SolveLp() {</div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == 0) {</div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  lp_at_level_zero_is_final_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  }</div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  </div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keyword">const</span> <span class="keyword">auto</span> status = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a866a68af5afd0355fb348f7a59eeff9e">Solve</a>(lp_data_, time_limit_);</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  total_num_simplex_iterations_ += simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a3269053b931945d67fbd50f3bd95f37f">GetNumberOfIterations</a>();</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordflow">if</span> (!status.ok()) {</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"The LP solver encountered an error: "</span> << status.error_message();</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ace96e115f468d752a2fcfeea901b0f8a">ClearStateForNextSolve</a>();</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  }</div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  average_degeneracy_.<a class="code" href="classoperations__research_1_1sat_1_1_incremental_average.html#a198870bbc0f9b8d197a4c80f766ddf49">AddData</a>(CalculateDegeneracy());</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordflow">if</span> (average_degeneracy_.<a class="code" href="classoperations__research_1_1sat_1_1_incremental_average.html#a6d9b473fa04b0558a8e48737f5ab9564">CurrentAverage</a>() >= 1000.0) {</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"High average degeneracy: "</span></div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  << average_degeneracy_.<a class="code" href="classoperations__research_1_1sat_1_1_incremental_average.html#a6d9b473fa04b0558a8e48737f5ab9564">CurrentAverage</a>();</div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  }</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  </div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> status_as_int = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>());</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keywordflow">if</span> (status_as_int >= num_solves_by_status_.size()) {</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  num_solves_by_status_.resize(status_as_int + 1);</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  }</div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  num_solves_by_status_[status_as_int]++;</div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"lvl:"</span> << trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() << <span class="stringliteral">" "</span></div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  << simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>()</div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  << <span class="stringliteral">" iter:"</span> << simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a3269053b931945d67fbd50f3bd95f37f">GetNumberOfIterations</a>()</div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  << <span class="stringliteral">" obj:"</span> << simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a96c1f660991b5007ca24564f69cd27b8">GetObjectiveValue</a>();</div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  </div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keywordflow">if</span> (simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>() == <a class="code" href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9af00c8dbdd6e1f11bdae06be94277d293">glop::ProblemStatus::OPTIMAL</a>) {</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  lp_solution_is_set_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  lp_solution_level_ = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>();</div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = integer_variables_.size();</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; i++) {</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">glop::Fractional</a> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> =</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  GetVariableValueAtCpScale(glop::ColIndex(i));</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  lp_solution_[i] = <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>;</div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  expanded_lp_solution_[integer_variables_[i]] = <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>;</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  expanded_lp_solution_[<a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(integer_variables_[i])] = -<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>;</div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  }</div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  </div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keywordflow">if</span> (lp_solution_level_ == 0) {</div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  level_zero_lp_solution_ = lp_solution_;</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  }</div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  }</div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span> }</div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  </div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span> <span class="keywordtype">bool</span> LinearProgrammingConstraint::AddCutFromConstraints(</div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>,</div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="keyword">const</span> std::vector<std::pair<RowIndex, IntegerValue>>& integer_multipliers) {</div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="comment">// This is initialized to a valid linear contraint (by taking linear</span></div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="comment">// combination of the LP rows) and will be transformed into a cut if</span></div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="comment">// possible.</span></div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="comment">// TODO(user): For CG cuts, Ideally this linear combination should have only</span></div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="comment">// one fractional variable (basis_col). But because of imprecision, we get a</span></div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="comment">// bunch of fractional entry with small coefficient (relative to the one of</span></div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="comment">// basis_col). We try to handle that in IntegerRoundingCut(), but it might be</span></div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="comment">// better to add small multiple of the involved rows to get rid of them.</span></div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  IntegerValue cut_ub;</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keywordflow">if</span> (!ComputeNewLinearConstraint(integer_multipliers, &tmp_scattered_vector_,</div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  &cut_ub)) {</div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Issue, overflow!"</span>;</div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  }</div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  </div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="comment">// Important: because we use integer_multipliers below, we cannot just</span></div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="comment">// divide by GCD or call PreventOverflow() here.</span></div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="comment">// TODO(user): the conversion col_index -> IntegerVariable is slow and could</span></div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="comment">// in principle be removed. Easy for cuts, but not so much for</span></div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="comment">// implied_bounds_processor_. Note that in theory this could allow us to</span></div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="comment">// use Literal directly without the need to have an IntegerVariable for them.</span></div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  tmp_scattered_vector_.<a class="code" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#a1077b795353fa06d7705f43377bedfe9">ConvertToLinearConstraint</a>(integer_variables_, cut_ub,</div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  &cut_);</div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  </div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="comment">// Note that the base constraint we use are currently always tight.</span></div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="comment">// It is not a requirement though.</span></div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> norm = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#acb294633c7688f918623b3b0e09aec43">ComputeInfinityNorm</a>(cut_));</div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> activity = <a class="code" href="namespaceoperations__research_1_1sat.html#aea18a909121c1c2ba4a818298611f0b2">ComputeActivity</a>(cut_, expanded_lp_solution_);</div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keywordflow">if</span> (std::abs(activity - <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(cut_.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>)) / norm > 1e-4) {</div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Cut not tight "</span> << activity << <span class="stringliteral">" <= "</span> << <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(cut_.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>);</div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  }</div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  }</div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(constraint_manager_.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a1afbe8d162a9cba17a520812ec6d3dd4">DebugCheckConstraint</a>(cut_));</div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  </div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="comment">// We will create "artificial" variables after this index that will be</span></div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="comment">// substitued back into LP variables afterwards. Also not that we only use</span></div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="comment">// positive variable indices for these new variables, so that algorithm that</span></div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="comment">// take their negation will not mess up the indexing.</span></div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="keyword">const</span> IntegerVariable first_new_var(expanded_lp_solution_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>());</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(first_new_var.value() % 2, 0);</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  </div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  LinearConstraint copy_in_debug;</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  copy_in_debug = cut_;</div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  }</div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  </div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="comment">// Unlike for the knapsack cuts, it might not be always beneficial to</span></div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="comment">// process the implied bounds even though it seems to be better in average.</span></div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="comment">// TODO(user): Perform more experiments, in particular with which bound we use</span></div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="comment">// and if we complement or not before the MIR rounding. Other solvers seems</span></div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <span class="comment">// to try different complementation strategies in a "potprocessing" and we</span></div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <span class="comment">// don't. Try this too.</span></div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  std::vector<ImpliedBoundsProcessor::SlackInfo> ib_slack_infos;</div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  implied_bounds_processor_.<a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#a135d2e8757ef674942be0b1d6f46f75b">ProcessUpperBoundedConstraintWithSlackCreation</a>(</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="comment">/*substitute_only_inner_variables=*/</span><span class="keyword">false</span>, first_new_var,</div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  expanded_lp_solution_, &cut_, &ib_slack_infos);</div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(implied_bounds_processor_.<a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#ab1b4642341faf5ff972b02f034d88f21">DebugSlack</a>(first_new_var, copy_in_debug,</div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  cut_, ib_slack_infos));</div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  </div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="comment">// Fills data for IntegerRoundingCut().</span></div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="comment">// Note(user): we use the current bound here, so the reasonement will only</span></div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="comment">// produce locally valid cut if we call this at a non-root node. We could</span></div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="comment">// use the level zero bounds if we wanted to generate a globally valid cut</span></div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="comment">// at another level. For now this is only called at level zero anyway.</span></div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  tmp_lp_values_.clear();</div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  tmp_var_lbs_.clear();</div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  tmp_var_ubs_.clear();</div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : cut_.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>) {</div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> >= first_new_var) {</div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#ae2544d2a3a5ef4c78f8e5891f104ab41">VariableIsPositive</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& info =</div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  ib_slack_infos[(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>.value() - first_new_var.value()) / 2];</div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  tmp_lp_values_.push_back(info.lp_value);</div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  tmp_var_lbs_.push_back(info.lb);</div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  tmp_var_ubs_.push_back(info.ub);</div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  tmp_lp_values_.push_back(expanded_lp_solution_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]);</div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  tmp_var_lbs_.push_back(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  tmp_var_ubs_.push_back(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  }</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  }</div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  </div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="comment">// Add slack.</span></div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="comment">// definition: integer_lp_[row] + slack_row == bound;</span></div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="keyword">const</span> IntegerVariable first_slack(first_new_var +</div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  IntegerVariable(2 * ib_slack_infos.size()));</div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  tmp_slack_rows_.clear();</div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  tmp_slack_bounds_.clear();</div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> pair : integer_multipliers) {</div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="keyword">const</span> RowIndex <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = pair.first;</div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="keyword">const</span> IntegerValue coeff = pair.second;</div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="keyword">const</span> <span class="keyword">auto</span> status = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ac0064327c37c56b93e86a91a1d64fd96">GetConstraintStatus</a>(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>);</div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="keywordflow">if</span> (status == <a class="code" href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9ae91836db656214f9797e10c15928e501">glop::ConstraintStatus::FIXED_VALUE</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  </div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  tmp_lp_values_.push_back(0.0);</div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  cut_.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.push_back(first_slack +</div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  2 * IntegerVariable(tmp_slack_rows_.size()));</div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  tmp_slack_rows_.push_back(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>);</div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  cut_.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>.push_back(coeff);</div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  </div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keyword">const</span> IntegerValue diff(</div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].ub.value(), integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].lb.value()));</div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <span class="keywordflow">if</span> (coeff > 0) {</div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  tmp_slack_bounds_.push_back(integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].ub);</div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  tmp_var_lbs_.push_back(IntegerValue(0));</div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  tmp_var_ubs_.push_back(diff);</div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  tmp_slack_bounds_.push_back(integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].lb);</div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  tmp_var_lbs_.push_back(-diff);</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  tmp_var_ubs_.push_back(IntegerValue(0));</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  }</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  }</div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  </div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="keywordtype">bool</span> at_least_one_added = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  </div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="comment">// Try cover appraoch to find cut.</span></div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  {</div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="keywordflow">if</span> (cover_cut_helper_.<a class="code" href="classoperations__research_1_1sat_1_1_cover_cut_helper.html#ad86e161bb994fe49fa9c4298ebb5ae2d">TrySimpleKnapsack</a>(cut_, tmp_lp_values_, tmp_var_lbs_,</div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  tmp_var_ubs_)) {</div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  at_least_one_added |= PostprocessAndAddCut(</div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  absl::StrCat(<a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>, <span class="stringliteral">"_K"</span>), cover_cut_helper_.<a class="code" href="classoperations__research_1_1sat_1_1_cover_cut_helper.html#ac3816c1571dfd130851ed09c79224360">Info</a>(), first_new_var,</div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  first_slack, ib_slack_infos, cover_cut_helper_.<a class="code" href="classoperations__research_1_1sat_1_1_cover_cut_helper.html#a542e0108682bbed13c1ccaa078845520">mutable_cut</a>());</div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  }</div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  }</div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  </div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <span class="comment">// Try integer rounding heuristic to find cut.</span></div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  {</div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  RoundingOptions options;</div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  options.max_scaling = sat_parameters_.max_integer_rounding_scaling();</div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  integer_rounding_cut_helper_.<a class="code" href="classoperations__research_1_1sat_1_1_integer_rounding_cut_helper.html#a66c8e6dc26260b69dcdf7668925dc3aa">ComputeCut</a>(options, tmp_lp_values_,</div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  tmp_var_lbs_, tmp_var_ubs_,</div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  &implied_bounds_processor_, &cut_);</div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  at_least_one_added |= PostprocessAndAddCut(</div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>,</div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  absl::StrCat(<span class="stringliteral">"num_lifted_booleans="</span>,</div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  integer_rounding_cut_helper_.<a class="code" href="classoperations__research_1_1sat_1_1_integer_rounding_cut_helper.html#a4f879f884fd170f77c9024aee023feb2">NumLiftedBooleans</a>()),</div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  first_new_var, first_slack, ib_slack_infos, &cut_);</div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  }</div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keywordflow">return</span> at_least_one_added;</div>
|
|
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span> }</div>
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  </div>
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span> <span class="keywordtype">bool</span> LinearProgrammingConstraint::PostprocessAndAddCut(</div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>, <span class="keyword">const</span> std::string& info,</div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  IntegerVariable first_new_var, IntegerVariable first_slack,</div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="keyword">const</span> std::vector<ImpliedBoundsProcessor::SlackInfo>& ib_slack_infos,</div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  LinearConstraint* cut) {</div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="comment">// Compute the activity. Warning: the cut no longer have the same size so we</span></div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="comment">// cannot use tmp_lp_values_. Note that the substitution below shouldn't</span></div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <span class="comment">// change the activity by definition.</span></div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <span class="keywordtype">double</span> activity = 0.0;</div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < cut->vars.size(); ++i) {</div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <span class="keywordflow">if</span> (cut->vars[i] < first_new_var) {</div>
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  activity +=</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(cut->coeffs[i]) * expanded_lp_solution_[cut->vars[i]];</div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  }</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  }</div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> kMinViolation = 1e-4;</div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> violation = activity - <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(cut->ub);</div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <span class="keywordflow">if</span> (violation < kMinViolation) {</div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) << <span class="stringliteral">"Bad cut "</span> << activity << <span class="stringliteral">" <= "</span> << <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(cut->ub);</div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  }</div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  </div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <span class="comment">// Substitute any slack left.</span></div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  {</div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="keywordtype">int</span> num_slack = 0;</div>
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  tmp_scattered_vector_.<a class="code" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#ab2fc4510692e040b62507dce522e0e31">ClearAndResize</a>(integer_variables_.size());</div>
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  IntegerValue cut_ub = cut->ub;</div>
|
|
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="keywordtype">bool</span> overflow = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < cut->vars.size(); ++i) {</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = cut->vars[i];</div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  </div>
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="comment">// Simple copy for non-slack variables.</span></div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> < first_new_var) {</div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <span class="keyword">const</span> glop::ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> =</div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <a class="code" href="namespacegtl.html#abce27d097bc5680207b294bdad75f59f">gtl::FindOrDie</a>(mirror_lp_variable_, <a class="code" href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">PositiveVariable</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research_1_1sat.html#ae2544d2a3a5ef4c78f8e5891f104ab41">VariableIsPositive</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) {</div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  tmp_scattered_vector_.<a class="code" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#a4940f758f3c0e757a4bcb5bbf795ce67">Add</a>(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>, cut->coeffs[i]);</div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  tmp_scattered_vector_.<a class="code" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#a4940f758f3c0e757a4bcb5bbf795ce67">Add</a>(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>, -cut->coeffs[i]);</div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  }</div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  }</div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  </div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="comment">// Replace slack from bound substitution.</span></div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> < first_slack) {</div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keyword">const</span> IntegerValue multiplier = cut->coeffs[i];</div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>.value() - first_new_var.value()) / 2;</div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, ib_slack_infos.size());</div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  </div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  std::vector<std::pair<ColIndex, IntegerValue>> terms;</div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair<IntegerVariable, IntegerValue>& term :</div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  ib_slack_infos[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].terms) {</div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  terms.push_back(</div>
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  {<a class="code" href="namespacegtl.html#abce27d097bc5680207b294bdad75f59f">gtl::FindOrDie</a>(mirror_lp_variable_,</div>
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">PositiveVariable</a>(term.first)),</div>
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#ae2544d2a3a5ef4c78f8e5891f104ab41">VariableIsPositive</a>(term.first) ? term.second : -term.second});</div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  }</div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="keywordflow">if</span> (!tmp_scattered_vector_.<a class="code" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#aeb3044e58e1e28e857c5265734ae7e30">AddLinearExpressionMultiple</a>(multiplier,</div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  terms)) {</div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  overflow = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  }</div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">AddProductTo</a>(multiplier, -ib_slack_infos[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].offset, &cut_ub)) {</div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  overflow = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  }</div>
|
|
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  }</div>
|
|
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  </div>
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="comment">// Replace slack from LP constraints.</span></div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  ++num_slack;</div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> slack_index = (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>.value() - first_slack.value()) / 2;</div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="keyword">const</span> glop::RowIndex <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = tmp_slack_rows_[slack_index];</div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <span class="keyword">const</span> IntegerValue multiplier = -cut->coeffs[i];</div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="keywordflow">if</span> (!tmp_scattered_vector_.<a class="code" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#aeb3044e58e1e28e857c5265734ae7e30">AddLinearExpressionMultiple</a>(</div>
|
|
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  multiplier, integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].terms)) {</div>
|
|
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  overflow = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  }</div>
|
|
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  </div>
|
|
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="comment">// Update rhs.</span></div>
|
|
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">AddProductTo</a>(multiplier, tmp_slack_bounds_[slack_index], &cut_ub)) {</div>
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  overflow = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  }</div>
|
|
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  }</div>
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  </div>
|
|
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="keywordflow">if</span> (overflow) {</div>
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Overflow in slack removal."</span>;</div>
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  }</div>
|
|
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  </div>
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) << <span class="stringliteral">" num_slack: "</span> << num_slack;</div>
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  tmp_scattered_vector_.<a class="code" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#a1077b795353fa06d7705f43377bedfe9">ConvertToLinearConstraint</a>(integer_variables_, cut_ub,</div>
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  cut);</div>
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  }</div>
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  </div>
|
|
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="comment">// Display some stats used for investigation of cut generation.</span></div>
|
|
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  <span class="keyword">const</span> std::string extra_info =</div>
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  absl::StrCat(info, <span class="stringliteral">" num_ib_substitutions="</span>, ib_slack_infos.size());</div>
|
|
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  </div>
|
|
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> new_violation =</div>
|
|
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#aea18a909121c1c2ba4a818298611f0b2">ComputeActivity</a>(*cut, expanded_lp_solution_) - <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(cut_.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">ub</a>);</div>
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  <span class="keywordflow">if</span> (std::abs(violation - new_violation) >= 1e-4) {</div>
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Violation discrepancy after slack removal. "</span></div>
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  << <span class="stringliteral">" before = "</span> << violation << <span class="stringliteral">" after = "</span> << new_violation;</div>
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  }</div>
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  </div>
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#ae3c495e2e05950c578b01976701f9b2a">DivideByGCD</a>(cut);</div>
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <span class="keywordflow">return</span> constraint_manager_.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a9456bb31790e4dae791914e3c065b460">AddCut</a>(*cut, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>, expanded_lp_solution_,</div>
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  extra_info);</div>
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span> }</div>
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  </div>
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span> <span class="keywordtype">void</span> LinearProgrammingConstraint::AddCGCuts() {</div>
|
|
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="keyword">const</span> RowIndex num_rows = lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#afda9b9b5e858d0c466d2a6293361004a">num_constraints</a>();</div>
|
|
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="keywordflow">for</span> (RowIndex <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>(0); <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < num_rows; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  ColIndex basis_col = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ae15a49e0cab69203efca232f0b32866d">GetBasis</a>(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>);</div>
|
|
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">Fractional</a> lp_value = GetVariableValueAtCpScale(basis_col);</div>
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  </div>
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  <span class="comment">// TODO(user): We could just look at the diff with std::floor() in the hope</span></div>
|
|
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  <span class="comment">// that when we are just under an integer, the exact computation below will</span></div>
|
|
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  <span class="comment">// also be just under it.</span></div>
|
|
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="keywordflow">if</span> (std::abs(lp_value - std::round(lp_value)) < 0.01) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  </div>
|
|
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <span class="comment">// If this variable is a slack, we ignore it. This is because the</span></div>
|
|
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  <span class="comment">// corresponding row is not tight under the given lp values.</span></div>
|
|
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  <span class="keywordflow">if</span> (basis_col >= integer_variables_.size()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  </div>
|
|
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  <span class="keywordflow">if</span> (time_limit_-><a class="code" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>()) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  </div>
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  <span class="keyword">const</span> glop::ScatteredRow& lambda = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#afa85e3bd0c3e1bd18b4faf1dd36d550a">GetUnitRowLeftInverse</a>(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>);</div>
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <a class="code" href="namespaceoperations__research_1_1glop.html#ae5fa9e57c2d31b294195ed8a9e17bfac">glop::DenseColumn</a> lp_multipliers(num_rows, 0.0);</div>
|
|
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  <span class="keywordtype">double</span> magnitude = 0.0;</div>
|
|
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  <span class="keywordtype">int</span> num_non_zeros = 0;</div>
|
|
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  <span class="keywordflow">for</span> (RowIndex <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>(0); <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < num_rows; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  lp_multipliers[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>] = lambda.values[<a class="code" href="namespaceoperations__research_1_1glop.html#a8fbc9efd86a3cc862a9079d86ab8b524">glop::RowToColIndex</a>(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>)];</div>
|
|
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <span class="keywordflow">if</span> (std::abs(lp_multipliers[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>]) < 1e-12) {</div>
|
|
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  lp_multipliers[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>] = 0.0;</div>
|
|
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  }</div>
|
|
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  </div>
|
|
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="comment">// There should be no BASIC status, but they could be imprecision</span></div>
|
|
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  <span class="comment">// in the GetUnitRowLeftInverse() code? not sure, so better be safe.</span></div>
|
|
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  <span class="keyword">const</span> <span class="keyword">auto</span> status = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ac0064327c37c56b93e86a91a1d64fd96">GetConstraintStatus</a>(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>);</div>
|
|
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  <span class="keywordflow">if</span> (status == <a class="code" href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9ae4ac03f6c9f00665644e868dd1fb9f1e">glop::ConstraintStatus::BASIC</a>) {</div>
|
|
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"BASIC row not expected! "</span> << lp_multipliers[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>];</div>
|
|
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  lp_multipliers[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>] = 0.0;</div>
|
|
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  }</div>
|
|
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  </div>
|
|
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  magnitude = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(magnitude, std::abs(lp_multipliers[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>]));</div>
|
|
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  <span class="keywordflow">if</span> (lp_multipliers[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>] != 0.0) ++num_non_zeros;</div>
|
|
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  }</div>
|
|
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  <span class="keywordflow">if</span> (num_non_zeros == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  </div>
|
|
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <a class="code" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">Fractional</a> scaling;</div>
|
|
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 2; ++i) {</div>
|
|
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  <span class="keywordflow">if</span> (i == 1) {</div>
|
|
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  <span class="comment">// Try other sign.</span></div>
|
|
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="comment">// TODO(user): Maybe add an heuristic to know beforehand which sign to</span></div>
|
|
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  <span class="comment">// use?</span></div>
|
|
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  <span class="keywordflow">for</span> (RowIndex <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>(0); <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < num_rows; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  lp_multipliers[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>] = -lp_multipliers[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>];</div>
|
|
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  }</div>
|
|
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  }</div>
|
|
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  </div>
|
|
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  <span class="comment">// TODO(user): We use a lower value here otherwise we might run into</span></div>
|
|
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  <span class="comment">// overflow while computing the cut. This should be fixable.</span></div>
|
|
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  <span class="keyword">const</span> std::vector<std::pair<RowIndex, IntegerValue>> integer_multipliers =</div>
|
|
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  ScaleLpMultiplier(<span class="comment">/*take_objective_into_account=*/</span><span class="keyword">false</span>,</div>
|
|
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  lp_multipliers, &scaling, <span class="comment">/*max_pow=*/</span>52);</div>
|
|
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  AddCutFromConstraints(<span class="stringliteral">"CG"</span>, integer_multipliers);</div>
|
|
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  }</div>
|
|
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  }</div>
|
|
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span> }</div>
|
|
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  </div>
|
|
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  </div>
|
|
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span> <span class="comment">// For each element of a, adds a random one in b and append the pair to output.</span></div>
|
|
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span> <span class="keywordtype">void</span> RandomPick(<span class="keyword">const</span> std::vector<RowIndex>& <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <span class="keyword">const</span> std::vector<RowIndex>& <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>,</div>
|
|
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  ModelRandomGenerator* random,</div>
|
|
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  std::vector<std::pair<RowIndex, RowIndex>>* output) {</div>
|
|
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.empty() || <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.empty()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> RowIndex <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> : <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>) {</div>
|
|
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="keyword">const</span> RowIndex other = <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>[absl::Uniform<int>(*random, 0, <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.size())];</div>
|
|
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  <span class="keywordflow">if</span> (other != <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  output->push_back({<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, other});</div>
|
|
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  }</div>
|
|
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  }</div>
|
|
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span> }</div>
|
|
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  </div>
|
|
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span> <span class="keyword">template</span> <<span class="keyword">class</span> ListOfTerms></div>
|
|
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span> IntegerValue GetCoeff(ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>, <span class="keyword">const</span> ListOfTerms& terms) {</div>
|
|
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& term : terms) {</div>
|
|
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  <span class="keywordflow">if</span> (term.first == <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) <span class="keywordflow">return</span> term.second;</div>
|
|
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  }</div>
|
|
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  <span class="keywordflow">return</span> IntegerValue(0);</div>
|
|
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span> }</div>
|
|
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  </div>
|
|
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  </div>
|
|
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span> <span class="keywordtype">void</span> LinearProgrammingConstraint::AddMirCuts() {</div>
|
|
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="comment">// Heuristic to generate MIR_n cuts by combining a small number of rows. This</span></div>
|
|
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <span class="comment">// works greedily and follow more or less the MIR cut description in the</span></div>
|
|
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="comment">// literature. We have a current cut, and we add one more row to it while</span></div>
|
|
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  <span class="comment">// eliminating a variable of the current cut whose LP value is far from its</span></div>
|
|
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  <span class="comment">// bound.</span></div>
|
|
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  <span class="comment">// A notable difference is that we randomize the variable we eliminate and</span></div>
|
|
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  <span class="comment">// the row we use to do so. We still have weights to indicate our preferred</span></div>
|
|
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  <span class="comment">// choices. This allows to generate different cuts when called again and</span></div>
|
|
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  <span class="comment">// again.</span></div>
|
|
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  <span class="comment">// TODO(user): We could combine n rows to make sure we eliminate n variables</span></div>
|
|
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  <span class="comment">// far away from their bounds by solving exactly in integer small linear</span></div>
|
|
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  <span class="comment">// system.</span></div>
|
|
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<ColIndex, IntegerValue></a> dense_cut(</div>
|
|
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  integer_variables_.size(), IntegerValue(0));</div>
|
|
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  SparseBitset<ColIndex> non_zeros_(ColIndex(integer_variables_.size()));</div>
|
|
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  </div>
|
|
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  <span class="comment">// We compute all the rows that are tight, these will be used as the base row</span></div>
|
|
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  <span class="comment">// for the MIR_n procedure below.</span></div>
|
|
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <span class="keyword">const</span> RowIndex num_rows = lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#afda9b9b5e858d0c466d2a6293361004a">num_constraints</a>();</div>
|
|
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  std::vector<std::pair<RowIndex, IntegerValue>> base_rows;</div>
|
|
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<RowIndex, double></a> row_weights(num_rows.value(), 0.0);</div>
|
|
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  <span class="keywordflow">for</span> (RowIndex <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>(0); <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < num_rows; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="keyword">const</span> <span class="keyword">auto</span> status = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ac0064327c37c56b93e86a91a1d64fd96">GetConstraintStatus</a>(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>);</div>
|
|
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  <span class="keywordflow">if</span> (status == <a class="code" href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9ae4ac03f6c9f00665644e868dd1fb9f1e">glop::ConstraintStatus::BASIC</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  <span class="keywordflow">if</span> (status == <a class="code" href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9a88c189a42c87aa49d667fc8ab76bc323">glop::ConstraintStatus::FREE</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  </div>
|
|
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  <span class="keywordflow">if</span> (status == <a class="code" href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9a14dc61f52267ea9b476f64c1d4d975b1">glop::ConstraintStatus::AT_UPPER_BOUND</a> ||</div>
|
|
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  status == <a class="code" href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9ae91836db656214f9797e10c15928e501">glop::ConstraintStatus::FIXED_VALUE</a>) {</div>
|
|
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  base_rows.push_back({<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, IntegerValue(1)});</div>
|
|
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  }</div>
|
|
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="keywordflow">if</span> (status == <a class="code" href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9a74c506bd3d744fb5c2862229c8f2b6ce">glop::ConstraintStatus::AT_LOWER_BOUND</a> ||</div>
|
|
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  status == <a class="code" href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9ae91836db656214f9797e10c15928e501">glop::ConstraintStatus::FIXED_VALUE</a>) {</div>
|
|
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  base_rows.push_back({<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, IntegerValue(-1)});</div>
|
|
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  }</div>
|
|
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  </div>
|
|
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  <span class="comment">// For now, we use the dual values for the row "weights".</span></div>
|
|
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  <span class="comment">// Note that we use the dual at LP scale so that it make more sense when we</span></div>
|
|
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  <span class="comment">// compare different rows since the LP has been scaled.</span></div>
|
|
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  <span class="comment">// TODO(user): In Kati Wolter PhD "Implementation of Cutting Plane</span></div>
|
|
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  <span class="comment">// Separators for Mixed Integer Programs" which describe SCIP's MIR cuts</span></div>
|
|
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  <span class="comment">// implementation (or at least an early version of it), a more complex score</span></div>
|
|
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  <span class="comment">// is used.</span></div>
|
|
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="comment">// Note(user): Because we only consider tight rows under the current lp</span></div>
|
|
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  <span class="comment">// solution (i.e. non-basic rows), most should have a non-zero dual values.</span></div>
|
|
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  <span class="comment">// But there is some degenerate problem where these rows have a really low</span></div>
|
|
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  <span class="comment">// weight (or even zero), and having only weight of exactly zero in</span></div>
|
|
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  <span class="comment">// std::discrete_distribution will result in a crash.</span></div>
|
|
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  row_weights[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>] = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(1e-8, std::abs(simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#aa4c5e551e5a00ff4ae97d8467184221b">GetDualValue</a>(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>)));</div>
|
|
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  }</div>
|
|
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  </div>
|
|
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  std::vector<double> weights;</div>
|
|
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<RowIndex, bool></a> used_rows;</div>
|
|
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  std::vector<std::pair<RowIndex, IntegerValue>> integer_multipliers;</div>
|
|
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair<RowIndex, IntegerValue>& entry : base_rows) {</div>
|
|
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  <span class="keywordflow">if</span> (time_limit_-><a class="code" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>()) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  </div>
|
|
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="comment">// First try to generate a cut directly from this base row (MIR1).</span></div>
|
|
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <span class="comment">// Note(user): We abort on success like it seems to be done in the</span></div>
|
|
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="comment">// literature. Note that we don't succeed that often in generating an</span></div>
|
|
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  <span class="comment">// efficient cut, so I am not sure aborting will make a big difference</span></div>
|
|
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  <span class="comment">// speedwise. We might generate similar cuts though, but hopefully the cut</span></div>
|
|
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  <span class="comment">// management can deal with that.</span></div>
|
|
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  integer_multipliers = {entry};</div>
|
|
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  <span class="keywordflow">if</span> (AddCutFromConstraints(<span class="stringliteral">"MIR_1"</span>, integer_multipliers)) {</div>
|
|
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  }</div>
|
|
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  </div>
|
|
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  <span class="comment">// Cleanup.</span></div>
|
|
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> : non_zeros_.PositionsSetAtLeastOnce()) {</div>
|
|
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  dense_cut[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = IntegerValue(0);</div>
|
|
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  }</div>
|
|
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  non_zeros_.SparseClearAll();</div>
|
|
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  </div>
|
|
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  <span class="comment">// Copy cut.</span></div>
|
|
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  <span class="keyword">const</span> IntegerValue multiplier = entry.second;</div>
|
|
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair<ColIndex, IntegerValue> term :</div>
|
|
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  integer_lp_[entry.first].terms) {</div>
|
|
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  <span class="keyword">const</span> ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = term.first;</div>
|
|
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  <span class="keyword">const</span> IntegerValue coeff = term.second;</div>
|
|
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  non_zeros_.Set(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>);</div>
|
|
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  dense_cut[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] += coeff * multiplier;</div>
|
|
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  }</div>
|
|
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  </div>
|
|
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  used_rows.<a class="code" href="classabsl_1_1_strong_vector.html#a184fe69018ae421dcf31c964bfe40576">assign</a>(num_rows.value(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  used_rows[entry.first] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  </div>
|
|
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  <span class="comment">// We will aggregate at most kMaxAggregation more rows.</span></div>
|
|
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  <span class="comment">// TODO(user): optim + tune.</span></div>
|
|
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> kMaxAggregation = 5;</div>
|
|
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < kMaxAggregation; ++i) {</div>
|
|
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  <span class="comment">// First pick a variable to eliminate. We currently pick a random one with</span></div>
|
|
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  <span class="comment">// a weight that depend on how far it is from its closest bound.</span></div>
|
|
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  IntegerValue max_magnitude(0);</div>
|
|
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  weights.clear();</div>
|
|
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  std::vector<ColIndex> col_candidates;</div>
|
|
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> : non_zeros_.PositionsSetAtLeastOnce()) {</div>
|
|
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  <span class="keywordflow">if</span> (dense_cut[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  </div>
|
|
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  max_magnitude = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(max_magnitude, <a class="code" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(dense_cut[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>]));</div>
|
|
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> col_degree =</div>
|
|
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#aeeee0971281f2781c379fce7a64a5049">GetSparseColumn</a>(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>).<a class="code" href="classoperations__research_1_1glop_1_1_sparse_vector.html#af69d9b7065a8f31604a8134be4307749">num_entries</a>().value();</div>
|
|
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  <span class="keywordflow">if</span> (col_degree <= 1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  <span class="keywordflow">if</span> (simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a4802169fde637478bebd1b420eec8ff8">GetVariableStatus</a>(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) != <a class="code" href="namespaceoperations__research_1_1glop.html#a1ac488f3db89f6d16a85c56f3243290cae4ac03f6c9f00665644e868dd1fb9f1e">glop::VariableStatus::BASIC</a>) {</div>
|
|
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  }</div>
|
|
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  </div>
|
|
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = integer_variables_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>.value()];</div>
|
|
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lp_value = expanded_lp_solution_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>];</div>
|
|
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lb = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> ub = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> bound_distance = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(ub - lp_value, lp_value - lb);</div>
|
|
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  <span class="keywordflow">if</span> (bound_distance > 1e-2) {</div>
|
|
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  weights.push_back(bound_distance);</div>
|
|
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  col_candidates.push_back(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>);</div>
|
|
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  }</div>
|
|
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  }</div>
|
|
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  <span class="keywordflow">if</span> (col_candidates.empty()) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  </div>
|
|
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  <span class="keyword">const</span> ColIndex var_to_eliminate =</div>
|
|
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  col_candidates[std::discrete_distribution<>(weights.begin(),</div>
|
|
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  weights.end())(*random_)];</div>
|
|
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  </div>
|
|
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  <span class="comment">// What rows can we add to eliminate var_to_eliminate?</span></div>
|
|
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  std::vector<RowIndex> possible_rows;</div>
|
|
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  weights.clear();</div>
|
|
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> entry : lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#aeeee0971281f2781c379fce7a64a5049">GetSparseColumn</a>(var_to_eliminate)) {</div>
|
|
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  <span class="keyword">const</span> RowIndex <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = entry.row();</div>
|
|
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <span class="keyword">const</span> <span class="keyword">auto</span> status = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ac0064327c37c56b93e86a91a1d64fd96">GetConstraintStatus</a>(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>);</div>
|
|
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  <span class="keywordflow">if</span> (status == <a class="code" href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9ae4ac03f6c9f00665644e868dd1fb9f1e">glop::ConstraintStatus::BASIC</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  <span class="keywordflow">if</span> (status == <a class="code" href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9a88c189a42c87aa49d667fc8ab76bc323">glop::ConstraintStatus::FREE</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  </div>
|
|
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  <span class="comment">// We disallow all the rows that contain a variable that we already</span></div>
|
|
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <span class="comment">// eliminated (or are about to). This mean that we choose rows that</span></div>
|
|
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  <span class="comment">// form a "triangular" matrix on the position we choose to eliminate.</span></div>
|
|
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  <span class="keywordflow">if</span> (used_rows[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  used_rows[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  </div>
|
|
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  <span class="comment">// TODO(user): Instead of using FIXED_VALUE consider also both direction</span></div>
|
|
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <span class="comment">// when we almost have an equality? that is if the LP constraints bounds</span></div>
|
|
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <span class="comment">// are close from each others (<1e-6 ?). Initial experiments shows it</span></div>
|
|
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  <span class="comment">// doesn't change much, so I kept this version for now. Note that it</span></div>
|
|
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  <span class="comment">// might just be better to use the side that constrain the current lp</span></div>
|
|
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  <span class="comment">// optimal solution (that we get from the status).</span></div>
|
|
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  <span class="keywordtype">bool</span> add_row = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  <span class="keywordflow">if</span> (status == <a class="code" href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9ae91836db656214f9797e10c15928e501">glop::ConstraintStatus::FIXED_VALUE</a> ||</div>
|
|
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  status == <a class="code" href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9a14dc61f52267ea9b476f64c1d4d975b1">glop::ConstraintStatus::AT_UPPER_BOUND</a>) {</div>
|
|
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  <span class="keywordflow">if</span> (entry.coefficient() > 0.0) {</div>
|
|
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  <span class="keywordflow">if</span> (dense_cut[var_to_eliminate] < 0) add_row = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  <span class="keywordflow">if</span> (dense_cut[var_to_eliminate] > 0) add_row = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  }</div>
|
|
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  }</div>
|
|
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  <span class="keywordflow">if</span> (status == <a class="code" href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9ae91836db656214f9797e10c15928e501">glop::ConstraintStatus::FIXED_VALUE</a> ||</div>
|
|
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  status == <a class="code" href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9a74c506bd3d744fb5c2862229c8f2b6ce">glop::ConstraintStatus::AT_LOWER_BOUND</a>) {</div>
|
|
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  <span class="keywordflow">if</span> (entry.coefficient() > 0.0) {</div>
|
|
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  <span class="keywordflow">if</span> (dense_cut[var_to_eliminate] > 0) add_row = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  <span class="keywordflow">if</span> (dense_cut[var_to_eliminate] < 0) add_row = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  }</div>
|
|
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  }</div>
|
|
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  <span class="keywordflow">if</span> (add_row) {</div>
|
|
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  possible_rows.push_back(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>);</div>
|
|
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  weights.push_back(row_weights[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>]);</div>
|
|
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  }</div>
|
|
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  }</div>
|
|
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <span class="keywordflow">if</span> (possible_rows.empty()) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  </div>
|
|
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  <span class="keyword">const</span> RowIndex row_to_combine =</div>
|
|
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  possible_rows[std::discrete_distribution<>(weights.begin(),</div>
|
|
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  weights.end())(*random_)];</div>
|
|
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  <span class="keyword">const</span> IntegerValue to_combine_coeff =</div>
|
|
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  GetCoeff(var_to_eliminate, integer_lp_[row_to_combine].terms);</div>
|
|
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(to_combine_coeff, 0);</div>
|
|
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  </div>
|
|
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  IntegerValue mult1 = -to_combine_coeff;</div>
|
|
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  IntegerValue mult2 = dense_cut[var_to_eliminate];</div>
|
|
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(mult2, 0);</div>
|
|
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  <span class="keywordflow">if</span> (mult1 < 0) {</div>
|
|
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  mult1 = -mult1;</div>
|
|
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  mult2 = -mult2;</div>
|
|
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  }</div>
|
|
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  </div>
|
|
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  <span class="keyword">const</span> IntegerValue gcd = IntegerValue(</div>
|
|
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  <a class="code" href="classoperations__research_1_1_math_util.html#a02deedce87f0c011025ec7716b04e9ea">MathUtil::GCD64</a>(std::abs(mult1.value()), std::abs(mult2.value())));</div>
|
|
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(gcd, 0);</div>
|
|
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  mult1 /= gcd;</div>
|
|
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  mult2 /= gcd;</div>
|
|
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  </div>
|
|
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  <span class="comment">// Overflow detection.</span></div>
|
|
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  <span class="comment">// TODO(user): do that in the possible_rows selection? only problem is</span></div>
|
|
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  <span class="comment">// that we do not have the integer coefficient there...</span></div>
|
|
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  <span class="keywordflow">for</span> (std::pair<RowIndex, IntegerValue>& entry : integer_multipliers) {</div>
|
|
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  max_magnitude = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(max_magnitude, entry.second);</div>
|
|
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  }</div>
|
|
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(max_magnitude.value(), std::abs(mult1.value())),</div>
|
|
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(infinity_norms_[row_to_combine].<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>(),</div>
|
|
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  std::abs(mult2.value()))) == <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) {</div>
|
|
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  }</div>
|
|
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  </div>
|
|
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  <span class="keywordflow">for</span> (std::pair<RowIndex, IntegerValue>& entry : integer_multipliers) {</div>
|
|
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  entry.second *= mult1;</div>
|
|
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  }</div>
|
|
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  integer_multipliers.push_back({row_to_combine, mult2});</div>
|
|
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  </div>
|
|
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  <span class="comment">// TODO(user): Not supper efficient to recombine the rows.</span></div>
|
|
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  <span class="keywordflow">if</span> (AddCutFromConstraints(absl::StrCat(<span class="stringliteral">"MIR_"</span>, i + 2),</div>
|
|
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  integer_multipliers)) {</div>
|
|
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  }</div>
|
|
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  </div>
|
|
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  <span class="comment">// Minor optim: the computation below is only needed if we do one more</span></div>
|
|
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  <span class="comment">// iteration.</span></div>
|
|
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  <span class="keywordflow">if</span> (i + 1 == kMaxAggregation) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  </div>
|
|
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  <span class="keywordflow">for</span> (ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> : non_zeros_.PositionsSetAtLeastOnce()) {</div>
|
|
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  dense_cut[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] *= mult1;</div>
|
|
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  }</div>
|
|
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair<ColIndex, IntegerValue> term :</div>
|
|
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  integer_lp_[row_to_combine].terms) {</div>
|
|
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  <span class="keyword">const</span> ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = term.first;</div>
|
|
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  <span class="keyword">const</span> IntegerValue coeff = term.second;</div>
|
|
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  non_zeros_.Set(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>);</div>
|
|
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  dense_cut[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] += coeff * mult2;</div>
|
|
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  }</div>
|
|
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  }</div>
|
|
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  }</div>
|
|
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span> }</div>
|
|
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  </div>
|
|
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span> <span class="keywordtype">void</span> LinearProgrammingConstraint::AddZeroHalfCuts() {</div>
|
|
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  <span class="keywordflow">if</span> (time_limit_-><a class="code" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  </div>
|
|
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  tmp_lp_values_.clear();</div>
|
|
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  tmp_var_lbs_.clear();</div>
|
|
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  tmp_var_ubs_.clear();</div>
|
|
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : integer_variables_) {</div>
|
|
<div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  tmp_lp_values_.push_back(expanded_lp_solution_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]);</div>
|
|
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  tmp_var_lbs_.push_back(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  tmp_var_ubs_.push_back(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  }</div>
|
|
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  </div>
|
|
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  <span class="comment">// TODO(user): See if it make sense to try to use implied bounds there.</span></div>
|
|
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  zero_half_cut_helper_.<a class="code" href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#a329f7f126c4f5e81cae82065d7fb96d0">ProcessVariables</a>(tmp_lp_values_, tmp_var_lbs_,</div>
|
|
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  tmp_var_ubs_);</div>
|
|
<div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  <span class="keywordflow">for</span> (glop::RowIndex <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>(0); <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < integer_lp_.size(); ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  <span class="comment">// Even though we could use non-tight row, for now we prefer to use tight</span></div>
|
|
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  <span class="comment">// ones.</span></div>
|
|
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  <span class="keyword">const</span> <span class="keyword">auto</span> status = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ac0064327c37c56b93e86a91a1d64fd96">GetConstraintStatus</a>(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>);</div>
|
|
<div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  <span class="keywordflow">if</span> (status == <a class="code" href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9ae4ac03f6c9f00665644e868dd1fb9f1e">glop::ConstraintStatus::BASIC</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  <span class="keywordflow">if</span> (status == <a class="code" href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9a88c189a42c87aa49d667fc8ab76bc323">glop::ConstraintStatus::FREE</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  </div>
|
|
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  zero_half_cut_helper_.<a class="code" href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#afbba3b7980ea3f2da0bbb57e1a0df4d6">AddOneConstraint</a>(</div>
|
|
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].terms, integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].lb, integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].ub);</div>
|
|
<div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  }</div>
|
|
<div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::vector<std::pair<RowIndex, IntegerValue>>& multipliers :</div>
|
|
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  zero_half_cut_helper_.<a class="code" href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#af7012dee6abfab160a910241b61e1b1d">InterestingCandidates</a>(random_)) {</div>
|
|
<div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  <span class="keywordflow">if</span> (time_limit_-><a class="code" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>()) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  </div>
|
|
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  <span class="comment">// TODO(user): Make sure that if the resulting linear coefficients are not</span></div>
|
|
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  <span class="comment">// too high, we do try a "divisor" of two and thus try a true zero-half cut</span></div>
|
|
<div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  <span class="comment">// instead of just using our best MIR heuristic (which might still be better</span></div>
|
|
<div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  <span class="comment">// though).</span></div>
|
|
<div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  AddCutFromConstraints(<span class="stringliteral">"ZERO_HALF"</span>, multipliers);</div>
|
|
<div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  }</div>
|
|
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span> }</div>
|
|
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  </div>
|
|
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span> <span class="keywordtype">void</span> LinearProgrammingConstraint::UpdateSimplexIterationLimit(</div>
|
|
<div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> min_iter, <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_iter) {</div>
|
|
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  <span class="keywordflow">if</span> (sat_parameters_.linearization_level() < 2) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> num_degenerate_columns = CalculateDegeneracy();</div>
|
|
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> num_cols = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ac226833fbf53fdb3fb7b6ef9d89a0e4c">GetProblemNumCols</a>().value();</div>
|
|
<div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  <span class="keywordflow">if</span> (num_cols <= 0) {</div>
|
|
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  }</div>
|
|
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(num_cols, 0);</div>
|
|
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> decrease_factor = (10 * num_degenerate_columns) / num_cols;</div>
|
|
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  <span class="keywordflow">if</span> (simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>() == glop::ProblemStatus::DUAL_FEASIBLE) {</div>
|
|
<div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  <span class="comment">// We reached here probably because we predicted wrong. We use this as a</span></div>
|
|
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  <span class="comment">// signal to increase the iterations or punish less for degeneracy compare</span></div>
|
|
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  <span class="comment">// to the other part.</span></div>
|
|
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  <span class="keywordflow">if</span> (is_degenerate_) {</div>
|
|
<div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  next_simplex_iter_ /= <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>{1}, decrease_factor);</div>
|
|
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  next_simplex_iter_ *= 2;</div>
|
|
<div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  }</div>
|
|
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>() == <a class="code" href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9af00c8dbdd6e1f11bdae06be94277d293">glop::ProblemStatus::OPTIMAL</a>) {</div>
|
|
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  <span class="keywordflow">if</span> (is_degenerate_) {</div>
|
|
<div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  next_simplex_iter_ /= <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>{1}, 2 * decrease_factor);</div>
|
|
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  <span class="comment">// This is the most common case. We use the size of the problem to</span></div>
|
|
<div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  <span class="comment">// determine the limit and ignore the previous limit.</span></div>
|
|
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  next_simplex_iter_ = num_cols / 40;</div>
|
|
<div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  }</div>
|
|
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  }</div>
|
|
<div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  next_simplex_iter_ =</div>
|
|
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(min_iter, <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(max_iter, next_simplex_iter_));</div>
|
|
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span> }</div>
|
|
<div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  </div>
|
|
<div class="line"><a name="l01353"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a0010273383670a7c67b3b8f2660aa06b"> 1353</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a0010273383670a7c67b3b8f2660aa06b">LinearProgrammingConstraint::Propagate</a>() {</div>
|
|
<div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  UpdateBoundsOfLpVariables();</div>
|
|
<div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  </div>
|
|
<div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  <span class="comment">// TODO(user): It seems the time we loose by not stopping early might be worth</span></div>
|
|
<div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  <span class="comment">// it because we end up with a better explanation at optimality.</span></div>
|
|
<div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  glop::GlopParameters <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a> = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a04fb52e044ec108e110796e29804cf06">GetParameters</a>();</div>
|
|
<div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  <span class="keywordflow">if</span> (<span class="comment">/* DISABLES CODE */</span> (<span class="keyword">false</span>) && objective_is_defined_) {</div>
|
|
<div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  <span class="comment">// We put a limit on the dual objective since there is no point increasing</span></div>
|
|
<div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  <span class="comment">// it past our current objective upper-bound (we will already fail as soon</span></div>
|
|
<div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  <span class="comment">// as we pass it). Note that this limit is properly transformed using the</span></div>
|
|
<div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  <span class="comment">// objective scaling factor and offset stored in lp_data_.</span></div>
|
|
<div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  <span class="comment">// Note that we use a bigger epsilon here to be sure that if we abort</span></div>
|
|
<div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  <span class="comment">// because of this, we will report a conflict.</span></div>
|
|
<div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.set_objective_upper_limit(</div>
|
|
<div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  <span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(objective_cp_).value() +</div>
|
|
<div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  100.0 * kCpEpsilon));</div>
|
|
<div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  }</div>
|
|
<div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  </div>
|
|
<div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  <span class="comment">// Put an iteration limit on the work we do in the simplex for this call. Note</span></div>
|
|
<div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  <span class="comment">// that because we are "incremental", even if we don't solve it this time we</span></div>
|
|
<div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  <span class="comment">// will make progress towards a solve in the lower node of the tree search.</span></div>
|
|
<div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == 0) {</div>
|
|
<div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  <span class="comment">// TODO(user): Dynamically change the iteration limit for root node as</span></div>
|
|
<div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  <span class="comment">// well.</span></div>
|
|
<div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.set_max_number_of_iterations(2000);</div>
|
|
<div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.set_max_number_of_iterations(next_simplex_iter_);</div>
|
|
<div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  }</div>
|
|
<div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  <span class="keywordflow">if</span> (sat_parameters_.use_exact_lp_reason()) {</div>
|
|
<div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.set_change_status_to_imprecise(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.set_primal_feasibility_tolerance(1e-7);</div>
|
|
<div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.set_dual_feasibility_tolerance(1e-7);</div>
|
|
<div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  }</div>
|
|
<div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  </div>
|
|
<div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ae7202d055b6b172a8a1da4f5b136f9ea">SetParameters</a>(<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>);</div>
|
|
<div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#aa637d435b14a562f8203eb808add5399">NotifyThatMatrixIsUnchangedForNextSolve</a>();</div>
|
|
<div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  <span class="keywordflow">if</span> (!SolveLp()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  </div>
|
|
<div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  <span class="comment">// Add new constraints to the LP and resolve?</span></div>
|
|
<div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> max_cuts_rounds =</div>
|
|
<div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == 0</div>
|
|
<div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  ? sat_parameters_.max_cut_rounds_at_level_zero()</div>
|
|
<div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>  : 1;</div>
|
|
<div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  <span class="keywordtype">int</span> cuts_round = 0;</div>
|
|
<div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  <span class="keywordflow">while</span> (simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>() == <a class="code" href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9af00c8dbdd6e1f11bdae06be94277d293">glop::ProblemStatus::OPTIMAL</a> &&</div>
|
|
<div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  cuts_round < max_cuts_rounds) {</div>
|
|
<div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>  <span class="comment">// We wait for the first batch of problem constraints to be added before we</span></div>
|
|
<div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  <span class="comment">// begin to generate cuts.</span></div>
|
|
<div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  cuts_round++;</div>
|
|
<div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  <span class="keywordflow">if</span> (!integer_lp_.empty()) {</div>
|
|
<div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>  implied_bounds_processor_.<a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#a011f5f336c989d356c5f06a5793473c1">ClearCache</a>();</div>
|
|
<div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  implied_bounds_processor_.<a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#aecf53d8ca125b38267c341d76cebf6a9">SeparateSomeImpliedBoundCuts</a>(</div>
|
|
<div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  expanded_lp_solution_);</div>
|
|
<div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  </div>
|
|
<div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  <span class="comment">// The "generic" cuts are currently part of this class as they are using</span></div>
|
|
<div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>  <span class="comment">// data from the current LP.</span></div>
|
|
<div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  <span class="comment">// TODO(user): Refactor so that they are just normal cut generators?</span></div>
|
|
<div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == 0) {</div>
|
|
<div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  <span class="keywordflow">if</span> (sat_parameters_.add_mir_cuts()) AddMirCuts();</div>
|
|
<div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  <span class="keywordflow">if</span> (sat_parameters_.add_cg_cuts()) AddCGCuts();</div>
|
|
<div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  <span class="keywordflow">if</span> (sat_parameters_.add_zero_half_cuts()) AddZeroHalfCuts();</div>
|
|
<div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  }</div>
|
|
<div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  </div>
|
|
<div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  <span class="comment">// Try to add cuts.</span></div>
|
|
<div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  <span class="keywordflow">if</span> (!cut_generators_.empty() &&</div>
|
|
<div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == 0 ||</div>
|
|
<div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  !sat_parameters_.only_add_cuts_at_level_zero())) {</div>
|
|
<div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a>& generator : cut_generators_) {</div>
|
|
<div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  generator.generate_cuts(expanded_lp_solution_, &constraint_manager_);</div>
|
|
<div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  }</div>
|
|
<div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  }</div>
|
|
<div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  </div>
|
|
<div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  implied_bounds_processor_.<a class="code" href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#a6a4d553c8850c30428f1750d37d33d26">IbCutPool</a>().<a class="code" href="classoperations__research_1_1sat_1_1_top_n_cuts.html#afb0f85e921e0f240d59d2a739e6b5712">TransferToManager</a>(</div>
|
|
<div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  expanded_lp_solution_, &constraint_manager_);</div>
|
|
<div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  }</div>
|
|
<div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  </div>
|
|
<div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  <a class="code" href="structoperations__research_1_1glop_1_1_basis_state.html">glop::BasisState</a> state = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#adfbae19f81ecf38f67643dc8b7dcec25">GetState</a>();</div>
|
|
<div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  <span class="keywordflow">if</span> (constraint_manager_.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a1951610defebe3a3b82d99006793486a">ChangeLp</a>(expanded_lp_solution_, &state)) {</div>
|
|
<div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ac4d90743acfe39707571f84f096a58d7">LoadStateForNextSolve</a>(state);</div>
|
|
<div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  <span class="keywordflow">if</span> (!CreateLpFromConstraintManager()) {</div>
|
|
<div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a6d55b5b9adc499095dd57dd0c2b6c7df">ReportConflict</a>({});</div>
|
|
<div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  }</div>
|
|
<div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> old_obj = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a96c1f660991b5007ca24564f69cd27b8">GetObjectiveValue</a>();</div>
|
|
<div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>  <span class="keywordflow">if</span> (!SolveLp()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  <span class="keywordflow">if</span> (simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>() == <a class="code" href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9af00c8dbdd6e1f11bdae06be94277d293">glop::ProblemStatus::OPTIMAL</a>) {</div>
|
|
<div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Relaxation improvement "</span> << old_obj << <span class="stringliteral">" -> "</span></div>
|
|
<div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  << simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a96c1f660991b5007ca24564f69cd27b8">GetObjectiveValue</a>()</div>
|
|
<div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  << <span class="stringliteral">" diff: "</span> << simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a96c1f660991b5007ca24564f69cd27b8">GetObjectiveValue</a>() - old_obj</div>
|
|
<div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>  << <span class="stringliteral">" level: "</span> << trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>();</div>
|
|
<div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>  }</div>
|
|
<div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == 0) {</div>
|
|
<div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  lp_at_level_zero_is_final_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>  }</div>
|
|
<div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  }</div>
|
|
<div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  }</div>
|
|
<div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>  </div>
|
|
<div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  <span class="comment">// A dual-unbounded problem is infeasible. We use the dual ray reason.</span></div>
|
|
<div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  <span class="keywordflow">if</span> (simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>() == glop::ProblemStatus::DUAL_UNBOUNDED) {</div>
|
|
<div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  <span class="keywordflow">if</span> (sat_parameters_.use_exact_lp_reason()) {</div>
|
|
<div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  <span class="keywordflow">if</span> (!FillExactDualRayReason()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>  FillReducedCostReasonIn(simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a0e35521f3d40e263173626ecc8c21b06">GetDualRayRowCombination</a>(),</div>
|
|
<div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  &integer_reason_);</div>
|
|
<div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  }</div>
|
|
<div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a6d55b5b9adc499095dd57dd0c2b6c7df">ReportConflict</a>(integer_reason_);</div>
|
|
<div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  }</div>
|
|
<div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  </div>
|
|
<div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  <span class="comment">// TODO(user): Update limits for DUAL_UNBOUNDED status as well.</span></div>
|
|
<div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  UpdateSimplexIterationLimit(<span class="comment">/*min_iter=*/</span>10, <span class="comment">/*max_iter=*/</span>1000);</div>
|
|
<div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  </div>
|
|
<div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  <span class="comment">// Optimality deductions if problem has an objective.</span></div>
|
|
<div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  <span class="keywordflow">if</span> (objective_is_defined_ &&</div>
|
|
<div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  (simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>() == <a class="code" href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9af00c8dbdd6e1f11bdae06be94277d293">glop::ProblemStatus::OPTIMAL</a> ||</div>
|
|
<div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>() == glop::ProblemStatus::DUAL_FEASIBLE)) {</div>
|
|
<div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  <span class="comment">// Try to filter optimal objective value. Note that GetObjectiveValue()</span></div>
|
|
<div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>  <span class="comment">// already take care of the scaling so that it returns an objective in the</span></div>
|
|
<div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>  <span class="comment">// CP world.</span></div>
|
|
<div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> relaxed_optimal_objective = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a96c1f660991b5007ca24564f69cd27b8">GetObjectiveValue</a>();</div>
|
|
<div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>  <span class="keyword">const</span> IntegerValue approximate_new_lb(</div>
|
|
<div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  <span class="keyword">static_cast<</span><a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a><span class="keyword">></span>(std::ceil(relaxed_optimal_objective - kCpEpsilon)));</div>
|
|
<div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  </div>
|
|
<div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>  <span class="comment">// TODO(user): Maybe do a bit less computation when we cannot propagate</span></div>
|
|
<div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>  <span class="comment">// anything.</span></div>
|
|
<div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  <span class="keywordflow">if</span> (sat_parameters_.use_exact_lp_reason()) {</div>
|
|
<div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  <span class="keywordflow">if</span> (!ExactLpReasonning()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  </div>
|
|
<div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  <span class="comment">// Display when the inexact bound would have propagated more.</span></div>
|
|
<div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  <span class="keyword">const</span> IntegerValue propagated_lb =</div>
|
|
<div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(objective_cp_);</div>
|
|
<div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  <span class="keywordflow">if</span> (approximate_new_lb > propagated_lb) {</div>
|
|
<div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"LP objective [ "</span> << <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(propagated_lb) << <span class="stringliteral">", "</span></div>
|
|
<div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  << <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(objective_cp_))</div>
|
|
<div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>  << <span class="stringliteral">" ] approx_lb += "</span></div>
|
|
<div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  << <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(approximate_new_lb - propagated_lb) << <span class="stringliteral">" gap: "</span></div>
|
|
<div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  << integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(objective_cp_) - propagated_lb;</div>
|
|
<div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>  }</div>
|
|
<div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>  FillReducedCostReasonIn(simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a26689abee13abb7fc0d0cf99c1c7809b">GetReducedCosts</a>(), &integer_reason_);</div>
|
|
<div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> objective_cp_ub =</div>
|
|
<div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(objective_cp_));</div>
|
|
<div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  ReducedCostStrengtheningDeductions(objective_cp_ub -</div>
|
|
<div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>  relaxed_optimal_objective);</div>
|
|
<div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>  <span class="keywordflow">if</span> (!deductions_.empty()) {</div>
|
|
<div class="line"><a name="l01500"></a><span class="lineno"> 1500</span>  deductions_reason_ = integer_reason_;</div>
|
|
<div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>  deductions_reason_.push_back(</div>
|
|
<div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(objective_cp_));</div>
|
|
<div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  }</div>
|
|
<div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  </div>
|
|
<div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  <span class="comment">// Push new objective lb.</span></div>
|
|
<div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>  <span class="keywordflow">if</span> (approximate_new_lb > integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(objective_cp_)) {</div>
|
|
<div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> deduction =</div>
|
|
<div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(objective_cp_, approximate_new_lb);</div>
|
|
<div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(deduction, {}, integer_reason_)) {</div>
|
|
<div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  }</div>
|
|
<div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  }</div>
|
|
<div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  </div>
|
|
<div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  <span class="comment">// Push reduced cost strengthening bounds.</span></div>
|
|
<div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>  <span class="keywordflow">if</span> (!deductions_.empty()) {</div>
|
|
<div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> trail_index_with_same_reason = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> deduction : deductions_) {</div>
|
|
<div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(deduction, {}, deductions_reason_,</div>
|
|
<div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  trail_index_with_same_reason)) {</div>
|
|
<div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>  }</div>
|
|
<div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>  }</div>
|
|
<div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>  }</div>
|
|
<div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  }</div>
|
|
<div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  }</div>
|
|
<div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>  </div>
|
|
<div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  <span class="comment">// Copy more info about the current solution.</span></div>
|
|
<div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>  <span class="keywordflow">if</span> (simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>() == <a class="code" href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9af00c8dbdd6e1f11bdae06be94277d293">glop::ProblemStatus::OPTIMAL</a>) {</div>
|
|
<div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(lp_solution_is_set_);</div>
|
|
<div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  </div>
|
|
<div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>  lp_objective_ = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a96c1f660991b5007ca24564f69cd27b8">GetObjectiveValue</a>();</div>
|
|
<div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  lp_solution_is_integer_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = integer_variables_.size();</div>
|
|
<div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; i++) {</div>
|
|
<div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  lp_reduced_cost_[i] = scaler_.<a class="code" href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a7bda8ecfedb49d8fe3fa3868b49b1588">UnscaleReducedCost</a>(</div>
|
|
<div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  glop::ColIndex(i), simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a52c80b8028f6d54f8b2c02da3aac7510">GetReducedCost</a>(glop::ColIndex(i)));</div>
|
|
<div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  <span class="keywordflow">if</span> (std::abs(lp_solution_[i] - std::round(lp_solution_[i])) ></div>
|
|
<div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  kCpEpsilon) {</div>
|
|
<div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  lp_solution_is_integer_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  }</div>
|
|
<div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>  }</div>
|
|
<div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  </div>
|
|
<div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>  <span class="keywordflow">if</span> (compute_reduced_cost_averages_) {</div>
|
|
<div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  UpdateAverageReducedCosts();</div>
|
|
<div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  }</div>
|
|
<div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>  }</div>
|
|
<div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>  </div>
|
|
<div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>  <span class="keywordflow">if</span> (sat_parameters_.use_branching_in_lp() && objective_is_defined_ &&</div>
|
|
<div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == 0 && !is_degenerate_ &&</div>
|
|
<div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>  lp_solution_is_set_ && !lp_solution_is_integer_ &&</div>
|
|
<div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>  sat_parameters_.linearization_level() >= 2 &&</div>
|
|
<div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  compute_reduced_cost_averages_ &&</div>
|
|
<div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>() == <a class="code" href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9af00c8dbdd6e1f11bdae06be94277d293">glop::ProblemStatus::OPTIMAL</a>) {</div>
|
|
<div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  count_since_last_branching_++;</div>
|
|
<div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  <span class="keywordflow">if</span> (count_since_last_branching_ < branching_frequency_) {</div>
|
|
<div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>  }</div>
|
|
<div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  count_since_last_branching_ = 0;</div>
|
|
<div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  <span class="keywordtype">bool</span> branching_successful = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  </div>
|
|
<div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>  <span class="comment">// Strong branching on top max_num_branches variable.</span></div>
|
|
<div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> max_num_branches = 3;</div>
|
|
<div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = integer_variables_.size();</div>
|
|
<div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  std::vector<std::pair<double, IntegerVariable>> branching_vars;</div>
|
|
<div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; ++i) {</div>
|
|
<div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = integer_variables_[i];</div>
|
|
<div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  <span class="keyword">const</span> IntegerVariable positive_var = <a class="code" href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">PositiveVariable</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  </div>
|
|
<div class="line"><a name="l01569"></a><span class="lineno"> 1569</span>  <span class="comment">// Skip non fractional variables.</span></div>
|
|
<div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> current_value = <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a460fe5216ff7f997841e588d432be744">GetSolutionValue</a>(positive_var);</div>
|
|
<div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>  <span class="keywordflow">if</span> (std::abs(current_value - std::round(current_value)) <= kCpEpsilon) {</div>
|
|
<div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  }</div>
|
|
<div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  </div>
|
|
<div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  <span class="comment">// Skip ignored variables.</span></div>
|
|
<div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a309d057e12c8d4d393f13975eea2e2a9">IsCurrentlyIgnored</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  </div>
|
|
<div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  <span class="comment">// We can use any metric to select a variable to branch on. Reduced cost</span></div>
|
|
<div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  <span class="comment">// average is one of the most promissing metric. It captures the history</span></div>
|
|
<div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>  <span class="comment">// of the objective bound improvement in LP due to changes in the given</span></div>
|
|
<div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>  <span class="comment">// variable bounds.</span></div>
|
|
<div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>  <span class="comment">// NOTE: We also experimented using PseudoCosts and most recent reduced</span></div>
|
|
<div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  <span class="comment">// cost as metrics but it doesn't give better results on benchmarks.</span></div>
|
|
<div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> cost_i = rc_scores_[i];</div>
|
|
<div class="line"><a name="l01586"></a><span class="lineno"> 1586</span>  std::pair<double, IntegerVariable> branching_var =</div>
|
|
<div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  std::make_pair(-cost_i, positive_var);</div>
|
|
<div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  <span class="keyword">auto</span> iterator = std::lower_bound(branching_vars.begin(),</div>
|
|
<div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  branching_vars.end(), branching_var);</div>
|
|
<div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>  </div>
|
|
<div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  branching_vars.insert(iterator, branching_var);</div>
|
|
<div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  <span class="keywordflow">if</span> (branching_vars.size() > max_num_branches) {</div>
|
|
<div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>  branching_vars.resize(max_num_branches);</div>
|
|
<div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  }</div>
|
|
<div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>  }</div>
|
|
<div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  </div>
|
|
<div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair<double, IntegerVariable>& branching_var :</div>
|
|
<div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>  branching_vars) {</div>
|
|
<div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>  <span class="keyword">const</span> IntegerVariable positive_var = branching_var.second;</div>
|
|
<div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"Branching on: "</span> << positive_var;</div>
|
|
<div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>  <span class="keywordflow">if</span> (BranchOnVar(positive_var)) {</div>
|
|
<div class="line"><a name="l01602"></a><span class="lineno"> 1602</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"Branching successful."</span>;</div>
|
|
<div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>  branching_successful = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>  }</div>
|
|
<div class="line"><a name="l01607"></a><span class="lineno"> 1607</span>  }</div>
|
|
<div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>  <span class="keywordflow">if</span> (!branching_successful) {</div>
|
|
<div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  branching_frequency_ *= 2;</div>
|
|
<div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>  }</div>
|
|
<div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>  }</div>
|
|
<div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01613"></a><span class="lineno"> 1613</span> }</div>
|
|
<div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  </div>
|
|
<div class="line"><a name="l01615"></a><span class="lineno"> 1615</span> <span class="comment">// Returns kMinIntegerValue in case of overflow.</span></div>
|
|
<div class="line"><a name="l01616"></a><span class="lineno"> 1616</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01617"></a><span class="lineno"> 1617</span> <span class="comment">// TODO(user): Because of PreventOverflow(), this should actually never happen.</span></div>
|
|
<div class="line"><a name="l01618"></a><span class="lineno"> 1618</span> IntegerValue LinearProgrammingConstraint::GetImpliedLowerBound(</div>
|
|
<div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>& terms)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>  IntegerValue lower_bound(0);</div>
|
|
<div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = terms.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>.size();</div>
|
|
<div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = terms.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a>[i];</div>
|
|
<div class="line"><a name="l01624"></a><span class="lineno"> 1624</span>  <span class="keyword">const</span> IntegerValue coeff = terms.<a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">coeffs</a>[i];</div>
|
|
<div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(coeff, 0);</div>
|
|
<div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a> = coeff > 0 ? integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)</div>
|
|
<div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>  : integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">AddProductTo</a>(<a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a>, coeff, &lower_bound)) <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>  }</div>
|
|
<div class="line"><a name="l01630"></a><span class="lineno"> 1630</span>  <span class="keywordflow">return</span> lower_bound;</div>
|
|
<div class="line"><a name="l01631"></a><span class="lineno"> 1631</span> }</div>
|
|
<div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>  </div>
|
|
<div class="line"><a name="l01633"></a><span class="lineno"> 1633</span> <span class="keywordtype">bool</span> LinearProgrammingConstraint::PossibleOverflow(</div>
|
|
<div class="line"><a name="l01634"></a><span class="lineno"> 1634</span>  <span class="keyword">const</span> LinearConstraint& constraint) {</div>
|
|
<div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  IntegerValue lower_bound(0);</div>
|
|
<div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = constraint.vars.size();</div>
|
|
<div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = constraint.vars[i];</div>
|
|
<div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>  <span class="keyword">const</span> IntegerValue coeff = constraint.coeffs[i];</div>
|
|
<div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(coeff, 0);</div>
|
|
<div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a> = coeff > 0</div>
|
|
<div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>  ? integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)</div>
|
|
<div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>  : integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">AddProductTo</a>(<a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a>, coeff, &lower_bound)) {</div>
|
|
<div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>  }</div>
|
|
<div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>  }</div>
|
|
<div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> slack = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(lower_bound.value(), -constraint.ub.value());</div>
|
|
<div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  <span class="keywordflow">if</span> (slack == <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a> || slack == <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) {</div>
|
|
<div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>  }</div>
|
|
<div class="line"><a name="l01652"></a><span class="lineno"> 1652</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01653"></a><span class="lineno"> 1653</span> }</div>
|
|
<div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>  </div>
|
|
<div class="line"><a name="l01655"></a><span class="lineno"> 1655</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>  </div>
|
|
<div class="line"><a name="l01657"></a><span class="lineno"> 1657</span> absl::int128 FloorRatio128(absl::int128 x, IntegerValue positive_div) {</div>
|
|
<div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>  absl::int128 div128(positive_div.value());</div>
|
|
<div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>  absl::int128 result = x / div128;</div>
|
|
<div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>  <span class="keywordflow">if</span> (result * div128 > x) <span class="keywordflow">return</span> result - 1;</div>
|
|
<div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l01662"></a><span class="lineno"> 1662</span> }</div>
|
|
<div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>  </div>
|
|
<div class="line"><a name="l01664"></a><span class="lineno"> 1664</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>  </div>
|
|
<div class="line"><a name="l01666"></a><span class="lineno"> 1666</span> <span class="keywordtype">void</span> LinearProgrammingConstraint::PreventOverflow(LinearConstraint* constraint,</div>
|
|
<div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>  <span class="keywordtype">int</span> max_pow) {</div>
|
|
<div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>  <span class="comment">// Compute the min/max possible partial sum. Note that we need to use the</span></div>
|
|
<div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>  <span class="comment">// level zero bounds here since we might use this cut after backtrack.</span></div>
|
|
<div class="line"><a name="l01670"></a><span class="lineno"> 1670</span>  <span class="keywordtype">double</span> sum_min = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(0.0, <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(-constraint->ub));</div>
|
|
<div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>  <span class="keywordtype">double</span> sum_max = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(0.0, <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(-constraint->ub));</div>
|
|
<div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = constraint->vars.size();</div>
|
|
<div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = constraint->vars[i];</div>
|
|
<div class="line"><a name="l01675"></a><span class="lineno"> 1675</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> coeff = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(constraint->coeffs[i]);</div>
|
|
<div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> prod1 =</div>
|
|
<div class="line"><a name="l01677"></a><span class="lineno"> 1677</span>  coeff * <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> prod2 =</div>
|
|
<div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>  coeff * <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>  sum_min += <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(0.0, <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(prod1, prod2));</div>
|
|
<div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>  sum_max += <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(0.0, <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(prod1, prod2));</div>
|
|
<div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>  }</div>
|
|
<div class="line"><a name="l01683"></a><span class="lineno"> 1683</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> max_value = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>({sum_max, -sum_min, sum_max - sum_min});</div>
|
|
<div class="line"><a name="l01684"></a><span class="lineno"> 1684</span>  </div>
|
|
<div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>  <span class="keyword">const</span> IntegerValue divisor(std::ceil(std::ldexp(max_value, -max_pow)));</div>
|
|
<div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>  <span class="keywordflow">if</span> (divisor <= 1) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>  </div>
|
|
<div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  <span class="comment">// To be correct, we need to shift all variable so that they are positive.</span></div>
|
|
<div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>  <span class="comment">// Important: One might be tempted to think that using the current variable</span></div>
|
|
<div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>  <span class="comment">// bounds is okay here since we only use this to derive cut/constraint that</span></div>
|
|
<div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>  <span class="comment">// only needs to be locally valid. However, in some corner cases (like when</span></div>
|
|
<div class="line"><a name="l01693"></a><span class="lineno"> 1693</span>  <span class="comment">// one term become zero), we might loose the fact that we used one of the</span></div>
|
|
<div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>  <span class="comment">// variable bound to derive the new constraint, so we will miss it in the</span></div>
|
|
<div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>  <span class="comment">// explanation !!</span></div>
|
|
<div class="line"><a name="l01696"></a><span class="lineno"> 1696</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>  <span class="comment">// TODO(user): This code is tricky and similar to the one to generate cuts.</span></div>
|
|
<div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>  <span class="comment">// Test and may reduce the duplication? note however that here we use int128</span></div>
|
|
<div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>  <span class="comment">// to deal with potential overflow.</span></div>
|
|
<div class="line"><a name="l01700"></a><span class="lineno"> 1700</span>  <span class="keywordtype">int</span> new_size = 0;</div>
|
|
<div class="line"><a name="l01701"></a><span class="lineno"> 1701</span>  absl::int128 adjust = 0;</div>
|
|
<div class="line"><a name="l01702"></a><span class="lineno"> 1702</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l01703"></a><span class="lineno"> 1703</span>  <span class="keyword">const</span> IntegerValue old_coeff = constraint->coeffs[i];</div>
|
|
<div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>  <span class="keyword">const</span> IntegerValue new_coeff = <a class="code" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(old_coeff, divisor);</div>
|
|
<div class="line"><a name="l01705"></a><span class="lineno"> 1705</span>  </div>
|
|
<div class="line"><a name="l01706"></a><span class="lineno"> 1706</span>  <span class="comment">// Compute the rhs adjustement.</span></div>
|
|
<div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>  <span class="keyword">const</span> absl::int128 remainder =</div>
|
|
<div class="line"><a name="l01708"></a><span class="lineno"> 1708</span>  absl::int128(old_coeff.value()) -</div>
|
|
<div class="line"><a name="l01709"></a><span class="lineno"> 1709</span>  absl::int128(new_coeff.value()) * absl::int128(divisor.value());</div>
|
|
<div class="line"><a name="l01710"></a><span class="lineno"> 1710</span>  adjust +=</div>
|
|
<div class="line"><a name="l01711"></a><span class="lineno"> 1711</span>  remainder *</div>
|
|
<div class="line"><a name="l01712"></a><span class="lineno"> 1712</span>  absl::int128(</div>
|
|
<div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(constraint->vars[i]).value());</div>
|
|
<div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>  </div>
|
|
<div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>  <span class="keywordflow">if</span> (new_coeff == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>  constraint->vars[new_size] = constraint->vars[i];</div>
|
|
<div class="line"><a name="l01717"></a><span class="lineno"> 1717</span>  constraint->coeffs[new_size] = new_coeff;</div>
|
|
<div class="line"><a name="l01718"></a><span class="lineno"> 1718</span>  ++new_size;</div>
|
|
<div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>  }</div>
|
|
<div class="line"><a name="l01720"></a><span class="lineno"> 1720</span>  constraint->vars.resize(new_size);</div>
|
|
<div class="line"><a name="l01721"></a><span class="lineno"> 1721</span>  constraint->coeffs.resize(new_size);</div>
|
|
<div class="line"><a name="l01722"></a><span class="lineno"> 1722</span>  </div>
|
|
<div class="line"><a name="l01723"></a><span class="lineno"> 1723</span>  constraint->ub = IntegerValue(<span class="keyword">static_cast<</span><a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a><span class="keyword">></span>(</div>
|
|
<div class="line"><a name="l01724"></a><span class="lineno"> 1724</span>  FloorRatio128(absl::int128(constraint->ub.value()) - adjust, divisor)));</div>
|
|
<div class="line"><a name="l01725"></a><span class="lineno"> 1725</span> }</div>
|
|
<div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>  </div>
|
|
<div class="line"><a name="l01727"></a><span class="lineno"> 1727</span> <span class="comment">// TODO(user): combine this with RelaxLinearReason() to avoid the extra</span></div>
|
|
<div class="line"><a name="l01728"></a><span class="lineno"> 1728</span> <span class="comment">// magnitude vector and the weird precondition of RelaxLinearReason().</span></div>
|
|
<div class="line"><a name="l01729"></a><span class="lineno"> 1729</span> <span class="keywordtype">void</span> LinearProgrammingConstraint::SetImpliedLowerBoundReason(</div>
|
|
<div class="line"><a name="l01730"></a><span class="lineno"> 1730</span>  <span class="keyword">const</span> LinearConstraint& terms, IntegerValue slack) {</div>
|
|
<div class="line"><a name="l01731"></a><span class="lineno"> 1731</span>  integer_reason_.clear();</div>
|
|
<div class="line"><a name="l01732"></a><span class="lineno"> 1732</span>  std::vector<IntegerValue> magnitudes;</div>
|
|
<div class="line"><a name="l01733"></a><span class="lineno"> 1733</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = terms.vars.size();</div>
|
|
<div class="line"><a name="l01734"></a><span class="lineno"> 1734</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div>
|
|
<div class="line"><a name="l01735"></a><span class="lineno"> 1735</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = terms.vars[i];</div>
|
|
<div class="line"><a name="l01736"></a><span class="lineno"> 1736</span>  <span class="keyword">const</span> IntegerValue coeff = terms.coeffs[i];</div>
|
|
<div class="line"><a name="l01737"></a><span class="lineno"> 1737</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(coeff, 0);</div>
|
|
<div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>  <span class="keywordflow">if</span> (coeff > 0) {</div>
|
|
<div class="line"><a name="l01739"></a><span class="lineno"> 1739</span>  magnitudes.push_back(coeff);</div>
|
|
<div class="line"><a name="l01740"></a><span class="lineno"> 1740</span>  integer_reason_.push_back(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l01741"></a><span class="lineno"> 1741</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01742"></a><span class="lineno"> 1742</span>  magnitudes.push_back(-coeff);</div>
|
|
<div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>  integer_reason_.push_back(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l01744"></a><span class="lineno"> 1744</span>  }</div>
|
|
<div class="line"><a name="l01745"></a><span class="lineno"> 1745</span>  }</div>
|
|
<div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(slack, 0);</div>
|
|
<div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>  <span class="keywordflow">if</span> (slack > 0) {</div>
|
|
<div class="line"><a name="l01748"></a><span class="lineno"> 1748</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa981297d0a648cd5c3fef40e2edebf8a">RelaxLinearReason</a>(slack, magnitudes, &integer_reason_);</div>
|
|
<div class="line"><a name="l01749"></a><span class="lineno"> 1749</span>  }</div>
|
|
<div class="line"><a name="l01750"></a><span class="lineno"> 1750</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#adfce09ac65fc660f8a4f019f4072c6a7">RemoveLevelZeroBounds</a>(&integer_reason_);</div>
|
|
<div class="line"><a name="l01751"></a><span class="lineno"> 1751</span> }</div>
|
|
<div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>  </div>
|
|
<div class="line"><a name="l01753"></a><span class="lineno"> 1753</span> <span class="comment">// TODO(user): Provide a sparse interface.</span></div>
|
|
<div class="line"><a name="l01754"></a><span class="lineno"> 1754</span> std::vector<std::pair<RowIndex, IntegerValue>></div>
|
|
<div class="line"><a name="l01755"></a><span class="lineno"> 1755</span> LinearProgrammingConstraint::ScaleLpMultiplier(</div>
|
|
<div class="line"><a name="l01756"></a><span class="lineno"> 1756</span>  <span class="keywordtype">bool</span> take_objective_into_account,</div>
|
|
<div class="line"><a name="l01757"></a><span class="lineno"> 1757</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research_1_1glop.html#ae5fa9e57c2d31b294195ed8a9e17bfac">glop::DenseColumn</a>& dense_lp_multipliers, <a class="code" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">Fractional</a>* scaling,</div>
|
|
<div class="line"><a name="l01758"></a><span class="lineno"> 1758</span>  <span class="keywordtype">int</span> max_pow)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01759"></a><span class="lineno"> 1759</span>  <span class="keywordtype">double</span> max_sum = 0.0;</div>
|
|
<div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>  std::vector<std::pair<RowIndex, Fractional>> cp_multipliers;</div>
|
|
<div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>  <span class="keywordflow">for</span> (RowIndex <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>(0); <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < dense_lp_multipliers.size(); ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l01762"></a><span class="lineno"> 1762</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">Fractional</a> lp_multi = dense_lp_multipliers[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>];</div>
|
|
<div class="line"><a name="l01763"></a><span class="lineno"> 1763</span>  </div>
|
|
<div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>  <span class="comment">// We ignore small values since these are likely errors and will not</span></div>
|
|
<div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>  <span class="comment">// contribute much to the new lp constraint anyway.</span></div>
|
|
<div class="line"><a name="l01766"></a><span class="lineno"> 1766</span>  <span class="keywordflow">if</span> (std::abs(lp_multi) < 1e-12) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01767"></a><span class="lineno"> 1767</span>  </div>
|
|
<div class="line"><a name="l01768"></a><span class="lineno"> 1768</span>  <span class="comment">// Remove trivial bad cases.</span></div>
|
|
<div class="line"><a name="l01769"></a><span class="lineno"> 1769</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>  <span class="comment">// TODO(user): It might be better (when possible) to use the OPTIMAL row</span></div>
|
|
<div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>  <span class="comment">// status since in most situation we do want the constraint we add to be</span></div>
|
|
<div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>  <span class="comment">// tight under the current LP solution. Only for infeasible problem we might</span></div>
|
|
<div class="line"><a name="l01773"></a><span class="lineno"> 1773</span>  <span class="comment">// not have access to the status.</span></div>
|
|
<div class="line"><a name="l01774"></a><span class="lineno"> 1774</span>  <span class="keywordflow">if</span> (lp_multi > 0.0 && integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].ub >= <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>) {</div>
|
|
<div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01776"></a><span class="lineno"> 1776</span>  }</div>
|
|
<div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>  <span class="keywordflow">if</span> (lp_multi < 0.0 && integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].lb <= <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>) {</div>
|
|
<div class="line"><a name="l01778"></a><span class="lineno"> 1778</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>  }</div>
|
|
<div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>  </div>
|
|
<div class="line"><a name="l01781"></a><span class="lineno"> 1781</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">Fractional</a> cp_multi = scaler_.<a class="code" href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#ad59ff81132bc4f1ac9759c7bf20e6964">UnscaleDualValue</a>(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, lp_multi);</div>
|
|
<div class="line"><a name="l01782"></a><span class="lineno"> 1782</span>  cp_multipliers.push_back({<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, cp_multi});</div>
|
|
<div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>  max_sum += <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(infinity_norms_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>]) * std::abs(cp_multi);</div>
|
|
<div class="line"><a name="l01784"></a><span class="lineno"> 1784</span>  }</div>
|
|
<div class="line"><a name="l01785"></a><span class="lineno"> 1785</span>  </div>
|
|
<div class="line"><a name="l01786"></a><span class="lineno"> 1786</span>  <span class="comment">// This behave exactly like if we had another "objective" constraint with</span></div>
|
|
<div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>  <span class="comment">// an lp_multi of 1.0 and a cp_multi of 1.0.</span></div>
|
|
<div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>  <span class="keywordflow">if</span> (take_objective_into_account) {</div>
|
|
<div class="line"><a name="l01789"></a><span class="lineno"> 1789</span>  max_sum += <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(objective_infinity_norm_);</div>
|
|
<div class="line"><a name="l01790"></a><span class="lineno"> 1790</span>  }</div>
|
|
<div class="line"><a name="l01791"></a><span class="lineno"> 1791</span>  </div>
|
|
<div class="line"><a name="l01792"></a><span class="lineno"> 1792</span>  *scaling = 1.0;</div>
|
|
<div class="line"><a name="l01793"></a><span class="lineno"> 1793</span>  std::vector<std::pair<RowIndex, IntegerValue>> integer_multipliers;</div>
|
|
<div class="line"><a name="l01794"></a><span class="lineno"> 1794</span>  <span class="keywordflow">if</span> (max_sum == 0.0) {</div>
|
|
<div class="line"><a name="l01795"></a><span class="lineno"> 1795</span>  <span class="comment">// Empty linear combinaison.</span></div>
|
|
<div class="line"><a name="l01796"></a><span class="lineno"> 1796</span>  <span class="keywordflow">return</span> integer_multipliers;</div>
|
|
<div class="line"><a name="l01797"></a><span class="lineno"> 1797</span>  }</div>
|
|
<div class="line"><a name="l01798"></a><span class="lineno"> 1798</span>  </div>
|
|
<div class="line"><a name="l01799"></a><span class="lineno"> 1799</span>  <span class="comment">// We want max_sum * scaling to be <= 2 ^ max_pow and fit on an int64.</span></div>
|
|
<div class="line"><a name="l01800"></a><span class="lineno"> 1800</span>  <span class="comment">// We use a power of 2 as this seems to work better.</span></div>
|
|
<div class="line"><a name="l01801"></a><span class="lineno"> 1801</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> threshold = std::ldexp(1, max_pow) / max_sum;</div>
|
|
<div class="line"><a name="l01802"></a><span class="lineno"> 1802</span>  <span class="keywordflow">if</span> (threshold < 1.0) {</div>
|
|
<div class="line"><a name="l01803"></a><span class="lineno"> 1803</span>  <span class="comment">// TODO(user): we currently do not support scaling down, so we just abort</span></div>
|
|
<div class="line"><a name="l01804"></a><span class="lineno"> 1804</span>  <span class="comment">// in this case.</span></div>
|
|
<div class="line"><a name="l01805"></a><span class="lineno"> 1805</span>  <span class="keywordflow">return</span> integer_multipliers;</div>
|
|
<div class="line"><a name="l01806"></a><span class="lineno"> 1806</span>  }</div>
|
|
<div class="line"><a name="l01807"></a><span class="lineno"> 1807</span>  <span class="keywordflow">while</span> (2 * *scaling <= threshold) *scaling *= 2;</div>
|
|
<div class="line"><a name="l01808"></a><span class="lineno"> 1808</span>  </div>
|
|
<div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>  <span class="comment">// Scale the multipliers by *scaling.</span></div>
|
|
<div class="line"><a name="l01810"></a><span class="lineno"> 1810</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01811"></a><span class="lineno"> 1811</span>  <span class="comment">// TODO(user): Maybe use int128 to avoid overflow?</span></div>
|
|
<div class="line"><a name="l01812"></a><span class="lineno"> 1812</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> entry : cp_multipliers) {</div>
|
|
<div class="line"><a name="l01813"></a><span class="lineno"> 1813</span>  <span class="keyword">const</span> IntegerValue coeff(std::round(entry.second * (*scaling)));</div>
|
|
<div class="line"><a name="l01814"></a><span class="lineno"> 1814</span>  <span class="keywordflow">if</span> (coeff != 0) integer_multipliers.push_back({entry.first, coeff});</div>
|
|
<div class="line"><a name="l01815"></a><span class="lineno"> 1815</span>  }</div>
|
|
<div class="line"><a name="l01816"></a><span class="lineno"> 1816</span>  <span class="keywordflow">return</span> integer_multipliers;</div>
|
|
<div class="line"><a name="l01817"></a><span class="lineno"> 1817</span> }</div>
|
|
<div class="line"><a name="l01818"></a><span class="lineno"> 1818</span>  </div>
|
|
<div class="line"><a name="l01819"></a><span class="lineno"> 1819</span> <span class="keywordtype">bool</span> LinearProgrammingConstraint::ComputeNewLinearConstraint(</div>
|
|
<div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>  <span class="keyword">const</span> std::vector<std::pair<RowIndex, IntegerValue>>& integer_multipliers,</div>
|
|
<div class="line"><a name="l01821"></a><span class="lineno"> 1821</span>  ScatteredIntegerVector* scattered_vector, IntegerValue* upper_bound)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01822"></a><span class="lineno"> 1822</span>  <span class="comment">// Initialize the new constraint.</span></div>
|
|
<div class="line"><a name="l01823"></a><span class="lineno"> 1823</span>  *upper_bound = 0;</div>
|
|
<div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>  scattered_vector->ClearAndResize(integer_variables_.size());</div>
|
|
<div class="line"><a name="l01825"></a><span class="lineno"> 1825</span>  </div>
|
|
<div class="line"><a name="l01826"></a><span class="lineno"> 1826</span>  <span class="comment">// Compute the new constraint by taking the linear combination given by</span></div>
|
|
<div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>  <span class="comment">// integer_multipliers of the integer constraints in integer_lp_.</span></div>
|
|
<div class="line"><a name="l01828"></a><span class="lineno"> 1828</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair<RowIndex, IntegerValue> term : integer_multipliers) {</div>
|
|
<div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>  <span class="keyword">const</span> RowIndex <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = term.first;</div>
|
|
<div class="line"><a name="l01830"></a><span class="lineno"> 1830</span>  <span class="keyword">const</span> IntegerValue multiplier = term.second;</div>
|
|
<div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, integer_lp_.size());</div>
|
|
<div class="line"><a name="l01832"></a><span class="lineno"> 1832</span>  </div>
|
|
<div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>  <span class="comment">// Update the constraint.</span></div>
|
|
<div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>  <span class="keywordflow">if</span> (!scattered_vector->AddLinearExpressionMultiple(</div>
|
|
<div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>  multiplier, integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].terms)) {</div>
|
|
<div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01837"></a><span class="lineno"> 1837</span>  }</div>
|
|
<div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>  </div>
|
|
<div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>  <span class="comment">// Update the upper bound.</span></div>
|
|
<div class="line"><a name="l01840"></a><span class="lineno"> 1840</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a> =</div>
|
|
<div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>  multiplier > 0 ? integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].ub : integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].lb;</div>
|
|
<div class="line"><a name="l01842"></a><span class="lineno"> 1842</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">AddProductTo</a>(multiplier, <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a>, upper_bound)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>  }</div>
|
|
<div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>  </div>
|
|
<div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01846"></a><span class="lineno"> 1846</span> }</div>
|
|
<div class="line"><a name="l01847"></a><span class="lineno"> 1847</span>  </div>
|
|
<div class="line"><a name="l01848"></a><span class="lineno"> 1848</span> <span class="comment">// TODO(user): no need to update the multipliers.</span></div>
|
|
<div class="line"><a name="l01849"></a><span class="lineno"> 1849</span> <span class="keywordtype">void</span> LinearProgrammingConstraint::AdjustNewLinearConstraint(</div>
|
|
<div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>  std::vector<std::pair<glop::RowIndex, IntegerValue>>* integer_multipliers,</div>
|
|
<div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>  ScatteredIntegerVector* scattered_vector, IntegerValue* upper_bound)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>  <span class="keyword">const</span> IntegerValue kMaxWantedCoeff(1e18);</div>
|
|
<div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>  <span class="keywordflow">for</span> (std::pair<RowIndex, IntegerValue>& term : *integer_multipliers) {</div>
|
|
<div class="line"><a name="l01854"></a><span class="lineno"> 1854</span>  <span class="keyword">const</span> RowIndex <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = term.first;</div>
|
|
<div class="line"><a name="l01855"></a><span class="lineno"> 1855</span>  <span class="keyword">const</span> IntegerValue multiplier = term.second;</div>
|
|
<div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>  <span class="keywordflow">if</span> (multiplier == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>  </div>
|
|
<div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>  <span class="comment">// We will only allow change of the form "multiplier += to_add" with to_add</span></div>
|
|
<div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>  <span class="comment">// in [-negative_limit, positive_limit].</span></div>
|
|
<div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>  IntegerValue negative_limit = kMaxWantedCoeff;</div>
|
|
<div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>  IntegerValue positive_limit = kMaxWantedCoeff;</div>
|
|
<div class="line"><a name="l01862"></a><span class="lineno"> 1862</span>  </div>
|
|
<div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>  <span class="comment">// Make sure we never change the sign of the multiplier, except if the</span></div>
|
|
<div class="line"><a name="l01864"></a><span class="lineno"> 1864</span>  <span class="comment">// row is an equality in which case we don't care.</span></div>
|
|
<div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>  <span class="keywordflow">if</span> (integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].ub != integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].lb) {</div>
|
|
<div class="line"><a name="l01866"></a><span class="lineno"> 1866</span>  <span class="keywordflow">if</span> (multiplier > 0) {</div>
|
|
<div class="line"><a name="l01867"></a><span class="lineno"> 1867</span>  negative_limit = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(negative_limit, multiplier);</div>
|
|
<div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>  positive_limit = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(positive_limit, -multiplier);</div>
|
|
<div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>  }</div>
|
|
<div class="line"><a name="l01871"></a><span class="lineno"> 1871</span>  }</div>
|
|
<div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>  </div>
|
|
<div class="line"><a name="l01873"></a><span class="lineno"> 1873</span>  <span class="comment">// Make sure upper_bound + to_add * row_bound never overflow.</span></div>
|
|
<div class="line"><a name="l01874"></a><span class="lineno"> 1874</span>  <span class="keyword">const</span> IntegerValue row_bound =</div>
|
|
<div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>  multiplier > 0 ? integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].ub : integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].lb;</div>
|
|
<div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>  <span class="keywordflow">if</span> (row_bound != 0) {</div>
|
|
<div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>  <span class="keyword">const</span> IntegerValue limit1 = <a class="code" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(</div>
|
|
<div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(IntegerValue(0), kMaxWantedCoeff - <a class="code" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(*upper_bound)),</div>
|
|
<div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(row_bound));</div>
|
|
<div class="line"><a name="l01880"></a><span class="lineno"> 1880</span>  <span class="keyword">const</span> IntegerValue limit2 =</div>
|
|
<div class="line"><a name="l01881"></a><span class="lineno"> 1881</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(kMaxWantedCoeff, <a class="code" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(row_bound));</div>
|
|
<div class="line"><a name="l01882"></a><span class="lineno"> 1882</span>  <span class="keywordflow">if</span> (*upper_bound > 0 == row_bound > 0) { <span class="comment">// Same sign.</span></div>
|
|
<div class="line"><a name="l01883"></a><span class="lineno"> 1883</span>  positive_limit = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(positive_limit, limit1);</div>
|
|
<div class="line"><a name="l01884"></a><span class="lineno"> 1884</span>  negative_limit = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(negative_limit, limit2);</div>
|
|
<div class="line"><a name="l01885"></a><span class="lineno"> 1885</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01886"></a><span class="lineno"> 1886</span>  negative_limit = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(negative_limit, limit1);</div>
|
|
<div class="line"><a name="l01887"></a><span class="lineno"> 1887</span>  positive_limit = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(positive_limit, limit2);</div>
|
|
<div class="line"><a name="l01888"></a><span class="lineno"> 1888</span>  }</div>
|
|
<div class="line"><a name="l01889"></a><span class="lineno"> 1889</span>  }</div>
|
|
<div class="line"><a name="l01890"></a><span class="lineno"> 1890</span>  </div>
|
|
<div class="line"><a name="l01891"></a><span class="lineno"> 1891</span>  <span class="comment">// If we add the row to the scattered_vector, diff will indicate by how much</span></div>
|
|
<div class="line"><a name="l01892"></a><span class="lineno"> 1892</span>  <span class="comment">// |upper_bound - ImpliedLB(scattered_vector)| will change. That correspond</span></div>
|
|
<div class="line"><a name="l01893"></a><span class="lineno"> 1893</span>  <span class="comment">// to increasing the multiplier by 1.</span></div>
|
|
<div class="line"><a name="l01894"></a><span class="lineno"> 1894</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01895"></a><span class="lineno"> 1895</span>  <span class="comment">// At this stage, we are not sure computing sum coeff * bound will not</span></div>
|
|
<div class="line"><a name="l01896"></a><span class="lineno"> 1896</span>  <span class="comment">// overflow, so we use floating point numbers. It is fine to do so since</span></div>
|
|
<div class="line"><a name="l01897"></a><span class="lineno"> 1897</span>  <span class="comment">// this is not directly involved in the actual exact constraint generation:</span></div>
|
|
<div class="line"><a name="l01898"></a><span class="lineno"> 1898</span>  <span class="comment">// these variables are just used in an heuristic.</span></div>
|
|
<div class="line"><a name="l01899"></a><span class="lineno"> 1899</span>  <span class="keywordtype">double</span> positive_diff = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(row_bound);</div>
|
|
<div class="line"><a name="l01900"></a><span class="lineno"> 1900</span>  <span class="keywordtype">double</span> negative_diff = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(row_bound);</div>
|
|
<div class="line"><a name="l01901"></a><span class="lineno"> 1901</span>  </div>
|
|
<div class="line"><a name="l01902"></a><span class="lineno"> 1902</span>  <span class="comment">// TODO(user): we could relax a bit some of the condition and allow a sign</span></div>
|
|
<div class="line"><a name="l01903"></a><span class="lineno"> 1903</span>  <span class="comment">// change. It is just trickier to compute the diff when we allow such</span></div>
|
|
<div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>  <span class="comment">// changes.</span></div>
|
|
<div class="line"><a name="l01905"></a><span class="lineno"> 1905</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> entry : integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].terms) {</div>
|
|
<div class="line"><a name="l01906"></a><span class="lineno"> 1906</span>  <span class="keyword">const</span> ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = entry.first;</div>
|
|
<div class="line"><a name="l01907"></a><span class="lineno"> 1907</span>  <span class="keyword">const</span> IntegerValue coeff = entry.second;</div>
|
|
<div class="line"><a name="l01908"></a><span class="lineno"> 1908</span>  <span class="keyword">const</span> IntegerValue abs_coef = <a class="code" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(coeff);</div>
|
|
<div class="line"><a name="l01909"></a><span class="lineno"> 1909</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(coeff, 0);</div>
|
|
<div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>  </div>
|
|
<div class="line"><a name="l01911"></a><span class="lineno"> 1911</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = integer_variables_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>.value()];</div>
|
|
<div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>  <span class="keyword">const</span> IntegerValue lb = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>  <span class="keyword">const</span> IntegerValue ub = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l01914"></a><span class="lineno"> 1914</span>  </div>
|
|
<div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>  <span class="comment">// Moving a variable away from zero seems to improve the bound even</span></div>
|
|
<div class="line"><a name="l01916"></a><span class="lineno"> 1916</span>  <span class="comment">// if it reduces the number of non-zero. Note that this is because of</span></div>
|
|
<div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>  <span class="comment">// this that positive_diff and negative_diff are not the same.</span></div>
|
|
<div class="line"><a name="l01918"></a><span class="lineno"> 1918</span>  <span class="keyword">const</span> IntegerValue current = (*scattered_vector)[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>];</div>
|
|
<div class="line"><a name="l01919"></a><span class="lineno"> 1919</span>  <span class="keywordflow">if</span> (current == 0) {</div>
|
|
<div class="line"><a name="l01920"></a><span class="lineno"> 1920</span>  <span class="keyword">const</span> IntegerValue overflow_limit(</div>
|
|
<div class="line"><a name="l01921"></a><span class="lineno"> 1921</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(kMaxWantedCoeff, abs_coef));</div>
|
|
<div class="line"><a name="l01922"></a><span class="lineno"> 1922</span>  positive_limit = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(positive_limit, overflow_limit);</div>
|
|
<div class="line"><a name="l01923"></a><span class="lineno"> 1923</span>  negative_limit = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(negative_limit, overflow_limit);</div>
|
|
<div class="line"><a name="l01924"></a><span class="lineno"> 1924</span>  <span class="keywordflow">if</span> (coeff > 0) {</div>
|
|
<div class="line"><a name="l01925"></a><span class="lineno"> 1925</span>  positive_diff -= <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(coeff) * <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(lb);</div>
|
|
<div class="line"><a name="l01926"></a><span class="lineno"> 1926</span>  negative_diff -= <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(coeff) * <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(ub);</div>
|
|
<div class="line"><a name="l01927"></a><span class="lineno"> 1927</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01928"></a><span class="lineno"> 1928</span>  positive_diff -= <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(coeff) * <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(ub);</div>
|
|
<div class="line"><a name="l01929"></a><span class="lineno"> 1929</span>  negative_diff -= <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(coeff) * <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(lb);</div>
|
|
<div class="line"><a name="l01930"></a><span class="lineno"> 1930</span>  }</div>
|
|
<div class="line"><a name="l01931"></a><span class="lineno"> 1931</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>  }</div>
|
|
<div class="line"><a name="l01933"></a><span class="lineno"> 1933</span>  </div>
|
|
<div class="line"><a name="l01934"></a><span class="lineno"> 1934</span>  <span class="comment">// We don't want to change the sign of current (except if the variable is</span></div>
|
|
<div class="line"><a name="l01935"></a><span class="lineno"> 1935</span>  <span class="comment">// fixed) or to have an overflow.</span></div>
|
|
<div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01937"></a><span class="lineno"> 1937</span>  <span class="comment">// Corner case:</span></div>
|
|
<div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>  <span class="comment">// - IntTypeAbs(current) can be larger than kMaxWantedCoeff!</span></div>
|
|
<div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>  <span class="comment">// - The code assumes that 2 * kMaxWantedCoeff do not overflow.</span></div>
|
|
<div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>  <span class="keyword">const</span> IntegerValue current_magnitude = <a class="code" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(current);</div>
|
|
<div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>  <span class="keyword">const</span> IntegerValue other_direction_limit = <a class="code" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(</div>
|
|
<div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>  lb == ub</div>
|
|
<div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>  ? kMaxWantedCoeff + <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(current_magnitude,</div>
|
|
<div class="line"><a name="l01944"></a><span class="lineno"> 1944</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a> - kMaxWantedCoeff)</div>
|
|
<div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>  : current_magnitude,</div>
|
|
<div class="line"><a name="l01946"></a><span class="lineno"> 1946</span>  abs_coef);</div>
|
|
<div class="line"><a name="l01947"></a><span class="lineno"> 1947</span>  <span class="keyword">const</span> IntegerValue same_direction_limit(<a class="code" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(</div>
|
|
<div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(IntegerValue(0), kMaxWantedCoeff - current_magnitude),</div>
|
|
<div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>  abs_coef));</div>
|
|
<div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>  <span class="keywordflow">if</span> (current > 0 == coeff > 0) { <span class="comment">// Same sign.</span></div>
|
|
<div class="line"><a name="l01951"></a><span class="lineno"> 1951</span>  negative_limit = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(negative_limit, other_direction_limit);</div>
|
|
<div class="line"><a name="l01952"></a><span class="lineno"> 1952</span>  positive_limit = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(positive_limit, same_direction_limit);</div>
|
|
<div class="line"><a name="l01953"></a><span class="lineno"> 1953</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01954"></a><span class="lineno"> 1954</span>  negative_limit = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(negative_limit, same_direction_limit);</div>
|
|
<div class="line"><a name="l01955"></a><span class="lineno"> 1955</span>  positive_limit = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(positive_limit, other_direction_limit);</div>
|
|
<div class="line"><a name="l01956"></a><span class="lineno"> 1956</span>  }</div>
|
|
<div class="line"><a name="l01957"></a><span class="lineno"> 1957</span>  </div>
|
|
<div class="line"><a name="l01958"></a><span class="lineno"> 1958</span>  <span class="comment">// This is how diff change.</span></div>
|
|
<div class="line"><a name="l01959"></a><span class="lineno"> 1959</span>  <span class="keyword">const</span> IntegerValue implied = current > 0 ? lb : ub;</div>
|
|
<div class="line"><a name="l01960"></a><span class="lineno"> 1960</span>  <span class="keywordflow">if</span> (implied != 0) {</div>
|
|
<div class="line"><a name="l01961"></a><span class="lineno"> 1961</span>  positive_diff -= <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(coeff) * <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(implied);</div>
|
|
<div class="line"><a name="l01962"></a><span class="lineno"> 1962</span>  negative_diff -= <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(coeff) * <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(implied);</div>
|
|
<div class="line"><a name="l01963"></a><span class="lineno"> 1963</span>  }</div>
|
|
<div class="line"><a name="l01964"></a><span class="lineno"> 1964</span>  }</div>
|
|
<div class="line"><a name="l01965"></a><span class="lineno"> 1965</span>  </div>
|
|
<div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>  <span class="comment">// Only add a multiple of this row if it tighten the final constraint.</span></div>
|
|
<div class="line"><a name="l01967"></a><span class="lineno"> 1967</span>  <span class="comment">// The positive_diff/negative_diff are supposed to be integer modulo the</span></div>
|
|
<div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>  <span class="comment">// double precision, so we only add a multiple if they seems far away from</span></div>
|
|
<div class="line"><a name="l01969"></a><span class="lineno"> 1969</span>  <span class="comment">// zero.</span></div>
|
|
<div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>  IntegerValue to_add(0);</div>
|
|
<div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>  <span class="keywordflow">if</span> (positive_diff <= -1.0 && positive_limit > 0) {</div>
|
|
<div class="line"><a name="l01972"></a><span class="lineno"> 1972</span>  to_add = positive_limit;</div>
|
|
<div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>  }</div>
|
|
<div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>  <span class="keywordflow">if</span> (negative_diff >= 1.0 && negative_limit > 0) {</div>
|
|
<div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>  <span class="comment">// Pick this if it is better than the positive sign.</span></div>
|
|
<div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>  <span class="keywordflow">if</span> (to_add == 0 ||</div>
|
|
<div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>  std::abs(<a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(negative_limit) * negative_diff) ></div>
|
|
<div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>  std::abs(<a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(positive_limit) * positive_diff)) {</div>
|
|
<div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>  to_add = -negative_limit;</div>
|
|
<div class="line"><a name="l01980"></a><span class="lineno"> 1980</span>  }</div>
|
|
<div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>  }</div>
|
|
<div class="line"><a name="l01982"></a><span class="lineno"> 1982</span>  <span class="keywordflow">if</span> (to_add != 0) {</div>
|
|
<div class="line"><a name="l01983"></a><span class="lineno"> 1983</span>  term.second += to_add;</div>
|
|
<div class="line"><a name="l01984"></a><span class="lineno"> 1984</span>  *upper_bound += to_add * row_bound;</div>
|
|
<div class="line"><a name="l01985"></a><span class="lineno"> 1985</span>  </div>
|
|
<div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>  <span class="comment">// TODO(user): we could avoid checking overflow here, but this is likely</span></div>
|
|
<div class="line"><a name="l01987"></a><span class="lineno"> 1987</span>  <span class="comment">// not in the hot loop.</span></div>
|
|
<div class="line"><a name="l01988"></a><span class="lineno"> 1988</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(scattered_vector->AddLinearExpressionMultiple(</div>
|
|
<div class="line"><a name="l01989"></a><span class="lineno"> 1989</span>  to_add, integer_lp_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].terms));</div>
|
|
<div class="line"><a name="l01990"></a><span class="lineno"> 1990</span>  }</div>
|
|
<div class="line"><a name="l01991"></a><span class="lineno"> 1991</span>  }</div>
|
|
<div class="line"><a name="l01992"></a><span class="lineno"> 1992</span> }</div>
|
|
<div class="line"><a name="l01993"></a><span class="lineno"> 1993</span>  </div>
|
|
<div class="line"><a name="l01994"></a><span class="lineno"> 1994</span> <span class="comment">// The "exact" computation go as follow:</span></div>
|
|
<div class="line"><a name="l01995"></a><span class="lineno"> 1995</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01996"></a><span class="lineno"> 1996</span> <span class="comment">// Given any INTEGER linear combination of the LP constraints, we can create a</span></div>
|
|
<div class="line"><a name="l01997"></a><span class="lineno"> 1997</span> <span class="comment">// new integer constraint that is valid (its computation must not overflow</span></div>
|
|
<div class="line"><a name="l01998"></a><span class="lineno"> 1998</span> <span class="comment">// though). Lets call this "linear_combination <= ub". We can then always add to</span></div>
|
|
<div class="line"><a name="l01999"></a><span class="lineno"> 1999</span> <span class="comment">// it the inequality "objective_terms <= objective_var", so we get:</span></div>
|
|
<div class="line"><a name="l02000"></a><span class="lineno"> 2000</span> <span class="comment">// ImpliedLB(objective_terms + linear_combination) - ub <= objective_var.</span></div>
|
|
<div class="line"><a name="l02001"></a><span class="lineno"> 2001</span> <span class="comment">// where ImpliedLB() is computed from the variable current bounds.</span></div>
|
|
<div class="line"><a name="l02002"></a><span class="lineno"> 2002</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l02003"></a><span class="lineno"> 2003</span> <span class="comment">// Now, if we use for the linear combination and approximation of the optimal</span></div>
|
|
<div class="line"><a name="l02004"></a><span class="lineno"> 2004</span> <span class="comment">// negated dual LP values (by scaling them and rounding them to integer), we</span></div>
|
|
<div class="line"><a name="l02005"></a><span class="lineno"> 2005</span> <span class="comment">// will get an EXACT objective lower bound that is more or less the same as the</span></div>
|
|
<div class="line"><a name="l02006"></a><span class="lineno"> 2006</span> <span class="comment">// inexact bound given by the LP relaxation. This allows to derive exact reasons</span></div>
|
|
<div class="line"><a name="l02007"></a><span class="lineno"> 2007</span> <span class="comment">// for any propagation done by this constraint.</span></div>
|
|
<div class="line"><a name="l02008"></a><span class="lineno"> 2008</span> <span class="keywordtype">bool</span> LinearProgrammingConstraint::ExactLpReasonning() {</div>
|
|
<div class="line"><a name="l02009"></a><span class="lineno"> 2009</span>  <span class="comment">// Clear old reason and deductions.</span></div>
|
|
<div class="line"><a name="l02010"></a><span class="lineno"> 2010</span>  integer_reason_.clear();</div>
|
|
<div class="line"><a name="l02011"></a><span class="lineno"> 2011</span>  deductions_.clear();</div>
|
|
<div class="line"><a name="l02012"></a><span class="lineno"> 2012</span>  deductions_reason_.clear();</div>
|
|
<div class="line"><a name="l02013"></a><span class="lineno"> 2013</span>  </div>
|
|
<div class="line"><a name="l02014"></a><span class="lineno"> 2014</span>  <span class="comment">// The row multipliers will be the negation of the LP duals.</span></div>
|
|
<div class="line"><a name="l02015"></a><span class="lineno"> 2015</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l02016"></a><span class="lineno"> 2016</span>  <span class="comment">// TODO(user): Provide and use a sparse API in Glop to get the duals.</span></div>
|
|
<div class="line"><a name="l02017"></a><span class="lineno"> 2017</span>  <span class="keyword">const</span> RowIndex num_rows = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ace91e968c3b7369698c7563ca1c9c6e8">GetProblemNumRows</a>();</div>
|
|
<div class="line"><a name="l02018"></a><span class="lineno"> 2018</span>  <a class="code" href="namespaceoperations__research_1_1glop.html#ae5fa9e57c2d31b294195ed8a9e17bfac">glop::DenseColumn</a> lp_multipliers(num_rows);</div>
|
|
<div class="line"><a name="l02019"></a><span class="lineno"> 2019</span>  <span class="keywordflow">for</span> (RowIndex <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>(0); <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < num_rows; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l02020"></a><span class="lineno"> 2020</span>  lp_multipliers[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>] = -simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#aa4c5e551e5a00ff4ae97d8467184221b">GetDualValue</a>(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>);</div>
|
|
<div class="line"><a name="l02021"></a><span class="lineno"> 2021</span>  }</div>
|
|
<div class="line"><a name="l02022"></a><span class="lineno"> 2022</span>  </div>
|
|
<div class="line"><a name="l02023"></a><span class="lineno"> 2023</span>  <a class="code" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">Fractional</a> scaling;</div>
|
|
<div class="line"><a name="l02024"></a><span class="lineno"> 2024</span>  std::vector<std::pair<RowIndex, IntegerValue>> integer_multipliers =</div>
|
|
<div class="line"><a name="l02025"></a><span class="lineno"> 2025</span>  ScaleLpMultiplier(<span class="comment">/*take_objective_into_account=*/</span><span class="keyword">true</span>, lp_multipliers,</div>
|
|
<div class="line"><a name="l02026"></a><span class="lineno"> 2026</span>  &scaling);</div>
|
|
<div class="line"><a name="l02027"></a><span class="lineno"> 2027</span>  </div>
|
|
<div class="line"><a name="l02028"></a><span class="lineno"> 2028</span>  IntegerValue rc_ub;</div>
|
|
<div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>  <span class="keywordflow">if</span> (!ComputeNewLinearConstraint(integer_multipliers, &tmp_scattered_vector_,</div>
|
|
<div class="line"><a name="l02030"></a><span class="lineno"> 2030</span>  &rc_ub)) {</div>
|
|
<div class="line"><a name="l02031"></a><span class="lineno"> 2031</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Issue while computing the exact LP reason. Aborting."</span>;</div>
|
|
<div class="line"><a name="l02032"></a><span class="lineno"> 2032</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>  }</div>
|
|
<div class="line"><a name="l02034"></a><span class="lineno"> 2034</span>  </div>
|
|
<div class="line"><a name="l02035"></a><span class="lineno"> 2035</span>  <span class="comment">// The "objective constraint" behave like if the unscaled cp multiplier was</span></div>
|
|
<div class="line"><a name="l02036"></a><span class="lineno"> 2036</span>  <span class="comment">// 1.0, so we will multiply it by this number and add it to reduced_costs.</span></div>
|
|
<div class="line"><a name="l02037"></a><span class="lineno"> 2037</span>  <span class="keyword">const</span> IntegerValue obj_scale(std::round(scaling));</div>
|
|
<div class="line"><a name="l02038"></a><span class="lineno"> 2038</span>  <span class="keywordflow">if</span> (obj_scale == 0) {</div>
|
|
<div class="line"><a name="l02039"></a><span class="lineno"> 2039</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Overflow during exact LP reasoning. scaling="</span> << scaling;</div>
|
|
<div class="line"><a name="l02040"></a><span class="lineno"> 2040</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02041"></a><span class="lineno"> 2041</span>  }</div>
|
|
<div class="line"><a name="l02042"></a><span class="lineno"> 2042</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(tmp_scattered_vector_.<a class="code" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#aeb3044e58e1e28e857c5265734ae7e30">AddLinearExpressionMultiple</a>(obj_scale,</div>
|
|
<div class="line"><a name="l02043"></a><span class="lineno"> 2043</span>  integer_objective_));</div>
|
|
<div class="line"><a name="l02044"></a><span class="lineno"> 2044</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">AddProductTo</a>(-obj_scale, integer_objective_offset_, &rc_ub));</div>
|
|
<div class="line"><a name="l02045"></a><span class="lineno"> 2045</span>  AdjustNewLinearConstraint(&integer_multipliers, &tmp_scattered_vector_,</div>
|
|
<div class="line"><a name="l02046"></a><span class="lineno"> 2046</span>  &rc_ub);</div>
|
|
<div class="line"><a name="l02047"></a><span class="lineno"> 2047</span>  </div>
|
|
<div class="line"><a name="l02048"></a><span class="lineno"> 2048</span>  <span class="comment">// Create the IntegerSumLE that will allow to propagate the objective and more</span></div>
|
|
<div class="line"><a name="l02049"></a><span class="lineno"> 2049</span>  <span class="comment">// generally do the reduced cost fixing.</span></div>
|
|
<div class="line"><a name="l02050"></a><span class="lineno"> 2050</span>  LinearConstraint new_constraint;</div>
|
|
<div class="line"><a name="l02051"></a><span class="lineno"> 2051</span>  tmp_scattered_vector_.<a class="code" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#a1077b795353fa06d7705f43377bedfe9">ConvertToLinearConstraint</a>(integer_variables_, rc_ub,</div>
|
|
<div class="line"><a name="l02052"></a><span class="lineno"> 2052</span>  &new_constraint);</div>
|
|
<div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>  new_constraint.vars.push_back(objective_cp_);</div>
|
|
<div class="line"><a name="l02054"></a><span class="lineno"> 2054</span>  new_constraint.coeffs.push_back(-obj_scale);</div>
|
|
<div class="line"><a name="l02055"></a><span class="lineno"> 2055</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#ae3c495e2e05950c578b01976701f9b2a">DivideByGCD</a>(&new_constraint);</div>
|
|
<div class="line"><a name="l02056"></a><span class="lineno"> 2056</span>  PreventOverflow(&new_constraint);</div>
|
|
<div class="line"><a name="l02057"></a><span class="lineno"> 2057</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!PossibleOverflow(new_constraint));</div>
|
|
<div class="line"><a name="l02058"></a><span class="lineno"> 2058</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(constraint_manager_.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a1afbe8d162a9cba17a520812ec6d3dd4">DebugCheckConstraint</a>(new_constraint));</div>
|
|
<div class="line"><a name="l02059"></a><span class="lineno"> 2059</span>  </div>
|
|
<div class="line"><a name="l02060"></a><span class="lineno"> 2060</span>  IntegerSumLE* cp_constraint =</div>
|
|
<div class="line"><a name="l02061"></a><span class="lineno"> 2061</span>  <span class="keyword">new</span> IntegerSumLE({}, new_constraint.vars, new_constraint.coeffs,</div>
|
|
<div class="line"><a name="l02062"></a><span class="lineno"> 2062</span>  new_constraint.ub, model_);</div>
|
|
<div class="line"><a name="l02063"></a><span class="lineno"> 2063</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == 0) {</div>
|
|
<div class="line"><a name="l02064"></a><span class="lineno"> 2064</span>  <span class="comment">// Since we will never ask the reason for a constraint at level 0, we just</span></div>
|
|
<div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>  <span class="comment">// keep the last one.</span></div>
|
|
<div class="line"><a name="l02066"></a><span class="lineno"> 2066</span>  optimal_constraints_.clear();</div>
|
|
<div class="line"><a name="l02067"></a><span class="lineno"> 2067</span>  }</div>
|
|
<div class="line"><a name="l02068"></a><span class="lineno"> 2068</span>  optimal_constraints_.emplace_back(cp_constraint);</div>
|
|
<div class="line"><a name="l02069"></a><span class="lineno"> 2069</span>  rev_optimal_constraints_size_ = optimal_constraints_.size();</div>
|
|
<div class="line"><a name="l02070"></a><span class="lineno"> 2070</span>  <span class="keywordflow">if</span> (!cp_constraint->PropagateAtLevelZero()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02071"></a><span class="lineno"> 2071</span>  <span class="keywordflow">return</span> cp_constraint->Propagate();</div>
|
|
<div class="line"><a name="l02072"></a><span class="lineno"> 2072</span> }</div>
|
|
<div class="line"><a name="l02073"></a><span class="lineno"> 2073</span>  </div>
|
|
<div class="line"><a name="l02074"></a><span class="lineno"> 2074</span> <span class="keywordtype">bool</span> LinearProgrammingConstraint::FillExactDualRayReason() {</div>
|
|
<div class="line"><a name="l02075"></a><span class="lineno"> 2075</span>  <a class="code" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">Fractional</a> scaling;</div>
|
|
<div class="line"><a name="l02076"></a><span class="lineno"> 2076</span>  std::vector<std::pair<RowIndex, IntegerValue>> integer_multipliers =</div>
|
|
<div class="line"><a name="l02077"></a><span class="lineno"> 2077</span>  ScaleLpMultiplier(<span class="comment">/*take_objective_into_account=*/</span><span class="keyword">false</span>,</div>
|
|
<div class="line"><a name="l02078"></a><span class="lineno"> 2078</span>  simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a66da73868da92948f57a83e261066ca6">GetDualRay</a>(), &scaling);</div>
|
|
<div class="line"><a name="l02079"></a><span class="lineno"> 2079</span>  </div>
|
|
<div class="line"><a name="l02080"></a><span class="lineno"> 2080</span>  IntegerValue new_constraint_ub;</div>
|
|
<div class="line"><a name="l02081"></a><span class="lineno"> 2081</span>  <span class="keywordflow">if</span> (!ComputeNewLinearConstraint(integer_multipliers, &tmp_scattered_vector_,</div>
|
|
<div class="line"><a name="l02082"></a><span class="lineno"> 2082</span>  &new_constraint_ub)) {</div>
|
|
<div class="line"><a name="l02083"></a><span class="lineno"> 2083</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Isse while computing the exact dual ray reason. Aborting."</span>;</div>
|
|
<div class="line"><a name="l02084"></a><span class="lineno"> 2084</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02085"></a><span class="lineno"> 2085</span>  }</div>
|
|
<div class="line"><a name="l02086"></a><span class="lineno"> 2086</span>  </div>
|
|
<div class="line"><a name="l02087"></a><span class="lineno"> 2087</span>  AdjustNewLinearConstraint(&integer_multipliers, &tmp_scattered_vector_,</div>
|
|
<div class="line"><a name="l02088"></a><span class="lineno"> 2088</span>  &new_constraint_ub);</div>
|
|
<div class="line"><a name="l02089"></a><span class="lineno"> 2089</span>  </div>
|
|
<div class="line"><a name="l02090"></a><span class="lineno"> 2090</span>  LinearConstraint new_constraint;</div>
|
|
<div class="line"><a name="l02091"></a><span class="lineno"> 2091</span>  tmp_scattered_vector_.<a class="code" href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#a1077b795353fa06d7705f43377bedfe9">ConvertToLinearConstraint</a>(</div>
|
|
<div class="line"><a name="l02092"></a><span class="lineno"> 2092</span>  integer_variables_, new_constraint_ub, &new_constraint);</div>
|
|
<div class="line"><a name="l02093"></a><span class="lineno"> 2093</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#ae3c495e2e05950c578b01976701f9b2a">DivideByGCD</a>(&new_constraint);</div>
|
|
<div class="line"><a name="l02094"></a><span class="lineno"> 2094</span>  PreventOverflow(&new_constraint);</div>
|
|
<div class="line"><a name="l02095"></a><span class="lineno"> 2095</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!PossibleOverflow(new_constraint));</div>
|
|
<div class="line"><a name="l02096"></a><span class="lineno"> 2096</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(constraint_manager_.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a1afbe8d162a9cba17a520812ec6d3dd4">DebugCheckConstraint</a>(new_constraint));</div>
|
|
<div class="line"><a name="l02097"></a><span class="lineno"> 2097</span>  </div>
|
|
<div class="line"><a name="l02098"></a><span class="lineno"> 2098</span>  <span class="keyword">const</span> IntegerValue implied_lb = GetImpliedLowerBound(new_constraint);</div>
|
|
<div class="line"><a name="l02099"></a><span class="lineno"> 2099</span>  <span class="keywordflow">if</span> (implied_lb <= new_constraint.ub) {</div>
|
|
<div class="line"><a name="l02100"></a><span class="lineno"> 2100</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"LP exact dual ray not infeasible,"</span></div>
|
|
<div class="line"><a name="l02101"></a><span class="lineno"> 2101</span>  << <span class="stringliteral">" implied_lb: "</span> << implied_lb.value() / scaling</div>
|
|
<div class="line"><a name="l02102"></a><span class="lineno"> 2102</span>  << <span class="stringliteral">" ub: "</span> << new_constraint.ub.value() / scaling;</div>
|
|
<div class="line"><a name="l02103"></a><span class="lineno"> 2103</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02104"></a><span class="lineno"> 2104</span>  }</div>
|
|
<div class="line"><a name="l02105"></a><span class="lineno"> 2105</span>  <span class="keyword">const</span> IntegerValue slack = (implied_lb - new_constraint.ub) - 1;</div>
|
|
<div class="line"><a name="l02106"></a><span class="lineno"> 2106</span>  SetImpliedLowerBoundReason(new_constraint, slack);</div>
|
|
<div class="line"><a name="l02107"></a><span class="lineno"> 2107</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02108"></a><span class="lineno"> 2108</span> }</div>
|
|
<div class="line"><a name="l02109"></a><span class="lineno"> 2109</span>  </div>
|
|
<div class="line"><a name="l02110"></a><span class="lineno"> 2110</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> LinearProgrammingConstraint::CalculateDegeneracy() {</div>
|
|
<div class="line"><a name="l02111"></a><span class="lineno"> 2111</span>  <span class="keyword">const</span> glop::ColIndex num_vars = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ac226833fbf53fdb3fb7b6ef9d89a0e4c">GetProblemNumCols</a>();</div>
|
|
<div class="line"><a name="l02112"></a><span class="lineno"> 2112</span>  <span class="keywordtype">int</span> num_non_basic_with_zero_rc = 0;</div>
|
|
<div class="line"><a name="l02113"></a><span class="lineno"> 2113</span>  <span class="keywordflow">for</span> (glop::ColIndex i(0); i < num_vars; ++i) {</div>
|
|
<div class="line"><a name="l02114"></a><span class="lineno"> 2114</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> rc = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a52c80b8028f6d54f8b2c02da3aac7510">GetReducedCost</a>(i);</div>
|
|
<div class="line"><a name="l02115"></a><span class="lineno"> 2115</span>  <span class="keywordflow">if</span> (rc != 0.0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02116"></a><span class="lineno"> 2116</span>  <span class="keywordflow">if</span> (simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a4802169fde637478bebd1b420eec8ff8">GetVariableStatus</a>(i) == <a class="code" href="namespaceoperations__research_1_1glop.html#a1ac488f3db89f6d16a85c56f3243290cae4ac03f6c9f00665644e868dd1fb9f1e">glop::VariableStatus::BASIC</a>) {</div>
|
|
<div class="line"><a name="l02117"></a><span class="lineno"> 2117</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02118"></a><span class="lineno"> 2118</span>  }</div>
|
|
<div class="line"><a name="l02119"></a><span class="lineno"> 2119</span>  num_non_basic_with_zero_rc++;</div>
|
|
<div class="line"><a name="l02120"></a><span class="lineno"> 2120</span>  }</div>
|
|
<div class="line"><a name="l02121"></a><span class="lineno"> 2121</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> num_cols = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ac226833fbf53fdb3fb7b6ef9d89a0e4c">GetProblemNumCols</a>().value();</div>
|
|
<div class="line"><a name="l02122"></a><span class="lineno"> 2122</span>  is_degenerate_ = num_non_basic_with_zero_rc >= 0.3 * num_cols;</div>
|
|
<div class="line"><a name="l02123"></a><span class="lineno"> 2123</span>  <span class="keywordflow">return</span> num_non_basic_with_zero_rc;</div>
|
|
<div class="line"><a name="l02124"></a><span class="lineno"> 2124</span> }</div>
|
|
<div class="line"><a name="l02125"></a><span class="lineno"> 2125</span>  </div>
|
|
<div class="line"><a name="l02126"></a><span class="lineno"> 2126</span> <span class="keywordtype">void</span> LinearProgrammingConstraint::ReducedCostStrengtheningDeductions(</div>
|
|
<div class="line"><a name="l02127"></a><span class="lineno"> 2127</span>  <span class="keywordtype">double</span> cp_objective_delta) {</div>
|
|
<div class="line"><a name="l02128"></a><span class="lineno"> 2128</span>  deductions_.clear();</div>
|
|
<div class="line"><a name="l02129"></a><span class="lineno"> 2129</span>  </div>
|
|
<div class="line"><a name="l02130"></a><span class="lineno"> 2130</span>  <span class="comment">// TRICKY: while simplex_.GetObjectiveValue() use the objective scaling factor</span></div>
|
|
<div class="line"><a name="l02131"></a><span class="lineno"> 2131</span>  <span class="comment">// stored in the lp_data_, all the other functions like GetReducedCost() or</span></div>
|
|
<div class="line"><a name="l02132"></a><span class="lineno"> 2132</span>  <span class="comment">// GetVariableValue() do not.</span></div>
|
|
<div class="line"><a name="l02133"></a><span class="lineno"> 2133</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lp_objective_delta =</div>
|
|
<div class="line"><a name="l02134"></a><span class="lineno"> 2134</span>  cp_objective_delta / lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#adf55bb4fcaab95674f072cb528d426a0">objective_scaling_factor</a>();</div>
|
|
<div class="line"><a name="l02135"></a><span class="lineno"> 2135</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = integer_variables_.size();</div>
|
|
<div class="line"><a name="l02136"></a><span class="lineno"> 2136</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; i++) {</div>
|
|
<div class="line"><a name="l02137"></a><span class="lineno"> 2137</span>  <span class="keyword">const</span> IntegerVariable cp_var = integer_variables_[i];</div>
|
|
<div class="line"><a name="l02138"></a><span class="lineno"> 2138</span>  <span class="keyword">const</span> glop::ColIndex lp_var = glop::ColIndex(i);</div>
|
|
<div class="line"><a name="l02139"></a><span class="lineno"> 2139</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> rc = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a52c80b8028f6d54f8b2c02da3aac7510">GetReducedCost</a>(lp_var);</div>
|
|
<div class="line"><a name="l02140"></a><span class="lineno"> 2140</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a201108c6e8d9fb5104697bdd0a8bd085">GetVariableValue</a>(lp_var);</div>
|
|
<div class="line"><a name="l02141"></a><span class="lineno"> 2141</span>  </div>
|
|
<div class="line"><a name="l02142"></a><span class="lineno"> 2142</span>  <span class="keywordflow">if</span> (rc == 0.0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02143"></a><span class="lineno"> 2143</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lp_other_bound = <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> + lp_objective_delta / rc;</div>
|
|
<div class="line"><a name="l02144"></a><span class="lineno"> 2144</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> cp_other_bound =</div>
|
|
<div class="line"><a name="l02145"></a><span class="lineno"> 2145</span>  scaler_.<a class="code" href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a60d41c66b603be0ec7517d437e5c63ec">UnscaleVariableValue</a>(lp_var, lp_other_bound);</div>
|
|
<div class="line"><a name="l02146"></a><span class="lineno"> 2146</span>  </div>
|
|
<div class="line"><a name="l02147"></a><span class="lineno"> 2147</span>  <span class="keywordflow">if</span> (rc > kLpEpsilon) {</div>
|
|
<div class="line"><a name="l02148"></a><span class="lineno"> 2148</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> ub = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(cp_var));</div>
|
|
<div class="line"><a name="l02149"></a><span class="lineno"> 2149</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> new_ub = std::floor(cp_other_bound + kCpEpsilon);</div>
|
|
<div class="line"><a name="l02150"></a><span class="lineno"> 2150</span>  <span class="keywordflow">if</span> (new_ub < ub) {</div>
|
|
<div class="line"><a name="l02151"></a><span class="lineno"> 2151</span>  <span class="comment">// TODO(user): Because rc > kLpEpsilon, the lower_bound of cp_var</span></div>
|
|
<div class="line"><a name="l02152"></a><span class="lineno"> 2152</span>  <span class="comment">// will be part of the reason returned by FillReducedCostsReason(), but</span></div>
|
|
<div class="line"><a name="l02153"></a><span class="lineno"> 2153</span>  <span class="comment">// we actually do not need it here. Same below.</span></div>
|
|
<div class="line"><a name="l02154"></a><span class="lineno"> 2154</span>  <span class="keyword">const</span> IntegerValue new_ub_int(<span class="keyword">static_cast<</span>IntegerValue<span class="keyword">></span>(new_ub));</div>
|
|
<div class="line"><a name="l02155"></a><span class="lineno"> 2155</span>  deductions_.push_back(<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(cp_var, new_ub_int));</div>
|
|
<div class="line"><a name="l02156"></a><span class="lineno"> 2156</span>  }</div>
|
|
<div class="line"><a name="l02157"></a><span class="lineno"> 2157</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rc < -kLpEpsilon) {</div>
|
|
<div class="line"><a name="l02158"></a><span class="lineno"> 2158</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lb = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(cp_var));</div>
|
|
<div class="line"><a name="l02159"></a><span class="lineno"> 2159</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> new_lb = std::ceil(cp_other_bound - kCpEpsilon);</div>
|
|
<div class="line"><a name="l02160"></a><span class="lineno"> 2160</span>  <span class="keywordflow">if</span> (new_lb > lb) {</div>
|
|
<div class="line"><a name="l02161"></a><span class="lineno"> 2161</span>  <span class="keyword">const</span> IntegerValue new_lb_int(<span class="keyword">static_cast<</span>IntegerValue<span class="keyword">></span>(new_lb));</div>
|
|
<div class="line"><a name="l02162"></a><span class="lineno"> 2162</span>  deductions_.push_back(</div>
|
|
<div class="line"><a name="l02163"></a><span class="lineno"> 2163</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(cp_var, new_lb_int));</div>
|
|
<div class="line"><a name="l02164"></a><span class="lineno"> 2164</span>  }</div>
|
|
<div class="line"><a name="l02165"></a><span class="lineno"> 2165</span>  }</div>
|
|
<div class="line"><a name="l02166"></a><span class="lineno"> 2166</span>  }</div>
|
|
<div class="line"><a name="l02167"></a><span class="lineno"> 2167</span> }</div>
|
|
<div class="line"><a name="l02168"></a><span class="lineno"> 2168</span>  </div>
|
|
<div class="line"><a name="l02169"></a><span class="lineno"> 2169</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l02170"></a><span class="lineno"> 2170</span>  </div>
|
|
<div class="line"><a name="l02171"></a><span class="lineno"> 2171</span> <span class="comment">// Add a cut of the form Sum_{outgoing arcs from S} lp >= rhs_lower_bound.</span></div>
|
|
<div class="line"><a name="l02172"></a><span class="lineno"> 2172</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l02173"></a><span class="lineno"> 2173</span> <span class="comment">// Note that we used to also add the same cut for the incoming arcs, but because</span></div>
|
|
<div class="line"><a name="l02174"></a><span class="lineno"> 2174</span> <span class="comment">// of flow conservation on these problems, the outgoing flow is always the same</span></div>
|
|
<div class="line"><a name="l02175"></a><span class="lineno"> 2175</span> <span class="comment">// as the incoming flow, so adding this extra cut doesn't seem relevant.</span></div>
|
|
<div class="line"><a name="l02176"></a><span class="lineno"> 2176</span> <span class="keywordtype">void</span> AddOutgoingCut(</div>
|
|
<div class="line"><a name="l02177"></a><span class="lineno"> 2177</span>  <span class="keywordtype">int</span> num_nodes, <span class="keywordtype">int</span> subset_size, <span class="keyword">const</span> std::vector<bool>& in_subset,</div>
|
|
<div class="line"><a name="l02178"></a><span class="lineno"> 2178</span>  <span class="keyword">const</span> std::vector<int>& tails, <span class="keyword">const</span> std::vector<int>& heads,</div>
|
|
<div class="line"><a name="l02179"></a><span class="lineno"> 2179</span>  <span class="keyword">const</span> std::vector<Literal>& literals,</div>
|
|
<div class="line"><a name="l02180"></a><span class="lineno"> 2180</span>  <span class="keyword">const</span> std::vector<double>& literal_lp_values, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> rhs_lower_bound,</div>
|
|
<div class="line"><a name="l02181"></a><span class="lineno"> 2181</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values,</div>
|
|
<div class="line"><a name="l02182"></a><span class="lineno"> 2182</span>  LinearConstraintManager* manager, Model* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l02183"></a><span class="lineno"> 2183</span>  <span class="comment">// A node is said to be optional if it can be excluded from the subcircuit,</span></div>
|
|
<div class="line"><a name="l02184"></a><span class="lineno"> 2184</span>  <span class="comment">// in which case there is a self-loop on that node.</span></div>
|
|
<div class="line"><a name="l02185"></a><span class="lineno"> 2185</span>  <span class="comment">// If there are optional nodes, use extended formula:</span></div>
|
|
<div class="line"><a name="l02186"></a><span class="lineno"> 2186</span>  <span class="comment">// sum(cut) >= 1 - optional_loop_in - optional_loop_out</span></div>
|
|
<div class="line"><a name="l02187"></a><span class="lineno"> 2187</span>  <span class="comment">// where optional_loop_in's node is in subset, optional_loop_out's is out.</span></div>
|
|
<div class="line"><a name="l02188"></a><span class="lineno"> 2188</span>  <span class="comment">// TODO(user): Favor optional loops fixed to zero at root.</span></div>
|
|
<div class="line"><a name="l02189"></a><span class="lineno"> 2189</span>  <span class="keywordtype">int</span> num_optional_nodes_in = 0;</div>
|
|
<div class="line"><a name="l02190"></a><span class="lineno"> 2190</span>  <span class="keywordtype">int</span> num_optional_nodes_out = 0;</div>
|
|
<div class="line"><a name="l02191"></a><span class="lineno"> 2191</span>  <span class="keywordtype">int</span> optional_loop_in = -1;</div>
|
|
<div class="line"><a name="l02192"></a><span class="lineno"> 2192</span>  <span class="keywordtype">int</span> optional_loop_out = -1;</div>
|
|
<div class="line"><a name="l02193"></a><span class="lineno"> 2193</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < tails.size(); ++i) {</div>
|
|
<div class="line"><a name="l02194"></a><span class="lineno"> 2194</span>  <span class="keywordflow">if</span> (tails[i] != heads[i]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02195"></a><span class="lineno"> 2195</span>  <span class="keywordflow">if</span> (in_subset[tails[i]]) {</div>
|
|
<div class="line"><a name="l02196"></a><span class="lineno"> 2196</span>  num_optional_nodes_in++;</div>
|
|
<div class="line"><a name="l02197"></a><span class="lineno"> 2197</span>  <span class="keywordflow">if</span> (optional_loop_in == -1 ||</div>
|
|
<div class="line"><a name="l02198"></a><span class="lineno"> 2198</span>  literal_lp_values[i] < literal_lp_values[optional_loop_in]) {</div>
|
|
<div class="line"><a name="l02199"></a><span class="lineno"> 2199</span>  optional_loop_in = i;</div>
|
|
<div class="line"><a name="l02200"></a><span class="lineno"> 2200</span>  }</div>
|
|
<div class="line"><a name="l02201"></a><span class="lineno"> 2201</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02202"></a><span class="lineno"> 2202</span>  num_optional_nodes_out++;</div>
|
|
<div class="line"><a name="l02203"></a><span class="lineno"> 2203</span>  <span class="keywordflow">if</span> (optional_loop_out == -1 ||</div>
|
|
<div class="line"><a name="l02204"></a><span class="lineno"> 2204</span>  literal_lp_values[i] < literal_lp_values[optional_loop_out]) {</div>
|
|
<div class="line"><a name="l02205"></a><span class="lineno"> 2205</span>  optional_loop_out = i;</div>
|
|
<div class="line"><a name="l02206"></a><span class="lineno"> 2206</span>  }</div>
|
|
<div class="line"><a name="l02207"></a><span class="lineno"> 2207</span>  }</div>
|
|
<div class="line"><a name="l02208"></a><span class="lineno"> 2208</span>  }</div>
|
|
<div class="line"><a name="l02209"></a><span class="lineno"> 2209</span>  </div>
|
|
<div class="line"><a name="l02210"></a><span class="lineno"> 2210</span>  <span class="comment">// TODO(user): The lower bound for CVRP is computed assuming all nodes must be</span></div>
|
|
<div class="line"><a name="l02211"></a><span class="lineno"> 2211</span>  <span class="comment">// served, if it is > 1 we lower it to one in the presence of optional nodes.</span></div>
|
|
<div class="line"><a name="l02212"></a><span class="lineno"> 2212</span>  <span class="keywordflow">if</span> (num_optional_nodes_in + num_optional_nodes_out > 0) {</div>
|
|
<div class="line"><a name="l02213"></a><span class="lineno"> 2213</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(rhs_lower_bound, 1);</div>
|
|
<div class="line"><a name="l02214"></a><span class="lineno"> 2214</span>  rhs_lower_bound = 1;</div>
|
|
<div class="line"><a name="l02215"></a><span class="lineno"> 2215</span>  }</div>
|
|
<div class="line"><a name="l02216"></a><span class="lineno"> 2216</span>  </div>
|
|
<div class="line"><a name="l02217"></a><span class="lineno"> 2217</span>  LinearConstraintBuilder outgoing(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, IntegerValue(rhs_lower_bound),</div>
|
|
<div class="line"><a name="l02218"></a><span class="lineno"> 2218</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>);</div>
|
|
<div class="line"><a name="l02219"></a><span class="lineno"> 2219</span>  <span class="keywordtype">double</span> sum_outgoing = 0.0;</div>
|
|
<div class="line"><a name="l02220"></a><span class="lineno"> 2220</span>  </div>
|
|
<div class="line"><a name="l02221"></a><span class="lineno"> 2221</span>  <span class="comment">// Add outgoing arcs, compute outgoing flow.</span></div>
|
|
<div class="line"><a name="l02222"></a><span class="lineno"> 2222</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < tails.size(); ++i) {</div>
|
|
<div class="line"><a name="l02223"></a><span class="lineno"> 2223</span>  <span class="keywordflow">if</span> (in_subset[tails[i]] && !in_subset[heads[i]]) {</div>
|
|
<div class="line"><a name="l02224"></a><span class="lineno"> 2224</span>  sum_outgoing += literal_lp_values[i];</div>
|
|
<div class="line"><a name="l02225"></a><span class="lineno"> 2225</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(outgoing.AddLiteralTerm(literals[i], IntegerValue(1)));</div>
|
|
<div class="line"><a name="l02226"></a><span class="lineno"> 2226</span>  }</div>
|
|
<div class="line"><a name="l02227"></a><span class="lineno"> 2227</span>  }</div>
|
|
<div class="line"><a name="l02228"></a><span class="lineno"> 2228</span>  </div>
|
|
<div class="line"><a name="l02229"></a><span class="lineno"> 2229</span>  <span class="comment">// Support optional nodes if any.</span></div>
|
|
<div class="line"><a name="l02230"></a><span class="lineno"> 2230</span>  <span class="keywordflow">if</span> (num_optional_nodes_in + num_optional_nodes_out > 0) {</div>
|
|
<div class="line"><a name="l02231"></a><span class="lineno"> 2231</span>  <span class="comment">// When all optionals of one side are excluded in lp solution, no cut.</span></div>
|
|
<div class="line"><a name="l02232"></a><span class="lineno"> 2232</span>  <span class="keywordflow">if</span> (num_optional_nodes_in == subset_size &&</div>
|
|
<div class="line"><a name="l02233"></a><span class="lineno"> 2233</span>  (optional_loop_in == -1 ||</div>
|
|
<div class="line"><a name="l02234"></a><span class="lineno"> 2234</span>  literal_lp_values[optional_loop_in] > 1.0 - 1e-6)) {</div>
|
|
<div class="line"><a name="l02235"></a><span class="lineno"> 2235</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l02236"></a><span class="lineno"> 2236</span>  }</div>
|
|
<div class="line"><a name="l02237"></a><span class="lineno"> 2237</span>  <span class="keywordflow">if</span> (num_optional_nodes_out == num_nodes - subset_size &&</div>
|
|
<div class="line"><a name="l02238"></a><span class="lineno"> 2238</span>  (optional_loop_out == -1 ||</div>
|
|
<div class="line"><a name="l02239"></a><span class="lineno"> 2239</span>  literal_lp_values[optional_loop_out] > 1.0 - 1e-6)) {</div>
|
|
<div class="line"><a name="l02240"></a><span class="lineno"> 2240</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l02241"></a><span class="lineno"> 2241</span>  }</div>
|
|
<div class="line"><a name="l02242"></a><span class="lineno"> 2242</span>  </div>
|
|
<div class="line"><a name="l02243"></a><span class="lineno"> 2243</span>  <span class="comment">// There is no mandatory node in subset, add optional_loop_in.</span></div>
|
|
<div class="line"><a name="l02244"></a><span class="lineno"> 2244</span>  <span class="keywordflow">if</span> (num_optional_nodes_in == subset_size) {</div>
|
|
<div class="line"><a name="l02245"></a><span class="lineno"> 2245</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(</div>
|
|
<div class="line"><a name="l02246"></a><span class="lineno"> 2246</span>  outgoing.AddLiteralTerm(literals[optional_loop_in], IntegerValue(1)));</div>
|
|
<div class="line"><a name="l02247"></a><span class="lineno"> 2247</span>  sum_outgoing += literal_lp_values[optional_loop_in];</div>
|
|
<div class="line"><a name="l02248"></a><span class="lineno"> 2248</span>  }</div>
|
|
<div class="line"><a name="l02249"></a><span class="lineno"> 2249</span>  </div>
|
|
<div class="line"><a name="l02250"></a><span class="lineno"> 2250</span>  <span class="comment">// There is no mandatory node out of subset, add optional_loop_out.</span></div>
|
|
<div class="line"><a name="l02251"></a><span class="lineno"> 2251</span>  <span class="keywordflow">if</span> (num_optional_nodes_out == num_nodes - subset_size) {</div>
|
|
<div class="line"><a name="l02252"></a><span class="lineno"> 2252</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(outgoing.AddLiteralTerm(literals[optional_loop_out],</div>
|
|
<div class="line"><a name="l02253"></a><span class="lineno"> 2253</span>  IntegerValue(1)));</div>
|
|
<div class="line"><a name="l02254"></a><span class="lineno"> 2254</span>  sum_outgoing += literal_lp_values[optional_loop_out];</div>
|
|
<div class="line"><a name="l02255"></a><span class="lineno"> 2255</span>  }</div>
|
|
<div class="line"><a name="l02256"></a><span class="lineno"> 2256</span>  }</div>
|
|
<div class="line"><a name="l02257"></a><span class="lineno"> 2257</span>  </div>
|
|
<div class="line"><a name="l02258"></a><span class="lineno"> 2258</span>  <span class="keywordflow">if</span> (sum_outgoing < rhs_lower_bound - 1e-6) {</div>
|
|
<div class="line"><a name="l02259"></a><span class="lineno"> 2259</span>  manager->AddCut(outgoing.Build(), <span class="stringliteral">"Circuit"</span>, lp_values);</div>
|
|
<div class="line"><a name="l02260"></a><span class="lineno"> 2260</span>  }</div>
|
|
<div class="line"><a name="l02261"></a><span class="lineno"> 2261</span> }</div>
|
|
<div class="line"><a name="l02262"></a><span class="lineno"> 2262</span>  </div>
|
|
<div class="line"><a name="l02263"></a><span class="lineno"> 2263</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l02264"></a><span class="lineno"> 2264</span>  </div>
|
|
<div class="line"><a name="l02265"></a><span class="lineno"> 2265</span> <span class="comment">// We roughly follow the algorithm described in section 6 of "The Traveling</span></div>
|
|
<div class="line"><a name="l02266"></a><span class="lineno"> 2266</span> <span class="comment">// Salesman Problem, A computational Study", David L. Applegate, Robert E.</span></div>
|
|
<div class="line"><a name="l02267"></a><span class="lineno"> 2267</span> <span class="comment">// Bixby, Vasek Chvatal, William J. Cook.</span></div>
|
|
<div class="line"><a name="l02268"></a><span class="lineno"> 2268</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l02269"></a><span class="lineno"> 2269</span> <span class="comment">// Note that this is mainly a "symmetric" case algo, but it does still work for</span></div>
|
|
<div class="line"><a name="l02270"></a><span class="lineno"> 2270</span> <span class="comment">// the asymmetric case.</span></div>
|
|
<div class="line"><a name="l02271"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a2a367e1c70abb013c50b1a7d1cf00bb3"> 2271</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a2a367e1c70abb013c50b1a7d1cf00bb3">SeparateSubtourInequalities</a>(</div>
|
|
<div class="line"><a name="l02272"></a><span class="lineno"> 2272</span>  <span class="keywordtype">int</span> num_nodes, <span class="keyword">const</span> std::vector<int>& tails, <span class="keyword">const</span> std::vector<int>& heads,</div>
|
|
<div class="line"><a name="l02273"></a><span class="lineno"> 2273</span>  <span class="keyword">const</span> std::vector<Literal>& literals,</div>
|
|
<div class="line"><a name="l02274"></a><span class="lineno"> 2274</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values,</div>
|
|
<div class="line"><a name="l02275"></a><span class="lineno"> 2275</span>  absl::Span<const int64> demands, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>,</div>
|
|
<div class="line"><a name="l02276"></a><span class="lineno"> 2276</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager, <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l02277"></a><span class="lineno"> 2277</span>  <span class="keywordflow">if</span> (num_nodes <= 2) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l02278"></a><span class="lineno"> 2278</span>  </div>
|
|
<div class="line"><a name="l02279"></a><span class="lineno"> 2279</span>  <span class="comment">// We will collect only the arcs with a positive lp_values to speed up some</span></div>
|
|
<div class="line"><a name="l02280"></a><span class="lineno"> 2280</span>  <span class="comment">// computation below.</span></div>
|
|
<div class="line"><a name="l02281"></a><span class="lineno"> 2281</span>  <span class="keyword">struct </span><a class="code" href="namespaceoperations__research.html#a6894cc7d30a41a5e750f40a7f4751c01">Arc</a> {</div>
|
|
<div class="line"><a name="l02282"></a><span class="lineno"> 2282</span>  <span class="keywordtype">int</span> <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>;</div>
|
|
<div class="line"><a name="l02283"></a><span class="lineno"> 2283</span>  <span class="keywordtype">int</span> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>;</div>
|
|
<div class="line"><a name="l02284"></a><span class="lineno"> 2284</span>  <span class="keywordtype">double</span> lp_value;</div>
|
|
<div class="line"><a name="l02285"></a><span class="lineno"> 2285</span>  };</div>
|
|
<div class="line"><a name="l02286"></a><span class="lineno"> 2286</span>  std::vector<Arc> relevant_arcs;</div>
|
|
<div class="line"><a name="l02287"></a><span class="lineno"> 2287</span>  </div>
|
|
<div class="line"><a name="l02288"></a><span class="lineno"> 2288</span>  <span class="comment">// Sort the arcs by non-increasing lp_values.</span></div>
|
|
<div class="line"><a name="l02289"></a><span class="lineno"> 2289</span>  std::vector<double> literal_lp_values(literals.size());</div>
|
|
<div class="line"><a name="l02290"></a><span class="lineno"> 2290</span>  std::vector<std::pair<double, int>> arc_by_decreasing_lp_values;</div>
|
|
<div class="line"><a name="l02291"></a><span class="lineno"> 2291</span>  <span class="keyword">auto</span>* encoder = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>();</div>
|
|
<div class="line"><a name="l02292"></a><span class="lineno"> 2292</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < literals.size(); ++i) {</div>
|
|
<div class="line"><a name="l02293"></a><span class="lineno"> 2293</span>  <span class="keywordtype">double</span> lp_value;</div>
|
|
<div class="line"><a name="l02294"></a><span class="lineno"> 2294</span>  <span class="keyword">const</span> IntegerVariable direct_view = encoder-><a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html#a308a6df2722f2c0f36ec8888f4458b41">GetLiteralView</a>(literals[i]);</div>
|
|
<div class="line"><a name="l02295"></a><span class="lineno"> 2295</span>  <span class="keywordflow">if</span> (direct_view != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div>
|
|
<div class="line"><a name="l02296"></a><span class="lineno"> 2296</span>  lp_value = lp_values[direct_view];</div>
|
|
<div class="line"><a name="l02297"></a><span class="lineno"> 2297</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02298"></a><span class="lineno"> 2298</span>  lp_value =</div>
|
|
<div class="line"><a name="l02299"></a><span class="lineno"> 2299</span>  1.0 - lp_values[encoder->GetLiteralView(literals[i].Negated())];</div>
|
|
<div class="line"><a name="l02300"></a><span class="lineno"> 2300</span>  }</div>
|
|
<div class="line"><a name="l02301"></a><span class="lineno"> 2301</span>  literal_lp_values[i] = lp_value;</div>
|
|
<div class="line"><a name="l02302"></a><span class="lineno"> 2302</span>  </div>
|
|
<div class="line"><a name="l02303"></a><span class="lineno"> 2303</span>  <span class="keywordflow">if</span> (lp_value < 1e-6) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02304"></a><span class="lineno"> 2304</span>  relevant_arcs.push_back({tails[i], heads[i], lp_value});</div>
|
|
<div class="line"><a name="l02305"></a><span class="lineno"> 2305</span>  arc_by_decreasing_lp_values.push_back({lp_value, i});</div>
|
|
<div class="line"><a name="l02306"></a><span class="lineno"> 2306</span>  }</div>
|
|
<div class="line"><a name="l02307"></a><span class="lineno"> 2307</span>  std::sort(arc_by_decreasing_lp_values.begin(),</div>
|
|
<div class="line"><a name="l02308"></a><span class="lineno"> 2308</span>  arc_by_decreasing_lp_values.end(),</div>
|
|
<div class="line"><a name="l02309"></a><span class="lineno"> 2309</span>  std::greater<std::pair<double, int>>());</div>
|
|
<div class="line"><a name="l02310"></a><span class="lineno"> 2310</span>  </div>
|
|
<div class="line"><a name="l02311"></a><span class="lineno"> 2311</span>  <span class="comment">// We will do a union-find by adding one by one the arc of the lp solution</span></div>
|
|
<div class="line"><a name="l02312"></a><span class="lineno"> 2312</span>  <span class="comment">// in the order above. Every intermediate set during this construction will</span></div>
|
|
<div class="line"><a name="l02313"></a><span class="lineno"> 2313</span>  <span class="comment">// be a candidate for a cut.</span></div>
|
|
<div class="line"><a name="l02314"></a><span class="lineno"> 2314</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l02315"></a><span class="lineno"> 2315</span>  <span class="comment">// In parallel to the union-find, to efficiently reconstruct these sets (at</span></div>
|
|
<div class="line"><a name="l02316"></a><span class="lineno"> 2316</span>  <span class="comment">// most num_nodes), we construct a "decomposition forest" of the different</span></div>
|
|
<div class="line"><a name="l02317"></a><span class="lineno"> 2317</span>  <span class="comment">// connected components. Note that we don't exploit any asymmetric nature of</span></div>
|
|
<div class="line"><a name="l02318"></a><span class="lineno"> 2318</span>  <span class="comment">// the graph here. This is exactly the algo 6.3 in the book above.</span></div>
|
|
<div class="line"><a name="l02319"></a><span class="lineno"> 2319</span>  <span class="keywordtype">int</span> num_components = num_nodes;</div>
|
|
<div class="line"><a name="l02320"></a><span class="lineno"> 2320</span>  std::vector<int> parent(num_nodes);</div>
|
|
<div class="line"><a name="l02321"></a><span class="lineno"> 2321</span>  std::vector<int> root(num_nodes);</div>
|
|
<div class="line"><a name="l02322"></a><span class="lineno"> 2322</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_nodes; ++i) {</div>
|
|
<div class="line"><a name="l02323"></a><span class="lineno"> 2323</span>  parent[i] = i;</div>
|
|
<div class="line"><a name="l02324"></a><span class="lineno"> 2324</span>  root[i] = i;</div>
|
|
<div class="line"><a name="l02325"></a><span class="lineno"> 2325</span>  }</div>
|
|
<div class="line"><a name="l02326"></a><span class="lineno"> 2326</span>  <span class="keyword">auto</span> get_root_and_compress_path = [&root](<span class="keywordtype">int</span> node) {</div>
|
|
<div class="line"><a name="l02327"></a><span class="lineno"> 2327</span>  <span class="keywordtype">int</span> r = node;</div>
|
|
<div class="line"><a name="l02328"></a><span class="lineno"> 2328</span>  <span class="keywordflow">while</span> (root[r] != r) r = root[r];</div>
|
|
<div class="line"><a name="l02329"></a><span class="lineno"> 2329</span>  <span class="keywordflow">while</span> (root[node] != r) {</div>
|
|
<div class="line"><a name="l02330"></a><span class="lineno"> 2330</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = root[node];</div>
|
|
<div class="line"><a name="l02331"></a><span class="lineno"> 2331</span>  root[node] = r;</div>
|
|
<div class="line"><a name="l02332"></a><span class="lineno"> 2332</span>  node = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l02333"></a><span class="lineno"> 2333</span>  }</div>
|
|
<div class="line"><a name="l02334"></a><span class="lineno"> 2334</span>  <span class="keywordflow">return</span> r;</div>
|
|
<div class="line"><a name="l02335"></a><span class="lineno"> 2335</span>  };</div>
|
|
<div class="line"><a name="l02336"></a><span class="lineno"> 2336</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> pair : arc_by_decreasing_lp_values) {</div>
|
|
<div class="line"><a name="l02337"></a><span class="lineno"> 2337</span>  <span class="keywordflow">if</span> (num_components == 2) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l02338"></a><span class="lineno"> 2338</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> = get_root_and_compress_path(tails[pair.second]);</div>
|
|
<div class="line"><a name="l02339"></a><span class="lineno"> 2339</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> = get_root_and_compress_path(heads[pair.second]);</div>
|
|
<div class="line"><a name="l02340"></a><span class="lineno"> 2340</span>  <span class="keywordflow">if</span> (<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> != <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>) {</div>
|
|
<div class="line"><a name="l02341"></a><span class="lineno"> 2341</span>  <span class="comment">// Update the decomposition forest, note that the number of nodes is</span></div>
|
|
<div class="line"><a name="l02342"></a><span class="lineno"> 2342</span>  <span class="comment">// growing.</span></div>
|
|
<div class="line"><a name="l02343"></a><span class="lineno"> 2343</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> new_node = parent.size();</div>
|
|
<div class="line"><a name="l02344"></a><span class="lineno"> 2344</span>  parent.push_back(new_node);</div>
|
|
<div class="line"><a name="l02345"></a><span class="lineno"> 2345</span>  parent[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>] = new_node;</div>
|
|
<div class="line"><a name="l02346"></a><span class="lineno"> 2346</span>  parent[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>] = new_node;</div>
|
|
<div class="line"><a name="l02347"></a><span class="lineno"> 2347</span>  --num_components;</div>
|
|
<div class="line"><a name="l02348"></a><span class="lineno"> 2348</span>  </div>
|
|
<div class="line"><a name="l02349"></a><span class="lineno"> 2349</span>  <span class="comment">// It is important that the union-find representative is the same node.</span></div>
|
|
<div class="line"><a name="l02350"></a><span class="lineno"> 2350</span>  root.push_back(new_node);</div>
|
|
<div class="line"><a name="l02351"></a><span class="lineno"> 2351</span>  root[<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>] = new_node;</div>
|
|
<div class="line"><a name="l02352"></a><span class="lineno"> 2352</span>  root[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>] = new_node;</div>
|
|
<div class="line"><a name="l02353"></a><span class="lineno"> 2353</span>  }</div>
|
|
<div class="line"><a name="l02354"></a><span class="lineno"> 2354</span>  }</div>
|
|
<div class="line"><a name="l02355"></a><span class="lineno"> 2355</span>  </div>
|
|
<div class="line"><a name="l02356"></a><span class="lineno"> 2356</span>  <span class="comment">// For each node in the decomposition forest, try to add a cut for the set</span></div>
|
|
<div class="line"><a name="l02357"></a><span class="lineno"> 2357</span>  <span class="comment">// formed by the nodes and its children. To do that efficiently, we first</span></div>
|
|
<div class="line"><a name="l02358"></a><span class="lineno"> 2358</span>  <span class="comment">// order the nodes so that for each node in a tree, the set of children forms</span></div>
|
|
<div class="line"><a name="l02359"></a><span class="lineno"> 2359</span>  <span class="comment">// a consecutive span in the pre_order vector. This vector just lists the</span></div>
|
|
<div class="line"><a name="l02360"></a><span class="lineno"> 2360</span>  <span class="comment">// nodes in the "pre-order" graph traversal order. The Spans will point inside</span></div>
|
|
<div class="line"><a name="l02361"></a><span class="lineno"> 2361</span>  <span class="comment">// the pre_order vector, it is why we initialize it once and for all.</span></div>
|
|
<div class="line"><a name="l02362"></a><span class="lineno"> 2362</span>  <span class="keywordtype">int</span> new_size = 0;</div>
|
|
<div class="line"><a name="l02363"></a><span class="lineno"> 2363</span>  std::vector<int> pre_order(num_nodes);</div>
|
|
<div class="line"><a name="l02364"></a><span class="lineno"> 2364</span>  std::vector<absl::Span<const int>> subsets;</div>
|
|
<div class="line"><a name="l02365"></a><span class="lineno"> 2365</span>  {</div>
|
|
<div class="line"><a name="l02366"></a><span class="lineno"> 2366</span>  std::vector<absl::InlinedVector<int, 2>> graph(parent.size());</div>
|
|
<div class="line"><a name="l02367"></a><span class="lineno"> 2367</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < parent.size(); ++i) {</div>
|
|
<div class="line"><a name="l02368"></a><span class="lineno"> 2368</span>  <span class="keywordflow">if</span> (parent[i] != i) graph[parent[i]].push_back(i);</div>
|
|
<div class="line"><a name="l02369"></a><span class="lineno"> 2369</span>  }</div>
|
|
<div class="line"><a name="l02370"></a><span class="lineno"> 2370</span>  std::vector<int> queue;</div>
|
|
<div class="line"><a name="l02371"></a><span class="lineno"> 2371</span>  std::vector<bool> seen(graph.size(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l02372"></a><span class="lineno"> 2372</span>  std::vector<int> start_index(parent.size());</div>
|
|
<div class="line"><a name="l02373"></a><span class="lineno"> 2373</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = num_nodes; i < parent.size(); ++i) {</div>
|
|
<div class="line"><a name="l02374"></a><span class="lineno"> 2374</span>  <span class="comment">// Note that because of the way we constructed 'parent', the graph is a</span></div>
|
|
<div class="line"><a name="l02375"></a><span class="lineno"> 2375</span>  <span class="comment">// binary tree. This is not required for the correctness of the algorithm</span></div>
|
|
<div class="line"><a name="l02376"></a><span class="lineno"> 2376</span>  <span class="comment">// here though.</span></div>
|
|
<div class="line"><a name="l02377"></a><span class="lineno"> 2377</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(graph[i].empty() || graph[i].size() == 2);</div>
|
|
<div class="line"><a name="l02378"></a><span class="lineno"> 2378</span>  <span class="keywordflow">if</span> (parent[i] != i) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02379"></a><span class="lineno"> 2379</span>  </div>
|
|
<div class="line"><a name="l02380"></a><span class="lineno"> 2380</span>  <span class="comment">// Explore the subtree rooted at node i.</span></div>
|
|
<div class="line"><a name="l02381"></a><span class="lineno"> 2381</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!seen[i]);</div>
|
|
<div class="line"><a name="l02382"></a><span class="lineno"> 2382</span>  queue.push_back(i);</div>
|
|
<div class="line"><a name="l02383"></a><span class="lineno"> 2383</span>  <span class="keywordflow">while</span> (!queue.empty()) {</div>
|
|
<div class="line"><a name="l02384"></a><span class="lineno"> 2384</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> node = queue.back();</div>
|
|
<div class="line"><a name="l02385"></a><span class="lineno"> 2385</span>  <span class="keywordflow">if</span> (seen[node]) {</div>
|
|
<div class="line"><a name="l02386"></a><span class="lineno"> 2386</span>  queue.pop_back();</div>
|
|
<div class="line"><a name="l02387"></a><span class="lineno"> 2387</span>  <span class="comment">// All the children of node are in the span [start, end) of the</span></div>
|
|
<div class="line"><a name="l02388"></a><span class="lineno"> 2388</span>  <span class="comment">// pre_order vector.</span></div>
|
|
<div class="line"><a name="l02389"></a><span class="lineno"> 2389</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> start = start_index[node];</div>
|
|
<div class="line"><a name="l02390"></a><span class="lineno"> 2390</span>  <span class="keywordflow">if</span> (new_size - start > 1) {</div>
|
|
<div class="line"><a name="l02391"></a><span class="lineno"> 2391</span>  subsets.emplace_back(&pre_order[start], new_size - start);</div>
|
|
<div class="line"><a name="l02392"></a><span class="lineno"> 2392</span>  }</div>
|
|
<div class="line"><a name="l02393"></a><span class="lineno"> 2393</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02394"></a><span class="lineno"> 2394</span>  }</div>
|
|
<div class="line"><a name="l02395"></a><span class="lineno"> 2395</span>  seen[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02396"></a><span class="lineno"> 2396</span>  start_index[node] = new_size;</div>
|
|
<div class="line"><a name="l02397"></a><span class="lineno"> 2397</span>  <span class="keywordflow">if</span> (node < num_nodes) pre_order[new_size++] = node;</div>
|
|
<div class="line"><a name="l02398"></a><span class="lineno"> 2398</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> child : graph[node]) {</div>
|
|
<div class="line"><a name="l02399"></a><span class="lineno"> 2399</span>  <span class="keywordflow">if</span> (!seen[child]) queue.push_back(child);</div>
|
|
<div class="line"><a name="l02400"></a><span class="lineno"> 2400</span>  }</div>
|
|
<div class="line"><a name="l02401"></a><span class="lineno"> 2401</span>  }</div>
|
|
<div class="line"><a name="l02402"></a><span class="lineno"> 2402</span>  }</div>
|
|
<div class="line"><a name="l02403"></a><span class="lineno"> 2403</span>  }</div>
|
|
<div class="line"><a name="l02404"></a><span class="lineno"> 2404</span>  </div>
|
|
<div class="line"><a name="l02405"></a><span class="lineno"> 2405</span>  <span class="comment">// Compute the total demands in order to know the minimum incoming/outgoing</span></div>
|
|
<div class="line"><a name="l02406"></a><span class="lineno"> 2406</span>  <span class="comment">// flow.</span></div>
|
|
<div class="line"><a name="l02407"></a><span class="lineno"> 2407</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> total_demands = 0;</div>
|
|
<div class="line"><a name="l02408"></a><span class="lineno"> 2408</span>  <span class="keywordflow">if</span> (!demands.empty()) {</div>
|
|
<div class="line"><a name="l02409"></a><span class="lineno"> 2409</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a> : demands) total_demands += <a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a>;</div>
|
|
<div class="line"><a name="l02410"></a><span class="lineno"> 2410</span>  }</div>
|
|
<div class="line"><a name="l02411"></a><span class="lineno"> 2411</span>  </div>
|
|
<div class="line"><a name="l02412"></a><span class="lineno"> 2412</span>  <span class="comment">// Process each subsets and add any violated cut.</span></div>
|
|
<div class="line"><a name="l02413"></a><span class="lineno"> 2413</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(pre_order.size(), num_nodes);</div>
|
|
<div class="line"><a name="l02414"></a><span class="lineno"> 2414</span>  std::vector<bool> in_subset(num_nodes, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l02415"></a><span class="lineno"> 2415</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> absl::Span<const int> subset : subsets) {</div>
|
|
<div class="line"><a name="l02416"></a><span class="lineno"> 2416</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(subset.size(), 1);</div>
|
|
<div class="line"><a name="l02417"></a><span class="lineno"> 2417</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(subset.size(), num_nodes);</div>
|
|
<div class="line"><a name="l02418"></a><span class="lineno"> 2418</span>  </div>
|
|
<div class="line"><a name="l02419"></a><span class="lineno"> 2419</span>  <span class="comment">// These fields will be left untouched if demands.empty().</span></div>
|
|
<div class="line"><a name="l02420"></a><span class="lineno"> 2420</span>  <span class="keywordtype">bool</span> contain_depot = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02421"></a><span class="lineno"> 2421</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> subset_demand = 0;</div>
|
|
<div class="line"><a name="l02422"></a><span class="lineno"> 2422</span>  </div>
|
|
<div class="line"><a name="l02423"></a><span class="lineno"> 2423</span>  <span class="comment">// Initialize "in_subset" and the subset demands.</span></div>
|
|
<div class="line"><a name="l02424"></a><span class="lineno"> 2424</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> n : subset) {</div>
|
|
<div class="line"><a name="l02425"></a><span class="lineno"> 2425</span>  in_subset[n] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02426"></a><span class="lineno"> 2426</span>  <span class="keywordflow">if</span> (!demands.empty()) {</div>
|
|
<div class="line"><a name="l02427"></a><span class="lineno"> 2427</span>  <span class="keywordflow">if</span> (n == 0) contain_depot = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02428"></a><span class="lineno"> 2428</span>  subset_demand += demands[n];</div>
|
|
<div class="line"><a name="l02429"></a><span class="lineno"> 2429</span>  }</div>
|
|
<div class="line"><a name="l02430"></a><span class="lineno"> 2430</span>  }</div>
|
|
<div class="line"><a name="l02431"></a><span class="lineno"> 2431</span>  </div>
|
|
<div class="line"><a name="l02432"></a><span class="lineno"> 2432</span>  <span class="comment">// Compute a lower bound on the outgoing flow.</span></div>
|
|
<div class="line"><a name="l02433"></a><span class="lineno"> 2433</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l02434"></a><span class="lineno"> 2434</span>  <span class="comment">// TODO(user): This lower bound assume all nodes in subset must be served,</span></div>
|
|
<div class="line"><a name="l02435"></a><span class="lineno"> 2435</span>  <span class="comment">// which is not the case. For TSP we do the correct thing in</span></div>
|
|
<div class="line"><a name="l02436"></a><span class="lineno"> 2436</span>  <span class="comment">// AddOutgoingCut() but not for CVRP... Fix!!</span></div>
|
|
<div class="line"><a name="l02437"></a><span class="lineno"> 2437</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l02438"></a><span class="lineno"> 2438</span>  <span class="comment">// TODO(user): It could be very interesting to see if this "min outgoing</span></div>
|
|
<div class="line"><a name="l02439"></a><span class="lineno"> 2439</span>  <span class="comment">// flow" cannot be automatically infered from the constraint in the</span></div>
|
|
<div class="line"><a name="l02440"></a><span class="lineno"> 2440</span>  <span class="comment">// precedence graph. This might work if we assume that any kind of path</span></div>
|
|
<div class="line"><a name="l02441"></a><span class="lineno"> 2441</span>  <span class="comment">// cumul constraint is encoded with constraints:</span></div>
|
|
<div class="line"><a name="l02442"></a><span class="lineno"> 2442</span>  <span class="comment">// [edge => value_head >= value_tail + edge_weight].</span></div>
|
|
<div class="line"><a name="l02443"></a><span class="lineno"> 2443</span>  <span class="comment">// We could take the minimum incoming edge weight per node in the set, and</span></div>
|
|
<div class="line"><a name="l02444"></a><span class="lineno"> 2444</span>  <span class="comment">// use the cumul variable domain to infer some capacity.</span></div>
|
|
<div class="line"><a name="l02445"></a><span class="lineno"> 2445</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> min_outgoing_flow = 1;</div>
|
|
<div class="line"><a name="l02446"></a><span class="lineno"> 2446</span>  <span class="keywordflow">if</span> (!demands.empty()) {</div>
|
|
<div class="line"><a name="l02447"></a><span class="lineno"> 2447</span>  min_outgoing_flow =</div>
|
|
<div class="line"><a name="l02448"></a><span class="lineno"> 2448</span>  contain_depot</div>
|
|
<div class="line"><a name="l02449"></a><span class="lineno"> 2449</span>  ? (total_demands - subset_demand + <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a> - 1) / <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a></div>
|
|
<div class="line"><a name="l02450"></a><span class="lineno"> 2450</span>  : (subset_demand + <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a> - 1) / <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>;</div>
|
|
<div class="line"><a name="l02451"></a><span class="lineno"> 2451</span>  }</div>
|
|
<div class="line"><a name="l02452"></a><span class="lineno"> 2452</span>  </div>
|
|
<div class="line"><a name="l02453"></a><span class="lineno"> 2453</span>  <span class="comment">// We still need to serve nodes with a demand of zero, and in the corner</span></div>
|
|
<div class="line"><a name="l02454"></a><span class="lineno"> 2454</span>  <span class="comment">// case where all node in subset have a zero demand, the formula above</span></div>
|
|
<div class="line"><a name="l02455"></a><span class="lineno"> 2455</span>  <span class="comment">// result in a min_outgoing_flow of zero.</span></div>
|
|
<div class="line"><a name="l02456"></a><span class="lineno"> 2456</span>  min_outgoing_flow = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(min_outgoing_flow, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>{1});</div>
|
|
<div class="line"><a name="l02457"></a><span class="lineno"> 2457</span>  </div>
|
|
<div class="line"><a name="l02458"></a><span class="lineno"> 2458</span>  <span class="comment">// Compute the current outgoing flow out of the subset.</span></div>
|
|
<div class="line"><a name="l02459"></a><span class="lineno"> 2459</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l02460"></a><span class="lineno"> 2460</span>  <span class="comment">// This can take a significant portion of the running time, it is why it is</span></div>
|
|
<div class="line"><a name="l02461"></a><span class="lineno"> 2461</span>  <span class="comment">// faster to do it only on arcs with non-zero lp values which should be in</span></div>
|
|
<div class="line"><a name="l02462"></a><span class="lineno"> 2462</span>  <span class="comment">// linear number rather than the total number of arc which can be quadratic.</span></div>
|
|
<div class="line"><a name="l02463"></a><span class="lineno"> 2463</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l02464"></a><span class="lineno"> 2464</span>  <span class="comment">// TODO(user): For the symmetric case there is an even faster algo. See if</span></div>
|
|
<div class="line"><a name="l02465"></a><span class="lineno"> 2465</span>  <span class="comment">// it can be generalized to the asymmetric one if become needed.</span></div>
|
|
<div class="line"><a name="l02466"></a><span class="lineno"> 2466</span>  <span class="comment">// Reference is algo 6.4 of the "The Traveling Salesman Problem" book</span></div>
|
|
<div class="line"><a name="l02467"></a><span class="lineno"> 2467</span>  <span class="comment">// mentionned above.</span></div>
|
|
<div class="line"><a name="l02468"></a><span class="lineno"> 2468</span>  <span class="keywordtype">double</span> outgoing_flow = 0.0;</div>
|
|
<div class="line"><a name="l02469"></a><span class="lineno"> 2469</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> arc : relevant_arcs) {</div>
|
|
<div class="line"><a name="l02470"></a><span class="lineno"> 2470</span>  <span class="keywordflow">if</span> (in_subset[arc.tail] && !in_subset[arc.head]) {</div>
|
|
<div class="line"><a name="l02471"></a><span class="lineno"> 2471</span>  outgoing_flow += arc.lp_value;</div>
|
|
<div class="line"><a name="l02472"></a><span class="lineno"> 2472</span>  }</div>
|
|
<div class="line"><a name="l02473"></a><span class="lineno"> 2473</span>  }</div>
|
|
<div class="line"><a name="l02474"></a><span class="lineno"> 2474</span>  </div>
|
|
<div class="line"><a name="l02475"></a><span class="lineno"> 2475</span>  <span class="comment">// Add a cut if the current outgoing flow is not enough.</span></div>
|
|
<div class="line"><a name="l02476"></a><span class="lineno"> 2476</span>  <span class="keywordflow">if</span> (outgoing_flow < min_outgoing_flow - 1e-6) {</div>
|
|
<div class="line"><a name="l02477"></a><span class="lineno"> 2477</span>  AddOutgoingCut(num_nodes, subset.size(), in_subset, tails, heads,</div>
|
|
<div class="line"><a name="l02478"></a><span class="lineno"> 2478</span>  literals, literal_lp_values,</div>
|
|
<div class="line"><a name="l02479"></a><span class="lineno"> 2479</span>  <span class="comment">/*rhs_lower_bound=*/</span>min_outgoing_flow, lp_values, manager,</div>
|
|
<div class="line"><a name="l02480"></a><span class="lineno"> 2480</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l02481"></a><span class="lineno"> 2481</span>  }</div>
|
|
<div class="line"><a name="l02482"></a><span class="lineno"> 2482</span>  </div>
|
|
<div class="line"><a name="l02483"></a><span class="lineno"> 2483</span>  <span class="comment">// Sparse clean up.</span></div>
|
|
<div class="line"><a name="l02484"></a><span class="lineno"> 2484</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> n : subset) in_subset[n] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02485"></a><span class="lineno"> 2485</span>  }</div>
|
|
<div class="line"><a name="l02486"></a><span class="lineno"> 2486</span> }</div>
|
|
<div class="line"><a name="l02487"></a><span class="lineno"> 2487</span>  </div>
|
|
<div class="line"><a name="l02488"></a><span class="lineno"> 2488</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l02489"></a><span class="lineno"> 2489</span>  </div>
|
|
<div class="line"><a name="l02490"></a><span class="lineno"> 2490</span> <span class="comment">// Returns for each literal its integer view, or the view of its negation.</span></div>
|
|
<div class="line"><a name="l02491"></a><span class="lineno"> 2491</span> std::vector<IntegerVariable> GetAssociatedVariables(</div>
|
|
<div class="line"><a name="l02492"></a><span class="lineno"> 2492</span>  <span class="keyword">const</span> std::vector<Literal>& literals, Model* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l02493"></a><span class="lineno"> 2493</span>  <span class="keyword">auto</span>* encoder = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<IntegerEncoder>();</div>
|
|
<div class="line"><a name="l02494"></a><span class="lineno"> 2494</span>  std::vector<IntegerVariable> result;</div>
|
|
<div class="line"><a name="l02495"></a><span class="lineno"> 2495</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : literals) {</div>
|
|
<div class="line"><a name="l02496"></a><span class="lineno"> 2496</span>  <span class="keyword">const</span> IntegerVariable direct_view = encoder->GetLiteralView(l);</div>
|
|
<div class="line"><a name="l02497"></a><span class="lineno"> 2497</span>  <span class="keywordflow">if</span> (direct_view != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div>
|
|
<div class="line"><a name="l02498"></a><span class="lineno"> 2498</span>  result.push_back(direct_view);</div>
|
|
<div class="line"><a name="l02499"></a><span class="lineno"> 2499</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02500"></a><span class="lineno"> 2500</span>  result.push_back(encoder->GetLiteralView(l.Negated()));</div>
|
|
<div class="line"><a name="l02501"></a><span class="lineno"> 2501</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(result.back(), <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>);</div>
|
|
<div class="line"><a name="l02502"></a><span class="lineno"> 2502</span>  }</div>
|
|
<div class="line"><a name="l02503"></a><span class="lineno"> 2503</span>  }</div>
|
|
<div class="line"><a name="l02504"></a><span class="lineno"> 2504</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l02505"></a><span class="lineno"> 2505</span> }</div>
|
|
<div class="line"><a name="l02506"></a><span class="lineno"> 2506</span>  </div>
|
|
<div class="line"><a name="l02507"></a><span class="lineno"> 2507</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l02508"></a><span class="lineno"> 2508</span>  </div>
|
|
<div class="line"><a name="l02509"></a><span class="lineno"> 2509</span> <span class="comment">// We use a basic algorithm to detect components that are not connected to the</span></div>
|
|
<div class="line"><a name="l02510"></a><span class="lineno"> 2510</span> <span class="comment">// rest of the graph in the LP solution, and add cuts to force some arcs to</span></div>
|
|
<div class="line"><a name="l02511"></a><span class="lineno"> 2511</span> <span class="comment">// enter and leave this component from outside.</span></div>
|
|
<div class="line"><a name="l02512"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ae9e5d88686fd52d3bd1a89d7754ca18c"> 2512</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code" href="namespaceoperations__research_1_1sat.html#ae9e5d88686fd52d3bd1a89d7754ca18c">CreateStronglyConnectedGraphCutGenerator</a>(</div>
|
|
<div class="line"><a name="l02513"></a><span class="lineno"> 2513</span>  <span class="keywordtype">int</span> num_nodes, <span class="keyword">const</span> std::vector<int>& tails, <span class="keyword">const</span> std::vector<int>& heads,</div>
|
|
<div class="line"><a name="l02514"></a><span class="lineno"> 2514</span>  <span class="keyword">const</span> std::vector<Literal>& literals, <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l02515"></a><span class="lineno"> 2515</span>  <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div>
|
|
<div class="line"><a name="l02516"></a><span class="lineno"> 2516</span>  result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a> = GetAssociatedVariables(literals, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l02517"></a><span class="lineno"> 2517</span>  result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#af7117deb3f57ff3ecceddc6e9bb2c561">generate_cuts</a> =</div>
|
|
<div class="line"><a name="l02518"></a><span class="lineno"> 2518</span>  [num_nodes, tails, heads, literals, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>](</div>
|
|
<div class="line"><a name="l02519"></a><span class="lineno"> 2519</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values,</div>
|
|
<div class="line"><a name="l02520"></a><span class="lineno"> 2520</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div>
|
|
<div class="line"><a name="l02521"></a><span class="lineno"> 2521</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a2a367e1c70abb013c50b1a7d1cf00bb3">SeparateSubtourInequalities</a>(</div>
|
|
<div class="line"><a name="l02522"></a><span class="lineno"> 2522</span>  num_nodes, tails, heads, literals, lp_values,</div>
|
|
<div class="line"><a name="l02523"></a><span class="lineno"> 2523</span>  <span class="comment">/*demands=*/</span>{}, <span class="comment">/*capacity=*/</span>0, manager, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l02524"></a><span class="lineno"> 2524</span>  };</div>
|
|
<div class="line"><a name="l02525"></a><span class="lineno"> 2525</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l02526"></a><span class="lineno"> 2526</span> }</div>
|
|
<div class="line"><a name="l02527"></a><span class="lineno"> 2527</span>  </div>
|
|
<div class="line"><a name="l02528"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a83551f805175c3a30ea146efaad2ec63"> 2528</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> <a class="code" href="namespaceoperations__research_1_1sat.html#a83551f805175c3a30ea146efaad2ec63">CreateCVRPCutGenerator</a>(<span class="keywordtype">int</span> num_nodes,</div>
|
|
<div class="line"><a name="l02529"></a><span class="lineno"> 2529</span>  <span class="keyword">const</span> std::vector<int>& tails,</div>
|
|
<div class="line"><a name="l02530"></a><span class="lineno"> 2530</span>  <span class="keyword">const</span> std::vector<int>& heads,</div>
|
|
<div class="line"><a name="l02531"></a><span class="lineno"> 2531</span>  <span class="keyword">const</span> std::vector<Literal>& literals,</div>
|
|
<div class="line"><a name="l02532"></a><span class="lineno"> 2532</span>  <span class="keyword">const</span> std::vector<int64>& demands,</div>
|
|
<div class="line"><a name="l02533"></a><span class="lineno"> 2533</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l02534"></a><span class="lineno"> 2534</span>  <a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html">CutGenerator</a> result;</div>
|
|
<div class="line"><a name="l02535"></a><span class="lineno"> 2535</span>  result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">vars</a> = GetAssociatedVariables(literals, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l02536"></a><span class="lineno"> 2536</span>  result.<a class="code" href="structoperations__research_1_1sat_1_1_cut_generator.html#af7117deb3f57ff3ecceddc6e9bb2c561">generate_cuts</a> =</div>
|
|
<div class="line"><a name="l02537"></a><span class="lineno"> 2537</span>  [num_nodes, tails, heads, demands, <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, literals, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>](</div>
|
|
<div class="line"><a name="l02538"></a><span class="lineno"> 2538</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<IntegerVariable, double></a>& lp_values,</div>
|
|
<div class="line"><a name="l02539"></a><span class="lineno"> 2539</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">LinearConstraintManager</a>* manager) {</div>
|
|
<div class="line"><a name="l02540"></a><span class="lineno"> 2540</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a2a367e1c70abb013c50b1a7d1cf00bb3">SeparateSubtourInequalities</a>(num_nodes, tails, heads, literals,</div>
|
|
<div class="line"><a name="l02541"></a><span class="lineno"> 2541</span>  lp_values, demands, <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, manager,</div>
|
|
<div class="line"><a name="l02542"></a><span class="lineno"> 2542</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l02543"></a><span class="lineno"> 2543</span>  };</div>
|
|
<div class="line"><a name="l02544"></a><span class="lineno"> 2544</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l02545"></a><span class="lineno"> 2545</span> }</div>
|
|
<div class="line"><a name="l02546"></a><span class="lineno"> 2546</span>  </div>
|
|
<div class="line"><a name="l02547"></a><span class="lineno"> 2547</span> std::function<IntegerLiteral()></div>
|
|
<div class="line"><a name="l02548"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#abe80d18b1ff9d46681da4c752352e53c"> 2548</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#abe80d18b1ff9d46681da4c752352e53c">LinearProgrammingConstraint::HeuristicLpMostInfeasibleBinary</a>(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l02549"></a><span class="lineno"> 2549</span>  <span class="comment">// Gather all 0-1 variables that appear in this LP.</span></div>
|
|
<div class="line"><a name="l02550"></a><span class="lineno"> 2550</span>  std::vector<IntegerVariable> variables;</div>
|
|
<div class="line"><a name="l02551"></a><span class="lineno"> 2551</span>  <span class="keywordflow">for</span> (IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : integer_variables_) {</div>
|
|
<div class="line"><a name="l02552"></a><span class="lineno"> 2552</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) == 0 &&</div>
|
|
<div class="line"><a name="l02553"></a><span class="lineno"> 2553</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) == 1) {</div>
|
|
<div class="line"><a name="l02554"></a><span class="lineno"> 2554</span>  variables.push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l02555"></a><span class="lineno"> 2555</span>  }</div>
|
|
<div class="line"><a name="l02556"></a><span class="lineno"> 2556</span>  }</div>
|
|
<div class="line"><a name="l02557"></a><span class="lineno"> 2557</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"HeuristicLPMostInfeasibleBinary has "</span> << variables.size()</div>
|
|
<div class="line"><a name="l02558"></a><span class="lineno"> 2558</span>  << <span class="stringliteral">" variables."</span>;</div>
|
|
<div class="line"><a name="l02559"></a><span class="lineno"> 2559</span>  </div>
|
|
<div class="line"><a name="l02560"></a><span class="lineno"> 2560</span>  <span class="keywordflow">return</span> [<span class="keyword">this</span>, variables]() {</div>
|
|
<div class="line"><a name="l02561"></a><span class="lineno"> 2561</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code" href="namespaceoperations__research_1_1glop.html#acf67607e9e6dd5986836b79ce28b80c4">kEpsilon</a> = 1e-6;</div>
|
|
<div class="line"><a name="l02562"></a><span class="lineno"> 2562</span>  <span class="comment">// Find most fractional value.</span></div>
|
|
<div class="line"><a name="l02563"></a><span class="lineno"> 2563</span>  IntegerVariable fractional_var = <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>;</div>
|
|
<div class="line"><a name="l02564"></a><span class="lineno"> 2564</span>  <span class="keywordtype">double</span> fractional_distance_best = -1.0;</div>
|
|
<div class="line"><a name="l02565"></a><span class="lineno"> 2565</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : variables) {</div>
|
|
<div class="line"><a name="l02566"></a><span class="lineno"> 2566</span>  <span class="comment">// Skip ignored and fixed variables.</span></div>
|
|
<div class="line"><a name="l02567"></a><span class="lineno"> 2567</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a309d057e12c8d4d393f13975eea2e2a9">IsCurrentlyIgnored</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02568"></a><span class="lineno"> 2568</span>  <span class="keyword">const</span> IntegerValue lb = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l02569"></a><span class="lineno"> 2569</span>  <span class="keyword">const</span> IntegerValue ub = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l02570"></a><span class="lineno"> 2570</span>  <span class="keywordflow">if</span> (lb == ub) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02571"></a><span class="lineno"> 2571</span>  </div>
|
|
<div class="line"><a name="l02572"></a><span class="lineno"> 2572</span>  <span class="comment">// Check variable's support is fractional.</span></div>
|
|
<div class="line"><a name="l02573"></a><span class="lineno"> 2573</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lp_value = this-><a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a460fe5216ff7f997841e588d432be744">GetSolutionValue</a>(var);</div>
|
|
<div class="line"><a name="l02574"></a><span class="lineno"> 2574</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> fractional_distance =</div>
|
|
<div class="line"><a name="l02575"></a><span class="lineno"> 2575</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(std::ceil(lp_value - <a class="code" href="namespaceoperations__research_1_1glop.html#acf67607e9e6dd5986836b79ce28b80c4">kEpsilon</a>) - lp_value,</div>
|
|
<div class="line"><a name="l02576"></a><span class="lineno"> 2576</span>  lp_value - std::floor(lp_value + <a class="code" href="namespaceoperations__research_1_1glop.html#acf67607e9e6dd5986836b79ce28b80c4">kEpsilon</a>));</div>
|
|
<div class="line"><a name="l02577"></a><span class="lineno"> 2577</span>  <span class="keywordflow">if</span> (fractional_distance < <a class="code" href="namespaceoperations__research_1_1glop.html#acf67607e9e6dd5986836b79ce28b80c4">kEpsilon</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02578"></a><span class="lineno"> 2578</span>  </div>
|
|
<div class="line"><a name="l02579"></a><span class="lineno"> 2579</span>  <span class="comment">// Keep variable if it is farther from integrality than the previous.</span></div>
|
|
<div class="line"><a name="l02580"></a><span class="lineno"> 2580</span>  <span class="keywordflow">if</span> (fractional_distance > fractional_distance_best) {</div>
|
|
<div class="line"><a name="l02581"></a><span class="lineno"> 2581</span>  fractional_var = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>;</div>
|
|
<div class="line"><a name="l02582"></a><span class="lineno"> 2582</span>  fractional_distance_best = fractional_distance;</div>
|
|
<div class="line"><a name="l02583"></a><span class="lineno"> 2583</span>  }</div>
|
|
<div class="line"><a name="l02584"></a><span class="lineno"> 2584</span>  }</div>
|
|
<div class="line"><a name="l02585"></a><span class="lineno"> 2585</span>  </div>
|
|
<div class="line"><a name="l02586"></a><span class="lineno"> 2586</span>  <span class="keywordflow">if</span> (fractional_var != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div>
|
|
<div class="line"><a name="l02587"></a><span class="lineno"> 2587</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(fractional_var, IntegerValue(1));</div>
|
|
<div class="line"><a name="l02588"></a><span class="lineno"> 2588</span>  }</div>
|
|
<div class="line"><a name="l02589"></a><span class="lineno"> 2589</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a>();</div>
|
|
<div class="line"><a name="l02590"></a><span class="lineno"> 2590</span>  };</div>
|
|
<div class="line"><a name="l02591"></a><span class="lineno"> 2591</span> }</div>
|
|
<div class="line"><a name="l02592"></a><span class="lineno"> 2592</span>  </div>
|
|
<div class="line"><a name="l02593"></a><span class="lineno"> 2593</span> std::function<<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a>()></div>
|
|
<div class="line"><a name="l02594"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a874f2f502681d547a666278de20564e3"> 2594</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a874f2f502681d547a666278de20564e3">LinearProgrammingConstraint::HeuristicLpReducedCostBinary</a>(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l02595"></a><span class="lineno"> 2595</span>  <span class="comment">// Gather all 0-1 variables that appear in this LP.</span></div>
|
|
<div class="line"><a name="l02596"></a><span class="lineno"> 2596</span>  std::vector<IntegerVariable> variables;</div>
|
|
<div class="line"><a name="l02597"></a><span class="lineno"> 2597</span>  <span class="keywordflow">for</span> (IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : integer_variables_) {</div>
|
|
<div class="line"><a name="l02598"></a><span class="lineno"> 2598</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) == 0 &&</div>
|
|
<div class="line"><a name="l02599"></a><span class="lineno"> 2599</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) == 1) {</div>
|
|
<div class="line"><a name="l02600"></a><span class="lineno"> 2600</span>  variables.push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l02601"></a><span class="lineno"> 2601</span>  }</div>
|
|
<div class="line"><a name="l02602"></a><span class="lineno"> 2602</span>  }</div>
|
|
<div class="line"><a name="l02603"></a><span class="lineno"> 2603</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"HeuristicLpReducedCostBinary has "</span> << variables.size()</div>
|
|
<div class="line"><a name="l02604"></a><span class="lineno"> 2604</span>  << <span class="stringliteral">" variables."</span>;</div>
|
|
<div class="line"><a name="l02605"></a><span class="lineno"> 2605</span>  </div>
|
|
<div class="line"><a name="l02606"></a><span class="lineno"> 2606</span>  <span class="comment">// Store average of reduced cost from 1 to 0. The best heuristic only sets</span></div>
|
|
<div class="line"><a name="l02607"></a><span class="lineno"> 2607</span>  <span class="comment">// variables to one and cares about cost to zero, even though classic</span></div>
|
|
<div class="line"><a name="l02608"></a><span class="lineno"> 2608</span>  <span class="comment">// pseudocost will use max_var min(cost_to_one[var], cost_to_zero[var]).</span></div>
|
|
<div class="line"><a name="l02609"></a><span class="lineno"> 2609</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = variables.size();</div>
|
|
<div class="line"><a name="l02610"></a><span class="lineno"> 2610</span>  std::vector<double> cost_to_zero(num_vars, 0.0);</div>
|
|
<div class="line"><a name="l02611"></a><span class="lineno"> 2611</span>  std::vector<int> num_cost_to_zero(num_vars);</div>
|
|
<div class="line"><a name="l02612"></a><span class="lineno"> 2612</span>  <span class="keywordtype">int</span> num_calls = 0;</div>
|
|
<div class="line"><a name="l02613"></a><span class="lineno"> 2613</span>  </div>
|
|
<div class="line"><a name="l02614"></a><span class="lineno"> 2614</span>  <span class="keywordflow">return</span> [=]() <span class="keyword">mutable</span> {</div>
|
|
<div class="line"><a name="l02615"></a><span class="lineno"> 2615</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code" href="namespaceoperations__research_1_1glop.html#acf67607e9e6dd5986836b79ce28b80c4">kEpsilon</a> = 1e-6;</div>
|
|
<div class="line"><a name="l02616"></a><span class="lineno"> 2616</span>  </div>
|
|
<div class="line"><a name="l02617"></a><span class="lineno"> 2617</span>  <span class="comment">// Every 10000 calls, decay pseudocosts.</span></div>
|
|
<div class="line"><a name="l02618"></a><span class="lineno"> 2618</span>  num_calls++;</div>
|
|
<div class="line"><a name="l02619"></a><span class="lineno"> 2619</span>  <span class="keywordflow">if</span> (num_calls == 10000) {</div>
|
|
<div class="line"><a name="l02620"></a><span class="lineno"> 2620</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; i++) {</div>
|
|
<div class="line"><a name="l02621"></a><span class="lineno"> 2621</span>  cost_to_zero[i] /= 2;</div>
|
|
<div class="line"><a name="l02622"></a><span class="lineno"> 2622</span>  num_cost_to_zero[i] /= 2;</div>
|
|
<div class="line"><a name="l02623"></a><span class="lineno"> 2623</span>  }</div>
|
|
<div class="line"><a name="l02624"></a><span class="lineno"> 2624</span>  num_calls = 0;</div>
|
|
<div class="line"><a name="l02625"></a><span class="lineno"> 2625</span>  }</div>
|
|
<div class="line"><a name="l02626"></a><span class="lineno"> 2626</span>  </div>
|
|
<div class="line"><a name="l02627"></a><span class="lineno"> 2627</span>  <span class="comment">// Accumulate pseudo-costs of all unassigned variables.</span></div>
|
|
<div class="line"><a name="l02628"></a><span class="lineno"> 2628</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; i++) {</div>
|
|
<div class="line"><a name="l02629"></a><span class="lineno"> 2629</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = variables[i];</div>
|
|
<div class="line"><a name="l02630"></a><span class="lineno"> 2630</span>  <span class="comment">// Skip ignored and fixed variables.</span></div>
|
|
<div class="line"><a name="l02631"></a><span class="lineno"> 2631</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a309d057e12c8d4d393f13975eea2e2a9">IsCurrentlyIgnored</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02632"></a><span class="lineno"> 2632</span>  <span class="keyword">const</span> IntegerValue lb = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l02633"></a><span class="lineno"> 2633</span>  <span class="keyword">const</span> IntegerValue ub = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l02634"></a><span class="lineno"> 2634</span>  <span class="keywordflow">if</span> (lb == ub) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02635"></a><span class="lineno"> 2635</span>  </div>
|
|
<div class="line"><a name="l02636"></a><span class="lineno"> 2636</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> rc = this-><a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#aeb58dc2ca6b2d8f627b837fcfaa4955a">GetSolutionReducedCost</a>(var);</div>
|
|
<div class="line"><a name="l02637"></a><span class="lineno"> 2637</span>  <span class="comment">// Skip reduced costs that are nonzero because of numerical issues.</span></div>
|
|
<div class="line"><a name="l02638"></a><span class="lineno"> 2638</span>  <span class="keywordflow">if</span> (std::abs(rc) < <a class="code" href="namespaceoperations__research_1_1glop.html#acf67607e9e6dd5986836b79ce28b80c4">kEpsilon</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02639"></a><span class="lineno"> 2639</span>  </div>
|
|
<div class="line"><a name="l02640"></a><span class="lineno"> 2640</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> = std::round(this-><a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a460fe5216ff7f997841e588d432be744">GetSolutionValue</a>(var));</div>
|
|
<div class="line"><a name="l02641"></a><span class="lineno"> 2641</span>  <span class="keywordflow">if</span> (<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> == 1.0 && rc < 0.0) {</div>
|
|
<div class="line"><a name="l02642"></a><span class="lineno"> 2642</span>  cost_to_zero[i] -= rc;</div>
|
|
<div class="line"><a name="l02643"></a><span class="lineno"> 2643</span>  num_cost_to_zero[i]++;</div>
|
|
<div class="line"><a name="l02644"></a><span class="lineno"> 2644</span>  }</div>
|
|
<div class="line"><a name="l02645"></a><span class="lineno"> 2645</span>  }</div>
|
|
<div class="line"><a name="l02646"></a><span class="lineno"> 2646</span>  </div>
|
|
<div class="line"><a name="l02647"></a><span class="lineno"> 2647</span>  <span class="comment">// Select noninstantiated variable with highest pseudo-cost.</span></div>
|
|
<div class="line"><a name="l02648"></a><span class="lineno"> 2648</span>  <span class="keywordtype">int</span> selected_index = -1;</div>
|
|
<div class="line"><a name="l02649"></a><span class="lineno"> 2649</span>  <span class="keywordtype">double</span> best_cost = 0.0;</div>
|
|
<div class="line"><a name="l02650"></a><span class="lineno"> 2650</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; i++) {</div>
|
|
<div class="line"><a name="l02651"></a><span class="lineno"> 2651</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = variables[i];</div>
|
|
<div class="line"><a name="l02652"></a><span class="lineno"> 2652</span>  <span class="comment">// Skip ignored and fixed variables.</span></div>
|
|
<div class="line"><a name="l02653"></a><span class="lineno"> 2653</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a309d057e12c8d4d393f13975eea2e2a9">IsCurrentlyIgnored</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02654"></a><span class="lineno"> 2654</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">IsFixed</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02655"></a><span class="lineno"> 2655</span>  </div>
|
|
<div class="line"><a name="l02656"></a><span class="lineno"> 2656</span>  <span class="keywordflow">if</span> (num_cost_to_zero[i] > 0 &&</div>
|
|
<div class="line"><a name="l02657"></a><span class="lineno"> 2657</span>  best_cost < cost_to_zero[i] / num_cost_to_zero[i]) {</div>
|
|
<div class="line"><a name="l02658"></a><span class="lineno"> 2658</span>  best_cost = cost_to_zero[i] / num_cost_to_zero[i];</div>
|
|
<div class="line"><a name="l02659"></a><span class="lineno"> 2659</span>  selected_index = i;</div>
|
|
<div class="line"><a name="l02660"></a><span class="lineno"> 2660</span>  }</div>
|
|
<div class="line"><a name="l02661"></a><span class="lineno"> 2661</span>  }</div>
|
|
<div class="line"><a name="l02662"></a><span class="lineno"> 2662</span>  </div>
|
|
<div class="line"><a name="l02663"></a><span class="lineno"> 2663</span>  <span class="keywordflow">if</span> (selected_index >= 0) {</div>
|
|
<div class="line"><a name="l02664"></a><span class="lineno"> 2664</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(variables[selected_index],</div>
|
|
<div class="line"><a name="l02665"></a><span class="lineno"> 2665</span>  IntegerValue(1));</div>
|
|
<div class="line"><a name="l02666"></a><span class="lineno"> 2666</span>  }</div>
|
|
<div class="line"><a name="l02667"></a><span class="lineno"> 2667</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a>();</div>
|
|
<div class="line"><a name="l02668"></a><span class="lineno"> 2668</span>  };</div>
|
|
<div class="line"><a name="l02669"></a><span class="lineno"> 2669</span> }</div>
|
|
<div class="line"><a name="l02670"></a><span class="lineno"> 2670</span>  </div>
|
|
<div class="line"><a name="l02671"></a><span class="lineno"> 2671</span> <span class="keywordtype">void</span> LinearProgrammingConstraint::UpdateAverageReducedCosts() {</div>
|
|
<div class="line"><a name="l02672"></a><span class="lineno"> 2672</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = integer_variables_.size();</div>
|
|
<div class="line"><a name="l02673"></a><span class="lineno"> 2673</span>  <span class="keywordflow">if</span> (sum_cost_down_.size() < num_vars) {</div>
|
|
<div class="line"><a name="l02674"></a><span class="lineno"> 2674</span>  sum_cost_down_.resize(num_vars, 0.0);</div>
|
|
<div class="line"><a name="l02675"></a><span class="lineno"> 2675</span>  num_cost_down_.resize(num_vars, 0);</div>
|
|
<div class="line"><a name="l02676"></a><span class="lineno"> 2676</span>  sum_cost_up_.resize(num_vars, 0.0);</div>
|
|
<div class="line"><a name="l02677"></a><span class="lineno"> 2677</span>  num_cost_up_.resize(num_vars, 0);</div>
|
|
<div class="line"><a name="l02678"></a><span class="lineno"> 2678</span>  rc_scores_.resize(num_vars, 0.0);</div>
|
|
<div class="line"><a name="l02679"></a><span class="lineno"> 2679</span>  }</div>
|
|
<div class="line"><a name="l02680"></a><span class="lineno"> 2680</span>  </div>
|
|
<div class="line"><a name="l02681"></a><span class="lineno"> 2681</span>  <span class="comment">// Decay averages.</span></div>
|
|
<div class="line"><a name="l02682"></a><span class="lineno"> 2682</span>  num_calls_since_reduced_cost_averages_reset_++;</div>
|
|
<div class="line"><a name="l02683"></a><span class="lineno"> 2683</span>  <span class="keywordflow">if</span> (num_calls_since_reduced_cost_averages_reset_ == 10000) {</div>
|
|
<div class="line"><a name="l02684"></a><span class="lineno"> 2684</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; i++) {</div>
|
|
<div class="line"><a name="l02685"></a><span class="lineno"> 2685</span>  sum_cost_up_[i] /= 2;</div>
|
|
<div class="line"><a name="l02686"></a><span class="lineno"> 2686</span>  num_cost_up_[i] /= 2;</div>
|
|
<div class="line"><a name="l02687"></a><span class="lineno"> 2687</span>  sum_cost_down_[i] /= 2;</div>
|
|
<div class="line"><a name="l02688"></a><span class="lineno"> 2688</span>  num_cost_down_[i] /= 2;</div>
|
|
<div class="line"><a name="l02689"></a><span class="lineno"> 2689</span>  }</div>
|
|
<div class="line"><a name="l02690"></a><span class="lineno"> 2690</span>  num_calls_since_reduced_cost_averages_reset_ = 0;</div>
|
|
<div class="line"><a name="l02691"></a><span class="lineno"> 2691</span>  }</div>
|
|
<div class="line"><a name="l02692"></a><span class="lineno"> 2692</span>  </div>
|
|
<div class="line"><a name="l02693"></a><span class="lineno"> 2693</span>  <span class="comment">// Accumulate reduced costs of all unassigned variables.</span></div>
|
|
<div class="line"><a name="l02694"></a><span class="lineno"> 2694</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; i++) {</div>
|
|
<div class="line"><a name="l02695"></a><span class="lineno"> 2695</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = integer_variables_[i];</div>
|
|
<div class="line"><a name="l02696"></a><span class="lineno"> 2696</span>  </div>
|
|
<div class="line"><a name="l02697"></a><span class="lineno"> 2697</span>  <span class="comment">// Skip ignored and fixed variables.</span></div>
|
|
<div class="line"><a name="l02698"></a><span class="lineno"> 2698</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a309d057e12c8d4d393f13975eea2e2a9">IsCurrentlyIgnored</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02699"></a><span class="lineno"> 2699</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">IsFixed</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02700"></a><span class="lineno"> 2700</span>  </div>
|
|
<div class="line"><a name="l02701"></a><span class="lineno"> 2701</span>  <span class="comment">// Skip reduced costs that are zero or close.</span></div>
|
|
<div class="line"><a name="l02702"></a><span class="lineno"> 2702</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> rc = lp_reduced_cost_[i];</div>
|
|
<div class="line"><a name="l02703"></a><span class="lineno"> 2703</span>  <span class="keywordflow">if</span> (std::abs(rc) < kCpEpsilon) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02704"></a><span class="lineno"> 2704</span>  </div>
|
|
<div class="line"><a name="l02705"></a><span class="lineno"> 2705</span>  <span class="keywordflow">if</span> (rc < 0.0) {</div>
|
|
<div class="line"><a name="l02706"></a><span class="lineno"> 2706</span>  sum_cost_down_[i] -= rc;</div>
|
|
<div class="line"><a name="l02707"></a><span class="lineno"> 2707</span>  num_cost_down_[i]++;</div>
|
|
<div class="line"><a name="l02708"></a><span class="lineno"> 2708</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02709"></a><span class="lineno"> 2709</span>  sum_cost_up_[i] += rc;</div>
|
|
<div class="line"><a name="l02710"></a><span class="lineno"> 2710</span>  num_cost_up_[i]++;</div>
|
|
<div class="line"><a name="l02711"></a><span class="lineno"> 2711</span>  }</div>
|
|
<div class="line"><a name="l02712"></a><span class="lineno"> 2712</span>  }</div>
|
|
<div class="line"><a name="l02713"></a><span class="lineno"> 2713</span>  </div>
|
|
<div class="line"><a name="l02714"></a><span class="lineno"> 2714</span>  <span class="comment">// Tricky, we artificially reset the rc_rev_int_repository_ to level zero</span></div>
|
|
<div class="line"><a name="l02715"></a><span class="lineno"> 2715</span>  <span class="comment">// so that the rev_rc_start_ is zero.</span></div>
|
|
<div class="line"><a name="l02716"></a><span class="lineno"> 2716</span>  rc_rev_int_repository_.<a class="code" href="classoperations__research_1_1_rev_repository.html#a176d2c659864433ccd869b5fba8d57af">SetLevel</a>(0);</div>
|
|
<div class="line"><a name="l02717"></a><span class="lineno"> 2717</span>  rc_rev_int_repository_.<a class="code" href="classoperations__research_1_1_rev_repository.html#a176d2c659864433ccd869b5fba8d57af">SetLevel</a>(trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>());</div>
|
|
<div class="line"><a name="l02718"></a><span class="lineno"> 2718</span>  rev_rc_start_ = 0;</div>
|
|
<div class="line"><a name="l02719"></a><span class="lineno"> 2719</span>  </div>
|
|
<div class="line"><a name="l02720"></a><span class="lineno"> 2720</span>  <span class="comment">// Cache the new score (higher is better) using the average reduced costs</span></div>
|
|
<div class="line"><a name="l02721"></a><span class="lineno"> 2721</span>  <span class="comment">// as a signal.</span></div>
|
|
<div class="line"><a name="l02722"></a><span class="lineno"> 2722</span>  positions_by_decreasing_rc_score_.clear();</div>
|
|
<div class="line"><a name="l02723"></a><span class="lineno"> 2723</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; i++) {</div>
|
|
<div class="line"><a name="l02724"></a><span class="lineno"> 2724</span>  <span class="comment">// If only one direction exist, we takes its value divided by 2, so that</span></div>
|
|
<div class="line"><a name="l02725"></a><span class="lineno"> 2725</span>  <span class="comment">// such variable should have a smaller cost than the min of the two side</span></div>
|
|
<div class="line"><a name="l02726"></a><span class="lineno"> 2726</span>  <span class="comment">// except if one direction have a really high reduced costs.</span></div>
|
|
<div class="line"><a name="l02727"></a><span class="lineno"> 2727</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> a_up =</div>
|
|
<div class="line"><a name="l02728"></a><span class="lineno"> 2728</span>  num_cost_up_[i] > 0 ? sum_cost_up_[i] / num_cost_up_[i] : 0.0;</div>
|
|
<div class="line"><a name="l02729"></a><span class="lineno"> 2729</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> a_down =</div>
|
|
<div class="line"><a name="l02730"></a><span class="lineno"> 2730</span>  num_cost_down_[i] > 0 ? sum_cost_down_[i] / num_cost_down_[i] : 0.0;</div>
|
|
<div class="line"><a name="l02731"></a><span class="lineno"> 2731</span>  <span class="keywordflow">if</span> (num_cost_down_[i] > 0 && num_cost_up_[i] > 0) {</div>
|
|
<div class="line"><a name="l02732"></a><span class="lineno"> 2732</span>  rc_scores_[i] = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(a_up, a_down);</div>
|
|
<div class="line"><a name="l02733"></a><span class="lineno"> 2733</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02734"></a><span class="lineno"> 2734</span>  rc_scores_[i] = 0.5 * (a_down + a_up);</div>
|
|
<div class="line"><a name="l02735"></a><span class="lineno"> 2735</span>  }</div>
|
|
<div class="line"><a name="l02736"></a><span class="lineno"> 2736</span>  </div>
|
|
<div class="line"><a name="l02737"></a><span class="lineno"> 2737</span>  <span class="comment">// We ignore scores of zero (i.e. no data) and will follow the default</span></div>
|
|
<div class="line"><a name="l02738"></a><span class="lineno"> 2738</span>  <span class="comment">// search heuristic if all variables are like this.</span></div>
|
|
<div class="line"><a name="l02739"></a><span class="lineno"> 2739</span>  <span class="keywordflow">if</span> (rc_scores_[i] > 0.0) {</div>
|
|
<div class="line"><a name="l02740"></a><span class="lineno"> 2740</span>  positions_by_decreasing_rc_score_.push_back({-rc_scores_[i], i});</div>
|
|
<div class="line"><a name="l02741"></a><span class="lineno"> 2741</span>  }</div>
|
|
<div class="line"><a name="l02742"></a><span class="lineno"> 2742</span>  }</div>
|
|
<div class="line"><a name="l02743"></a><span class="lineno"> 2743</span>  std::sort(positions_by_decreasing_rc_score_.begin(),</div>
|
|
<div class="line"><a name="l02744"></a><span class="lineno"> 2744</span>  positions_by_decreasing_rc_score_.end());</div>
|
|
<div class="line"><a name="l02745"></a><span class="lineno"> 2745</span> }</div>
|
|
<div class="line"><a name="l02746"></a><span class="lineno"> 2746</span>  </div>
|
|
<div class="line"><a name="l02747"></a><span class="lineno"> 2747</span> <span class="comment">// TODO(user): Remove duplication with HeuristicLpReducedCostBinary().</span></div>
|
|
<div class="line"><a name="l02748"></a><span class="lineno"> 2748</span> std::function<IntegerLiteral()></div>
|
|
<div class="line"><a name="l02749"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a6ae27451c3238e2af96991a030b7556c"> 2749</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a6ae27451c3238e2af96991a030b7556c">LinearProgrammingConstraint::HeuristicLpReducedCostAverageBranching</a>() {</div>
|
|
<div class="line"><a name="l02750"></a><span class="lineno"> 2750</span>  <span class="keywordflow">return</span> [<span class="keyword">this</span>]() { <span class="keywordflow">return</span> this->LPReducedCostAverageDecision(); };</div>
|
|
<div class="line"><a name="l02751"></a><span class="lineno"> 2751</span> }</div>
|
|
<div class="line"><a name="l02752"></a><span class="lineno"> 2752</span>  </div>
|
|
<div class="line"><a name="l02753"></a><span class="lineno"> 2753</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> LinearProgrammingConstraint::LPReducedCostAverageDecision() {</div>
|
|
<div class="line"><a name="l02754"></a><span class="lineno"> 2754</span>  <span class="comment">// Select noninstantiated variable with highest positive average reduced cost.</span></div>
|
|
<div class="line"><a name="l02755"></a><span class="lineno"> 2755</span>  <span class="keywordtype">int</span> selected_index = -1;</div>
|
|
<div class="line"><a name="l02756"></a><span class="lineno"> 2756</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = positions_by_decreasing_rc_score_.size();</div>
|
|
<div class="line"><a name="l02757"></a><span class="lineno"> 2757</span>  rc_rev_int_repository_.<a class="code" href="classoperations__research_1_1_rev_repository.html#a32476d1fb09b1e06181ee07d30378b02">SaveState</a>(&rev_rc_start_);</div>
|
|
<div class="line"><a name="l02758"></a><span class="lineno"> 2758</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = rev_rc_start_; i < size; ++i) {</div>
|
|
<div class="line"><a name="l02759"></a><span class="lineno"> 2759</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = positions_by_decreasing_rc_score_[i].second;</div>
|
|
<div class="line"><a name="l02760"></a><span class="lineno"> 2760</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = integer_variables_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l02761"></a><span class="lineno"> 2761</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a309d057e12c8d4d393f13975eea2e2a9">IsCurrentlyIgnored</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02762"></a><span class="lineno"> 2762</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">IsFixed</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02763"></a><span class="lineno"> 2763</span>  selected_index = <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l02764"></a><span class="lineno"> 2764</span>  rev_rc_start_ = i;</div>
|
|
<div class="line"><a name="l02765"></a><span class="lineno"> 2765</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l02766"></a><span class="lineno"> 2766</span>  }</div>
|
|
<div class="line"><a name="l02767"></a><span class="lineno"> 2767</span>  </div>
|
|
<div class="line"><a name="l02768"></a><span class="lineno"> 2768</span>  <span class="keywordflow">if</span> (selected_index == -1) <span class="keywordflow">return</span> IntegerLiteral();</div>
|
|
<div class="line"><a name="l02769"></a><span class="lineno"> 2769</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = integer_variables_[selected_index];</div>
|
|
<div class="line"><a name="l02770"></a><span class="lineno"> 2770</span>  </div>
|
|
<div class="line"><a name="l02771"></a><span class="lineno"> 2771</span>  <span class="comment">// If ceil(value) is current upper bound, try var == upper bound first.</span></div>
|
|
<div class="line"><a name="l02772"></a><span class="lineno"> 2772</span>  <span class="comment">// Guarding with >= prevents numerical problems.</span></div>
|
|
<div class="line"><a name="l02773"></a><span class="lineno"> 2773</span>  <span class="comment">// With 0/1 variables, this will tend to try setting to 1 first,</span></div>
|
|
<div class="line"><a name="l02774"></a><span class="lineno"> 2774</span>  <span class="comment">// which produces more shallow trees.</span></div>
|
|
<div class="line"><a name="l02775"></a><span class="lineno"> 2775</span>  <span class="keyword">const</span> IntegerValue ub = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l02776"></a><span class="lineno"> 2776</span>  <span class="keyword">const</span> IntegerValue value_ceil(</div>
|
|
<div class="line"><a name="l02777"></a><span class="lineno"> 2777</span>  std::ceil(this-><a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a460fe5216ff7f997841e588d432be744">GetSolutionValue</a>(var) - kCpEpsilon));</div>
|
|
<div class="line"><a name="l02778"></a><span class="lineno"> 2778</span>  <span class="keywordflow">if</span> (value_ceil >= ub) {</div>
|
|
<div class="line"><a name="l02779"></a><span class="lineno"> 2779</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, ub);</div>
|
|
<div class="line"><a name="l02780"></a><span class="lineno"> 2780</span>  }</div>
|
|
<div class="line"><a name="l02781"></a><span class="lineno"> 2781</span>  </div>
|
|
<div class="line"><a name="l02782"></a><span class="lineno"> 2782</span>  <span class="comment">// If floor(value) is current lower bound, try var == lower bound first.</span></div>
|
|
<div class="line"><a name="l02783"></a><span class="lineno"> 2783</span>  <span class="comment">// Guarding with <= prevents numerical problems.</span></div>
|
|
<div class="line"><a name="l02784"></a><span class="lineno"> 2784</span>  <span class="keyword">const</span> IntegerValue lb = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l02785"></a><span class="lineno"> 2785</span>  <span class="keyword">const</span> IntegerValue value_floor(</div>
|
|
<div class="line"><a name="l02786"></a><span class="lineno"> 2786</span>  std::floor(this-><a class="code" href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a460fe5216ff7f997841e588d432be744">GetSolutionValue</a>(var) + kCpEpsilon));</div>
|
|
<div class="line"><a name="l02787"></a><span class="lineno"> 2787</span>  <span class="keywordflow">if</span> (value_floor <= lb) {</div>
|
|
<div class="line"><a name="l02788"></a><span class="lineno"> 2788</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, lb);</div>
|
|
<div class="line"><a name="l02789"></a><span class="lineno"> 2789</span>  }</div>
|
|
<div class="line"><a name="l02790"></a><span class="lineno"> 2790</span>  </div>
|
|
<div class="line"><a name="l02791"></a><span class="lineno"> 2791</span>  <span class="comment">// Here lb < value_floor <= value_ceil < ub.</span></div>
|
|
<div class="line"><a name="l02792"></a><span class="lineno"> 2792</span>  <span class="comment">// Try the most promising split between var <= floor or var >= ceil.</span></div>
|
|
<div class="line"><a name="l02793"></a><span class="lineno"> 2793</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> a_up =</div>
|
|
<div class="line"><a name="l02794"></a><span class="lineno"> 2794</span>  num_cost_up_[selected_index] > 0</div>
|
|
<div class="line"><a name="l02795"></a><span class="lineno"> 2795</span>  ? sum_cost_up_[selected_index] / num_cost_up_[selected_index]</div>
|
|
<div class="line"><a name="l02796"></a><span class="lineno"> 2796</span>  : 0.0;</div>
|
|
<div class="line"><a name="l02797"></a><span class="lineno"> 2797</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> a_down =</div>
|
|
<div class="line"><a name="l02798"></a><span class="lineno"> 2798</span>  num_cost_down_[selected_index] > 0</div>
|
|
<div class="line"><a name="l02799"></a><span class="lineno"> 2799</span>  ? sum_cost_down_[selected_index] / num_cost_down_[selected_index]</div>
|
|
<div class="line"><a name="l02800"></a><span class="lineno"> 2800</span>  : 0.0;</div>
|
|
<div class="line"><a name="l02801"></a><span class="lineno"> 2801</span>  <span class="keywordflow">if</span> (a_down < a_up) {</div>
|
|
<div class="line"><a name="l02802"></a><span class="lineno"> 2802</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, value_floor);</div>
|
|
<div class="line"><a name="l02803"></a><span class="lineno"> 2803</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02804"></a><span class="lineno"> 2804</span>  <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, value_ceil);</div>
|
|
<div class="line"><a name="l02805"></a><span class="lineno"> 2805</span>  }</div>
|
|
<div class="line"><a name="l02806"></a><span class="lineno"> 2806</span> }</div>
|
|
<div class="line"><a name="l02807"></a><span class="lineno"> 2807</span>  </div>
|
|
<div class="line"><a name="l02808"></a><span class="lineno"> 2808</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l02809"></a><span class="lineno"> 2809</span> } <span class="comment">// namespace operations_research</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_zero_half_cut_helper_html_af7012dee6abfab160a910241b61e1b1d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#af7012dee6abfab160a910241b61e1b1d">operations_research::sat::ZeroHalfCutHelper::InterestingCandidates</a></div><div class="ttdeci">std::vector< std::vector< std::pair< glop::RowIndex, IntegerValue > > > InterestingCandidates(ModelRandomGenerator *random)</div><div class="ttdef"><b>Definition:</b> <a href="zero__half__cuts_8cc_source.html#l00227">zero_half_cuts.cc:227</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01858">expr_array.cc:1858</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_constraint_html_a460fe5216ff7f997841e588d432be744"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a460fe5216ff7f997841e588d432be744">operations_research::sat::LinearProgrammingConstraint::GetSolutionValue</a></div><div class="ttdeci">double GetSolutionValue(IntegerVariable variable) const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00626">linear_programming_constraint.cc:626</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a10b672faee4b99c6a02feb0e343f3b0f"><div class="ttname"><a href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a></div><div class="ttdeci">int64 tail</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00127">routing_flow.cc:127</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_afda9b9b5e858d0c466d2a6293361004a"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#afda9b9b5e858d0c466d2a6293361004a">operations_research::glop::LinearProgram::num_constraints</a></div><div class="ttdeci">RowIndex num_constraints() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8h_source.html#l00207">lp_data.h:207</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_ad59b85e44037bd502a5d8bd3fe16c0f9a88c189a42c87aa49d667fc8ab76bc323"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9a88c189a42c87aa49d667fc8ab76bc323">operations_research::glop::ConstraintStatus::FREE</a></div><div class="ttdeci">@ FREE</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_a938b612b6f9885a417fda1bf886f4b39"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">operations_research::glop::RevisedSimplex::GetProblemStatus</a></div><div class="ttdeci">ProblemStatus GetProblemStatus() const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00433">revised_simplex.cc:433</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_adeee4ac52bfe0f1b48ee8958bb88b4e3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adeee4ac52bfe0f1b48ee8958bb88b4e3">operations_research::sat::GenericLiteralWatcher::Register</a></div><div class="ttdeci">int Register(PropagatorInterface *propagator)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01939">integer.cc:1939</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_aa23a76f0f582369176688b458cda07dc"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#aa23a76f0f582369176688b458cda07dc">operations_research::glop::LinearProgram::AddSlackVariablesWhereNecessary</a></div><div class="ttdeci">void AddSlackVariablesWhereNecessary(bool detect_integer_constraints)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00695">lp_data.cc:695</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a021e695f54a13bd809c34b2f4ca87c37"><div class="ttname"><a href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">min</a></div><div class="ttdeci">int64 min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00138">alldiff_cst.cc:138</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_a4dc8ae0f97c4110f3cc770715b2bbd12"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a4dc8ae0f97c4110f3cc770715b2bbd12">operations_research::glop::DenseRow</a></div><div class="ttdeci">StrictITIVector< ColIndex, Fractional > DenseRow</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00299">lp_types.h:299</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="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#l00533">integer.h:533</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_a1ac488f3db89f6d16a85c56f3243290cae4ac03f6c9f00665644e868dd1fb9f1e"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a1ac488f3db89f6d16a85c56f3243290cae4ac03f6c9f00665644e868dd1fb9f1e">operations_research::glop::VariableStatus::BASIC</a></div><div class="ttdeci">@ BASIC</div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00978">base/logging.h:978</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a9456bb31790e4dae791914e3c065b460"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a9456bb31790e4dae791914e3c065b460">operations_research::sat::LinearConstraintManager::AddCut</a></div><div class="ttdeci">bool AddCut(LinearConstraint ct, std::string type_name, const absl::StrongVector< IntegerVariable, double > &lp_solution, std::string extra_info="")</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint__manager_8cc_source.html#l00207">linear_constraint_manager.cc:207</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_a9263000d449fdccb6cb70b303063e60b"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b">absl::StrongVector::push_back</a></div><div class="ttdeci">void push_back(const value_type &x)</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00158">strong_vector.h:158</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a6894cc7d30a41a5e750f40a7f4751c01"><div class="ttname"><a href="namespaceoperations__research.html#a6894cc7d30a41a5e750f40a7f4751c01">operations_research::Arc</a></div><div class="ttdeci">std::pair< int64, int64 > Arc</div><div class="ttdef"><b>Definition:</b> <a href="search_8cc_source.html#l03361">search.cc:3361</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a228fe84d99348c2b62bb4f70a6371d9b"><div class="ttname"><a href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">operations_research::CapSub</a></div><div class="ttdeci">int64 CapSub(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00154">saturated_arithmetic.h:154</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a5bd8c44473618b7eafd33ba978db2f06"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">operations_research::sat::kNoIntegerVariable</a></div><div class="ttdeci">const IntegerVariable kNoIntegerVariable(-1)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a07823d046b027c81155f8a2f322cf813"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">operations_research::sat::FloorRatio</a></div><div class="ttdeci">IntegerValue FloorRatio(IntegerValue dividend, IntegerValue positive_divisor)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00090">integer.h:90</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ae2544d2a3a5ef4c78f8e5891f104ab41"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae2544d2a3a5ef4c78f8e5891f104ab41">operations_research::sat::VariableIsPositive</a></div><div class="ttdeci">bool VariableIsPositive(IntegerVariable i)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00130">integer.h:130</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a9d0c202d5fdd62f4fa2c613339ff168a"><div class="ttname"><a href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">max</a></div><div class="ttdeci">int64 max</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="astructoperations__research_1_1sat_1_1_linear_constraint_html_a73e4094f2d4e2adbe5e8d79a5b61fcd1"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">operations_research::sat::LinearConstraint::vars</a></div><div class="ttdeci">std::vector< IntegerVariable > vars</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8h_source.html#l00043">linear_constraint.h:43</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_ae8a885303349cb7807c7c87b405bc0c9a88ec4386a3c49b50819358a579fb9adb"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9a88ec4386a3c49b50819358a579fb9adb">operations_research::glop::ProblemStatus::ABNORMAL</a></div><div class="ttdeci">@ ABNORMAL</div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_a204f9b990226e8288e1aaecbb496cbf8"><div class="ttname"><a href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a></div><div class="ttdeci">int64 bound</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00972">routing_search.cc:972</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_constraint_html_a67a7327915e66c0514cfa465a0475be1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a67a7327915e66c0514cfa465a0475be1">operations_research::sat::LinearProgrammingConstraint::ConstraintIndex</a></div><div class="ttdeci">glop::RowIndex ConstraintIndex</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00131">linear_programming_constraint.h:131</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_cut_generator_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_cut_generator.html">operations_research::sat::CutGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00041">cuts.h:41</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_lp_scaling_helper_html_a306cb123e8da242a6daf1c397dfe6e73"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a306cb123e8da242a6daf1c397dfe6e73">operations_research::glop::LpScalingHelper::Scale</a></div><div class="ttdeci">void Scale(LinearProgram *lp)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data__utils_8cc_source.html#l00076">lp_data_utils.cc:76</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ab216763dccd16f5060d2fbcfb08173fb"><div class="ttname"><a href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">operations_research::CapProd</a></div><div class="ttdeci">int64 CapProd(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00231">saturated_arithmetic.h:231</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_a60304b65bf89363bcc3165d3cde67f86"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">absl::StrongVector::size</a></div><div class="ttdeci">size_type size() const</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00147">strong_vector.h:147</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_constraint_html_aeb58dc2ca6b2d8f627b837fcfaa4955a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#aeb58dc2ca6b2d8f627b837fcfaa4955a">operations_research::sat::LinearProgrammingConstraint::GetSolutionReducedCost</a></div><div class="ttdeci">double GetSolutionReducedCost(IntegerVariable variable) const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00631">linear_programming_constraint.cc:631</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ae9e5d88686fd52d3bd1a89d7754ca18c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae9e5d88686fd52d3bd1a89d7754ca18c">operations_research::sat::CreateStronglyConnectedGraphCutGenerator</a></div><div class="ttdeci">CutGenerator CreateStronglyConnectedGraphCutGenerator(int num_nodes, const std::vector< int > &tails, const std::vector< int > &heads, const std::vector< Literal > &literals, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l02512">linear_programming_constraint.cc:2512</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_ad59b85e44037bd502a5d8bd3fe16c0f9ae91836db656214f9797e10c15928e501"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9ae91836db656214f9797e10c15928e501">operations_research::glop::ConstraintStatus::FIXED_VALUE</a></div><div class="ttdeci">@ FIXED_VALUE</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_cover_cut_helper_html_a542e0108682bbed13c1ccaa078845520"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cover_cut_helper.html#a542e0108682bbed13c1ccaa078845520">operations_research::sat::CoverCutHelper::mutable_cut</a></div><div class="ttdeci">LinearConstraint * mutable_cut()</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00251">cuts.h:251</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#l01348">integer.h:1348</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#l01343">integer.h:1343</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#l00701">base/logging.h:701</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_ac4d90743acfe39707571f84f096a58d7"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#ac4d90743acfe39707571f84f096a58d7">operations_research::glop::RevisedSimplex::LoadStateForNextSolve</a></div><div class="ttdeci">void LoadStateForNextSolve(const BasisState &state)</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00125">revised_simplex.cc:125</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_acf67607e9e6dd5986836b79ce28b80c4"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#acf67607e9e6dd5986836b79ce28b80c4">operations_research::glop::kEpsilon</a></div><div class="ttdeci">const double kEpsilon</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00086">lp_types.h:86</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_a04fb52e044ec108e110796e29804cf06"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#a04fb52e044ec108e110796e29804cf06">operations_research::glop::RevisedSimplex::GetParameters</a></div><div class="ttdeci">const GlopParameters & GetParameters() const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8h_source.html#l00153">revised_simplex.h:153</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="aclassoperations__research_1_1sat_1_1_sat_solver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html">operations_research::sat::SatSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00057">sat_solver.h:57</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_encoder_html_a308a6df2722f2c0f36ec8888f4458b41"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html#a308a6df2722f2c0f36ec8888f4458b41">operations_research::sat::IntegerEncoder::GetLiteralView</a></div><div class="ttdeci">const IntegerVariable GetLiteralView(Literal lit) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00420">integer.h:420</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_a62b98dec38b6506442f9fc63f1a9b88f"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a62b98dec38b6506442f9fc63f1a9b88f">operations_research::glop::LinearProgram::SetConstraintBounds</a></div><div class="ttdeci">void SetConstraintBounds(RowIndex row, Fractional lower_bound, Fractional upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00308">lp_data.cc:308</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_a8963fd33e7bd70e749b2a37060ef1274"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8963fd33e7bd70e749b2a37060ef1274">operations_research::sat::GenericLiteralWatcher::RegisterReversibleInt</a></div><div class="ttdeci">void RegisterReversibleInt(int id, int *rev)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01983">integer.cc:1983</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab4f56aa24c4c9cddc47a6abd2d747f9a"><div class="ttname"><a href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a></div><div class="ttdeci">#define DCHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00890">base/logging.h:890</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a21edc7ca4cc5802c8779d68556bc09cf"><div class="ttname"><a href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a></div><div class="ttdeci">int64 value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00702">base/logging.h:702</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_cover_cut_helper_html_ad86e161bb994fe49fa9c4298ebb5ae2d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cover_cut_helper.html#ad86e161bb994fe49fa9c4298ebb5ae2d">operations_research::sat::CoverCutHelper::TrySimpleKnapsack</a></div><div class="ttdeci">bool TrySimpleKnapsack(const LinearConstraint base_ct, const std::vector< double > &lp_values, const std::vector< IntegerValue > &lower_bounds, const std::vector< IntegerValue > &upper_bounds)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l01155">cuts.cc:1155</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scattered_integer_vector_html_a1077b795353fa06d7705f43377bedfe9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#a1077b795353fa06d7705f43377bedfe9">operations_research::sat::ScatteredIntegerVector::ConvertToLinearConstraint</a></div><div class="ttdeci">void ConvertToLinearConstraint(const std::vector< IntegerVariable > &integer_variables, IntegerValue upper_bound, LinearConstraint *result)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00109">linear_programming_constraint.cc:109</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#l00700">base/logging.h:700</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_constraint_html_a9128c8abe6a695b34a5fa05169114c39"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a9128c8abe6a695b34a5fa05169114c39">operations_research::sat::LinearProgrammingConstraint::~LinearProgrammingConstraint</a></div><div class="ttdeci">~LinearProgrammingConstraint() override</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00183">linear_programming_constraint.cc:183</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a1951610defebe3a3b82d99006793486a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a1951610defebe3a3b82d99006793486a">operations_research::sat::LinearConstraintManager::ChangeLp</a></div><div class="ttdeci">bool ChangeLp(const absl::StrongVector< IntegerVariable, double > &lp_solution, glop::BasisState *solution_state)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint__manager_8cc_source.html#l00441">linear_constraint_manager.cc:441</a></div></div>
|
|
<div class="ttc" id="asaturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_math_util_html_a02deedce87f0c011025ec7716b04e9ea"><div class="ttname"><a href="classoperations__research_1_1_math_util.html#a02deedce87f0c011025ec7716b04e9ea">operations_research::MathUtil::GCD64</a></div><div class="ttdeci">static int64 GCD64(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="mathutil_8h_source.html#l00107">mathutil.h:107</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#l00027">integer.cc:27</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_af458164b470cbba416d5ed579e00ff60"><div class="ttname"><a href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a></div><div class="ttdeci">static const int64 kint64min</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00060">integral_types.h:60</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_constraint_html_a51cf34a6b42aa05c92f9b0b971b03dc9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a51cf34a6b42aa05c92f9b0b971b03dc9">operations_research::sat::LinearProgrammingConstraint::RegisterWith</a></div><div class="ttdeci">void RegisterWith(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00523">linear_programming_constraint.cc:523</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#l01257">integer.h:1257</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_constraint_html_aadd64e5df937ad4d29342ef997d6b9fc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#aadd64e5df937ad4d29342ef997d6b9fc">operations_research::sat::LinearProgrammingConstraint::IncrementalPropagate</a></div><div class="ttdeci">bool IncrementalPropagate(const std::vector< int > &watch_indices) override</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00589">linear_programming_constraint.cc:589</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_aab451f1144133e621abdcd566c048a8d"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#aab451f1144133e621abdcd566c048a8d">operations_research::glop::LinearProgram::NotifyThatColumnsAreClean</a></div><div class="ttdeci">void NotifyThatColumnsAreClean()</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8h_source.html#l00539">lp_data.h:539</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a7f1ac774d4646a83631f8117f4ea03f5"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">operations_research::sat::PositiveVariable</a></div><div class="ttdeci">IntegerVariable PositiveVariable(IntegerVariable i)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00134">integer.h:134</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_lp_scaling_helper_html_ad59ff81132bc4f1ac9759c7bf20e6964"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#ad59ff81132bc4f1ac9759c7bf20e6964">operations_research::glop::LpScalingHelper::UnscaleDualValue</a></div><div class="ttdeci">Fractional UnscaleDualValue(RowIndex row, Fractional value) const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data__utils_8cc_source.html#l00109">lp_data_utils.cc:109</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_a2638e7353203c8cb214228147a5e504a"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#a2638e7353203c8cb214228147a5e504a">operations_research::glop::RevisedSimplex::SetIntegralityScale</a></div><div class="ttdeci">void SetIntegralityScale(ColIndex col, Fractional scale)</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l02358">revised_simplex.cc:2358</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_implied_bounds_processor_html_aecf53d8ca125b38267c341d76cebf6a9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#aecf53d8ca125b38267c341d76cebf6a9">operations_research::sat::ImpliedBoundsProcessor::SeparateSomeImpliedBoundCuts</a></div><div class="ttdeci">void SeparateSomeImpliedBoundCuts(const absl::StrongVector< IntegerVariable, double > &lp_values)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l01575">cuts.cc:1575</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_incremental_average_html_a6d9b473fa04b0558a8e48737f5ab9564"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_incremental_average.html#a6d9b473fa04b0558a8e48737f5ab9564">operations_research::sat::IncrementalAverage::CurrentAverage</a></div><div class="ttdeci">double CurrentAverage() const</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8h_source.html#l00140">sat/util.h:140</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html">operations_research::TimeLimit</a></div><div class="ttdoc">A simple class to enforce both an elapsed time limit and a deterministic time limit in the same threa...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00105">time_limit.h:105</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00508">pack.cc:508</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_a184fe69018ae421dcf31c964bfe40576"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a184fe69018ae421dcf31c964bfe40576">absl::StrongVector::assign</a></div><div class="ttdeci">void assign(size_type n, const value_type &val)</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00131">strong_vector.h:131</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_a96c1f660991b5007ca24564f69cd27b8"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#a96c1f660991b5007ca24564f69cd27b8">operations_research::glop::RevisedSimplex::GetObjectiveValue</a></div><div class="ttdeci">Fractional GetObjectiveValue() const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00437">revised_simplex.cc:437</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_a733947145e3e1631165b618b05c9ccb7"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">operations_research::glop::Fractional</a></div><div class="ttdeci">double Fractional</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00077">lp_types.h:77</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_ad59b85e44037bd502a5d8bd3fe16c0f9a14dc61f52267ea9b476f64c1d4d975b1"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9a14dc61f52267ea9b476f64c1d4d975b1">operations_research::glop::ConstraintStatus::AT_UPPER_BOUND</a></div><div class="ttdeci">@ AT_UPPER_BOUND</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">operations_research::sat::GenericLiteralWatcher</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01101">integer.h:1101</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_a695ac3d8db5a986f572711f2ef3a6a39"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a695ac3d8db5a986f572711f2ef3a6a39">operations_research::glop::LinearProgram::CreateNewVariable</a></div><div class="ttdeci">ColIndex CreateNewVariable()</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00161">lp_data.cc:161</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scattered_integer_vector_html_abd20bd618d3e097f3b59958764460578"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#abd20bd618d3e097f3b59958764460578">operations_research::sat::ScatteredIntegerVector::GetTerms</a></div><div class="ttdeci">std::vector< std::pair< glop::ColIndex, IntegerValue > > GetTerms()</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00136">linear_programming_constraint.cc:136</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_ad9d564651057c77b3f2ca1293134557f"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#ad9d564651057c77b3f2ca1293134557f">operations_research::glop::LinearProgram::CreateNewConstraint</a></div><div class="ttdeci">RowIndex CreateNewConstraint()</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00190">lp_data.cc:190</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scattered_integer_vector_html_ab2fc4510692e040b62507dce522e0e31"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#ab2fc4510692e040b62507dce522e0e31">operations_research::sat::ScatteredIntegerVector::ClearAndResize</a></div><div class="ttdeci">void ClearAndResize(int size)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00053">linear_programming_constraint.cc:53</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_abce27d097bc5680207b294bdad75f59f"><div class="ttname"><a href="namespacegtl.html#abce27d097bc5680207b294bdad75f59f">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#l00176">map_util.h:176</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_a866a68af5afd0355fb348f7a59eeff9e"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#a866a68af5afd0355fb348f7a59eeff9e">operations_research::glop::RevisedSimplex::Solve</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT Status Solve(const LinearProgram &lp, TimeLimit *time_limit)</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00135">revised_simplex.cc:135</a></div></div>
|
|
<div class="ttc" id="astrongly__connected__components_8h_html"><div class="ttname"><a href="strongly__connected__components_8h.html">strongly_connected_components.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::glop::LinearProgram::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00133">lp_data.cc:133</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">operations_research::sat::LinearConstraintManager</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint__manager_8h_source.html#l00041">linear_constraint_manager.h:41</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00886">base/logging.h:886</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_a29fb0dd9484d890b12b280c41c150e20"><div class="ttname"><a href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a></div><div class="ttdeci">int64 demand</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00123">resource.cc:123</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_a8fbc9efd86a3cc862a9079d86ab8b524"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a8fbc9efd86a3cc862a9079d86ab8b524">operations_research::glop::RowToColIndex</a></div><div class="ttdeci">ColIndex RowToColIndex(RowIndex row)</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00048">lp_types.h:48</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html_a7f536a3b33f9bed8f75734e035d30725"><div class="ttname"><a href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a></div><div class="ttdeci">const bool DEBUG_MODE</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00024">macros.h:24</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_af730895c6c6ef6e03caaf6251192dfd2"><div class="ttname"><a href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a></div><div class="ttdeci">int64 a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00042">constraint_solver/table.cc:42</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_ac0a2e8c6619af74b42472bfa9a9e6465"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">operations_research::sat::IntegerTrail::UpperBoundAsLiteral</a></div><div class="ttdeci">IntegerLiteral UpperBoundAsLiteral(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01328">integer.h:1328</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_rev_repository_html_a176d2c659864433ccd869b5fba8d57af"><div class="ttname"><a href="classoperations__research_1_1_rev_repository.html#a176d2c659864433ccd869b5fba8d57af">operations_research::RevRepository::SetLevel</a></div><div class="ttdeci">void SetLevel(int level) final</div><div class="ttdef"><b>Definition:</b> <a href="rev_8h_source.html#l00134">rev.h:134</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_linear_constraint_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html">operations_research::sat::LinearConstraint</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8h_source.html#l00040">linear_constraint.h:40</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_a0e35521f3d40e263173626ecc8c21b06"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#a0e35521f3d40e263173626ecc8c21b06">operations_research::glop::RevisedSimplex::GetDualRayRowCombination</a></div><div class="ttdeci">const DenseRow & GetDualRayRowCombination() const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00497">revised_simplex.cc:497</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1e30e51173c7e43a8c0b4668d5e3f050"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">operations_research::sat::IntTypeAbs</a></div><div class="ttdeci">IntType IntTypeAbs(IntType t)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00077">integer.h:77</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1glop_1_1_basis_state_html"><div class="ttname"><a href="structoperations__research_1_1glop_1_1_basis_state.html">operations_research::glop::BasisState</a></div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8h_source.html#l00132">revised_simplex.h:132</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_aeeee0971281f2781c379fce7a64a5049"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#aeeee0971281f2781c379fce7a64a5049">operations_research::glop::LinearProgram::GetSparseColumn</a></div><div class="ttdeci">const SparseColumn & GetSparseColumn(ColIndex col) const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00408">lp_data.cc:408</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_adc5598223a363c10d95c00395145bcc6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adc5598223a363c10d95c00395145bcc6">operations_research::sat::GenericLiteralWatcher::SetPropagatorPriority</a></div><div class="ttdeci">void SetPropagatorPriority(int id, int priority)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01962">integer.cc:1962</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_a0fe7ba825c8c6cd1efdcff6dec631093"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a0fe7ba825c8c6cd1efdcff6dec631093">operations_research::glop::LinearProgram::SetVariableBounds</a></div><div class="ttdeci">void SetVariableBounds(ColIndex col, Fractional lower_bound, Fractional upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00248">lp_data.cc:248</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#l01297">integer.h:1297</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#l00989">integer.cc:989</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_aa4dc78f942e63df8b0bf3b95c7af7068"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#aa4dc78f942e63df8b0bf3b95c7af7068">operations_research::glop::RevisedSimplex::ClearIntegralityScales</a></div><div class="ttdeci">void ClearIntegralityScales()</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8h_source.html#l00250">revised_simplex.h:250</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a99264812cf177270e521f226a5c012c3"><div class="ttname"><a href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">operations_research::CapAdd</a></div><div class="ttdeci">int64 CapAdd(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00124">saturated_arithmetic.h:124</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aea18a909121c1c2ba4a818298611f0b2"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aea18a909121c1c2ba4a818298611f0b2">operations_research::sat::ComputeActivity</a></div><div class="ttdeci">double ComputeActivity(const LinearConstraint &constraint, const absl::StrongVector< IntegerVariable, double > &values)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8cc_source.html#l00122">linear_constraint.cc:122</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_ac0064327c37c56b93e86a91a1d64fd96"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#ac0064327c37c56b93e86a91a1d64fd96">operations_research::glop::RevisedSimplex::GetConstraintStatus</a></div><div class="ttdeci">ConstraintStatus GetConstraintStatus(RowIndex row) const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00475">revised_simplex.cc:475</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_adfbae19f81ecf38f67643dc8b7dcec25"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#adfbae19f81ecf38f67643dc8b7dcec25">operations_research::glop::RevisedSimplex::GetState</a></div><div class="ttdeci">const BasisState & GetState() const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00467">revised_simplex.cc:467</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a84ae5ff883fcce91f758a729af446864"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a84ae5ff883fcce91f758a729af446864">operations_research::sat::LinearConstraintManager::LpConstraints</a></div><div class="ttdeci">const std::vector< ConstraintIndex > & LpConstraints() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint__manager_8h_source.html#l00118">linear_constraint_manager.h:118</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_constraint_html_abd4d63996bf53e4b9251cc9fac30040d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#abd4d63996bf53e4b9251cc9fac30040d">operations_research::sat::LinearProgrammingConstraint::SetLevel</a></div><div class="ttdeci">void SetLevel(int level) override</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00559">linear_programming_constraint.cc:559</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="aclassoperations__research_1_1sat_1_1_implied_bounds_processor_html_a135d2e8757ef674942be0b1d6f46f75b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#a135d2e8757ef674942be0b1d6f46f75b">operations_research::sat::ImpliedBoundsProcessor::ProcessUpperBoundedConstraintWithSlackCreation</a></div><div class="ttdeci">void ProcessUpperBoundedConstraintWithSlackCreation(bool substitute_only_inner_variables, IntegerVariable first_slack, const absl::StrongVector< IntegerVariable, double > &lp_values, LinearConstraint *cut, std::vector< SlackInfo > *slack_infos)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l01584">cuts.cc:1584</a></div></div>
|
|
<div class="ttc" id="amathutil_8h_html"><div class="ttname"><a href="mathutil_8h.html">mathutil.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_lp_scaling_helper_html_a7bda8ecfedb49d8fe3fa3868b49b1588"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a7bda8ecfedb49d8fe3fa3868b49b1588">operations_research::glop::LpScalingHelper::UnscaleReducedCost</a></div><div class="ttdeci">Fractional UnscaleReducedCost(ColIndex col, Fractional value) const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data__utils_8cc_source.html#l00103">lp_data_utils.cc:103</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00697">base/logging.h:697</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a40e3f0f21a2c16b673c84f734ba6d095"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a40e3f0f21a2c16b673c84f734ba6d095">operations_research::sat::LinearConstraintManager::Add</a></div><div class="ttdeci">ConstraintIndex Add(LinearConstraint ct, bool *added=nullptr)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint__manager_8cc_source.html#l00125">linear_constraint_manager.cc:125</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_linear_constraint_html_a0ee34e5c6fbf075def1a6c2f0c42d040"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#a0ee34e5c6fbf075def1a6c2f0c42d040">operations_research::sat::LinearConstraint::lb</a></div><div class="ttdeci">IntegerValue lb</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8h_source.html#l00041">linear_constraint.h:41</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_implied_bounds_processor_html_a6a4d553c8850c30428f1750d37d33d26"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#a6a4d553c8850c30428f1750d37d33d26">operations_research::sat::ImpliedBoundsProcessor::IbCutPool</a></div><div class="ttdeci">TopNCuts & IbCutPool()</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00125">cuts.h:125</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_incremental_average_html_a198870bbc0f9b8d197a4c80f766ddf49"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_incremental_average.html#a198870bbc0f9b8d197a4c80f766ddf49">operations_research::sat::IncrementalAverage::AddData</a></div><div class="ttdeci">void AddData(double new_record)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00068">sat/util.cc:68</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_ad59b85e44037bd502a5d8bd3fe16c0f9ae4ac03f6c9f00665644e868dd1fb9f1e"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9ae4ac03f6c9f00665644e868dd1fb9f1e">operations_research::glop::ConstraintStatus::BASIC</a></div><div class="ttdeci">@ BASIC</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_ae517412fa6f592ccb7c8e0f1569ba983"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ae517412fa6f592ccb7c8e0f1569ba983">operations_research::sat::IntegerTrail::RegisterReversibleClass</a></div><div class="ttdeci">void RegisterReversibleClass(ReversibleInterface *rev)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00826">integer.h:826</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_1glop_1_1_revised_simplex_html_a3269053b931945d67fbd50f3bd95f37f"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#a3269053b931945d67fbd50f3bd95f37f">operations_research::glop::RevisedSimplex::GetNumberOfIterations</a></div><div class="ttdeci">int64 GetNumberOfIterations() const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00441">revised_simplex.cc:441</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695"><div class="ttname"><a href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a></div><div class="ttdeci">const Constraint * ct</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00042">demon_profiler.cc:42</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a36295bfe464bcdb6465fe796a43d02bf"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a36295bfe464bcdb6465fe796a43d02bf">operations_research::sat::LinearConstraintManager::SetObjectiveCoefficient</a></div><div class="ttdeci">void SetObjectiveCoefficient(IntegerVariable var, IntegerValue coeff)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint__manager_8cc_source.html#l00302">linear_constraint_manager.cc:302</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_a2d695f450ae446d5d9c225b991f8d88e"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a2d695f450ae446d5d9c225b991f8d88e">operations_research::glop::LinearProgram::SetCoefficient</a></div><div class="ttdeci">void SetCoefficient(RowIndex row, ColIndex col, Fractional value)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00316">lp_data.cc:316</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a615d87982145007855f2102262cf773c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">operations_research::sat::IntegerTrail::LowerBoundAsLiteral</a></div><div class="ttdeci">IntegerLiteral LowerBoundAsLiteral(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01323">integer.h:1323</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a0c9e8fab437ba44c91b0493a74cde263"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0c9e8fab437ba44c91b0493a74cde263">operations_research::sat::AddProductTo</a></div><div class="ttdeci">bool AddProductTo(IntegerValue a, IntegerValue b, IntegerValue *result)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00110">integer.h:110</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_integer_literal_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html">operations_research::sat::IntegerLiteral</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00153">integer.h:153</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_constraint_collection_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint_collection.html">operations_research::sat::LinearProgrammingConstraintCollection</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00533">linear_programming_constraint.h:534</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_afa85e3bd0c3e1bd18b4faf1dd36d550a"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#afa85e3bd0c3e1bd18b4faf1dd36d550a">operations_research::glop::RevisedSimplex::GetUnitRowLeftInverse</a></div><div class="ttdeci">const ScatteredRow & GetUnitRowLeftInverse(RowIndex row)</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8h_source.html#l00223">revised_simplex.h:223</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scattered_integer_vector_html_aeb3044e58e1e28e857c5265734ae7e30"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#aeb3044e58e1e28e857c5265734ae7e30">operations_research::sat::ScatteredIntegerVector::AddLinearExpressionMultiple</a></div><div class="ttdeci">bool AddLinearExpressionMultiple(IntegerValue multiplier, const std::vector< std::pair< glop::ColIndex, IntegerValue >> &terms)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00081">linear_programming_constraint.cc:81</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_linear_programming_constraint_lp_solution_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_programming_constraint_lp_solution.html">operations_research::sat::LinearProgrammingConstraintLpSolution</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00051">linear_programming_constraint.h:52</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_ab2c396c33db5bd5eab32d398c3d55646"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ab2c396c33db5bd5eab32d398c3d55646">operations_research::sat::GenericLiteralWatcher::WatchIntegerVariable</a></div><div class="ttdeci">void WatchIntegerVariable(IntegerVariable i, int id, int watch_index=-1)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01390">integer.h:1390</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_implied_bounds_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds.html">operations_research::sat::ImpliedBounds</a></div><div class="ttdef"><b>Definition:</b> <a href="implied__bounds_8h_source.html#l00077">implied_bounds.h:77</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_adf55bb4fcaab95674f072cb528d426a0"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#adf55bb4fcaab95674f072cb528d426a0">operations_research::glop::LinearProgram::objective_scaling_factor</a></div><div class="ttdeci">Fractional objective_scaling_factor() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8h_source.html#l00260">lp_data.h:260</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_aa4c5e551e5a00ff4ae97d8467184221b"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#aa4c5e551e5a00ff4ae97d8467184221b">operations_research::glop::RevisedSimplex::GetDualValue</a></div><div class="ttdeci">Fractional GetDualValue(RowIndex row) const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00459">revised_simplex.cc:459</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#l00884">base/logging.h:884</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_a4802169fde637478bebd1b420eec8ff8"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#a4802169fde637478bebd1b420eec8ff8">operations_research::glop::RevisedSimplex::GetVariableStatus</a></div><div class="ttdeci">VariableStatus GetVariableStatus(ColIndex col) const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00463">revised_simplex.cc:463</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_zero_half_cut_helper_html_a329f7f126c4f5e81cae82065d7fb96d0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#a329f7f126c4f5e81cae82065d7fb96d0">operations_research::sat::ZeroHalfCutHelper::ProcessVariables</a></div><div class="ttdeci">void ProcessVariables(const std::vector< double > &lp_values, const std::vector< IntegerValue > &lower_bounds, const std::vector< IntegerValue > &upper_bounds)</div><div class="ttdef"><b>Definition:</b> <a href="zero__half__cuts_8cc_source.html#l00028">zero_half_cuts.cc:28</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#l01263">integer.h:1263</a></div></div>
|
|
<div class="ttc" id="aimplied__bounds_8h_html"><div class="ttname"><a href="implied__bounds_8h.html">implied_bounds.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_ae7202d055b6b172a8a1da4f5b136f9ea"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#ae7202d055b6b172a8a1da4f5b136f9ea">operations_research::glop::RevisedSimplex::SetParameters</a></div><div class="ttdeci">void SetParameters(const GlopParameters &parameters)</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l03070">revised_simplex.cc:3070</a></div></div>
|
|
<div class="ttc" id="azero__half__cuts_8h_html"><div class="ttname"><a href="zero__half__cuts_8h.html">zero_half_cuts.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_aa637d435b14a562f8203eb808add5399"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#aa637d435b14a562f8203eb808add5399">operations_research::glop::RevisedSimplex::NotifyThatMatrixIsUnchangedForNextSolve</a></div><div class="ttdeci">void NotifyThatMatrixIsUnchangedForNextSolve()</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00131">revised_simplex.cc:131</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a8ef12397d1682615bc3108c397734179"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a8ef12397d1682615bc3108c397734179">operations_research::sat::IntegerTrail::Index</a></div><div class="ttdeci">int Index() const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00830">integer.h:830</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#l00269">gurobi_interface.cc:269</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_ac8bb3912a3ce86b15842e79d0b421204"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#ac8bb3912a3ce86b15842e79d0b421204">absl::StrongVector::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00170">strong_vector.h:170</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_ad63c4461a1384629cb99413c6df8b9ca"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">operations_research::sat::Trail::CurrentDecisionLevel</a></div><div class="ttdeci">int CurrentDecisionLevel() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00355">sat_base.h:355</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_a2a29cc40908e09b0c565ceea15b77d89"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a2a29cc40908e09b0c565ceea15b77d89">operations_research::glop::LinearProgram::SetObjectiveOffset</a></div><div class="ttdeci">void SetObjectiveOffset(Fractional objective_offset)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00330">lp_data.cc:330</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_adfce09ac65fc660f8a4f019f4072c6a7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#adfce09ac65fc660f8a4f019f4072c6a7">operations_research::sat::IntegerTrail::RemoveLevelZeroBounds</a></div><div class="ttdeci">void RemoveLevelZeroBounds(std::vector< IntegerLiteral > *reason) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00919">integer.cc:919</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_constraint_html_aefa083730af18963c9bfd9915b5cd187"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#aefa083730af18963c9bfd9915b5cd187">operations_research::sat::LinearProgrammingConstraint::AddCutGenerator</a></div><div class="ttdeci">void AddCutGenerator(CutGenerator generator)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00582">linear_programming_constraint.cc:582</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_lp_scaling_helper_html_a60d41c66b603be0ec7517d437e5c63ec"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a60d41c66b603be0ec7517d437e5c63ec">operations_research::glop::LpScalingHelper::UnscaleVariableValue</a></div><div class="ttdeci">Fractional UnscaleVariableValue(ColIndex col, Fractional value) const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data__utils_8cc_source.html#l00097">lp_data_utils.cc:97</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_lp_scaling_helper_html_a5eb3e38eae8f5143d627e8c85aff8cd7"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a5eb3e38eae8f5143d627e8c85aff8cd7">operations_research::glop::LpScalingHelper::VariableScalingFactor</a></div><div class="ttdeci">Fractional VariableScalingFactor(ColIndex col) const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data__utils_8cc_source.html#l00091">lp_data_utils.cc:91</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_adcc58612f6a1dc35ff3ffdb34188f299"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#adcc58612f6a1dc35ff3ffdb34188f299">operations_research::glop::LinearProgram::GetDimensionString</a></div><div class="ttdeci">std::string GetDimensionString() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00424">lp_data.cc:424</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aed77a1a7675c2f8568529a5a16247ec1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">operations_research::sat::ToDouble</a></div><div class="ttdeci">double ToDouble(IntegerValue value)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00069">integer.h:69</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_implied_bounds_processor_html_a07e1de12d9a4b00c96911544e72b86d4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#a07e1de12d9a4b00c96911544e72b86d4">operations_research::sat::ImpliedBoundsProcessor::AddLpVariable</a></div><div class="ttdeci">void AddLpVariable(IntegerVariable var)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00108">cuts.h:108</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector</a></div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00076">strong_vector.h:76</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_ae8a885303349cb7807c7c87b405bc0c9af00c8dbdd6e1f11bdae06be94277d293"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9af00c8dbdd6e1f11bdae06be94277d293">operations_research::glop::ProblemStatus::OPTIMAL</a></div><div class="ttdeci">@ OPTIMAL</div></div>
|
|
<div class="ttc" id="amarkowitz_8cc_html_aa9d6c98fdf8d89b0e2321fda02adc82c"><div class="ttname"><a href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a></div><div class="ttdeci">ColIndex col</div><div class="ttdef"><b>Definition:</b> <a href="markowitz_8cc_source.html#l00176">markowitz.cc:176</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a6d55b5b9adc499095dd57dd0c2b6c7df"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a6d55b5b9adc499095dd57dd0c2b6c7df">operations_research::sat::IntegerTrail::ReportConflict</a></div><div class="ttdeci">bool ReportConflict(absl::Span< const Literal > literal_reason, absl::Span< const IntegerLiteral > integer_reason)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00803">integer.h:803</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_sparse_vector_html_af69d9b7065a8f31604a8134be4307749"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_sparse_vector.html#af69d9b7065a8f31604a8134be4307749">operations_research::glop::SparseVector::num_entries</a></div><div class="ttdeci">EntryIndex num_entries() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__vector_8h_source.html#l00270">sparse_vector.h:270</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a355a62f25cfadeccfb164ab9fb867c81"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">operations_research::sat::kMinIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMinIntegerValue(-kMaxIntegerValue)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_ae8a885303349cb7807c7c87b405bc0c9"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9">operations_research::glop::ProblemStatus</a></div><div class="ttdeci">ProblemStatus</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00101">lp_types.h:101</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_cut_generator_html_af7117deb3f57ff3ecceddc6e9bb2c561"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_cut_generator.html#af7117deb3f57ff3ecceddc6e9bb2c561">operations_research::sat::CutGenerator::generate_cuts</a></div><div class="ttdeci">std::function< void(const absl::StrongVector< IntegerVariable, double > &lp_values, LinearConstraintManager *manager)> generate_cuts</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00046">cuts.h:46</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="aclassoperations__research_1_1sat_1_1_top_n_cuts_html_afb0f85e921e0f240d59d2a739e6b5712"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_top_n_cuts.html#afb0f85e921e0f240d59d2a739e6b5712">operations_research::sat::TopNCuts::TransferToManager</a></div><div class="ttdeci">void TransferToManager(const absl::StrongVector< IntegerVariable, double > &lp_solution, LinearConstraintManager *manager)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint__manager_8cc_source.html#l00722">linear_constraint_manager.cc:722</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_constraint_html_a6ae27451c3238e2af96991a030b7556c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a6ae27451c3238e2af96991a030b7556c">operations_research::sat::LinearProgrammingConstraint::HeuristicLpReducedCostAverageBranching</a></div><div class="ttdeci">std::function< IntegerLiteral()> HeuristicLpReducedCostAverageBranching()</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l02749">linear_programming_constraint.cc:2749</a></div></div>
|
|
<div class="ttc" id="amarkowitz_8cc_html_aea35f36ba98d5bbd8d033382f50c9e52"><div class="ttname"><a href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a></div><div class="ttdeci">RowIndex row</div><div class="ttdef"><b>Definition:</b> <a href="markowitz_8cc_source.html#l00175">markowitz.cc:175</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_ae5fa9e57c2d31b294195ed8a9e17bfac"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#ae5fa9e57c2d31b294195ed8a9e17bfac">operations_research::glop::DenseColumn</a></div><div class="ttdeci">StrictITIVector< RowIndex, Fractional > DenseColumn</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00328">lp_types.h:328</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_ab5af7f232cddcd91f70be84c0d398ba9"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#ab5af7f232cddcd91f70be84c0d398ba9">operations_research::glop::LinearProgram::SetObjectiveCoefficient</a></div><div class="ttdeci">void SetObjectiveCoefficient(ColIndex col, Fractional value)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00325">lp_data.cc:325</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_aa981297d0a648cd5c3fef40e2edebf8a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#aa981297d0a648cd5c3fef40e2edebf8a">operations_research::sat::IntegerTrail::RelaxLinearReason</a></div><div class="ttdeci">void RelaxLinearReason(IntegerValue slack, absl::Span< const IntegerValue > coeffs, std::vector< IntegerLiteral > *reason) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00785">integer.cc:785</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_constraint_html_a874f2f502681d547a666278de20564e3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a874f2f502681d547a666278de20564e3">operations_research::sat::LinearProgrammingConstraint::HeuristicLpReducedCostBinary</a></div><div class="ttdeci">std::function< IntegerLiteral()> HeuristicLpReducedCostBinary(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l02594">linear_programming_constraint.cc:2594</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_af71e6c1eccbc12e9339c00a86a981a43"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#af71e6c1eccbc12e9339c00a86a981a43">absl::StrongVector::back</a></div><div class="ttdeci">reference back()</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00174">strong_vector.h:174</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_ad59b85e44037bd502a5d8bd3fe16c0f9a74c506bd3d744fb5c2862229c8f2b6ce"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#ad59b85e44037bd502a5d8bd3fe16c0f9a74c506bd3d744fb5c2862229c8f2b6ce">operations_research::glop::ConstraintStatus::AT_LOWER_BOUND</a></div><div class="ttdeci">@ AT_LOWER_BOUND</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_ace96e115f468d752a2fcfeea901b0f8a"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#ace96e115f468d752a2fcfeea901b0f8a">operations_research::glop::RevisedSimplex::ClearStateForNextSolve</a></div><div class="ttdeci">void ClearStateForNextSolve()</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00120">revised_simplex.cc:120</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_constraint_html_ae384be06329c4c8f8fd62af7335dae2e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#ae384be06329c4c8f8fd62af7335dae2e">operations_research::sat::LinearProgrammingConstraint::SetObjectiveCoefficient</a></div><div class="ttdeci">void SetObjectiveCoefficient(IntegerVariable ivar, IntegerValue coeff)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00231">linear_programming_constraint.cc:231</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_implied_bounds_processor_html_a011f5f336c989d356c5f06a5793473c1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#a011f5f336c989d356c5f06a5793473c1">operations_research::sat::ImpliedBoundsProcessor::ClearCache</a></div><div class="ttdeci">void ClearCache() const</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00112">cuts.h:112</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_random_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model_random_generator.html">operations_research::sat::ModelRandomGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8h_source.html#l00039">sat/util.h:39</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_constraint_html_a8172ae7d172bec9d3a417ddcaab7c474"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a8172ae7d172bec9d3a417ddcaab7c474">operations_research::sat::LinearProgrammingConstraint::LinearProgrammingConstraint</a></div><div class="ttdeci">LinearProgrammingConstraint(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00156">linear_programming_constraint.cc:156</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_rounding_cut_helper_html_a66c8e6dc26260b69dcdf7668925dc3aa"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_rounding_cut_helper.html#a66c8e6dc26260b69dcdf7668925dc3aa">operations_research::sat::IntegerRoundingCutHelper::ComputeCut</a></div><div class="ttdeci">void ComputeCut(RoundingOptions options, const std::vector< double > &lp_values, const std::vector< IntegerValue > &lower_bounds, const std::vector< IntegerValue > &upper_bounds, ImpliedBoundsProcessor *ib_processor, LinearConstraint *cut)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l00707">cuts.cc:707</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_constraint_html_aaac2d8dee4d7fc8d5e9a1b1cfc3021bc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#aaac2d8dee4d7fc8d5e9a1b1cfc3021bc">operations_research::sat::LinearProgrammingConstraint::AddLinearConstraint</a></div><div class="ttdeci">void AddLinearConstraint(const LinearConstraint &ct)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00193">linear_programming_constraint.cc:193</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_implied_bounds_processor_html_ab1b4642341faf5ff972b02f034d88f21"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_implied_bounds_processor.html#ab1b4642341faf5ff972b02f034d88f21">operations_research::sat::ImpliedBoundsProcessor::DebugSlack</a></div><div class="ttdeci">bool DebugSlack(IntegerVariable first_slack, const LinearConstraint &initial_cut, const LinearConstraint &cut, const std::vector< SlackInfo > &info)</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8cc_source.html#l01725">cuts.cc:1725</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_cut_generator_html_a73e4094f2d4e2adbe5e8d79a5b61fcd1"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_cut_generator.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1">operations_research::sat::CutGenerator::vars</a></div><div class="ttdeci">std::vector< IntegerVariable > vars</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00042">cuts.h:42</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a71a79a003419f05324e7951f69265701"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a71a79a003419f05324e7951f69265701">operations_research::sat::LinearConstraintManager::AllConstraints</a></div><div class="ttdeci">const absl::StrongVector< ConstraintIndex, ConstraintInfo > & AllConstraints() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint__manager_8h_source.html#l00111">linear_constraint_manager.h:111</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a523501d854b2ca8034d37c15e7c89117"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">operations_research::sat::IntegerTrail::IsFixed</a></div><div class="ttdeci">bool IsFixed(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01301">integer.h:1301</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a344010e26426d6a13411648d988bc9b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a></div><div class="ttdeci">int64 b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00043">constraint_solver/table.cc:43</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_a4e3670a285a3642eaa07f66766cffa72"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">absl::StrongVector::resize</a></div><div class="ttdeci">void resize(size_type new_size)</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00150">strong_vector.h:150</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_a2f8078e3c74ab15964ea42801732313a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a2f8078e3c74ab15964ea42801732313a">operations_research::sat::GenericLiteralWatcher::AlwaysCallAtLevelZero</a></div><div class="ttdeci">void AlwaysCallAtLevelZero(int id)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01974">integer.cc:1974</a></div></div>
|
|
<div class="ttc" id="astrong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_ace91e968c3b7369698c7563ca1c9c6e8"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#ace91e968c3b7369698c7563ca1c9c6e8">operations_research::glop::RevisedSimplex::GetProblemNumRows</a></div><div class="ttdeci">RowIndex GetProblemNumRows() const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00443">revised_simplex.cc:443</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_dispatcher_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_dispatcher.html">operations_research::sat::LinearProgrammingDispatcher</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00525">linear_programming_constraint.h:527</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a2a367e1c70abb013c50b1a7d1cf00bb3"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a2a367e1c70abb013c50b1a7d1cf00bb3">operations_research::sat::SeparateSubtourInequalities</a></div><div class="ttdeci">void SeparateSubtourInequalities(int num_nodes, const std::vector< int > &tails, const std::vector< int > &heads, const std::vector< Literal > &literals, const absl::StrongVector< IntegerVariable, double > &lp_values, absl::Span< const int64 > demands, int64 capacity, LinearConstraintManager *manager, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l02271">linear_programming_constraint.cc:2271</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_adf3be22c64f10c0783c0cf277e857adf"><div class="ttname"><a href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a></div><div class="ttdeci">int64 capacity</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00129">routing_flow.cc:129</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scattered_integer_vector_html_a4940f758f3c0e757a4bcb5bbf795ce67"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#a4940f758f3c0e757a4bcb5bbf795ce67">operations_research::sat::ScatteredIntegerVector::Add</a></div><div class="ttdeci">bool Add(glop::ColIndex col, IntegerValue value)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00070">linear_programming_constraint.cc:70</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_8cc_html_a395f613555f398dd389670bb4c2a4599"><div class="ttname"><a href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a></div><div class="ttdeci">Block * next</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l00674">constraint_solver.cc:674</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#l01293">integer.h:1293</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_cover_cut_helper_html_ac3816c1571dfd130851ed09c79224360"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cover_cut_helper.html#ac3816c1571dfd130851ed09c79224360">operations_research::sat::CoverCutHelper::Info</a></div><div class="ttdeci">const std::string Info()</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00255">cuts.h:255</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a83551f805175c3a30ea146efaad2ec63"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a83551f805175c3a30ea146efaad2ec63">operations_research::sat::CreateCVRPCutGenerator</a></div><div class="ttdeci">CutGenerator CreateCVRPCutGenerator(int num_nodes, const std::vector< int > &tails, const std::vector< int > &heads, const std::vector< Literal > &literals, const std::vector< int64 > &demands, int64 capacity, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l02528">linear_programming_constraint.cc:2528</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_acb294633c7688f918623b3b0e09aec43"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#acb294633c7688f918623b3b0e09aec43">operations_research::sat::ComputeInfinityNorm</a></div><div class="ttdeci">IntegerValue ComputeInfinityNorm(const LinearConstraint &constraint)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8cc_source.html#l00142">linear_constraint.cc:142</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_a201108c6e8d9fb5104697bdd0a8bd085"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#a201108c6e8d9fb5104697bdd0a8bd085">operations_research::glop::RevisedSimplex::GetVariableValue</a></div><div class="ttdeci">Fractional GetVariableValue(ColIndex col) const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00447">revised_simplex.cc:447</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab25e01a2942b821d66371fc68d53f2eb"><div class="ttname"><a href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a></div><div class="ttdeci">#define CHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00698">base/logging.h:698</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_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#l00618">integer.h:618</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_a66da73868da92948f57a83e261066ca6"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#a66da73868da92948f57a83e261066ca6">operations_research::glop::RevisedSimplex::GetDualRay</a></div><div class="ttdeci">const DenseColumn & GetDualRay() const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00492">revised_simplex.cc:492</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_linear_constraint_html_a4053d5aed2a34995e0aeb2042878ca7a"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#a4053d5aed2a34995e0aeb2042878ca7a">operations_research::sat::LinearConstraint::coeffs</a></div><div class="ttdeci">std::vector< IntegerValue > coeffs</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8h_source.html#l00044">linear_constraint.h:44</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_rounding_cut_helper_html_a4f879f884fd170f77c9024aee023feb2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_rounding_cut_helper.html#a4f879f884fd170f77c9024aee023feb2">operations_research::sat::IntegerRoundingCutHelper::NumLiftedBooleans</a></div><div class="ttdeci">int NumLiftedBooleans() const</div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00221">cuts.h:221</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_zero_half_cut_helper_html_afbba3b7980ea3f2da0bbb57e1a0df4d6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#afbba3b7980ea3f2da0bbb57e1a0df4d6">operations_research::sat::ZeroHalfCutHelper::AddOneConstraint</a></div><div class="ttdeci">void AddOneConstraint(glop::RowIndex, const std::vector< std::pair< glop::ColIndex, IntegerValue >> &terms, IntegerValue lb, IntegerValue ub)</div><div class="ttdef"><b>Definition:</b> <a href="zero__half__cuts_8cc_source.html#l00058">zero_half_cuts.cc:58</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_ae15a49e0cab69203efca232f0b32866d"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#ae15a49e0cab69203efca232f0b32866d">operations_research::glop::RevisedSimplex::GetBasis</a></div><div class="ttdeci">ColIndex GetBasis(RowIndex row) const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00502">revised_simplex.cc:502</a></div></div>
|
|
<div class="ttc" id="alp__types_8h_html"><div class="ttname"><a href="lp__types_8h.html">lp_types.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_constraint_html_abe80d18b1ff9d46681da4c752352e53c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#abe80d18b1ff9d46681da4c752352e53c">operations_research::sat::LinearProgrammingConstraint::HeuristicLpMostInfeasibleBinary</a></div><div class="ttdeci">std::function< IntegerLiteral()> HeuristicLpMostInfeasibleBinary(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l02548">linear_programming_constraint.cc:2548</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_ac891d9f514e55ec8ee1212757a147888"><div class="ttname"><a href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a></div><div class="ttdeci">int64 head</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00128">routing_flow.cc:128</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ae3c495e2e05950c578b01976701f9b2a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae3c495e2e05950c578b01976701f9b2a">operations_research::sat::DivideByGCD</a></div><div class="ttdeci">void DivideByGCD(LinearConstraint *constraint)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8cc_source.html#l00189">linear_constraint.cc:189</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_ac746d3665776d57cb5ecd46fbdda7de7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ac746d3665776d57cb5ecd46fbdda7de7">operations_research::sat::IntegerTrail::IsFixedAtLevelZero</a></div><div class="ttdeci">bool IsFixedAtLevelZero(IntegerVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01353">integer.h:1353</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_programming_constraint_html_a0010273383670a7c67b3b8f2660aa06b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a0010273383670a7c67b3b8f2660aa06b">operations_research::sat::LinearProgrammingConstraint::Propagate</a></div><div class="ttdeci">bool Propagate() override</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l01353">linear_programming_constraint.cc:1353</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_a26689abee13abb7fc0d0cf99c1c7809b"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#a26689abee13abb7fc0d0cf99c1c7809b">operations_research::glop::RevisedSimplex::GetReducedCosts</a></div><div class="ttdeci">const DenseRow & GetReducedCosts() const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00455">revised_simplex.cc:455</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#l00532">time_limit.h:532</a></div></div>
|
|
<div class="ttc" id="apreprocessor_8h_html"><div class="ttname"><a href="preprocessor_8h.html">preprocessor.h</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_linear_constraint_html_a6e2915dc7e5345d6959390b53f026c5f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html#a6e2915dc7e5345d6959390b53f026c5f">operations_research::sat::LinearConstraint::ub</a></div><div class="ttdeci">IntegerValue ub</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint_8h_source.html#l00042">linear_constraint.h:42</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_a52c80b8028f6d54f8b2c02da3aac7510"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#a52c80b8028f6d54f8b2c02da3aac7510">operations_research::glop::RevisedSimplex::GetReducedCost</a></div><div class="ttdeci">Fractional GetReducedCost(ColIndex col) const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00451">revised_simplex.cc:451</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_rev_repository_html_a32476d1fb09b1e06181ee07d30378b02"><div class="ttname"><a href="classoperations__research_1_1_rev_repository.html#a32476d1fb09b1e06181ee07d30378b02">operations_research::RevRepository::SaveState</a></div><div class="ttdeci">void SaveState(T *object)</div><div class="ttdef"><b>Definition:</b> <a href="rev_8h_source.html#l00061">rev.h:61</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a87cc96a3e72099107712a0386d89d851"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a87cc96a3e72099107712a0386d89d851">operations_research::sat::LinearConstraintManager::AddAllConstraintsToLp</a></div><div class="ttdeci">void AddAllConstraintsToLp()</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint__manager_8cc_source.html#l00683">linear_constraint_manager.cc:683</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a1afbe8d162a9cba17a520812ec6d3dd4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a1afbe8d162a9cba17a520812ec6d3dd4">operations_research::sat::LinearConstraintManager::DebugCheckConstraint</a></div><div class="ttdeci">bool DebugCheckConstraint(const LinearConstraint &cut)</div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint__manager_8cc_source.html#l00691">linear_constraint_manager.cc:691</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
|
|
<div class="ttc" id="acommandlineflags_8h_html"><div class="ttname"><a href="commandlineflags_8h.html">commandlineflags.h</a></div></div>
|
|
<div class="ttc" id="acp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a></div><div class="ttdeci">SatParameters parameters</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00108">cp_model_fz_solver.cc:108</a></div></div>
|
|
<div class="ttc" id="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#l00276">integer.h:276</a></div></div>
|
|
<div class="ttc" id="ainteger_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
|
|
<div class="ttc" id="adefault__search_8cc_html_ac673bc430bdc3fdaa09f7becf98ef267"><div class="ttname"><a href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a></div><div class="ttdeci">const std::string name</div><div class="ttdef"><b>Definition:</b> <a href="default__search_8cc_source.html#l00808">default_search.cc:808</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_ac9d426060b1b7eee72e9e5345379f111"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ac9d426060b1b7eee72e9e5345379f111">operations_research::sat::GenericLiteralWatcher::WatchUpperBound</a></div><div class="ttdeci">void WatchUpperBound(IntegerVariable var, int id, int watch_index=-1)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01384">integer.h:1384</a></div></div>
|
|
<div class="ttc" id="astatus_8h_html"><div class="ttname"><a href="status_8h.html">status.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html">operations_research::sat::Trail</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00233">sat_base.h:233</a></div></div>
|
|
<div class="ttc" id="aparameters_8pb_8h_html"><div class="ttname"><a href="parameters_8pb_8h.html">parameters.pb.h</a></div></div>
|
|
<div class="ttc" id="alinear__programming__constraint_8h_html"><div class="ttname"><a href="linear__programming__constraint_8h.html">linear_programming_constraint.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html_ac226833fbf53fdb3fb7b6ef9d89a0e4c"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#ac226833fbf53fdb3fb7b6ef9d89a0e4c">operations_research::glop::RevisedSimplex::GetProblemNumCols</a></div><div class="ttdeci">ColIndex GetProblemNumCols() const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00445">revised_simplex.cc:445</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a74ea76ea27f48fb1b6e148e1577b3719"><div class="ttname"><a href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a></div><div class="ttdeci">static const int64 kint64max</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00062">integral_types.h:62</a></div></div>
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="linear__programming__constraint_8cc.html">linear_programming_constraint.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.20 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|