always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
66eccebdd5e1fecca3fddaa783d93d94fd89b736
ortools-clone/docs/cpp/feasibility__pump_8h_source.html
Mizux Seiha 17edcf0e25 Update doc
2021-09-30 01:28:18 +02:00

387 lines
60 KiB
HTML
Raw Blame History

<!-- HTML header for doxygen 1.8.18-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>OR-Tools: feasibility_pump.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">OR-Tools
&#160;<span id="projectnumber">9.1</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(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:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('feasibility__pump_8h_source.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle"><div class="title">feasibility_pump.h</div></div>
</div><!--header-->
<div class="contents">
<a href="feasibility__pump_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the &quot;License&quot;);</span></div>
<div class="line"><a id="l00003" 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 id="l00004" 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 id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
<div class="line"><a id="l00006" 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 id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
<div class="line"><a id="l00008" 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 id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an &quot;AS IS&quot; BASIS,</span></div>
<div class="line"><a id="l00010" 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 id="l00011" 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 id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#ifndef OR_TOOLS_SAT_FEASIBILITY_PUMP_H_</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#define OR_TOOLS_SAT_FEASIBILITY_PUMP_H_</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span> </div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span> </div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include &quot;<a class="code" href="strong__vector_8h.html">ortools/base/strong_vector.h</a>&quot;</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include &quot;<a class="code" href="revised__simplex_8h.html">ortools/glop/revised_simplex.h</a>&quot;</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include &quot;<a class="code" href="lp__data_8h.html">ortools/lp_data/lp_data.h</a>&quot;</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include &quot;<a class="code" href="lp__data__utils_8h.html">ortools/lp_data/lp_data_utils.h</a>&quot;</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include &quot;<a class="code" href="lp__types_8h.html">ortools/lp_data/lp_types.h</a>&quot;</span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include &quot;<a class="code" href="cp__model__mapping_8h.html">ortools/sat/cp_model_mapping.h</a>&quot;</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include &quot;<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>&quot;</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include &quot;<a class="code" href="sat_2linear__constraint_8h.html">ortools/sat/linear_constraint.h</a>&quot;</span></div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include &quot;<a class="code" href="sat__solver_8h.html">ortools/sat/sat_solver.h</a>&quot;</span></div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include &quot;<a class="code" href="synchronization_8h.html">ortools/sat/synchronization.h</a>&quot;</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include &quot;<a class="code" href="sat_2util_8h.html">ortools/sat/util.h</a>&quot;</span></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> </div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="keyword">namespace </span>sat {</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> </div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_feasibility_pump.html"> 34</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1sat_1_1_feasibility_pump.html">FeasibilityPump</a> {</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> <span class="keyword">public</span>:</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">explicit</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a477d40d2455543bdf702f13fa36f4ddd">FeasibilityPump</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a18206039e9f0c76f2b35907a4f6ea812">~FeasibilityPump</a>();</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> </div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a67a7327915e66c0514cfa465a0475be1"> 39</a></span> <span class="keyword">typedef</span> glop::RowIndex <a class="code hl_typedef" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a67a7327915e66c0514cfa465a0475be1">ConstraintIndex</a>;</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> </div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a3f83024f314fe4c509e75b691c5513d0"> 41</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a3f83024f314fe4c509e75b691c5513d0">SetMaxFPIterations</a>(<span class="keywordtype">int</span> max_iter) {</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> max_fp_iterations_ = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(1, max_iter);</div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> }</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> </div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// Add a new linear constraint to this LP.</span></div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#aaac2d8dee4d7fc8d5e9a1b1cfc3021bc">AddLinearConstraint</a>(<span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>&amp; <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> </div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// Set the coefficient of the variable in the objective. Calling it twice will</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// overwrite the previous value. Note that this doesn&#39;t set the objective</span></div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// coefficient if the variable doesn&#39;t appear in any constraints. So this has</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// to be called after all the constraints are added.</span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#ae384be06329c4c8f8fd62af7335dae2e">SetObjectiveCoefficient</a>(IntegerVariable ivar, IntegerValue coeff);</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> </div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// Returns the LP value of a variable in the current</span></div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="comment">// solution. These functions should only be called when HasSolution() is true.</span></div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#ad271ccd28f3680abba2d189a7b78d86c"> 56</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#ad271ccd28f3680abba2d189a7b78d86c">HasLPSolution</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> lp_solution_is_set_; }</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a4a4bc5eab93d6df24cea56b6a29c78ed"> 57</a></span> <span class="keywordtype">double</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a4a4bc5eab93d6df24cea56b6a29c78ed">LPSolutionObjectiveValue</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> lp_objective_; }</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="keywordtype">double</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a680158afc869b1a617ca173fa0033202">GetLPSolutionValue</a>(IntegerVariable variable) <span class="keyword">const</span>;</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#af8f352bb9045be8c9f938118111e2e2e"> 59</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#af8f352bb9045be8c9f938118111e2e2e">LPSolutionIsInteger</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> lp_solution_is_integer_; }</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a3139c5212b639a866499d0cfb2a28e4f"> 60</a></span> <span class="keywordtype">double</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a3139c5212b639a866499d0cfb2a28e4f">LPSolutionFractionality</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> lp_solution_fractionality_; }</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> </div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// Returns the Integer solution value of a variable in the current rounded</span></div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="comment">// solution. These functions should only be called when HasIntegerSolution()</span></div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="comment">// is true.</span></div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a0b2361c77d5402a7050af6a2538a09ae"> 65</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a0b2361c77d5402a7050af6a2538a09ae">HasIntegerSolution</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> integer_solution_is_set_; }</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a5faf3bc77eadb1b687efe379820b7aea"> 66</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a5faf3bc77eadb1b687efe379820b7aea">IntegerSolutionObjectiveValue</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keywordflow">return</span> integer_solution_objective_;</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> }</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#acad222fde6e09601cc9d1a7b2481507e"> 69</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#acad222fde6e09601cc9d1a7b2481507e">IntegerSolutionIsFeasible</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keywordflow">return</span> integer_solution_is_feasible_;</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> }</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> int64_t <a class="code hl_function" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a9ad847669329f6fbccf8e4553adc7dee">GetIntegerSolutionValue</a>(IntegerVariable variable) <span class="keyword">const</span>;</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> </div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// Returns false if the model is proven to be infeasible.</span></div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a942f29030f08426e7e318204e987e2f7">Solve</a>();</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> </div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="keyword">private</span>:</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="comment">// Solve the LP, returns false if something went wrong in the LP solver.</span></div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="keywordtype">bool</span> SolveLp();</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> </div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="comment">// Calls the specified rounding method in the parameters. Returns false if the</span></div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// rounding couldn&#39;t be finished.</span></div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordtype">bool</span> Round();</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> </div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="comment">// Round the fractional LP solution values to nearest integer values. This</span></div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="comment">// rounding always finishes so always returns true.</span></div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="keywordtype">bool</span> NearestIntegerRounding();</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> </div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="comment">// Counts the number of up and down locks as defined below.</span></div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// #up_locks = #upper bounded constraints with positive coeff for var</span></div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="comment">// + #lower bounded constraints with negative coeff for var.</span></div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="comment">// #down_locks = #lower bounded constraints with positive coeff for var</span></div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="comment">// + #upper bounded constraints with negative coeff for var.</span></div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="comment">// Rounds the variable in the direction of lesser locks. When the</span></div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="comment">// fractionality is low (less than 0.1), this reverts to nearest integer</span></div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// rounding to avoid rounding almost integer values in wrong direction.</span></div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// This rounding always finishes so always returns true.</span></div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="keywordtype">bool</span> LockBasedRounding();</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> </div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="comment">// Similar to LockBasedRounding except this only considers locks of active</span></div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="comment">// constraints.</span></div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keywordtype">bool</span> ActiveLockBasedRounding();</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> </div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="comment">// This is expensive rounding algorithm. We round variables one by one and</span></div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="comment">// propagate the bounds in between. If none of the rounded values fall in</span></div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// the continuous domain specified by lower and upper bound, we use the</span></div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="comment">// current lower/upper bound (whichever one is closest) instead of rounding</span></div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="comment">// the fractional lp solution value. If both the rounded values are in the</span></div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// domain, we round to nearest integer. This idea was presented in the paper</span></div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="comment">// &quot;Feasibility pump 2.0&quot; (2009) by Matteo Fischetti, Domenico Salvagnin.</span></div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="comment">//</span></div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="comment">// This rounding might not finish either because the time limit is reached or</span></div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="comment">// the model is detected to be unsat. Returns false in those cases.</span></div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="keywordtype">bool</span> PropagationRounding();</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> </div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <span class="keywordtype">void</span> FillIntegerSolutionStats();</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> </div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="comment">// Loads the lp_data_.</span></div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <span class="keywordtype">void</span> InitializeWorkingLP();</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> </div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="comment">// Changes the LP objective and bounds of the norm constraints so the new</span></div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="comment">// objective also tries to minimize the distance to the rounded solution.</span></div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="keywordtype">void</span> L1DistanceMinimize();</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> </div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="comment">// Stores the solutions in the shared repository. Stores LP solution if it is</span></div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// integer and stores the integer solution if it is feasible.</span></div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="keywordtype">void</span> MaybePushToRepo();</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> </div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="keywordtype">void</span> PrintStats();</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> </div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="comment">// Returns the variable value on the same scale as the CP variable value.</span></div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="keywordtype">double</span> GetVariableValueAtCpScale(glop::ColIndex <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> </div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="comment">// Shortcut for an integer linear expression type.</span></div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="keyword">using</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a> = std::vector&lt;std::pair&lt;glop::ColIndex, IntegerValue&gt;&gt;;</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> </div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="comment">// Gets or creates an LP variable that mirrors a model variable.</span></div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="comment">// The variable should be a positive reference.</span></div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> glop::ColIndex GetOrCreateMirrorVariable(IntegerVariable positive_variable);</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> </div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="comment">// Updates the bounds of the LP variables from the CP bounds.</span></div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="keywordtype">void</span> UpdateBoundsOfLpVariables();</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> </div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// This epsilon is related to the precision of the value returned by the LP</span></div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// once they have been scaled back into the CP domain. So for large domain or</span></div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="comment">// cost coefficient, we may have some issues.</span></div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">double</span> kCpEpsilon;</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> </div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// Initial problem in integer form.</span></div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// We always sort the inner vectors by increasing glop::ColIndex.</span></div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <span class="keyword">struct </span>LinearConstraintInternal {</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> IntegerValue lb;</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> IntegerValue ub;</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <a class="code hl_struct" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a> terms;</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> };</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> LinearExpression integer_objective_;</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> IntegerValue objective_infinity_norm_ = IntegerValue(0);</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="keywordtype">double</span> objective_normalization_factor_ = 0.0;</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="keywordtype">double</span> mixing_factor_ = 1.0;</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> </div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector&lt;glop::RowIndex, LinearConstraintInternal&gt;</a> integer_lp_;</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="keywordtype">int</span> model_vars_size_ = 0;</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> </div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="comment">// Underlying LP solver API.</span></div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">glop::LinearProgram</a> lp_data_;</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_revised_simplex.html">glop::RevisedSimplex</a> simplex_;</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> </div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">glop::ColMapping</a> norm_variables_;</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">glop::ColToRowMapping</a> norm_lhs_constraints_;</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">glop::ColToRowMapping</a> norm_rhs_constraints_;</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> </div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="comment">// For the scaling.</span></div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html">glop::LpScalingHelper</a> scaler_;</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> </div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="comment">// Structures used for mirroring IntegerVariables inside the underlying LP</span></div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="comment">// solver: an integer variable var is mirrored by mirror_lp_variable_[var].</span></div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="comment">// Note that these indices are dense in [0, mirror_lp_variable_.size()] so</span></div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="comment">// they can be used as vector indices.</span></div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> std::vector&lt;IntegerVariable&gt; integer_variables_;</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> absl::flat_hash_map&lt;IntegerVariable, glop::ColIndex&gt; mirror_lp_variable_;</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> </div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="comment">// True if the variable was binary before we apply scaling.</span></div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> std::vector&lt;bool&gt; var_is_binary_;</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> </div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="comment">// The following lock information is computed only once.</span></div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="comment">// Number of constraints restricting variable to take higher (resp. lower)</span></div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="comment">// values.</span></div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> std::vector&lt;int&gt; var_up_locks_;</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> std::vector&lt;int&gt; var_down_locks_;</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> </div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="comment">// We need to remember what to optimize if an objective is given, because</span></div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <span class="comment">// then we will switch the objective between feasibility and optimization.</span></div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <span class="keywordtype">bool</span> objective_is_defined_ = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> </div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="comment">// Singletons from Model.</span></div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="keyword">const</span> SatParameters&amp; sat_parameters_;</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <a class="code hl_class" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* time_limit_;</div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> IntegerTrail* integer_trail_;</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <a class="code hl_struct" href="structoperations__research_1_1_trail.html">Trail</a>* trail_;</div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> IntegerEncoder* integer_encoder_;</div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> SharedIncompleteSolutionManager* incomplete_solutions_;</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> SatSolver* sat_solver_;</div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> IntegerDomains* domains_;</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <span class="keyword">const</span> CpModelMapping* mapping_;</div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> </div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="comment">// Last OPTIMAL/Feasible solution found by a call to the underlying LP solver.</span></div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <span class="keywordtype">bool</span> lp_solution_is_set_ = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="keywordtype">bool</span> lp_solution_is_integer_ = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> <span class="keywordtype">double</span> lp_objective_;</div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> std::vector&lt;double&gt; lp_solution_;</div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> std::vector&lt;double&gt; best_lp_solution_;</div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <span class="comment">// We use max fractionality of all variables.</span></div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <span class="keywordtype">double</span> lp_solution_fractionality_;</div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> </div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="comment">// Rounded Integer solution. This might not be feasible.</span></div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="keywordtype">bool</span> integer_solution_is_set_ = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <span class="keywordtype">bool</span> integer_solution_is_feasible_ = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> int64_t integer_solution_objective_;</div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> std::vector&lt;int64_t&gt; integer_solution_;</div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> std::vector&lt;int64_t&gt; best_integer_solution_;</div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <span class="keywordtype">int</span> num_infeasible_constraints_;</div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="comment">// We use max infeasibility of all constraints.</span></div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> int64_t integer_solution_infeasibility_;</div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> </div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="comment">// Sum of all simplex iterations performed by this class. This is useful to</span></div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="comment">// test the incrementality and compare to other solvers.</span></div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> int64_t total_num_simplex_iterations_ = 0;</div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> </div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="comment">// TODO(user): Tune default value. Expose as parameter.</span></div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="keywordtype">int</span> max_fp_iterations_ = 20;</div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> </div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="keywordtype">bool</span> model_is_unsat_ = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span>};</div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> </div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span>} <span class="comment">// namespace sat</span></div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span>} <span class="comment">// namespace operations_research</span></div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> </div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_SAT_FEASIBILITY_PUMP_H_</span></div>
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
<div class="ttc" id="aclassabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector</a></div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00076">strong_vector.h:76</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html">operations_research::TimeLimit</a></div><div class="ttdoc">A simple class to enforce both an elapsed time limit and a deterministic time limit in the same threa...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00105">time_limit.h:105</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html">operations_research::glop::LinearProgram</a></div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8h_source.html#l00055">lp_data.h:55</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_lp_scaling_helper_html"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html">operations_research::glop::LpScalingHelper</a></div><div class="ttdef"><b>Definition:</b> <a href="lp__data__utils_8h_source.html#l00051">lp_data_utils.h:51</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_revised_simplex_html"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html">operations_research::glop::RevisedSimplex</a></div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8h_source.html#l00124">revised_simplex.h:124</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_strict_i_t_i_vector_html"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">operations_research::glop::StrictITIVector&lt; ColIndex, ColIndex &gt;</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_feasibility_pump_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html">operations_research::sat::FeasibilityPump</a></div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8h_source.html#l00034">feasibility_pump.h:34</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_feasibility_pump_html_a0b2361c77d5402a7050af6a2538a09ae"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a0b2361c77d5402a7050af6a2538a09ae">operations_research::sat::FeasibilityPump::HasIntegerSolution</a></div><div class="ttdeci">bool HasIntegerSolution() const</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8h_source.html#l00065">feasibility_pump.h:65</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_feasibility_pump_html_a18206039e9f0c76f2b35907a4f6ea812"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a18206039e9f0c76f2b35907a4f6ea812">operations_research::sat::FeasibilityPump::~FeasibilityPump</a></div><div class="ttdeci">~FeasibilityPump()</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8cc_source.html#l00060">feasibility_pump.cc:60</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_feasibility_pump_html_a3139c5212b639a866499d0cfb2a28e4f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a3139c5212b639a866499d0cfb2a28e4f">operations_research::sat::FeasibilityPump::LPSolutionFractionality</a></div><div class="ttdeci">double LPSolutionFractionality() const</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8h_source.html#l00060">feasibility_pump.h:60</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_feasibility_pump_html_a3f83024f314fe4c509e75b691c5513d0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a3f83024f314fe4c509e75b691c5513d0">operations_research::sat::FeasibilityPump::SetMaxFPIterations</a></div><div class="ttdeci">void SetMaxFPIterations(int max_iter)</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8h_source.html#l00041">feasibility_pump.h:41</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_feasibility_pump_html_a477d40d2455543bdf702f13fa36f4ddd"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a477d40d2455543bdf702f13fa36f4ddd">operations_research::sat::FeasibilityPump::FeasibilityPump</a></div><div class="ttdeci">FeasibilityPump(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8cc_source.html#l00038">feasibility_pump.cc:38</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_feasibility_pump_html_a4a4bc5eab93d6df24cea56b6a29c78ed"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a4a4bc5eab93d6df24cea56b6a29c78ed">operations_research::sat::FeasibilityPump::LPSolutionObjectiveValue</a></div><div class="ttdeci">double LPSolutionObjectiveValue() const</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8h_source.html#l00057">feasibility_pump.h:57</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_feasibility_pump_html_a5faf3bc77eadb1b687efe379820b7aea"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a5faf3bc77eadb1b687efe379820b7aea">operations_research::sat::FeasibilityPump::IntegerSolutionObjectiveValue</a></div><div class="ttdeci">int64_t IntegerSolutionObjectiveValue() const</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8h_source.html#l00066">feasibility_pump.h:66</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_feasibility_pump_html_a67a7327915e66c0514cfa465a0475be1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a67a7327915e66c0514cfa465a0475be1">operations_research::sat::FeasibilityPump::ConstraintIndex</a></div><div class="ttdeci">glop::RowIndex ConstraintIndex</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8h_source.html#l00039">feasibility_pump.h:39</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_feasibility_pump_html_a680158afc869b1a617ca173fa0033202"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a680158afc869b1a617ca173fa0033202">operations_research::sat::FeasibilityPump::GetLPSolutionValue</a></div><div class="ttdeci">double GetLPSolutionValue(IntegerVariable variable) const</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8cc_source.html#l00417">feasibility_pump.cc:417</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_feasibility_pump_html_a942f29030f08426e7e318204e987e2f7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a942f29030f08426e7e318204e987e2f7">operations_research::sat::FeasibilityPump::Solve</a></div><div class="ttdeci">bool Solve()</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8cc_source.html#l00144">feasibility_pump.cc:144</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_feasibility_pump_html_a9ad847669329f6fbccf8e4553adc7dee"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a9ad847669329f6fbccf8e4553adc7dee">operations_research::sat::FeasibilityPump::GetIntegerSolutionValue</a></div><div class="ttdeci">int64_t GetIntegerSolutionValue(IntegerVariable variable) const</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8cc_source.html#l00429">feasibility_pump.cc:429</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_feasibility_pump_html_aaac2d8dee4d7fc8d5e9a1b1cfc3021bc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#aaac2d8dee4d7fc8d5e9a1b1cfc3021bc">operations_research::sat::FeasibilityPump::AddLinearConstraint</a></div><div class="ttdeci">void AddLinearConstraint(const LinearConstraint &amp;ct)</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8cc_source.html#l00065">feasibility_pump.cc:65</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_feasibility_pump_html_acad222fde6e09601cc9d1a7b2481507e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#acad222fde6e09601cc9d1a7b2481507e">operations_research::sat::FeasibilityPump::IntegerSolutionIsFeasible</a></div><div class="ttdeci">bool IntegerSolutionIsFeasible() const</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8h_source.html#l00069">feasibility_pump.h:69</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_feasibility_pump_html_ad271ccd28f3680abba2d189a7b78d86c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#ad271ccd28f3680abba2d189a7b78d86c">operations_research::sat::FeasibilityPump::HasLPSolution</a></div><div class="ttdeci">bool HasLPSolution() const</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8h_source.html#l00056">feasibility_pump.h:56</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_feasibility_pump_html_ae384be06329c4c8f8fd62af7335dae2e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#ae384be06329c4c8f8fd62af7335dae2e">operations_research::sat::FeasibilityPump::SetObjectiveCoefficient</a></div><div class="ttdeci">void SetObjectiveCoefficient(IntegerVariable ivar, IntegerValue coeff)</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8cc_source.html#l00091">feasibility_pump.cc:91</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_feasibility_pump_html_af8f352bb9045be8c9f938118111e2e2e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#af8f352bb9045be8c9f938118111e2e2e">operations_research::sat::FeasibilityPump::LPSolutionIsInteger</a></div><div class="ttdeci">bool LPSolutionIsInteger() const</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8h_source.html#l00059">feasibility_pump.h:59</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00038">sat/model.h:38</a></div></div>
<div class="ttc" id="acp__model__mapping_8h_html"><div class="ttname"><a href="cp__model__mapping_8h.html">cp_model_mapping.h</a></div></div>
<div class="ttc" id="ademon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695"><div class="ttname"><a href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a></div><div class="ttdeci">const Constraint * ct</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00273">gurobi_interface.cc:273</a></div></div>
<div class="ttc" id="ainteger_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
<div class="ttc" id="alp__data_8h_html"><div class="ttname"><a href="lp__data_8h.html">lp_data.h</a></div></div>
<div class="ttc" id="alp__data__utils_8h_html"><div class="ttname"><a href="lp__data__utils_8h.html">lp_data_utils.h</a></div></div>
<div class="ttc" id="alp__types_8h_html"><div class="ttname"><a href="lp__types_8h.html">lp_types.h</a></div></div>
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
<div class="ttc" id="arevised__simplex_8h_html"><div class="ttname"><a href="revised__simplex_8h.html">revised_simplex.h</a></div></div>
<div class="ttc" id="asat_2linear__constraint_8h_html"><div class="ttname"><a href="sat_2linear__constraint_8h.html">linear_constraint.h</a></div></div>
<div class="ttc" id="asat_2util_8h_html"><div class="ttname"><a href="sat_2util_8h.html">util.h</a></div></div>
<div class="ttc" id="asat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
<div class="ttc" id="astrong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
<div class="ttc" id="astructoperations__research_1_1_trail_html"><div class="ttname"><a href="structoperations__research_1_1_trail.html">operations_research::Trail</a></div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l00726">constraint_solver.cc:726</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_linear_constraint_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html">operations_research::sat::LinearConstraint</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00033">sat/linear_constraint.h:33</a></div></div>
<div class="ttc" id="astructoperations__research_1_1sat_1_1_linear_expression_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_expression.html">operations_research::sat::LinearExpression</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00088">sat/linear_constraint.h:88</a></div></div>
<div class="ttc" id="asynchronization_8h_html"><div class="ttname"><a href="synchronization_8h.html">synchronization.h</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="feasibility__pump_8h.html">feasibility_pump.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.9.2 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink