120 lines
22 KiB
HTML
120 lines
22 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.8.15"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: bop_solution.cc 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>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</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.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<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');
|
|
/* @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('bop__solution_8cc_source.html','');});
|
|
/* @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">bop_solution.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="bop__solution_8cc.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><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">#include "<a class="code" href="bop__solution_8h.html">ortools/bop/bop_solution.h</a>"</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <cstdint></span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="keyword">namespace </span>bop {</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> using ::operations_research::sat::LinearBooleanConstraint;</div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> using ::operations_research::sat::LinearBooleanProblem;</div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> using ::operations_research::sat::LinearObjective;</div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> </div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">//------------------------------------------------------------------------------</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">// BopSolution</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">//------------------------------------------------------------------------------</span></div><div class="line"><a name="l00028"></a><span class="lineno"><a class="line" href="classoperations__research_1_1bop_1_1_bop_solution.html#a38f5c428df44833d6a921458a0f8363a"> 28</a></span> <a class="code" href="classoperations__research_1_1bop_1_1_bop_solution.html#a38f5c428df44833d6a921458a0f8363a">BopSolution::BopSolution</a>(<span class="keyword">const</span> LinearBooleanProblem& problem,</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>)</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  : problem_(&problem),</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  name_(<a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>),</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  values_(problem.num_variables(), false),</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  recompute_cost_(true),</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  recompute_is_feasible_(true),</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  cost_(0),</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  is_feasible_(false) {</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="comment">// Try the lucky assignment, i.e. the optimal one if feasible.</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keyword">const</span> LinearObjective& objective = problem.objective();</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < objective.coefficients_size(); ++i) {</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keyword">const</span> VariableIndex <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>(objective.literals(i) - 1);</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  values_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = objective.coefficients(i) < 0;</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  }</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> int64_t BopSolution::ComputeCost()<span class="keyword"> const </span>{</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  recompute_cost_ = <span class="keyword">false</span>;</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  int64_t sum = 0;</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">const</span> LinearObjective& objective = problem_-><a class="code" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#a9fd8f81a798fd34a843b007c10e40d6b">objective</a>();</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> num_sparse_vars = objective.<a class="code" href="classoperations__research_1_1sat_1_1_linear_objective.html#a72d41feda9a93c11089d3d99d6270999">literals_size</a>();</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(num_sparse_vars, objective.coefficients_size());</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_sparse_vars; ++i) {</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(objective.literals(i), 0);</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keyword">const</span> VariableIndex <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>(abs(objective.literals(i)) - 1);</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">if</span> (values_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]) {</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  sum += objective.coefficients(i);</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>  }</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordflow">return</span> sum;</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> }</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="keywordtype">bool</span> BopSolution::ComputeIsFeasible()<span class="keyword"> const </span>{</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  recompute_is_feasible_ = <span class="keyword">false</span>;</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> LinearBooleanConstraint& constraint : problem_-><a class="code" href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#ad0c9bce45c918e9aa67b70f53519ca37">constraints</a>()) {</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  int64_t sum = 0;</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> num_sparse_vars = constraint.literals_size();</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(num_sparse_vars, constraint.coefficients_size());</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> </div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_sparse_vars; ++i) {</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="comment">// The solver doesn't support negative literals yet.</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(constraint.literals(i), 0);</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">const</span> VariableIndex <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>(abs(constraint.literals(i)) - 1);</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">if</span> (values_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]) {</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  sum += constraint.coefficients(i);</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</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> </div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">if</span> ((constraint.has_upper_bound() && sum > constraint.upper_bound()) ||</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  (constraint.has_lower_bound() && sum < constraint.lower_bound())) {</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  }</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  }</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> }</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> } <span class="comment">// namespace bop</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="classoperations__research_1_1sat_1_1_linear_boolean_problem_html_ad0c9bce45c918e9aa67b70f53519ca37"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_boolean_problem.html#ad0c9bce45c918e9aa67b70f53519ca37">operations_research::sat::LinearBooleanProblem::constraints</a></div><div class="ttdeci">const ::operations_research::sat::LinearBooleanConstraint & constraints(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01546">boolean_problem.pb.h:1546</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00707">base/logging.h:707</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_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 & 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="classoperations__research_1_1bop_1_1_bop_solution_html_a38f5c428df44833d6a921458a0f8363a"><div class="ttname"><a href="classoperations__research_1_1bop_1_1_bop_solution.html#a38f5c428df44833d6a921458a0f8363a">operations_research::bop::BopSolution::BopSolution</a></div><div class="ttdeci">BopSolution(const sat::LinearBooleanProblem &problem, const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="bop__solution_8cc_source.html#l00028">bop_solution.cc:28</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_objective_html_a72d41feda9a93c11089d3d99d6270999"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_objective.html#a72d41feda9a93c11089d3d99d6270999">operations_research::sat::LinearObjective::literals_size</a></div><div class="ttdeci">int literals_size() const</div><div class="ttdef"><b>Definition:</b> <a href="boolean__problem_8pb_8h_source.html#l01226">boolean_problem.pb.h:1226</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00702">base/logging.h:702</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="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="bop__solution_8h_html"><div class="ttname"><a href="bop__solution_8h.html">bop_solution.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_749f8352630e023f1ab8040461e5d795.html">bop</a></li><li class="navelem"><a class="el" href="bop__solution_8cc.html">bop_solution.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.8.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|