236 lines
202 KiB
HTML
236 lines
202 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.h Source File</title>
|
||
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
||
<script type="text/javascript" src="jquery.js"></script>
|
||
<script type="text/javascript" src="dynsections.js"></script>
|
||
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
||
<script type="text/javascript" src="resize.js"></script>
|
||
<script type="text/javascript" src="navtreedata.js"></script>
|
||
<script type="text/javascript" src="navtree.js"></script>
|
||
<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.2</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_8h_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.h</div> </div>
|
||
</div><!--header-->
|
||
<div class="contents">
|
||
<a href="cp__model__lns_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-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">#ifndef OR_TOOLS_SAT_CP_MODEL_LNS_H_</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#define OR_TOOLS_SAT_CP_MODEL_LNS_H_</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <cstdint></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "absl/random/bit_gen_ref.h"</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "absl/synchronization/mutex.h"</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "absl/types/span.h"</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</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="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="cp__model__presolve_8h.html">ortools/sat/cp_model_presolve.h</a>"</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="sat_2model_8h.html">ortools/sat/model.h</a>"</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="subsolver_8h.html">ortools/sat/subsolver.h</a>"</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="synchronization_8h.html">ortools/sat/synchronization.h</a>"</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="adaptative__parameter__value_8h.html">ortools/util/adaptative_parameter_value.h</a>"</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="util_2logging_8h.html">ortools/util/logging.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"> 36</span> <span class="comment">// Neighborhood returned by Neighborhood generators.</span></div><div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood.html"> 37</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> {</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="comment">// True if neighborhood generator was able to generate a neighborhood.</span></div><div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood.html#a04d448b3000c058b67ad17541473a317"> 39</a></span>  <span class="keywordtype">bool</span> <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="l00040"></a><span class="lineno"> 40</span> </div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">// True if an optimal solution to the neighborhood is also an optimal solution</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="comment">// to the original model.</span></div><div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood.html#a8e672808c179f95cf4c626aef798bbc7"> 43</a></span>  <span class="keywordtype">bool</span> <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="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// True if this neighborhood was just obtained by fixing some variables.</span></div><div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood.html#a7f3afd61b6944986fd9d5f92fc187768"> 46</a></span>  <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a7f3afd61b6944986fd9d5f92fc187768">is_simple</a> = <span class="keyword">false</span>;</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> </div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="comment">// Specification of the delta between the initial model and the lns fragment.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">// The delta will contains all variables from the initial model, potentially</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">// with updated domains.</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// It can contains new variables and new constraints, and solution hinting.</span></div><div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411"> 52</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html">CpModelProto</a> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a9229601d319030879a64b25531c8a411">delta</a>;</div><div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood.html#a44b6866eda48febe9f81e0a941caf8ce"> 53</a></span>  std::vector<int> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a44b6866eda48febe9f81e0a941caf8ce">constraints_to_ignore</a>;</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> </div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">// Neighborhood Id. Used to identify the neighborhood by a generator.</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="comment">// Currently only used by WeightedRandomRelaxationNeighborhoodGenerator.</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// TODO(user): Make sure that the id is unique for each generated</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// neighborhood for each generator.</span></div><div class="line"><a name="l00059"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood.html#ab1aed7fa271dc86295d16cc730100306"> 59</a></span>  int64_t <span class="keywordtype">id</span> = 0;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> </div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// Used for identifying the source of the neighborhood if it is generated</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">// using solution repositories.</span></div><div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood.html#aaed94da4e4845ead42773bd4468a8899"> 63</a></span>  std::string <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#aaed94da4e4845ead42773bd4468a8899">source_info</a> = <span class="stringliteral">""</span>;</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// Statistic, only filled when is_simple is true.</span></div><div class="line"><a name="l00066"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood.html#a240d377e7dfd0f7b32cf859acf8943db"> 66</a></span>  <span class="keywordtype">int</span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a240d377e7dfd0f7b32cf859acf8943db">num_relaxed_variables</a> = 0;</div><div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood.html#a3828e04dced399427f06832424b9b4ae"> 67</a></span>  <span class="keywordtype">int</span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a3828e04dced399427f06832424b9b4ae">num_relaxed_variables_in_objective</a> = 0;</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="comment">// Only filled when is_simple is true. If we solve the fragment to optimality,</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="comment">// then we can just fix the variable listed here to that optimal solution.</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">//</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// This can happen if the neighborhood fully cover some part that are</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// completely independent from the rest of the model. Like for instance an</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// unused but not yet fixed variable.</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">//</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// WARNING: all such variables should be fixed at once in a lock-like manner,</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// because they can be multiple optimal solutions on these variables.</span></div><div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood.html#a29e58402f533badc9e8836044bc2df09"> 78</a></span>  std::vector<int> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html#a29e58402f533badc9e8836044bc2df09">variables_that_can_be_fixed_to_local_optimum</a>;</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> };</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment">// Contains pre-computed information about a given CpModelProto that is meant</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// to be used to generate LNS neighborhood. This class can be shared between</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment">// more than one generator in order to reduce memory usage.</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment">//</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment">// Note that its implement the SubSolver interface to be able to Synchronize()</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment">// the bounds of the base problem with the external world.</span></div><div class="line"><a name="l00087"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html"> 87</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html">NeighborhoodGeneratorHelper</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html">SubSolver</a> {</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a08c018489eb0c4c309f144780ebb8cce">NeighborhoodGeneratorHelper</a>(<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>,</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <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="l00091"></a><span class="lineno"> 91</span>  <a class="code" href="classoperations__research_1_1sat_1_1_shared_response_manager.html">SharedResponseManager</a>* <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a0e31a4150ae965379d0f05d51a0c1673">shared_response</a>,</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <a class="code" href="classoperations__research_1_1_shared_time_limit.html">SharedTimeLimit</a>* shared_time_limit = <span class="keyword">nullptr</span>,</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <a class="code" href="classoperations__research_1_1sat_1_1_shared_bounds_manager.html">SharedBoundsManager</a>* shared_bounds = <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> </div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// SubSolver interface.</span></div><div class="line"><a name="l00096"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ab25d3ac59ae6adc23d30b5fdc892b812"> 96</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ab25d3ac59ae6adc23d30b5fdc892b812">TaskIsAvailable</a>()<span class="keyword"> override </span>{ <span class="keywordflow">return</span> <span class="keyword">false</span>; }</div><div class="line"><a name="l00097"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a474b2f12e1648545bb78f734d14c4280"> 97</a></span>  std::function<void()> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a474b2f12e1648545bb78f734d14c4280">GenerateTask</a>(int64_t task_id)<span class="keyword"> override </span>{ <span class="keywordflow">return</span> {}; }</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#afa21407ae134806ac4337d0b2473b210">Synchronize</a>() <span class="keyword">override</span>;</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// Returns the LNS fragment where the given variables are fixed to the value</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// they take in the given solution.</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</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#a6823902ca9e8cb58c90a9f086c647da6">FixGivenVariables</a>(</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>& base_solution,</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</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="l00105"></a><span class="lineno"> 105</span> </div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// Returns the neighborhood where the given constraints are removed.</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</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">RemoveMarkedConstraints</a>(</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">const</span> std::vector<int>& constraints_to_remove) <span class="keyword">const</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">// Returns the LNS fragment which will relax all inactive variables and all</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="comment">// variables in relaxed_variables.</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</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">RelaxGivenVariables</a>(</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</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="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">const</span> std::vector<int>& relaxed_variables) <span class="keyword">const</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>  <span class="comment">// Returns a trivial model by fixing all active variables to the initial</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// solution values.</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</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">FixAllVariables</a>(<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="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// Returns a neighborhood that correspond to the full problem.</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</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">FullNeighborhood</a>() <span class="keyword">const</span>;</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> </div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="comment">// Returns a neighborhood that will just be skipped.</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="comment">// It usually indicate that the generator failed to generated a neighborhood.</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</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#a82a453ea79e75c81ab03ba9da8c40ce5">NoNeighborhood</a>() <span class="keyword">const</span>;</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>  <span class="comment">// Adds solution hinting to the neighborhood from the value of the initial</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="comment">// solution.</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ac18c0fe53e351d0a5d105b8bc7d53c08">AddSolutionHinting</a>(<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="l00130"></a><span class="lineno"> 130</span>  <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="l00131"></a><span class="lineno"> 131</span> </div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="comment">// Indicates if the variable can be frozen. It happens if the variable is non</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="comment">// constant, and if it is a decision variable, or if</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="comment">// focus_on_decision_variables is false.</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#abefd04794ae1f2f60e1fbf1938b8f262">IsActive</a>(<span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) <span class="keyword">const</span> ABSL_SHARED_LOCKS_REQUIRED(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>);</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="comment">// Returns the list of "active" variables.</span></div><div class="line"><a name="l00138"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a1e4ba9b4d3bb23e61c0733c71925649a"> 138</a></span>  std::vector<int> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a1e4ba9b4d3bb23e61c0733c71925649a">ActiveVariables</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  std::vector<int> result;</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  absl::ReaderMutexLock 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="l00141"></a><span class="lineno"> 141</span>  result = active_variables_;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  }</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> </div><div class="line"><a name="l00145"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a4c701668fe51d4444b40e6eec5820c89"> 145</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a4c701668fe51d4444b40e6eec5820c89">NumActiveVariables</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  absl::ReaderMutexLock 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="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">return</span> active_variables_.size();</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  }</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div><div class="line"><a name="l00150"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a820708532165269860f70e4cbe8211be"> 150</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a820708532165269860f70e4cbe8211be">DifficultyMeansFullNeighborhood</a>(<span class="keywordtype">double</span> difficulty)<span class="keyword"> const </span>{</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  absl::ReaderMutexLock 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="l00152"></a><span class="lineno"> 152</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> target_size = std::ceil(difficulty * active_variables_.size());</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">return</span> target_size == active_variables_.size();</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  }</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> </div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">// Returns the vector of active variables. The graph_mutex_ must be</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="comment">// locked before calling this method.</span></div><div class="line"><a name="l00158"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ada6ccc8374715ab309b47534deb735ac"> 158</a></span>  <span class="keyword">const</span> std::vector<int>& <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ada6ccc8374715ab309b47534deb735ac">ActiveVariablesWhileHoldingLock</a>() const</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  ABSL_SHARED_LOCKS_REQUIRED(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>) {</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">return</span> active_variables_;</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>  <span class="comment">// Constraints <-> Variables graph.</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="comment">// Note that only non-constant variable are listed here.</span></div><div class="line"><a name="l00165"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#aa1b045e0bf63e7a0075deb32e4c7bd03"> 165</a></span>  <span class="keyword">const</span> std::vector<std::vector<int>>& <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#aa1b045e0bf63e7a0075deb32e4c7bd03">ConstraintToVar</a>() const</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  ABSL_SHARED_LOCKS_REQUIRED(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>) {</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">return</span> constraint_to_var_;</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  }</div><div class="line"><a name="l00169"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a022e714f3c0cdff0f08e81d8e512684c"> 169</a></span>  <span class="keyword">const</span> std::vector<std::vector<int>>& <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a022e714f3c0cdff0f08e81d8e512684c">VarToConstraint</a>() const</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  ABSL_SHARED_LOCKS_REQUIRED(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>) {</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordflow">return</span> var_to_constraint_;</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  }</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> </div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="comment">// Returns all the constraints indices of a given type.</span></div><div class="line"><a name="l00175"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6aef4ca16709a75231ee1691c306c641"> 175</a></span>  <span class="keyword">const</span> absl::Span<const int> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6aef4ca16709a75231ee1691c306c641">TypeToConstraints</a>(</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35">ConstraintProto::ConstraintCase</a> type)<span class="keyword"> const </span>{</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">if</span> (type >= type_to_constraints_.size()) <span class="keywordflow">return</span> {};</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">return</span> absl::MakeSpan(type_to_constraints_[type]);</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> </div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">// Returns the list of indices of active interval constraints according</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// to the initial_solution and the parameter lns_focus_on_performed_intervals.</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="comment">// If true, this method returns the list of performed intervals in the</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="comment">// solution. If false, it returns all intervals of the model.</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  std::vector<int> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a8b0ea5233e98dcd85233c074a034fd05">GetActiveIntervals</a>(</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</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="l00187"></a><span class="lineno"> 187</span> </div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">// Returns one sub-vector per circuit or per single vehicle ciruit in a routes</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="comment">// constraints. Each circuit is non empty, and does not contain any</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// self-looping arcs. Path are sorted, starting from the arc with the lowest</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// tail index, and going in sequence up to the last arc before the circuit is</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">// closed. Each entry correspond to the arc literal on the circuit.</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  std::vector<std::vector<int>> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#aff6e1cdbf44ac50c3dcc0e5bb3591478">GetRoutingPaths</a>(</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</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="l00195"></a><span class="lineno"> 195</span> </div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="comment">// The initial problem.</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="comment">// Note that the domain of the variables are not updated here.</span></div><div class="line"><a name="l00198"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14"> 198</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html">CpModelProto</a>& <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a9f348ae7c22fbaa73b72bc976455ab14">ModelProto</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> model_proto_; }</div><div class="line"><a name="l00199"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#af4a8d38991f3497e048a3b56b830087f"> 199</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>& <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#af4a8d38991f3497e048a3b56b830087f">Parameters</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> parameters_; }</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> </div><div class="line"><a name="l00201"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a0e31a4150ae965379d0f05d51a0c1673"> 201</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_shared_response_manager.html">SharedResponseManager</a>& <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a0e31a4150ae965379d0f05d51a0c1673">shared_response</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordflow">return</span> *shared_response_;</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  }</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> </div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="comment">// TODO(user): Refactor the class to be thread-safe instead, it should be</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="comment">// safer and more easily maintenable. Some complication with accessing the</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="comment">// variable<->constraint graph efficiently though.</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> </div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="comment">// Note: This mutex needs to be public for thread annotations.</span></div><div class="line"><a name="l00210"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019"> 210</a></span>  <span class="keyword">mutable</span> absl::Mutex <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>;</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> </div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="comment">// TODO(user): Display LNS statistics through the StatisticsString()</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="comment">// method.</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> </div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="comment">// Precompute stuff that will never change. During the execution, only the</span></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="comment">// domain of the variable will change, so data that only depends on the</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">// constraints need to be computed just once.</span></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordtype">void</span> InitializeHelperData();</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> </div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="comment">// Recompute most of the class member. This needs to be called when the</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="comment">// domains of the variables are updated.</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordtype">void</span> RecomputeHelperData();</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> </div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="comment">// Indicates if a variable is fixed in the model.</span></div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordtype">bool</span> IsConstant(<span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) <span class="keyword">const</span> ABSL_SHARED_LOCKS_REQUIRED(domain_mutex_);</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="comment">// Returns true if the domain on the objective is constraining and we might</span></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="comment">// get a lower objective value at optimum without it.</span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordtype">bool</span> ObjectiveDomainIsConstraining() const</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  ABSL_SHARED_LOCKS_REQUIRED(domain_mutex_);</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> </div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  const <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>& parameters_;</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  const <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html">CpModelProto</a>& model_proto_;</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordtype">int</span> shared_bounds_id_;</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <a class="code" href="classoperations__research_1_1_shared_time_limit.html">SharedTimeLimit</a>* shared_time_limit_;</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</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="l00238"></a><span class="lineno"> 238</span>  <a class="code" href="classoperations__research_1_1sat_1_1_shared_response_manager.html">SharedResponseManager</a>* shared_response_;</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <a class="code" href="classoperations__research_1_1sat_1_1_shared_relaxation_solution_repository.html">SharedRelaxationSolutionRepository</a>* shared_relaxation_solutions_;</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span> </div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="comment">// This proto will only contain the field variables() with an updated version</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="comment">// of the domains compared to model_proto_.variables(). We do it like this to</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="comment">// reduce the memory footprint of the helper when the model is large.</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="comment">//</span></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="comment">// TODO(user): Use custom domain repository rather than a proto?</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html">CpModelProto</a> model_proto_with_only_variables_ ABSL_GUARDED_BY(domain_mutex_);</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> </div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="comment">// Constraints by types. This never changes.</span></div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  std::vector<std::vector<<span class="keywordtype">int</span>>> type_to_constraints_;</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> </div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="comment">// Whether a model_proto_ variable appear in the objective. This never</span></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="comment">// changes.</span></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  std::vector<<span class="keywordtype">bool</span>> is_in_objective_;</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> </div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="comment">// A copy of CpModelProto where we did some basic presolving to remove all</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="comment">// constraint that are always true. The Variable-Constraint graph is based on</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="comment">// this model. Note that only the constraints field is present here.</span></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html">CpModelProto</a> simplied_model_proto_ ABSL_GUARDED_BY(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>);</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>  <span class="comment">// Variable-Constraint graph.</span></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="comment">// We replace an interval by its variables in the scheduling constraints.</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="comment">//</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="comment">// TODO(user): Note that the objective is not considered here. Which is fine</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="comment">// except if the objective domain is constraining.</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  std::vector<std::vector<<span class="keywordtype">int</span>>> constraint_to_var_</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  ABSL_GUARDED_BY(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>);</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  std::vector<std::vector<<span class="keywordtype">int</span>>> var_to_constraint_</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  ABSL_GUARDED_BY(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>);</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> </div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="comment">// Connected components of the variable-constraint graph. If a variable is</span></div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="comment">// constant, it will not appear in any component and</span></div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="comment">// var_to_component_index_[var] will be -1.</span></div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  std::vector<std::vector<<span class="keywordtype">int</span>>> components_ ABSL_GUARDED_BY(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>);</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  std::vector<<span class="keywordtype">int</span>> var_to_component_index_ ABSL_GUARDED_BY(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>);</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> </div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// The set of active variables which is currently the list of non-constant</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">// variables. It is stored both as a list and as a set (using a Boolean</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">// vector).</span></div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  std::vector<<span class="keywordtype">bool</span>> active_variables_set_ ABSL_GUARDED_BY(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>);</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  std::vector<<span class="keywordtype">int</span>> active_variables_ ABSL_GUARDED_BY(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a67e2097ff88593dbd0ddc8f393ed9019">graph_mutex_</a>);</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> </div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  mutable <a class="code" href="namespaceabsl.html">absl</a>::Mutex domain_mutex_;</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> </div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> <span class="comment">// Base class for a CpModelProto neighborhood generator.</span></div><div class="line"><a name="l00286"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html"> 286</a></span> class <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a> {</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00288"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a60349be3472ae33af45a70cd5480a7e3"> 288</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a60349be3472ae33af45a70cd5480a7e3">NeighborhoodGenerator</a>(<span class="keyword">const</span> std::string& <a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>,</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html">NeighborhoodGeneratorHelper</a> <span class="keyword">const</span>* helper)</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a723d30392e2c4f36252de0528a1b246d">name_</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>), helper_(*helper), difficulty_(0.5) {}</div><div class="line"><a name="l00291"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a186eb8a0761d3a80e350e5d6eb6412a1"> 291</a></span>  <span class="keyword">virtual</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a186eb8a0761d3a80e350e5d6eb6412a1">~NeighborhoodGenerator</a>() {}</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>  <span class="comment">// Generates a "local" subproblem for the given seed.</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="comment">//</span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="comment">// The difficulty will be in [0, 1] and is related to the asked neighborhood</span></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="comment">// size (and thus local problem difficulty). A difficulty of 0.0 means empty</span></div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="comment">// neighborhood and a difficulty of 1.0 means the full problem. The algorithm</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="comment">// should try to generate a neighborhood according to this difficulty which</span></div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="comment">// will be dynamically adjusted depending on whether or not we can solve the</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="comment">// subproblem in a given time limit.</span></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="comment">//</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="comment">// The given initial_solution should contain a feasible solution to the</span></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="comment">// initial CpModelProto given to this class. Any solution to the returned</span></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="comment">// CPModelProto should also be valid solution to the same initial model.</span></div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="comment">//</span></div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="comment">// This function should be thread-safe.</span></div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keyword">virtual</span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> Generate(<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="l00308"></a><span class="lineno"> 308</span>  <span class="keywordtype">double</span> difficulty, absl::BitGenRef random) = 0;</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> </div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="comment">// Returns true if the neighborhood generator can generate a neighborhood.</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keyword">virtual</span> <span class="keywordtype">bool</span> ReadyToGenerate() <span class="keyword">const</span>;</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> </div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="comment">// Returns true if the neighborhood generator generates relaxation of the</span></div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="comment">// given problem.</span></div><div class="line"><a name="l00315"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a0c8b86bd60b4fc70cb653a12d50c2ce8"> 315</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a0c8b86bd60b4fc70cb653a12d50c2ce8">IsRelaxationGenerator</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <span class="keyword">false</span>; }</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> </div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="comment">// Uses UCB1 algorithm to compute the score (Multi armed bandit problem).</span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="comment">// Details are at</span></div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="comment">// https://lilianweng.github.io/lil-log/2018/01/23/the-multi-armed-bandit-problem-and-its-solutions.html.</span></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="comment">// 'total_num_calls' should be the sum of calls across all generators part of</span></div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="comment">// the multi armed bandit problem.</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="comment">// If the generator is called less than 10 times then the method returns</span></div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="comment">// infinity as score in order to get more data about the generator</span></div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="comment">// performance.</span></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keywordtype">double</span> GetUCBScore(int64_t total_num_calls) <span class="keyword">const</span>;</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> </div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="comment">// Adds solve data about one "solved" neighborhood.</span></div><div class="line"><a name="l00328"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html"> 328</a></span>  <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html">SolveData</a> {</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="comment">// Neighborhood Id. Used to identify the neighborhood by a generator.</span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="comment">// Currently only used by WeightedRandomRelaxationNeighborhoodGenerator.</span></div><div class="line"><a name="l00331"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#ad578a0760fe4217d9cb5552835cf0572"> 331</a></span>  int64_t neighborhood_id = 0;</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span> </div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="comment">// The status of the sub-solve.</span></div><div class="line"><a name="l00334"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a91dacddd9f775730c8d424d2ab4d76ac"> 334</a></span>  <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815">CpSolverStatus</a> status = <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a6ce26a62afab55d7606ad4e92428b30c">CpSolverStatus::UNKNOWN</a>;</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> </div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="comment">// The difficulty when this neighborhood was generated.</span></div><div class="line"><a name="l00337"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a71013162baa979e0b8780100905cf700"> 337</a></span>  <span class="keywordtype">double</span> difficulty = 0.0;</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> </div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="comment">// The determinitic time limit given to the solver for this neighborhood.</span></div><div class="line"><a name="l00340"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a4f572c68b7bf3aac70b3f5292398ff7b"> 340</a></span>  <span class="keywordtype">double</span> deterministic_limit = 0.0;</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>  <span class="comment">// The time it took to solve this neighborhood.</span></div><div class="line"><a name="l00343"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#afc5fa55f61560324377e4f42d4a9211f"> 343</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#ae525d235b02bcfc962d845e28f5f0125">deterministic_time</a> = 0.0;</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> </div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="comment">// Objective information. These only refer to the "internal" objective</span></div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="comment">// without scaling or offset so we are exact and it is always in the</span></div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="comment">// minimization direction.</span></div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="comment">// - The initial best objective is the one of the best known solution at the</span></div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="comment">// time the neighborhood was generated.</span></div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="comment">// - The base objective is the one of the base solution from which this</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="comment">// neighborhood was generated.</span></div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="comment">// - The new objective is the objective of the best solution found by</span></div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="comment">// solving the neighborhood.</span></div><div class="line"><a name="l00354"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a2b7499dfe1d827cdca46593256705cd4"> 354</a></span>  IntegerValue initial_best_objective = IntegerValue(0);</div><div class="line"><a name="l00355"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a1092ef5699db303eacd67586fe6273f4"> 355</a></span>  IntegerValue base_objective = IntegerValue(0);</div><div class="line"><a name="l00356"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a6bdd919d4fe97909496a23f7d85b5d8e"> 356</a></span>  IntegerValue new_objective = IntegerValue(0);</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> </div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="comment">// Bounds data is only used by relaxation neighborhoods.</span></div><div class="line"><a name="l00359"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a2579a2fccfe41ac8b5d8dac1c7f93607"> 359</a></span>  IntegerValue initial_best_objective_bound = IntegerValue(0);</div><div class="line"><a name="l00360"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#abfd9e74380811ea081037db464d22f2f"> 360</a></span>  IntegerValue new_objective_bound = IntegerValue(0);</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span> </div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="comment">// This is just used to construct a deterministic order for the updates.</span></div><div class="line"><a name="l00363"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a00195aa190a0eea4cd4ab808056bfbfd"> 363</a></span>  <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a00195aa190a0eea4cd4ab808056bfbfd">operator<</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html">SolveData</a>& o)<span class="keyword"> const </span>{</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">return</span> std::tie(status, difficulty, deterministic_limit,</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#ae525d235b02bcfc962d845e28f5f0125">deterministic_time</a>, initial_best_objective,</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  base_objective, new_objective,</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  initial_best_objective_bound, new_objective_bound,</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  neighborhood_id) <</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  std::tie(o.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a91dacddd9f775730c8d424d2ab4d76ac">status</a>, o.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a71013162baa979e0b8780100905cf700">difficulty</a>, o.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a4f572c68b7bf3aac70b3f5292398ff7b">deterministic_limit</a>,</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  o.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#afc5fa55f61560324377e4f42d4a9211f">deterministic_time</a>, o.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a2b7499dfe1d827cdca46593256705cd4">initial_best_objective</a>,</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  o.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a1092ef5699db303eacd67586fe6273f4">base_objective</a>, o.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a6bdd919d4fe97909496a23f7d85b5d8e">new_objective</a>,</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  o.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a2579a2fccfe41ac8b5d8dac1c7f93607">initial_best_objective_bound</a>, o.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#abfd9e74380811ea081037db464d22f2f">new_objective_bound</a>,</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  o.<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#ad578a0760fe4217d9cb5552835cf0572">neighborhood_id</a>);</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  }</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  };</div><div class="line"><a name="l00376"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a24d01ebae72ddcb6d698c97add3f41a5"> 376</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a24d01ebae72ddcb6d698c97add3f41a5">AddSolveData</a>(<a class="code" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html">SolveData</a> data) {</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  absl::MutexLock mutex_lock(&generator_mutex_);</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  solve_data_.push_back(data);</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="comment">// Process all the recently added solve data and update this generator</span></div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="comment">// score and difficulty.</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#afa21407ae134806ac4337d0b2473b210">Synchronize</a>();</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> </div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="comment">// Returns a short description of the generator.</span></div><div class="line"><a name="l00386"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a1d89c28bd42ba9a52da008bb69367171"> 386</a></span>  std::string <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a1d89c28bd42ba9a52da008bb69367171">name</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a723d30392e2c4f36252de0528a1b246d">name_</a>; }</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> </div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="comment">// Number of times this generator was called.</span></div><div class="line"><a name="l00389"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a9c3c8f8fa5a64c1c3c2e4985f2032034"> 389</a></span>  int64_t <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a9c3c8f8fa5a64c1c3c2e4985f2032034">num_calls</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  absl::MutexLock mutex_lock(&generator_mutex_);</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordflow">return</span> num_calls_;</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  }</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> </div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="comment">// Number of time the neighborhood was fully solved (OPTIMAL/INFEASIBLE).</span></div><div class="line"><a name="l00395"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a9200434aac5afe3a96cb51544d5b38fa"> 395</a></span>  int64_t <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a9200434aac5afe3a96cb51544d5b38fa">num_fully_solved_calls</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  absl::MutexLock mutex_lock(&generator_mutex_);</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">return</span> num_fully_solved_calls_;</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  }</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> </div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="comment">// The current difficulty of this generator</span></div><div class="line"><a name="l00401"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac"> 401</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a43616719fac14b34582903ef03d114ac">difficulty</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  absl::MutexLock mutex_lock(&generator_mutex_);</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keywordflow">return</span> difficulty_.value();</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> </div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="comment">// The current time limit that the sub-solve should use on this generator.</span></div><div class="line"><a name="l00407"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#ae6e428960282281b0cc3d4ea0427a610"> 407</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#ae6e428960282281b0cc3d4ea0427a610">deterministic_limit</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  absl::MutexLock mutex_lock(&generator_mutex_);</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordflow">return</span> deterministic_limit_;</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  }</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span> </div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="comment">// The sum of the deterministic time spent in this generator.</span></div><div class="line"><a name="l00413"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#ae525d235b02bcfc962d845e28f5f0125"> 413</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#ae525d235b02bcfc962d845e28f5f0125">deterministic_time</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  absl::MutexLock mutex_lock(&generator_mutex_);</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#ac05d8d7f6bf4c0144398514cc334d237">deterministic_time_</a>;</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  }</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> </div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="comment">// Triggered with each call to Synchronize() for each recently added</span></div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="comment">// SolveData. This is meant to be used for processing feedbacks by specific</span></div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="comment">// neighborhood generators to adjust the neighborhood generation process.</span></div><div class="line"><a name="l00422"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#ac497558c5257914ba8ffdc4e95e59c21"> 422</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#ac497558c5257914ba8ffdc4e95e59c21">AdditionalProcessingOnSynchronize</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html">SolveData</a>& solve_data) {}</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> </div><div class="line"><a name="l00424"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a723d30392e2c4f36252de0528a1b246d"> 424</a></span>  <span class="keyword">const</span> std::string <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a723d30392e2c4f36252de0528a1b246d">name_</a>;</div><div class="line"><a name="l00425"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472"> 425</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html">NeighborhoodGeneratorHelper</a>& <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#acbd503b89d1dc3dd85dfa9e0e5058472">helper_</a>;</div><div class="line"><a name="l00426"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a1485e729f641f9670e3f827e5f60d56c"> 426</a></span>  <span class="keyword">mutable</span> absl::Mutex <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a1485e729f641f9670e3f827e5f60d56c">generator_mutex_</a>;</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span> </div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  std::vector<SolveData> solve_data_;</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> </div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="comment">// Current parameters to be used when generating/solving a neighborhood with</span></div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="comment">// this generator. Only updated on Synchronize().</span></div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <a class="code" href="classoperations__research_1_1_adaptive_parameter_value.html">AdaptiveParameterValue</a> difficulty_;</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keywordtype">double</span> deterministic_limit_ = 0.1;</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="comment">// Current statistics of the last solved neighborhood.</span></div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="comment">// Only updated on Synchronize().</span></div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  int64_t num_calls_ = 0;</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  int64_t num_fully_solved_calls_ = 0;</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  int64_t num_consecutive_non_improving_calls_ = 0;</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#ac05d8d7f6bf4c0144398514cc334d237">deterministic_time_</a> = 0.0;</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="keywordtype">double</span> current_average_ = 0.0;</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> };</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span> </div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span> <span class="comment">// Pick a random subset of variables.</span></div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span> <span class="comment">//</span></div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span> <span class="comment">// TODO(user): In the presence of connected components, this should just work</span></div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span> <span class="comment">// on one of them.</span></div><div class="line"><a name="l00449"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_relax_random_variables_generator.html"> 449</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_relax_random_variables_generator.html">RelaxRandomVariablesGenerator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a> {</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00451"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_relax_random_variables_generator.html#ac1ebe72059188b5fe2ac7cd752e58c1b"> 451</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_relax_random_variables_generator.html#ac1ebe72059188b5fe2ac7cd752e58c1b">RelaxRandomVariablesGenerator</a>(</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</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="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>)</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>, helper) {}</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> Generate(<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="l00455"></a><span class="lineno"> 455</span>  <span class="keywordtype">double</span> difficulty, absl::BitGenRef random) <span class="keyword">final</span>;</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span> };</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span> </div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span> <span class="comment">// Pick a random subset of constraints and relax all the variables of these</span></div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span> <span class="comment">// constraints. Note that to satisfy the difficulty, we might not relax all the</span></div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span> <span class="comment">// variable of the "last" constraint.</span></div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span> <span class="comment">//</span></div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> <span class="comment">// TODO(user): In the presence of connected components, this should just work</span></div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span> <span class="comment">// on one of them.</span></div><div class="line"><a name="l00464"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_relax_random_constraints_generator.html"> 464</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_relax_random_constraints_generator.html">RelaxRandomConstraintsGenerator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a> {</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00466"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_relax_random_constraints_generator.html#af4c0879b69b72b7449aa8a4f46de129d"> 466</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_relax_random_constraints_generator.html#af4c0879b69b72b7449aa8a4f46de129d">RelaxRandomConstraintsGenerator</a>(</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</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="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>)</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>, helper) {}</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> Generate(<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="l00470"></a><span class="lineno"> 470</span>  <span class="keywordtype">double</span> difficulty, absl::BitGenRef random) <span class="keyword">final</span>;</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> };</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span> </div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> <span class="comment">// Pick a random subset of variables that are constructed by a BFS in the</span></div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span> <span class="comment">// variable <-> constraint graph. That is, pick a random variable, then all the</span></div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span> <span class="comment">// variable connected by some constraint to the first one, and so on. The</span></div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span> <span class="comment">// variable of the last "level" are selected randomly.</span></div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span> <span class="comment">//</span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span> <span class="comment">// Note that in the presence of connected component, this works correctly</span></div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span> <span class="comment">// already.</span></div><div class="line"><a name="l00480"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_variable_graph_neighborhood_generator.html"> 480</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_variable_graph_neighborhood_generator.html">VariableGraphNeighborhoodGenerator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a> {</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00482"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_variable_graph_neighborhood_generator.html#a7c2e3be0221c9e8d25ee4c5023da94c4"> 482</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_variable_graph_neighborhood_generator.html#a7c2e3be0221c9e8d25ee4c5023da94c4">VariableGraphNeighborhoodGenerator</a>(</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</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="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>)</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>, helper) {}</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> Generate(<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="l00486"></a><span class="lineno"> 486</span>  <span class="keywordtype">double</span> difficulty, absl::BitGenRef random) <span class="keyword">final</span>;</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span> };</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="comment">// Pick a random subset of constraint and relax all of their variables. We are a</span></div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span> <span class="comment">// bit smarter than this because after the first constraint is selected, we only</span></div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span> <span class="comment">// select constraints that share at least one variable with the already selected</span></div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span> <span class="comment">// constraints. The variable from the "last" constraint are selected randomly.</span></div><div class="line"><a name="l00493"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_constraint_graph_neighborhood_generator.html"> 493</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_constraint_graph_neighborhood_generator.html">ConstraintGraphNeighborhoodGenerator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a> {</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00495"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_constraint_graph_neighborhood_generator.html#ad2ac901759c4a6edf1c88a1c9c380381"> 495</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_graph_neighborhood_generator.html#ad2ac901759c4a6edf1c88a1c9c380381">ConstraintGraphNeighborhoodGenerator</a>(</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</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="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>)</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>, helper) {}</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> Generate(<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="l00499"></a><span class="lineno"> 499</span>  <span class="keywordtype">double</span> difficulty, absl::BitGenRef random) <span class="keyword">final</span>;</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span> };</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span> </div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span> <span class="comment">// Helper method for the scheduling neighborhood generators. Returns the model</span></div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span> <span class="comment">// as neighborhood for the given set of intervals to relax. For each no_overlap</span></div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span> <span class="comment">// constraints, it adds strict relation order between the non-relaxed intervals.</span></div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span> Neighborhood <a class="code" href="namespaceoperations__research_1_1sat.html#ad57491858f7814f0a03845022b6de35e">GenerateSchedulingNeighborhoodForRelaxation</a>(</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keyword">const</span> absl::Span<const int> intervals_to_relax,</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keyword">const</span> CpSolverResponse& initial_solution,</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a08c018489eb0c4c309f144780ebb8cce">NeighborhoodGeneratorHelper</a>& helper);</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span> </div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span> <span class="comment">// Only make sense for scheduling problem. This select a random set of interval</span></div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span> <span class="comment">// of the problem according to the difficulty. Then, for each no_overlap</span></div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span> <span class="comment">// constraints, it adds strict relation order between the non-relaxed intervals.</span></div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span> <span class="comment">//</span></div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span> <span class="comment">// TODO(user): Also deal with cumulative constraint.</span></div><div class="line"><a name="l00515"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_neighborhood_generator.html"> 515</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_neighborhood_generator.html">SchedulingNeighborhoodGenerator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a> {</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00517"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_neighborhood_generator.html#a290a392b71763eec83b7f69dc53781d6"> 517</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_neighborhood_generator.html#a290a392b71763eec83b7f69dc53781d6">SchedulingNeighborhoodGenerator</a>(</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</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="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>)</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>, helper) {}</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>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> Generate(<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="l00522"></a><span class="lineno"> 522</span>  <span class="keywordtype">double</span> difficulty, absl::BitGenRef random) <span class="keyword">final</span>;</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span> };</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span> </div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span> <span class="comment">// Similar to SchedulingNeighborhoodGenerator except the set of intervals that</span></div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span> <span class="comment">// are relaxed are from a specific random time interval.</span></div><div class="line"><a name="l00527"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_time_window_neighborhood_generator.html"> 527</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_time_window_neighborhood_generator.html">SchedulingTimeWindowNeighborhoodGenerator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a> {</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00529"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_time_window_neighborhood_generator.html#a2ea0f2091a27219aa8345fff8068eedc"> 529</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_time_window_neighborhood_generator.html#a2ea0f2091a27219aa8345fff8068eedc">SchedulingTimeWindowNeighborhoodGenerator</a>(</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</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="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>)</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>, helper) {}</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>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> Generate(<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="l00534"></a><span class="lineno"> 534</span>  <span class="keywordtype">double</span> difficulty, absl::BitGenRef random) <span class="keyword">final</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> </div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span> <span class="comment">// This routing based LNS generator will relax random arcs in all the paths of</span></div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span> <span class="comment">// the circuit or routes constraints.</span></div><div class="line"><a name="l00539"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_routing_random_neighborhood_generator.html"> 539</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_routing_random_neighborhood_generator.html">RoutingRandomNeighborhoodGenerator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a> {</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00541"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_routing_random_neighborhood_generator.html#a5535fa964ce80c71a065fab040c03c47"> 541</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_routing_random_neighborhood_generator.html#a5535fa964ce80c71a065fab040c03c47">RoutingRandomNeighborhoodGenerator</a>(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html">NeighborhoodGeneratorHelper</a> <span class="keyword">const</span>* helper,</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keyword">const</span> std::string& <a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>)</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>, helper) {}</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> </div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> Generate(<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="l00546"></a><span class="lineno"> 546</span>  <span class="keywordtype">double</span> difficulty, absl::BitGenRef random) <span class="keyword">final</span>;</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span> };</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span> </div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span> <span class="comment">// This routing based LNS generator will relax small sequences of arcs randomly</span></div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span> <span class="comment">// chosen in all the paths of the circuit or routes constraints.</span></div><div class="line"><a name="l00551"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_routing_path_neighborhood_generator.html"> 551</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_routing_path_neighborhood_generator.html">RoutingPathNeighborhoodGenerator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a> {</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00553"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_routing_path_neighborhood_generator.html#adbb75705c5ab084ea7250acedfef36aa"> 553</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_routing_path_neighborhood_generator.html#adbb75705c5ab084ea7250acedfef36aa">RoutingPathNeighborhoodGenerator</a>(<a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html">NeighborhoodGeneratorHelper</a> <span class="keyword">const</span>* helper,</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keyword">const</span> std::string& <a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>)</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>, helper) {}</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>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> Generate(<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="l00558"></a><span class="lineno"> 558</span>  <span class="keywordtype">double</span> difficulty, absl::BitGenRef random) <span class="keyword">final</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> </div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span> <span class="comment">// This routing based LNS generator aims are relaxing one full path, and make</span></div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span> <span class="comment">// some room on the other paths to absorb the nodes of the relaxed path.</span></div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span> <span class="comment">//</span></div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span> <span class="comment">// In order to do so, it will relax the first and the last arc of each path in</span></div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span> <span class="comment">// the circuit or routes constraints. Then it will relax all arc literals in one</span></div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span> <span class="comment">// random path. Then it will relax random arcs in the remaining paths until it</span></div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span> <span class="comment">// reaches the given difficulty.</span></div><div class="line"><a name="l00568"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_routing_full_path_neighborhood_generator.html"> 568</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_routing_full_path_neighborhood_generator.html">RoutingFullPathNeighborhoodGenerator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a> {</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00570"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_routing_full_path_neighborhood_generator.html#aa25781ece54ed6b19a02b9e993bb02a2"> 570</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_routing_full_path_neighborhood_generator.html#aa25781ece54ed6b19a02b9e993bb02a2">RoutingFullPathNeighborhoodGenerator</a>(</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</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="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>)</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>, helper) {}</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span> </div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> Generate(<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="l00575"></a><span class="lineno"> 575</span>  <span class="keywordtype">double</span> difficulty, absl::BitGenRef random) <span class="keyword">final</span>;</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span> };</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span> </div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span> <span class="comment">// Generates a neighborhood by fixing the variables to solutions reported in</span></div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span> <span class="comment">// various repositories. This is inspired from RINS published in "Exploring</span></div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span> <span class="comment">// relaxation induced neighborhoods to improve MIP solutions" 2004 by E. Danna</span></div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> <span class="comment">// et.</span></div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span> <span class="comment">//</span></div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span> <span class="comment">// If incomplete_solutions is provided, this generates a neighborhood by fixing</span></div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span> <span class="comment">// the variable values to a solution in the SharedIncompleteSolutionManager and</span></div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span> <span class="comment">// ignores the other repositories.</span></div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span> <span class="comment">//</span></div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span> <span class="comment">// Otherwise, if response_manager is not provided, this generates a neighborhood</span></div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span> <span class="comment">// using only the linear/general relaxation values. The domain of the variables</span></div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span> <span class="comment">// are reduced to the integer values around their lp solution/relaxation</span></div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span> <span class="comment">// solution values. This was published in "RENS – The Relaxation Enforced</span></div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span> <span class="comment">// Neighborhood" 2009 by Timo Berthold.</span></div><div class="line"><a name="l00592"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_relaxation_induced_neighborhood_generator.html"> 592</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_relaxation_induced_neighborhood_generator.html">RelaxationInducedNeighborhoodGenerator</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a> {</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00594"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_relaxation_induced_neighborhood_generator.html#a04aa59221e89859285d2224a198d5a5f"> 594</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_relaxation_induced_neighborhood_generator.html#a04aa59221e89859285d2224a198d5a5f">RelaxationInducedNeighborhoodGenerator</a>(</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_helper.html">NeighborhoodGeneratorHelper</a> <span class="keyword">const</span>* helper,</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_shared_response_manager.html">SharedResponseManager</a>* response_manager,</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_shared_relaxation_solution_repository.html">SharedRelaxationSolutionRepository</a>* <a class="code" href="cp__model__solver_8cc.html#a2a2278bd1fb787198e496b7d443a05e8">relaxation_solutions</a>,</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_shared_l_p_solution_repository.html">SharedLPSolutionRepository</a>* <a class="code" href="cp__model__solver_8cc.html#a5c52f4ef9698913ed16c67a4a6cec606">lp_solutions</a>,</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <a class="code" href="classoperations__research_1_1sat_1_1_shared_incomplete_solution_manager.html">SharedIncompleteSolutionManager</a>* <a class="code" href="cp__model__solver_8cc.html#a6bc4d701f71d498e82a3d45adde9a2e4">incomplete_solutions</a>,</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="keyword">const</span> std::string& <a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>)</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>, helper),</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  response_manager_(response_manager),</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  relaxation_solutions_(<a class="code" href="cp__model__solver_8cc.html#a2a2278bd1fb787198e496b7d443a05e8">relaxation_solutions</a>),</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  lp_solutions_(<a class="code" href="cp__model__solver_8cc.html#a5c52f4ef9698913ed16c67a4a6cec606">lp_solutions</a>),</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  incomplete_solutions_(<a class="code" href="cp__model__solver_8cc.html#a6bc4d701f71d498e82a3d45adde9a2e4">incomplete_solutions</a>) {</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(lp_solutions_ != <span class="keyword">nullptr</span> || relaxation_solutions_ != <span class="keyword">nullptr</span> ||</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <a class="code" href="cp__model__solver_8cc.html#a6bc4d701f71d498e82a3d45adde9a2e4">incomplete_solutions</a> != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  }</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span> </div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="comment">// Both initial solution and difficulty values are ignored.</span></div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> Generate(<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="l00612"></a><span class="lineno"> 612</span>  <span class="keywordtype">double</span> difficulty, absl::BitGenRef random) <span class="keyword">final</span>;</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span> </div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="comment">// Returns true if the required solutions are available.</span></div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="keywordtype">bool</span> ReadyToGenerate() <span class="keyword">const override</span>;</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span> </div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_shared_response_manager.html">SharedResponseManager</a>* response_manager_;</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_shared_relaxation_solution_repository.html">SharedRelaxationSolutionRepository</a>* relaxation_solutions_;</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_shared_l_p_solution_repository.html">SharedLPSolutionRepository</a>* lp_solutions_;</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <a class="code" href="classoperations__research_1_1sat_1_1_shared_incomplete_solution_manager.html">SharedIncompleteSolutionManager</a>* incomplete_solutions_;</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="comment">// Generates a relaxation of the original model by removing a consecutive span</span></div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span> <span class="comment">// of constraints starting at a random index. The number of constraints removed</span></div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span> <span class="comment">// is in sync with the difficulty passed to the generator.</span></div><div class="line"><a name="l00627"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator.html"> 627</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator.html">ConsecutiveConstraintsRelaxationNeighborhoodGenerator</a></div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a> {</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00630"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator.html#a23c196ccae7ce05ad735bd5def5a9052"> 630</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator.html#a23c196ccae7ce05ad735bd5def5a9052">ConsecutiveConstraintsRelaxationNeighborhoodGenerator</a>(</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</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="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>)</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>, helper) {}</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> Generate(<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="l00634"></a><span class="lineno"> 634</span>  <span class="keywordtype">double</span> difficulty, absl::BitGenRef random) <span class="keyword">final</span>;</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span> </div><div class="line"><a name="l00636"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator.html#a674468b66860a4942dea730f9731c5cf"> 636</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator.html#a674468b66860a4942dea730f9731c5cf">IsRelaxationGenerator</a>()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div><div class="line"><a name="l00637"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator.html#a18bd97b50e3170dabf1f537e19695054"> 637</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator.html#a18bd97b50e3170dabf1f537e19695054">ReadyToGenerate</a>()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span> };</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span> </div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span> <span class="comment">// Generates a relaxation of the original model by removing some constraints</span></div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span> <span class="comment">// randomly with a given weight for each constraint that controls the</span></div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span> <span class="comment">// probability of constraint getting removed. The number of constraints removed</span></div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span> <span class="comment">// is in sync with the difficulty passed to the generator. Higher weighted</span></div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span> <span class="comment">// constraints are more likely to get removed.</span></div><div class="line"><a name="l00645"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator.html"> 645</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator.html">WeightedRandomRelaxationNeighborhoodGenerator</a></div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_neighborhood_generator.html">NeighborhoodGenerator</a> {</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <a class="code" href="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator.html">WeightedRandomRelaxationNeighborhoodGenerator</a>(</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</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="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">name</a>);</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span> </div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="comment">// Generates the neighborhood as described above. Also stores the removed</span></div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="comment">// constraints indices for adjusting the weights.</span></div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <a class="code" href="structoperations__research_1_1sat_1_1_neighborhood.html">Neighborhood</a> Generate(<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="l00654"></a><span class="lineno"> 654</span>  <span class="keywordtype">double</span> difficulty, absl::BitGenRef random) <span class="keyword">final</span>;</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span> </div><div class="line"><a name="l00656"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator.html#a674468b66860a4942dea730f9731c5cf"> 656</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator.html#a674468b66860a4942dea730f9731c5cf">IsRelaxationGenerator</a>()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div><div class="line"><a name="l00657"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator.html#a18bd97b50e3170dabf1f537e19695054"> 657</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator.html#a18bd97b50e3170dabf1f537e19695054">ReadyToGenerate</a>()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span> </div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="comment">// Adjusts the weights of the constraints removed to get the neighborhood</span></div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="comment">// based on the solve_data.</span></div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keywordtype">void</span> AdditionalProcessingOnSynchronize(<span class="keyword">const</span> SolveData& solve_data) <span class="keyword">override</span></div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  ABSL_EXCLUSIVE_LOCKS_REQUIRED(generator_mutex_);</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="comment">// Higher weighted constraints are more likely to get removed.</span></div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  std::vector<double> constraint_weights_;</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keywordtype">int</span> num_removable_constraints_ = 0;</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span> </div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="comment">// Indices of the removed constraints per generated neighborhood.</span></div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  absl::flat_hash_map<int64_t, std::vector<int>> removed_constraints_</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  ABSL_GUARDED_BY(generator_mutex_);</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span> </div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="comment">// TODO(user): Move this to parent class if other generators start using</span></div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="comment">// feedbacks.</span></div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  int64_t next_available_id_ ABSL_GUARDED_BY(generator_mutex_) = 0;</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">// namespace sat</span></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span> } <span class="comment">// namespace operations_research</span></div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span> </div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span> <span class="preprocessor">#endif // OR_TOOLS_SAT_CP_MODEL_LNS_H_</span></div><div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_neighborhood_generator_html_a290a392b71763eec83b7f69dc53781d6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_neighborhood_generator.html#a290a392b71763eec83b7f69dc53781d6">operations_research::sat::SchedulingNeighborhoodGenerator::SchedulingNeighborhoodGenerator</a></div><div class="ttdeci">SchedulingNeighborhoodGenerator(NeighborhoodGeneratorHelper const *helper, const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00517">cp_model_lns.h:517</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#l00495">base/logging.h:495</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_neighborhood_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_neighborhood_generator.html">operations_research::sat::SchedulingNeighborhoodGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00515">cp_model_lns.h:515</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#l00138">cp_model_lns.h:138</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator_html_a674468b66860a4942dea730f9731c5cf"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator.html#a674468b66860a4942dea730f9731c5cf">operations_research::sat::WeightedRandomRelaxationNeighborhoodGenerator::IsRelaxationGenerator</a></div><div class="ttdeci">bool IsRelaxationGenerator() const override</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00656">cp_model_lns.h:656</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a4c701668fe51d4444b40e6eec5820c89"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a4c701668fe51d4444b40e6eec5820c89">operations_research::sat::NeighborhoodGeneratorHelper::NumActiveVariables</a></div><div class="ttdeci">int NumActiveVariables() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00145">cp_model_lns.h:145</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_relaxation_induced_neighborhood_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_relaxation_induced_neighborhood_generator.html">operations_research::sat::RelaxationInducedNeighborhoodGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00592">cp_model_lns.h:592</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_variable_graph_neighborhood_generator_html_a7c2e3be0221c9e8d25ee4c5023da94c4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variable_graph_neighborhood_generator.html#a7c2e3be0221c9e8d25ee4c5023da94c4">operations_research::sat::VariableGraphNeighborhoodGenerator::VariableGraphNeighborhoodGenerator</a></div><div class="ttdeci">VariableGraphNeighborhoodGenerator(NeighborhoodGeneratorHelper const *helper, const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00482">cp_model_lns.h:482</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#l00087">cp_model_lns.h:87</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_time_window_neighborhood_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_time_window_neighborhood_generator.html">operations_research::sat::SchedulingTimeWindowNeighborhoodGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00527">cp_model_lns.h:527</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#l00043">cp_model_lns.h:43</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_graph_neighborhood_generator_html_ad2ac901759c4a6edf1c88a1c9c380381"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_graph_neighborhood_generator.html#ad2ac901759c4a6edf1c88a1c9c380381">operations_research::sat::ConstraintGraphNeighborhoodGenerator::ConstraintGraphNeighborhoodGenerator</a></div><div class="ttdeci">ConstraintGraphNeighborhoodGenerator(NeighborhoodGeneratorHelper const *helper, const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00495">cp_model_lns.h:495</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#l01021">cp_model_lns.cc:1021</a></div></div>
|
||
<div class="ttc" id="cp__model__solver_8cc_html_a5c52f4ef9698913ed16c67a4a6cec606"><div class="ttname"><a href="cp__model__solver_8cc.html#a5c52f4ef9698913ed16c67a4a6cec606">lp_solutions</a></div><div class="ttdeci">SharedLPSolutionRepository * lp_solutions</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l01955">cp_model_solver.cc:1955</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#l00328">cp_model_lns.h:328</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#l00039">cp_model_lns.h:39</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html_a24d01ebae72ddcb6d698c97add3f41a5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a24d01ebae72ddcb6d698c97add3f41a5">operations_research::sat::NeighborhoodGenerator::AddSolveData</a></div><div class="ttdeci">void AddSolveData(SolveData data)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00376">cp_model_lns.h:376</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#l00598">cp_model_lns.cc:598</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#l00039">cp_model_lns.cc:39</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a6823902ca9e8cb58c90a9f086c647da6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a6823902ca9e8cb58c90a9f086c647da6">operations_research::sat::NeighborhoodGeneratorHelper::FixGivenVariables</a></div><div class="ttdeci">Neighborhood FixGivenVariables(const CpSolverResponse &base_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#l00481">cp_model_lns.cc:481</a></div></div>
|
||
<div class="ttc" id="sat_2model_8h_html"><div class="ttname"><a href="sat_2model_8h.html">model.h</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#l00320">cp_model_lns.cc:320</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_variable_graph_neighborhood_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variable_graph_neighborhood_generator.html">operations_research::sat::VariableGraphNeighborhoodGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00480">cp_model_lns.h:480</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#l00286">cp_model_lns.h:286</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#l00625">cp_model_lns.cc:625</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#l00175">cp_model_lns.h:175</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_sub_solver_html_a1d89c28bd42ba9a52da008bb69367171"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sub_solver.html#a1d89c28bd42ba9a52da008bb69367171">operations_research::sat::SubSolver::name</a></div><div class="ttdeci">std::string name() const</div><div class="ttdef"><b>Definition:</b> <a href="subsolver_8h_source.html#l00084">subsolver.h:84</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_shared_l_p_solution_repository_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_l_p_solution_repository.html">operations_research::sat::SharedLPSolutionRepository</a></div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8h_source.html#l00139">synchronization.h:139</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_html_a3828e04dced399427f06832424b9b4ae"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood.html#a3828e04dced399427f06832424b9b4ae">operations_research::sat::Neighborhood::num_relaxed_variables_in_objective</a></div><div class="ttdeci">int num_relaxed_variables_in_objective</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="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator_html_a18bd97b50e3170dabf1f537e19695054"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator.html#a18bd97b50e3170dabf1f537e19695054">operations_research::sat::WeightedRandomRelaxationNeighborhoodGenerator::ReadyToGenerate</a></div><div class="ttdeci">bool ReadyToGenerate() const override</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00657">cp_model_lns.h:657</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_time_window_neighborhood_generator_html_a2ea0f2091a27219aa8345fff8068eedc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_time_window_neighborhood_generator.html#a2ea0f2091a27219aa8345fff8068eedc">operations_research::sat::SchedulingTimeWindowNeighborhoodGenerator::SchedulingTimeWindowNeighborhoodGenerator</a></div><div class="ttdeci">SchedulingTimeWindowNeighborhoodGenerator(NeighborhoodGeneratorHelper const *helper, const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00529">cp_model_lns.h:529</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a474b2f12e1648545bb78f734d14c4280"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a474b2f12e1648545bb78f734d14c4280">operations_research::sat::NeighborhoodGeneratorHelper::GenerateTask</a></div><div class="ttdeci">std::function< void()> GenerateTask(int64_t task_id) override</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00097">cp_model_lns.h:97</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data_html_afc5fa55f61560324377e4f42d4a9211f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#afc5fa55f61560324377e4f42d4a9211f">operations_research::sat::NeighborhoodGenerator::SolveData::deterministic_time</a></div><div class="ttdeci">double deterministic_time</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00343">cp_model_lns.h:343</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_routing_full_path_neighborhood_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_routing_full_path_neighborhood_generator.html">operations_research::sat::RoutingFullPathNeighborhoodGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00568">cp_model_lns.h:568</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html_a723d30392e2c4f36252de0528a1b246d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a723d30392e2c4f36252de0528a1b246d">operations_research::sat::NeighborhoodGenerator::name_</a></div><div class="ttdeci">const std::string name_</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00424">cp_model_lns.h:424</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_a82a453ea79e75c81ab03ba9da8c40ce5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#a82a453ea79e75c81ab03ba9da8c40ce5">operations_research::sat::NeighborhoodGeneratorHelper::NoNeighborhood</a></div><div class="ttdeci">Neighborhood NoNeighborhood() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8cc_source.html#l00342">cp_model_lns.cc:342</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#l00053">cp_model_lns.h:53</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_relax_random_variables_generator_html_ac1ebe72059188b5fe2ac7cd752e58c1b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_relax_random_variables_generator.html#ac1ebe72059188b5fe2ac7cd752e58c1b">operations_research::sat::RelaxRandomVariablesGenerator::RelaxRandomVariablesGenerator</a></div><div class="ttdeci">RelaxRandomVariablesGenerator(NeighborhoodGeneratorHelper const *helper, const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00451">cp_model_lns.h:451</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#l06587">cp_model.pb.h:6587</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#l00150">cp_model_lns.h:150</a></div></div>
|
||
<div class="ttc" id="util_2logging_8h_html"><div class="ttname"><a href="util_2logging_8h.html">logging.h</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_sub_solver_html_ac05d8d7f6bf4c0144398514cc334d237"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sub_solver.html#ac05d8d7f6bf4c0144398514cc334d237">operations_research::sat::SubSolver::deterministic_time_</a></div><div class="ttdeci">double deterministic_time_</div><div class="ttdef"><b>Definition:</b> <a href="subsolver_8h_source.html#l00092">subsolver.h:92</a></div></div>
|
||
<div class="ttc" id="subsolver_8h_html"><div class="ttname"><a href="subsolver_8h.html">subsolver.h</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_routing_path_neighborhood_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_routing_path_neighborhood_generator.html">operations_research::sat::RoutingPathNeighborhoodGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00551">cp_model_lns.h:551</a></div></div>
|
||
<div class="ttc" id="integral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</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#l00401">cp_model_lns.h:401</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_routing_path_neighborhood_generator_html_adbb75705c5ab084ea7250acedfef36aa"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_routing_path_neighborhood_generator.html#adbb75705c5ab084ea7250acedfef36aa">operations_research::sat::RoutingPathNeighborhoodGenerator::RoutingPathNeighborhoodGenerator</a></div><div class="ttdeci">RoutingPathNeighborhoodGenerator(NeighborhoodGeneratorHelper const *helper, const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00553">cp_model_lns.h:553</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_sub_solver_html_ae525d235b02bcfc962d845e28f5f0125"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sub_solver.html#ae525d235b02bcfc962d845e28f5f0125">operations_research::sat::SubSolver::deterministic_time</a></div><div class="ttdeci">double deterministic_time() const</div><div class="ttdef"><b>Definition:</b> <a href="subsolver_8h_source.html#l00081">subsolver.h:81</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#l00158">cp_model_lns.h:158</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#l00580">cp_model_lns.cc:580</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_shared_relaxation_solution_repository_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_relaxation_solution_repository.html">operations_research::sat::SharedRelaxationSolutionRepository</a></div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8h_source.html#l00130">synchronization.h:130</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data_html_a2579a2fccfe41ac8b5d8dac1c7f93607"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a2579a2fccfe41ac8b5d8dac1c7f93607">operations_research::sat::NeighborhoodGenerator::SolveData::initial_best_objective_bound</a></div><div class="ttdeci">IntegerValue initial_best_objective_bound</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00359">cp_model_lns.h:359</a></div></div>
|
||
<div class="ttc" id="cp__model__solver_8cc_html_a6bc4d701f71d498e82a3d45adde9a2e4"><div class="ttname"><a href="cp__model__solver_8cc.html#a6bc4d701f71d498e82a3d45adde9a2e4">incomplete_solutions</a></div><div class="ttdeci">SharedIncompleteSolutionManager * incomplete_solutions</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l01956">cp_model_solver.cc:1956</a></div></div>
|
||
<div class="ttc" id="namespaceabsl_html"><div class="ttname"><a href="namespaceabsl.html">absl</a></div><div class="ttdef"><b>Definition:</b> <a href="cleanup_8h_source.html#l00022">cleanup.h:22</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_sub_solver_html_a723d30392e2c4f36252de0528a1b246d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sub_solver.html#a723d30392e2c4f36252de0528a1b246d">operations_research::sat::SubSolver::name_</a></div><div class="ttdeci">const std::string name_</div><div class="ttdef"><b>Definition:</b> <a href="subsolver_8h_source.html#l00090">subsolver.h:90</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_relax_random_variables_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_relax_random_variables_generator.html">operations_research::sat::RelaxRandomVariablesGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00449">cp_model_lns.h:449</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html_a1d89c28bd42ba9a52da008bb69367171"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a1d89c28bd42ba9a52da008bb69367171">operations_research::sat::NeighborhoodGenerator::name</a></div><div class="ttdeci">std::string name() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00386">cp_model_lns.h:386</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#l00198">cp_model_lns.h:198</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#l06111">cp_model.pb.h:6111</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_routing_random_neighborhood_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_routing_random_neighborhood_generator.html">operations_research::sat::RoutingRandomNeighborhoodGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00539">cp_model_lns.h:539</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_weighted_random_relaxation_neighborhood_generator.html">operations_research::sat::WeightedRandomRelaxationNeighborhoodGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00645">cp_model_lns.h:645</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data_html_ad578a0760fe4217d9cb5552835cf0572"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#ad578a0760fe4217d9cb5552835cf0572">operations_research::sat::NeighborhoodGenerator::SolveData::neighborhood_id</a></div><div class="ttdeci">int64_t neighborhood_id</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00331">cp_model_lns.h:331</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator_html_a18bd97b50e3170dabf1f537e19695054"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator.html#a18bd97b50e3170dabf1f537e19695054">operations_research::sat::ConsecutiveConstraintsRelaxationNeighborhoodGenerator::ReadyToGenerate</a></div><div class="ttdeci">bool ReadyToGenerate() const override</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00637">cp_model_lns.h:637</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_html_a240d377e7dfd0f7b32cf859acf8943db"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood.html#a240d377e7dfd0f7b32cf859acf8943db">operations_research::sat::Neighborhood::num_relaxed_variables</a></div><div class="ttdeci">int num_relaxed_variables</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00066">cp_model_lns.h:66</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#l00426">cp_model_lns.h:426</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#l00210">cp_model_lns.h:210</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#l00037">cp_model_lns.h:37</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_af4a8d38991f3497e048a3b56b830087f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#af4a8d38991f3497e048a3b56b830087f">operations_research::sat::NeighborhoodGeneratorHelper::Parameters</a></div><div class="ttdeci">const SatParameters & Parameters() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00199">cp_model_lns.h:199</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html_a9c3c8f8fa5a64c1c3c2e4985f2032034"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a9c3c8f8fa5a64c1c3c2e4985f2032034">operations_research::sat::NeighborhoodGenerator::num_calls</a></div><div class="ttdeci">int64_t num_calls() const</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_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#l00201">cp_model_lns.h:201</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html_a9200434aac5afe3a96cb51544d5b38fa"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a9200434aac5afe3a96cb51544d5b38fa">operations_research::sat::NeighborhoodGenerator::num_fully_solved_calls</a></div><div class="ttdeci">int64_t num_fully_solved_calls() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00395">cp_model_lns.h:395</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#l00060">cp_model_lns.cc:60</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#l00422">cp_model_lns.h:422</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#l00340">time_limit.h:340</a></div></div>
|
||
<div class="ttc" id="cp__model__presolve_8h_html"><div class="ttname"><a href="cp__model__presolve_8h.html">cp_model_presolve.h</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#l00169">cp_model_lns.h:169</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator_html_a23c196ccae7ce05ad735bd5def5a9052"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator.html#a23c196ccae7ce05ad735bd5def5a9052">operations_research::sat::ConsecutiveConstraintsRelaxationNeighborhoodGenerator::ConsecutiveConstraintsRelaxationNeighborhoodGenerator</a></div><div class="ttdeci">ConsecutiveConstraintsRelaxationNeighborhoodGenerator(NeighborhoodGeneratorHelper const *helper, const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00630">cp_model_lns.h:630</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data_html_a71013162baa979e0b8780100905cf700"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a71013162baa979e0b8780100905cf700">operations_research::sat::NeighborhoodGenerator::SolveData::difficulty</a></div><div class="ttdeci">double difficulty</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00337">cp_model_lns.h:337</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_routing_random_neighborhood_generator_html_a5535fa964ce80c71a065fab040c03c47"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_routing_random_neighborhood_generator.html#a5535fa964ce80c71a065fab040c03c47">operations_research::sat::RoutingRandomNeighborhoodGenerator::RoutingRandomNeighborhoodGenerator</a></div><div class="ttdeci">RoutingRandomNeighborhoodGenerator(NeighborhoodGeneratorHelper const *helper, const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00541">cp_model_lns.h:541</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data_html_a91dacddd9f775730c8d424d2ab4d76ac"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a91dacddd9f775730c8d424d2ab4d76ac">operations_research::sat::NeighborhoodGenerator::SolveData::status</a></div><div class="ttdeci">CpSolverStatus status</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00334">cp_model_lns.h:334</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#l00330">cp_model_lns.cc:330</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#l01949">cp_model_solver.cc:1949</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#l00412">synchronization.h:412</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_routing_full_path_neighborhood_generator_html_aa25781ece54ed6b19a02b9e993bb02a2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_routing_full_path_neighborhood_generator.html#aa25781ece54ed6b19a02b9e993bb02a2">operations_research::sat::RoutingFullPathNeighborhoodGenerator::RoutingFullPathNeighborhoodGenerator</a></div><div class="ttdeci">RoutingFullPathNeighborhoodGenerator(NeighborhoodGeneratorHelper const *helper, const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00570">cp_model_lns.h:570</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator_html_a674468b66860a4942dea730f9731c5cf"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator.html#a674468b66860a4942dea730f9731c5cf">operations_research::sat::ConsecutiveConstraintsRelaxationNeighborhoodGenerator::IsRelaxationGenerator</a></div><div class="ttdeci">bool IsRelaxationGenerator() const override</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00636">cp_model_lns.h:636</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_html_a29e58402f533badc9e8836044bc2df09"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood.html#a29e58402f533badc9e8836044bc2df09">operations_research::sat::Neighborhood::variables_that_can_be_fixed_to_local_optimum</a></div><div class="ttdeci">std::vector< int > variables_that_can_be_fixed_to_local_optimum</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00078">cp_model_lns.h:78</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#l00315">cp_model_lns.h:315</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data_html_a1092ef5699db303eacd67586fe6273f4"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a1092ef5699db303eacd67586fe6273f4">operations_research::sat::NeighborhoodGenerator::SolveData::base_objective</a></div><div class="ttdeci">IntegerValue base_objective</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00355">cp_model_lns.h:355</a></div></div>
|
||
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aedc4ddb96acc28481c09828d2e016815a6ce26a62afab55d7606ad4e92428b30c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a6ce26a62afab55d7606ad4e92428b30c">operations_research::sat::UNKNOWN</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l00243">cp_model.pb.h:243</a></div></div>
|
||
<div class="ttc" id="adaptative__parameter__value_8h_html"><div class="ttname"><a href="adaptative__parameter__value_8h.html">adaptative_parameter_value.h</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html_ae6e428960282281b0cc3d4ea0427a610"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#ae6e428960282281b0cc3d4ea0427a610">operations_research::sat::NeighborhoodGenerator::deterministic_limit</a></div><div class="ttdeci">double deterministic_limit() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00407">cp_model_lns.h:407</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html_ae525d235b02bcfc962d845e28f5f0125"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#ae525d235b02bcfc962d845e28f5f0125">operations_research::sat::NeighborhoodGenerator::deterministic_time</a></div><div class="ttdeci">double deterministic_time() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00413">cp_model_lns.h:413</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html_a186eb8a0761d3a80e350e5d6eb6412a1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a186eb8a0761d3a80e350e5d6eb6412a1">operations_research::sat::NeighborhoodGenerator::~NeighborhoodGenerator</a></div><div class="ttdeci">virtual ~NeighborhoodGenerator()</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00291">cp_model_lns.h:291</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#l00165">cp_model_lns.h:165</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_html_a7f3afd61b6944986fd9d5f92fc187768"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood.html#a7f3afd61b6944986fd9d5f92fc187768">operations_research::sat::Neighborhood::is_simple</a></div><div class="ttdeci">bool is_simple</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00046">cp_model_lns.h:46</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_html_a60349be3472ae33af45a70cd5480a7e3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator.html#a60349be3472ae33af45a70cd5480a7e3">operations_research::sat::NeighborhoodGenerator::NeighborhoodGenerator</a></div><div class="ttdeci">NeighborhoodGenerator(const std::string &name, NeighborhoodGeneratorHelper const *helper)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00288">cp_model_lns.h:288</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="classoperations__research_1_1sat_1_1_relax_random_constraints_generator_html_af4c0879b69b72b7449aa8a4f46de129d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_relax_random_constraints_generator.html#af4c0879b69b72b7449aa8a4f46de129d">operations_research::sat::RelaxRandomConstraintsGenerator::RelaxRandomConstraintsGenerator</a></div><div class="ttdeci">RelaxRandomConstraintsGenerator(NeighborhoodGeneratorHelper const *helper, const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00466">cp_model_lns.h:466</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#l00396">cp_model_lns.cc:396</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#l00052">cp_model_lns.h:52</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#l00608">cp_model_lns.cc:608</a></div></div>
|
||
<div class="ttc" id="cp__model__solver_8cc_html_a2a2278bd1fb787198e496b7d443a05e8"><div class="ttname"><a href="cp__model__solver_8cc.html#a2a2278bd1fb787198e496b7d443a05e8">relaxation_solutions</a></div><div class="ttdeci">SharedRelaxationSolutionRepository * relaxation_solutions</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l01954">cp_model_solver.cc:1954</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="namespaceoperations__research_1_1sat_html_aedc4ddb96acc28481c09828d2e016815"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815">operations_research::sat::CpSolverStatus</a></div><div class="ttdeci">CpSolverStatus</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l00242">cp_model.pb.h:242</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35">operations_research::sat::ConstraintProto::ConstraintCase</a></div><div class="ttdeci">ConstraintCase</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03815">cp_model.pb.h:3815</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#l00120">cp_model_fz_solver.cc:120</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_shared_incomplete_solution_manager_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_incomplete_solution_manager.html">operations_research::sat::SharedIncompleteSolutionManager</a></div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8h_source.html#l00155">synchronization.h:155</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data_html_abfd9e74380811ea081037db464d22f2f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#abfd9e74380811ea081037db464d22f2f">operations_research::sat::NeighborhoodGenerator::SolveData::new_objective_bound</a></div><div class="ttdeci">IntegerValue new_objective_bound</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00360">cp_model_lns.h:360</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="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#l00063">cp_model_lns.h:63</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="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data_html_a00195aa190a0eea4cd4ab808056bfbfd"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a00195aa190a0eea4cd4ab808056bfbfd">operations_research::sat::NeighborhoodGenerator::SolveData::operator<</a></div><div class="ttdeci">bool operator<(const SolveData &o) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00363">cp_model_lns.h:363</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data_html_a4f572c68b7bf3aac70b3f5292398ff7b"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a4f572c68b7bf3aac70b3f5292398ff7b">operations_research::sat::NeighborhoodGenerator::SolveData::deterministic_limit</a></div><div class="ttdeci">double deterministic_limit</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00340">cp_model_lns.h:340</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_neighborhood_generator_helper_html_ab25d3ac59ae6adc23d30b5fdc892b812"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_neighborhood_generator_helper.html#ab25d3ac59ae6adc23d30b5fdc892b812">operations_research::sat::NeighborhoodGeneratorHelper::TaskIsAvailable</a></div><div class="ttdeci">bool TaskIsAvailable() override</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00096">cp_model_lns.h:96</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_graph_neighborhood_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_graph_neighborhood_generator.html">operations_research::sat::ConstraintGraphNeighborhoodGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00493">cp_model_lns.h:493</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#l00348">cp_model_lns.cc:348</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="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data_html_a2b7499dfe1d827cdca46593256705cd4"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a2b7499dfe1d827cdca46593256705cd4">operations_research::sat::NeighborhoodGenerator::SolveData::initial_best_objective</a></div><div class="ttdeci">IntegerValue initial_best_objective</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00354">cp_model_lns.h:354</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#l00425">cp_model_lns.h:425</a></div></div>
|
||
<div class="ttc" id="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data_html_a6bdd919d4fe97909496a23f7d85b5d8e"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_neighborhood_generator_1_1_solve_data.html#a6bdd919d4fe97909496a23f7d85b5d8e">operations_research::sat::NeighborhoodGenerator::SolveData::new_objective</a></div><div class="ttdeci">IntegerValue new_objective</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00356">cp_model_lns.h:356</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_relaxation_induced_neighborhood_generator_html_a04aa59221e89859285d2224a198d5a5f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_relaxation_induced_neighborhood_generator.html#a04aa59221e89859285d2224a198d5a5f">operations_research::sat::RelaxationInducedNeighborhoodGenerator::RelaxationInducedNeighborhoodGenerator</a></div><div class="ttdeci">RelaxationInducedNeighborhoodGenerator(NeighborhoodGeneratorHelper const *helper, const SharedResponseManager *response_manager, const SharedRelaxationSolutionRepository *relaxation_solutions, const SharedLPSolutionRepository *lp_solutions, SharedIncompleteSolutionManager *incomplete_solutions, const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00594">cp_model_lns.h:594</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_consecutive_constraints_relaxation_neighborhood_generator.html">operations_research::sat::ConsecutiveConstraintsRelaxationNeighborhoodGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00627">cp_model_lns.h:627</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1sat_1_1_relax_random_constraints_generator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_relax_random_constraints_generator.html">operations_research::sat::RelaxRandomConstraintsGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__lns_8h_source.html#l00464">cp_model_lns.h:464</a></div></div>
|
||
<div class="ttc" id="classoperations__research_1_1_adaptive_parameter_value_html"><div class="ttname"><a href="classoperations__research_1_1_adaptive_parameter_value.html">operations_research::AdaptiveParameterValue</a></div><div class="ttdef"><b>Definition:</b> <a href="adaptative__parameter__value_8h_source.html#l00037">adaptative_parameter_value.h:37</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_8h.html">cp_model_lns.h</a></li>
|
||
<li class="footer">Generated by
|
||
<a href="http://www.doxygen.org/index.html">
|
||
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
|
||
</ul>
|
||
</div>
|
||
</body>
|
||
</html>
|