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

146 lines
45 KiB
HTML
Raw Normal View History

2020-09-01 16:00:33 +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-01 16:00:33 +02:00
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>OR-Tools: boolean_problem.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-01 16:00:33 +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-01 16:00:33 +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-01 16:00:33 +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-01 16:00:33 +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-01 16:00:33 +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-01 16:00:33 +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('boolean__problem_8h_source.html','');});
2020-09-01 16:00:33 +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">boolean_problem.h</div> </div>
2020-09-01 16:00:33 +02:00
</div><!--header-->
<div class="contents">
2022-01-16 18:02:36 +01:00
<a href="boolean__problem_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_BOOLEAN_PROBLEM_H_</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="preprocessor">#define OR_TOOLS_SAT_BOOLEAN_PROBLEM_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;memory&gt;</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="preprocessor">#include &lt;string&gt;</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="preprocessor">#include &lt;vector&gt;</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;</div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="preprocessor">#include &quot;absl/status/status.h&quot;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="sparse__permutation_8h.html">ortools/algorithms/sparse_permutation.h</a>&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="strong__vector_8h.html">ortools/base/strong_vector.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="boolean__problem_8pb_8h.html">ortools/sat/boolean_problem.pb.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="cp__model_8pb_8h.html">ortools/sat/cp_model.pb.h</a>&quot;</span></div><div c
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aaf57d784624873d840a2589efa6ff1a1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aaf57d784624873d840a2589efa6ff1a1">operations_research::sat::ChangeOptimizationDirection</a></div><div class="ttdeci">void ChangeOptimizationDirection(LinearBooleanProblem *problem)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00210">boolean_problem.cc:210</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a16bcd287bd18e3a940d997aafb9321a9"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a16bcd287bd18e3a940d997aafb9321a9">operations_research::sat::AddOffsetAndScaleObjectiveValue</a></div><div class="ttdeci">double AddOffsetAndScaleObjectiveValue(const LinearBooleanProblem &amp;problem, Coefficient v)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8h_source.html#l00039">boolean_problem.h:39</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aa9848f5a312eda3dad1aa59ed96e2519"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa9848f5a312eda3dad1aa59ed96e2519">operations_research::sat::ApplyLiteralMappingToBooleanProblem</a></div><div class="ttdeci">void ApplyLiteralMappingToBooleanProblem(const absl::StrongVector&lt; LiteralIndex, LiteralIndex &gt; &amp;mapping, LinearBooleanProblem *problem)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00744">boolean_problem.cc:744</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ab55a8cd2852ff07c9900f5cff231b329"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab55a8cd2852ff07c9900f5cff231b329">operations_research::sat::ProbeAndSimplifyProblem</a></div><div class="ttdeci">void ProbeAndSimplifyProblem(SatPostsolver *postsolver, LinearBooleanProblem *problem)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00826">boolean_problem.cc:826</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ae701a64603e2ac22a99d6c0dd0649845"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae701a64603e2ac22a99d6c0dd0649845">operations_research::sat::LinearBooleanProblemToCnfString</a></div><div class="ttdeci">std::string LinearBooleanProblemToCnfString(const LinearBooleanProblem &amp;problem)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00392">boolean_problem.cc:392</a></div></div>
<div class="ttc" id="simplification_8h_html"><div class="ttname"><a href="simplification_8h.html">simplification.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_a9fd8f81a798fd34a843b007c10e40d6b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a9fd8f81a798fd34a843b007c10e40d6b">operations_research::sat::LinearBooleanProblem::objective</a></div><div class="ttdeci">const ::operations_research::sat::LinearObjective &amp; objective() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01582">boolean_problem.pb.h:1582</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a25b9a60378da756e4100df6231f29b23"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a25b9a60378da756e4100df6231f29b23">operations_research::sat::StoreAssignment</a></div><div class="ttdeci">void StoreAssignment(const VariablesAssignment &amp;assignment, BooleanAssignment *output)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00477">boolean_problem.cc:477</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a58c0f19bf0e5ad35da0572722b33d6e7"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a58c0f19bf0e5ad35da0572722b33d6e7">operations_research::sat::ExtractSubproblem</a></div><div class="ttdeci">void ExtractSubproblem(const LinearBooleanProblem &amp;problem, const std::vector&lt; int &gt; &amp;constraint_indices, LinearBooleanProblem *subproblem)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00488">boolean_problem.cc:488</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ae787aad51dac94ee684cf971def30838"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838">operations_research::sat::ExtractAssignment</a></div><div class="ttdeci">void ExtractAssignment(const LinearBooleanProblem &amp;problem, const SatSolver &amp;solver, std::vector&lt; bool &gt; *assignment)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00052">boolean_problem.cc:52</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_acaccfd2e692c84b7b31c77ac174199cd"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#acaccfd2e692c84b7b31c77ac174199cd">operations_research::sat::BooleanProblemToCpModelproto</a></div><div class="ttdeci">CpModelProto BooleanProblemToCpModelproto(const LinearBooleanProblem &amp;problem)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00153">boolean_problem.cc:153</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a6004b20c87a172cc7d18754489157868"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a6004b20c87a172cc7d18754489157868">operations_research::sat::ValidateBooleanProblem</a></div><div class="ttdeci">absl::Status ValidateBooleanProblem(const LinearBooleanProblem &amp;problem)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00133">boolean_problem.cc:133</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html">operations_research::sat::LinearBooleanProblem</a></div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l00711">boolean_problem.pb.h:711</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ace3f68c781179d6de36fad9d4b0c386b"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ace3f68c781179d6de36fad9d4b0c386b">operations_research::sat::MakeAllLiteralsPositive</a></div><div class="ttdeci">void MakeAllLiteralsPositive(LinearBooleanProblem *problem)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00637">boolean_problem.cc:637</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="namespaceoperations__research_1_1sat_html_aa72e6dc6e802fbf5c5fd237efea1131f"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa72e6dc6e802fbf5c5fd237efea1131f">operations_research::sat::LoadAndConsumeBooleanProblem</a></div><div class="ttdeci">bool LoadAndConsumeBooleanProblem(LinearBooleanProblem *problem, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00261">boolean_problem.cc:261</a></div></div>
<div class="ttc" id="gscip__solver_8cc_html_a1e2f9a2352c1d9a6cada9544898fceec"><div class="ttname"><a href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a></div><div class="ttdeci">double lower_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00125">gscip_solver.cc:125</a></div></div>
<div class="ttc" id="sat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
<div class="ttc" id="boolean__problem_8pb_8h_html"><div class="ttname"><a href="boolean__problem_8pb_8h.html">boolean_problem.pb.h</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aab5216003fbe0c2f21e7433084d358e1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1">operations_research::sat::IsAssignmentValid</a></div><div class="ttdeci">bool IsAssignmentValid(const LinearBooleanProblem &amp;problem, const std::vector&lt; bool &gt; &amp;assignment)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00362">boolean_problem.cc:362</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_abb66766a5d79e878ff67851bc55ca24f"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f">operations_research::sat::ComputeObjectiveValue</a></div><div class="ttdeci">Coefficient ComputeObjectiveValue(const LinearBooleanProblem &amp;problem, const std::vector&lt; bool &gt; &amp;assignment)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00348">boolean_problem.cc:348</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a6986d13a746e6577bcf0cb190aef8113"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a6986d13a746e6577bcf0cb190aef8113">operations_research::sat::FindLinearBooleanProblemSymmetries</a></div><div class="ttdeci">void FindLinearBooleanProblemSymmetries(const LinearBooleanProblem &amp;problem, std::vector&lt; std::unique_ptr&lt; SparsePermutation &gt;&gt; *generators)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00672">boolean_problem.cc:672</a></div></div>
<div class="ttc" id="sat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a66979ace60178ae3fe59f6180e4db42f"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a66979ace60178ae3fe59f6180e4db42f">operations_research::sat::AddObjectiveUpperBound</a></div><div class="ttdeci">bool AddObjectiveUpperBound(const LinearBooleanProblem &amp;problem, Coefficient upper_bound, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00330">boolean_problem.cc:330</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_add13e122d8861d6cac9b9bb4a51cfcb7"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#add13e122d8861d6cac9b9bb4a51cfcb7">operations_research::sat::LoadBooleanProblem</a></div><div class="ttdeci">bool LoadBooleanProblem(const LinearBooleanProblem &amp;problem, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00221">boolean_problem.cc:221</a></div></div>
<div class="ttc" id="sparse__permutation_8h_html"><div class="ttname"><a href="sparse__permutation_8h.html">sparse_permutation.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&lt; LiteralIndex, LiteralIndex &gt;</a></div></div>
<div class="ttc" id="pb__constraint_8h_html"><div class="ttname"><a href="pb__constraint_8h.html">pb_constraint.h</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1math__opt_html_ab61209db5b13f0d424da009e414298fc"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc">operations_research::math_opt::Coefficient</a></div><div class="ttdeci">std::tuple&lt; int64_t, int64_t, const double &gt; Coefficient</div><div class="ttdef"><b>Definition:</b> <a href="sparse__collection__matchers_8h_source.html#l00061">sparse_collection_matchers.h:61</a></div></div>
<div class="ttc" id="cp__model_8pb_8h_html"><div class="ttname"><a href="cp__model_8pb_8h.html">cp_model.pb.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_a9e32504c3f1bddb0f25f1386ecf7987b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a9e32504c3f1bddb0f25f1386ecf7987b">operations_research::sat::LinearObjective::scaling_factor</a></div><div class="ttdeci">double scaling_factor() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01359">boolean_problem.pb.h:1359</a></div></div>
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a40254eb00d4590a09d811fe94c727c2a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a40254eb00d4590a09d811fe94c727c2a">operations_research::sat::UseObjectiveForSatAssignmentPreference</a></div><div class="ttdeci">void UseObjectiveForSatAssignmentPreference(const LinearBooleanProblem &amp;problem, SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8cc_source.html#l00309">boolean_problem.cc:309</a></div></div>
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_a96ffc785b7b2135c7980c985883ffdd3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a96ffc785b7b2135c7980c985883ffdd3">operations_research::sat::LinearObjective::offset</a></div><div class="ttdeci">double offset() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01331">boolean_problem.pb.h:1331</a></div></div>
2021-01-26 11:28:50 +01:00
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
2020-09-01 16:00:33 +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="boolean__problem_8h.html">boolean_problem.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-01 16:00:33 +02:00
</ul>
</div>
</body>
</html>