1071 lines
181 KiB
HTML
1071 lines
181 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: cp_model_symmetries.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('cp__model__symmetries_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">cp_model_symmetries.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="cp__model__symmetries_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-2021 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="cp__model__symmetries_8h.html">ortools/sat/cp_model_symmetries.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 <cstdint></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  </div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "absl/memory/memory.h"</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "google/protobuf/repeated_field.h"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="find__graph__symmetries_8h.html">ortools/algorithms/find_graph_symmetries.h</a>"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="hash_8h.html">ortools/base/hash.h</a>"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</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="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="cp__model__utils_8h.html">ortools/sat/cp_model_utils.h</a>"</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="symmetry__util_8h.html">ortools/sat/symmetry_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  </div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  </div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">struct </span>VectorHash {</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  std::size_t operator()(<span class="keyword">const</span> std::vector<int64_t>& values)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keywordtype">size_t</span> <a class="code" href="matrix__utils_8cc.html#a95d4078c018ac04247ee3785eab30e7b">hash</a> = 0;</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> : values) {</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <a class="code" href="matrix__utils_8cc.html#a95d4078c018ac04247ee3785eab30e7b">hash</a> = <a class="code" href="namespaceutil__hash.html#a17715af1c1bc575a706eb167371b81e9">util_hash::Hash</a>(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>, <a class="code" href="matrix__utils_8cc.html#a95d4078c018ac04247ee3785eab30e7b">hash</a>);</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  }</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">return</span> <a class="code" href="matrix__utils_8cc.html#a95d4078c018ac04247ee3785eab30e7b">hash</a>;</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  }</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</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="comment">// A simple class to generate equivalence class number for</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// GenerateGraphForSymmetryDetection().</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="keyword">class </span>IdGenerator {</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  IdGenerator() {}</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  </div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">// If the color was never seen before, then generate a new id, otherwise</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">// return the previously generated id.</span></div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordtype">int</span> GetId(<span class="keyword">const</span> std::vector<int64_t>& color) {</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">return</span> <a class="code" href="namespacegtl.html#a7a0f8dc4187504b814d8a8be463b517c">gtl::LookupOrInsert</a>(&id_map_, color, id_map_.size());</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  }</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  </div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordtype">int</span> NextFreeId()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> id_map_.size(); }</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  </div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  absl::flat_hash_map<std::vector<int64_t>, int, VectorHash> id_map_;</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> };</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  </div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// Appends values in `repeated_field` to `vector`.</span></div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment">// We use a template as proto int64_t != C++ int64_t in open source.</span></div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="keyword">template</span> <<span class="keyword">typename</span> FieldInt64Type></div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="keywordtype">void</span> Append(</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keyword">const</span> google::protobuf::RepeatedField<FieldInt64Type>& repeated_field,</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  std::vector<int64_t>* vector) {</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(vector != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> FieldInt64Type <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> : repeated_field) {</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  vector->push_back(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  }</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> }</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">// Returns a graph whose automorphisms can be mapped back to the symmetries of</span></div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment">// the model described in the given CpModelProto.</span></div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// Any permutation of the graph that respects the initial_equivalence_classes</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment">// output can be mapped to a symmetry of the given problem simply by taking its</span></div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment">// restriction on the first num_variables nodes and interpreting its index as a</span></div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment">// variable index. In a sense, a node with a low enough index #i is in</span></div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment">// one-to-one correspondence with the variable #i (using the index</span></div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// representation of variables).</span></div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment">// The format of the initial_equivalence_classes is the same as the one</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment">// described in GraphSymmetryFinder::FindSymmetries(). The classes must be dense</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment">// in [0, num_classes) and any symmetry will only map nodes with the same class</span></div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment">// between each other.</span></div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> std::unique_ptr<Graph> <a class="code" href="namespaceoperations__research_1_1sat.html#a3f6fa74408ea28eb41f29e9696d9a9a2">GenerateGraphForSymmetryDetection</a>(</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">const</span> CpModelProto& problem, std::vector<int>* initial_equivalence_classes,</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  SolverLogger* logger) {</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(initial_equivalence_classes != <span class="keyword">nullptr</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>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_variables = problem.variables_size();</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">auto</span> graph = absl::make_unique<Graph>();</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="comment">// Each node will be created with a given color. Two nodes of different color</span></div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">// can never be send one into another by a symmetry. The first element of</span></div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// the color vector will always be the NodeType.</span></div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// TODO(user): Using a full int64_t for storing 3 values is not great. We</span></div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// can optimize this at the price of a bit more code.</span></div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">enum</span> NodeType {</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  VARIABLE_NODE,</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  VAR_COEFFICIENT_NODE,</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  CONSTRAINT_NODE,</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>  IdGenerator color_id_generator;</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  initial_equivalence_classes->clear();</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">auto</span> new_node = [&initial_equivalence_classes, &graph,</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  &color_id_generator](<span class="keyword">const</span> std::vector<int64_t>& color) {</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">// Since we add nodes one by one, initial_equivalence_classes->size() gives</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="comment">// the number of nodes at any point, which we use as the next node index.</span></div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> node = initial_equivalence_classes->size();</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  initial_equivalence_classes->push_back(color_id_generator.GetId(color));</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">// In some corner cases, we create a node but never uses it. We still</span></div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="comment">// want it to be there.</span></div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  graph->AddNode(node);</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">return</span> node;</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>  </div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="comment">// For two variables to be in the same equivalence class, they need to have</span></div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="comment">// the same objective coefficient, and the same possible bounds.</span></div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// TODO(user): We could ignore the objective coefficients, and just make sure</span></div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">// that when we break symmetry amongst variables, we choose the possibility</span></div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="comment">// with the smallest cost?</span></div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  std::vector<int64_t> objective_by_var(num_variables, 0);</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < problem.objective().vars_size(); ++i) {</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> ref = problem.objective().vars(i);</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(ref);</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">const</span> int64_t coeff = problem.objective().coeffs(i);</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  objective_by_var[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = <a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(ref) ? coeff : -coeff;</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  </div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="comment">// Create one node for each variable. Note that the code rely on the fact that</span></div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">// the index of a VARIABLE_NODE type is the same as the variable index.</span></div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  std::vector<int64_t> tmp_color;</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v = 0; v < num_variables; ++v) {</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  tmp_color = {VARIABLE_NODE, objective_by_var[v]};</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  Append(problem.variables(v).domain(), &tmp_color);</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(v, new_node(tmp_color));</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  </div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="comment">// We will lazily create "coefficient nodes" that correspond to a variable</span></div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// with a given coefficient.</span></div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  absl::flat_hash_map<std::pair<int64_t, int64_t>, <span class="keywordtype">int</span>> coefficient_nodes;</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keyword">auto</span> get_coefficient_node = [&new_node, &graph, &coefficient_nodes,</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  &tmp_color](<span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, int64_t coeff) {</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> var_node = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>;</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</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">// For a coefficient of one, which are the most common, we can optimize the</span></div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">// size of the graph by omitting the coefficient node altogether and using</span></div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">// directly the var_node in this case.</span></div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">if</span> (coeff == 1) <span class="keywordflow">return</span> var_node;</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  </div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keyword">const</span> <span class="keyword">auto</span> insert =</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  coefficient_nodes.insert({std::make_pair(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, coeff), 0});</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">if</span> (!insert.second) <span class="keywordflow">return</span> insert.first->second;</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  </div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  tmp_color = {VAR_COEFFICIENT_NODE, coeff};</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> secondary_node = new_node(tmp_color);</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  graph->AddArc(var_node, secondary_node);</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  insert.first->second = secondary_node;</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">return</span> secondary_node;</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  };</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  </div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// For a literal we use the same as a coefficient 1 or -1. We can do that</span></div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="comment">// because literal and (var, coefficient) never appear together in the same</span></div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// constraint.</span></div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keyword">auto</span> get_literal_node = [&get_coefficient_node](<span class="keywordtype">int</span> ref) {</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">return</span> get_coefficient_node(<a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(ref), <a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(ref) ? 1 : -1);</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  };</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  </div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="comment">// Because the implications can be numerous, we encode them without</span></div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="comment">// constraints node by using an arc from the lhs to the rhs. Note that we also</span></div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">// always add the other direction. We use a set to remove duplicates both for</span></div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="comment">// efficiency and to not artificially break symmetries by using multi-arcs.</span></div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// Tricky: We cannot use the base variable node here to avoid situation like</span></div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="comment">// both a variable a and b having the same children (not(a), not(b)) in the</span></div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="comment">// graph. Because if that happen, we can permute a and b without permuting</span></div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="comment">// their associated not(a) and not(b) node! To be sure this cannot happen, a</span></div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">// variable node can not have as children a VAR_COEFFICIENT_NODE from another</span></div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">// node. This makes sure that any permutation that touch a variable, must</span></div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">// permute its coefficient nodes accordingly.</span></div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  absl::flat_hash_set<std::pair<int, int>> implications;</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keyword">auto</span> get_implication_node = [&new_node, &graph, &coefficient_nodes,</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  &tmp_color](<span class="keywordtype">int</span> ref) {</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(ref);</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keyword">const</span> int64_t coeff = <a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(ref) ? 1 : -1;</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keyword">const</span> <span class="keyword">auto</span> insert =</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  coefficient_nodes.insert({std::make_pair(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, coeff), 0});</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">if</span> (!insert.second) <span class="keywordflow">return</span> insert.first->second;</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  tmp_color = {VAR_COEFFICIENT_NODE, coeff};</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> secondary_node = new_node(tmp_color);</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  graph->AddArc(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, secondary_node);</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  insert.first->second = secondary_node;</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">return</span> secondary_node;</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  };</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keyword">auto</span> add_implication = [&get_implication_node, &graph, &implications](</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordtype">int</span> ref_a, <span class="keywordtype">int</span> ref_b) {</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">const</span> <span class="keyword">auto</span> insert = implications.insert({ref_a, ref_b});</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">if</span> (!insert.second) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  graph->AddArc(get_implication_node(ref_a), get_implication_node(ref_b));</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  </div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="comment">// Always add the other side.</span></div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  implications.insert({<a class="code" href="namespaceoperations__research_1_1sat.html#ae0803b8198728cd4f6e58498d9c60091">NegatedRef</a>(ref_b), <a class="code" href="namespaceoperations__research_1_1sat.html#ae0803b8198728cd4f6e58498d9c60091">NegatedRef</a>(ref_a)});</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  graph->AddArc(get_implication_node(<a class="code" href="namespaceoperations__research_1_1sat.html#ae0803b8198728cd4f6e58498d9c60091">NegatedRef</a>(ref_b)),</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  get_implication_node(<a class="code" href="namespaceoperations__research_1_1sat.html#ae0803b8198728cd4f6e58498d9c60091">NegatedRef</a>(ref_a)));</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  };</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  </div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="comment">// Add constraints to the graph.</span></div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ConstraintProto& constraint : problem.constraints()) {</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> constraint_node = initial_equivalence_classes->size();</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  std::vector<int64_t> color = {CONSTRAINT_NODE,</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  constraint.constraint_case()};</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="keywordflow">switch</span> (constraint.constraint_case()) {</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordflow">case</span> ConstraintProto::CONSTRAINT_NOT_SET:</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">case</span> ConstraintProto::kLinear: {</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="comment">// TODO(user): We can use the same trick as for the implications to</span></div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="comment">// encode relations of the form coeff * var_a <= coeff * var_b without</span></div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="comment">// creating a constraint node by directly adding an arc between the two</span></div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="comment">// var coefficient nodes.</span></div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  Append(constraint.linear().domain(), &color);</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(constraint_node, new_node(color));</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < constraint.linear().vars_size(); ++i) {</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> ref = constraint.linear().vars(i);</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> variable_node = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(ref);</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keyword">const</span> int64_t coeff = <a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(ref)</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  ? constraint.linear().coeffs(i)</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  : -constraint.linear().coeffs(i);</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  graph->AddArc(get_coefficient_node(variable_node, coeff),</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  constraint_node);</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  }</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  }</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">case</span> ConstraintProto::kBoolOr: {</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(constraint_node, new_node(color));</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> ref : constraint.bool_or().literals()) {</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  graph->AddArc(get_literal_node(ref), constraint_node);</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  }</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  }</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">case</span> ConstraintProto::kAtMostOne: {</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">if</span> (constraint.at_most_one().literals().size() == 2) {</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="comment">// Treat it as an implication to avoid creating a node.</span></div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  add_implication(constraint.at_most_one().literals(0),</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#ae0803b8198728cd4f6e58498d9c60091">NegatedRef</a>(constraint.at_most_one().literals(1)));</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  }</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  </div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(constraint_node, new_node(color));</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> ref : constraint.at_most_one().literals()) {</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  graph->AddArc(get_literal_node(ref), constraint_node);</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  }</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  }</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">case</span> ConstraintProto::kExactlyOne: {</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(constraint_node, new_node(color));</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> ref : constraint.exactly_one().literals()) {</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  graph->AddArc(get_literal_node(ref), constraint_node);</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  }</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  }</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordflow">case</span> ConstraintProto::kBoolXor: {</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(constraint_node, new_node(color));</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> ref : constraint.bool_xor().literals()) {</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  graph->AddArc(get_literal_node(ref), constraint_node);</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  }</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  }</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">case</span> ConstraintProto::kBoolAnd: {</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">// The other cases should be presolved before this is called.</span></div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="comment">// TODO(user): not 100% true, this happen on rmatr200-p5, Fix.</span></div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">if</span> (constraint.enforcement_literal_size() != 1) {</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <a class="code" href="util_2logging_8h.html#a5f67b653dd99ddbe5e3367e3b4b7b532">SOLVER_LOG</a>(</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  logger,</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="stringliteral">"[Symmetry] BoolAnd with multiple enforcement literal are not "</span></div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="stringliteral">"supported in symmetry code:"</span>,</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  constraint.ShortDebugString());</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  </div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(constraint.enforcement_literal_size(), 1);</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> ref_a = constraint.enforcement_literal(0);</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> ref_b : constraint.bool_and().literals()) {</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  add_implication(ref_a, ref_b);</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  }</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  }</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">default</span>: {</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="comment">// If the model contains any non-supported constraints, return an empty</span></div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="comment">// graph.</span></div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="comment">// TODO(user): support other types of constraints. Or at least, we</span></div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="comment">// could associate to them an unique node so that their variables can</span></div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="comment">// appear in no symmetry.</span></div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Unsupported constraint type "</span></div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  << <a class="code" href="namespaceoperations__research_1_1sat.html#acf5b1cbffc494f14e8b87c672d5dda5f">ConstraintCaseName</a>(constraint.constraint_case());</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  }</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  }</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  </div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="comment">// For enforcement, we use a similar trick than for the implications.</span></div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="comment">// Because all our constraint arcs are in the direction var_node to</span></div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="comment">// constraint_node, we just use the reverse direction for the enforcement</span></div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="comment">// part. This way we can reuse the same get_literal_node() function.</span></div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordflow">if</span> (constraint.constraint_case() != ConstraintProto::kBoolAnd) {</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> ref : constraint.enforcement_literal()) {</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  graph->AddArc(constraint_node, get_literal_node(ref));</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  }</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  }</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  }</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  </div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  graph->Build();</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(graph->num_nodes(), initial_equivalence_classes->size());</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  </div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="comment">// TODO(user): The symmetry code does not officially support multi-arcs. And</span></div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="comment">// we shouldn't have any as long as there is no duplicates variable in our</span></div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="comment">// constraints (but of course, we can't always guarantee that). That said,</span></div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="comment">// because the symmetry code really only look at the degree, it works as long</span></div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="comment">// as the maximum degree is bounded by num_nodes.</span></div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = graph->num_nodes();</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  std::vector<int> in_degree(num_nodes, 0);</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  std::vector<int> out_degree(num_nodes, 0);</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_nodes; ++i) {</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  out_degree[i] = graph->OutDegree(i);</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a> : (*graph)[i]) {</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  in_degree[<a class="code" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a>]++;</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  }</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  }</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_nodes; ++i) {</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">if</span> (in_degree[i] >= num_nodes || out_degree[i] >= num_nodes) {</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <a class="code" href="util_2logging_8h.html#a5f67b653dd99ddbe5e3367e3b4b7b532">SOLVER_LOG</a>(logger, <span class="stringliteral">"[Symmetry] Too many multi-arcs in symmetry code."</span>);</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  }</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  }</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  </div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="comment">// Because this code is running during presolve, a lot a variable might have</span></div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="comment">// no edges. We do not want to detect symmetries between these.</span></div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="comment">// Note that this code forces us to "densify" the ids afterwards because the</span></div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="comment">// symmetry detection code relies on that.</span></div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="comment">// TODO(user): It will probably be more efficient to not even create these</span></div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="comment">// nodes, but we will need a mapping to know the variable <-> node index.</span></div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordtype">int</span> next_id = color_id_generator.NextFreeId();</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_variables; ++i) {</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordflow">if</span> ((*graph)[i].empty()) {</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  (*initial_equivalence_classes)[i] = next_id++;</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  }</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  }</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  </div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="comment">// Densify ids.</span></div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordtype">int</span> <span class="keywordtype">id</span> = 0;</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  std::vector<int> mapping(next_id, -1);</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span>& ref : *initial_equivalence_classes) {</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordflow">if</span> (mapping[ref] == -1) {</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  ref = mapping[ref] = <span class="keywordtype">id</span>++;</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  ref = mapping[ref];</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  }</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  }</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  </div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">return</span> graph;</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> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  </div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a50340f74c0088d8e24eb1ba4a5d95fef"> 374</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a50340f74c0088d8e24eb1ba4a5d95fef">FindCpModelSymmetries</a>(</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keyword">const</span> SatParameters& params, <span class="keyword">const</span> CpModelProto& problem,</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  std::vector<std::unique_ptr<SparsePermutation>>* generators,</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordtype">double</span> deterministic_limit, <a class="code" href="classoperations__research_1_1_solver_logger.html">SolverLogger</a>* logger) {</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(generators != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  generators->clear();</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  </div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keyword">typedef</span> <a class="code" href="classutil_1_1_static_graph.html">GraphSymmetryFinder::Graph</a> <a class="code" href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">Graph</a>;</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  </div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  std::vector<int> equivalence_classes;</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  std::unique_ptr<Graph> graph(GenerateGraphForSymmetryDetection<Graph>(</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  problem, &equivalence_classes, logger));</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">if</span> (graph == <span class="keyword">nullptr</span>) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  </div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <a class="code" href="util_2logging_8h.html#a5f67b653dd99ddbe5e3367e3b4b7b532">SOLVER_LOG</a>(logger, <span class="stringliteral">"[Symmetry] Graph for symmetry has "</span>, graph->num_nodes(),</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="stringliteral">" nodes and "</span>, graph->num_arcs(), <span class="stringliteral">" arcs."</span>);</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordflow">if</span> (graph->num_nodes() == 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  </div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <a class="code" href="classoperations__research_1_1_graph_symmetry_finder.html">GraphSymmetryFinder</a> symmetry_finder(*graph, <span class="comment">/*is_undirected=*/</span><span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  std::vector<int> factorized_automorphism_group_size;</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  std::unique_ptr<TimeLimit> <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a> =</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <a class="code" href="classoperations__research_1_1_time_limit.html#a640ae7a07a6de8fe45a5526326f3b028">TimeLimit::FromDeterministicTime</a>(deterministic_limit);</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keyword">const</span> absl::Status status = symmetry_finder.<a class="code" href="classoperations__research_1_1_graph_symmetry_finder.html#ad1f88654797ab9271206d6a4c013a94e">FindSymmetries</a>(</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  &equivalence_classes, generators, &factorized_automorphism_group_size,</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>.get());</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="comment">// TODO(user): Change the API to not return an error when the time limit is</span></div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="comment">// reached.</span></div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordflow">if</span> (!status.ok()) {</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <a class="code" href="util_2logging_8h.html#a5f67b653dd99ddbe5e3367e3b4b7b532">SOLVER_LOG</a>(logger,</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="stringliteral">"[Symmetry] GraphSymmetryFinder error: "</span>, status.message());</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  }</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  </div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="comment">// Remove from the permutations the part not concerning the variables.</span></div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="comment">// Note that some permutations may become empty, which means that we had</span></div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="comment">// duplicate constraints.</span></div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordtype">double</span> average_support_size = 0.0;</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordtype">int</span> num_generators = 0;</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordtype">int</span> num_duplicate_constraints = 0;</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < generators->size(); ++i) {</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <a class="code" href="classoperations__research_1_1_sparse_permutation.html">SparsePermutation</a>* permutation = (*generators)[i].get();</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  std::vector<int> to_delete;</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < permutation-><a class="code" href="classoperations__research_1_1_sparse_permutation.html#a8c5fc5af6e649a82d169f61e4dab5e33">NumCycles</a>(); ++j) {</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="comment">// Because variable nodes are in a separate equivalence class than any</span></div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="comment">// other node, a cycle can either contain only variable nodes or none, so</span></div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="comment">// we just need to check one element of the cycle.</span></div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keywordflow">if</span> (*(permutation-><a class="code" href="classoperations__research_1_1_sparse_permutation.html#af567b4e287e268eb9ecee908f63e5b64">Cycle</a>(j).<a class="code" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a8497b34029ee966694083aa34c9022b5">begin</a>()) >= problem.variables_size()) {</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  to_delete.push_back(j);</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="comment">// Verify that the cycle's entire support does not touch any variable.</span></div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : permutation-><a class="code" href="classoperations__research_1_1_sparse_permutation.html#af567b4e287e268eb9ecee908f63e5b64">Cycle</a>(j)) {</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(node, problem.variables_size());</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  }</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  }</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  }</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  }</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  </div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  permutation-><a class="code" href="classoperations__research_1_1_sparse_permutation.html#a9add43490c45e4334099bb15b6e6eab0">RemoveCycles</a>(to_delete);</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keywordflow">if</span> (!permutation-><a class="code" href="classoperations__research_1_1_sparse_permutation.html#ab601acb5aed920b1e61210d497462976">Support</a>().empty()) {</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  average_support_size += permutation-><a class="code" href="classoperations__research_1_1_sparse_permutation.html#ab601acb5aed920b1e61210d497462976">Support</a>().size();</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">swap</a>((*generators)[num_generators], (*generators)[i]);</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  ++num_generators;</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  ++num_duplicate_constraints;</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>  }</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  generators->resize(num_generators);</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  average_support_size /= num_generators;</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <a class="code" href="util_2logging_8h.html#a5f67b653dd99ddbe5e3367e3b4b7b532">SOLVER_LOG</a>(logger, <span class="stringliteral">"[Symmetry] Symmetry computation done. time: "</span>,</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>->GetElapsedTime(),</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="stringliteral">" dtime: "</span>, <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>->GetElapsedDeterministicTime());</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordflow">if</span> (num_generators > 0) {</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <a class="code" href="util_2logging_8h.html#a5f67b653dd99ddbe5e3367e3b4b7b532">SOLVER_LOG</a>(logger, <span class="stringliteral">"[Symmetry] # of generators: "</span>, num_generators);</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <a class="code" href="util_2logging_8h.html#a5f67b653dd99ddbe5e3367e3b4b7b532">SOLVER_LOG</a>(logger,</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="stringliteral">"[Symmetry] Average support size: "</span>, average_support_size);</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keywordflow">if</span> (num_duplicate_constraints > 0) {</div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <a class="code" href="util_2logging_8h.html#a5f67b653dd99ddbe5e3367e3b4b7b532">SOLVER_LOG</a>(logger, <span class="stringliteral">"[Symmetry] The model contains "</span>,</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  num_duplicate_constraints, <span class="stringliteral">" duplicate constraints !"</span>);</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  }</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  }</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span> }</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  </div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a0fc24fd6e8320e397bb6700b009a8f3b"> 456</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a0fc24fd6e8320e397bb6700b009a8f3b">DetectAndAddSymmetryToProto</a>(<span class="keyword">const</span> SatParameters& params,</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  CpModelProto* <a class="code" href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a>, <a class="code" href="classoperations__research_1_1_solver_logger.html">SolverLogger</a>* logger) {</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  SymmetryProto* symmetry = <a class="code" href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a>->mutable_symmetry();</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  symmetry->Clear();</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  </div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  std::vector<std::unique_ptr<SparsePermutation>> generators;</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a50340f74c0088d8e24eb1ba4a5d95fef">FindCpModelSymmetries</a>(params, *<a class="code" href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a>, &generators,</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="comment">/*deterministic_limit=*/</span>1.0, logger);</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">if</span> (generators.empty()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  </div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::unique_ptr<SparsePermutation>& perm : generators) {</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  SparsePermutationProto* perm_proto = symmetry->add_permutations();</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_cycle = perm->NumCycles();</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_cycle; ++i) {</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_size = perm_proto->support().size();</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : perm->Cycle(i)) {</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  perm_proto->add_support(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</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>  perm_proto->add_cycle_sizes(perm_proto->support().size() - old_size);</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  }</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  }</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  </div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  std::vector<std::vector<int>> orbitope = <a class="code" href="namespaceoperations__research_1_1sat.html#ae4be5fcdd40601e7d3862a5c9ab06915">BasicOrbitopeExtraction</a>(generators);</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keywordflow">if</span> (orbitope.empty()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <a class="code" href="util_2logging_8h.html#a5f67b653dd99ddbe5e3367e3b4b7b532">SOLVER_LOG</a>(logger, <span class="stringliteral">"[Symmetry] Found orbitope of size "</span>, orbitope.size(),</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="stringliteral">" x "</span>, orbitope[0].size());</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  DenseMatrixProto* matrix = symmetry->add_orbitopes();</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  matrix->set_num_rows(orbitope.size());</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  matrix->set_num_cols(orbitope[0].size());</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::vector<int>& <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> : orbitope) {</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> entry : <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  matrix->add_entries(entry);</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>  }</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>  </div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a1b24f74de50e3483bbefacffcd349eb1"> 492</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a1b24f74de50e3483bbefacffcd349eb1">DetectAndExploitSymmetriesInPresolve</a>(<a class="code" href="classoperations__research_1_1sat_1_1_presolve_context.html">PresolveContext</a>* <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>) {</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keyword">const</span> SatParameters& params = <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->params();</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keyword">const</span> CpModelProto& <a class="code" href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a> = *<a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->working_model;</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  </div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="comment">// We need to make sure the proto is up to date before computing symmetries!</span></div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keywordflow">if</span> (<a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->working_model->has_objective()) {</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->WriteObjectiveToProto();</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  }</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = <a class="code" href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a>.variables_size();</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; ++i) {</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a901c19b12842f8af153e588a689a90b5">FillDomainInProto</a>(<a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->DomainOf(i),</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->working_model->mutable_variables(i));</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  }</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  </div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="comment">// Tricky: the equivalence relation are not part of the proto.</span></div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="comment">// We thus add them temporarily to compute the symmetry.</span></div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  int64_t num_added = 0;</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> initial_ct_index = <a class="code" href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a>.constraints().size();</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = 0; <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> < num_vars; ++<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordflow">if</span> (<a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->IsFixed(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordflow">if</span> (<a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->VariableWasRemoved(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordflow">if</span> (<a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->VariableIsNotUsedAnymore(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  </div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_affine_relation_1_1_relation.html">AffineRelation::Relation</a> r = <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->GetAffineRelation(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keywordflow">if</span> (r.<a class="code" href="structoperations__research_1_1_affine_relation_1_1_relation.html#af5eb1e0745f18d589b9c552215bef515">representative</a> == <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  </div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  ++num_added;</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  ConstraintProto* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->working_model->add_constraints();</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keyword">auto</span>* arg = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->mutable_linear();</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  arg->add_vars(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  arg->add_coeffs(1);</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  arg->add_vars(r.<a class="code" href="structoperations__research_1_1_affine_relation_1_1_relation.html#af5eb1e0745f18d589b9c552215bef515">representative</a>);</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  arg->add_coeffs(-r.<a class="code" href="structoperations__research_1_1_affine_relation_1_1_relation.html#a537e59662a0751edfbbd2a0079a794b4">coeff</a>);</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  arg->add_domain(r.<a class="code" href="structoperations__research_1_1_affine_relation_1_1_relation.html#ae25fb5067bd6b3b1b319efc61685a98f">offset</a>);</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  arg->add_domain(r.<a class="code" href="structoperations__research_1_1_affine_relation_1_1_relation.html#ae25fb5067bd6b3b1b319efc61685a98f">offset</a>);</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  }</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  </div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  std::vector<std::unique_ptr<SparsePermutation>> generators;</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a50340f74c0088d8e24eb1ba4a5d95fef">FindCpModelSymmetries</a>(params, <a class="code" href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a>, &generators,</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="comment">/*deterministic_limit=*/</span>1.0, <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->logger());</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  </div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="comment">// Remove temporary affine relation.</span></div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->working_model->mutable_constraints()->DeleteSubrange(</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  initial_ct_index, num_added);</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  </div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keywordflow">if</span> (generators.empty()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  </div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="comment">// Collect the at most ones.</span></div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="comment">// Note(user): This relies on the fact that the pointers remain stable when</span></div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="comment">// we adds new constraints. It should be the case, but it is a bit unsafe.</span></div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="comment">// On the other hand it is annoying to deal with both cases below.</span></div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  std::vector<const google::protobuf::RepeatedField<int32_t>*> at_most_ones;</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a>.constraints_size(); ++i) {</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a>.constraints(i).constraint_case() == ConstraintProto::kAtMostOne) {</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  at_most_ones.push_back(&<a class="code" href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a>.constraints(i).at_most_one().literals());</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  }</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a>.constraints(i).constraint_case() ==</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  ConstraintProto::kExactlyOne) {</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  at_most_ones.push_back(&<a class="code" href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a>.constraints(i).exactly_one().literals());</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>  }</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  </div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="comment">// Experimental. Generic approach. First step.</span></div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="comment">// If an at most one intersect with one or more orbit, in each intersection,</span></div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="comment">// we can fix all but one variable to zero. For now we only test positive</span></div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="comment">// literal, and maximize the number of fixing.</span></div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  std::vector<int> can_be_fixed_to_false;</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  {</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keyword">const</span> std::vector<int> orbits = <a class="code" href="namespaceoperations__research_1_1sat.html#ae75c184235d68cd4b3019cfba09b764d">GetOrbits</a>(num_vars, generators);</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  std::vector<int> orbit_sizes;</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="keywordtype">int</span> max_orbit_size = 0;</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> rep : orbits) {</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="keywordflow">if</span> (rep == -1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keywordflow">if</span> (rep >= orbit_sizes.size()) orbit_sizes.resize(rep + 1, 0);</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  orbit_sizes[rep]++;</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  max_orbit_size = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_orbit_size, orbit_sizes[rep]);</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  }</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  </div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  std::vector<int> tmp_to_clear;</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  std::vector<int> tmp_sizes(num_vars, 0);</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> google::protobuf::RepeatedField<int32_t>* literals :</div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  at_most_ones) {</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  tmp_to_clear.clear();</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  </div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="comment">// Compute how many variables we can fix with this at most one.</span></div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keywordtype">int</span> num_fixable = 0;</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : *literals) {</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keywordflow">if</span> (<a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->IsFixed(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  </div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> rep = orbits[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>];</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keywordflow">if</span> (rep == -1) <span class="keywordflow">continue</span>;</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>  <span class="comment">// We count all but the first one in each orbit.</span></div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordflow">if</span> (tmp_sizes[rep] == 0) tmp_to_clear.push_back(rep);</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordflow">if</span> (tmp_sizes[rep] > 0) ++num_fixable;</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  tmp_sizes[rep]++;</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>  </div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="comment">// Redo a pass to copy the intersection.</span></div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keywordflow">if</span> (num_fixable > can_be_fixed_to_false.size()) {</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  can_be_fixed_to_false.clear();</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : *literals) {</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="keywordflow">if</span> (<a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->IsFixed(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  </div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> rep = orbits[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>];</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keywordflow">if</span> (rep == -1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  </div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="comment">// We push all but the first one in each orbit.</span></div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keywordflow">if</span> (tmp_sizes[rep] == 0) can_be_fixed_to_false.push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  tmp_sizes[rep] = 0;</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>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="comment">// Sparse clean up.</span></div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> rep : tmp_to_clear) tmp_sizes[rep] = 0;</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  }</div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  }</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  </div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <a class="code" href="util_2logging_8h.html#a5f67b653dd99ddbe5e3367e3b4b7b532">SOLVER_LOG</a>(</div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->logger(),</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="stringliteral">"[Symmetry] Num fixable by intersecting at_most_one with orbits: "</span>,</div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  can_be_fixed_to_false.size(), <span class="stringliteral">" largest_orbit: "</span>, max_orbit_size);</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>  <span class="comment">// Orbitope approach.</span></div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="comment">// This is basically the same as the generic approach, but because of the</span></div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="comment">// extra structure, computing the orbit of any stabilizer subgroup is easy.</span></div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="comment">// We look for orbits intersecting at most one constraints, so we can break</span></div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="comment">// symmetry by fixing variables.</span></div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="comment">// TODO(user): The same effect could be achieved by adding symmetry breaking</span></div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="comment">// constraints of the form "a >= b " between Booleans and let the presolve do</span></div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="comment">// the reduction. This might be less code, but it is also less efficient.</span></div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="comment">// Similarly, when we cannot just fix variables to break symmetries, we could</span></div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="comment">// add these constraints, but it is unclear if we should do it all the time or</span></div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="comment">// not.</span></div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="comment">// TODO(user): code the generic approach with orbits and stabilizer.</span></div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  std::vector<std::vector<int>> orbitope = <a class="code" href="namespaceoperations__research_1_1sat.html#ae4be5fcdd40601e7d3862a5c9ab06915">BasicOrbitopeExtraction</a>(generators);</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keywordflow">if</span> (!orbitope.empty()) {</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <a class="code" href="util_2logging_8h.html#a5f67b653dd99ddbe5e3367e3b4b7b532">SOLVER_LOG</a>(<a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->logger(), <span class="stringliteral">"[Symmetry] Found orbitope of size "</span>,</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  orbitope.size(), <span class="stringliteral">" x "</span>, orbitope[0].size());</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  }</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  </div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="comment">// Supper simple heuristic to use the orbitope or not.</span></div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="comment">// In an orbitope with an at most one on each row, we can fix the upper right</span></div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="comment">// triangle. We could use a formula, but the loop is fast enough.</span></div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="comment">// TODO(user): Compute the stabilizer under the only non-fixed element and</span></div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="comment">// iterate!</span></div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keywordtype">int</span> max_num_fixed_in_orbitope = 0;</div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="keywordflow">if</span> (!orbitope.empty()) {</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_rows = orbitope[0].size();</div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keywordtype">int</span> size_left = num_rows;</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = 0; size_left > 1 && <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < orbitope.size(); ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  max_num_fixed_in_orbitope += size_left - 1;</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  --size_left;</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  }</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  }</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keywordflow">if</span> (max_num_fixed_in_orbitope < can_be_fixed_to_false.size()) {</div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < can_be_fixed_to_false.size(); ++i) {</div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = can_be_fixed_to_false[i];</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->UpdateRuleStats(<span class="stringliteral">"symmetry: fixed to false in general orbit"</span>);</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keywordflow">if</span> (!<a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->SetLiteralToFalse(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  }</div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="keywordflow">return</span> <span class="keyword">true</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="keywordflow">if</span> (orbitope.empty()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  </div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="comment">// This will always be kept all zero after usage.</span></div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  std::vector<int> tmp_to_clear;</div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  std::vector<int> tmp_sizes(num_vars, 0);</div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  std::vector<int> tmp_num_positive(num_vars, 0);</div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  </div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="comment">// TODO(user): The code below requires that no variable appears twice in the</span></div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="comment">// same at most one. In particular lit and not(lit) cannot appear in the same</span></div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="comment">// at most one.</span></div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> google::protobuf::RepeatedField<int32_t>* literals :</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  at_most_ones) {</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> lit : *literals) {</div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(lit);</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(tmp_sizes[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>], 1);</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  tmp_sizes[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = 1;</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  }</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> lit : *literals) {</div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  tmp_sizes[<a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(lit)] = 0;</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  }</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">while</span> (!orbitope.empty() && orbitope[0].size() > 1) {</div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_cols = orbitope[0].size();</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keyword">const</span> std::vector<int> orbits = <a class="code" href="namespaceoperations__research_1_1sat.html#a34d8ec706e23b38d955a1c902a03208e">GetOrbitopeOrbits</a>(num_vars, orbitope);</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="comment">// Because in the orbitope case, we have a full symmetry group of the</span></div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="comment">// columns, we can infer more than just using the orbits under a general</span></div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="comment">// permutation group. If an at most one contains two variables from the</span></div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="comment">// orbit, we can infer:</span></div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="comment">// 1/ If the two variables appear positively, then there is an at most one</span></div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="comment">// on the full orbit, and we can set n - 1 variables to zero to break the</span></div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="comment">// symmetry.</span></div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="comment">// 2/ If the two variables appear negatively, then the opposite situation</span></div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="comment">// arise and there is at most one zero on the orbit, we can set n - 1</span></div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="comment">// variables to one.</span></div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="comment">// 3/ If two literals of opposite sign appear, then the only possibility</span></div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="comment">// for the orbit are all at one or all at zero, thus we can mark all</span></div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="comment">// variables as equivalent.</span></div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="comment">// These property comes from the fact that when we permute a line of the</span></div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="comment">// orbitope in any way, then the position than ends up in the at most one</span></div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="comment">// must never be both at one.</span></div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="comment">// Note that 1/ can be done without breaking any symmetry, but for 2/ and 3/</span></div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="comment">// by choosing which variable is not fixed, we will break some symmetry, and</span></div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="comment">// we will need to update the orbitope to stabilize this choice before</span></div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="comment">// continuing.</span></div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="comment">// TODO(user): for 2/ and 3/ we could add an at most one constraint on the</span></div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="comment">// full orbit if it is not already there!</span></div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="comment">// Note(user): On the miplib, only 1/ happens currently. Not sure with LNS</span></div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="comment">// though.</span></div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  std::vector<bool> all_equivalent_rows(orbitope.size(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  </div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="comment">// The result described above can be generalized if an at most one intersect</span></div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="comment">// many of the orbitope rows, each in at leat two positions. We will track</span></div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="comment">// the set of best rows on which we have an at most one (or at most one</span></div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="comment">// zero) on all their entries.</span></div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keywordtype">bool</span> at_most_one_in_best_rows; <span class="comment">// The alternative is at most one zero.</span></div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  int64_t best_score = 0;</div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  std::vector<int> best_rows;</div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  </div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  std::vector<int> rows_in_at_most_one;</div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> google::protobuf::RepeatedField<int32_t>* literals :</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  at_most_ones) {</div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  tmp_to_clear.clear();</div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : *literals) {</div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="keywordflow">if</span> (<a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->IsFixed(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> rep = orbits[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>];</div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="keywordflow">if</span> (rep == -1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  </div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="keywordflow">if</span> (tmp_sizes[rep] == 0) tmp_to_clear.push_back(rep);</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  tmp_sizes[rep]++;</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) tmp_num_positive[rep]++;</div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  }</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  </div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="keywordtype">int</span> num_positive_direction = 0;</div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <span class="keywordtype">int</span> num_negative_direction = 0;</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">// An at most one touching two positions in an orbitope row can possibly</span></div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="comment">// be extended, depending if it has singleton intersection swith other</span></div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="comment">// rows and where.</span></div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keywordtype">bool</span> possible_extension = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  </div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  rows_in_at_most_one.clear();</div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> : tmp_to_clear) {</div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = tmp_sizes[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>];</div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_positive = tmp_num_positive[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>];</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_negative = tmp_sizes[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>] - tmp_num_positive[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>];</div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  tmp_sizes[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>] = 0;</div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  tmp_num_positive[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>] = 0;</div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  </div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="keywordflow">if</span> (num_positive > 1 && num_negative == 0) {</div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="keywordflow">if</span> (size < num_cols) possible_extension = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  rows_in_at_most_one.push_back(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>);</div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  ++num_positive_direction;</div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (num_positive == 0 && num_negative > 1) {</div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="keywordflow">if</span> (size < num_cols) possible_extension = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  rows_in_at_most_one.push_back(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>);</div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  ++num_negative_direction;</div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (num_positive > 0 && num_negative > 0) {</div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  all_equivalent_rows[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  }</div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  }</div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  </div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="keywordflow">if</span> (possible_extension) {</div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->UpdateRuleStats(</div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="stringliteral">"TODO symmetry: possible at most one extension."</span>);</div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  }</div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  </div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  <span class="keywordflow">if</span> (num_positive_direction > 0 && num_negative_direction > 0) {</div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keywordflow">return</span> <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->NotifyThatModelIsUnsat(<span class="stringliteral">"Symmetry and at most ones"</span>);</div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  }</div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> direction = num_positive_direction > 0;</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>  <span class="comment">// Because of symmetry, the choice of the column shouldn't matter (they</span></div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  <span class="comment">// will all appear in the same number of constraints of the same types),</span></div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="comment">// however we prefer to fix the variables that seems to touch more</span></div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="comment">// constraints.</span></div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="comment">// TODO(user): maybe we should simplify the constraint using the variable</span></div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="comment">// we fix before choosing the next row to break symmetry on. If there are</span></div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="comment">// multiple row involved, we could also take the intersection instead of</span></div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="comment">// probably counting the same constraints more than once.</span></div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  int64_t score = 0;</div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> : rows_in_at_most_one) {</div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  score +=</div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->VarToConstraints(<a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(orbitope[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][0])).size();</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>  <span class="keywordflow">if</span> (score > best_score) {</div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  at_most_one_in_best_rows = direction;</div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  best_score = score;</div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  best_rows = rows_in_at_most_one;</div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  }</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>  </div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="comment">// Mark all the equivalence.</span></div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <span class="comment">// Note that this operation do not change the symmetry group.</span></div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="comment">// TODO(user): We could remove these rows from the orbitope. Note that</span></div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="comment">// currently this never happen on the miplib (maybe in LNS though).</span></div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < all_equivalent_rows.size(); ++i) {</div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="keywordflow">if</span> (all_equivalent_rows[i]) {</div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 1; j < num_cols; ++j) {</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->StoreBooleanEqualityRelation(orbitope[i][0], orbitope[i][j]);</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->UpdateRuleStats(<span class="stringliteral">"symmetry: all equivalent in orbit"</span>);</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  <span class="keywordflow">if</span> (<a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->ModelIsUnsat()) <span class="keywordflow">return</span> <span class="keyword">false</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>  }</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>  </div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="comment">// Break the symmetry on our set of best rows by picking one columns</span></div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="comment">// and setting all the other entries to zero or one. Note that the at most</span></div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  <span class="comment">// one applies to all entries in all rows.</span></div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="comment">// TODO(user): We don't have any at most one relation on this orbitope,</span></div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="comment">// but we could still add symmetry breaking inequality by picking any matrix</span></div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <span class="comment">// entry and making it the largest/lowest value on its row. This also work</span></div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <span class="comment">// for non-Booleans.</span></div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  <span class="keywordflow">if</span> (best_score == 0) {</div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->UpdateRuleStats(</div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <span class="stringliteral">"TODO symmetry: add symmetry breaking inequalities?"</span>);</div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  }</div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  </div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="comment">// If our symmetry group is valid, they cannot be any variable already</span></div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <span class="comment">// fixed to one (or zero if !at_most_one_in_best_rows). Otherwise all would</span></div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  <span class="comment">// be fixed to one and the problem would be unsat.</span></div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> i : best_rows) {</div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < num_cols; ++j) {</div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = orbitope[i][j];</div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="keywordflow">if</span> ((at_most_one_in_best_rows && <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->LiteralIsTrue(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) ||</div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  (!at_most_one_in_best_rows && <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->LiteralIsFalse(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>))) {</div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keywordflow">return</span> <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->NotifyThatModelIsUnsat(<span class="stringliteral">"Symmetry and at most one"</span>);</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>  }</div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  </div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  <span class="comment">// We have an at most one on a set of rows, we will pick a column, and set</span></div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="comment">// all other entries on these rows to zero.</span></div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="comment">// TODO(user): All choices should be equivalent, but double check?</span></div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> best_col = 0;</div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> i : best_rows) {</div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < num_cols; ++j) {</div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="keywordflow">if</span> (j == best_col) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = orbitope[i][j];</div>
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="keywordflow">if</span> (at_most_one_in_best_rows) {</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->UpdateRuleStats(<span class="stringliteral">"symmetry: fixed to false"</span>);</div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keywordflow">if</span> (!<a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->SetLiteralToFalse(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->UpdateRuleStats(<span class="stringliteral">"symmetry: fixed to true"</span>);</div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keywordflow">if</span> (!<a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->SetLiteralToTrue(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  }</div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  }</div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  }</div>
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  </div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  <span class="comment">// Remove all best rows.</span></div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> i : best_rows) orbitope[i].clear();</div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <span class="keywordtype">int</span> new_size = 0;</div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < orbitope.size(); ++i) {</div>
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  <span class="keywordflow">if</span> (!orbitope[i].empty()) orbitope[new_size++] = orbitope[i];</div>
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  }</div>
|
|
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(new_size, orbitope.size());</div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  orbitope.resize(new_size);</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  </div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="comment">// Remove best_col.</span></div>
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < orbitope.size(); ++i) {</div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(orbitope[i][best_col], orbitope[i].back());</div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  orbitope[i].pop_back();</div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  }</div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  }</div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  </div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <span class="comment">// If we are left with a set of variable than can all be permuted, lets</span></div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <span class="comment">// break the symmetry by ordering them.</span></div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  <span class="keywordflow">if</span> (orbitope.size() == 1) {</div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_cols = orbitope[0].size();</div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i + 1 < num_cols; ++i) {</div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="comment">// Add orbitope[0][i] >= orbitope[0][i+1].</span></div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  ConstraintProto* <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->working_model->add_constraints();</div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->mutable_linear()->add_coeffs(1);</div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->mutable_linear()->add_vars(orbitope[0][i]);</div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->mutable_linear()->add_coeffs(-1);</div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->mutable_linear()->add_vars(orbitope[0][i + 1]);</div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->mutable_linear()->add_domain(0);</div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->mutable_linear()->add_domain(<a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>());</div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->UpdateRuleStats(<span class="stringliteral">"symmetry: added symmetry breaking inequality"</span>);</div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  }</div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <a class="code" href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a>->UpdateNewConstraintsVariableUsage();</div>
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  }</div>
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  </div>
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span> }</div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  </div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="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#l00498">base/logging.h:498</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#l00708">base/logging.h:708</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#l00705">base/logging.h:705</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00897">base/logging.h:897</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#l00706">base/logging.h:706</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#l00892">base/logging.h:892</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00893">base/logging.h:893</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00986">base/logging.h:986</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_graph_symmetry_finder_html"><div class="ttname"><a href="classoperations__research_1_1_graph_symmetry_finder.html">operations_research::GraphSymmetryFinder</a></div><div class="ttdef"><b>Definition:</b> <a href="find__graph__symmetries_8h_source.html#l00043">find_graph_symmetries.h:43</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_graph_symmetry_finder_html_ad1f88654797ab9271206d6a4c013a94e"><div class="ttname"><a href="classoperations__research_1_1_graph_symmetry_finder.html#ad1f88654797ab9271206d6a4c013a94e">operations_research::GraphSymmetryFinder::FindSymmetries</a></div><div class="ttdeci">absl::Status FindSymmetries(std::vector< int > *node_equivalence_classes_io, std::vector< std::unique_ptr< SparsePermutation > > *generators, std::vector< int > *factorized_automorphism_group_size, TimeLimit *time_limit=nullptr)</div><div class="ttdef"><b>Definition:</b> <a href="find__graph__symmetries_8cc_source.html#l00377">find_graph_symmetries.cc:377</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_logger_html"><div class="ttname"><a href="classoperations__research_1_1_solver_logger.html">operations_research::SolverLogger</a></div><div class="ttdef"><b>Definition:</b> <a href="util_2logging_8h_source.html#l00033">util/logging.h:33</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_permutation_html"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html">operations_research::SparsePermutation</a></div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00027">sparse_permutation.h:27</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_permutation_html_a8c5fc5af6e649a82d169f61e4dab5e33"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#a8c5fc5af6e649a82d169f61e4dab5e33">operations_research::SparsePermutation::NumCycles</a></div><div class="ttdeci">int NumCycles() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00033">sparse_permutation.h:33</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_permutation_html_a9add43490c45e4334099bb15b6e6eab0"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#a9add43490c45e4334099bb15b6e6eab0">operations_research::SparsePermutation::RemoveCycles</a></div><div class="ttdeci">void RemoveCycles(const std::vector< int > &cycle_indices)</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8cc_source.html#l00023">sparse_permutation.cc:23</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_permutation_html_ab601acb5aed920b1e61210d497462976"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#ab601acb5aed920b1e61210d497462976">operations_research::SparsePermutation::Support</a></div><div class="ttdeci">const std::vector< int > & Support() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00037">sparse_permutation.h:37</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_permutation_html_af567b4e287e268eb9ecee908f63e5b64"><div class="ttname"><a href="classoperations__research_1_1_sparse_permutation.html#af567b4e287e268eb9ecee908f63e5b64">operations_research::SparsePermutation::Cycle</a></div><div class="ttdeci">Iterator Cycle(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00117">sparse_permutation.h:117</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html_a640ae7a07a6de8fe45a5526326f3b028"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html#a640ae7a07a6de8fe45a5526326f3b028">operations_research::TimeLimit::FromDeterministicTime</a></div><div class="ttdeci">static std::unique_ptr< TimeLimit > FromDeterministicTime(double deterministic_limit)</div><div class="ttdoc">Creates a time limit object that puts limit only on the deterministic time.</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00144">time_limit.h:144</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_presolve_context_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_presolve_context.html">operations_research::sat::PresolveContext</a></div><div class="ttdef"><b>Definition:</b> <a href="presolve__context_8h_source.html#l00070">presolve_context.h:70</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1_static_graph_html"><div class="ttname"><a href="classutil_1_1_static_graph.html">util::StaticGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00398">graph.h:398</a></div></div>
|
|
<div class="ttc" id="acp__model__fz__solver_8cc_html_aed003f5eb5197bc586b7ef2c36a63da2"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a></div><div class="ttdeci">CpModelProto proto</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00107">cp_model_fz_solver.cc:107</a></div></div>
|
|
<div class="ttc" id="acp__model__solver_8cc_html_ac3cf9db02b23ea1455b5ae6955d03e47"><div class="ttname"><a href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a></div><div class="ttdeci">SharedTimeLimit * time_limit</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02152">cp_model_solver.cc:2152</a></div></div>
|
|
<div class="ttc" id="acp__model__symmetries_8h_html"><div class="ttname"><a href="cp__model__symmetries_8h.html">cp_model_symmetries.h</a></div></div>
|
|
<div class="ttc" id="acp__model__utils_8h_html"><div class="ttname"><a href="cp__model__utils_8h.html">cp_model_utils.h</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695"><div class="ttname"><a href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a></div><div class="ttdeci">const Constraint * ct</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="afind__graph__symmetries_8h_html"><div class="ttname"><a href="find__graph__symmetries_8h.html">find_graph_symmetries.h</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a5f287b83a753915ae862fed64f8640a6"><div class="ttname"><a href="gurobi__interface_8cc.html#a5f287b83a753915ae862fed64f8640a6">context</a></div><div class="ttdeci">GurobiMPCallbackContext * context</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00513">gurobi_interface.cc:513</a></div></div>
|
|
<div class="ttc" id="ahash_8h_html"><div class="ttname"><a href="hash_8h.html">hash.h</a></div></div>
|
|
<div class="ttc" id="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="amap__util_8h_html"><div class="ttname"><a href="map__util_8h.html">map_util.h</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#l00183">markowitz.cc:183</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#l00182">markowitz.cc:182</a></div></div>
|
|
<div class="ttc" id="amatrix__utils_8cc_html_a95d4078c018ac04247ee3785eab30e7b"><div class="ttname"><a href="matrix__utils_8cc.html#a95d4078c018ac04247ee3785eab30e7b">hash</a></div><div class="ttdeci">int64_t hash</div><div class="ttdef"><b>Definition:</b> <a href="matrix__utils_8cc_source.html#l00061">matrix_utils.cc:61</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a7a0f8dc4187504b814d8a8be463b517c"><div class="ttname"><a href="namespacegtl.html#a7a0f8dc4187504b814d8a8be463b517c">gtl::LookupOrInsert</a></div><div class="ttdeci">Collection::value_type::second_type & LookupOrInsert(Collection *const collection, const typename Collection::value_type::first_type &key, const typename Collection::value_type::second_type &value)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00237">map_util.h:237</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a5de89a1f6e3f80a49a0d76136d8044e2"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">operations_research::math_opt::swap</a></div><div class="ttdeci">void swap(IdMap< K, V > &a, IdMap< K, V > &b)</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00263">id_map.h:263</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a0fc24fd6e8320e397bb6700b009a8f3b"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0fc24fd6e8320e397bb6700b009a8f3b">operations_research::sat::DetectAndAddSymmetryToProto</a></div><div class="ttdeci">void DetectAndAddSymmetryToProto(const SatParameters &params, CpModelProto *proto, SolverLogger *logger)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__symmetries_8cc_source.html#l00456">cp_model_symmetries.cc:456</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1b24f74de50e3483bbefacffcd349eb1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1b24f74de50e3483bbefacffcd349eb1">operations_research::sat::DetectAndExploitSymmetriesInPresolve</a></div><div class="ttdeci">bool DetectAndExploitSymmetriesInPresolve(PresolveContext *context)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__symmetries_8cc_source.html#l00492">cp_model_symmetries.cc:492</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a217338425de4389014563f1f24331713"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">operations_research::sat::RefIsPositive</a></div><div class="ttdeci">bool RefIsPositive(int ref)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__utils_8h_source.html#l00036">cp_model_utils.h:36</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a34d8ec706e23b38d955a1c902a03208e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a34d8ec706e23b38d955a1c902a03208e">operations_research::sat::GetOrbitopeOrbits</a></div><div class="ttdeci">std::vector< int > GetOrbitopeOrbits(int n, const std::vector< std::vector< int >> &orbitope)</div><div class="ttdef"><b>Definition:</b> <a href="symmetry__util_8cc_source.html#l00178">symmetry_util.cc:178</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a3f6fa74408ea28eb41f29e9696d9a9a2"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3f6fa74408ea28eb41f29e9696d9a9a2">operations_research::sat::GenerateGraphForSymmetryDetection</a></div><div class="ttdeci">Graph * GenerateGraphForSymmetryDetection(const LinearBooleanProblem &problem, std::vector< int > *initial_equivalence_classes)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00534">boolean_problem.cc:534</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a50340f74c0088d8e24eb1ba4a5d95fef"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a50340f74c0088d8e24eb1ba4a5d95fef">operations_research::sat::FindCpModelSymmetries</a></div><div class="ttdeci">void FindCpModelSymmetries(const SatParameters &params, const CpModelProto &problem, std::vector< std::unique_ptr< SparsePermutation >> *generators, double deterministic_limit, SolverLogger *logger)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__symmetries_8cc_source.html#l00374">cp_model_symmetries.cc:374</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a901c19b12842f8af153e588a689a90b5"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a901c19b12842f8af153e588a689a90b5">operations_research::sat::FillDomainInProto</a></div><div class="ttdeci">void FillDomainInProto(const Domain &domain, ProtoWithDomain *proto)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__utils_8h_source.html#l00093">cp_model_utils.h:93</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_acdbc8ad33149d45a6e6fcd8b72fd68ed"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">operations_research::sat::PositiveRef</a></div><div class="ttdeci">int PositiveRef(int ref)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__utils_8h_source.html#l00035">cp_model_utils.h:35</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_acf5b1cbffc494f14e8b87c672d5dda5f"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#acf5b1cbffc494f14e8b87c672d5dda5f">operations_research::sat::ConstraintCaseName</a></div><div class="ttdeci">std::string ConstraintCaseName(ConstraintProto::ConstraintCase constraint_case)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__utils_8cc_source.html#l00403">cp_model_utils.cc:403</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ae0803b8198728cd4f6e58498d9c60091"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae0803b8198728cd4f6e58498d9c60091">operations_research::sat::NegatedRef</a></div><div class="ttdeci">int NegatedRef(int ref)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__utils_8h_source.html#l00034">cp_model_utils.h:34</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ae4be5fcdd40601e7d3862a5c9ab06915"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae4be5fcdd40601e7d3862a5c9ab06915">operations_research::sat::BasicOrbitopeExtraction</a></div><div class="ttdeci">std::vector< std::vector< int > > BasicOrbitopeExtraction(const std::vector< std::unique_ptr< SparsePermutation >> &generators)</div><div class="ttdef"><b>Definition:</b> <a href="symmetry__util_8cc_source.html#l00023">symmetry_util.cc:23</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ae75c184235d68cd4b3019cfba09b764d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae75c184235d68cd4b3019cfba09b764d">operations_research::sat::GetOrbits</a></div><div class="ttdeci">std::vector< int > GetOrbits(int n, const std::vector< std::unique_ptr< SparsePermutation >> &generators)</div><div class="ttdef"><b>Definition:</b> <a href="symmetry__util_8cc_source.html#l00146">symmetry_util.cc:146</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceutil__hash_html_a17715af1c1bc575a706eb167371b81e9"><div class="ttname"><a href="namespaceutil__hash.html#a17715af1c1bc575a706eb167371b81e9">util_hash::Hash</a></div><div class="ttdeci">uint64_t Hash(uint64_t num, uint64_t c)</div><div class="ttdef"><b>Definition:</b> <a href="hash_8h_source.html#l00150">hash.h:150</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_html_a2f76166dbe0c4055a1f256235ad00478"><div class="ttname"><a href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">util::Graph</a></div><div class="ttdeci">ListGraph Graph</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02361">graph.h:2361</a></div></div>
|
|
<div class="ttc" id="aoptimization_8cc_html_af63dcc00f2023fdf498e0829e6fb8a6b"><div class="ttname"><a href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a></div><div class="ttdeci">Literal literal</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00085">optimization.cc:85</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_afca32f65388659a4b0956496169488b4"><div class="ttname"><a href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a></div><div class="ttdeci">int64_t head</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00150">routing_flow.cc:150</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_affine_relation_1_1_relation_html"><div class="ttname"><a href="structoperations__research_1_1_affine_relation_1_1_relation.html">operations_research::AffineRelation::Relation</a></div><div class="ttdef"><b>Definition:</b> <a href="affine__relation_8h_source.html#l00076">affine_relation.h:76</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_affine_relation_1_1_relation_html_a537e59662a0751edfbbd2a0079a794b4"><div class="ttname"><a href="structoperations__research_1_1_affine_relation_1_1_relation.html#a537e59662a0751edfbbd2a0079a794b4">operations_research::AffineRelation::Relation::coeff</a></div><div class="ttdeci">int64_t coeff</div><div class="ttdef"><b>Definition:</b> <a href="affine__relation_8h_source.html#l00078">affine_relation.h:78</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_affine_relation_1_1_relation_html_ae25fb5067bd6b3b1b319efc61685a98f"><div class="ttname"><a href="structoperations__research_1_1_affine_relation_1_1_relation.html#ae25fb5067bd6b3b1b319efc61685a98f">operations_research::AffineRelation::Relation::offset</a></div><div class="ttdeci">int64_t offset</div><div class="ttdef"><b>Definition:</b> <a href="affine__relation_8h_source.html#l00079">affine_relation.h:79</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_affine_relation_1_1_relation_html_af5eb1e0745f18d589b9c552215bef515"><div class="ttname"><a href="structoperations__research_1_1_affine_relation_1_1_relation.html#af5eb1e0745f18d589b9c552215bef515">operations_research::AffineRelation::Relation::representative</a></div><div class="ttdeci">int representative</div><div class="ttdef"><b>Definition:</b> <a href="affine__relation_8h_source.html#l00077">affine_relation.h:77</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_sparse_permutation_1_1_iterator_html_a8497b34029ee966694083aa34c9022b5"><div class="ttname"><a href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a8497b34029ee966694083aa34c9022b5">operations_research::SparsePermutation::Iterator::begin</a></div><div class="ttdeci">std::vector< int >::const_iterator begin() const</div><div class="ttdef"><b>Definition:</b> <a href="sparse__permutation_8h_source.html#l00109">sparse_permutation.h:109</a></div></div>
|
|
<div class="ttc" id="asymmetry__util_8h_html"><div class="ttname"><a href="symmetry__util_8h.html">symmetry_util.h</a></div></div>
|
|
<div class="ttc" id="autil_2logging_8h_html_a5f67b653dd99ddbe5e3367e3b4b7b532"><div class="ttname"><a href="util_2logging_8h.html#a5f67b653dd99ddbe5e3367e3b4b7b532">SOLVER_LOG</a></div><div class="ttdeci">#define SOLVER_LOG(logger,...)</div><div class="ttdef"><b>Definition:</b> <a href="util_2logging_8h_source.html#l00063">util/logging.h:63</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="cp__model__symmetries_8cc.html">cp_model_symmetries.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|