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" / >
2021-01-26 11:28:50 +01:00
< meta name = "generator" content = "Doxygen 1.9.1" / >
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 >
< 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-04-27 23:00:03 +02:00
  < span id = "projectnumber" > 9.0< / span >
2020-09-01 16:00:33 +02:00
< / div >
< / td >
< / tr >
< / tbody >
< / table >
< / div >
<!-- end header part -->
2021-01-26 11:28:50 +01:00
<!-- Generated by Doxygen 1.9.1 -->
2020-09-01 16:00:33 +02:00
< script type = "text/javascript" >
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3& dn=gpl-2.0.txt GPL-v2 */
2021-01-26 11:28:50 +01:00
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
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" >
/* @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_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" > boolean_problem.h< / div > < / div >
< / div > <!-- header -->
< div class = "contents" >
2021-04-27 23:00:03 +02: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 >   < span class = "comment" > // Copyright 2010-2021 Google LLC< / span > < / div >
2020-09-01 16:00:33 +02:00
< div class = "line" > < a name = "l00002" > < / a > < span class = "lineno" > 2< / span >   < span class = "comment" > // Licensed under the Apache License, Version 2.0 (the " License" );< / span > < / div >
< div class = "line" > < a name = "l00003" > < / a > < span class = "lineno" > 3< / span >   < span class = "comment" > // you may not use this file except in compliance with the License.< / span > < / div >
< div class = "line" > < a name = "l00004" > < / a > < span class = "lineno" > 4< / span >   < span class = "comment" > // You may obtain a copy of the License at< / span > < / div >
< div class = "line" > < a name = "l00005" > < / a > < span class = "lineno" > 5< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00006" > < / a > < span class = "lineno" > 6< / span >   < span class = "comment" > // http://www.apache.org/licenses/LICENSE-2.0< / span > < / div >
< div class = "line" > < a name = "l00007" > < / a > < span class = "lineno" > 7< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00008" > < / a > < span class = "lineno" > 8< / span >   < span class = "comment" > // Unless required by applicable law or agreed to in writing, software< / span > < / div >
< div class = "line" > < a name = "l00009" > < / a > < span class = "lineno" > 9< / span >   < span class = "comment" > // distributed under the License is distributed on an " AS IS" BASIS,< / span > < / div >
< div class = "line" > < a name = "l00010" > < / a > < span class = "lineno" > 10< / span >   < span class = "comment" > // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.< / span > < / div >
< div class = "line" > < a name = "l00011" > < / a > < span class = "lineno" > 11< / span >   < span class = "comment" > // See the License for the specific language governing permissions and< / span > < / div >
< div class = "line" > < a name = "l00012" > < / a > < span class = "lineno" > 12< / span >   < span class = "comment" > // limitations under the License.< / span > < / div >
< div class = "line" > < a name = "l00013" > < / a > < span class = "lineno" > 13< / span >   < / div >
< div class = "line" > < a name = "l00014" > < / a > < span class = "lineno" > 14< / span >   < span class = "preprocessor" > #ifndef OR_TOOLS_SAT_BOOLEAN_PROBLEM_H_< / span > < / div >
< div class = "line" > < a name = "l00015" > < / a > < span class = "lineno" > 15< / span >   < span class = "preprocessor" > #define OR_TOOLS_SAT_BOOLEAN_PROBLEM_H_< / span > < / div >
< div class = "line" > < a name = "l00016" > < / a > < span class = "lineno" > 16< / span >   < / div >
< div class = "line" > < a name = "l00017" > < / a > < span class = "lineno" > 17< / span >   < span class = "preprocessor" > #include < memory> < / span > < / div >
< div class = "line" > < a name = "l00018" > < / a > < span class = "lineno" > 18< / span >   < span class = "preprocessor" > #include < string> < / span > < / div >
< div class = "line" > < a name = "l00019" > < / a > < span class = "lineno" > 19< / span >   < span class = "preprocessor" > #include < vector> < / span > < / div >
< div class = "line" > < a name = "l00020" > < / a > < span class = "lineno" > 20< / span >   < / div >
< div class = "line" > < a name = "l00021" > < / a > < span class = "lineno" > 21< / span >   < span class = "preprocessor" > #include " absl/status/status.h" < / span > < / div >
< div class = "line" > < a name = "l00022" > < / a > < span class = "lineno" > 22< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "sparse__permutation_8h.html" > ortools/algorithms/sparse_permutation.h< / a > " < / span > < / div >
2020-12-07 17:47:46 +01:00
< div class = "line" > < a name = "l00023" > < / a > < span class = "lineno" > 23< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "strong__vector_8h.html" > ortools/base/strong_vector.h< / a > " < / span > < / div >
2020-09-01 16:00:33 +02:00
< div class = "line" > < a name = "l00024" > < / a > < span class = "lineno" > 24< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "boolean__problem_8pb_8h.html" > ortools/sat/boolean_problem.pb.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00025" > < / a > < span class = "lineno" > 25< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "cp__model_8pb_8h.html" > ortools/sat/cp_model.pb.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00026" > < / a > < span class = "lineno" > 26< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "pb__constraint_8h.html" > ortools/sat/pb_constraint.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00027" > < / a > < span class = "lineno" > 27< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "sat__base_8h.html" > ortools/sat/sat_base.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00028" > < / a > < span class = "lineno" > 28< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "sat__solver_8h.html" > ortools/sat/sat_solver.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00029" > < / a > < span class = "lineno" > 29< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "simplification_8h.html" > ortools/sat/simplification.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00030" > < / a > < span class = "lineno" > 30< / span >   < / div >
< div class = "line" > < a name = "l00031" > < / a > < span class = "lineno" > 31< / span >   < span class = "keyword" > namespace < / span > < a class = "code" href = "namespaceoperations__research.html" > operations_research< / a > {< / div >
< div class = "line" > < a name = "l00032" > < / a > < span class = "lineno" > 32< / span >   < span class = "keyword" > namespace < / span > sat {< / div >
< div class = "line" > < a name = "l00033" > < / a > < span class = "lineno" > 33< / span >   < / div >
< div class = "line" > < a name = "l00034" > < / a > < span class = "lineno" > 34< / span >   < span class = "comment" > // Converts a LinearBooleanProblem to a CpModelProto which should eventually< / span > < / div >
< div class = "line" > < a name = "l00035" > < / a > < span class = "lineno" > 35< / span >   < span class = "comment" > // replace completely the LinearBooleanProblem proto.< / span > < / div >
< div class = "line" > < a name = "l00036" > < / a > < span class = "lineno" > 36< / span >   CpModelProto < a class = "code" href = "namespaceoperations__research_1_1sat.html#acaccfd2e692c84b7b31c77ac174199cd" > BooleanProblemToCpModelproto< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem);< / div >
< div class = "line" > < a name = "l00037" > < / a > < span class = "lineno" > 37< / span >   < / div >
< div class = "line" > < a name = "l00038" > < / a > < span class = "lineno" > 38< / span >   < span class = "comment" > // Adds the offset and returns the scaled version of the given objective value.< / span > < / div >
< div class = "line" > < a name = "l00039" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a16bcd287bd18e3a940d997aafb9321a9" > 39< / a > < / span >   < span class = "keyword" > inline< / span > < span class = "keywordtype" > double< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#a16bcd287bd18e3a940d997aafb9321a9" > AddOffsetAndScaleObjectiveValue< / a > (< / div >
< div class = "line" > < a name = "l00040" > < / a > < span class = "lineno" > 40< / span >   < span class = "keyword" > const< / span > LinearBooleanProblem& problem, Coefficient v) {< / div >
< div class = "line" > < a name = "l00041" > < / a > < span class = "lineno" > 41< / span >   < span class = "keywordflow" > return< / span > (< span class = "keyword" > static_cast< < / span > < span class = "keywordtype" > double< / span > < span class = "keyword" > > < / span > (v.value()) + problem.objective().offset()) *< / div >
< div class = "line" > < a name = "l00042" > < / a > < span class = "lineno" > 42< / span >   problem.objective().scaling_factor();< / div >
< div class = "line" > < a name = "l00043" > < / a > < span class = "lineno" > 43< / span >   }< / div >
< div class = "line" > < a name = "l00044" > < / a > < span class = "lineno" > 44< / span >   < / div >
< div class = "line" > < a name = "l00045" > < / a > < span class = "lineno" > 45< / span >   < span class = "comment" > // Keeps the same objective but change the optimization direction from a< / span > < / div >
< div class = "line" > < a name = "l00046" > < / a > < span class = "lineno" > 46< / span >   < span class = "comment" > // minimization problem to a maximization problem.< / span > < / div >
< div class = "line" > < a name = "l00047" > < / a > < span class = "lineno" > 47< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00048" > < / a > < span class = "lineno" > 48< / span >   < span class = "comment" > // Ex: if the problem was to minimize 2 + x, the new problem will be to maximize< / span > < / div >
< div class = "line" > < a name = "l00049" > < / a > < span class = "lineno" > 49< / span >   < span class = "comment" > // 2 + x subject to exactly the same constraints.< / span > < / div >
< div class = "line" > < a name = "l00050" > < / a > < span class = "lineno" > 50< / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#aaf57d784624873d840a2589efa6ff1a1" > ChangeOptimizationDirection< / a > (LinearBooleanProblem* problem);< / div >
< div class = "line" > < a name = "l00051" > < / a > < span class = "lineno" > 51< / span >   < / div >
< div class = "line" > < a name = "l00052" > < / a > < span class = "lineno" > 52< / span >   < span class = "comment" > // Copies the assignment from the solver into the given Boolean vector. Note< / span > < / div >
< div class = "line" > < a name = "l00053" > < / a > < span class = "lineno" > 53< / span >   < span class = "comment" > // that variables with a greater index that the given num_variables are ignored.< / span > < / div >
< div class = "line" > < a name = "l00054" > < / a > < span class = "lineno" > 54< / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838" > ExtractAssignment< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00055" > < / a > < span class = "lineno" > 55< / span >   < span class = "keyword" > const< / span > SatSolver& solver, std::vector< bool> * assignment);< / div >
< div class = "line" > < a name = "l00056" > < / a > < span class = "lineno" > 56< / span >   < / div >
< div class = "line" > < a name = "l00057" > < / a > < span class = "lineno" > 57< / span >   < span class = "comment" > // Tests the preconditions of the given problem (as described in the proto) and< / span > < / div >
< div class = "line" > < a name = "l00058" > < / a > < span class = "lineno" > 58< / span >   < span class = "comment" > // returns an error if they are not all satisfied.< / span > < / div >
< div class = "line" > < a name = "l00059" > < / a > < span class = "lineno" > 59< / span >   absl::Status < a class = "code" href = "namespaceoperations__research_1_1sat.html#a6004b20c87a172cc7d18754489157868" > ValidateBooleanProblem< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem);< / div >
< div class = "line" > < a name = "l00060" > < / a > < span class = "lineno" > 60< / span >   < / div >
< div class = "line" > < a name = "l00061" > < / a > < span class = "lineno" > 61< / span >   < span class = "comment" > // Loads a BooleanProblem into a given SatSolver instance.< / span > < / div >
< div class = "line" > < a name = "l00062" > < / a > < span class = "lineno" > 62< / span >   < span class = "keywordtype" > bool< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#add13e122d8861d6cac9b9bb4a51cfcb7" > LoadBooleanProblem< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem, SatSolver* solver);< / div >
< div class = "line" > < a name = "l00063" > < / a > < span class = "lineno" > 63< / span >   < / div >
< div class = "line" > < a name = "l00064" > < / a > < span class = "lineno" > 64< / span >   < span class = "comment" > // Same as LoadBooleanProblem() but also free the memory used by the problem< / span > < / div >
< div class = "line" > < a name = "l00065" > < / a > < span class = "lineno" > 65< / span >   < span class = "comment" > // during the loading. This allows to use less peak memory. Note that this< / span > < / div >
< div class = "line" > < a name = "l00066" > < / a > < span class = "lineno" > 66< / span >   < span class = "comment" > // function clear all the constraints of the given problem (not the objective< / span > < / div >
< div class = "line" > < a name = "l00067" > < / a > < span class = "lineno" > 67< / span >   < span class = "comment" > // though).< / span > < / div >
< div class = "line" > < a name = "l00068" > < / a > < span class = "lineno" > 68< / span >   < span class = "keywordtype" > bool< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#aa72e6dc6e802fbf5c5fd237efea1131f" > LoadAndConsumeBooleanProblem< / a > (LinearBooleanProblem* problem,< / div >
< div class = "line" > < a name = "l00069" > < / a > < span class = "lineno" > 69< / span >   SatSolver* solver);< / div >
< div class = "line" > < a name = "l00070" > < / a > < span class = "lineno" > 70< / span >   < / div >
< div class = "line" > < a name = "l00071" > < / a > < span class = "lineno" > 71< / span >   < span class = "comment" > // Uses the objective coefficient to drive the SAT search towards an< / span > < / div >
< div class = "line" > < a name = "l00072" > < / a > < span class = "lineno" > 72< / span >   < span class = "comment" > // heuristically better solution.< / span > < / div >
< div class = "line" > < a name = "l00073" > < / a > < span class = "lineno" > 73< / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#a40254eb00d4590a09d811fe94c727c2a" > UseObjectiveForSatAssignmentPreference< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00074" > < / a > < span class = "lineno" > 74< / span >   SatSolver* solver);< / div >
< div class = "line" > < a name = "l00075" > < / a > < span class = "lineno" > 75< / span >   < / div >
< div class = "line" > < a name = "l00076" > < / a > < span class = "lineno" > 76< / span >   < span class = "comment" > // Adds the constraint that the objective is smaller than the given upper bound.< / span > < / div >
< div class = "line" > < a name = "l00077" > < / a > < span class = "lineno" > 77< / span >   < span class = "keywordtype" > bool< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#a66979ace60178ae3fe59f6180e4db42f" > AddObjectiveUpperBound< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
2021-04-27 23:00:03 +02:00
< div class = "line" > < a name = "l00078" > < / a > < span class = "lineno" > 78< / span >   Coefficient < a class = "code" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > , SatSolver* solver);< / div >
2020-09-01 16:00:33 +02:00
< div class = "line" > < a name = "l00079" > < / a > < span class = "lineno" > 79< / span >   < / div >
< div class = "line" > < a name = "l00080" > < / a > < span class = "lineno" > 80< / span >   < span class = "comment" > // Adds the constraint that the objective is smaller or equals to the given< / span > < / div >
< div class = "line" > < a name = "l00081" > < / a > < span class = "lineno" > 81< / span >   < span class = "comment" > // upper bound.< / span > < / div >
< div class = "line" > < a name = "l00082" > < / a > < span class = "lineno" > 82< / span >   < span class = "keywordtype" > bool< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#a07c4372fa55782d13edd24b86130e3ba" > AddObjectiveConstraint< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
2021-04-27 23:00:03 +02:00
< div class = "line" > < a name = "l00083" > < / a > < span class = "lineno" > 83< / span >   < span class = "keywordtype" > bool< / span > use_lower_bound, Coefficient < a class = "code" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > ,< / div >
< div class = "line" > < a name = "l00084" > < / a > < span class = "lineno" > 84< / span >   < span class = "keywordtype" > bool< / span > use_upper_bound, Coefficient < a class = "code" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > ,< / div >
2020-09-01 16:00:33 +02:00
< div class = "line" > < a name = "l00085" > < / a > < span class = "lineno" > 85< / span >   SatSolver* solver);< / div >
< div class = "line" > < a name = "l00086" > < / a > < span class = "lineno" > 86< / span >   < / div >
< div class = "line" > < a name = "l00087" > < / a > < span class = "lineno" > 87< / span >   < span class = "comment" > // Returns the objective value under the current assignment.< / span > < / div >
< div class = "line" > < a name = "l00088" > < / a > < span class = "lineno" > 88< / span >   Coefficient < a class = "code" href = "namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f" > ComputeObjectiveValue< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00089" > < / a > < span class = "lineno" > 89< / span >   < span class = "keyword" > const< / span > std::vector< bool> & assignment);< / div >
< div class = "line" > < a name = "l00090" > < / a > < span class = "lineno" > 90< / span >   < / div >
< div class = "line" > < a name = "l00091" > < / a > < span class = "lineno" > 91< / span >   < span class = "comment" > // Checks that an assignment is valid for the given BooleanProblem.< / span > < / div >
< div class = "line" > < a name = "l00092" > < / a > < span class = "lineno" > 92< / span >   < span class = "keywordtype" > bool< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1" > IsAssignmentValid< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00093" > < / a > < span class = "lineno" > 93< / span >   < span class = "keyword" > const< / span > std::vector< bool> & assignment);< / div >
< div class = "line" > < a name = "l00094" > < / a > < span class = "lineno" > 94< / span >   < / div >
< div class = "line" > < a name = "l00095" > < / a > < span class = "lineno" > 95< / span >   < span class = "comment" > // Converts a LinearBooleanProblem to the cnf file format.< / span > < / div >
< div class = "line" > < a name = "l00096" > < / a > < span class = "lineno" > 96< / span >   < span class = "comment" > // Note that this only works for pure SAT problems (only clauses), max-sat or< / span > < / div >
< div class = "line" > < a name = "l00097" > < / a > < span class = "lineno" > 97< / span >   < span class = "comment" > // weighted max-sat problems. Returns an empty string on error.< / span > < / div >
< div class = "line" > < a name = "l00098" > < / a > < span class = "lineno" > 98< / span >   std::string < a class = "code" href = "namespaceoperations__research_1_1sat.html#ae701a64603e2ac22a99d6c0dd0649845" > LinearBooleanProblemToCnfString< / a > (< / div >
< div class = "line" > < a name = "l00099" > < / a > < span class = "lineno" > 99< / span >   < span class = "keyword" > const< / span > LinearBooleanProblem& problem);< / div >
< div class = "line" > < a name = "l00100" > < / a > < span class = "lineno" > 100< / span >   < / div >
< div class = "line" > < a name = "l00101" > < / a > < span class = "lineno" > 101< / span >   < span class = "comment" > // Store a variable assignment into the given BooleanAssignement proto.< / span > < / div >
< div class = "line" > < a name = "l00102" > < / a > < span class = "lineno" > 102< / span >   < span class = "comment" > // Note that only the assigned variables are stored, so the assignment may be< / span > < / div >
< div class = "line" > < a name = "l00103" > < / a > < span class = "lineno" > 103< / span >   < span class = "comment" > // incomplete.< / span > < / div >
< div class = "line" > < a name = "l00104" > < / a > < span class = "lineno" > 104< / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#a25b9a60378da756e4100df6231f29b23" > StoreAssignment< / a > (< span class = "keyword" > const< / span > VariablesAssignment& assignment,< / div >
< div class = "line" > < a name = "l00105" > < / a > < span class = "lineno" > 105< / span >   BooleanAssignment* output);< / div >
< div class = "line" > < a name = "l00106" > < / a > < span class = "lineno" > 106< / span >   < / div >
< div class = "line" > < a name = "l00107" > < / a > < span class = "lineno" > 107< / span >   < span class = "comment" > // Constructs a sub-problem formed by the constraints with given indices.< / span > < / div >
< div class = "line" > < a name = "l00108" > < / a > < span class = "lineno" > 108< / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#a58c0f19bf0e5ad35da0572722b33d6e7" > ExtractSubproblem< / a > (< span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00109" > < / a > < span class = "lineno" > 109< / span >   < span class = "keyword" > const< / span > std::vector< int> & constraint_indices,< / div >
< div class = "line" > < a name = "l00110" > < / a > < span class = "lineno" > 110< / span >   LinearBooleanProblem* subproblem);< / div >
< div class = "line" > < a name = "l00111" > < / a > < span class = "lineno" > 111< / span >   < / div >
< div class = "line" > < a name = "l00112" > < / a > < span class = "lineno" > 112< / span >   < span class = "comment" > // Modifies the given LinearBooleanProblem so that all the literals appearing< / span > < / div >
< div class = "line" > < a name = "l00113" > < / a > < span class = "lineno" > 113< / span >   < span class = "comment" > // inside are positive.< / span > < / div >
< div class = "line" > < a name = "l00114" > < / a > < span class = "lineno" > 114< / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#ace3f68c781179d6de36fad9d4b0c386b" > MakeAllLiteralsPositive< / a > (LinearBooleanProblem* problem);< / div >
< div class = "line" > < a name = "l00115" > < / a > < span class = "lineno" > 115< / span >   < / div >
< div class = "line" > < a name = "l00116" > < / a > < span class = "lineno" > 116< / span >   < span class = "comment" > // Returns a list of generators of the symmetry group of the given problem. Each< / span > < / div >
< div class = "line" > < a name = "l00117" > < / a > < span class = "lineno" > 117< / span >   < span class = "comment" > // generator is a permutation of the integer range [0, 2n) where n is the number< / span > < / div >
< div class = "line" > < a name = "l00118" > < / a > < span class = "lineno" > 118< / span >   < span class = "comment" > // of variables of the problem. They are permutations of the (index< / span > < / div >
< div class = "line" > < a name = "l00119" > < / a > < span class = "lineno" > 119< / span >   < span class = "comment" > // representation of the) problem literals.< / span > < / div >
< div class = "line" > < a name = "l00120" > < / a > < span class = "lineno" > 120< / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#a6986d13a746e6577bcf0cb190aef8113" > FindLinearBooleanProblemSymmetries< / a > (< / div >
< div class = "line" > < a name = "l00121" > < / a > < span class = "lineno" > 121< / span >   < span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00122" > < / a > < span class = "lineno" > 122< / span >   std::vector< std::unique_ptr< SparsePermutation> > * generators);< / div >
< div class = "line" > < a name = "l00123" > < / a > < span class = "lineno" > 123< / span >   < / div >
< div class = "line" > < a name = "l00124" > < / a > < span class = "lineno" > 124< / span >   < span class = "comment" > // Maps all the literals of the problem. Note that this converts the cost of a< / span > < / div >
< div class = "line" > < a name = "l00125" > < / a > < span class = "lineno" > 125< / span >   < span class = "comment" > // variable correctly, that is if a variable with cost is mapped to another, the< / span > < / div >
< div class = "line" > < a name = "l00126" > < / a > < span class = "lineno" > 126< / span >   < span class = "comment" > // cost of the later is updated.< / span > < / div >
< div class = "line" > < a name = "l00127" > < / a > < span class = "lineno" > 127< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00128" > < / a > < span class = "lineno" > 128< / span >   < span class = "comment" > // Preconditions: the mapping must map l and not(l) to the same variable and be< / span > < / div >
< div class = "line" > < a name = "l00129" > < / a > < span class = "lineno" > 129< / span >   < span class = "comment" > // of the correct size. It can also map a literal index to kTrueLiteralIndex< / span > < / div >
< div class = "line" > < a name = "l00130" > < / a > < span class = "lineno" > 130< / span >   < span class = "comment" > // or kFalseLiteralIndex in order to fix the variable.< / span > < / div >
2020-12-07 17:47:46 +01:00
< div class = "line" > < a name = "l00131" > < / a > < span class = "lineno" > 131< / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#aa9848f5a312eda3dad1aa59ed96e2519" > ApplyLiteralMappingToBooleanProblem< / a > (< / div >
< div class = "line" > < a name = "l00132" > < / a > < span class = "lineno" > 132< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classabsl_1_1_strong_vector.html" > absl::StrongVector< LiteralIndex, LiteralIndex> < / a > & mapping,< / div >
2020-09-01 16:00:33 +02:00
< div class = "line" > < a name = "l00133" > < / a > < span class = "lineno" > 133< / span >   LinearBooleanProblem* problem);< / div >
< div class = "line" > < a name = "l00134" > < / a > < span class = "lineno" > 134< / span >   < / div >
< div class = "line" > < a name = "l00135" > < / a > < span class = "lineno" > 135< / span >   < span class = "comment" > // A simple preprocessing step that does basic probing and removes the fixed and< / span > < / div >
< div class = "line" > < a name = "l00136" > < / a > < span class = "lineno" > 136< / span >   < span class = "comment" > // equivalent variables. Note that the variable indices will also be remapped in< / span > < / div >
< div class = "line" > < a name = "l00137" > < / a > < span class = "lineno" > 137< / span >   < span class = "comment" > // order to be dense. The given postsolver will be updated with the information< / span > < / div >
< div class = "line" > < a name = "l00138" > < / a > < span class = "lineno" > 138< / span >   < span class = "comment" > // needed during postsolve.< / span > < / div >
< div class = "line" > < a name = "l00139" > < / a > < span class = "lineno" > 139< / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#ab55a8cd2852ff07c9900f5cff231b329" > ProbeAndSimplifyProblem< / a > (SatPostsolver* postsolver,< / div >
< div class = "line" > < a name = "l00140" > < / a > < span class = "lineno" > 140< / span >   LinearBooleanProblem* problem);< / div >
< div class = "line" > < a name = "l00141" > < / a > < span class = "lineno" > 141< / span >   < / div >
< div class = "line" > < a name = "l00142" > < / a > < span class = "lineno" > 142< / span >   } < span class = "comment" > // namespace sat< / span > < / div >
< div class = "line" > < a name = "l00143" > < / a > < span class = "lineno" > 143< / span >   } < span class = "comment" > // namespace operations_research< / span > < / div >
< div class = "line" > < a name = "l00144" > < / a > < span class = "lineno" > 144< / span >   < / div >
2021-01-26 11:28:50 +01:00
< div class = "line" > < a name = "l00145" > < / a > < span class = "lineno" > 145< / span >   < span class = "preprocessor" > #endif < / span > < span class = "comment" > // OR_TOOLS_SAT_BOOLEAN_PROBLEM_H_< / span > < / div >
< div class = "ttc" id = "aboolean__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 = "aclassabsl_1_1_strong_vector_html" > < div class = "ttname" > < a href = "classabsl_1_1_strong_vector.html" > absl::StrongVector< LiteralIndex, LiteralIndex > < / a > < / div > < / div >
2020-09-01 16:00:33 +02:00
< div class = "ttc" id = "acp__model_8pb_8h_html" > < div class = "ttname" > < a href = "cp__model_8pb_8h.html" > cp_model.pb.h< / a > < / div > < / div >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "agscip__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 = "agscip__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 = "anamespaceoperations__research_1_1sat_html_a07c4372fa55782d13edd24b86130e3ba" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a07c4372fa55782d13edd24b86130e3ba" > operations_research::sat::AddObjectiveConstraint< / a > < / div > < div class = "ttdeci" > bool AddObjectiveConstraint(const LinearBooleanProblem & problem, bool use_lower_bound, Coefficient lower_bound, bool use_upper_bound, Coefficient upper_bound, SatSolver *solver)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "boolean__problem_8cc_source.html#l00338" > boolean_problem.cc:338< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "anamespaceoperations__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 & 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 >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "anamespaceoperations__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 & 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 = "anamespaceoperations__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 & 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 = "anamespaceoperations__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 & problem, const std::vector< int > & 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 = "anamespaceoperations__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 & 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 = "anamespaceoperations__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 & 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 = "anamespaceoperations__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 & problem, std::vector< std::unique_ptr< SparsePermutation > > *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 = "anamespaceoperations__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 = "anamespaceoperations__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< LiteralIndex, LiteralIndex > & 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 = "anamespaceoperations__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 & problem, const std::vector< bool > & 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 = "anamespaceoperations__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 = "anamespaceoperations__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 = "anamespaceoperations__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 & problem, const std::vector< bool > & 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 = "anamespaceoperations__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 & 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 = "anamespaceoperations__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 = "anamespaceoperations__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 & 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 = "anamespaceoperations__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 & 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 = "anamespaceoperations__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 & problem, const SatSolver & solver, std::vector< bool > *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 = "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 >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "apb__constraint_8h_html" > < div class = "ttname" > < a href = "pb__constraint_8h.html" > pb_constraint.h< / a > < / div > < / div >
< div class = "ttc" id = "asat__base_8h_html" > < div class = "ttname" > < a href = "sat__base_8h.html" > sat_base.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 = "asimplification_8h_html" > < div class = "ttname" > < a href = "simplification_8h.html" > simplification.h< / a > < / div > < / div >
< div class = "ttc" id = "asparse__permutation_8h_html" > < div class = "ttname" > < a href = "sparse__permutation_8h.html" > sparse_permutation.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 > <!-- 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" >
2021-01-26 11:28:50 +01:00
< img class = "footer" src = "doxygen.png" alt = "doxygen" / > < / a > 1.9.1 < / li >
2020-09-01 16:00:33 +02:00
< / ul >
< / div >
< / body >
< / html >
