299 lines
366 KiB
HTML
299 lines
366 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.15"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: cp_model_lns.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>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('cp__model__lns_8cc_source.html','');});
|
|
/* @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_lns.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="cp__model__lns_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__lns_8h.html">ortools/sat/cp_model_lns.h</a>"</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <algorithm></span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <cstdint></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <limits></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <numeric></span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> </div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "absl/synchronization/mutex.h"</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="cp__model_8pb_8h.html">ortools/sat/cp_model.pb.h</a>"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="cp__model__mapping_8h.html">ortools/sat/cp_model_mapping.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="integer_8h.html">ortools/sat/integer.h</a>"</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="linear__programming__constraint_8h.html">ortools/sat/linear_programming_constraint.h</a>"</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="rins_8h.html">ortools/sat/rins.h</a>"</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="synchronization_8h.html">ortools/sat/synchronization.h</a>"</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.h</a>"</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="keyword">namespace </span>sat {</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div><div class="line"><a name="l00036"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a08c018489eb0c4c309f144780ebb8cce"> 36</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a08c018489eb0c4c309f144780ebb8cce">NeighborhoodGeneratorHelper::NeighborhoodGeneratorHelper</a>(</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html">CpModelProto</a> <span class="keyword">const</span>* <a class="code" href="cp__model__solver_8cc.html#a6ac76d8a372013f67c4973012948ec84">model_proto</a>, <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a> <span class="keyword">const</span>* <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>,</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <a class="code" href="classoperations__research_1_1sat_1_1_shared_response_manager.html">SharedResponseManager</a>* shared_response, <a class="code" href="classoperations__research_1_1_shared_time_limit.html">SharedTimeLimit</a>* shared_time_limit,</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <a class="code" href="classoperations__research_1_1sat_1_1_shared_bounds_manager.html">SharedBoundsManager</a>* shared_bounds)</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html">SubSolver</a>(<span class="stringliteral">""</span>),</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  parameters_(*<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>),</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  model_proto_(*<a class="code" href="cp__model__solver_8cc.html#a6ac76d8a372013f67c4973012948ec84">model_proto</a>),</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  shared_time_limit_(shared_time_limit),</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  shared_bounds_(shared_bounds),</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  shared_response_(shared_response) {</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(shared_response_ != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">if</span> (shared_bounds_ != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  shared_bounds_id_ = shared_bounds_-><a class="code" href="classoperations__research_1_1sat_1_1_shared_bounds_manager.html#af90af356f66a9a677d8d76be3fdd7356">RegisterNewId</a>();</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  }</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  *model_proto_with_only_variables_.mutable_variables() =</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  model_proto_.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#a6a4544ca20489d70e302f5d6d374a012">variables</a>();</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  InitializeHelperData();</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  RecomputeHelperData();</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#afa21407ae134806ac4337d0b2473b210">Synchronize</a>();</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> }</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> </div><div class="line"><a name="l00057"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#afa21407ae134806ac4337d0b2473b210"> 57</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#afa21407ae134806ac4337d0b2473b210">NeighborhoodGeneratorHelper::Synchronize</a>() {</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordflow">if</span> (shared_bounds_ != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  std::vector<int> model_variables;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  std::vector<int64_t> new_lower_bounds;</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  std::vector<int64_t> new_upper_bounds;</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  shared_bounds_-><a class="code" href="classoperations__research_1_1sat_1_1_shared_bounds_manager.html#afcfefe147ae58ecfb365be6edf3d1821">GetChangedBounds</a>(shared_bounds_id_, &model_variables,</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  &new_lower_bounds, &new_upper_bounds);</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordtype">bool</span> new_variables_have_been_fixed = <span class="keyword">false</span>;</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  {</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  absl::MutexLock domain_lock(&domain_mutex_);</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> </div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < model_variables.size(); ++i) {</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = model_variables[i];</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keyword">const</span> int64_t new_lb = new_lower_bounds[i];</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keyword">const</span> int64_t new_ub = new_upper_bounds[i];</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">if</span> (<a class="code" href="vlog__is__on_8h.html#a956152cad330225654d128f35c00efce">VLOG_IS_ON</a>(3)) {</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& domain =</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  model_proto_with_only_variables_.variables(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).domain();</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keyword">const</span> int64_t old_lb = domain.Get(0);</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">const</span> int64_t old_ub = domain.Get(domain.size() - 1);</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) << <span class="stringliteral">"Variable: "</span> << <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> << <span class="stringliteral">" old domain: ["</span> << old_lb << <span class="stringliteral">", "</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  << old_ub << <span class="stringliteral">"] new domain: ["</span> << new_lb << <span class="stringliteral">", "</span> << new_ub</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  << <span class="stringliteral">"]"</span>;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  }</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_domain.html">Domain</a> old_domain = <a class="code" href="namespaceoperations__research_1_1sat.html#ab1240060466ba48a36a4b36379bce26a">ReadDomainFromProto</a>(</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  model_proto_with_only_variables_.variables(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_domain.html">Domain</a> new_domain =</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  old_domain.<a class="code" href="classoperations__research_1_1_domain.html#a835826c4c5129b74553042a357a721ff">IntersectionWith</a>(<a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(new_lb, new_ub));</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">if</span> (new_domain.IsEmpty()) {</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// This can mean two things:</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="comment">// 1/ This variable is a normal one and the problem is UNSAT or</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// 2/ This variable is optional, and its associated literal must be</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// set to false.</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">//</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// Currently, we wait for any full solver to pick the crossing bounds</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// and do the correct stuff on their own. We do not want to have empty</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// domain in the proto as this would means INFEASIBLE. So we just</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="comment">// ignore such bounds here.</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">//</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">// TODO(user): We could set the optional literal to false directly in</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// the bound sharing manager. We do have to be careful that all the</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// different solvers have the same optionality definition though.</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  }</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a901c19b12842f8af153e588a689a90b5">FillDomainInProto</a>(</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  new_domain,</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  model_proto_with_only_variables_.mutable_variables(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  new_variables_have_been_fixed |= new_domain.IsFixed();</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  }</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  }</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> </div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="comment">// Only trigger the computation if needed.</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">if</span> (new_variables_have_been_fixed) {</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  RecomputeHelperData();</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  }</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> }</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="keywordtype">void</span> NeighborhoodGeneratorHelper::InitializeHelperData() {</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  type_to_constraints_.clear();</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_constraints = model_proto_.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#aeaf0da781ca9b370d96b7fbd3f74266a">constraints_size</a>();</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> c = 0; c < num_constraints; ++c) {</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> type = model_proto_.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">constraints</a>(c).<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#a5f9869899e2c94786f9709684f1ecc56">constraint_case</a>();</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">if</span> (type >= type_to_constraints_.size()) {</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  type_to_constraints_.resize(type + 1);</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  }</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  type_to_constraints_[type].push_back(c);</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  }</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> }</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> </div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="keywordtype">void</span> NeighborhoodGeneratorHelper::RecomputeHelperData() {</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="comment">// Recompute all the data in case new variables have been fixed.</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="comment">//</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="comment">// TODO(user): Ideally we should ignore trivially true/false constraint, but</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="comment">// this will duplicate already existing code :-( we should probably still do</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="comment">// at least enforcement literal and clauses? We could maybe run a light</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="comment">// presolve?</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  absl::MutexLock graph_lock(&<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>);</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  absl::ReaderMutexLock domain_lock(&domain_mutex_);</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  var_to_constraint_.assign(model_proto_.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#abef5f55c3278c137faca92b8e433f8ea">variables_size</a>(), {});</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  constraint_to_var_.assign(model_proto_.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#aeaf0da781ca9b370d96b7fbd3f74266a">constraints_size</a>(), {});</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> </div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ct_index = 0; ct_index < model_proto_.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#aeaf0da781ca9b370d96b7fbd3f74266a">constraints_size</a>();</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  ++ct_index) {</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</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> : <a class="code" href="namespaceoperations__research_1_1sat.html#a1d467595ed8fe5b85dc95328ee1c2770">UsedVariables</a>(model_proto_.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">constraints</a>(ct_index))) {</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</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="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">if</span> (IsConstant(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  var_to_constraint_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>].push_back(ct_index);</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  constraint_to_var_[ct_index].push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  }</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> </div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="comment">// We replace intervals by their underlying integer variables.</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">if</span> (parameters_.<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#aa16dc12c038fa24777852746e00fbc1b">lns_expand_intervals_in_constraint_graph</a>()) {</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> :</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a217ba4c51953c701a68d6572d79801f1">UsedIntervals</a>(model_proto_.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">constraints</a>(ct_index))) {</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</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> :</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a1d467595ed8fe5b85dc95328ee1c2770">UsedVariables</a>(model_proto_.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">constraints</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>))) {</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</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="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">if</span> (IsConstant(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  var_to_constraint_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>].push_back(ct_index);</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  constraint_to_var_[ct_index].push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  }</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>  }</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  }</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> </div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  active_variables_.clear();</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  active_variables_set_.assign(model_proto_.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#abef5f55c3278c137faca92b8e433f8ea">variables_size</a>(), <span class="keyword">false</span>);</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>  <span class="keywordflow">if</span> (parameters_.<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a1d7359b01bafc8348537c5501fd29e8d">lns_focus_on_decision_variables</a>()) {</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& search_strategy : model_proto_.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#a6e5a7240e89f8a6665de1da5554603ec">search_strategy</a>()) {</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</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> : search_strategy.variables()) {</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> pos_var = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">if</span> (!active_variables_set_[pos_var] && !IsConstant(pos_var)) {</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  active_variables_set_[pos_var] = <span class="keyword">true</span>;</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  active_variables_.push_back(pos_var);</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>  }</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  }</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> </div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="comment">// Revert to no focus if active_variables_ is empty().</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordflow">if</span> (!active_variables_.empty()) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  }</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="comment">// Add all non-constant variables.</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < model_proto_.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#abef5f55c3278c137faca92b8e433f8ea">variables_size</a>(); ++i) {</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">if</span> (!IsConstant(i)) {</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  active_variables_.push_back(i);</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  active_variables_set_[i] = <span class="keyword">true</span>;</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  }</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  }</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> }</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> </div><div class="line"><a name="l00193"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#abefd04794ae1f2f60e1fbf1938b8f262"> 193</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#abefd04794ae1f2f60e1fbf1938b8f262">NeighborhoodGeneratorHelper::IsActive</a>(<span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)<span class="keyword"> const </span>{</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">return</span> active_variables_set_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>];</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> }</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> </div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="keywordtype">bool</span> NeighborhoodGeneratorHelper::IsConstant(<span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)<span class="keyword"> const </span>{</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">return</span> model_proto_with_only_variables_.variables(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).domain_size() == 2 &&</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  model_proto_with_only_variables_.variables(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).domain(0) ==</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  model_proto_with_only_variables_.variables(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).domain(1);</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> }</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> </div><div class="line"><a name="l00203"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a722dba5a22f807fafa782b85eda60ba7"> 203</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a722dba5a22f807fafa782b85eda60ba7">NeighborhoodGeneratorHelper::CopyAndFixVariables</a>(</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html">CpModelProto</a>& source_model,</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">const</span> absl::flat_hash_set<int>& fixed_variables_set,</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution,</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html">CpModelProto</a>* output_model)<span class="keyword"> const </span>{</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  output_model-><a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#ab9746c6070379e1990d2fd2da7586398">mutable_variables</a>()-><a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#aa0d2b6ddea7cb960b90423ac48f555bf">Clear</a>();</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  output_model-><a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#ab9746c6070379e1990d2fd2da7586398">mutable_variables</a>()->Reserve(source_model.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#abef5f55c3278c137faca92b8e433f8ea">variables_size</a>());</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < source_model.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#abef5f55c3278c137faca92b8e433f8ea">variables_size</a>(); ++i) {</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html">IntegerVariableProto</a>* var_proto = output_model-><a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#ad03d1e2f94c4ca4c8004ac5355e6504a">add_variables</a>();</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html">IntegerVariableProto</a>& source_var_proto = source_model.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#a6a4544ca20489d70e302f5d6d374a012">variables</a>(i);</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="comment">// We only copy the variable names in debug mode.</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a> && !source_var_proto.<a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#a24dcbf29c0d6cd766009a182a6484e3b">name</a>().empty()) {</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  var_proto-><a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#a74f7eb449a6e182b73c8b4a1dbf15ce6">set_name</a>(source_var_proto.<a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#a24dcbf29c0d6cd766009a182a6484e3b">name</a>());</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  }</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">if</span> (fixed_variables_set.contains(i)) {</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = initial_solution.<a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html#ac6155ed23d1f37fa4f6b4fc666220723">solution</a>(i);</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research_1_1sat.html#a46540a899ab5e8fe1b55e12da55cbbe0">DomainInProtoContains</a>(source_model.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#a6a4544ca20489d70e302f5d6d374a012">variables</a>(i), <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>)) {</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  }</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  var_proto-><a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#a2266c77ad6db8de45560357c1436e558">add_domain</a>(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  var_proto-><a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#a2266c77ad6db8de45560357c1436e558">add_domain</a>(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  *var_proto-><a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#ae59a4dda240698b8ade8c726cc4f9974">mutable_domain</a>() = source_var_proto.<a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#aa9cb4e4ba977c364365487c63ed32446">domain</a>();</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  }</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  }</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> }</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> </div><div class="line"><a name="l00231"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a15cb168917371b5fb2d17b00e640de63"> 231</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a15cb168917371b5fb2d17b00e640de63">NeighborhoodGeneratorHelper::FullNeighborhood</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> neighborhood;</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a8e672808c179f95cf4c626aef798bbc7">is_reduced</a> = <span class="keyword">false</span>;</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a04d448b3000c058b67ad17541473a317">is_generated</a> = <span class="keyword">true</span>;</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  {</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  absl::ReaderMutexLock lock(&domain_mutex_);</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  *neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411">delta</a>.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#ab9746c6070379e1990d2fd2da7586398">mutable_variables</a>() =</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  model_proto_with_only_variables_.variables();</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">return</span> neighborhood;</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> </div><div class="line"><a name="l00243"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a8b0ea5233e98dcd85233c074a034fd05"> 243</a></span> std::vector<int> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a8b0ea5233e98dcd85233c074a034fd05">NeighborhoodGeneratorHelper::GetActiveIntervals</a>(</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution)<span class="keyword"> const </span>{</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  std::vector<int> active_intervals;</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  absl::ReaderMutexLock lock(&domain_mutex_);</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> i : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6aef4ca16709a75231ee1691c306c641">TypeToConstraints</a>(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a1b948ef604eecbb4da42feb6bed2beff">ConstraintProto::kInterval</a>)) {</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>& interval_ct = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">constraints</a>(i);</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="comment">// We only look at intervals that are performed in the solution. The</span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="comment">// unperformed intervals should be automatically freed during the generation</span></div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="comment">// phase.</span></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordflow">if</span> (interval_ct.<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#acdc90a25e531e4180c495f4ecf2aca2e">enforcement_literal</a>().size() == 1) {</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> enforcement_ref = interval_ct.<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#acdc90a25e531e4180c495f4ecf2aca2e">enforcement_literal</a>(0);</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> enforcement_var = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(enforcement_ref);</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = initial_solution.<a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html#ac6155ed23d1f37fa4f6b4fc666220723">solution</a>(enforcement_var);</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(enforcement_ref) == (<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> == 0)) {</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  }</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  }</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="comment">// We filter out fixed intervals. Because of presolve, if there is an</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="comment">// enforcement literal, it cannot be fixed.</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">if</span> (interval_ct.<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#acdc90a25e531e4180c495f4ecf2aca2e">enforcement_literal</a>().empty()) {</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">if</span> (interval_ct.<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#a2ec4b0b15e694caaaa842243694c51f5">interval</a>().<a class="code" href="classoperations__research_1_1sat_1_1_interval_constraint_proto.html#a50942b0c0a4615d9cc1a905f0aaeb514">has_start_view</a>()) {</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordtype">bool</span> is_constant = <span class="keyword">true</span>;</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> v : interval_ct.<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#a2ec4b0b15e694caaaa842243694c51f5">interval</a>().<a class="code" href="classoperations__research_1_1sat_1_1_interval_constraint_proto.html#aa6b928bcc0ba7e13564d1f18367a03a9">start_view</a>().<a class="code" href="classoperations__research_1_1sat_1_1_linear_expression_proto.html#ac7a72ff7bd5bde08ba00f944c5aa3168">vars</a>()) {</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordflow">if</span> (!IsConstant(v)) {</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  is_constant = <span class="keyword">false</span>;</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  }</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  }</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> v : interval_ct.<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#a2ec4b0b15e694caaaa842243694c51f5">interval</a>().<a class="code" href="classoperations__research_1_1sat_1_1_interval_constraint_proto.html#a3d116cacd05c4c363803a0cecf4b35d3">size_view</a>().<a class="code" href="classoperations__research_1_1sat_1_1_linear_expression_proto.html#ac7a72ff7bd5bde08ba00f944c5aa3168">vars</a>()) {</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordflow">if</span> (!IsConstant(v)) {</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  is_constant = <span class="keyword">false</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>  }</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> v : interval_ct.<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#a2ec4b0b15e694caaaa842243694c51f5">interval</a>().<a class="code" href="classoperations__research_1_1sat_1_1_interval_constraint_proto.html#aed31a3b1b4ed0e3de8d3c15228c624c1">end_view</a>().<a class="code" href="classoperations__research_1_1sat_1_1_linear_expression_proto.html#ac7a72ff7bd5bde08ba00f944c5aa3168">vars</a>()) {</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">if</span> (!IsConstant(v)) {</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  is_constant = <span class="keyword">false</span>;</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  }</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  }</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordflow">if</span> (is_constant) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">if</span> (IsConstant(<a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(interval_ct.<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#a2ec4b0b15e694caaaa842243694c51f5">interval</a>().<a class="code" href="classoperations__research_1_1sat_1_1_interval_constraint_proto.html#aca5b15bc6ed70bb8769763d76312975d">start</a>())) &&</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  IsConstant(<a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(interval_ct.<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#a2ec4b0b15e694caaaa842243694c51f5">interval</a>().<a class="code" href="classoperations__research_1_1sat_1_1_interval_constraint_proto.html#a747f67b6d84b5800f31043239e5a0ad0">size</a>())) &&</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  IsConstant(<a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(interval_ct.<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#a2ec4b0b15e694caaaa842243694c51f5">interval</a>().<a class="code" href="classoperations__research_1_1sat_1_1_interval_constraint_proto.html#a06944f2c8dd7c5c5715ad2c39ea92ea9">end</a>()))) {</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  }</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  }</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  }</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> </div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  active_intervals.push_back(i);</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">return</span> active_intervals;</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> }</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span> </div><div class="line"><a name="l00299"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#aff6e1cdbf44ac50c3dcc0e5bb3591478"> 299</a></span> std::vector<std::vector<int>> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#aff6e1cdbf44ac50c3dcc0e5bb3591478">NeighborhoodGeneratorHelper::GetRoutingPaths</a>(</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution)<span class="keyword"> const </span>{</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keyword">struct </span>HeadAndArcLiteral {</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordtype">int</span> <a class="code" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a>;</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordtype">int</span> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>;</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  };</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span> </div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  std::vector<std::vector<int>> result;</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  absl::flat_hash_map<int, HeadAndArcLiteral> tail_to_head_and_arc_literal;</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="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> i : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6aef4ca16709a75231ee1691c306c641">TypeToConstraints</a>(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a7da0520a1741193fc2422811d6af7ace">ConstraintProto::kCircuit</a>)) {</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_circuit_constraint_proto.html">CircuitConstraintProto</a>& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">constraints</a>(i).<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#a1b9ecd55294987444aff02290740f25e">circuit</a>();</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> </div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="comment">// Collect arcs.</span></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordtype">int</span> min_node = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int>::max</a>();</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  tail_to_head_and_arc_literal.clear();</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.literals_size(); ++i) {</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.literals(i);</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a> = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.heads(i);</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a> = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.tails(i);</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> bool_var = <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="l00320"></a><span class="lineno"> 320</span>  <span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = initial_solution.<a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html#ac6155ed23d1f37fa4f6b4fc666220723">solution</a>(bool_var);</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="comment">// Skip unselected arcs.</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</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>) == (<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> == 0)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="comment">// Ignore self loops.</span></div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keywordflow">if</span> (<a class="code" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a> == <a class="code" href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a>) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  tail_to_head_and_arc_literal[<a class="code" href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a>] = {<a class="code" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a>, bool_var};</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  min_node = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(<a class="code" href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a>, min_node);</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  }</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">if</span> (tail_to_head_and_arc_literal.empty()) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> </div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="comment">// Unroll the path.</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordtype">int</span> current_node = min_node;</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  std::vector<int> path;</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">do</span> {</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keyword">auto</span> it = tail_to_head_and_arc_literal.find(current_node);</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(it != tail_to_head_and_arc_literal.end());</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  current_node = it->second.head;</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  path.push_back(it->second.literal);</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  } <span class="keywordflow">while</span> (current_node != min_node);</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  result.push_back(std::move(path));</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</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>  std::vector<HeadAndArcLiteral> route_starts;</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> i : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6aef4ca16709a75231ee1691c306c641">TypeToConstraints</a>(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a88da6de97c8b4c4ce52616e0516b252a">ConstraintProto::kRoutes</a>)) {</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_routes_constraint_proto.html">RoutesConstraintProto</a>& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">constraints</a>(i).<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ab9cb91893e59295e6a830766d4e4f3c7">routes</a>();</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  tail_to_head_and_arc_literal.clear();</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  route_starts.clear();</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> </div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="comment">// Collect route starts and arcs.</span></div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.literals_size(); ++i) {</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.literals(i);</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a> = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.heads(i);</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a> = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.tails(i);</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> bool_var = <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="l00354"></a><span class="lineno"> 354</span>  <span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = initial_solution.<a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html#ac6155ed23d1f37fa4f6b4fc666220723">solution</a>(bool_var);</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="comment">// Skip unselected arcs.</span></div><div class="line"><a name="l00356"></a><span class="lineno"> 356</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>) == (<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> == 0)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="comment">// Ignore self loops.</span></div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordflow">if</span> (<a class="code" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a> == <a class="code" href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a>) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordflow">if</span> (<a class="code" href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a> == 0) {</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  route_starts.push_back({<a class="code" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a>, bool_var});</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  tail_to_head_and_arc_literal[<a class="code" href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a>] = {<a class="code" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a>, bool_var};</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  }</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  }</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span> </div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="comment">// Unroll all routes.</span></div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> HeadAndArcLiteral& head_var : route_starts) {</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  std::vector<int> path;</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordtype">int</span> current_node = head_var.head;</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  path.push_back(head_var.literal);</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keywordflow">do</span> {</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keyword">auto</span> it = tail_to_head_and_arc_literal.find(current_node);</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(it != tail_to_head_and_arc_literal.end());</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  current_node = it->second.head;</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  path.push_back(it->second.literal);</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  } <span class="keywordflow">while</span> (current_node != 0);</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  result.push_back(std::move(path));</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  }</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  }</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> </div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keywordflow">return</span> result;</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> </div><div class="line"><a name="l00384"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6cadaaf04201fe155b3eda7da2f63874"> 384</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6cadaaf04201fe155b3eda7da2f63874">NeighborhoodGeneratorHelper::FixGivenVariables</a>(</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution,</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keyword">const</span> absl::flat_hash_set<int>& variables_to_fix)<span class="keyword"> const </span>{</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> neighborhood;</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> </div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordtype">bool</span> copy_is_successful = <span class="keyword">true</span>;</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  {</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  absl::ReaderMutexLock domain_lock(&domain_mutex_);</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  copy_is_successful =</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a722dba5a22f807fafa782b85eda60ba7">CopyAndFixVariables</a>(model_proto_with_only_variables_, variables_to_fix,</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  initial_solution, &neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411">delta</a>);</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  }</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> </div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">if</span> (!copy_is_successful) {</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a8e672808c179f95cf4c626aef798bbc7">is_reduced</a> = <span class="keyword">true</span>;</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a04d448b3000c058b67ad17541473a317">is_generated</a> = <span class="keyword">false</span>;</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">return</span> neighborhood;</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  }</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span> </div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ac18c0fe53e351d0a5d105b8bc7d53c08">AddSolutionHinting</a>(initial_solution, &neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411">delta</a>);</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> </div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a04d448b3000c058b67ad17541473a317">is_generated</a> = <span class="keyword">true</span>;</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a8e672808c179f95cf4c626aef798bbc7">is_reduced</a> = !variables_to_fix.empty();</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="comment">// TODO(user): force better objective? Note that this is already done when the</span></div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="comment">// hint above is successfully loaded (i.e. if it passes the presolve</span></div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="comment">// correctly) since the solver will try to find better solution than the</span></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="comment">// current one.</span></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">return</span> neighborhood;</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> }</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> </div><div class="line"><a name="l00414"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ac18c0fe53e351d0a5d105b8bc7d53c08"> 414</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ac18c0fe53e351d0a5d105b8bc7d53c08">NeighborhoodGeneratorHelper::AddSolutionHinting</a>(</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution, <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html">CpModelProto</a>* <a class="code" href="cp__model__solver_8cc.html#a6ac76d8a372013f67c4973012948ec84">model_proto</a>)<span class="keyword"> const </span>{</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="comment">// Set the current solution as a hint.</span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <a class="code" href="cp__model__solver_8cc.html#a6ac76d8a372013f67c4973012948ec84">model_proto</a>->clear_solution_hint();</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keyword">const</span> <span class="keyword">auto</span> is_fixed = [<a class="code" href="cp__model__solver_8cc.html#a6ac76d8a372013f67c4973012948ec84">model_proto</a>](<span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html">IntegerVariableProto</a>& var_proto = <a class="code" href="cp__model__solver_8cc.html#a6ac76d8a372013f67c4973012948ec84">model_proto</a>->variables(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keywordflow">return</span> var_proto.<a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#a0cf3e2ef19d1e580d07b8c50d95cfa1e">domain_size</a>() == 2 &&</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  var_proto.<a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#aa9cb4e4ba977c364365487c63ed32446">domain</a>(0) == var_proto.<a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#aa9cb4e4ba977c364365487c63ed32446">domain</a>(1);</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  };</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</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> < <a class="code" href="cp__model__solver_8cc.html#a6ac76d8a372013f67c4973012948ec84">model_proto</a>->variables_size(); ++<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">if</span> (is_fixed(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> </div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <a class="code" href="cp__model__solver_8cc.html#a6ac76d8a372013f67c4973012948ec84">model_proto</a>->mutable_solution_hint()->add_vars(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <a class="code" href="cp__model__solver_8cc.html#a6ac76d8a372013f67c4973012948ec84">model_proto</a>->mutable_solution_hint()->add_values(</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  initial_solution.<a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html#ac6155ed23d1f37fa4f6b4fc666220723">solution</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  }</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> }</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> </div><div class="line"><a name="l00432"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ac0763b7b9e44b9b30e78b9dd4da8e98a"> 432</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ac0763b7b9e44b9b30e78b9dd4da8e98a">NeighborhoodGeneratorHelper::RemoveMarkedConstraints</a>(</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="keyword">const</span> std::vector<int>& constraints_to_remove)<span class="keyword"> const </span>{</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> neighborhood = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a15cb168917371b5fb2d17b00e640de63">FullNeighborhood</a>();</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span> </div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordflow">if</span> (constraints_to_remove.empty()) <span class="keywordflow">return</span> neighborhood;</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a8e672808c179f95cf4c626aef798bbc7">is_reduced</a> = <span class="keyword">false</span>;</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a44b6866eda48febe9f81e0a941caf8ce">constraints_to_ignore</a> = constraints_to_remove;</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordflow">return</span> neighborhood;</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> }</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> </div><div class="line"><a name="l00442"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a8735c6fd1459361aa6696a77f8042bf1"> 442</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a8735c6fd1459361aa6696a77f8042bf1">NeighborhoodGeneratorHelper::RelaxGivenVariables</a>(</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution,</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keyword">const</span> std::vector<int>& relaxed_variables)<span class="keyword"> const </span>{</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  std::vector<bool> relaxed_variables_set(model_proto_.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#abef5f55c3278c137faca92b8e433f8ea">variables_size</a>(), <span class="keyword">false</span>);</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</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> : relaxed_variables) relaxed_variables_set[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = <span class="keyword">true</span>;</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  absl::flat_hash_set<int> fixed_variables;</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  {</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  absl::ReaderMutexLock graph_lock(&<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>);</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> i : active_variables_) {</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keywordflow">if</span> (!relaxed_variables_set[i]) {</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  fixed_variables.insert(i);</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"> 456</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6cadaaf04201fe155b3eda7da2f63874">FixGivenVariables</a>(initial_solution, fixed_variables);</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span> }</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span> </div><div class="line"><a name="l00459"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a307d968091a3bddbbce257cca9b79fbb"> 459</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a307d968091a3bddbbce257cca9b79fbb">NeighborhoodGeneratorHelper::FixAllVariables</a>(</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution)<span class="keyword"> const </span>{</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keyword">const</span> std::vector<int>& all_variables = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a1e4ba9b4d3bb23e61c0733c71925649a">ActiveVariables</a>();</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keyword">const</span> absl::flat_hash_set<int> fixed_variables(all_variables.begin(),</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  all_variables.end());</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6cadaaf04201fe155b3eda7da2f63874">FixGivenVariables</a>(initial_solution, fixed_variables);</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> </div><div class="line"><a name="l00467"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a34c45a33de4f8a713e99bbf97d8d08d6"> 467</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a34c45a33de4f8a713e99bbf97d8d08d6">NeighborhoodGenerator::ReadyToGenerate</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keywordflow">return</span> (<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a0e31a4150ae965379d0f05d51a0c1673">shared_response</a>().<a class="code" href="classoperations__research_1_1sat_1_1_shared_response_manager.html#a45cf335a09cbaae1337a45d7978d8892">SolutionsRepository</a>().<a class="code" href="classoperations__research_1_1sat_1_1_shared_solution_repository.html#a6d2b6f7951b60c786fdbefcbe7c3571f">NumSolutions</a>() > 0);</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span> }</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span> </div><div class="line"><a name="l00471"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a46765aa4aca21ce795a7291b85ca7719"> 471</a></span> <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a46765aa4aca21ce795a7291b85ca7719">NeighborhoodGenerator::GetUCBScore</a>(int64_t total_num_calls)<span class="keyword"> const </span>{</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  absl::ReaderMutexLock mutex_lock(&<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a1485e729f641f9670e3f827e5f60d56c">generator_mutex_</a>);</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(total_num_calls, num_calls_);</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keywordflow">if</span> (num_calls_ <= 10) <span class="keywordflow">return</span> std::numeric_limits<double>::infinity();</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keywordflow">return</span> current_average_ + sqrt((2 * log(total_num_calls)) / num_calls_);</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"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a9ca5b99b3550503ca7bad8418e133156"> 478</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a9ca5b99b3550503ca7bad8418e133156">NeighborhoodGenerator::Synchronize</a>() {</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  absl::MutexLock mutex_lock(&<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a1485e729f641f9670e3f827e5f60d56c">generator_mutex_</a>);</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span> </div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="comment">// To make the whole update process deterministic, we currently sort the</span></div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="comment">// SolveData.</span></div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  std::sort(solve_data_.begin(), solve_data_.end());</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span> </div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="comment">// This will be used to update the difficulty of this neighborhood.</span></div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="keywordtype">int</span> num_fully_solved_in_batch = 0;</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="keywordtype">int</span> num_not_fully_solved_in_batch = 0;</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>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html">SolveData</a>& data : solve_data_) {</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#ac497558c5257914ba8ffdc4e95e59c21">AdditionalProcessingOnSynchronize</a>(data);</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  ++num_calls_;</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span> </div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="comment">// INFEASIBLE or OPTIMAL means that we "fully solved" the local problem.</span></div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="comment">// If we didn't, then we cannot be sure that there is no improving solution</span></div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="comment">// in that neighborhood.</span></div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordflow">if</span> (data.status == <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">CpSolverStatus::INFEASIBLE</a> ||</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  data.status == <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">CpSolverStatus::OPTIMAL</a>) {</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  ++num_fully_solved_calls_;</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  ++num_fully_solved_in_batch;</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  ++num_not_fully_solved_in_batch;</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  }</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span> </div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="comment">// It seems to make more sense to compare the new objective to the base</span></div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="comment">// solution objective, not the best one. However this causes issue in the</span></div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="comment">// logic below because on some problems the neighborhood can always lead</span></div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="comment">// to a better "new objective" if the base solution wasn't the best one.</span></div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="comment">//</span></div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="comment">// This might not be a final solution, but it does work ok for now.</span></div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keyword">const</span> IntegerValue best_objective_improvement =</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a0c8b86bd60b4fc70cb653a12d50c2ce8">IsRelaxationGenerator</a>()</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  ? IntegerValue(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(data.new_objective_bound.value(),</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  data.initial_best_objective_bound.value()))</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  : IntegerValue(<a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(data.initial_best_objective.value(),</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  data.new_objective.value()));</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keywordflow">if</span> (best_objective_improvement > 0) {</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  num_consecutive_non_improving_calls_ = 0;</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  ++num_consecutive_non_improving_calls_;</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  }</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span> </div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="comment">// TODO(user): Weight more recent data.</span></div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="comment">// degrade the current average to forget old learnings.</span></div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> gain_per_time_unit =</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(0.0, static_cast<double>(best_objective_improvement.value())) /</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  (1.0 + data.deterministic_time);</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordflow">if</span> (num_calls_ <= 100) {</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  current_average_ += (gain_per_time_unit - current_average_) / num_calls_;</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  current_average_ = 0.9 * current_average_ + 0.1 * gain_per_time_unit;</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  }</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span> </div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  deterministic_time_ += data.deterministic_time;</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  }</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span> </div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="comment">// Update the difficulty.</span></div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  difficulty_.<a class="code" href="classoperations__research_1_1_adaptive_parameter_value.html#af9bf551154d37f48132472bd0f6dd848">Update</a>(<span class="comment">/*num_decreases=*/</span>num_not_fully_solved_in_batch,</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="comment">/*num_increases=*/</span>num_fully_solved_in_batch);</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> </div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="comment">// Bump the time limit if we saw no better solution in the last few calls.</span></div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="comment">// This means that as the search progress, we likely spend more and more time</span></div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="comment">// trying to solve individual neighborhood.</span></div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="comment">//</span></div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="comment">// TODO(user): experiment with resetting the time limit if a solution is</span></div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="comment">// found.</span></div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordflow">if</span> (num_consecutive_non_improving_calls_ > 50) {</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  num_consecutive_non_improving_calls_ = 0;</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  deterministic_limit_ *= 1.02;</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span> </div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="comment">// We do not want the limit to go to high. Intuitively, the goal is to try</span></div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="comment">// out a lot of neighborhoods, not just spend a lot of time on a few.</span></div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  deterministic_limit_ = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(60.0, deterministic_limit_);</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>  solve_data_.clear();</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span> }</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span> </div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span> <span class="keyword">namespace </span>{</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span> </div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span> <span class="keywordtype">void</span> GetRandomSubset(<span class="keywordtype">double</span> relative_size, std::vector<int>* base,</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  absl::BitGenRef random) {</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keywordflow">if</span> (base->empty()) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span> </div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="comment">// TODO(user): we could generate this more efficiently than using random</span></div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="comment">// shuffle.</span></div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  std::shuffle(base->begin(), base->end(), random);</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> target_size = std::round(relative_size * base->size());</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  base->resize(target_size);</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span> }</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> } <span class="comment">// namespace</span></div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span> </div><div class="line"><a name="l00573"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_relax_random_variables_generator.html#a8afb8ece44037532a15303d3533bdced"> 573</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="classoperations__research_1_1sat_1_1_relax_random_variables_generator.html#a8afb8ece44037532a15303d3533bdced">RelaxRandomVariablesGenerator::Generate</a>(</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution, <span class="keywordtype">double</span> difficulty,</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  absl::BitGenRef random) {</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  std::vector<int> fixed_variables = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a1e4ba9b4d3bb23e61c0733c71925649a">ActiveVariables</a>();</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  GetRandomSubset(1.0 - <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac">difficulty</a>, &fixed_variables, random);</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6cadaaf04201fe155b3eda7da2f63874">FixGivenVariables</a>(</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  initial_solution, {fixed_variables.begin(), fixed_variables.end()});</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span> }</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> </div><div class="line"><a name="l00582"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_relax_random_constraints_generator.html#a8afb8ece44037532a15303d3533bdced"> 582</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="classoperations__research_1_1sat_1_1_relax_random_constraints_generator.html#a8afb8ece44037532a15303d3533bdced">RelaxRandomConstraintsGenerator::Generate</a>(</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution, <span class="keywordtype">double</span> difficulty,</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  absl::BitGenRef random) {</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  std::vector<int> active_constraints;</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = 0; <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> < <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#aeaf0da781ca9b370d96b7fbd3f74266a">constraints_size</a>(); ++<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>) {</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">constraints</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>).<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#a5f9869899e2c94786f9709684f1ecc56">constraint_case</a>() ==</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a7af079189afb65e704861b8cdfb301f4">ConstraintProto::CONSTRAINT_NOT_SET</a>) {</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  }</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  active_constraints.push_back(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  }</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span> </div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordflow">if</span> (active_constraints.empty() ||</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a820708532165269860f70e4cbe8211be">DifficultyMeansFullNeighborhood</a>(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac">difficulty</a>)) {</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a15cb168917371b5fb2d17b00e640de63">FullNeighborhood</a>();</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  }</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span> </div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  std::shuffle(active_constraints.begin(), active_constraints.end(), random);</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> num_model_vars = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#abef5f55c3278c137faca92b8e433f8ea">variables_size</a>();</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_model_constraints = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#aeaf0da781ca9b370d96b7fbd3f74266a">constraints_size</a>();</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span> </div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  std::vector<bool> visited_variables_set(num_model_vars, <span class="keyword">false</span>);</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  std::vector<int> relaxed_variables;</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span> </div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  {</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  absl::ReaderMutexLock graph_lock(&<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>);</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_active_vars =</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ada6ccc8374715ab309b47534deb735ac">ActiveVariablesWhileHoldingLock</a>().size();</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> target_size = std::ceil(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac">difficulty</a> * num_active_vars);</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(target_size, 0);</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>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> constraint_index : active_constraints) {</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(constraint_index, num_model_constraints);</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</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> : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#aa1b045e0bf63e7a0075deb32e4c7bd03">ConstraintToVar</a>()[constraint_index]) {</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keywordflow">if</span> (visited_variables_set[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  visited_variables_set[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = <span class="keyword">true</span>;</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#abefd04794ae1f2f60e1fbf1938b8f262">IsActive</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) {</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  relaxed_variables.push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="keywordflow">if</span> (relaxed_variables.size() == target_size) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  }</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  }</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="keywordflow">if</span> (relaxed_variables.size() == target_size) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  }</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  }</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a8735c6fd1459361aa6696a77f8042bf1">RelaxGivenVariables</a>(initial_solution, relaxed_variables);</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span> }</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span> </div><div class="line"><a name="l00630"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_variable_graph_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced"> 630</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="classoperations__research_1_1sat_1_1_variable_graph_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">VariableGraphNeighborhoodGenerator::Generate</a>(</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution, <span class="keywordtype">double</span> difficulty,</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  absl::BitGenRef random) {</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a820708532165269860f70e4cbe8211be">DifficultyMeansFullNeighborhood</a>(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac">difficulty</a>)) {</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a15cb168917371b5fb2d17b00e640de63">FullNeighborhood</a>();</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  }</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span> </div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_model_vars = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#abef5f55c3278c137faca92b8e433f8ea">variables_size</a>();</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  std::vector<bool> visited_variables_set(num_model_vars, <span class="keyword">false</span>);</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  std::vector<int> relaxed_variables;</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  std::vector<int> visited_variables;</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">// It is important complexity wise to never scan a constraint twice!</span></div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_model_constraints = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#aeaf0da781ca9b370d96b7fbd3f74266a">constraints_size</a>();</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  std::vector<bool> scanned_constraints(num_model_constraints, <span class="keyword">false</span>);</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span> </div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  std::vector<int> random_variables;</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  {</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  absl::ReaderMutexLock graph_lock(&<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>);</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span> </div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="comment">// The number of active variables can decrease asynchronously.</span></div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="comment">// We read the exact number while locked.</span></div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_active_vars =</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ada6ccc8374715ab309b47534deb735ac">ActiveVariablesWhileHoldingLock</a>().size();</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> target_size = std::ceil(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac">difficulty</a> * num_active_vars);</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(target_size, 0) << <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac">difficulty</a> << <span class="stringliteral">" "</span> << num_active_vars;</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>  <span class="keyword">const</span> <span class="keywordtype">int</span> first_var =</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ada6ccc8374715ab309b47534deb735ac">ActiveVariablesWhileHoldingLock</a>()[absl::Uniform<int>(</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  random, 0, num_active_vars)];</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span> </div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  visited_variables_set[first_var] = <span class="keyword">true</span>;</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  visited_variables.push_back(first_var);</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  relaxed_variables.push_back(first_var);</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span> </div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < visited_variables.size(); ++i) {</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  random_variables.clear();</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="comment">// Collect all the variables that appears in the same constraints as</span></div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="comment">// visited_variables[i].</span></div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a022e714f3c0cdff0f08e81d8e512684c">VarToConstraint</a>()[visited_variables[i]]) {</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="keywordflow">if</span> (scanned_constraints[<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>]) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  scanned_constraints[<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>] = <span class="keyword">true</span>;</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</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> : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#aa1b045e0bf63e7a0075deb32e4c7bd03">ConstraintToVar</a>()[<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>]) {</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keywordflow">if</span> (visited_variables_set[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  visited_variables_set[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = <span class="keyword">true</span>;</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  random_variables.push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  }</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  }</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="comment">// We always randomize to change the partial subgraph explored</span></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="comment">// afterwards.</span></div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  std::shuffle(random_variables.begin(), random_variables.end(), random);</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</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> : random_variables) {</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="keywordflow">if</span> (relaxed_variables.size() < target_size) {</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  visited_variables.push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#abefd04794ae1f2f60e1fbf1938b8f262">IsActive</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) {</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  relaxed_variables.push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  }</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  }</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  }</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keywordflow">if</span> (relaxed_variables.size() >= target_size) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  }</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  }</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a8735c6fd1459361aa6696a77f8042bf1">RelaxGivenVariables</a>(initial_solution, relaxed_variables);</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span> }</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span> </div><div class="line"><a name="l00697"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_constraint_graph_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced"> 697</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_graph_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">ConstraintGraphNeighborhoodGenerator::Generate</a>(</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution, <span class="keywordtype">double</span> difficulty,</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  absl::BitGenRef random) {</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_model_constraints = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#aeaf0da781ca9b370d96b7fbd3f74266a">constraints_size</a>();</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="keywordflow">if</span> (num_model_constraints == 0 ||</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a820708532165269860f70e4cbe8211be">DifficultyMeansFullNeighborhood</a>(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac">difficulty</a>)) {</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a15cb168917371b5fb2d17b00e640de63">FullNeighborhood</a>();</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  }</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span> </div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_model_vars = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#abef5f55c3278c137faca92b8e433f8ea">variables_size</a>();</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  std::vector<bool> visited_variables_set(num_model_vars, <span class="keyword">false</span>);</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  std::vector<int> relaxed_variables;</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span> </div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  std::vector<bool> added_constraints(num_model_constraints, <span class="keyword">false</span>);</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  std::vector<int> next_constraints;</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span> </div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="comment">// Start by a random constraint.</span></div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  next_constraints.push_back(</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  absl::Uniform<int>(random, 0, num_model_constraints));</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  added_constraints[next_constraints.back()] = <span class="keyword">true</span>;</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span> </div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  std::vector<int> random_variables;</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  {</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  absl::ReaderMutexLock graph_lock(&<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>);</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_active_vars =</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ada6ccc8374715ab309b47534deb735ac">ActiveVariablesWhileHoldingLock</a>().size();</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> target_size = std::ceil(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac">difficulty</a> * num_active_vars);</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(target_size, 0);</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span> </div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keywordflow">while</span> (relaxed_variables.size() < target_size) {</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="comment">// Stop if we have a full connected component.</span></div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="keywordflow">if</span> (next_constraints.empty()) <span class="keywordflow">break</span>;</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>  <span class="comment">// Pick a random unprocessed constraint.</span></div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> i = absl::Uniform<int>(random, 0, next_constraints.size());</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> constraint_index = next_constraints[i];</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(next_constraints[i], next_constraints.back());</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  next_constraints.pop_back();</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span> </div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="comment">// Add all the variable of this constraint and increase the set of next</span></div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="comment">// possible constraints.</span></div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(constraint_index, num_model_constraints);</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  random_variables = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#aa1b045e0bf63e7a0075deb32e4c7bd03">ConstraintToVar</a>()[constraint_index];</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  std::shuffle(random_variables.begin(), random_variables.end(), random);</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</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> : random_variables) {</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keywordflow">if</span> (visited_variables_set[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  visited_variables_set[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = <span class="keyword">true</span>;</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#abefd04794ae1f2f60e1fbf1938b8f262">IsActive</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) {</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  relaxed_variables.push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  }</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keywordflow">if</span> (relaxed_variables.size() == target_size) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span> </div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a022e714f3c0cdff0f08e81d8e512684c">VarToConstraint</a>()[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]) {</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="keywordflow">if</span> (added_constraints[<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>]) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  added_constraints[<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>] = <span class="keyword">true</span>;</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  next_constraints.push_back(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  }</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  }</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  }</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  }</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a8735c6fd1459361aa6696a77f8042bf1">RelaxGivenVariables</a>(initial_solution, relaxed_variables);</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span> }</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span> </div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span> <span class="keyword">namespace </span>{</div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span> </div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_expression_proto.html">LinearExpressionProto</a> GetStart(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_interval_constraint_proto.html">IntervalConstraintProto</a>& <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>) {</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.has_start_view()) <span class="keywordflow">return</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.start_view();</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_expression_proto.html">LinearExpressionProto</a> result;</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  result.<a class="code" href="classoperations__research_1_1sat_1_1_linear_expression_proto.html#aecb2bc94116e771000e5be7f8e3a7f6c">add_vars</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.start());</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  result.<a class="code" href="classoperations__research_1_1sat_1_1_linear_expression_proto.html#a9bb52f9d2a03820db9271cdae2ce97d5">add_coeffs</a>(1);</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span> }</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span> </div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span> LinearExpressionProto GetSize(<span class="keyword">const</span> IntervalConstraintProto& <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>) {</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.has_size_view()) <span class="keywordflow">return</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.size_view();</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  LinearExpressionProto result;</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  result.<a class="code" href="classoperations__research_1_1sat_1_1_linear_expression_proto.html#aecb2bc94116e771000e5be7f8e3a7f6c">add_vars</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.size());</div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  result.add_coeffs(1);</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</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> LinearExpressionProto GetEnd(<span class="keyword">const</span> IntervalConstraintProto& <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>) {</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.has_end_view()) <span class="keywordflow">return</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.end_view();</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  LinearExpressionProto result;</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  result.add_vars(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.end());</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  result.add_coeffs(1);</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span> }</div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span> </div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span> int64_t GetLinearExpressionValue(<span class="keyword">const</span> LinearExpressionProto& expr,</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="keyword">const</span> CpSolverResponse& initial_solution) {</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  int64_t result = expr.offset();</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < expr.vars_size(); ++i) {</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  result += expr.coeffs(i) * initial_solution.solution(expr.vars(i));</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  }</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span> }</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span> </div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span> <span class="keywordtype">void</span> AddLinearExpressionToConstraint(<span class="keyword">const</span> int64_t coeff,</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="keyword">const</span> LinearExpressionProto& expr,</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  LinearConstraintProto* constraint,</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  int64_t* rhs_offset) {</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  *rhs_offset -= coeff * expr.offset();</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < expr.vars_size(); ++i) {</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  constraint->add_vars(expr.vars(i));</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  constraint->add_coeffs(expr.coeffs(i) * coeff);</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  }</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span> }</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span> </div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span> <span class="keywordtype">void</span> AddPrecedenceConstraints(<span class="keyword">const</span> absl::Span<const int> intervals,</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="keyword">const</span> absl::flat_hash_set<int>& ignored_intervals,</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="keyword">const</span> CpSolverResponse& initial_solution,</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="keyword">const</span> NeighborhoodGeneratorHelper& helper,</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  Neighborhood* neighborhood) {</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="comment">// Sort all non-relaxed intervals of this constraint by current start</span></div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="comment">// time.</span></div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  std::vector<std::pair<int64_t, int>> start_interval_pairs;</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> i : intervals) {</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  <span class="keywordflow">if</span> (ignored_intervals.contains(i)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  <span class="keyword">const</span> ConstraintProto& interval_ct = helper.ModelProto().constraints(i);</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>  <span class="comment">// TODO(user): we ignore size zero for now.</span></div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="keyword">const</span> LinearExpressionProto size_var = GetSize(interval_ct.interval());</div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="keywordflow">if</span> (GetLinearExpressionValue(size_var, initial_solution) == 0) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span> </div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  <span class="keyword">const</span> LinearExpressionProto start_var = GetStart(interval_ct.interval());</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <span class="keyword">const</span> int64_t start_value =</div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  GetLinearExpressionValue(start_var, initial_solution);</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span> </div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  start_interval_pairs.push_back({start_value, i});</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  }</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  std::sort(start_interval_pairs.begin(), start_interval_pairs.end());</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span> </div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <span class="comment">// Add precedence between the remaining intervals, forcing their order.</span></div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i + 1 < start_interval_pairs.size(); ++i) {</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="keyword">const</span> LinearExpressionProto before_start =</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  GetStart(helper.ModelProto()</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  .constraints(start_interval_pairs[i].second)</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  .interval());</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  <span class="keyword">const</span> LinearExpressionProto before_end =</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  GetEnd(helper.ModelProto()</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  .constraints(start_interval_pairs[i].second)</div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  .interval());</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="keyword">const</span> LinearExpressionProto after_start =</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  GetStart(helper.ModelProto()</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  .constraints(start_interval_pairs[i + 1].second)</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  .interval());</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span> </div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="comment">// If the end was smaller we keep it that way, otherwise we just order the</span></div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="comment">// start variables.</span></div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  LinearConstraintProto* linear =</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  neighborhood->delta.add_constraints()->mutable_linear();</div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  linear->add_domain(<a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>());</div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  int64_t rhs_offset = 0;</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="keywordflow">if</span> (GetLinearExpressionValue(before_end, initial_solution) <=</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  GetLinearExpressionValue(after_start, initial_solution)) {</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <span class="comment">// If the end was smaller than the next start, keep it that way.</span></div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  AddLinearExpressionToConstraint(1, before_end, linear, &rhs_offset);</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="comment">// Otherwise, keep the same minimum separation. This is done in order</span></div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="comment">// to "simplify" the neighborhood.</span></div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  rhs_offset = GetLinearExpressionValue(before_start, initial_solution) -</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  GetLinearExpressionValue(after_start, initial_solution);</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  AddLinearExpressionToConstraint(1, before_start, linear, &rhs_offset);</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</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>  AddLinearExpressionToConstraint(-1, after_start, linear, &rhs_offset);</div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  linear->add_domain(rhs_offset);</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">// The linear constraint should be satisfied by the current solution.</span></div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  int64_t activity = 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 < linear->vars().size(); ++i) {</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  activity +=</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  linear->coeffs(i) * initial_solution.solution(linear->vars(i));</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  }</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(activity, linear->domain(0));</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(activity, linear->domain(1));</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  }</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  }</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span> }</div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span> } <span class="comment">// namespace</span></div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span> </div><div class="line"><a name="l00880"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ad57491858f7814f0a03845022b6de35e"> 880</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="namespaceoperations__research_1_1sat.html#ad57491858f7814f0a03845022b6de35e">GenerateSchedulingNeighborhoodForRelaxation</a>(</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="keyword">const</span> absl::Span<const int> intervals_to_relax,</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution,</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html">NeighborhoodGeneratorHelper</a>& helper) {</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> neighborhood = helper.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a15cb168917371b5fb2d17b00e640de63">FullNeighborhood</a>();</div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a8e672808c179f95cf4c626aef798bbc7">is_reduced</a> =</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  (intervals_to_relax.size() <</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  helper.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6aef4ca16709a75231ee1691c306c641">TypeToConstraints</a>(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a1b948ef604eecbb4da42feb6bed2beff">ConstraintProto::kInterval</a>).size());</div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span> </div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="comment">// We will extend the set with some interval that we cannot fix.</span></div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  absl::flat_hash_set<int> ignored_intervals(intervals_to_relax.begin(),</div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  intervals_to_relax.end());</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span> </div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  <span class="comment">// Fix the presence/absence of non-relaxed intervals.</span></div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> i : helper.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6aef4ca16709a75231ee1691c306c641">TypeToConstraints</a>(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a1b948ef604eecbb4da42feb6bed2beff">ConstraintProto::kInterval</a>)) {</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(i, 0);</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keywordflow">if</span> (ignored_intervals.contains(i)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span> </div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>& interval_ct = helper.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">constraints</a>(i);</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <span class="keywordflow">if</span> (interval_ct.<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#acdc90a25e531e4180c495f4ecf2aca2e">enforcement_literal</a>().empty()) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span> </div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(interval_ct.<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#acdc90a25e531e4180c495f4ecf2aca2e">enforcement_literal</a>().size(), 1);</div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> enforcement_ref = interval_ct.<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#acdc90a25e531e4180c495f4ecf2aca2e">enforcement_literal</a>(0);</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> enforcement_var = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(enforcement_ref);</div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = initial_solution.<a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html#ac6155ed23d1f37fa4f6b4fc666220723">solution</a>(enforcement_var);</div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span> </div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="comment">// If the interval is not enforced, we just relax it. If it belongs to an</span></div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  <span class="comment">// exactly one constraint, and the enforced interval is not relaxed, then</span></div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  <span class="comment">// propagation will force this interval to stay not enforced. Otherwise,</span></div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="comment">// LNS will be able to change which interval will be enforced among all</span></div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="comment">// alternatives.</span></div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(enforcement_ref) == (<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> == 0)) {</div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  ignored_intervals.insert(i);</div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  }</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span> </div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <span class="comment">// Fix the value.</span></div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411">delta</a>.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#ab9746c6070379e1990d2fd2da7586398">mutable_variables</a>(enforcement_var)-><a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#a44f2e1631cdbf3b9a89a8afa8acb8ebd">clear_domain</a>();</div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411">delta</a>.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#ab9746c6070379e1990d2fd2da7586398">mutable_variables</a>(enforcement_var)-><a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#a2266c77ad6db8de45560357c1436e558">add_domain</a>(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411">delta</a>.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#ab9746c6070379e1990d2fd2da7586398">mutable_variables</a>(enforcement_var)-><a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#a2266c77ad6db8de45560357c1436e558">add_domain</a>(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  }</div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span> </div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> c : helper.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6aef4ca16709a75231ee1691c306c641">TypeToConstraints</a>(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35aa604bb0c8d30d6e0908b243370cf98a7">ConstraintProto::kNoOverlap</a>)) {</div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  AddPrecedenceConstraints(</div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  helper.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">constraints</a>(c).<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ae2ed511035559d5e4361f0f9b70f2b1d">no_overlap</a>().<a class="code" href="classoperations__research_1_1sat_1_1_no_overlap_constraint_proto.html#a20b8389b79079bde9b397de12921bf8b">intervals</a>(),</div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  ignored_intervals, initial_solution, helper, &neighborhood);</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  }</div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> c : helper.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6aef4ca16709a75231ee1691c306c641">TypeToConstraints</a>(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a6273d2906038e97dc4d54d89436a305a">ConstraintProto::kCumulative</a>)) {</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  AddPrecedenceConstraints(</div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  helper.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">constraints</a>(c).<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#a932cfc15d7d1be4de118889e7116af20">cumulative</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cumulative_constraint_proto.html#a20b8389b79079bde9b397de12921bf8b">intervals</a>(),</div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  ignored_intervals, initial_solution, helper, &neighborhood);</div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  }</div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> c : helper.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6aef4ca16709a75231ee1691c306c641">TypeToConstraints</a>(<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a4ed0edf0e268cf40b0f09253fb1b261b">ConstraintProto::kNoOverlap2D</a>)) {</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  AddPrecedenceConstraints(</div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  helper.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">constraints</a>(c).<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#a5e02c2fd22fa5bd71469514941d9db0b">no_overlap_2d</a>().<a class="code" href="classoperations__research_1_1sat_1_1_no_overlap2_d_constraint_proto.html#a1d854dc8740b68eb87ea131e9919b188">x_intervals</a>(),</div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  ignored_intervals, initial_solution, helper, &neighborhood);</div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  AddPrecedenceConstraints(</div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  helper.ModelProto().constraints(c).no_overlap_2d().y_intervals(),</div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  ignored_intervals, initial_solution, helper, &neighborhood);</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  }</div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span> </div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  <span class="comment">// Set the current solution as a hint.</span></div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  helper.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ac18c0fe53e351d0a5d105b8bc7d53c08">AddSolutionHinting</a>(initial_solution, &neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411">delta</a>);</div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a04d448b3000c058b67ad17541473a317">is_generated</a> = <span class="keyword">true</span>;</div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span> </div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="keywordflow">return</span> neighborhood;</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span> }</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span> </div><div class="line"><a name="l00948"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced"> 948</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">SchedulingNeighborhoodGenerator::Generate</a>(</div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution, <span class="keywordtype">double</span> difficulty,</div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  absl::BitGenRef random) {</div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  std::vector<int> intervals_to_relax =</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a8b0ea5233e98dcd85233c074a034fd05">GetActiveIntervals</a>(initial_solution);</div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  GetRandomSubset(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac">difficulty</a>, &intervals_to_relax, random);</div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span> </div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#ad57491858f7814f0a03845022b6de35e">GenerateSchedulingNeighborhoodForRelaxation</a>(intervals_to_relax,</div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  initial_solution, <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>);</div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span> }</div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span> </div><div class="line"><a name="l00959"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_time_window_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced"> 959</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_time_window_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">SchedulingTimeWindowNeighborhoodGenerator::Generate</a>(</div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution, <span class="keywordtype">double</span> difficulty,</div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  absl::BitGenRef random) {</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  std::vector<std::pair<int64_t, int>> start_interval_pairs;</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <span class="keyword">const</span> std::vector<int> active_intervals =</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a8b0ea5233e98dcd85233c074a034fd05">GetActiveIntervals</a>(initial_solution);</div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  std::vector<int> intervals_to_relax;</div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span> </div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="keywordflow">if</span> (active_intervals.empty()) <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a15cb168917371b5fb2d17b00e640de63">FullNeighborhood</a>();</div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span> </div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> i : active_intervals) {</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>& interval_ct = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">constraints</a>(i);</div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_linear_expression_proto.html">LinearExpressionProto</a> start_var = GetStart(interval_ct.<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#a2ec4b0b15e694caaaa842243694c51f5">interval</a>());</div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  <span class="keyword">const</span> int64_t start_value =</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  GetLinearExpressionValue(start_var, initial_solution);</div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  start_interval_pairs.push_back({start_value, i});</div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  }</div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  std::sort(start_interval_pairs.begin(), start_interval_pairs.end());</div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> relaxed_size = std::floor(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac">difficulty</a> * start_interval_pairs.size());</div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span> </div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  std::uniform_int_distribution<int> random_var(</div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  0, start_interval_pairs.size() - relaxed_size - 1);</div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> random_start_index = random_var(random);</div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span> </div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  <span class="comment">// TODO(user): Consider relaxing more than one time window</span></div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  <span class="comment">// intervals. This seems to help with Giza models.</span></div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = random_start_index; i < relaxed_size; ++i) {</div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  intervals_to_relax.push_back(start_interval_pairs[i].second);</div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  }</div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span> </div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#ad57491858f7814f0a03845022b6de35e">GenerateSchedulingNeighborhoodForRelaxation</a>(intervals_to_relax,</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  initial_solution, <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>);</div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span> }</div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span> </div><div class="line"><a name="l00993"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_routing_random_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced"> 993</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="classoperations__research_1_1sat_1_1_routing_random_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">RoutingRandomNeighborhoodGenerator::Generate</a>(</div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution, <span class="keywordtype">double</span> difficulty,</div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  absl::BitGenRef random) {</div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  <span class="keyword">const</span> std::vector<std::vector<int>> all_paths =</div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#aff6e1cdbf44ac50c3dcc0e5bb3591478">GetRoutingPaths</a>(initial_solution);</div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span> </div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <span class="comment">// Collect all unique variables.</span></div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  absl::flat_hash_set<int> all_path_variables;</div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span>& path : all_paths) {</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  all_path_variables.insert(path.begin(), path.end());</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  }</div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  std::vector<int> fixed_variables(all_path_variables.begin(),</div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  all_path_variables.end());</div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  std::sort(fixed_variables.begin(), fixed_variables.end());</div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  GetRandomSubset(1.0 - <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac">difficulty</a>, &fixed_variables, random);</div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6cadaaf04201fe155b3eda7da2f63874">FixGivenVariables</a>(</div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  initial_solution, {fixed_variables.begin(), fixed_variables.end()});</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span> }</div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span> </div><div class="line"><a name="l01012"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_routing_path_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced"> 1012</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="classoperations__research_1_1sat_1_1_routing_path_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">RoutingPathNeighborhoodGenerator::Generate</a>(</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution, <span class="keywordtype">double</span> difficulty,</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  absl::BitGenRef random) {</div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  std::vector<std::vector<int>> all_paths =</div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#aff6e1cdbf44ac50c3dcc0e5bb3591478">GetRoutingPaths</a>(initial_solution);</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span> </div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <span class="comment">// Collect all unique variables.</span></div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  absl::flat_hash_set<int> all_path_variables;</div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& path : all_paths) {</div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  all_path_variables.insert(path.begin(), path.end());</div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  }</div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span> </div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  <span class="comment">// Select variables to relax.</span></div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_variables_to_relax =</div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  static_cast<int>(all_path_variables.size() * <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac">difficulty</a>);</div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  absl::flat_hash_set<int> relaxed_variables;</div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="keywordflow">while</span> (relaxed_variables.size() < num_variables_to_relax) {</div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!all_paths.empty());</div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> path_index = absl::Uniform<int>(random, 0, all_paths.size());</div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  std::vector<int>& path = all_paths[path_index];</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> path_size = path.size();</div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> segment_length =</div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(path_size, absl::Uniform<int>(random, 4, 8));</div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> segment_start =</div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  absl::Uniform<int>(random, 0, path_size - segment_length);</div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = segment_start; i < segment_start + segment_length; ++i) {</div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  relaxed_variables.insert(path[i]);</div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  }</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span> </div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  <span class="comment">// Remove segment and clean up empty paths.</span></div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  path.erase(path.begin() + segment_start,</div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  path.begin() + segment_start + segment_length);</div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  <span class="keywordflow">if</span> (path.empty()) {</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(all_paths[path_index], all_paths.back());</div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  all_paths.pop_back();</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  }</div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  }</div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span> </div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  <span class="comment">// Compute the set of variables to fix.</span></div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  absl::flat_hash_set<int> fixed_variables;</div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</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> : all_path_variables) {</div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  <span class="keywordflow">if</span> (!relaxed_variables.contains(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) fixed_variables.insert(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  }</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6cadaaf04201fe155b3eda7da2f63874">FixGivenVariables</a>(initial_solution, fixed_variables);</div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span> }</div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span> </div><div class="line"><a name="l01058"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_routing_full_path_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced"> 1058</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="classoperations__research_1_1sat_1_1_routing_full_path_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">RoutingFullPathNeighborhoodGenerator::Generate</a>(</div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution, <span class="keywordtype">double</span> difficulty,</div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  absl::BitGenRef random) {</div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  std::vector<std::vector<int>> all_paths =</div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#aff6e1cdbf44ac50c3dcc0e5bb3591478">GetRoutingPaths</a>(initial_solution);</div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span> </div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  <span class="comment">// Collect all unique variables.</span></div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  absl::flat_hash_set<int> all_path_variables;</div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& path : all_paths) {</div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  all_path_variables.insert(path.begin(), path.end());</div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  }</div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span> </div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  <span class="comment">// Select variables to relax.</span></div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_variables_to_relax =</div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  static_cast<int>(all_path_variables.size() * <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac">difficulty</a>);</div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  absl::flat_hash_set<int> relaxed_variables;</div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span> </div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  <span class="comment">// Relax the start and end of each path to ease relocation.</span></div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& path : all_paths) {</div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  relaxed_variables.insert(path.front());</div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  relaxed_variables.insert(path.back());</div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  }</div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span> </div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  <span class="comment">// Randomize paths.</span></div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span>& path : all_paths) {</div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  std::shuffle(path.begin(), path.end(), random);</div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  }</div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span> </div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  <span class="comment">// Relax all variables (if possible) in one random path.</span></div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> path_to_clean = absl::Uniform<int>(random, 0, all_paths.size());</div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  <span class="keywordflow">while</span> (relaxed_variables.size() < num_variables_to_relax) {</div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!all_paths[path_to_clean].empty());</div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  relaxed_variables.insert(all_paths[path_to_clean].back());</div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  all_paths[path_to_clean].pop_back();</div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  }</div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <span class="keywordflow">if</span> (all_paths[path_to_clean].empty()) {</div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(all_paths[path_to_clean], all_paths.back());</div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  all_paths.pop_back();</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  }</div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span> </div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  <span class="comment">// Relax more variables until the target is reached.</span></div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  <span class="keywordflow">while</span> (relaxed_variables.size() < num_variables_to_relax) {</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!all_paths.empty());</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> path_index = absl::Uniform<int>(random, 0, all_paths.size());</div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  relaxed_variables.insert(all_paths[path_index].back());</div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span> </div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  <span class="comment">// Remove variable and clean up empty paths.</span></div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  all_paths[path_index].pop_back();</div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  <span class="keywordflow">if</span> (all_paths[path_index].empty()) {</div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(all_paths[path_index], all_paths.back());</div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  all_paths.pop_back();</div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  }</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  }</div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span> </div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  <span class="comment">// Compute the set of variables to fix.</span></div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  absl::flat_hash_set<int> fixed_variables;</div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</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> : all_path_variables) {</div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  <span class="keywordflow">if</span> (!relaxed_variables.contains(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) fixed_variables.insert(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  }</div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6cadaaf04201fe155b3eda7da2f63874">FixGivenVariables</a>(initial_solution, fixed_variables);</div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span> }</div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span> </div><div class="line"><a name="l01120"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_relaxation_induced_neighborhood_generator.html#a18bd97b50e3170dabf1f537e19695054"> 1120</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_relaxation_induced_neighborhood_generator.html#a18bd97b50e3170dabf1f537e19695054">RelaxationInducedNeighborhoodGenerator::ReadyToGenerate</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  <span class="keywordflow">if</span> (incomplete_solutions_ != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  <span class="keywordflow">return</span> incomplete_solutions_-><a class="code" href="classoperations__research_1_1sat_1_1_shared_incomplete_solution_manager.html#afad444837cdc77c60e71abb9294753b9">HasNewSolution</a>();</div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  }</div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span> </div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  <span class="keywordflow">if</span> (response_manager_ != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  <span class="keywordflow">if</span> (response_manager_-><a class="code" href="classoperations__research_1_1sat_1_1_shared_response_manager.html#a45cf335a09cbaae1337a45d7978d8892">SolutionsRepository</a>().<a class="code" href="classoperations__research_1_1sat_1_1_shared_solution_repository.html#a6d2b6f7951b60c786fdbefcbe7c3571f">NumSolutions</a>() == 0) {</div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  }</div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  }</div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span> </div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  <span class="comment">// At least one relaxation solution should be available to generate a</span></div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  <span class="comment">// neighborhood.</span></div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  <span class="keywordflow">if</span> (lp_solutions_ != <span class="keyword">nullptr</span> && lp_solutions_-><a class="code" href="classoperations__research_1_1sat_1_1_shared_solution_repository.html#a6d2b6f7951b60c786fdbefcbe7c3571f">NumSolutions</a>() > 0) {</div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  }</div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span> </div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  <span class="keywordflow">if</span> (relaxation_solutions_ != <span class="keyword">nullptr</span> &&</div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  relaxation_solutions_-><a class="code" href="classoperations__research_1_1sat_1_1_shared_solution_repository.html#a6d2b6f7951b60c786fdbefcbe7c3571f">NumSolutions</a>() > 0) {</div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  }</div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span> }</div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span> </div><div class="line"><a name="l01144"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_relaxation_induced_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced"> 1144</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="classoperations__research_1_1sat_1_1_relaxation_induced_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">RelaxationInducedNeighborhoodGenerator::Generate</a>(</div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution, <span class="keywordtype">double</span> difficulty,</div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  absl::BitGenRef random) {</div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> neighborhood = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a15cb168917371b5fb2d17b00e640de63">FullNeighborhood</a>();</div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a04d448b3000c058b67ad17541473a317">is_generated</a> = <span class="keyword">false</span>;</div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span> </div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> lp_solution_available =</div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  (lp_solutions_ != <span class="keyword">nullptr</span> && lp_solutions_-><a class="code" href="classoperations__research_1_1sat_1_1_shared_solution_repository.html#a6d2b6f7951b60c786fdbefcbe7c3571f">NumSolutions</a>() > 0);</div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span> </div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> relaxation_solution_available =</div><div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  (relaxation_solutions_ != <span class="keyword">nullptr</span> &&</div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  relaxation_solutions_-><a class="code" href="classoperations__research_1_1sat_1_1_shared_solution_repository.html#a6d2b6f7951b60c786fdbefcbe7c3571f">NumSolutions</a>() > 0);</div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span> </div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> incomplete_solution_available =</div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  (incomplete_solutions_ != <span class="keyword">nullptr</span> &&</div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  incomplete_solutions_-><a class="code" href="classoperations__research_1_1sat_1_1_shared_incomplete_solution_manager.html#afad444837cdc77c60e71abb9294753b9">HasNewSolution</a>());</div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span> </div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  <span class="keywordflow">if</span> (!lp_solution_available && !relaxation_solution_available &&</div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  !incomplete_solution_available) {</div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  <span class="keywordflow">return</span> neighborhood;</div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  }</div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span> </div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  <a class="code" href="structoperations__research_1_1sat_1_1_r_i_n_s_neighborhood.html">RINSNeighborhood</a> rins_neighborhood;</div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  <span class="comment">// Randomly select the type of relaxation if both lp and relaxation solutions</span></div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  <span class="comment">// are available.</span></div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  <span class="comment">// TODO(user): Tune the probability value for this.</span></div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  std::bernoulli_distribution random_bool(0.5);</div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> use_lp_relaxation =</div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  (lp_solution_available && relaxation_solution_available)</div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  ? random_bool(random)</div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  : lp_solution_available;</div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  <span class="keywordflow">if</span> (use_lp_relaxation) {</div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  rins_neighborhood =</div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#aeef49408603258c45118e0ca3394442c">GetRINSNeighborhood</a>(response_manager_,</div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  <span class="comment">/*relaxation_solutions=*/</span><span class="keyword">nullptr</span>, lp_solutions_,</div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  incomplete_solutions_, random);</div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#aaed94da4e4845ead42773bd4468a8899">source_info</a> =</div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  incomplete_solution_available ? <span class="stringliteral">"incomplete"</span> : <span class="stringliteral">"lp"</span>;</div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(relaxation_solution_available || incomplete_solution_available);</div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  rins_neighborhood = <a class="code" href="namespaceoperations__research_1_1sat.html#aeef49408603258c45118e0ca3394442c">GetRINSNeighborhood</a>(</div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  response_manager_, relaxation_solutions_,</div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <span class="comment">/*lp_solutions=*/</span><span class="keyword">nullptr</span>, incomplete_solutions_, random);</div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#aaed94da4e4845ead42773bd4468a8899">source_info</a> =</div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  incomplete_solution_available ? <span class="stringliteral">"incomplete"</span> : <span class="stringliteral">"relaxation"</span>;</div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  }</div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span> </div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  <span class="keywordflow">if</span> (rins_neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_r_i_n_s_neighborhood.html#a5d9d48f7fccd7a170af97ed1da2393f3">fixed_vars</a>.empty() &&</div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  rins_neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_r_i_n_s_neighborhood.html#ab3c025953129f4798b0fe2eb84e95d6b">reduced_domain_vars</a>.empty()) {</div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <span class="keywordflow">return</span> neighborhood;</div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  }</div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span> </div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  absl::ReaderMutexLock graph_lock(&<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>);</div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  <span class="comment">// Fix the variables in the local model.</span></div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair</*model_var*/ int, /*value*/ int64_t> fixed_var :</div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  rins_neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_r_i_n_s_neighborhood.html#a5d9d48f7fccd7a170af97ed1da2393f3">fixed_vars</a>) {</div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = fixed_var.first;</div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  <span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = fixed_var.second;</div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> >= neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411">delta</a>.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#abef5f55c3278c137faca92b8e433f8ea">variables_size</a>()) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#abefd04794ae1f2f60e1fbf1938b8f262">IsActive</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span> </div><div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research_1_1sat.html#a46540a899ab5e8fe1b55e12da55cbbe0">DomainInProtoContains</a>(neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411">delta</a>.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#a6a4544ca20489d70e302f5d6d374a012">variables</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>), <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>)) {</div><div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  <span class="comment">// TODO(user): Instead of aborting, pick the closest point in the domain?</span></div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  <span class="keywordflow">return</span> neighborhood;</div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  }</div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span> </div><div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411">delta</a>.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#ab9746c6070379e1990d2fd2da7586398">mutable_variables</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)-><a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#a44f2e1631cdbf3b9a89a8afa8acb8ebd">clear_domain</a>();</div><div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411">delta</a>.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#ab9746c6070379e1990d2fd2da7586398">mutable_variables</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)-><a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#a2266c77ad6db8de45560357c1436e558">add_domain</a>(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411">delta</a>.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#ab9746c6070379e1990d2fd2da7586398">mutable_variables</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)-><a class="code" href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#a2266c77ad6db8de45560357c1436e558">add_domain</a>(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a8e672808c179f95cf4c626aef798bbc7">is_reduced</a> = <span class="keyword">true</span>;</div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  }</div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span> </div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair<<span class="comment">/*model_var*/</span> <span class="keywordtype">int</span>,</div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  <span class="comment">/*domain*/</span> std::pair<int64_t, int64_t>></div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  reduced_var : rins_neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_r_i_n_s_neighborhood.html#ab3c025953129f4798b0fe2eb84e95d6b">reduced_domain_vars</a>) {</div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = reduced_var.first;</div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  <span class="keyword">const</span> int64_t lb = reduced_var.second.first;</div><div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  <span class="keyword">const</span> int64_t ub = reduced_var.second.second;</div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> >= neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411">delta</a>.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#abef5f55c3278c137faca92b8e433f8ea">variables_size</a>()) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#abefd04794ae1f2f60e1fbf1938b8f262">IsActive</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  <a class="code" href="classoperations__research_1_1_domain.html">Domain</a> domain = <a class="code" href="namespaceoperations__research_1_1sat.html#ab1240060466ba48a36a4b36379bce26a">ReadDomainFromProto</a>(neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411">delta</a>.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#a6a4544ca20489d70e302f5d6d374a012">variables</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  domain = domain.<a class="code" href="classoperations__research_1_1_domain.html#a835826c4c5129b74553042a357a721ff">IntersectionWith</a>(<a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(lb, ub));</div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  <span class="keywordflow">if</span> (domain.IsEmpty()) {</div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  <span class="comment">// TODO(user): Instead of aborting, pick the closest point in the domain?</span></div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  <span class="keywordflow">return</span> neighborhood;</div><div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  }</div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a901c19b12842f8af153e588a689a90b5">FillDomainInProto</a>(domain, neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411">delta</a>.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#ab9746c6070379e1990d2fd2da7586398">mutable_variables</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a8e672808c179f95cf4c626aef798bbc7">is_reduced</a> = <span class="keyword">true</span>;</div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  }</div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  neighborhood.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a04d448b3000c058b67ad17541473a317">is_generated</a> = <span class="keyword">true</span>;</div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  <span class="keywordflow">return</span> neighborhood;</div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span> }</div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span> </div><div class="line"><a name="l01237"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced"> 1237</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">ConsecutiveConstraintsRelaxationNeighborhoodGenerator::Generate</a>(</div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution, <span class="keywordtype">double</span> difficulty,</div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  absl::BitGenRef random) {</div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  std::vector<int> removable_constraints;</div><div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_constraints = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#aeaf0da781ca9b370d96b7fbd3f74266a">constraints_size</a>();</div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  removable_constraints.reserve(num_constraints);</div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> c = 0; c < num_constraints; ++c) {</div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  <span class="comment">// Removing intervals is not easy because other constraint might require</span></div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  <span class="comment">// them, so for now, we don't remove them.</span></div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">constraints</a>(c).<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#a5f9869899e2c94786f9709684f1ecc56">constraint_case</a>() ==</div><div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a1b948ef604eecbb4da42feb6bed2beff">ConstraintProto::kInterval</a>) {</div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  }</div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  removable_constraints.push_back(c);</div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  }</div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span> </div><div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> target_size =</div><div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  std::round((1.0 - <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac">difficulty</a>) * removable_constraints.size());</div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span> </div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> random_start_index =</div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  absl::Uniform<int>(random, 0, removable_constraints.size());</div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  std::vector<int> removed_constraints;</div><div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  removed_constraints.reserve(target_size);</div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  <span class="keywordtype">int</span> c = random_start_index;</div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  <span class="keywordflow">while</span> (removed_constraints.size() < target_size) {</div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  removed_constraints.push_back(removable_constraints[c]);</div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  ++c;</div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  <span class="keywordflow">if</span> (c == removable_constraints.size()) {</div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  c = 0;</div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  }</div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  }</div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span> </div><div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ac0763b7b9e44b9b30e78b9dd4da8e98a">RemoveMarkedConstraints</a>(removed_constraints);</div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span> }</div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span> </div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span> <a class="code" href="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator.html#a325f8d16767c3a3912e429d856171150">WeightedRandomRelaxationNeighborhoodGenerator::</a></div><div class="line"><a name="l01273"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator.html#a325f8d16767c3a3912e429d856171150"> 1273</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator.html#a325f8d16767c3a3912e429d856171150"> WeightedRandomRelaxationNeighborhoodGenerator</a>(</div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html">NeighborhoodGeneratorHelper</a> <span class="keyword">const</span>* helper, <span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>)</div><div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a>(<a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>, helper) {</div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  std::vector<int> removable_constraints;</div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_constraints = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#aeaf0da781ca9b370d96b7fbd3f74266a">constraints_size</a>();</div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  constraint_weights_.reserve(num_constraints);</div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  <span class="comment">// TODO(user): Experiment with different starting weights.</span></div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> c = 0; c < num_constraints; ++c) {</div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  <span class="keywordflow">switch</span> (<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">constraints</a>(c).<a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#a5f9869899e2c94786f9709684f1ecc56">constraint_case</a>()) {</div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a6273d2906038e97dc4d54d89436a305a">ConstraintProto::kCumulative</a>:</div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35ac7267ea8eee1047e8b3d41f4526bcef6">ConstraintProto::kAllDiff</a>:</div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35acd33b6e972e153ab1a911c84c9585a42">ConstraintProto::kElement</a>:</div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a88da6de97c8b4c4ce52616e0516b252a">ConstraintProto::kRoutes</a>:</div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a7da0520a1741193fc2422811d6af7ace">ConstraintProto::kCircuit</a>:</div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  constraint_weights_.push_back(3.0);</div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  num_removable_constraints_++;</div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35aaadb0c3370c597095e0cb7e768f04567">ConstraintProto::kBoolOr</a>:</div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35aef651681e2d17f777063fddf191f4a99">ConstraintProto::kBoolAnd</a>:</div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a698b5d4e9d041ce67288f15e6a5053bc">ConstraintProto::kBoolXor</a>:</div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35adf309905f42ce420be0b852996e4e650">ConstraintProto::kIntProd</a>:</div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a6cf91c5ead8753183a21a1561237d2d2">ConstraintProto::kIntDiv</a>:</div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35ae87040cc6afe119fcfb0b7fa16a16a8a">ConstraintProto::kIntMod</a>:</div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a4d3274f97b77566895b3a239ed62bb72">ConstraintProto::kIntMax</a>:</div><div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35afa67b6d38ac5fc27ad2cac3d2f392e39">ConstraintProto::kLinMax</a>:</div><div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a15204b185dfd4bef30727e0ca1c321b8">ConstraintProto::kIntMin</a>:</div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a6481aef04a17e76c15e4be2d03d3cc23">ConstraintProto::kLinMin</a>:</div><div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35aa604bb0c8d30d6e0908b243370cf98a7">ConstraintProto::kNoOverlap</a>:</div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a4ed0edf0e268cf40b0f09253fb1b261b">ConstraintProto::kNoOverlap2D</a>:</div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  constraint_weights_.push_back(2.0);</div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  num_removable_constraints_++;</div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35ac188c019178783e5be55110601309d7d">ConstraintProto::kLinear</a>:</div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a1476d98efc03ccb4224ae17f531fd05a">ConstraintProto::kTable</a>:</div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a8ab070d41f07187a3dc733f52455ffc0">ConstraintProto::kAutomaton</a>:</div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35aacf7ff630234b9ffede42cdbc9d5be5a">ConstraintProto::kInverse</a>:</div><div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a86d0a62bd1b691a1b81446e7ced9cdf7">ConstraintProto::kReservoir</a>:</div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a60d782b0aafa6f70b6230ffd970b2c6b">ConstraintProto::kAtMostOne</a>:</div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35ad60570d9bed938f8b11385a7ba7f3508">ConstraintProto::kExactlyOne</a>:</div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  constraint_weights_.push_back(1.0);</div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  num_removable_constraints_++;</div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a7af079189afb65e704861b8cdfb301f4">ConstraintProto::CONSTRAINT_NOT_SET</a>:</div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35aa56df0a705ba98b87cf95d61122aa694">ConstraintProto::kDummyConstraint</a>:</div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a1b948ef604eecbb4da42feb6bed2beff">ConstraintProto::kInterval</a>:</div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  <span class="comment">// Removing intervals is not easy because other constraint might require</span></div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  <span class="comment">// them, so for now, we don't remove them.</span></div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  constraint_weights_.push_back(0.0);</div><div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  }</div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  }</div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span> }</div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span> </div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span> <span class="keywordtype">void</span> WeightedRandomRelaxationNeighborhoodGenerator::</div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  AdditionalProcessingOnSynchronize(<span class="keyword">const</span> SolveData& solve_data) {</div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  <span class="keyword">const</span> IntegerValue best_objective_improvement =</div><div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  solve_data.new_objective_bound - solve_data.initial_best_objective_bound;</div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span> </div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  <span class="keyword">const</span> std::vector<int>& removed_constraints =</div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  removed_constraints_[solve_data.neighborhood_id];</div><div class="line"><a name="l01333"></a><span class="lineno"> 1333</span> </div><div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  <span class="comment">// Heuristic: We change the weights of the removed constraints if the</span></div><div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  <span class="comment">// neighborhood is solved (status is OPTIMAL or INFEASIBLE) or we observe an</span></div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  <span class="comment">// improvement in objective bounds. Otherwise we assume that the</span></div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  <span class="comment">// difficulty/time wasn't right for us to record feedbacks.</span></div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  <span class="comment">//</span></div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  <span class="comment">// If the objective bounds are improved, we bump up the weights. If the</span></div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  <span class="comment">// objective bounds are worse and the problem status is OPTIMAL, we bump down</span></div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  <span class="comment">// the weights. Otherwise if the new objective bounds are same as current</span></div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  <span class="comment">// bounds (which happens a lot on some instances), we do not update the</span></div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  <span class="comment">// weights as we do not have a clear signal whether the constraints removed</span></div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  <span class="comment">// were good choices or not.</span></div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  <span class="comment">// TODO(user): We can improve this heuristic with more experiments.</span></div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  <span class="keywordflow">if</span> (best_objective_improvement > 0) {</div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  <span class="comment">// Bump up the weights of all removed constraints.</span></div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> c : removed_constraints) {</div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  <span class="keywordflow">if</span> (constraint_weights_[c] <= 90.0) {</div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  constraint_weights_[c] += 10.0;</div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  constraint_weights_[c] = 100.0;</div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  }</div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  }</div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (solve_data.status == <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">CpSolverStatus::OPTIMAL</a> &&</div><div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  best_objective_improvement < 0) {</div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  <span class="comment">// Bump down the weights of all removed constraints.</span></div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> c : removed_constraints) {</div><div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  <span class="keywordflow">if</span> (constraint_weights_[c] > 0.5) {</div><div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  constraint_weights_[c] -= 0.5;</div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  }</div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  }</div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  }</div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  removed_constraints_.erase(solve_data.neighborhood_id);</div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span> }</div><div class="line"><a name="l01366"></a><span class="lineno"> 1366</span> </div><div class="line"><a name="l01367"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced"> 1367</a></span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> <a class="code" href="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">WeightedRandomRelaxationNeighborhoodGenerator::Generate</a>(</div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& initial_solution, <span class="keywordtype">double</span> difficulty,</div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  absl::BitGenRef random) {</div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> target_size =</div><div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  std::round((1.0 - <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac">difficulty</a>) * num_removable_constraints_);</div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span> </div><div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  std::vector<int> removed_constraints;</div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span> </div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  <span class="comment">// Generate a random number between (0,1) = u[i] and use score[i] =</span></div><div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  <span class="comment">// u[i]^(1/w[i]) and then select top k items with largest scores.</span></div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  <span class="comment">// Reference: https://utopia.duth.gr/~pefraimi/research/data/2007EncOfAlg.pdf</span></div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  std::vector<std::pair<double, int>> constraint_removal_scores;</div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  std::uniform_real_distribution<double> random_var(0.0, 1.0);</div><div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> c = 0; c < constraint_weights_.size(); ++c) {</div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  <span class="keywordflow">if</span> (constraint_weights_[c] <= 0) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> u = random_var(random);</div><div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> score = std::pow(u, (1 / constraint_weights_[c]));</div><div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  constraint_removal_scores.push_back({score, c});</div><div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  }</div><div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  std::sort(constraint_removal_scores.rbegin(),</div><div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  constraint_removal_scores.rend());</div><div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < target_size; ++i) {</div><div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  removed_constraints.push_back(constraint_removal_scores[i].second);</div><div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  }</div><div class="line"><a name="l01391"></a><span class="lineno"> 1391</span> </div><div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> result = <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>.<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ac0763b7b9e44b9b30e78b9dd4da8e98a">RemoveMarkedConstraints</a>(removed_constraints);</div><div class="line"><a name="l01393"></a><span class="lineno"> 1393</span> </div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  absl::MutexLock mutex_lock(&<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a1485e729f641f9670e3f827e5f60d56c">generator_mutex_</a>);</div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  result.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#ab1aed7fa271dc86295d16cc730100306">id</a> = next_available_id_;</div><div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>  next_available_id_++;</div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  removed_constraints_.insert({result.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#ab1aed7fa271dc86295d16cc730100306">id</a>, removed_constraints});</div><div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l01399"></a><span class="lineno"> 1399</span> }</div><div class="line"><a name="l01400"></a><span class="lineno"> 1400</span> </div><div class="line"><a name="l01401"></a><span class="lineno"> 1401</span> } <span class="comment">// namespace sat</span></div><div class="line"><a name="l01402"></a><span class="lineno"> 1402</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="routing__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="namespaceoperations__research_1_1sat_html_a1d467595ed8fe5b85dc95328ee1c2770"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1d467595ed8fe5b85dc95328ee1c2770">operations_research::sat::UsedVariables</a></div><div class="ttdeci">std::vector< int > UsedVariables(const ConstraintProto &ct)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__utils_8cc_source.html#l00484">cp_model_utils.cc:484</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00491">base/logging.h:491</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_variable_proto_html_a24dcbf29c0d6cd766009a182a6484e3b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#a24dcbf29c0d6cd766009a182a6484e3b">operations_research::sat::IntegerVariableProto::name</a></div><div class="ttdeci">const std::string & name() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l06722">cp_model.pb.h:6722</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a1e4ba9b4d3bb23e61c0733c71925649a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a1e4ba9b4d3bb23e61c0733c71925649a">operations_research::sat::NeighborhoodGeneratorHelper::ActiveVariables</a></div><div class="ttdeci">std::vector< int > ActiveVariables() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00128">cp_model_lns.h:128</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35ac188c019178783e5be55110601309d7d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35ac188c019178783e5be55110601309d7d">operations_research::sat::ConstraintProto::kLinear</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03917">cp_model.pb.h:3917</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a4a43d435871f16c321861fa5de32df82"><div class="ttname"><a href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">operations_research::CapSub</a></div><div class="ttdeci">int64_t CapSub(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00156">saturated_arithmetic.h:156</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_adaptive_parameter_value_html_af9bf551154d37f48132472bd0f6dd848"><div class="ttname"><a href="classoperations__research_1_1_adaptive_parameter_value.html#af9bf551154d37f48132472bd0f6dd848">operations_research::AdaptiveParameterValue::Update</a></div><div class="ttdeci">void Update(int num_decreases, int num_increases)</div><div class="ttdef"><b>Definition:</b> <a href="adaptative__parameter__value_8h_source.html#l00058">adaptative_parameter_value.h:58</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aeef49408603258c45118e0ca3394442c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aeef49408603258c45118e0ca3394442c">operations_research::sat::GetRINSNeighborhood</a></div><div class="ttdeci">RINSNeighborhood GetRINSNeighborhood(const SharedResponseManager *response_manager, const SharedRelaxationSolutionRepository *relaxation_solutions, const SharedLPSolutionRepository *lp_solutions, SharedIncompleteSolutionManager *incomplete_solutions, absl::BitGenRef random)</div><div class="ttdef"><b>Definition:</b> <a href="rins_8cc_source.html#l00100">rins.cc:100</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_html_ab1aed7fa271dc86295d16cc730100306"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood.html#ab1aed7fa271dc86295d16cc730100306">operations_research::sat::Neighborhood::id</a></div><div class="ttdeci">int64_t id</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00054">cp_model_lns.h:54</a></div></div>
|
|
<div class="ttc" id="macros_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="alldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_a5f9869899e2c94786f9709684f1ecc56"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#a5f9869899e2c94786f9709684f1ecc56">operations_research::sat::ConstraintProto::constraint_case</a></div><div class="ttdeci">ConstraintCase constraint_case() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l11228">cp_model.pb.h:11228</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93"><div class="ttname"><a href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">operations_research::DimensionSchedulingStatus::INFEASIBLE</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35a8ab070d41f07187a3dc733f52455ffc0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a8ab070d41f07187a3dc733f52455ffc0">operations_research::sat::ConstraintProto::kAutomaton</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03923">cp_model.pb.h:3923</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html">operations_research::sat::NeighborhoodGeneratorHelper</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00067">cp_model_lns.h:67</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00702">base/logging.h:702</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_html_a8e672808c179f95cf4c626aef798bbc7"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood.html#a8e672808c179f95cf4c626aef798bbc7">operations_research::sat::Neighborhood::is_reduced</a></div><div class="ttdeci">bool is_reduced</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00041">cp_model_lns.h:41</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_neighborhood_generator_html_a8afb8ece44037532a15303d3533bdced"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">operations_research::sat::SchedulingNeighborhoodGenerator::Generate</a></div><div class="ttdeci">Neighborhood Generate(const CpSolverResponse &initial_solution, double difficulty, absl::BitGenRef random) final</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00948">cp_model_lns.cc:948</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ad57491858f7814f0a03845022b6de35e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ad57491858f7814f0a03845022b6de35e">operations_research::sat::GenerateSchedulingNeighborhoodForRelaxation</a></div><div class="ttdeci">Neighborhood GenerateSchedulingNeighborhoodForRelaxation(const absl::Span< const int > intervals_to_relax, const CpSolverResponse &initial_solution, const NeighborhoodGeneratorHelper &helper)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00880">cp_model_lns.cc:880</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html">operations_research::sat::NeighborhoodGenerator::SolveData</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00295">cp_model_lns.h:295</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35aaadb0c3370c597095e0cb7e768f04567"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35aaadb0c3370c597095e0cb7e768f04567">operations_research::sat::ConstraintProto::kBoolOr</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03905">cp_model.pb.h:3905</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_html_a04d448b3000c058b67ad17541473a317"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood.html#a04d448b3000c058b67ad17541473a317">operations_research::sat::Neighborhood::is_generated</a></div><div class="ttdeci">bool is_generated</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00037">cp_model_lns.h:37</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sub_solver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sub_solver.html">operations_research::sat::SubSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="subsolver_8h_source.html#l00041">subsolver.h:41</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_ac0763b7b9e44b9b30e78b9dd4da8e98a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ac0763b7b9e44b9b30e78b9dd4da8e98a">operations_research::sat::NeighborhoodGeneratorHelper::RemoveMarkedConstraints</a></div><div class="ttdeci">Neighborhood RemoveMarkedConstraints(const std::vector< int > &constraints_to_remove) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00432">cp_model_lns.cc:432</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a08c018489eb0c4c309f144780ebb8cce"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a08c018489eb0c4c309f144780ebb8cce">operations_research::sat::NeighborhoodGeneratorHelper::NeighborhoodGeneratorHelper</a></div><div class="ttdeci">NeighborhoodGeneratorHelper(CpModelProto const *model_proto, SatParameters const *parameters, SharedResponseManager *shared_response, SharedTimeLimit *shared_time_limit=nullptr, SharedBoundsManager *shared_bounds=nullptr)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00036">cp_model_lns.cc:36</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00703">base/logging.h:703</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_relax_random_variables_generator_html_a8afb8ece44037532a15303d3533bdced"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_relax_random_variables_generator.html#a8afb8ece44037532a15303d3533bdced">operations_research::sat::RelaxRandomVariablesGenerator::Generate</a></div><div class="ttdeci">Neighborhood Generate(const CpSolverResponse &initial_solution, double difficulty, absl::BitGenRef random) final</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00573">cp_model_lns.cc:573</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_abefd04794ae1f2f60e1fbf1938b8f262"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#abefd04794ae1f2f60e1fbf1938b8f262">operations_research::sat::NeighborhoodGeneratorHelper::IsActive</a></div><div class="ttdeci">bool IsActive(int var) const ABSL_SHARED_LOCKS_REQUIRED(graph_mutex_)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00193">cp_model_lns.cc:193</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00979">base/logging.h:979</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_interval_constraint_proto_html_a747f67b6d84b5800f31043239e5a0ad0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_interval_constraint_proto.html#a747f67b6d84b5800f31043239e5a0ad0">operations_research::sat::IntervalConstraintProto::size</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::int32 size() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l07523">cp_model.pb.h:7523</a></div></div>
|
|
<div class="ttc" id="default__search_8cc_html_ac673bc430bdc3fdaa09f7becf98ef267"><div class="ttname"><a href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a></div><div class="ttdeci">const std::string name</div><div class="ttdef"><b>Definition:</b> <a href="default__search_8cc_source.html#l00813">default_search.cc:813</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">operations_research::sat::NeighborhoodGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00253">cp_model_lns.h:253</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_aa16dc12c038fa24777852746e00fbc1b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#aa16dc12c038fa24777852746e00fbc1b">operations_research::sat::SatParameters::lns_expand_intervals_in_constraint_graph</a></div><div class="ttdeci">bool lns_expand_intervals_in_constraint_graph() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l07656">sat_parameters.pb.h:7656</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__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="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a307d968091a3bddbbce257cca9b79fbb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a307d968091a3bddbbce257cca9b79fbb">operations_research::sat::NeighborhoodGeneratorHelper::FixAllVariables</a></div><div class="ttdeci">Neighborhood FixAllVariables(const CpSolverResponse &initial_solution) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00459">cp_model_lns.cc:459</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a6aef4ca16709a75231ee1691c306c641"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6aef4ca16709a75231ee1691c306c641">operations_research::sat::NeighborhoodGeneratorHelper::TypeToConstraints</a></div><div class="ttdeci">const absl::Span< const int > TypeToConstraints(ConstraintProto::ConstraintCase type) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00165">cp_model_lns.h:165</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_relaxation_induced_neighborhood_generator_html_a18bd97b50e3170dabf1f537e19695054"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_relaxation_induced_neighborhood_generator.html#a18bd97b50e3170dabf1f537e19695054">operations_research::sat::RelaxationInducedNeighborhoodGenerator::ReadyToGenerate</a></div><div class="ttdeci">bool ReadyToGenerate() const override</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l01120">cp_model_lns.cc:1120</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__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="linear__programming__constraint_8h_html"><div class="ttname"><a href="linear__programming__constraint_8h.html">linear_programming_constraint.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_shared_response_manager_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_response_manager.html">operations_research::sat::SharedResponseManager</a></div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8h_source.html#l00173">synchronization.h:173</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35adf309905f42ce420be0b852996e4e650"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35adf309905f42ce420be0b852996e4e650">operations_research::sat::ConstraintProto::kIntProd</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03916">cp_model.pb.h:3916</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_expression_proto_html_aecb2bc94116e771000e5be7f8e3a7f6c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_expression_proto.html#aecb2bc94116e771000e5be7f8e3a7f6c">operations_research::sat::LinearExpressionProto::add_vars</a></div><div class="ttdeci">void add_vars(::PROTOBUF_NAMESPACE_ID::int32 value)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l06961">cp_model.pb.h:6961</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35a4ed0edf0e268cf40b0f09253fb1b261b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a4ed0edf0e268cf40b0f09253fb1b261b">operations_research::sat::ConstraintProto::kNoOverlap2D</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03928">cp_model.pb.h:3928</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html_a46765aa4aca21ce795a7291b85ca7719"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a46765aa4aca21ce795a7291b85ca7719">operations_research::sat::NeighborhoodGenerator::GetUCBScore</a></div><div class="ttdeci">double GetUCBScore(int64_t total_num_calls) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00471">cp_model_lns.cc:471</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html_a9ca5b99b3550503ca7bad8418e133156"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a9ca5b99b3550503ca7bad8418e133156">operations_research::sat::NeighborhoodGenerator::Synchronize</a></div><div class="ttdeci">void Synchronize()</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00478">cp_model_lns.cc:478</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ab9cb91893e59295e6a830766d4e4f3c7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ab9cb91893e59295e6a830766d4e4f3c7">operations_research::sat::ConstraintProto::routes</a></div><div class="ttdeci">const ::operations_research::sat::RoutesConstraintProto & routes() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l10519">cp_model.pb.h:10519</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_html_a44b6866eda48febe9f81e0a941caf8ce"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood.html#a44b6866eda48febe9f81e0a941caf8ce">operations_research::sat::Neighborhood::constraints_to_ignore</a></div><div class="ttdeci">std::vector< int > constraints_to_ignore</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00048">cp_model_lns.h:48</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html_abef5f55c3278c137faca92b8e433f8ea"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html#abef5f55c3278c137faca92b8e433f8ea">operations_research::sat::CpModelProto::variables_size</a></div><div class="ttdeci">int variables_size() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l12036">cp_model.pb.h:12036</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_r_i_n_s_neighborhood_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_r_i_n_s_neighborhood.html">operations_research::sat::RINSNeighborhood</a></div><div class="ttdef"><b>Definition:</b> <a href="rins_8h_source.html#l00057">rins.h:57</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html_ad03d1e2f94c4ca4c8004ac5355e6504a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html#ad03d1e2f94c4ca4c8004ac5355e6504a">operations_research::sat::CpModelProto::add_variables</a></div><div class="ttdeci">::operations_research::sat::IntegerVariableProto * add_variables()</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l12061">cp_model.pb.h:12061</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator_html_a8afb8ece44037532a15303d3533bdced"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">operations_research::sat::WeightedRandomRelaxationNeighborhoodGenerator::Generate</a></div><div class="ttdeci">Neighborhood Generate(const CpSolverResponse &initial_solution, double difficulty, absl::BitGenRef random) final</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l01367">cp_model_lns.cc:1367</a></div></div>
|
|
<div class="ttc" id="routing__flow_8cc_html_a64e7efc5529154ba56903e75f5300990"><div class="ttname"><a href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a></div><div class="ttdeci">int64_t tail</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00149">routing_flow.cc:149</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_solver_response_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_solver_response.html">operations_research::sat::CpSolverResponse</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l06264">cp_model.pb.h:6264</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a820708532165269860f70e4cbe8211be"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a820708532165269860f70e4cbe8211be">operations_research::sat::NeighborhoodGeneratorHelper::DifficultyMeansFullNeighborhood</a></div><div class="ttdeci">bool DifficultyMeansFullNeighborhood(double difficulty) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00140">cp_model_lns.h:140</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35afa67b6d38ac5fc27ad2cac3d2f392e39"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35afa67b6d38ac5fc27ad2cac3d2f392e39">operations_research::sat::ConstraintProto::kLinMax</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03913">cp_model.pb.h:3913</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_interval_constraint_proto_html_a50942b0c0a4615d9cc1a905f0aaeb514"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_interval_constraint_proto.html#a50942b0c0a4615d9cc1a905f0aaeb514">operations_research::sat::IntervalConstraintProto::has_start_view</a></div><div class="ttdeci">bool has_start_view() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l07540">cp_model.pb.h:7540</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35ac7267ea8eee1047e8b3d41f4526bcef6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35ac7267ea8eee1047e8b3d41f4526bcef6">operations_research::sat::ConstraintProto::kAllDiff</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03918">cp_model.pb.h:3918</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_interval_constraint_proto_html_aed31a3b1b4ed0e3de8d3c15228c624c1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_interval_constraint_proto.html#aed31a3b1b4ed0e3de8d3c15228c624c1">operations_research::sat::IntervalConstraintProto::end_view</a></div><div class="ttdeci">const ::operations_research::sat::LinearExpressionProto & end_view() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l07644">cp_model.pb.h:7644</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a4bd2e815ca2f702a4b6aa744b1ff3b82"><div class="ttname"><a href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a></div><div class="ttdeci">#define CHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00701">base/logging.h:701</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35aef651681e2d17f777063fddf191f4a99"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35aef651681e2d17f777063fddf191f4a99">operations_research::sat::ConstraintProto::kBoolAnd</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03906">cp_model.pb.h:3906</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35aa604bb0c8d30d6e0908b243370cf98a7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35aa604bb0c8d30d6e0908b243370cf98a7">operations_research::sat::ConstraintProto::kNoOverlap</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03927">cp_model.pb.h:3927</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_a1d7359b01bafc8348537c5501fd29e8d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a1d7359b01bafc8348537c5501fd29e8d">operations_research::sat::SatParameters::lns_focus_on_decision_variables</a></div><div class="ttdeci">bool lns_focus_on_decision_variables() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l07628">sat_parameters.pb.h:7628</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html_a43616719fac14b34582903ef03d114ac"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac">operations_research::sat::NeighborhoodGenerator::difficulty</a></div><div class="ttdeci">double difficulty() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00368">cp_model_lns.h:368</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_ada6ccc8374715ab309b47534deb735ac"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ada6ccc8374715ab309b47534deb735ac">operations_research::sat::NeighborhoodGeneratorHelper::ActiveVariablesWhileHoldingLock</a></div><div class="ttdeci">const std::vector< int > & ActiveVariablesWhileHoldingLock() const ABSL_SHARED_LOCKS_REQUIRED(graph_mutex_)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00148">cp_model_lns.h:148</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_acdc90a25e531e4180c495f4ecf2aca2e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#acdc90a25e531e4180c495f4ecf2aca2e">operations_research::sat::ConstraintProto::enforcement_literal</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::int32 enforcement_literal(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l09264">cp_model.pb.h:9264</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_ac18c0fe53e351d0a5d105b8bc7d53c08"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ac18c0fe53e351d0a5d105b8bc7d53c08">operations_research::sat::NeighborhoodGeneratorHelper::AddSolutionHinting</a></div><div class="ttdeci">void AddSolutionHinting(const CpSolverResponse &initial_solution, CpModelProto *model_proto) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00414">cp_model_lns.cc:414</a></div></div>
|
|
<div class="ttc" id="alldiff__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="classoperations__research_1_1sat_1_1_constraint_graph_neighborhood_generator_html_a8afb8ece44037532a15303d3533bdced"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_graph_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">operations_research::sat::ConstraintGraphNeighborhoodGenerator::Generate</a></div><div class="ttdeci">Neighborhood Generate(const CpSolverResponse &initial_solution, double difficulty, absl::BitGenRef random) final</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00697">cp_model_lns.cc:697</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ae2ed511035559d5e4361f0f9b70f2b1d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ae2ed511035559d5e4361f0f9b70f2b1d">operations_research::sat::ConstraintProto::no_overlap</a></div><div class="ttdeci">const ::operations_research::sat::NoOverlapConstraintProto & no_overlap() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l10963">cp_model.pb.h:10963</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html_a6a4544ca20489d70e302f5d6d374a012"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html#a6a4544ca20489d70e302f5d6d374a012">operations_research::sat::CpModelProto::variables</a></div><div class="ttdeci">const ::operations_research::sat::IntegerVariableProto & variables(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l12054">cp_model.pb.h:12054</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html">operations_research::sat::ConstraintProto</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03865">cp_model.pb.h:3865</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35a7da0520a1741193fc2422811d6af7ace"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a7da0520a1741193fc2422811d6af7ace">operations_research::sat::ConstraintProto::kCircuit</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03920">cp_model.pb.h:3920</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_variable_proto_html_a74f7eb449a6e182b73c8b4a1dbf15ce6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#a74f7eb449a6e182b73c8b4a1dbf15ce6">operations_research::sat::IntegerVariableProto::set_name</a></div><div class="ttdeci">void set_name(ArgT0 &&arg0, ArgT... args)</div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_variable_proto_html_a44f2e1631cdbf3b9a89a8afa8acb8ebd"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#a44f2e1631cdbf3b9a89a8afa8acb8ebd">operations_research::sat::IntegerVariableProto::clear_domain</a></div><div class="ttdeci">void clear_domain()</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l06771">cp_model.pb.h:6771</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35a6273d2906038e97dc4d54d89436a305a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a6273d2906038e97dc4d54d89436a305a">operations_research::sat::ConstraintProto::kCumulative</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03929">cp_model.pb.h:3929</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a9f348ae7c22fbaa73b72bc976455ab14"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">operations_research::sat::NeighborhoodGeneratorHelper::ModelProto</a></div><div class="ttdeci">const CpModelProto & ModelProto() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00188">cp_model_lns.h:188</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_r_i_n_s_neighborhood_html_a5d9d48f7fccd7a170af97ed1da2393f3"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_r_i_n_s_neighborhood.html#a5d9d48f7fccd7a170af97ed1da2393f3">operations_research::sat::RINSNeighborhood::fixed_vars</a></div><div class="ttdeci">std::vector< std::pair< int, int64_t > > fixed_vars</div><div class="ttdef"><b>Definition:</b> <a href="rins_8h_source.html#l00059">rins.h:59</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_a932cfc15d7d1be4de118889e7116af20"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#a932cfc15d7d1be4de118889e7116af20">operations_research::sat::ConstraintProto::cumulative</a></div><div class="ttdeci">const ::operations_research::sat::CumulativeConstraintProto & cumulative() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l11111">cp_model.pb.h:11111</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35a698b5d4e9d041ce67288f15e6a5053bc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a698b5d4e9d041ce67288f15e6a5053bc">operations_research::sat::ConstraintProto::kBoolXor</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03909">cp_model.pb.h:3909</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a722dba5a22f807fafa782b85eda60ba7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a722dba5a22f807fafa782b85eda60ba7">operations_research::sat::NeighborhoodGeneratorHelper::CopyAndFixVariables</a></div><div class="ttdeci">bool CopyAndFixVariables(const CpModelProto &source_model, const absl::flat_hash_set< int > &fixed_variables_set, const CpSolverResponse &initial_solution, CpModelProto *output_model) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00203">cp_model_lns.cc:203</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35a6cf91c5ead8753183a21a1561237d2d2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a6cf91c5ead8753183a21a1561237d2d2">operations_research::sat::ConstraintProto::kIntDiv</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03910">cp_model.pb.h:3910</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html">operations_research::sat::CpModelProto</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l05975">cp_model.pb.h:5975</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_routes_constraint_proto_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_routes_constraint_proto.html">operations_research::sat::RoutesConstraintProto</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l02842">cp_model.pb.h:2842</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ae4db23f10f5d4aad6d735f5a74cd6f8c"><div class="ttname"><a href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a></div><div class="ttdeci">#define CHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00700">base/logging.h:700</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35a6481aef04a17e76c15e4be2d03d3cc23"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a6481aef04a17e76c15e4be2d03d3cc23">operations_research::sat::ConstraintProto::kLinMin</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03915">cp_model.pb.h:3915</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35ad60570d9bed938f8b11385a7ba7f3508"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35ad60570d9bed938f8b11385a7ba7f3508">operations_research::sat::ConstraintProto::kExactlyOne</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03908">cp_model.pb.h:3908</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html_afce66afa8ae7776a449bba7313ea3559"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">operations_research::sat::CpModelProto::constraints</a></div><div class="ttdeci">const ::operations_research::sat::ConstraintProto & constraints(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l12094">cp_model.pb.h:12094</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html_a1485e729f641f9670e3f827e5f60d56c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a1485e729f641f9670e3f827e5f60d56c">operations_research::sat::NeighborhoodGenerator::generator_mutex_</a></div><div class="ttdeci">absl::Mutex generator_mutex_</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00393">cp_model_lns.h:393</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a67e2097ff88593dbd0ddc8f393ed9019"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">operations_research::sat::NeighborhoodGeneratorHelper::graph_mutex_</a></div><div class="ttdeci">absl::Mutex graph_mutex_</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00200">cp_model_lns.h:200</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood.html">operations_research::sat::Neighborhood</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00035">cp_model_lns.h:35</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35a60d782b0aafa6f70b6230ffd970b2c6b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a60d782b0aafa6f70b6230ffd970b2c6b">operations_research::sat::ConstraintProto::kAtMostOne</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03907">cp_model.pb.h:3907</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_variable_graph_neighborhood_generator_html_a8afb8ece44037532a15303d3533bdced"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variable_graph_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">operations_research::sat::VariableGraphNeighborhoodGenerator::Generate</a></div><div class="ttdeci">Neighborhood Generate(const CpSolverResponse &initial_solution, double difficulty, absl::BitGenRef random) final</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00630">cp_model_lns.cc:630</a></div></div>
|
|
<div class="ttc" id="cp__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="classoperations__research_1_1sat_1_1_interval_constraint_proto_html_a3d116cacd05c4c363803a0cecf4b35d3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_interval_constraint_proto.html#a3d116cacd05c4c363803a0cecf4b35d3">operations_research::sat::IntervalConstraintProto::size_view</a></div><div class="ttdeci">const ::operations_research::sat::LinearExpressionProto & size_view() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l07734">cp_model.pb.h:7734</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_interval_constraint_proto_html_aa6b928bcc0ba7e13564d1f18367a03a9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_interval_constraint_proto.html#aa6b928bcc0ba7e13564d1f18367a03a9">operations_research::sat::IntervalConstraintProto::start_view</a></div><div class="ttdeci">const ::operations_research::sat::LinearExpressionProto & start_view() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l07554">cp_model.pb.h:7554</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_variable_proto_html_a2266c77ad6db8de45560357c1436e558"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#a2266c77ad6db8de45560357c1436e558">operations_research::sat::IntegerVariableProto::add_domain</a></div><div class="ttdeci">void add_domain(::PROTOBUF_NAMESPACE_ID::int64 value)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l06788">cp_model.pb.h:6788</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_routing_random_neighborhood_generator_html_a8afb8ece44037532a15303d3533bdced"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_routing_random_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">operations_research::sat::RoutingRandomNeighborhoodGenerator::Generate</a></div><div class="ttdeci">Neighborhood Generate(const CpSolverResponse &initial_solution, double difficulty, absl::BitGenRef random) final</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00993">cp_model_lns.cc:993</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35a15204b185dfd4bef30727e0ca1c321b8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a15204b185dfd4bef30727e0ca1c321b8">operations_research::sat::ConstraintProto::kIntMin</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03914">cp_model.pb.h:3914</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_relax_random_constraints_generator_html_a8afb8ece44037532a15303d3533bdced"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_relax_random_constraints_generator.html#a8afb8ece44037532a15303d3533bdced">operations_research::sat::RelaxRandomConstraintsGenerator::Generate</a></div><div class="ttdeci">Neighborhood Generate(const CpSolverResponse &initial_solution, double difficulty, absl::BitGenRef random) final</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00582">cp_model_lns.cc:582</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a0e31a4150ae965379d0f05d51a0c1673"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a0e31a4150ae965379d0f05d51a0c1673">operations_research::sat::NeighborhoodGeneratorHelper::shared_response</a></div><div class="ttdeci">const SharedResponseManager & shared_response() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00191">cp_model_lns.h:191</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_interval_constraint_proto_html_a06944f2c8dd7c5c5715ad2c39ea92ea9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_interval_constraint_proto.html#a06944f2c8dd7c5c5715ad2c39ea92ea9">operations_research::sat::IntervalConstraintProto::end</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::int32 end() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l07503">cp_model.pb.h:7503</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_variable_proto_html_aa0d2b6ddea7cb960b90423ac48f555bf"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#aa0d2b6ddea7cb960b90423ac48f555bf">operations_research::sat::IntegerVariableProto::Clear</a></div><div class="ttdeci">PROTOBUF_ATTRIBUTE_REINITIALIZES void Clear() final</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8cc_source.html#l01154">cp_model.pb.cc:1154</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_afa21407ae134806ac4337d0b2473b210"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#afa21407ae134806ac4337d0b2473b210">operations_research::sat::NeighborhoodGeneratorHelper::Synchronize</a></div><div class="ttdeci">void Synchronize() override</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00057">cp_model_lns.cc:57</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35aacf7ff630234b9ffede42cdbc9d5be5a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35aacf7ff630234b9ffede42cdbc9d5be5a">operations_research::sat::ConstraintProto::kInverse</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03924">cp_model.pb.h:3924</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html_ac497558c5257914ba8ffdc4e95e59c21"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#ac497558c5257914ba8ffdc4e95e59c21">operations_research::sat::NeighborhoodGenerator::AdditionalProcessingOnSynchronize</a></div><div class="ttdeci">virtual void AdditionalProcessingOnSynchronize(const SolveData &solve_data)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00389">cp_model_lns.h:389</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_domain_html_a835826c4c5129b74553042a357a721ff"><div class="ttname"><a href="classoperations__research_1_1_domain.html#a835826c4c5129b74553042a357a721ff">operations_research::Domain::IntersectionWith</a></div><div class="ttdeci">Domain IntersectionWith(const Domain &domain) const</div><div class="ttdoc">Returns the intersection of D and domain.</div><div class="ttdef"><b>Definition:</b> <a href="sorted__interval__list_8cc_source.html#l00297">sorted_interval_list.cc:297</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_shared_time_limit_html"><div class="ttname"><a href="classoperations__research_1_1_shared_time_limit.html">operations_research::SharedTimeLimit</a></div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00339">time_limit.h:339</a></div></div>
|
|
<div class="ttc" id="base_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#l00890">base/logging.h:890</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a022e714f3c0cdff0f08e81d8e512684c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a022e714f3c0cdff0f08e81d8e512684c">operations_research::sat::NeighborhoodGeneratorHelper::VarToConstraint</a></div><div class="ttdeci">const std::vector< std::vector< int > > & VarToConstraint() const ABSL_SHARED_LOCKS_REQUIRED(graph_mutex_)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00159">cp_model_lns.h:159</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html_aeaf0da781ca9b370d96b7fbd3f74266a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html#aeaf0da781ca9b370d96b7fbd3f74266a">operations_research::sat::CpModelProto::constraints_size</a></div><div class="ttdeci">int constraints_size() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l12076">cp_model.pb.h:12076</a></div></div>
|
|
<div class="ttc" id="saturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.h</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00698">base/logging.h:698</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator_html_a325f8d16767c3a3912e429d856171150"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator.html#a325f8d16767c3a3912e429d856171150">operations_research::sat::WeightedRandomRelaxationNeighborhoodGenerator::WeightedRandomRelaxationNeighborhoodGenerator</a></div><div class="ttdeci">WeightedRandomRelaxationNeighborhoodGenerator(NeighborhoodGeneratorHelper const *helper, const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l01273">cp_model_lns.cc:1273</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a217ba4c51953c701a68d6572d79801f1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a217ba4c51953c701a68d6572d79801f1">operations_research::sat::UsedIntervals</a></div><div class="ttdeci">std::vector< int > UsedIntervals(const ConstraintProto &ct)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__utils_8cc_source.html#l00499">cp_model_utils.cc:499</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_circuit_constraint_proto_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_circuit_constraint_proto.html">operations_research::sat::CircuitConstraintProto</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l02639">cp_model.pb.h:2639</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a15cb168917371b5fb2d17b00e640de63"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a15cb168917371b5fb2d17b00e640de63">operations_research::sat::NeighborhoodGeneratorHelper::FullNeighborhood</a></div><div class="ttdeci">Neighborhood FullNeighborhood() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00231">cp_model_lns.cc:231</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35aa56df0a705ba98b87cf95d61122aa694"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35aa56df0a705ba98b87cf95d61122aa694">operations_research::sat::ConstraintProto::kDummyConstraint</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03930">cp_model.pb.h:3930</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35a88da6de97c8b4c4ce52616e0516b252a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a88da6de97c8b4c4ce52616e0516b252a">operations_research::sat::ConstraintProto::kRoutes</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03921">cp_model.pb.h:3921</a></div></div>
|
|
<div class="ttc" id="cp__model__solver_8cc_html_a6ac76d8a372013f67c4973012948ec84"><div class="ttname"><a href="cp__model__solver_8cc.html#a6ac76d8a372013f67c4973012948ec84">model_proto</a></div><div class="ttdeci">CpModelProto const * model_proto</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02011">cp_model_solver.cc:2011</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_interval_constraint_proto_html_aca5b15bc6ed70bb8769763d76312975d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_interval_constraint_proto.html#aca5b15bc6ed70bb8769763d76312975d">operations_research::sat::IntervalConstraintProto::start</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::int32 start() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l07483">cp_model.pb.h:7483</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_variable_proto_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_variable_proto.html">operations_research::sat::IntegerVariableProto</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l00268">cp_model.pb.h:268</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_a5e02c2fd22fa5bd71469514941d9db0b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#a5e02c2fd22fa5bd71469514941d9db0b">operations_research::sat::ConstraintProto::no_overlap_2d</a></div><div class="ttdeci">const ::operations_research::sat::NoOverlap2DConstraintProto & no_overlap_2d() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l11037">cp_model.pb.h:11037</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_shared_bounds_manager_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_bounds_manager.html">operations_research::sat::SharedBoundsManager</a></div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8h_source.html#l00401">synchronization.h:401</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_variable_proto_html_ae59a4dda240698b8ade8c726cc4f9974"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#ae59a4dda240698b8ade8c726cc4f9974">operations_research::sat::IntegerVariableProto::mutable_domain</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::RepeatedField< ::PROTOBUF_NAMESPACE_ID::int64 > * mutable_domain()</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l06806">cp_model.pb.h:6806</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_a1b9ecd55294987444aff02290740f25e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#a1b9ecd55294987444aff02290740f25e">operations_research::sat::ConstraintProto::circuit</a></div><div class="ttdeci">const ::operations_research::sat::CircuitConstraintProto & circuit() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l10445">cp_model.pb.h:10445</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00885">base/logging.h:885</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cumulative_constraint_proto_html_a20b8389b79079bde9b397de12921bf8b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cumulative_constraint_proto.html#a20b8389b79079bde9b397de12921bf8b">operations_research::sat::CumulativeConstraintProto::intervals</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::int32 intervals(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l08012">cp_model.pb.h:8012</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_domain_html"><div class="ttname"><a href="classoperations__research_1_1_domain.html">operations_research::Domain</a></div><div class="ttdoc">We call domain any subset of Int64 = [kint64min, kint64max].</div><div class="ttdef"><b>Definition:</b> <a href="sorted__interval__list_8h_source.html#l00081">sorted_interval_list.h:81</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__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="classoperations__research_1_1sat_1_1_cp_solver_response_html_ac6155ed23d1f37fa4f6b4fc666220723"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_solver_response.html#ac6155ed23d1f37fa4f6b4fc666220723">operations_research::sat::CpSolverResponse::solution</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::int64 solution(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l12506">cp_model.pb.h:12506</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html_a0c8b86bd60b4fc70cb653a12d50c2ce8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a0c8b86bd60b4fc70cb653a12d50c2ce8">operations_research::sat::NeighborhoodGenerator::IsRelaxationGenerator</a></div><div class="ttdeci">virtual bool IsRelaxationGenerator() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00282">cp_model_lns.h:282</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35a1476d98efc03ccb4224ae17f531fd05a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a1476d98efc03ccb4224ae17f531fd05a">operations_research::sat::ConstraintProto::kTable</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03922">cp_model.pb.h:3922</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35a7af079189afb65e704861b8cdfb301f4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a7af079189afb65e704861b8cdfb301f4">operations_research::sat::ConstraintProto::CONSTRAINT_NOT_SET</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03931">cp_model.pb.h:3931</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_expression_proto_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_expression_proto.html">operations_research::sat::LinearExpressionProto</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l00754">cp_model.pb.h:754</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_aa1b045e0bf63e7a0075deb32e4c7bd03"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#aa1b045e0bf63e7a0075deb32e4c7bd03">operations_research::sat::NeighborhoodGeneratorHelper::ConstraintToVar</a></div><div class="ttdeci">const std::vector< std::vector< int > > & ConstraintToVar() const ABSL_SHARED_LOCKS_REQUIRED(graph_mutex_)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00155">cp_model_lns.h:155</a></div></div>
|
|
<div class="ttc" id="cp__model_8pb_8h_html"><div class="ttname"><a href="cp__model_8pb_8h.html">cp_model.pb.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293"><div class="ttname"><a href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">operations_research::DimensionSchedulingStatus::OPTIMAL</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html_a6e5a7240e89f8a6665de1da5554603ec"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html#a6e5a7240e89f8a6665de1da5554603ec">operations_research::sat::CpModelProto::search_strategy</a></div><div class="ttdeci">const ::operations_research::sat::DecisionStrategyProto & search_strategy(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l12224">cp_model.pb.h:12224</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_shared_incomplete_solution_manager_html_afad444837cdc77c60e71abb9294753b9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_incomplete_solution_manager.html#afad444837cdc77c60e71abb9294753b9">operations_research::sat::SharedIncompleteSolutionManager::HasNewSolution</a></div><div class="ttdeci">bool HasNewSolution() const</div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8cc_source.html#l00084">synchronization.cc:84</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_shared_bounds_manager_html_af90af356f66a9a677d8d76be3fdd7356"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_bounds_manager.html#af90af356f66a9a677d8d76be3fdd7356">operations_research::sat::SharedBoundsManager::RegisterNewId</a></div><div class="ttdeci">int RegisterNewId()</div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8cc_source.html#l00727">synchronization.cc:727</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_aff6e1cdbf44ac50c3dcc0e5bb3591478"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#aff6e1cdbf44ac50c3dcc0e5bb3591478">operations_research::sat::NeighborhoodGeneratorHelper::GetRoutingPaths</a></div><div class="ttdeci">std::vector< std::vector< int > > GetRoutingPaths(const CpSolverResponse &initial_solution) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00299">cp_model_lns.cc:299</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_html_a9229601d319030879a64b25531c8a411"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411">operations_research::sat::Neighborhood::delta</a></div><div class="ttdeci">CpModelProto delta</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00047">cp_model_lns.h:47</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator_html_a8afb8ece44037532a15303d3533bdced"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">operations_research::sat::ConsecutiveConstraintsRelaxationNeighborhoodGenerator::Generate</a></div><div class="ttdeci">Neighborhood Generate(const CpSolverResponse &initial_solution, double difficulty, absl::BitGenRef random) final</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l01237">cp_model_lns.cc:1237</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35ae87040cc6afe119fcfb0b7fa16a16a8a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35ae87040cc6afe119fcfb0b7fa16a16a8a">operations_research::sat::ConstraintProto::kIntMod</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03911">cp_model.pb.h:3911</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_shared_bounds_manager_html_afcfefe147ae58ecfb365be6edf3d1821"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_bounds_manager.html#afcfefe147ae58ecfb365be6edf3d1821">operations_research::sat::SharedBoundsManager::GetChangedBounds</a></div><div class="ttdeci">void GetChangedBounds(int id, std::vector< int > *variables, std::vector< int64_t > *new_lower_bounds, std::vector< int64_t > *new_upper_bounds)</div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8cc_source.html#l00744">synchronization.cc:744</a></div></div>
|
|
<div class="ttc" id="integer_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
|
|
<div class="ttc" id="rins_8h_html"><div class="ttname"><a href="rins_8h.html">rins.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a8735c6fd1459361aa6696a77f8042bf1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a8735c6fd1459361aa6696a77f8042bf1">operations_research::sat::NeighborhoodGeneratorHelper::RelaxGivenVariables</a></div><div class="ttdeci">Neighborhood RelaxGivenVariables(const CpSolverResponse &initial_solution, const std::vector< int > &relaxed_variables) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00442">cp_model_lns.cc:442</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__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="classoperations__research_1_1sat_1_1_relaxation_induced_neighborhood_generator_html_a8afb8ece44037532a15303d3533bdced"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_relaxation_induced_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">operations_research::sat::RelaxationInducedNeighborhoodGenerator::Generate</a></div><div class="ttdeci">Neighborhood Generate(const CpSolverResponse &initial_solution, double difficulty, absl::BitGenRef random) final</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l01144">cp_model_lns.cc:1144</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a6cadaaf04201fe155b3eda7da2f63874"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6cadaaf04201fe155b3eda7da2f63874">operations_research::sat::NeighborhoodGeneratorHelper::FixGivenVariables</a></div><div class="ttdeci">Neighborhood FixGivenVariables(const CpSolverResponse &initial_solution, const absl::flat_hash_set< int > &variables_to_fix) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00384">cp_model_lns.cc:384</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_a2ec4b0b15e694caaaa842243694c51f5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#a2ec4b0b15e694caaaa842243694c51f5">operations_research::sat::ConstraintProto::interval</a></div><div class="ttdeci">const ::operations_research::sat::IntervalConstraintProto & interval() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l10889">cp_model.pb.h:10889</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_time_window_neighborhood_generator_html_a8afb8ece44037532a15303d3533bdced"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_time_window_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">operations_research::sat::SchedulingTimeWindowNeighborhoodGenerator::Generate</a></div><div class="ttdeci">Neighborhood Generate(const CpSolverResponse &initial_solution, double difficulty, absl::BitGenRef random) final</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00959">cp_model_lns.cc:959</a></div></div>
|
|
<div class="ttc" id="cp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a></div><div class="ttdeci">SatParameters parameters</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00116">cp_model_fz_solver.cc:116</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_expression_proto_html_ac7a72ff7bd5bde08ba00f944c5aa3168"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_expression_proto.html#ac7a72ff7bd5bde08ba00f944c5aa3168">operations_research::sat::LinearExpressionProto::vars</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::int32 vars(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l06950">cp_model.pb.h:6950</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__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="classoperations__research_1_1sat_1_1_linear_expression_proto_html_a9bb52f9d2a03820db9271cdae2ce97d5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_expression_proto.html#a9bb52f9d2a03820db9271cdae2ce97d5">operations_research::sat::LinearExpressionProto::add_coeffs</a></div><div class="ttdeci">void add_coeffs(::PROTOBUF_NAMESPACE_ID::int64 value)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l07008">cp_model.pb.h:7008</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html_a34c45a33de4f8a713e99bbf97d8d08d6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a34c45a33de4f8a713e99bbf97d8d08d6">operations_research::sat::NeighborhoodGenerator::ReadyToGenerate</a></div><div class="ttdeci">virtual bool ReadyToGenerate() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00467">cp_model_lns.cc:467</a></div></div>
|
|
<div class="ttc" id="expr__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="classoperations__research_1_1sat_1_1_interval_constraint_proto_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_interval_constraint_proto.html">operations_research::sat::IntervalConstraintProto</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l01642">cp_model.pb.h:1642</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_html_aaed94da4e4845ead42773bd4468a8899"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood.html#aaed94da4e4845ead42773bd4468a8899">operations_research::sat::Neighborhood::source_info</a></div><div class="ttdeci">std::string source_info</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00058">cp_model_lns.h:58</a></div></div>
|
|
<div class="ttc" id="synchronization_8h_html"><div class="ttname"><a href="synchronization_8h.html">synchronization.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_variable_proto_html_aa9cb4e4ba977c364365487c63ed32446"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#aa9cb4e4ba977c364365487c63ed32446">operations_research::sat::IntegerVariableProto::domain</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::int64 domain(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l06777">cp_model.pb.h:6777</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_routing_path_neighborhood_generator_html_a8afb8ece44037532a15303d3533bdced"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_routing_path_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">operations_research::sat::RoutingPathNeighborhoodGenerator::Generate</a></div><div class="ttdeci">Neighborhood Generate(const CpSolverResponse &initial_solution, double difficulty, absl::BitGenRef random) final</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l01012">cp_model_lns.cc:1012</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35a1b948ef604eecbb4da42feb6bed2beff"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a1b948ef604eecbb4da42feb6bed2beff">operations_research::sat::ConstraintProto::kInterval</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03926">cp_model.pb.h:3926</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35a86d0a62bd1b691a1b81446e7ced9cdf7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a86d0a62bd1b691a1b81446e7ced9cdf7">operations_research::sat::ConstraintProto::kReservoir</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03925">cp_model.pb.h:3925</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_no_overlap_constraint_proto_html_a20b8389b79079bde9b397de12921bf8b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_no_overlap_constraint_proto.html#a20b8389b79079bde9b397de12921bf8b">operations_research::sat::NoOverlapConstraintProto::intervals</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::int32 intervals(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l07823">cp_model.pb.h:7823</a></div></div>
|
|
<div class="ttc" id="vlog__is__on_8h_html_a956152cad330225654d128f35c00efce"><div class="ttname"><a href="vlog__is__on_8h.html#a956152cad330225654d128f35c00efce">VLOG_IS_ON</a></div><div class="ttdeci">#define VLOG_IS_ON(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="vlog__is__on_8h_source.html#l00041">vlog_is_on.h:41</a></div></div>
|
|
<div class="ttc" id="cp__model__mapping_8h_html"><div class="ttname"><a href="cp__model__mapping_8h.html">cp_model_mapping.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_routing_full_path_neighborhood_generator_html_a8afb8ece44037532a15303d3533bdced"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_routing_full_path_neighborhood_generator.html#a8afb8ece44037532a15303d3533bdced">operations_research::sat::RoutingFullPathNeighborhoodGenerator::Generate</a></div><div class="ttdeci">Neighborhood Generate(const CpSolverResponse &initial_solution, double difficulty, absl::BitGenRef random) final</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l01058">cp_model_lns.cc:1058</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_r_i_n_s_neighborhood_html_ab3c025953129f4798b0fe2eb84e95d6b"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_r_i_n_s_neighborhood.html#ab3c025953129f4798b0fe2eb84e95d6b">operations_research::sat::RINSNeighborhood::reduced_domain_vars</a></div><div class="ttdeci">std::vector< std::pair< int, std::pair< int64_t, int64_t > > > reduced_domain_vars</div><div class="ttdef"><b>Definition:</b> <a href="rins_8h_source.html#l00062">rins.h:62</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_shared_response_manager_html_a45cf335a09cbaae1337a45d7978d8892"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_response_manager.html#a45cf335a09cbaae1337a45d7978d8892">operations_research::sat::SharedResponseManager::SolutionsRepository</a></div><div class="ttdeci">const SharedSolutionRepository< int64_t > & SolutionsRepository() const</div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8h_source.html#l00303">synchronization.h:303</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ab1240060466ba48a36a4b36379bce26a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab1240060466ba48a36a4b36379bce26a">operations_research::sat::ReadDomainFromProto</a></div><div class="ttdeci">Domain ReadDomainFromProto(const ProtoWithDomain &proto)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__utils_8h_source.html#l00104">cp_model_utils.h:104</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a46540a899ab5e8fe1b55e12da55cbbe0"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a46540a899ab5e8fe1b55e12da55cbbe0">operations_research::sat::DomainInProtoContains</a></div><div class="ttdeci">bool DomainInProtoContains(const ProtoWithDomain &proto, int64_t value)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__utils_8h_source.html#l00084">cp_model_utils.h:84</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a8b0ea5233e98dcd85233c074a034fd05"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a8b0ea5233e98dcd85233c074a034fd05">operations_research::sat::NeighborhoodGeneratorHelper::GetActiveIntervals</a></div><div class="ttdeci">std::vector< int > GetActiveIntervals(const CpSolverResponse &initial_solution) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00243">cp_model_lns.cc:243</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html">operations_research::sat::SatParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00347">sat_parameters.pb.h:347</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_variable_proto_html_a0cf3e2ef19d1e580d07b8c50d95cfa1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_variable_proto.html#a0cf3e2ef19d1e580d07b8c50d95cfa1e">operations_research::sat::IntegerVariableProto::domain_size</a></div><div class="ttdeci">int domain_size() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l06768">cp_model.pb.h:6768</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_shared_solution_repository_html_a6d2b6f7951b60c786fdbefcbe7c3571f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_solution_repository.html#a6d2b6f7951b60c786fdbefcbe7c3571f">operations_research::sat::SharedSolutionRepository::NumSolutions</a></div><div class="ttdeci">int NumSolutions() const</div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8h_source.html#l00449">synchronization.h:449</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html_ab9746c6070379e1990d2fd2da7586398"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html#ab9746c6070379e1990d2fd2da7586398">operations_research::sat::CpModelProto::mutable_variables</a></div><div class="ttdeci">::operations_research::sat::IntegerVariableProto * mutable_variables(int index)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l12042">cp_model.pb.h:12042</a></div></div>
|
|
<div class="ttc" id="demon__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="optimization_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="classoperations__research_1_1sat_1_1_no_overlap2_d_constraint_proto_html_a1d854dc8740b68eb87ea131e9919b188"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_no_overlap2_d_constraint_proto.html#a1d854dc8740b68eb87ea131e9919b188">operations_research::sat::NoOverlap2DConstraintProto::x_intervals</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::int32 x_intervals(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l07874">cp_model.pb.h:7874</a></div></div>
|
|
<div class="ttc" id="resource_8cc_html_af92a8383a05fdf586a52263d358f5ada"><div class="ttname"><a href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a></div><div class="ttdeci">IntervalVar * interval</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00100">resource.cc:100</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html_acbd503b89d1dc3dd85dfa9e0e5058472"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">operations_research::sat::NeighborhoodGenerator::helper_</a></div><div class="ttdeci">const NeighborhoodGeneratorHelper & helper_</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00392">cp_model_lns.h:392</a></div></div>
|
|
<div class="ttc" id="demon__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="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35acd33b6e972e153ab1a911c84c9585a42"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35acd33b6e972e153ab1a911c84c9585a42">operations_research::sat::ConstraintProto::kElement</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03919">cp_model.pb.h:3919</a></div></div>
|
|
<div class="ttc" id="cp__model__lns_8h_html"><div class="ttname"><a href="cp__model__lns_8h.html">cp_model_lns.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35a4d3274f97b77566895b3a239ed62bb72"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a4d3274f97b77566895b3a239ed62bb72">operations_research::sat::ConstraintProto::kIntMax</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03912">cp_model.pb.h:3912</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__lns_8cc.html">cp_model_lns.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|