264 lines
39 KiB
HTML
264 lines
39 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: zero_half_cuts.h Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">8.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('zero__half__cuts_8h_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">zero_half_cuts.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="zero__half__cuts_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#ifndef OR_TOOLS_SAT_ZERO_HALF_CUTS_H_</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#define OR_TOOLS_SAT_ZERO_HALF_CUTS_H_</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>  </div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>  </div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</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="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="sat_2util_8h.html">ortools/sat/util.h</a>"</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  </div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  </div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">// Heuristic to find a good sums of rows from the LP (with coeff -1, +1) that</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// can lead to a violated zero-half cut (i.e. after integer rounding with a</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// divisor 2).</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// For this, all that matter is the parity of the coefficients and the rhs in</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// the linear combination of the original problem constraint. So this class</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// maintain a copy of the LP matrix modulo 2 on which simplification and</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// heuristic are performed to find good cut candidates(s).</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// Most of what is done here is described in the paper "Algorithms to Separate</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// {0, 1/2}-Chvátal-Gomory Cuts", Arie M. C. A. Koster, Adrian Zymolka, Manuel</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// Kutschka.</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html"> 38</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html">ZeroHalfCutHelper</a> {</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="comment">// Public API: ProcessVariables() must be called first and then constraints</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">// can be added one by one. Finally GetZeroHalfInterestingCuts() will return a</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="comment">// set of good candidates.</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="comment">// TODO(user): This is a first implementation, both the heuristic and the</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// code performance can probably be improved uppon.</span></div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#a329f7f126c4f5e81cae82065d7fb96d0">ProcessVariables</a>(<span class="keyword">const</span> std::vector<double>& lp_values,</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keyword">const</span> std::vector<IntegerValue>& <a class="code" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>,</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">const</span> std::vector<IntegerValue>& <a class="code" href="sat_2lp__utils_8cc.html#a88215c8581662c40eec0fb8621c44af3">upper_bounds</a>);</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#afbba3b7980ea3f2da0bbb57e1a0df4d6">AddOneConstraint</a>(</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  glop::RowIndex,</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keyword">const</span> std::vector<std::pair<glop::ColIndex, IntegerValue>>& terms,</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  IntegerValue lb, IntegerValue ub);</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  std::vector<std::vector<std::pair<glop::RowIndex, IntegerValue>>></div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <a class="code" href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#af7012dee6abfab160a910241b61e1b1d">InterestingCandidates</a>(<a class="code" href="classoperations__research_1_1sat_1_1_model_random_generator.html">ModelRandomGenerator</a>* random);</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  </div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="comment">// Visible for testing.</span></div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#a2f1661e59c567817452d568cfd59e136">Reset</a>(<span class="keywordtype">int</span> size);</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  </div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="comment">// Visible for testing.</span></div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// Boolean matrix. Each column correspond to one variable (col indices).</span></div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">// Each row to a sum of the initial problem constraints. We store the</span></div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="comment">// coefficient modulo 2, so only the positions of the ones.</span></div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows.html"> 64</a></span>  <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows.html">CombinationOfRows</a> {</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// How this row was formed from the initial problem constraints.</span></div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows.html#a369301d86d45f16328f26624cdfcfcba"> 66</a></span>  std::vector<std::pair<glop::RowIndex, IntegerValue>> <a class="code" href="structoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows.html#a369301d86d45f16328f26624cdfcfcba">multipliers</a>;</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  </div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="comment">// The index of the odd coefficient of this combination.</span></div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows.html#a6bf955ff7eba178a0dd6b9b2b8aaea33"> 69</a></span>  std::vector<int> <a class="code" href="structoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows.html#a6bf955ff7eba178a0dd6b9b2b8aaea33">cols</a>;</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  </div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">// The parity of the rhs (1 for odd).</span></div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows.html#ad672b27c7276e0a1588afb57c18afa11"> 72</a></span>  <span class="keywordtype">int</span> <a class="code" href="structoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows.html#ad672b27c7276e0a1588afb57c18afa11">rhs_parity</a>;</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  </div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// How tight this constraints is under the current LP solution.</span></div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows.html#a62a9f2c91b6d4f5f872718e2dfecd061"> 75</a></span>  <span class="keywordtype">double</span> <a class="code" href="structoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows.html#a62a9f2c91b6d4f5f872718e2dfecd061">slack</a>;</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  };</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#a0cd2af6dbc5da51cd7cdd3b4219b66e7">AddBinaryRow</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows.html">CombinationOfRows</a>& binary_row);</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#a8b3ddfb95d9c7151141e2abd5d623b80"> 78</a></span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows.html">CombinationOfRows</a>& <a class="code" href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#a8b3ddfb95d9c7151141e2abd5d623b80">MatrixRow</a>(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> rows_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>]; }</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#aa9a070b122c3018630fd0567cc7a7383"> 79</a></span>  <span class="keyword">const</span> std::vector<int>& <a class="code" href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#aa9a070b122c3018630fd0567cc7a7383">MatrixCol</a>(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> col_to_rows_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>]; }</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  </div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="comment">// Visible for testing.</span></div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// Adds the given row to all other rows having an odd cofficient on the given</span></div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// column. This then eliminate the entry (col, row) that is now a singleton by</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">// incresing the slack of the given row.</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#a0878d4f013921f646b839964ad02919b">EliminateVarUsingRow</a>(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>, <span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>);</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  </div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// Visible for testing.</span></div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// Like std::set_symmetric_difference, but use a vector<bool> instead of sort.</span></div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// This assumes tmp_marked_ to be all false. We don't DCHECK it here for</span></div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">// speed, but it DCHECKed on each EliminateVarUsingRow() call. In addition,</span></div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// the result is filtered using the extra_condition function.</span></div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#a1cebbddb8d43bec60cbbae102bd6a6e5">SymmetricDifference</a>(std::function<<span class="keywordtype">bool</span>(<span class="keywordtype">int</span>)> extra_condition,</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">const</span> std::vector<int>& <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, std::vector<int>* <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>);</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  </div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordtype">void</span> ProcessSingletonColumns();</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  </div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// As we combine rows, when the activity of a combination get too far away</span></div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// from its bound, we just discard it. Note that the row will still be there</span></div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// but its index will not appear in the col-wise representation of the matrix.</span></div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> kSlackThreshold = 0.5;</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> kMaxAggregationSize = 100;</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="comment">// We don't consider long constraint or constraint with high magnitude, since</span></div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// the highest violation we can hope for is 1, and if the magnitude is large</span></div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// then the cut efficacity will not be great.</span></div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> kMaxInputConstraintSize = 100;</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> kMaxInputConstraintMagnitude = 1e6;</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  </div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">// Variable information.</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  std::vector<double> lp_values_;</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  std::vector<double> shifted_lp_values_;</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  std::vector<int> bound_parity_;</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  </div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// Binary matrix.</span></div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="comment">// Note that as we combine rows, we never move their indices. So after initial</span></div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// creation rows_ will always have the same size.</span></div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  std::vector<CombinationOfRows> rows_;</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  std::vector<std::vector<int>> col_to_rows_;</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  std::vector<int> singleton_cols_;</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  </div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="comment">// Temporary vector used by SymmetricDifference().</span></div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  std::vector<bool> tmp_marked_;</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> };</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  </div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  </div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="preprocessor">#endif // OR_TOOLS_SAT_ZERO_HALF_CUTS_H_</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="aclassoperations__research_1_1sat_1_1_zero_half_cut_helper_html_a0cd2af6dbc5da51cd7cdd3b4219b66e7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#a0cd2af6dbc5da51cd7cdd3b4219b66e7">operations_research::sat::ZeroHalfCutHelper::AddBinaryRow</a></div><div class="ttdeci">void AddBinaryRow(const CombinationOfRows &binary_row)</div><div class="ttdef"><b>Definition:</b> <a href="zero__half__cuts_8cc_source.html#l00049">zero_half_cuts.cc:49</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows_html_a62a9f2c91b6d4f5f872718e2dfecd061"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows.html#a62a9f2c91b6d4f5f872718e2dfecd061">operations_research::sat::ZeroHalfCutHelper::CombinationOfRows::slack</a></div><div class="ttdeci">double slack</div><div class="ttdef"><b>Definition:</b> <a href="zero__half__cuts_8h_source.html#l00075">zero_half_cuts.h:75</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="astructoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows_html_ad672b27c7276e0a1588afb57c18afa11"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows.html#ad672b27c7276e0a1588afb57c18afa11">operations_research::sat::ZeroHalfCutHelper::CombinationOfRows::rhs_parity</a></div><div class="ttdeci">int rhs_parity</div><div class="ttdef"><b>Definition:</b> <a href="zero__half__cuts_8h_source.html#l00072">zero_half_cuts.h:72</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_zero_half_cut_helper_html_a1cebbddb8d43bec60cbbae102bd6a6e5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#a1cebbddb8d43bec60cbbae102bd6a6e5">operations_research::sat::ZeroHalfCutHelper::SymmetricDifference</a></div><div class="ttdeci">void SymmetricDifference(std::function< bool(int)> extra_condition, const std::vector< int > &a, std::vector< int > *b)</div><div class="ttdef"><b>Definition:</b> <a href="zero__half__cuts_8cc_source.html#l00111">zero_half_cuts.cc:111</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_zero_half_cut_helper_html_aa9a070b122c3018630fd0567cc7a7383"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#aa9a070b122c3018630fd0567cc7a7383">operations_research::sat::ZeroHalfCutHelper::MatrixCol</a></div><div class="ttdeci">const std::vector< int > & MatrixCol(int col) const</div><div class="ttdef"><b>Definition:</b> <a href="zero__half__cuts_8h_source.html#l00079">zero_half_cuts.h:79</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows.html">operations_research::sat::ZeroHalfCutHelper::CombinationOfRows</a></div><div class="ttdef"><b>Definition:</b> <a href="zero__half__cuts_8h_source.html#l00064">zero_half_cuts.h:64</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="astructoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows_html_a6bf955ff7eba178a0dd6b9b2b8aaea33"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows.html#a6bf955ff7eba178a0dd6b9b2b8aaea33">operations_research::sat::ZeroHalfCutHelper::CombinationOfRows::cols</a></div><div class="ttdeci">std::vector< int > cols</div><div class="ttdef"><b>Definition:</b> <a href="zero__half__cuts_8h_source.html#l00069">zero_half_cuts.h:69</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_zero_half_cut_helper_html_a2f1661e59c567817452d568cfd59e136"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#a2f1661e59c567817452d568cfd59e136">operations_research::sat::ZeroHalfCutHelper::Reset</a></div><div class="ttdeci">void Reset(int size)</div><div class="ttdef"><b>Definition:</b> <a href="zero__half__cuts_8cc_source.html#l00019">zero_half_cuts.cc:19</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_zero_half_cut_helper_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html">operations_research::sat::ZeroHalfCutHelper</a></div><div class="ttdef"><b>Definition:</b> <a href="zero__half__cuts_8h_source.html#l00038">zero_half_cuts.h:38</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="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="asat_2util_8h_html"><div class="ttname"><a href="sat_2util_8h.html">util.h</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="asat_2lp__utils_8cc_html_a561d7bf12fc7674b3fe0ad2ba2e175a0"><div class="ttname"><a href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a></div><div class="ttdeci">std::vector< double > lower_bounds</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l00497">sat/lp_utils.cc:497</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_zero_half_cut_helper_html_a0878d4f013921f646b839964ad02919b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#a0878d4f013921f646b839964ad02919b">operations_research::sat::ZeroHalfCutHelper::EliminateVarUsingRow</a></div><div class="ttdeci">void EliminateVarUsingRow(int col, int row)</div><div class="ttdef"><b>Definition:</b> <a href="zero__half__cuts_8cc_source.html#l00159">zero_half_cuts.cc:159</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_zero_half_cut_helper_html_a8b3ddfb95d9c7151141e2abd5d623b80"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_zero_half_cut_helper.html#a8b3ddfb95d9c7151141e2abd5d623b80">operations_research::sat::ZeroHalfCutHelper::MatrixRow</a></div><div class="ttdeci">const CombinationOfRows & MatrixRow(int row) const</div><div class="ttdef"><b>Definition:</b> <a href="zero__half__cuts_8h_source.html#l00078">zero_half_cuts.h:78</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="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="alp__types_8h_html"><div class="ttname"><a href="lp__types_8h.html">lp_types.h</a></div></div>
|
|
<div class="ttc" id="asat_2lp__utils_8cc_html_a88215c8581662c40eec0fb8621c44af3"><div class="ttname"><a href="sat_2lp__utils_8cc.html#a88215c8581662c40eec0fb8621c44af3">upper_bounds</a></div><div class="ttdeci">std::vector< double > upper_bounds</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l00498">sat/lp_utils.cc:498</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows_html_a369301d86d45f16328f26624cdfcfcba"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_zero_half_cut_helper_1_1_combination_of_rows.html#a369301d86d45f16328f26624cdfcfcba">operations_research::sat::ZeroHalfCutHelper::CombinationOfRows::multipliers</a></div><div class="ttdeci">std::vector< std::pair< glop::RowIndex, IntegerValue > > multipliers</div><div class="ttdef"><b>Definition:</b> <a href="zero__half__cuts_8h_source.html#l00066">zero_half_cuts.h:66</a></div></div>
|
|
<div class="ttc" id="ainteger_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</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="zero__half__cuts_8h.html">zero_half_cuts.h</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.20 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|