211 lines
18 KiB
HTML
211 lines
18 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: boolean_problem.cc File Reference</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
|
|
 <span id="projectnumber">9.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search','.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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('boolean__problem_8cc.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="summary">
|
|
<a href="#namespaces">Namespaces</a> |
|
|
<a href="#func-members">Functions</a> </div>
|
|
<div class="headertitle">
|
|
<div class="title">boolean_problem.cc File Reference</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<p><a href="boolean__problem_8cc_source.html">Go to the source code of this file.</a></p>
|
|
<table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
|
|
Namespaces</h2></td></tr>
|
|
<tr class="memitem:namespaceoperations__research"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research.html">operations_research</a></td></tr>
|
|
<tr class="memdesc:namespaceoperations__research"><td class="mdescLeft"> </td><td class="mdescRight">Collection of objects used to extend the <a class="el" href="classoperations__research_1_1_constraint.html" title="A constraint is the main modeling object.">Constraint</a> <a class="el" href="classoperations__research_1_1_solver.html" title="Solver Class.">Solver</a> library. <br /></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:namespaceoperations__research_1_1sat"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html">operations_research::sat</a></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem:aa76db68d1f81b1cfd98995e3d0ac26f4"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="boolean__problem_8cc.html#aa76db68d1f81b1cfd98995e3d0ac26f4">ABSL_FLAG</a> (std::string, debug_dump_symmetry_graph_to_file, "", "If this flag is non-empty, an undirected graph whose" " automorphism group is in one-to-one correspondence with the" " symmetries of the SAT problem will be dumped to <a class="el" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> file every" " <a class="el" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> FindLinearBooleanProblemSymmetries() is called.")</td></tr>
|
|
<tr class="separator:aa76db68d1f81b1cfd98995e3d0ac26f4"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ae787aad51dac94ee684cf971def30838"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838">ExtractAssignment</a> (const LinearBooleanProblem &problem, const SatSolver &solver, std::vector< bool > *assignment)</td></tr>
|
|
<tr class="separator:ae787aad51dac94ee684cf971def30838"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a6004b20c87a172cc7d18754489157868"><td class="memItemLeft" align="right" valign="top">absl::Status </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#a6004b20c87a172cc7d18754489157868">ValidateBooleanProblem</a> (const LinearBooleanProblem &problem)</td></tr>
|
|
<tr class="separator:a6004b20c87a172cc7d18754489157868"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:acaccfd2e692c84b7b31c77ac174199cd"><td class="memItemLeft" align="right" valign="top">CpModelProto </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#acaccfd2e692c84b7b31c77ac174199cd">BooleanProblemToCpModelproto</a> (const LinearBooleanProblem &problem)</td></tr>
|
|
<tr class="separator:acaccfd2e692c84b7b31c77ac174199cd"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:aaf57d784624873d840a2589efa6ff1a1"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#aaf57d784624873d840a2589efa6ff1a1">ChangeOptimizationDirection</a> (LinearBooleanProblem *problem)</td></tr>
|
|
<tr class="separator:aaf57d784624873d840a2589efa6ff1a1"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:add13e122d8861d6cac9b9bb4a51cfcb7"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#add13e122d8861d6cac9b9bb4a51cfcb7">LoadBooleanProblem</a> (const LinearBooleanProblem &problem, SatSolver *solver)</td></tr>
|
|
<tr class="separator:add13e122d8861d6cac9b9bb4a51cfcb7"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:aa72e6dc6e802fbf5c5fd237efea1131f"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#aa72e6dc6e802fbf5c5fd237efea1131f">LoadAndConsumeBooleanProblem</a> (LinearBooleanProblem *problem, SatSolver *solver)</td></tr>
|
|
<tr class="separator:aa72e6dc6e802fbf5c5fd237efea1131f"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a40254eb00d4590a09d811fe94c727c2a"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#a40254eb00d4590a09d811fe94c727c2a">UseObjectiveForSatAssignmentPreference</a> (const LinearBooleanProblem &problem, SatSolver *solver)</td></tr>
|
|
<tr class="separator:a40254eb00d4590a09d811fe94c727c2a"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a66979ace60178ae3fe59f6180e4db42f"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#a66979ace60178ae3fe59f6180e4db42f">AddObjectiveUpperBound</a> (const LinearBooleanProblem &problem, Coefficient <a class="el" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, SatSolver *solver)</td></tr>
|
|
<tr class="separator:a66979ace60178ae3fe59f6180e4db42f"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a07c4372fa55782d13edd24b86130e3ba"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#a07c4372fa55782d13edd24b86130e3ba">AddObjectiveConstraint</a> (const LinearBooleanProblem &problem, bool use_lower_bound, Coefficient <a class="el" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, bool use_upper_bound, Coefficient <a class="el" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, SatSolver *solver)</td></tr>
|
|
<tr class="separator:a07c4372fa55782d13edd24b86130e3ba"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:abb66766a5d79e878ff67851bc55ca24f"><td class="memItemLeft" align="right" valign="top">Coefficient </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f">ComputeObjectiveValue</a> (const LinearBooleanProblem &problem, const std::vector< bool > &assignment)</td></tr>
|
|
<tr class="separator:abb66766a5d79e878ff67851bc55ca24f"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:aab5216003fbe0c2f21e7433084d358e1"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1">IsAssignmentValid</a> (const LinearBooleanProblem &problem, const std::vector< bool > &assignment)</td></tr>
|
|
<tr class="separator:aab5216003fbe0c2f21e7433084d358e1"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ae701a64603e2ac22a99d6c0dd0649845"><td class="memItemLeft" align="right" valign="top">std::string </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#ae701a64603e2ac22a99d6c0dd0649845">LinearBooleanProblemToCnfString</a> (const LinearBooleanProblem &problem)</td></tr>
|
|
<tr class="separator:ae701a64603e2ac22a99d6c0dd0649845"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a25b9a60378da756e4100df6231f29b23"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#a25b9a60378da756e4100df6231f29b23">StoreAssignment</a> (const VariablesAssignment &assignment, BooleanAssignment *output)</td></tr>
|
|
<tr class="separator:a25b9a60378da756e4100df6231f29b23"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a58c0f19bf0e5ad35da0572722b33d6e7"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#a58c0f19bf0e5ad35da0572722b33d6e7">ExtractSubproblem</a> (const LinearBooleanProblem &problem, const std::vector< int > &constraint_indices, LinearBooleanProblem *subproblem)</td></tr>
|
|
<tr class="separator:a58c0f19bf0e5ad35da0572722b33d6e7"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a3f6fa74408ea28eb41f29e9696d9a9a2"><td class="memTemplParams" colspan="2">template<typename Graph > </td></tr>
|
|
<tr class="memitem:a3f6fa74408ea28eb41f29e9696d9a9a2"><td class="memTemplItemLeft" align="right" valign="top">Graph * </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#a3f6fa74408ea28eb41f29e9696d9a9a2">GenerateGraphForSymmetryDetection</a> (const LinearBooleanProblem &problem, std::vector< int > *initial_equivalence_classes)</td></tr>
|
|
<tr class="separator:a3f6fa74408ea28eb41f29e9696d9a9a2"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ace3f68c781179d6de36fad9d4b0c386b"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#ace3f68c781179d6de36fad9d4b0c386b">MakeAllLiteralsPositive</a> (LinearBooleanProblem *problem)</td></tr>
|
|
<tr class="separator:ace3f68c781179d6de36fad9d4b0c386b"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a6986d13a746e6577bcf0cb190aef8113"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#a6986d13a746e6577bcf0cb190aef8113">FindLinearBooleanProblemSymmetries</a> (const LinearBooleanProblem &problem, std::vector< std::unique_ptr< SparsePermutation >> *generators)</td></tr>
|
|
<tr class="separator:a6986d13a746e6577bcf0cb190aef8113"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:aa9848f5a312eda3dad1aa59ed96e2519"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#aa9848f5a312eda3dad1aa59ed96e2519">ApplyLiteralMappingToBooleanProblem</a> (const <a class="el" href="classabsl_1_1_strong_vector.html">absl::StrongVector</a>< LiteralIndex, LiteralIndex > &mapping, LinearBooleanProblem *problem)</td></tr>
|
|
<tr class="separator:aa9848f5a312eda3dad1aa59ed96e2519"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ab55a8cd2852ff07c9900f5cff231b329"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research_1_1sat.html#ab55a8cd2852ff07c9900f5cff231b329">ProbeAndSimplifyProblem</a> (SatPostsolver *postsolver, LinearBooleanProblem *problem)</td></tr>
|
|
<tr class="separator:ab55a8cd2852ff07c9900f5cff231b329"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table>
|
|
<h2 class="groupheader">Function Documentation</h2>
|
|
<a id="aa76db68d1f81b1cfd98995e3d0ac26f4"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aa76db68d1f81b1cfd98995e3d0ac26f4">◆ </a></span>ABSL_FLAG()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">ABSL_FLAG </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::string </td>
|
|
<td class="paramname">, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">debug_dump_symmetry_graph_to_file </td>
|
|
<td class="paramname">, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">"" </td>
|
|
<td class="paramname">, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">"If this flag is non- </td>
|
|
<td class="paramname"><em>empty</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">an undirected graph whose" " automorphism group is in one-to-one correspondence with the" " symmetries of the SAT problem will be dumped to <a class="el" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> file every" " <a class="el" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> FindLinearBooleanProblemSymmetries() is called." </td>
|
|
<td class="paramname"> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
</div>
|
|
</div>
|
|
</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="boolean__problem_8cc.html">boolean_problem.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|