Files
ortools-clone/docs/cpp/linear__programming__constraint_8h_source.html

206 lines
145 KiB
HTML
Raw Normal View History

2020-09-02 09:42:51 +02:00
<!-- 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"/>
2022-01-16 18:02:36 +01:00
<meta name="generator" content="Doxygen 1.8.15"/>
2020-09-02 09:42:51 +02:00
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>OR-Tools: linear_programming_constraint.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>
2022-01-16 18:02:36 +01:00
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
2020-09-02 09:42:51 +02:00
<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
2021-12-14 13:41:01 +01:00
&#160;<span id="projectnumber">9.2</span>
2020-09-02 09:42:51 +02:00
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
2022-01-16 18:02:36 +01:00
<!-- Generated by Doxygen 1.8.15 -->
2020-09-02 09:42:51 +02:00
<script type="text/javascript">
2022-01-16 18:02:36 +01:00
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
2020-09-02 09:42:51 +02:00
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
2022-01-16 18:02:36 +01:00
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
2020-09-02 09:42:51 +02:00
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
2022-01-16 18:02:36 +01:00
/* @license-end */</script>
2020-09-02 09:42:51 +02:00
<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">
2022-01-16 18:02:36 +01:00
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('linear__programming__constraint_8h_source.html','');});
2020-09-02 09:42:51 +02:00
/* @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">
2022-01-16 18:02:36 +01:00
<div class="headertitle">
<div class="title">linear_programming_constraint.h</div> </div>
2020-09-02 09:42:51 +02:00
</div><!--header-->
<div class="contents">
2022-01-16 18:02:36 +01:00
<a href="linear__programming__constraint_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>&#160;<span class="comment">// Copyright 2010-2021 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment">// Licensed under the Apache License, Version 2.0 (the &quot;License&quot;);</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<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>&#160;<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>&#160;<span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<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>&#160;<span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<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>&#160;<span class="comment">// distributed under the License is distributed on an &quot;AS IS&quot; BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<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>&#160;<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>&#160;<span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160;</div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="preprocessor">#ifndef OR_TOOLS_SAT_LINEAR_PROGRAMMING_CONSTRAINT_H_</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="preprocessor">#define OR_TOOLS_SAT_LINEAR_PROGRAMMING_CONSTRAINT_H_</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;</div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="preprocessor">#include &lt;cstdint&gt;</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="preprocessor">#include &lt;limits&gt;</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="preprocessor">#include &lt;utility&gt;</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="preprocessor">#include &lt;vector&gt;</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;</div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;<span class="preprocessor">#include &quot;absl/container/flat_hash_map.h&quot;</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="int__type_8h.html">ortools/base/int_type.h</a>&quot;</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<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 name="l00025"></a><span class="lineno"> 25</span>&#160;<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 name="l00026"></a><span class="lin
<div class="ttc" id="classoperations__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#l00106">time_limit.h:106</a></div></div>
<div class="ttc" id="classoperations__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="structoperations__research_1_1sat_1_1_linear_programming_constraint_lp_solution_html_a75622490d147ba0ea6c189ec651ea23a"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_programming_constraint_lp_solution.html#a75622490d147ba0ea6c189ec651ea23a">operations_research::sat::LinearProgrammingConstraintLpSolution::LinearProgrammingConstraintLpSolution</a></div><div class="ttdeci">LinearProgrammingConstraintLpSolution()</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00054">linear_programming_constraint.h:54</a></div></div>
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html">operations_research::sat::IntegerLiteral</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00168">integer.h:168</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html">operations_research::sat::LinearProgrammingConstraint</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00131">linear_programming_constraint.h:131</a></div></div>
<div class="ttc" id="zero__half__cuts_8h_html"><div class="ttname"><a href="zero__half__cuts_8h.html">zero_half_cuts.h</a></div></div>
<div class="ttc" id="classoperations__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="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_ac912ee1fbcbc9a857e9708236fb1bece"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#ac912ee1fbcbc9a857e9708236fb1bece">operations_research::sat::LinearProgrammingConstraint::integer_variables</a></div><div class="ttdeci">const std::vector&lt; IntegerVariable &gt; &amp; integer_variables() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00173">linear_programming_constraint.h:173</a></div></div>
<div class="ttc" id="integer__expr_8h_html"><div class="ttname"><a href="integer__expr_8h.html">integer_expr.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a5bb623e3dbf158e3fc1f3daf3a8a4edc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a5bb623e3dbf158e3fc1f3daf3a8a4edc">operations_research::sat::LinearProgrammingConstraint::total_num_simplex_iterations</a></div><div class="ttdeci">int64_t total_num_simplex_iterations() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00221">linear_programming_constraint.h:221</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a700f8f1db38fcb59cab04ff2d75a915f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a700f8f1db38fcb59cab04ff2d75a915f">operations_research::sat::LinearProgrammingConstraint::SolutionIsInteger</a></div><div class="ttdeci">bool SolutionIsInteger() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00162">linear_programming_constraint.h:162</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a355a62f25cfadeccfb164ab9fb867c81"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">operations_research::sat::kMinIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMinIntegerValue(-kMaxIntegerValue)</div></div>
<div class="ttc" id="int__type_8h_html"><div class="ttname"><a href="int__type_8h.html">int_type.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a9d3beb2afe4ae647674b054bf29290e2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a9d3beb2afe4ae647674b054bf29290e2">operations_research::sat::LinearProgrammingConstraint::NumVariables</a></div><div class="ttdeci">int NumVariables() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00172">linear_programming_constraint.h:172</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a0010273383670a7c67b3b8f2660aa06b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a0010273383670a7c67b3b8f2660aa06b">operations_research::sat::LinearProgrammingConstraint::Propagate</a></div><div class="ttdeci">bool Propagate() override</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l01410">linear_programming_constraint.cc:1410</a></div></div>
<div class="ttc" id="structoperations__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="sat_2model_8h_html"><div class="ttname"><a href="sat_2model_8h.html">model.h</a></div></div>
<div class="ttc" id="linear__constraint__manager_8h_html"><div class="ttname"><a href="linear__constraint__manager_8h.html">linear_constraint_manager.h</a></div></div>
<div class="ttc" id="default__search_8cc_html_ac673bc430bdc3fdaa09f7becf98ef267"><div class="ttname"><a href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a></div><div class="ttdeci">const std::string name</div><div class="ttdef"><b>Definition:</b> <a href="default__search_8cc_source.html#l00813">default_search.cc:813</a></div></div>
<div class="ttc" id="classoperations__research_1_1_reversible_interface_html"><div class="ttname"><a href="classoperations__research_1_1_reversible_interface.html">operations_research::ReversibleInterface</a></div><div class="ttdef"><b>Definition:</b> <a href="rev_8h_source.html#l00029">rev.h:29</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_abe80d18b1ff9d46681da4c752352e53c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#abe80d18b1ff9d46681da4c752352e53c">operations_research::sat::LinearProgrammingConstraint::HeuristicLpMostInfeasibleBinary</a></div><div class="ttdeci">std::function&lt; IntegerLiteral()&gt; HeuristicLpMostInfeasibleBinary(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l02637">linear_programming_constraint.cc:2637</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a7d89687e3b90df2610cdea9cca94dc73"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a7d89687e3b90df2610cdea9cca94dc73">operations_research::sat::LinearProgrammingConstraint::LatestOptimalConstraintOrNull</a></div><div class="ttdeci">IntegerSumLE * LatestOptimalConstraintOrNull() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00229">linear_programming_constraint.h:229</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a51cf34a6b42aa05c92f9b0b971b03dc9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a51cf34a6b42aa05c92f9b0b971b03dc9">operations_research::sat::LinearProgrammingConstraint::RegisterWith</a></div><div class="ttdeci">void RegisterWith(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00512">linear_programming_constraint.cc:512</a></div></div>
<div class="ttc" id="structoperations__research_1_1sat_1_1_l_p_solve_info_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_l_p_solve_info.html">operations_research::sat::LPSolveInfo</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00058">linear_programming_constraint.h:58</a></div></div>
<div class="ttc" id="time__limit_8h_html"><div class="ttname"><a href="time__limit_8h.html">time_limit.h</a></div></div>
<div class="ttc" id="classoperations__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="markowitz_8cc_html_aa9d6c98fdf8d89b0e2321fda02adc82c"><div class="ttname"><a href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a></div><div class="ttdeci">ColIndex col</div><div class="ttdef"><b>Definition:</b> <a href="markowitz_8cc_source.html#l00183">markowitz.cc:183</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1glop_html_a733947145e3e1631165b618b05c9ccb7"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">operations_research::glop::Fractional</a></div><div class="ttdeci">double Fractional</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00078">lp_types.h:78</a></div></div>
<div class="ttc" id="gurobi__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#l00274">gurobi_interface.cc:274</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1glop_html_a884f3b645d22471e5ed3320e182cd493"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493">operations_research::glop::ProblemStatus</a></div><div class="ttdeci">ProblemStatus</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00102">lp_types.h:102</a></div></div>
<div class="ttc" id="classoperations__research_1_1_rev_repository_html"><div class="ttname"><a href="classoperations__research_1_1_rev_repository.html">operations_research::RevRepository&lt; int &gt;</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_scattered_integer_vector_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html">operations_research::sat::ScatteredIntegerVector</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00066">linear_programming_constraint.h:66</a></div></div>
<div class="ttc" id="structoperations__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="namespaceoperations__research_1_1sat_html_a0a5fb77a89e69aa0f99f00187dbdd798"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0a5fb77a89e69aa0f99f00187dbdd798">operations_research::sat::CreateCVRPCutGenerator</a></div><div class="ttdeci">CutGenerator CreateCVRPCutGenerator(int num_nodes, const std::vector&lt; int &gt; &amp;tails, const std::vector&lt; int &gt; &amp;heads, const std::vector&lt; Literal &gt; &amp;literals, const std::vector&lt; int64_t &gt; &amp;demands, int64_t capacity, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l02616">linear_programming_constraint.cc:2616</a></div></div>
<div class="ttc" id="structoperations__research_1_1sat_1_1_cut_generator_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_cut_generator.html">operations_research::sat::CutGenerator</a></div><div class="ttdef"><b>Definition:</b> <a href="cuts_8h_source.html#l00042">cuts.h:42</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_collection_html_a18fd2d827c0daee60b8eddee4144a13a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint_collection.html#a18fd2d827c0daee60b8eddee4144a13a">operations_research::sat::LinearProgrammingConstraintCollection::LinearProgrammingConstraintCollection</a></div><div class="ttdeci">LinearProgrammingConstraintCollection()</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00562">linear_programming_constraint.h:562</a></div></div>
<div class="ttc" id="classoperations__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#l00125">revised_simplex.h:125</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a4dcf54a3896605bcc5ea4600e52dc64a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a4dcf54a3896605bcc5ea4600e52dc64a">operations_research::sat::LinearProgrammingConstraint::OptimalConstraints</a></div><div class="ttdeci">const std::vector&lt; std::unique_ptr&lt; IntegerSumLE &gt; &gt; &amp; OptimalConstraints() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00234">linear_programming_constraint.h:234</a></div></div>
<div class="ttc" id="sat_2linear__constraint_8h_html"><div class="ttname"><a href="sat_2linear__constraint_8h.html">linear_constraint.h</a></div></div>
<div class="ttc" id="cuts_8h_html"><div class="ttname"><a href="cuts_8h.html">cuts.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_scattered_integer_vector_html_abd20bd618d3e097f3b59958764460578"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#abd20bd618d3e097f3b59958764460578">operations_research::sat::ScatteredIntegerVector::GetTerms</a></div><div class="ttdeci">std::vector&lt; std::pair&lt; glop::ColIndex, IntegerValue &gt; &gt; GetTerms()</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00136">linear_programming_constraint.cc:136</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_scattered_integer_vector_html_ab2fc4510692e040b62507dce522e0e31"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#ab2fc4510692e040b62507dce522e0e31">operations_research::sat::ScatteredIntegerVector::ClearAndResize</a></div><div class="ttdeci">void ClearAndResize(int size)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00051">linear_programming_constraint.cc:51</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_collection_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint_collection.html">operations_research::sat::LinearProgrammingConstraintCollection</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00559">linear_programming_constraint.h:559</a></div></div>
<div class="ttc" id="strong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
<div class="ttc" id="gscip__solver_8cc_html_a1ba5ca0f61f2fa13bd23bf0f89004f35"><div class="ttname"><a href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a></div><div class="ttdeci">double upper_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00126">gscip_solver.cc:126</a></div></div>
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_adcc58612f6a1dc35ff3ffdb34188f299"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#adcc58612f6a1dc35ff3ffdb34188f299">operations_research::glop::LinearProgram::GetDimensionString</a></div><div class="ttdeci">std::string GetDimensionString() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00425">lp_data.cc:425</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a9510cb7a8ef9e220187a115cb279e59d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a9510cb7a8ef9e220187a115cb279e59d">operations_research::sat::LinearProgrammingConstraint::ObjectiveVariable</a></div><div class="ttdeci">IntegerVariable ObjectiveVariable() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00148">linear_programming_constraint.h:148</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_aeb58dc2ca6b2d8f627b837fcfaa4955a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#aeb58dc2ca6b2d8f627b837fcfaa4955a">operations_research::sat::LinearProgrammingConstraint::GetSolutionReducedCost</a></div><div class="ttdeci">double GetSolutionReducedCost(IntegerVariable variable) const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00620">linear_programming_constraint.cc:620</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a3ec85e67d9b28adc25ba131cf8a09d77"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a3ec85e67d9b28adc25ba131cf8a09d77">operations_research::sat::LinearProgrammingConstraint::SolutionObjectiveValue</a></div><div class="ttdeci">double SolutionObjectiveValue() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00159">linear_programming_constraint.h:159</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a8713b8b4baa0b0c2c54907a1fb63c88f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a8713b8b4baa0b0c2c54907a1fb63c88f">operations_research::sat::LinearProgrammingConstraint::Statistics</a></div><div class="ttdeci">std::string Statistics() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l02897">linear_programming_constraint.cc:2897</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ae9e5d88686fd52d3bd1a89d7754ca18c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae9e5d88686fd52d3bd1a89d7754ca18c">operations_research::sat::CreateStronglyConnectedGraphCutGenerator</a></div><div class="ttdeci">CutGenerator CreateStronglyConnectedGraphCutGenerator(int num_nodes, const std::vector&lt; int &gt; &amp;tails, const std::vector&lt; int &gt; &amp;heads, const std::vector&lt; Literal &gt; &amp;literals, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l02599">linear_programming_constraint.cc:2599</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a6ae27451c3238e2af96991a030b7556c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a6ae27451c3238e2af96991a030b7556c">operations_research::sat::LinearProgrammingConstraint::HeuristicLpReducedCostAverageBranching</a></div><div class="ttdeci">std::function&lt; IntegerLiteral()&gt; HeuristicLpReducedCostAverageBranching()</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l02838">linear_programming_constraint.cc:2838</a></div></div>
<div class="ttc" id="structoperations__research_1_1sat_1_1_linear_programming_constraint_lp_solution_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_programming_constraint_lp_solution.html">operations_research::sat::LinearProgrammingConstraintLpSolution</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00052">linear_programming_constraint.h:52</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_sum_l_e_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html">operations_research::sat::IntegerSumLE</a></div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00051">integer_expr.h:51</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a874f2f502681d547a666278de20564e3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a874f2f502681d547a666278de20564e3">operations_research::sat::LinearProgrammingConstraint::HeuristicLpReducedCostBinary</a></div><div class="ttdeci">std::function&lt; IntegerLiteral()&gt; HeuristicLpReducedCostBinary(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l02683">linear_programming_constraint.cc:2683</a></div></div>
<div class="ttc" id="routing__flow_8cc_html_a2acb49f4df5288066c43610bede123ec"><div class="ttname"><a href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a></div><div class="ttdeci">int64_t capacity</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00151">routing_flow.cc:151</a></div></div>
<div class="ttc" id="lp__data_8h_html"><div class="ttname"><a href="lp__data_8h.html">lp_data.h</a></div></div>
<div class="ttc" id="structoperations__research_1_1sat_1_1_l_p_solve_info_html_acfa83ddd00790a21714bc0cacce72607"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_l_p_solve_info.html#acfa83ddd00790a21714bc0cacce72607">operations_research::sat::LPSolveInfo::new_obj_bound</a></div><div class="ttdeci">IntegerValue new_obj_bound</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00061">linear_programming_constraint.h:61</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_scattered_integer_vector_html_a90eab0ff7e041353ffb771c08f922190"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#a90eab0ff7e041353ffb771c08f922190">operations_research::sat::ScatteredIntegerVector::IsSparse</a></div><div class="ttdeci">const bool IsSparse() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00099">linear_programming_constraint.h:99</a></div></div>
<div class="ttc" id="classoperations__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, Fractional &gt;</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_aadd64e5df937ad4d29342ef997d6b9fc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#aadd64e5df937ad4d29342ef997d6b9fc">operations_research::sat::LinearProgrammingConstraint::IncrementalPropagate</a></div><div class="ttdeci">bool IncrementalPropagate(const std::vector&lt; int &gt; &amp;watch_indices) override</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00578">linear_programming_constraint.cc:578</a></div></div>
<div class="ttc" id="sat_2util_8h_html"><div class="ttname"><a href="sat_2util_8h.html">util.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_ae384be06329c4c8f8fd62af7335dae2e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#ae384be06329c4c8f8fd62af7335dae2e">operations_research::sat::LinearProgrammingConstraint::SetObjectiveCoefficient</a></div><div class="ttdeci">void SetObjectiveCoefficient(IntegerVariable ivar, IntegerValue coeff)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00221">linear_programming_constraint.cc:221</a></div></div>
<div class="ttc" id="implied__bounds_8h_html"><div class="ttname"><a href="implied__bounds_8h.html">implied_bounds.h</a></div></div>
<div class="ttc" id="classabsl_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="structoperations__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#l00727">constraint_solver.cc:727</a></div></div>
<div class="ttc" id="revised__simplex_8h_html"><div class="ttname"><a href="revised__simplex_8h.html">revised_simplex.h</a></div></div>
<div class="ttc" id="structoperations__research_1_1sat_1_1_l_p_solve_info_html_a355a72ffc20323940c5c924112cc5bc1"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_l_p_solve_info.html#a355a72ffc20323940c5c924112cc5bc1">operations_research::sat::LPSolveInfo::lp_objective</a></div><div class="ttdeci">double lp_objective</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00060">linear_programming_constraint.h:60</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_scattered_integer_vector_html_aba8a83cbb3cb1c44665976e7bc596651"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#aba8a83cbb3cb1c44665976e7bc596651">operations_research::sat::ScatteredIntegerVector::operator[]</a></div><div class="ttdeci">IntegerValue operator[](glop::ColIndex col) const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00095">linear_programming_constraint.h:95</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_ae2d5f5508caed13aa3697fd40f89dc71"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#ae2d5f5508caed13aa3697fd40f89dc71">operations_research::sat::LinearProgrammingConstraint::SetMainObjectiveVariable</a></div><div class="ttdeci">void SetMainObjectiveVariable(IntegerVariable ivar)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00147">linear_programming_constraint.h:147</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a67a7327915e66c0514cfa465a0475be1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a67a7327915e66c0514cfa465a0475be1">operations_research::sat::LinearProgrammingConstraint::ConstraintIndex</a></div><div class="ttdeci">glop::RowIndex ConstraintIndex</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00134">linear_programming_constraint.h:134</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_propagator_interface_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_propagator_interface.html">operations_research::sat::PropagatorInterface</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01173">integer.h:1173</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_aaac2d8dee4d7fc8d5e9a1b1cfc3021bc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#aaac2d8dee4d7fc8d5e9a1b1cfc3021bc">operations_research::sat::LinearProgrammingConstraint::AddLinearConstraint</a></div><div class="ttdeci">void AddLinearConstraint(const LinearConstraint &amp;ct)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00183">linear_programming_constraint.cc:183</a></div></div>
<div class="ttc" id="integer_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_abd4d63996bf53e4b9251cc9fac30040d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#abd4d63996bf53e4b9251cc9fac30040d">operations_research::sat::LinearProgrammingConstraint::SetLevel</a></div><div class="ttdeci">void SetLevel(int level) override</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00548">linear_programming_constraint.cc:548</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_ac7edc397b78de116072e89fe0ad89266"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#ac7edc397b78de116072e89fe0ad89266">operations_research::sat::LinearProgrammingConstraint::HasSolution</a></div><div class="ttdeci">bool HasSolution() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00158">linear_programming_constraint.h:158</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_dispatcher_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_dispatcher.html">operations_research::sat::LinearProgrammingDispatcher</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00551">linear_programming_constraint.h:551</a></div></div>
<div class="ttc" id="rev_8h_html"><div class="ttname"><a href="rev_8h.html">rev.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_scattered_integer_vector_html_a4940f758f3c0e757a4bcb5bbf795ce67"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#a4940f758f3c0e757a4bcb5bbf795ce67">operations_research::sat::ScatteredIntegerVector::Add</a></div><div class="ttdeci">bool Add(glop::ColIndex col, IntegerValue value)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00068">linear_programming_constraint.cc:68</a></div></div>
<div class="ttc" id="expr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_incremental_average_html_a6d9b473fa04b0558a8e48737f5ab9564"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_incremental_average.html#a6d9b473fa04b0558a8e48737f5ab9564">operations_research::sat::IncrementalAverage::CurrentAverage</a></div><div class="ttdeci">double CurrentAverage() const</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8h_source.html#l00168">sat/util.h:168</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a8172ae7d172bec9d3a417ddcaab7c474"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a8172ae7d172bec9d3a417ddcaab7c474">operations_research::sat::LinearProgrammingConstraint::LinearProgrammingConstraint</a></div><div class="ttdeci">LinearProgrammingConstraint(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00156">linear_programming_constraint.cc:156</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_scattered_integer_vector_html_a1077b795353fa06d7705f43377bedfe9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#a1077b795353fa06d7705f43377bedfe9">operations_research::sat::ScatteredIntegerVector::ConvertToLinearConstraint</a></div><div class="ttdeci">void ConvertToLinearConstraint(const std::vector&lt; IntegerVariable &gt; &amp;integer_variables, IntegerValue upper_bound, LinearConstraint *result)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00109">linear_programming_constraint.cc:109</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a0e49aa5d4eabab5cd4c30c0d3498204f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a0e49aa5d4eabab5cd4c30c0d3498204f">operations_research::sat::LinearProgrammingConstraint::average_degeneracy</a></div><div class="ttdeci">double average_degeneracy() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00217">linear_programming_constraint.h:217</a></div></div>
<div class="ttc" id="lp__types_8h_html"><div class="ttname"><a href="lp__types_8h.html">lp_types.h</a></div></div>
<div class="ttc" id="lp__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="classoperations__research_1_1sat_1_1_scattered_integer_vector_html_aeb3044e58e1e28e857c5265734ae7e30"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scattered_integer_vector.html#aeb3044e58e1e28e857c5265734ae7e30">operations_research::sat::ScatteredIntegerVector::AddLinearExpressionMultiple</a></div><div class="ttdeci">bool AddLinearExpressionMultiple(IntegerValue multiplier, const std::vector&lt; std::pair&lt; glop::ColIndex, IntegerValue &gt;&gt; &amp;terms)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00081">linear_programming_constraint.cc:81</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_aefa083730af18963c9bfd9915b5cd187"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#aefa083730af18963c9bfd9915b5cd187">operations_research::sat::LinearProgrammingConstraint::AddCutGenerator</a></div><div class="ttdeci">void AddCutGenerator(CutGenerator generator)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00571">linear_programming_constraint.cc:571</a></div></div>
<div class="ttc" id="demon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_manager_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_manager.html">operations_research::sat::LinearConstraintManager</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__constraint__manager_8h_source.html#l00043">linear_constraint_manager.h:43</a></div></div>
<div class="ttc" id="demon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695"><div class="ttname"><a href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a></div><div class="ttdeci">const Constraint * ct</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_constraint_html_a460fe5216ff7f997841e588d432be744"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_constraint.html#a460fe5216ff7f997841e588d432be744">operations_research::sat::LinearProgrammingConstraint::GetSolutionValue</a></div><div class="ttdeci">double GetSolutionValue(IntegerVariable variable) const</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8cc_source.html#l00615">linear_programming_constraint.cc:615</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_programming_dispatcher_html_a6ca8f8510095f447efa72b17967f2ecf"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_programming_dispatcher.html#a6ca8f8510095f447efa72b17967f2ecf">operations_research::sat::LinearProgrammingDispatcher::LinearProgrammingDispatcher</a></div><div class="ttdeci">LinearProgrammingDispatcher(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00555">linear_programming_constraint.h:555</a></div></div>
<div class="ttc" id="structoperations__research_1_1sat_1_1_l_p_solve_info_html_a7889399b576072ea3c7b20ab28c46d91"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_l_p_solve_info.html#a7889399b576072ea3c7b20ab28c46d91">operations_research::sat::LPSolveInfo::status</a></div><div class="ttdeci">glop::ProblemStatus status</div><div class="ttdef"><b>Definition:</b> <a href="linear__programming__constraint_8h_source.html#l00059">linear_programming_constraint.h:59</a></div></div>
2021-01-26 11:28:50 +01:00
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
2020-09-02 09:42:51 +02:00
<!-- 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="linear__programming__constraint_8h.html">linear_programming_constraint.h</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
2022-01-16 18:02:36 +01:00
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
2020-09-02 09:42:51 +02:00
</ul>
</div>
</body>
</html>