2020-09-02 09:42:51 +02:00
<!-- HTML header for doxygen 1.8.18 -->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
< html xmlns = "http://www.w3.org/1999/xhtml" >
< head >
< meta http-equiv = "Content-Type" content = "text/xhtml;charset=UTF-8" / >
< meta http-equiv = "X-UA-Compatible" content = "IE=9" / >
2021-01-26 11:28:50 +01:00
< meta name = "generator" content = "Doxygen 1.9.1" / >
2020-09-02 09:42:51 +02:00
< meta name = "viewport" content = "width=device-width, initial-scale=1" / >
< title > OR-Tools: optimization.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 >
< 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-01-26 11:28:50 +01:00
  < span id = "projectnumber" > 8.2< / span >
2020-09-02 09:42:51 +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-02 09:42:51 +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-02 09:42:51 +02:00
/* @license-end */
< / script >
< script type = "text/javascript" src = "menudata.js" > < / script >
< script type = "text/javascript" src = "menu.js" > < / script >
< script type = "text/javascript" >
/* @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('optimization_8cc_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" > optimization.cc< / div > < / div >
< / div > <!-- header -->
< div class = "contents" >
< a href = "optimization_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-2018 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 = "optimization_8h.html" > ortools/sat/optimization.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 < algorithm> < / span > < / div >
< div class = "line" > < a name = "l00017" > < / a > < span class = "lineno" > 17< / span >   < span class = "preprocessor" > #include < cstdio> < / span > < / div >
< div class = "line" > < a name = "l00018" > < / a > < span class = "lineno" > 18< / span >   < span class = "preprocessor" > #include < cstdlib> < / span > < / div >
< div class = "line" > < a name = "l00019" > < / a > < span class = "lineno" > 19< / span >   < span class = "preprocessor" > #include < deque> < / span > < / div >
< div class = "line" > < a name = "l00020" > < / a > < span class = "lineno" > 20< / span >   < span class = "preprocessor" > #include < limits> < / span > < / div >
< div class = "line" > < a name = "l00021" > < / a > < span class = "lineno" > 21< / span >   < span class = "preprocessor" > #include < map> < / span > < / div >
< div class = "line" > < a name = "l00022" > < / a > < span class = "lineno" > 22< / span >   < span class = "preprocessor" > #include < memory> < / span > < / div >
< div class = "line" > < a name = "l00023" > < / a > < span class = "lineno" > 23< / span >   < span class = "preprocessor" > #include < set> < / span > < / div >
< div class = "line" > < a name = "l00024" > < / a > < span class = "lineno" > 24< / span >   < span class = "preprocessor" > #include < string> < / span > < / div >
< div class = "line" > < a name = "l00025" > < / a > < span class = "lineno" > 25< / span >   < span class = "preprocessor" > #include < utility> < / span > < / div >
< div class = "line" > < a name = "l00026" > < / a > < span class = "lineno" > 26< / span >   < / div >
< div class = "line" > < a name = "l00027" > < / a > < span class = "lineno" > 27< / span >   < span class = "preprocessor" > #include " absl/random/random.h" < / span > < / div >
< div class = "line" > < a name = "l00028" > < / a > < span class = "lineno" > 28< / span >   < span class = "preprocessor" > #include " absl/strings/str_cat.h" < / span > < / div >
< div class = "line" > < a name = "l00029" > < / a > < span class = "lineno" > 29< / span >   < span class = "preprocessor" > #include " absl/strings/str_format.h" < / span > < / div >
< div class = "line" > < a name = "l00030" > < / a > < span class = "lineno" > 30< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "cleanup_8h.html" > ortools/base/cleanup.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00031" > < / a > < span class = "lineno" > 31< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "int__type_8h.html" > ortools/base/int_type.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00032" > < / a > < span class = "lineno" > 32< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "base_2logging_8h.html" > ortools/base/logging.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00033" > < / a > < span class = "lineno" > 33< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "macros_8h.html" > ortools/base/macros.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00034" > < / a > < span class = "lineno" > 34< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "map__util_8h.html" > ortools/base/map_util.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00035" > < / a > < span class = "lineno" > 35< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "stl__util_8h.html" > ortools/base/stl_util.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00036" > < / a > < span class = "lineno" > 36< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "timer_8h.html" > ortools/base/timer.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00037" > < / a > < span class = "lineno" > 37< / span >   < span class = "preprocessor" > #if !defined(__PORTABLE_PLATFORM__) & & defined(USE_SCIP)< / span > < / div >
< div class = "line" > < a name = "l00038" > < / a > < span class = "lineno" > 38< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "linear__solver_8h.html" > ortools/linear_solver/linear_solver.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00039" > < / a > < span class = "lineno" > 39< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "linear__solver_8pb_8h.html" > ortools/linear_solver/linear_solver.pb.h< / a > " < / span > < / div >
2021-01-26 11:28:50 +01:00
< div class = "line" > < a name = "l00040" > < / a > < span class = "lineno" > 40< / span >   < span class = "preprocessor" > #endif < / span > < span class = "comment" > // __PORTABLE_PLATFORM__< / span > < / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00041" > < / a > < span class = "lineno" > 41< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "random_8h.html" > ortools/base/random.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00042" > < / a > < span class = "lineno" > 42< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "port_2proto__utils_8h.html" > ortools/port/proto_utils.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00043" > < / a > < span class = "lineno" > 43< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "boolean__problem_8h.html" > ortools/sat/boolean_problem.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00044" > < / a > < span class = "lineno" > 44< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "encoding_8h.html" > ortools/sat/encoding.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00045" > < / a > < span class = "lineno" > 45< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "integer__expr_8h.html" > ortools/sat/integer_expr.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00046" > < / a > < span class = "lineno" > 46< / 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 = "l00047" > < / a > < span class = "lineno" > 47< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "sat__parameters_8pb_8h.html" > ortools/sat/sat_parameters.pb.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00048" > < / a > < span class = "lineno" > 48< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "sat_2util_8h.html" > ortools/sat/util.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00049" > < / a > < span class = "lineno" > 49< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "time__limit_8h.html" > ortools/util/time_limit.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00050" > < / a > < span class = "lineno" > 50< / span >   < / div >
< div class = "line" > < a name = "l00051" > < / a > < span class = "lineno" > 51< / span >   < span class = "keyword" > namespace < / span > < a class = "code" href = "namespaceoperations__research.html" > operations_research< / a > {< / div >
< div class = "line" > < a name = "l00052" > < / a > < span class = "lineno" > 52< / span >   < span class = "keyword" > namespace < / span > sat {< / div >
< div class = "line" > < a name = "l00053" > < / a > < span class = "lineno" > 53< / span >   < / div >
< div class = "line" > < a name = "l00054" > < / a > < span class = "lineno" > 54< / span >   < span class = "keyword" > namespace < / span > {< / div >
< div class = "line" > < a name = "l00055" > < / a > < span class = "lineno" > 55< / span >   < / div >
< div class = "line" > < a name = "l00056" > < / a > < span class = "lineno" > 56< / span >   < span class = "comment" > // Used to log messages to stdout or to the normal logging framework according< / span > < / div >
< div class = "line" > < a name = "l00057" > < / a > < span class = "lineno" > 57< / span >   < span class = "comment" > // to the given LogBehavior value.< / span > < / div >
< div class = "line" > < a name = "l00058" > < / a > < span class = "lineno" > 58< / span >   < span class = "keyword" > class < / span > Logger {< / div >
< div class = "line" > < a name = "l00059" > < / a > < span class = "lineno" > 59< / span >   < span class = "keyword" > public< / span > :< / div >
< div class = "line" > < a name = "l00060" > < / a > < span class = "lineno" > 60< / span >   < span class = "keyword" > explicit< / span > Logger(< a class = "code" href = "namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238" > LogBehavior< / a > v) : use_stdout_(v == < a class = "code" href = "namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238a6c3f20e225309c66fdb5481433e5bd2f" > STDOUT_LOG< / a > ) {}< / div >
< div class = "line" > < a name = "l00061" > < / a > < span class = "lineno" > 61< / span >   < span class = "keywordtype" > void< / span > Log(< span class = "keyword" > const< / span > std::string& < a class = "code" href = "trace_8cc.html#a36bd74109f547f7f8198faf5a12d2879" > message< / a > ) {< / div >
< div class = "line" > < a name = "l00062" > < / a > < span class = "lineno" > 62< / span >   < span class = "keywordflow" > if< / span > (use_stdout_) {< / div >
< div class = "line" > < a name = "l00063" > < / a > < span class = "lineno" > 63< / span >   absl::PrintF(< span class = "stringliteral" > " %s\n" < / span > , < a class = "code" href = "trace_8cc.html#a36bd74109f547f7f8198faf5a12d2879" > message< / a > );< / div >
< div class = "line" > < a name = "l00064" > < / a > < span class = "lineno" > 64< / span >   } < span class = "keywordflow" > else< / span > {< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00065" > < / a > < span class = "lineno" > 65< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9" > INFO< / a > ) < < < a class = "code" href = "trace_8cc.html#a36bd74109f547f7f8198faf5a12d2879" > message< / a > ;< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00066" > < / a > < span class = "lineno" > 66< / span >   }< / 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 >   < / div >
< div class = "line" > < a name = "l00069" > < / a > < span class = "lineno" > 69< / span >   < span class = "keyword" > private< / span > :< / div >
< div class = "line" > < a name = "l00070" > < / a > < span class = "lineno" > 70< / span >   < span class = "keywordtype" > bool< / span > use_stdout_;< / div >
< div class = "line" > < a name = "l00071" > < / a > < span class = "lineno" > 71< / span >   };< / div >
< div class = "line" > < a name = "l00072" > < / a > < span class = "lineno" > 72< / span >   < / div >
< div class = "line" > < a name = "l00073" > < / a > < span class = "lineno" > 73< / span >   < span class = "comment" > // Outputs the current objective value in the cnf output format.< / span > < / div >
< div class = "line" > < a name = "l00074" > < / a > < span class = "lineno" > 74< / span >   < span class = "comment" > // Note that this function scale the given objective.< / span > < / div >
< div class = "line" > < a name = "l00075" > < / a > < span class = "lineno" > 75< / span >   std::string CnfObjectiveLine(< span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00076" > < / a > < span class = "lineno" > 76< / span >   Coefficient objective) {< / div >
< div class = "line" > < a name = "l00077" > < / a > < span class = "lineno" > 77< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > double< / span > scaled_objective =< / div >
< div class = "line" > < a name = "l00078" > < / a > < span class = "lineno" > 78< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#a16bcd287bd18e3a940d997aafb9321a9" > AddOffsetAndScaleObjectiveValue< / a > (problem, objective);< / div >
< div class = "line" > < a name = "l00079" > < / a > < span class = "lineno" > 79< / span >   < span class = "keywordflow" > return< / span > absl::StrFormat(< span class = "stringliteral" > " o %d" < / span > , < span class = "keyword" > static_cast< < / span > < a class = "code" href = "integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a" > int64< / a > < span class = "keyword" > > < / span > (scaled_objective));< / 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 = "keyword" > struct < / span > LiteralWithCoreIndex {< / div >
< div class = "line" > < a name = "l00083" > < / a > < span class = "lineno" > 83< / span >   LiteralWithCoreIndex(Literal l, < span class = "keywordtype" > int< / span > i) : < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > (l), < a class = "code" href = "optimization_8cc.html#a829582ce81a6c838e6f9c73c78814cff" > core_index< / a > (i) {}< / div >
< div class = "line" > < a name = "l00084" > < / a > < span class = "lineno" > < a class = "line" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > 84< / a > < / span >   Literal < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > ;< / div >
< div class = "line" > < a name = "l00085" > < / a > < span class = "lineno" > < a class = "line" href = "optimization_8cc.html#a829582ce81a6c838e6f9c73c78814cff" > 85< / a > < / span >   < span class = "keywordtype" > int< / span > < a class = "code" href = "optimization_8cc.html#a829582ce81a6c838e6f9c73c78814cff" > core_index< / a > ;< / 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 >   < / div >
< div class = "line" > < a name = "l00088" > < / a > < span class = "lineno" > 88< / span >   < span class = "comment" > // Deletes the given indices from a vector. The given indices must be sorted in< / span > < / div >
< div class = "line" > < a name = "l00089" > < / a > < span class = "lineno" > 89< / span >   < span class = "comment" > // increasing order. The order of the non-deleted entries in the vector is< / span > < / div >
< div class = "line" > < a name = "l00090" > < / a > < span class = "lineno" > 90< / span >   < span class = "comment" > // preserved.< / span > < / div >
< div class = "line" > < a name = "l00091" > < / a > < span class = "lineno" > 91< / span >   < span class = "keyword" > template< / span > < < span class = "keyword" > typename< / span > Vector> < / div >
< div class = "line" > < a name = "l00092" > < / a > < span class = "lineno" > 92< / span >   < span class = "keywordtype" > void< / span > DeleteVectorIndices(< span class = "keyword" > const< / span > std::vector< int> & indices, Vector* v) {< / div >
< div class = "line" > < a name = "l00093" > < / a > < span class = "lineno" > 93< / span >   < span class = "keywordtype" > int< / span > new_size = 0;< / div >
< div class = "line" > < a name = "l00094" > < / a > < span class = "lineno" > 94< / span >   < span class = "keywordtype" > int< / span > indices_index = 0;< / div >
< div class = "line" > < a name = "l00095" > < / a > < span class = "lineno" > 95< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < v-> size(); ++i) {< / div >
< div class = "line" > < a name = "l00096" > < / a > < span class = "lineno" > 96< / span >   < span class = "keywordflow" > if< / span > (indices_index < indices.size() & & i == indices[indices_index]) {< / div >
< div class = "line" > < a name = "l00097" > < / a > < span class = "lineno" > 97< / span >   ++indices_index;< / div >
< div class = "line" > < a name = "l00098" > < / a > < span class = "lineno" > 98< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l00099" > < / a > < span class = "lineno" > 99< / span >   (*v)[new_size] = (*v)[i];< / div >
< div class = "line" > < a name = "l00100" > < / a > < span class = "lineno" > 100< / span >   ++new_size;< / div >
< div class = "line" > < a name = "l00101" > < / a > < span class = "lineno" > 101< / span >   }< / div >
< div class = "line" > < a name = "l00102" > < / a > < span class = "lineno" > 102< / span >   }< / div >
< div class = "line" > < a name = "l00103" > < / a > < span class = "lineno" > 103< / span >   v-> resize(new_size);< / div >
< div class = "line" > < a name = "l00104" > < / a > < span class = "lineno" > 104< / span >   }< / div >
< div class = "line" > < a name = "l00105" > < / a > < span class = "lineno" > 105< / span >   < / div >
< div class = "line" > < a name = "l00106" > < / a > < span class = "lineno" > 106< / span >   < span class = "comment" > // In the Fu & Malik algorithm (or in WPM1), when two cores overlap, we< / span > < / div >
< div class = "line" > < a name = "l00107" > < / a > < span class = "lineno" > 107< / span >   < span class = "comment" > // artifically introduce symmetries. More precisely:< / span > < / div >
< div class = "line" > < a name = "l00108" > < / a > < span class = "lineno" > 108< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00109" > < / a > < span class = "lineno" > 109< / span >   < span class = "comment" > // The picture below shows two cores with index 0 and 1, with one blocking< / span > < / div >
< div class = "line" > < a name = "l00110" > < / a > < span class = "lineno" > 110< / span >   < span class = "comment" > // variable per ' -' and with the variables ordered from left to right (by their< / span > < / div >
< div class = "line" > < a name = "l00111" > < / a > < span class = "lineno" > 111< / span >   < span class = "comment" > // assumptions index). The blocking variables will be the one added to " relax" < / span > < / div >
< div class = "line" > < a name = "l00112" > < / a > < span class = "lineno" > 112< / span >   < span class = "comment" > // the core for the next iteration.< / span > < / div >
< div class = "line" > < a name = "l00113" > < / a > < span class = "lineno" > 113< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00114" > < / a > < span class = "lineno" > 114< / span >   < span class = "comment" > // 1: -------------------------------< / span > < / div >
< div class = "line" > < a name = "l00115" > < / a > < span class = "lineno" > 115< / span >   < span class = "comment" > // 0: ------------------------------------< / span > < / div >
< div class = "line" > < a name = "l00116" > < / a > < span class = "lineno" > 116< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00117" > < / a > < span class = "lineno" > 117< / span >   < span class = "comment" > // The 2 following assignment of the blocking variables are equivalent.< / span > < / div >
< div class = "line" > < a name = "l00118" > < / a > < span class = "lineno" > 118< / span >   < span class = "comment" > // Remember that exactly one blocking variable per core must be assigned to 1.< / span > < / div >
< div class = "line" > < a name = "l00119" > < / a > < span class = "lineno" > 119< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00120" > < / a > < span class = "lineno" > 120< / span >   < span class = "comment" > // 1: ----------------------1--------< / span > < / div >
< div class = "line" > < a name = "l00121" > < / a > < span class = "lineno" > 121< / span >   < span class = "comment" > // 0: --------1---------------------------< / span > < / div >
< div class = "line" > < a name = "l00122" > < / a > < span class = "lineno" > 122< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00123" > < / a > < span class = "lineno" > 123< / span >   < span class = "comment" > // and< / span > < / div >
< div class = "line" > < a name = "l00124" > < / a > < span class = "lineno" > 124< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00125" > < / a > < span class = "lineno" > 125< / span >   < span class = "comment" > // 1: ---------------------------1---< / span > < / div >
< div class = "line" > < a name = "l00126" > < / a > < span class = "lineno" > 126< / span >   < span class = "comment" > // 0: ---1--------------------------------< / 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" > // This class allows to add binary constraints excluding the second possibility.< / span > < / div >
< div class = "line" > < a name = "l00129" > < / a > < span class = "lineno" > 129< / span >   < span class = "comment" > // Basically, each time a new core is added, if two of its blocking variables< / span > < / div >
< div class = "line" > < a name = "l00130" > < / a > < span class = "lineno" > 130< / span >   < span class = "comment" > // (b1, b2) have the same assumption index of two blocking variables from< / span > < / div >
< div class = "line" > < a name = "l00131" > < / a > < span class = "lineno" > 131< / span >   < span class = "comment" > // another core (c1, c2), then we forbid the assignment c1 true and b2 true.< / span > < / div >
< div class = "line" > < a name = "l00132" > < / a > < span class = "lineno" > 132< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00133" > < / a > < span class = "lineno" > 133< / span >   < span class = "comment" > // Reference: C Ansótegui, ML Bonet, J Levy, " Sat-based maxsat algorithms" ,< / span > < / div >
< div class = "line" > < a name = "l00134" > < / a > < span class = "lineno" > 134< / span >   < span class = "comment" > // Artificial Intelligence, 2013 - Elsevier.< / span > < / div >
< div class = "line" > < a name = "l00135" > < / a > < span class = "lineno" > 135< / span >   < span class = "keyword" > class < / span > FuMalikSymmetryBreaker {< / div >
< div class = "line" > < a name = "l00136" > < / a > < span class = "lineno" > 136< / span >   < span class = "keyword" > public< / span > :< / div >
< div class = "line" > < a name = "l00137" > < / a > < span class = "lineno" > 137< / span >   FuMalikSymmetryBreaker() {}< / div >
< div class = "line" > < a name = "l00138" > < / a > < span class = "lineno" > 138< / span >   < / div >
< div class = "line" > < a name = "l00139" > < / a > < span class = "lineno" > 139< / span >   < span class = "comment" > // Must be called before a new core is processed.< / span > < / div >
< div class = "line" > < a name = "l00140" > < / a > < span class = "lineno" > 140< / span >   < span class = "keywordtype" > void< / span > StartResolvingNewCore(< span class = "keywordtype" > int< / span > new_core_index) {< / div >
< div class = "line" > < a name = "l00141" > < / a > < span class = "lineno" > 141< / span >   literal_by_core_.resize(new_core_index);< / div >
< div class = "line" > < a name = "l00142" > < / a > < span class = "lineno" > 142< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < new_core_index; ++i) {< / div >
< div class = "line" > < a name = "l00143" > < / a > < span class = "lineno" > 143< / span >   literal_by_core_[i].clear();< / div >
< div class = "line" > < a name = "l00144" > < / a > < span class = "lineno" > 144< / span >   }< / div >
< div class = "line" > < a name = "l00145" > < / a > < span class = "lineno" > 145< / span >   }< / div >
< div class = "line" > < a name = "l00146" > < / a > < span class = "lineno" > 146< / span >   < / div >
< div class = "line" > < a name = "l00147" > < / a > < span class = "lineno" > 147< / span >   < span class = "comment" > // This should be called for each blocking literal b of the new core. The< / span > < / div >
< div class = "line" > < a name = "l00148" > < / a > < span class = "lineno" > 148< / span >   < span class = "comment" > // assumption_index identify the soft clause associated to the given blocking< / span > < / div >
< div class = "line" > < a name = "l00149" > < / a > < span class = "lineno" > 149< / span >   < span class = "comment" > // literal. Note that between two StartResolvingNewCore() calls,< / span > < / div >
< div class = "line" > < a name = "l00150" > < / a > < span class = "lineno" > 150< / span >   < span class = "comment" > // ProcessLiteral() is assumed to be called with different assumption_index.< / span > < / div >
< div class = "line" > < a name = "l00151" > < / a > < span class = "lineno" > 151< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00152" > < / a > < span class = "lineno" > 152< / span >   < span class = "comment" > // Changing the order of the calls will not change the correctness, but will< / span > < / div >
< div class = "line" > < a name = "l00153" > < / a > < span class = "lineno" > 153< / span >   < span class = "comment" > // change the symmetry-breaking clause produced.< / span > < / div >
< div class = "line" > < a name = "l00154" > < / a > < span class = "lineno" > 154< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00155" > < / a > < span class = "lineno" > 155< / span >   < span class = "comment" > // Returns a set of literals which can' t be true at the same time as b (under< / span > < / div >
< div class = "line" > < a name = "l00156" > < / a > < span class = "lineno" > 156< / span >   < span class = "comment" > // symmetry breaking).< / span > < / div >
< div class = "line" > < a name = "l00157" > < / a > < span class = "lineno" > 157< / span >   std::vector< Literal> ProcessLiteral(< span class = "keywordtype" > int< / span > assumption_index, Literal < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > ) {< / div >
< div class = "line" > < a name = "l00158" > < / a > < span class = "lineno" > 158< / span >   < span class = "keywordflow" > if< / span > (assumption_index > = info_by_assumption_index_.size()) {< / div >
< div class = "line" > < a name = "l00159" > < / a > < span class = "lineno" > 159< / span >   info_by_assumption_index_.resize(assumption_index + 1);< / div >
< div class = "line" > < a name = "l00160" > < / a > < span class = "lineno" > 160< / span >   }< / div >
< div class = "line" > < a name = "l00161" > < / a > < span class = "lineno" > 161< / span >   < / div >
< div class = "line" > < a name = "l00162" > < / a > < span class = "lineno" > 162< / span >   < span class = "comment" > // Compute the function result.< / span > < / div >
< div class = "line" > < a name = "l00163" > < / a > < span class = "lineno" > 163< / span >   < span class = "comment" > // info_by_assumption_index_[assumption_index] will contain all the pairs< / span > < / div >
< div class = "line" > < a name = "l00164" > < / a > < span class = "lineno" > 164< / span >   < span class = "comment" > // (blocking_literal, core) of the previous resolved cores at the same< / span > < / div >
< div class = "line" > < a name = "l00165" > < / a > < span class = "lineno" > 165< / span >   < span class = "comment" > // assumption index as b.< / span > < / div >
< div class = "line" > < a name = "l00166" > < / a > < span class = "lineno" > 166< / span >   std::vector< Literal> result;< / div >
< div class = "line" > < a name = "l00167" > < / a > < span class = "lineno" > 167< / span >   < span class = "keywordflow" > for< / span > (LiteralWithCoreIndex data :< / div >
< div class = "line" > < a name = "l00168" > < / a > < span class = "lineno" > 168< / span >   info_by_assumption_index_[assumption_index]) {< / div >
< div class = "line" > < a name = "l00169" > < / a > < span class = "lineno" > 169< / span >   < span class = "comment" > // literal_by_core_ will contain all the blocking literal of a given core< / span > < / div >
< div class = "line" > < a name = "l00170" > < / a > < span class = "lineno" > 170< / span >   < span class = "comment" > // with an assumption_index that was used in one of the ProcessLiteral()< / span > < / div >
< div class = "line" > < a name = "l00171" > < / a > < span class = "lineno" > 171< / span >   < span class = "comment" > // calls since the last StartResolvingNewCore().< / span > < / div >
< div class = "line" > < a name = "l00172" > < / a > < span class = "lineno" > 172< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00173" > < / a > < span class = "lineno" > 173< / span >   < span class = "comment" > // Note that there can be only one such literal by core, so we will not< / span > < / div >
< div class = "line" > < a name = "l00174" > < / a > < span class = "lineno" > 174< / span >   < span class = "comment" > // add duplicates.< / span > < / div >
< div class = "line" > < a name = "l00175" > < / a > < span class = "lineno" > 175< / span >   result.insert(result.end(), literal_by_core_[data.core_index].begin(),< / div >
< div class = "line" > < a name = "l00176" > < / a > < span class = "lineno" > 176< / span >   literal_by_core_[data.core_index].end());< / div >
< div class = "line" > < a name = "l00177" > < / a > < span class = "lineno" > 177< / span >   }< / div >
< div class = "line" > < a name = "l00178" > < / a > < span class = "lineno" > 178< / span >   < / div >
< div class = "line" > < a name = "l00179" > < / a > < span class = "lineno" > 179< / span >   < span class = "comment" > // Update the internal data structure.< / span > < / div >
< div class = "line" > < a name = "l00180" > < / a > < span class = "lineno" > 180< / span >   < span class = "keywordflow" > for< / span > (LiteralWithCoreIndex data :< / div >
< div class = "line" > < a name = "l00181" > < / a > < span class = "lineno" > 181< / span >   info_by_assumption_index_[assumption_index]) {< / div >
< div class = "line" > < a name = "l00182" > < / a > < span class = "lineno" > 182< / span >   literal_by_core_[data.core_index].push_back(data.literal);< / div >
< div class = "line" > < a name = "l00183" > < / a > < span class = "lineno" > 183< / span >   }< / div >
< div class = "line" > < a name = "l00184" > < / a > < span class = "lineno" > 184< / span >   info_by_assumption_index_[assumption_index].push_back(< / div >
< div class = "line" > < a name = "l00185" > < / a > < span class = "lineno" > 185< / span >   LiteralWithCoreIndex(< a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > , literal_by_core_.size()));< / div >
< div class = "line" > < a name = "l00186" > < / a > < span class = "lineno" > 186< / span >   < span class = "keywordflow" > return< / span > result;< / div >
< div class = "line" > < a name = "l00187" > < / a > < span class = "lineno" > 187< / span >   }< / div >
< div class = "line" > < a name = "l00188" > < / a > < span class = "lineno" > 188< / span >   < / div >
< div class = "line" > < a name = "l00189" > < / a > < span class = "lineno" > 189< / span >   < span class = "comment" > // Deletes the given assumption indices.< / span > < / div >
< div class = "line" > < a name = "l00190" > < / a > < span class = "lineno" > 190< / span >   < span class = "keywordtype" > void< / span > DeleteIndices(< span class = "keyword" > const< / span > std::vector< int> & indices) {< / div >
< div class = "line" > < a name = "l00191" > < / a > < span class = "lineno" > 191< / span >   DeleteVectorIndices(indices, & info_by_assumption_index_);< / div >
< div class = "line" > < a name = "l00192" > < / a > < span class = "lineno" > 192< / span >   }< / div >
< div class = "line" > < a name = "l00193" > < / a > < span class = "lineno" > 193< / span >   < / div >
< div class = "line" > < a name = "l00194" > < / a > < span class = "lineno" > 194< / span >   < span class = "comment" > // This is only used in WPM1 to forget all the information related to a given< / span > < / div >
< div class = "line" > < a name = "l00195" > < / a > < span class = "lineno" > 195< / span >   < span class = "comment" > // assumption_index.< / span > < / div >
< div class = "line" > < a name = "l00196" > < / a > < span class = "lineno" > 196< / span >   < span class = "keywordtype" > void< / span > ClearInfo(< span class = "keywordtype" > int< / span > assumption_index) {< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00197" > < / a > < span class = "lineno" > 197< / span >   < a class = "code" href = "base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c" > CHECK_LE< / a > (assumption_index, info_by_assumption_index_.size());< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00198" > < / a > < span class = "lineno" > 198< / span >   info_by_assumption_index_[assumption_index].clear();< / div >
< div class = "line" > < a name = "l00199" > < / a > < span class = "lineno" > 199< / span >   }< / div >
< div class = "line" > < a name = "l00200" > < / a > < span class = "lineno" > 200< / span >   < / div >
< div class = "line" > < a name = "l00201" > < / a > < span class = "lineno" > 201< / span >   < span class = "comment" > // This is only used in WPM1 when a new assumption_index is created.< / span > < / div >
< div class = "line" > < a name = "l00202" > < / a > < span class = "lineno" > 202< / span >   < span class = "keywordtype" > void< / span > AddInfo(< span class = "keywordtype" > int< / span > assumption_index, Literal < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > ) {< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00203" > < / a > < span class = "lineno" > 203< / span >   < a class = "code" href = "base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9" > CHECK_GE< / a > (assumption_index, info_by_assumption_index_.size());< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00204" > < / a > < span class = "lineno" > 204< / span >   info_by_assumption_index_.resize(assumption_index + 1);< / div >
< div class = "line" > < a name = "l00205" > < / a > < span class = "lineno" > 205< / span >   info_by_assumption_index_[assumption_index].push_back(< / div >
< div class = "line" > < a name = "l00206" > < / a > < span class = "lineno" > 206< / span >   LiteralWithCoreIndex(< a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > , literal_by_core_.size()));< / div >
< div class = "line" > < a name = "l00207" > < / a > < span class = "lineno" > 207< / span >   }< / div >
< div class = "line" > < a name = "l00208" > < / a > < span class = "lineno" > 208< / span >   < / div >
< div class = "line" > < a name = "l00209" > < / a > < span class = "lineno" > 209< / span >   < span class = "keyword" > private< / span > :< / div >
< div class = "line" > < a name = "l00210" > < / a > < span class = "lineno" > 210< / span >   std::vector< std::vector< LiteralWithCoreIndex> > info_by_assumption_index_;< / div >
< div class = "line" > < a name = "l00211" > < / a > < span class = "lineno" > 211< / span >   std::vector< std::vector< Literal> > literal_by_core_;< / div >
< div class = "line" > < a name = "l00212" > < / a > < span class = "lineno" > 212< / span >   < / div >
< div class = "line" > < a name = "l00213" > < / a > < span class = "lineno" > 213< / span >   < a class = "code" href = "macros_8h.html#af8df3547bfde53a5acb93e2607b0034a" > DISALLOW_COPY_AND_ASSIGN< / a > (FuMalikSymmetryBreaker);< / div >
< div class = "line" > < a name = "l00214" > < / a > < span class = "lineno" > 214< / span >   };< / div >
< div class = "line" > < a name = "l00215" > < / a > < span class = "lineno" > 215< / span >   < / div >
< div class = "line" > < a name = "l00216" > < / a > < span class = "lineno" > 216< / span >   } < span class = "comment" > // namespace< / span > < / div >
< div class = "line" > < a name = "l00217" > < / a > < span class = "lineno" > 217< / span >   < / div >
2021-02-26 14:48:18 +01:00
< div class = "line" > < a name = "l00218" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#ab76a35e6ff810ad9ea8b58c7c11606cb" > 218< / a > < / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#ab76a35e6ff810ad9ea8b58c7c11606cb" > MinimizeCoreWithPropagation< / a > (< a class = "code" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > * limit, < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > * solver,< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00219" > < / a > < span class = "lineno" > 219< / span >   std::vector< Literal> * core) {< / div >
< div class = "line" > < a name = "l00220" > < / a > < span class = "lineno" > 220< / span >   < span class = "keywordflow" > if< / span > (solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab" > IsModelUnsat< / a > ()) < span class = "keywordflow" > return< / span > ;< / div >
< div class = "line" > < a name = "l00221" > < / a > < span class = "lineno" > 221< / span >   std::set< LiteralIndex> moved_last;< / div >
< div class = "line" > < a name = "l00222" > < / a > < span class = "lineno" > 222< / span >   std::vector< Literal> candidate(core-> begin(), core-> end());< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00223" > < / a > < span class = "lineno" > 223< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00224" > < / a > < span class = "lineno" > 224< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
< div class = "line" > < a name = "l00225" > < / a > < span class = "lineno" > 225< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440" > SetAssumptionLevel< / a > (0);< / div >
2021-02-26 14:48:18 +01:00
< div class = "line" > < a name = "l00226" > < / a > < span class = "lineno" > 226< / span >   < span class = "keywordflow" > while< / span > (!limit-> < a class = "code" href = "classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca" > LimitReached< / a > ()) {< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00227" > < / a > < span class = "lineno" > 227< / span >   < span class = "comment" > // We want each literal in candidate to appear last once in our propagation< / span > < / div >
< div class = "line" > < a name = "l00228" > < / a > < span class = "lineno" > 228< / span >   < span class = "comment" > // order. We want to do that while maximizing the reutilization of the< / span > < / div >
< div class = "line" > < a name = "l00229" > < / a > < span class = "lineno" > 229< / span >   < span class = "comment" > // current assignment prefix, that is minimizing the number of< / span > < / div >
< div class = "line" > < a name = "l00230" > < / a > < span class = "lineno" > 230< / span >   < span class = "comment" > // decision/progagation we need to perform.< / span > < / div >
< div class = "line" > < a name = "l00231" > < / a > < span class = "lineno" > 231< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > target_level = < a class = "code" href = "namespaceoperations__research_1_1sat.html#a2ef3eb1f5fe6506a5e24115f10d724fc" > MoveOneUnprocessedLiteralLast< / a > (< / div >
< div class = "line" > < a name = "l00232" > < / a > < span class = "lineno" > 232< / span >   moved_last, solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca" > CurrentDecisionLevel< / a > (), & candidate);< / div >
< div class = "line" > < a name = "l00233" > < / a > < span class = "lineno" > 233< / span >   < span class = "keywordflow" > if< / span > (target_level == -1) < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a name = "l00234" > < / a > < span class = "lineno" > 234< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (target_level);< / div >
2021-02-26 14:48:18 +01:00
< div class = "line" > < a name = "l00235" > < / a > < span class = "lineno" > 235< / span >   < span class = "keywordflow" > while< / span > (!solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab" > IsModelUnsat< / a > () & & !limit-> < a class = "code" href = "classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca" > LimitReached< / a > () & & < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00236" > < / a > < span class = "lineno" > 236< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca" > CurrentDecisionLevel< / a > () < candidate.size()) {< / div >
< div class = "line" > < a name = "l00237" > < / a > < span class = "lineno" > 237< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > decision = candidate[solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca" > CurrentDecisionLevel< / a > ()];< / div >
< div class = "line" > < a name = "l00238" > < / a > < span class = "lineno" > 238< / span >   < span class = "keywordflow" > if< / span > (solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8" > Assignment< / a > ().< a class = "code" href = "classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e" > LiteralIsTrue< / a > (decision)) {< / div >
< div class = "line" > < a name = "l00239" > < / a > < span class = "lineno" > 239< / span >   candidate.erase(candidate.begin() + solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca" > CurrentDecisionLevel< / a > ());< / div >
< div class = "line" > < a name = "l00240" > < / a > < span class = "lineno" > 240< / span >   < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l00241" > < / a > < span class = "lineno" > 241< / span >   } < span class = "keywordflow" > else< / span > < span class = "keywordflow" > if< / span > (solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8" > Assignment< / a > ().< a class = "code" href = "classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5" > LiteralIsFalse< / a > (decision)) {< / div >
< div class = "line" > < a name = "l00242" > < / a > < span class = "lineno" > 242< / span >   < span class = "comment" > // This is a " weird" API to get the subset of decisions that caused< / span > < / div >
< div class = "line" > < a name = "l00243" > < / a > < span class = "lineno" > 243< / span >   < span class = "comment" > // this literal to be false with reason analysis.< / span > < / div >
< div class = "line" > < a name = "l00244" > < / a > < span class = "lineno" > 244< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ab63a08713131e63e9cc4109f98ecf859" > EnqueueDecisionAndBacktrackOnConflict< / a > (decision);< / div >
< div class = "line" > < a name = "l00245" > < / a > < span class = "lineno" > 245< / span >   candidate = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#acfbfa9df611cb625ff79785c05784580" > GetLastIncompatibleDecisions< / a > ();< / div >
< div class = "line" > < a name = "l00246" > < / a > < span class = "lineno" > 246< / span >   < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a name = "l00247" > < / a > < span class = "lineno" > 247< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l00248" > < / a > < span class = "lineno" > 248< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9ae69b015a43c1a94e8815ab0dd8189c" > EnqueueDecisionAndBackjumpOnConflict< / a > (decision);< / div >
< div class = "line" > < a name = "l00249" > < / a > < span class = "lineno" > 249< / span >   }< / div >
< div class = "line" > < a name = "l00250" > < / a > < span class = "lineno" > 250< / span >   }< / div >
< div class = "line" > < a name = "l00251" > < / a > < span class = "lineno" > 251< / span >   < span class = "keywordflow" > if< / span > (candidate.empty() || solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab" > IsModelUnsat< / a > ()) < span class = "keywordflow" > return< / span > ;< / div >
< div class = "line" > < a name = "l00252" > < / a > < span class = "lineno" > 252< / span >   moved_last.insert(candidate.back().Index());< / div >
< div class = "line" > < a name = "l00253" > < / a > < span class = "lineno" > 253< / span >   }< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00254" > < / a > < span class = "lineno" > 254< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00255" > < / a > < span class = "lineno" > 255< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
< div class = "line" > < a name = "l00256" > < / a > < span class = "lineno" > 256< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440" > SetAssumptionLevel< / a > (0);< / div >
< div class = "line" > < a name = "l00257" > < / a > < span class = "lineno" > 257< / span >   < span class = "keywordflow" > if< / span > (candidate.size() < core-> size()) {< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00258" > < / a > < span class = "lineno" > 258< / span >   < a class = "code" href = "base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927" > VLOG< / a > (1) < < < span class = "stringliteral" > " minimization " < / span > < < core-> size() < < < span class = "stringliteral" > " -> " < / span > < < candidate.size();< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00259" > < / a > < span class = "lineno" > 259< / span >   core-> assign(candidate.begin(), candidate.end());< / div >
< div class = "line" > < a name = "l00260" > < / a > < span class = "lineno" > 260< / span >   }< / div >
< div class = "line" > < a name = "l00261" > < / a > < span class = "lineno" > 261< / span >   }< / div >
< div class = "line" > < a name = "l00262" > < / a > < span class = "lineno" > 262< / span >   < / div >
< div class = "line" > < a name = "l00263" > < / a > < span class = "lineno" > 263< / span >   < span class = "comment" > // This algorithm works by exploiting the unsat core returned by the SAT solver< / span > < / div >
< div class = "line" > < a name = "l00264" > < / a > < span class = "lineno" > 264< / span >   < span class = "comment" > // when the problem is UNSAT. It starts by trying to solve the decision problem< / span > < / div >
< div class = "line" > < a name = "l00265" > < / a > < span class = "lineno" > 265< / span >   < span class = "comment" > // where all the objective variables are set to their value with minimal cost,< / span > < / div >
< div class = "line" > < a name = "l00266" > < / a > < span class = "lineno" > 266< / span >   < span class = "comment" > // and relax in each step some of these fixed variables until the problem< / span > < / div >
< div class = "line" > < a name = "l00267" > < / a > < span class = "lineno" > 267< / span >   < span class = "comment" > // becomes satisfiable.< / span > < / div >
< div class = "line" > < a name = "l00268" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#ac8d4f52bbb23604c511dfeca406b1685" > 268< / a > < / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > < a class = "code" href = "namespaceoperations__research_1_1sat.html#ac8d4f52bbb23604c511dfeca406b1685" > SolveWithFuMalik< / a > (< a class = "code" href = "namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238" > LogBehavior< / a > log,< / div >
< div class = "line" > < a name = "l00269" > < / a > < span class = "lineno" > 269< / span >   < span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00270" > < / a > < span class = "lineno" > 270< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > * solver,< / div >
< div class = "line" > < a name = "l00271" > < / a > < span class = "lineno" > 271< / span >   std::vector< bool> * solution) {< / div >
< div class = "line" > < a name = "l00272" > < / a > < span class = "lineno" > 272< / span >   Logger logger(log);< / div >
< div class = "line" > < a name = "l00273" > < / a > < span class = "lineno" > 273< / span >   FuMalikSymmetryBreaker symmetry;< / div >
< div class = "line" > < a name = "l00274" > < / a > < span class = "lineno" > 274< / span >   < / div >
< div class = "line" > < a name = "l00275" > < / a > < span class = "lineno" > 275< / span >   < span class = "comment" > // blocking_clauses will contains a set of clauses that are currently added to< / span > < / div >
< div class = "line" > < a name = "l00276" > < / a > < span class = "lineno" > 276< / span >   < span class = "comment" > // the initial problem.< / span > < / div >
< div class = "line" > < a name = "l00277" > < / a > < span class = "lineno" > 277< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00278" > < / a > < span class = "lineno" > 278< / span >   < span class = "comment" > // Initially, each clause just contains a literal associated to an objective< / span > < / div >
< div class = "line" > < a name = "l00279" > < / a > < span class = "lineno" > 279< / span >   < span class = "comment" > // variable with non-zero cost. Setting all these literals to true will lead< / span > < / div >
< div class = "line" > < a name = "l00280" > < / a > < span class = "lineno" > 280< / span >   < span class = "comment" > // to the lowest possible objective.< / span > < / div >
< div class = "line" > < a name = "l00281" > < / a > < span class = "lineno" > 281< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00282" > < / a > < span class = "lineno" > 282< / span >   < span class = "comment" > // During the algorithm, " blocking" literals will be added to each clause.< / span > < / div >
< div class = "line" > < a name = "l00283" > < / a > < span class = "lineno" > 283< / span >   < span class = "comment" > // Moreover each clause will contain an extra " assumption" literal stored in< / span > < / div >
< div class = "line" > < a name = "l00284" > < / a > < span class = "lineno" > 284< / span >   < span class = "comment" > // the separate assumptions vector (in its negated form).< / span > < / div >
< div class = "line" > < a name = "l00285" > < / a > < span class = "lineno" > 285< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00286" > < / a > < span class = "lineno" > 286< / span >   < span class = "comment" > // The meaning of a given clause will always be:< / span > < / div >
< div class = "line" > < a name = "l00287" > < / a > < span class = "lineno" > 287< / span >   < span class = "comment" > // If the assumption literal and all blocking literals are false, then the< / span > < / div >
< div class = "line" > < a name = "l00288" > < / a > < span class = "lineno" > 288< / span >   < span class = "comment" > // " objective" literal (which is the first one in the clause) must be true.< / span > < / div >
< div class = "line" > < a name = "l00289" > < / a > < span class = "lineno" > 289< / span >   < span class = "comment" > // When the " objective" literal is true, its variable (which have a non-zero< / span > < / div >
< div class = "line" > < a name = "l00290" > < / a > < span class = "lineno" > 290< / span >   < span class = "comment" > // cost) is set to the value that minimize the objective cost.< / span > < / div >
< div class = "line" > < a name = "l00291" > < / a > < span class = "lineno" > 291< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00292" > < / a > < span class = "lineno" > 292< / span >   < span class = "comment" > // ex: If a variable " x" as a cost of 3, its cost contribution is smaller when< / span > < / div >
< div class = "line" > < a name = "l00293" > < / a > < span class = "lineno" > 293< / span >   < span class = "comment" > // it is set to false (since it will contribute to zero instead of 3).< / span > < / div >
< div class = "line" > < a name = "l00294" > < / a > < span class = "lineno" > 294< / span >   std::vector< std::vector< Literal> > blocking_clauses;< / div >
< div class = "line" > < a name = "l00295" > < / a > < span class = "lineno" > 295< / span >   std::vector< Literal> assumptions;< / div >
< div class = "line" > < a name = "l00296" > < / a > < span class = "lineno" > 296< / span >   < / div >
< div class = "line" > < a name = "l00297" > < / a > < span class = "lineno" > 297< / span >   < span class = "comment" > // Initialize blocking_clauses and assumptions.< / span > < / div >
< div class = "line" > < a name = "l00298" > < / a > < span class = "lineno" > 298< / span >   < span class = "keyword" > const< / span > LinearObjective& objective = problem.objective();< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00299" > < / a > < span class = "lineno" > 299< / span >   < a class = "code" href = "base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6" > CHECK_GT< / a > (objective.coefficients_size(), 0);< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00300" > < / a > < span class = "lineno" > 300< / span >   < span class = "keyword" > const< / span > Coefficient unique_objective_coeff(std::abs(objective.coefficients(0)));< / div >
< div class = "line" > < a name = "l00301" > < / a > < span class = "lineno" > 301< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < objective.literals_size(); ++i) {< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00302" > < / a > < span class = "lineno" > 302< / span >   < a class = "code" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (std::abs(objective.coefficients(i)), unique_objective_coeff)< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00303" > < / a > < span class = "lineno" > 303< / span >   < < < span class = "stringliteral" > " The basic Fu & Malik algorithm needs constant objective coeffs." < / span > ;< / div >
< div class = "line" > < a name = "l00304" > < / a > < span class = "lineno" > 304< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > (objective.literals(i));< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00305" > < / a > < span class = "lineno" > 305< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00306" > < / a > < span class = "lineno" > 306< / span >   < span class = "comment" > // We want to minimize the cost when this literal is true.< / span > < / div >
< div class = "line" > < a name = "l00307" > < / a > < span class = "lineno" > 307< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > min_literal =< / div >
< div class = "line" > < a name = "l00308" > < / a > < span class = "lineno" > 308< / span >   objective.coefficients(i) > 0 ? < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > .< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644" > Negated< / a > () : < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > ;< / div >
< div class = "line" > < a name = "l00309" > < / a > < span class = "lineno" > 309< / span >   blocking_clauses.push_back(std::vector< Literal> (1, min_literal));< / div >
< div class = "line" > < a name = "l00310" > < / a > < span class = "lineno" > 310< / span >   < / div >
< div class = "line" > < a name = "l00311" > < / a > < span class = "lineno" > 311< / span >   < span class = "comment" > // Note that initialy, we do not create any extra variables.< / span > < / div >
< div class = "line" > < a name = "l00312" > < / a > < span class = "lineno" > 312< / span >   assumptions.push_back(min_literal);< / div >
< div class = "line" > < a name = "l00313" > < / a > < span class = "lineno" > 313< / span >   }< / div >
< div class = "line" > < a name = "l00314" > < / a > < span class = "lineno" > 314< / span >   < / div >
< div class = "line" > < a name = "l00315" > < / a > < span class = "lineno" > 315< / span >   < span class = "comment" > // Print the number of variable with a non-zero cost.< / span > < / div >
< div class = "line" > < a name = "l00316" > < / a > < span class = "lineno" > 316< / span >   logger.Log(absl::StrFormat(< span class = "stringliteral" > " c #weights:%u #vars:%d #constraints:%d" < / span > ,< / div >
< div class = "line" > < a name = "l00317" > < / a > < span class = "lineno" > 317< / span >   assumptions.size(), problem.num_variables(),< / div >
< div class = "line" > < a name = "l00318" > < / a > < span class = "lineno" > 318< / span >   problem.constraints_size()));< / div >
< div class = "line" > < a name = "l00319" > < / a > < span class = "lineno" > 319< / span >   < / div >
< div class = "line" > < a name = "l00320" > < / a > < span class = "lineno" > 320< / span >   < span class = "comment" > // Starts the algorithm. Each loop will solve the problem under the given< / span > < / div >
< div class = "line" > < a name = "l00321" > < / a > < span class = "lineno" > 321< / span >   < span class = "comment" > // assumptions, and if unsat, will relax exactly one of the objective< / span > < / div >
< div class = "line" > < a name = "l00322" > < / a > < span class = "lineno" > 322< / span >   < span class = "comment" > // variables (from the unsat core) to be in its " costly" state. When the< / span > < / div >
< div class = "line" > < a name = "l00323" > < / a > < span class = "lineno" > 323< / span >   < span class = "comment" > // algorithm terminates, the number of iterations is exactly the minimal< / span > < / div >
< div class = "line" > < a name = "l00324" > < / a > < span class = "lineno" > 324< / span >   < span class = "comment" > // objective value.< / span > < / div >
< div class = "line" > < a name = "l00325" > < / a > < span class = "lineno" > 325< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > iter = 0;; ++iter) {< / div >
< div class = "line" > < a name = "l00326" > < / a > < span class = "lineno" > 326< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > result =< / div >
< div class = "line" > < a name = "l00327" > < / a > < span class = "lineno" > 327< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a2abca6db0c780a4482d1ac9eb6365057" > ResetAndSolveWithGivenAssumptions< / a > (assumptions);< / div >
< div class = "line" > < a name = "l00328" > < / a > < span class = "lineno" > 328< / span >   < span class = "keywordflow" > if< / span > (result == < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ) {< / div >
< div class = "line" > < a name = "l00329" > < / a > < span class = "lineno" > 329< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838" > ExtractAssignment< / a > (problem, *solver, solution);< / div >
< div class = "line" > < a name = "l00330" > < / a > < span class = "lineno" > 330< / span >   Coefficient objective = < a class = "code" href = "namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f" > ComputeObjectiveValue< / a > (problem, *solution);< / div >
< div class = "line" > < a name = "l00331" > < / a > < span class = "lineno" > 331< / span >   logger.Log(CnfObjectiveLine(problem, objective));< / div >
< div class = "line" > < a name = "l00332" > < / a > < span class = "lineno" > 332< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00333" > < / a > < span class = "lineno" > 333< / span >   }< / div >
< div class = "line" > < a name = "l00334" > < / a > < span class = "lineno" > 334< / span >   < span class = "keywordflow" > if< / span > (result != < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885" > SatSolver::ASSUMPTIONS_UNSAT< / a > ) < span class = "keywordflow" > return< / span > result;< / div >
< div class = "line" > < a name = "l00335" > < / a > < span class = "lineno" > 335< / span >   < / div >
< div class = "line" > < a name = "l00336" > < / a > < span class = "lineno" > 336< / span >   < span class = "comment" > // The interesting case: we have an unsat core.< / span > < / div >
< div class = "line" > < a name = "l00337" > < / a > < span class = "lineno" > 337< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00338" > < / a > < span class = "lineno" > 338< / span >   < span class = "comment" > // We need to add new " blocking" variables b_i for all the objective< / span > < / div >
< div class = "line" > < a name = "l00339" > < / a > < span class = "lineno" > 339< / span >   < span class = "comment" > // variable appearing in the core. Moreover, we will only relax as little< / span > < / div >
< div class = "line" > < a name = "l00340" > < / a > < span class = "lineno" > 340< / span >   < span class = "comment" > // as possible (to not miss the optimal), so we will enforce that the sum< / span > < / div >
< div class = "line" > < a name = "l00341" > < / a > < span class = "lineno" > 341< / span >   < span class = "comment" > // of the b_i is exactly one.< / span > < / div >
< div class = "line" > < a name = "l00342" > < / a > < span class = "lineno" > 342< / span >   std::vector< Literal> core = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#acfbfa9df611cb625ff79785c05784580" > GetLastIncompatibleDecisions< / a > ();< / div >
< div class = "line" > < a name = "l00343" > < / a > < span class = "lineno" > 343< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#a6fb8349259fa849de0789a4ec58a8492" > MinimizeCore< / a > (solver, & core);< / div >
< div class = "line" > < a name = "l00344" > < / a > < span class = "lineno" > 344< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00345" > < / a > < span class = "lineno" > 345< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00346" > < / a > < span class = "lineno" > 346< / span >   < span class = "comment" > // Print the search progress.< / span > < / div >
< div class = "line" > < a name = "l00347" > < / a > < span class = "lineno" > 347< / span >   logger.Log(absl::StrFormat(< span class = "stringliteral" > " c iter:%d core:%u" < / span > , iter, core.size()));< / div >
< div class = "line" > < a name = "l00348" > < / a > < span class = "lineno" > 348< / span >   < / div >
< div class = "line" > < a name = "l00349" > < / a > < span class = "lineno" > 349< / span >   < span class = "comment" > // Special case for a singleton core.< / span > < / div >
< div class = "line" > < a name = "l00350" > < / a > < span class = "lineno" > 350< / span >   < span class = "keywordflow" > if< / span > (core.size() == 1) {< / div >
< div class = "line" > < a name = "l00351" > < / a > < span class = "lineno" > 351< / span >   < span class = "comment" > // Find the index of the " objective" variable that need to be fixed in< / span > < / div >
< div class = "line" > < a name = "l00352" > < / a > < span class = "lineno" > 352< / span >   < span class = "comment" > // its " costly" state.< / span > < / div >
< div class = "line" > < a name = "l00353" > < / a > < span class = "lineno" > 353< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > =< / div >
< div class = "line" > < a name = "l00354" > < / a > < span class = "lineno" > 354< / span >   std::find(assumptions.begin(), assumptions.end(), core[0]) -< / div >
< div class = "line" > < a name = "l00355" > < / a > < span class = "lineno" > 355< / span >   assumptions.begin();< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00356" > < / a > < span class = "lineno" > 356< / span >   < a class = "code" href = "base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82" > CHECK_LT< / a > (< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > , assumptions.size());< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00357" > < / a > < span class = "lineno" > 357< / span >   < / div >
< div class = "line" > < a name = "l00358" > < / a > < span class = "lineno" > 358< / span >   < span class = "comment" > // Fix it. We also fix all the associated blocking variables if any.< / span > < / div >
< div class = "line" > < a name = "l00359" > < / a > < span class = "lineno" > 359< / span >   < span class = "keywordflow" > if< / span > (!solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9" > AddUnitClause< / a > (core[0].Negated())) {< / div >
< div class = "line" > < a name = "l00360" > < / a > < span class = "lineno" > 360< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00361" > < / a > < span class = "lineno" > 361< / span >   }< / div >
< div class = "line" > < a name = "l00362" > < / a > < span class = "lineno" > 362< / span >   < span class = "keywordflow" > for< / span > (< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > : blocking_clauses[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ]) {< / div >
< div class = "line" > < a name = "l00363" > < / a > < span class = "lineno" > 363< / span >   < span class = "keywordflow" > if< / span > (!solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9" > AddUnitClause< / a > (< a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > .Negated())) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00364" > < / a > < span class = "lineno" > 364< / span >   }< / div >
< div class = "line" > < a name = "l00365" > < / a > < span class = "lineno" > 365< / span >   < / div >
< div class = "line" > < a name = "l00366" > < / a > < span class = "lineno" > 366< / span >   < span class = "comment" > // Erase this entry from the current " objective" < / span > < / div >
< div class = "line" > < a name = "l00367" > < / a > < span class = "lineno" > 367< / span >   std::vector< int> to_delete(1, < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > );< / div >
< div class = "line" > < a name = "l00368" > < / a > < span class = "lineno" > 368< / span >   DeleteVectorIndices(to_delete, & assumptions);< / div >
< div class = "line" > < a name = "l00369" > < / a > < span class = "lineno" > 369< / span >   DeleteVectorIndices(to_delete, & blocking_clauses);< / div >
< div class = "line" > < a name = "l00370" > < / a > < span class = "lineno" > 370< / span >   symmetry.DeleteIndices(to_delete);< / div >
< div class = "line" > < a name = "l00371" > < / a > < span class = "lineno" > 371< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l00372" > < / a > < span class = "lineno" > 372< / span >   symmetry.StartResolvingNewCore(iter);< / div >
< div class = "line" > < a name = "l00373" > < / a > < span class = "lineno" > 373< / span >   < / div >
< div class = "line" > < a name = "l00374" > < / a > < span class = "lineno" > 374< / span >   < span class = "comment" > // We will add 2 * |core.size()| variables.< / span > < / div >
< div class = "line" > < a name = "l00375" > < / a > < span class = "lineno" > 375< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > old_num_variables = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2" > NumVariables< / a > ();< / div >
< div class = "line" > < a name = "l00376" > < / a > < span class = "lineno" > 376< / span >   < span class = "keywordflow" > if< / span > (core.size() == 2) {< / div >
< div class = "line" > < a name = "l00377" > < / a > < span class = "lineno" > 377< / span >   < span class = "comment" > // Special case. If core.size() == 2, we can use only one blocking< / span > < / div >
< div class = "line" > < a name = "l00378" > < / a > < span class = "lineno" > 378< / span >   < span class = "comment" > // variable (the other one beeing its negation). This actually do happen< / span > < / div >
< div class = "line" > < a name = "l00379" > < / a > < span class = "lineno" > 379< / span >   < span class = "comment" > // quite often in practice, so it is worth it.< / span > < / div >
< div class = "line" > < a name = "l00380" > < / a > < span class = "lineno" > 380< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb" > SetNumVariables< / a > (old_num_variables + 3);< / div >
< div class = "line" > < a name = "l00381" > < / a > < span class = "lineno" > 381< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l00382" > < / a > < span class = "lineno" > 382< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb" > SetNumVariables< / a > (old_num_variables + 2 * core.size());< / div >
< div class = "line" > < a name = "l00383" > < / a > < span class = "lineno" > 383< / span >   }< / div >
< div class = "line" > < a name = "l00384" > < / a > < span class = "lineno" > 384< / span >   < / div >
< div class = "line" > < a name = "l00385" > < / a > < span class = "lineno" > 385< / span >   < span class = "comment" > // Temporary vectors for the constraint (sum new blocking variable == 1).< / span > < / div >
< div class = "line" > < a name = "l00386" > < / a > < span class = "lineno" > 386< / span >   std::vector< LiteralWithCoeff> at_most_one_constraint;< / div >
< div class = "line" > < a name = "l00387" > < / a > < span class = "lineno" > 387< / span >   std::vector< Literal> at_least_one_constraint;< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00388" > < / a > < span class = "lineno" > 388< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00389" > < / a > < span class = "lineno" > 389< / span >   < span class = "comment" > // This will be set to false if the problem becomes unsat while adding a< / span > < / div >
< div class = "line" > < a name = "l00390" > < / a > < span class = "lineno" > 390< / span >   < span class = "comment" > // new clause. This is unlikely, but may be possible.< / span > < / div >
< div class = "line" > < a name = "l00391" > < / a > < span class = "lineno" > 391< / span >   < span class = "keywordtype" > bool< / span > ok = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l00392" > < / a > < span class = "lineno" > 392< / span >   < / div >
< div class = "line" > < a name = "l00393" > < / a > < span class = "lineno" > 393< / span >   < span class = "comment" > // Loop over the core.< / span > < / div >
< div class = "line" > < a name = "l00394" > < / a > < span class = "lineno" > 394< / span >   < span class = "keywordtype" > int< / span > < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > = 0;< / div >
< div class = "line" > < a name = "l00395" > < / a > < span class = "lineno" > 395< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < core.size(); ++i) {< / div >
< div class = "line" > < a name = "l00396" > < / a > < span class = "lineno" > 396< / span >   < span class = "comment" > // Since the assumptions appear in order in the core, we can find the< / span > < / div >
< div class = "line" > < a name = "l00397" > < / a > < span class = "lineno" > 397< / span >   < span class = "comment" > // relevant " objective" variable efficiently with a simple linear scan< / span > < / div >
< div class = "line" > < a name = "l00398" > < / a > < span class = "lineno" > 398< / span >   < span class = "comment" > // in the assumptions vector (done with index).< / span > < / div >
< div class = "line" > < a name = "l00399" > < / a > < span class = "lineno" > 399< / span >   < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > =< / div >
< div class = "line" > < a name = "l00400" > < / a > < span class = "lineno" > 400< / span >   std::find(assumptions.begin() + < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > , assumptions.end(), core[i]) -< / div >
< div class = "line" > < a name = "l00401" > < / a > < span class = "lineno" > 401< / span >   assumptions.begin();< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00402" > < / a > < span class = "lineno" > 402< / span >   < a class = "code" href = "base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82" > CHECK_LT< / a > (< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > , assumptions.size());< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00403" > < / a > < span class = "lineno" > 403< / span >   < / div >
< div class = "line" > < a name = "l00404" > < / a > < span class = "lineno" > 404< / span >   < span class = "comment" > // The new blocking and assumption variables for this core entry.< / span > < / div >
< div class = "line" > < a name = "l00405" > < / a > < span class = "lineno" > 405< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code" href = "constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2" > a< / a > (BooleanVariable(old_num_variables + i), < span class = "keyword" > true< / span > );< / div >
< div class = "line" > < a name = "l00406" > < / a > < span class = "lineno" > 406< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > (BooleanVariable(old_num_variables + core.size() + i), < span class = "keyword" > true< / span > );< / div >
< div class = "line" > < a name = "l00407" > < / a > < span class = "lineno" > 407< / span >   < span class = "keywordflow" > if< / span > (core.size() == 2) {< / div >
< div class = "line" > < a name = "l00408" > < / a > < span class = "lineno" > 408< / span >   < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > = < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > (BooleanVariable(old_num_variables + 2), < span class = "keyword" > true< / span > );< / div >
< div class = "line" > < a name = "l00409" > < / a > < span class = "lineno" > 409< / span >   < span class = "keywordflow" > if< / span > (i == 1) < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > = < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > .Negated();< / div >
< div class = "line" > < a name = "l00410" > < / a > < span class = "lineno" > 410< / span >   }< / div >
< div class = "line" > < a name = "l00411" > < / a > < span class = "lineno" > 411< / span >   < / div >
< div class = "line" > < a name = "l00412" > < / a > < span class = "lineno" > 412< / span >   < span class = "comment" > // Symmetry breaking clauses.< / span > < / div >
< div class = "line" > < a name = "l00413" > < / a > < span class = "lineno" > 413< / span >   < span class = "keywordflow" > for< / span > (< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > l : symmetry.ProcessLiteral(< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > , < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > )) {< / div >
< div class = "line" > < a name = "l00414" > < / a > < span class = "lineno" > 414< / span >   ok & = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094" > AddBinaryClause< / a > (l.Negated(), < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > .Negated());< / div >
< div class = "line" > < a name = "l00415" > < / a > < span class = "lineno" > 415< / span >   }< / div >
< div class = "line" > < a name = "l00416" > < / a > < span class = "lineno" > 416< / span >   < / div >
< div class = "line" > < a name = "l00417" > < / a > < span class = "lineno" > 417< / span >   < span class = "comment" > // Note(user): There is more than one way to encode the algorithm in< / span > < / div >
< div class = "line" > < a name = "l00418" > < / a > < span class = "lineno" > 418< / span >   < span class = "comment" > // SAT. Here we " delete" the old blocking clause and add a new one. In< / span > < / div >
< div class = "line" > < a name = "l00419" > < / a > < span class = "lineno" > 419< / span >   < span class = "comment" > // the WPM1 algorithm below, the blocking clause is decomposed into< / span > < / div >
< div class = "line" > < a name = "l00420" > < / a > < span class = "lineno" > 420< / span >   < span class = "comment" > // 3-SAT and we don' t need to delete anything.< / span > < / div >
< div class = "line" > < a name = "l00421" > < / a > < span class = "lineno" > 421< / span >   < / div >
< div class = "line" > < a name = "l00422" > < / a > < span class = "lineno" > 422< / span >   < span class = "comment" > // First, fix the old " assumption" variable to false, which has the< / span > < / div >
< div class = "line" > < a name = "l00423" > < / a > < span class = "lineno" > 423< / span >   < span class = "comment" > // effect of deleting the old clause from the solver.< / span > < / div >
< div class = "line" > < a name = "l00424" > < / a > < span class = "lineno" > 424< / span >   < span class = "keywordflow" > if< / span > (assumptions[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ].Variable() > = problem.num_variables()) {< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00425" > < / a > < span class = "lineno" > 425< / span >   < a class = "code" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9" > AddUnitClause< / a > (assumptions[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ].Negated()));< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00426" > < / a > < span class = "lineno" > 426< / span >   }< / div >
< div class = "line" > < a name = "l00427" > < / a > < span class = "lineno" > 427< / span >   < / div >
< div class = "line" > < a name = "l00428" > < / a > < span class = "lineno" > 428< / span >   < span class = "comment" > // Add the new blocking variable.< / span > < / div >
< div class = "line" > < a name = "l00429" > < / a > < span class = "lineno" > 429< / span >   blocking_clauses[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ].push_back(< a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > );< / div >
< div class = "line" > < a name = "l00430" > < / a > < span class = "lineno" > 430< / span >   < / div >
< div class = "line" > < a name = "l00431" > < / a > < span class = "lineno" > 431< / span >   < span class = "comment" > // Add the new clause to the solver. Temporary including the< / span > < / div >
< div class = "line" > < a name = "l00432" > < / a > < span class = "lineno" > 432< / span >   < span class = "comment" > // assumption, but removing it right afterwards.< / span > < / div >
< div class = "line" > < a name = "l00433" > < / a > < span class = "lineno" > 433< / span >   blocking_clauses[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ].push_back(< a class = "code" href = "constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2" > a< / a > );< / div >
< div class = "line" > < a name = "l00434" > < / a > < span class = "lineno" > 434< / span >   ok & = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#af67fe279478772a6d1492a7f673bda5d" > AddProblemClause< / a > (blocking_clauses[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ]);< / div >
< div class = "line" > < a name = "l00435" > < / a > < span class = "lineno" > 435< / span >   blocking_clauses[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ].pop_back();< / div >
< div class = "line" > < a name = "l00436" > < / a > < span class = "lineno" > 436< / span >   < / div >
< div class = "line" > < a name = "l00437" > < / a > < span class = "lineno" > 437< / span >   < span class = "comment" > // For the " == 1" constraint on the blocking literals.< / span > < / div >
< div class = "line" > < a name = "l00438" > < / a > < span class = "lineno" > 438< / span >   at_most_one_constraint.push_back(< a class = "code" href = "structoperations__research_1_1sat_1_1_literal_with_coeff.html" > LiteralWithCoeff< / a > (< a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > , 1.0));< / div >
< div class = "line" > < a name = "l00439" > < / a > < span class = "lineno" > 439< / span >   at_least_one_constraint.push_back(< a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > );< / div >
< div class = "line" > < a name = "l00440" > < / a > < span class = "lineno" > 440< / span >   < / div >
< div class = "line" > < a name = "l00441" > < / a > < span class = "lineno" > 441< / span >   < span class = "comment" > // The new assumption variable replace the old one.< / span > < / div >
< div class = "line" > < a name = "l00442" > < / a > < span class = "lineno" > 442< / span >   assumptions[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ] = < a class = "code" href = "constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2" > a< / a > .Negated();< / div >
< div class = "line" > < a name = "l00443" > < / a > < span class = "lineno" > 443< / span >   }< / div >
< div class = "line" > < a name = "l00444" > < / a > < span class = "lineno" > 444< / span >   < / div >
< div class = "line" > < a name = "l00445" > < / a > < span class = "lineno" > 445< / span >   < span class = "comment" > // Add the " < = 1" side of the " == 1" constraint.< / span > < / div >
< div class = "line" > < a name = "l00446" > < / a > < span class = "lineno" > 446< / span >   ok & = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653" > AddLinearConstraint< / a > (< span class = "keyword" > false< / span > , Coefficient(0), < span class = "keyword" > true< / span > ,< / div >
< div class = "line" > < a name = "l00447" > < / a > < span class = "lineno" > 447< / span >   Coefficient(1.0),< / div >
< div class = "line" > < a name = "l00448" > < / a > < span class = "lineno" > 448< / span >   & at_most_one_constraint);< / div >
< div class = "line" > < a name = "l00449" > < / a > < span class = "lineno" > 449< / span >   < / div >
< div class = "line" > < a name = "l00450" > < / a > < span class = "lineno" > 450< / span >   < span class = "comment" > // TODO(user): The algorithm does not really need the > = 1 side of this< / span > < / div >
< div class = "line" > < a name = "l00451" > < / a > < span class = "lineno" > 451< / span >   < span class = "comment" > // constraint. Initial investigation shows that it doesn' t really help,< / span > < / div >
< div class = "line" > < a name = "l00452" > < / a > < span class = "lineno" > 452< / span >   < span class = "comment" > // but investigate more.< / span > < / div >
< div class = "line" > < a name = "l00453" > < / a > < span class = "lineno" > 453< / span >   < span class = "keywordflow" > if< / span > (< span class = "comment" > /* DISABLES CODE */< / span > (< span class = "keyword" > false< / span > )) {< / div >
< div class = "line" > < a name = "l00454" > < / a > < span class = "lineno" > 454< / span >   ok & = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#af67fe279478772a6d1492a7f673bda5d" > AddProblemClause< / a > (at_least_one_constraint);< / div >
< div class = "line" > < a name = "l00455" > < / a > < span class = "lineno" > 455< / span >   }< / div >
< div class = "line" > < a name = "l00456" > < / a > < span class = "lineno" > 456< / span >   < / div >
< div class = "line" > < a name = "l00457" > < / a > < span class = "lineno" > 457< / span >   < span class = "keywordflow" > if< / span > (!ok) {< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00458" > < / a > < span class = "lineno" > 458< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9" > INFO< / a > ) < < < span class = "stringliteral" > " Infeasible while adding a clause." < / span > ;< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00459" > < / a > < span class = "lineno" > 459< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00460" > < / a > < span class = "lineno" > 460< / span >   }< / div >
< div class = "line" > < a name = "l00461" > < / a > < span class = "lineno" > 461< / span >   }< / div >
< div class = "line" > < a name = "l00462" > < / a > < span class = "lineno" > 462< / span >   }< / div >
< div class = "line" > < a name = "l00463" > < / a > < span class = "lineno" > 463< / span >   }< / div >
< div class = "line" > < a name = "l00464" > < / a > < span class = "lineno" > 464< / span >   < / div >
< div class = "line" > < a name = "l00465" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#aa4fe3dc3bb5374a3ae58ae0f551be128" > 465< / a > < / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > < a class = "code" href = "namespaceoperations__research_1_1sat.html#aa4fe3dc3bb5374a3ae58ae0f551be128" > SolveWithWPM1< / a > (< a class = "code" href = "namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238" > LogBehavior< / a > log,< / div >
< div class = "line" > < a name = "l00466" > < / a > < span class = "lineno" > 466< / span >   < span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00467" > < / a > < span class = "lineno" > 467< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > * solver,< / div >
< div class = "line" > < a name = "l00468" > < / a > < span class = "lineno" > 468< / span >   std::vector< bool> * solution) {< / div >
< div class = "line" > < a name = "l00469" > < / a > < span class = "lineno" > 469< / span >   Logger logger(log);< / div >
< div class = "line" > < a name = "l00470" > < / a > < span class = "lineno" > 470< / span >   FuMalikSymmetryBreaker symmetry;< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00471" > < / a > < span class = "lineno" > 471< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00472" > < / a > < span class = "lineno" > 472< / span >   < span class = "comment" > // The current lower_bound on the cost.< / span > < / div >
< div class = "line" > < a name = "l00473" > < / a > < span class = "lineno" > 473< / span >   < span class = "comment" > // It will be correct after the initialization.< / span > < / div >
< div class = "line" > < a name = "l00474" > < / a > < span class = "lineno" > 474< / span >   Coefficient lower_bound(< span class = "keyword" > static_cast< < / span > < a class = "code" href = "integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a" > int64< / a > < span class = "keyword" > > < / span > (problem.objective().offset()));< / div >
< div class = "line" > < a name = "l00475" > < / a > < span class = "lineno" > 475< / span >   Coefficient upper_bound(< a class = "code" href = "integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719" > kint64max< / a > );< / div >
< div class = "line" > < a name = "l00476" > < / a > < span class = "lineno" > 476< / span >   < / div >
< div class = "line" > < a name = "l00477" > < / a > < span class = "lineno" > 477< / span >   < span class = "comment" > // The assumption literals and their associated cost.< / span > < / div >
< div class = "line" > < a name = "l00478" > < / a > < span class = "lineno" > 478< / span >   std::vector< Literal> assumptions;< / div >
< div class = "line" > < a name = "l00479" > < / a > < span class = "lineno" > 479< / span >   std::vector< Coefficient> costs;< / div >
< div class = "line" > < a name = "l00480" > < / a > < span class = "lineno" > 480< / span >   std::vector< Literal> reference;< / div >
< div class = "line" > < a name = "l00481" > < / a > < span class = "lineno" > 481< / span >   < / div >
< div class = "line" > < a name = "l00482" > < / a > < span class = "lineno" > 482< / span >   < span class = "comment" > // Initialization.< / span > < / div >
< div class = "line" > < a name = "l00483" > < / a > < span class = "lineno" > 483< / span >   < span class = "keyword" > const< / span > LinearObjective& objective = problem.objective();< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00484" > < / a > < span class = "lineno" > 484< / span >   < a class = "code" href = "base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6" > CHECK_GT< / a > (objective.coefficients_size(), 0);< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00485" > < / a > < span class = "lineno" > 485< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < objective.literals_size(); ++i) {< / div >
< div class = "line" > < a name = "l00486" > < / a > < span class = "lineno" > 486< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > (objective.literals(i));< / div >
< div class = "line" > < a name = "l00487" > < / a > < span class = "lineno" > 487< / span >   < span class = "keyword" > const< / span > Coefficient coeff(objective.coefficients(i));< / div >
< div class = "line" > < a name = "l00488" > < / a > < span class = "lineno" > 488< / span >   < / div >
< div class = "line" > < a name = "l00489" > < / a > < span class = "lineno" > 489< / span >   < span class = "comment" > // We want to minimize the cost when the assumption is true.< / span > < / div >
< div class = "line" > < a name = "l00490" > < / a > < span class = "lineno" > 490< / span >   < span class = "comment" > // Note that initially, we do not create any extra variables.< / span > < / div >
< div class = "line" > < a name = "l00491" > < / a > < span class = "lineno" > 491< / span >   < span class = "keywordflow" > if< / span > (coeff > 0) {< / div >
< div class = "line" > < a name = "l00492" > < / a > < span class = "lineno" > 492< / span >   assumptions.push_back(< a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > .< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644" > Negated< / a > ());< / div >
< div class = "line" > < a name = "l00493" > < / a > < span class = "lineno" > 493< / span >   costs.push_back(coeff);< / div >
< div class = "line" > < a name = "l00494" > < / a > < span class = "lineno" > 494< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l00495" > < / a > < span class = "lineno" > 495< / span >   assumptions.push_back(< a class = "code" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > );< / div >
< div class = "line" > < a name = "l00496" > < / a > < span class = "lineno" > 496< / span >   costs.push_back(-coeff);< / div >
< div class = "line" > < a name = "l00497" > < / a > < span class = "lineno" > 497< / span >   lower_bound += coeff;< / div >
< div class = "line" > < a name = "l00498" > < / a > < span class = "lineno" > 498< / span >   }< / div >
< div class = "line" > < a name = "l00499" > < / a > < span class = "lineno" > 499< / span >   }< / div >
< div class = "line" > < a name = "l00500" > < / a > < span class = "lineno" > 500< / span >   reference = assumptions;< / div >
< div class = "line" > < a name = "l00501" > < / a > < span class = "lineno" > 501< / span >   < / div >
< div class = "line" > < a name = "l00502" > < / a > < span class = "lineno" > 502< / span >   < span class = "comment" > // This is used by the " stratified" approach.< / span > < / div >
< div class = "line" > < a name = "l00503" > < / a > < span class = "lineno" > 503< / span >   Coefficient stratified_lower_bound =< / div >
< div class = "line" > < a name = "l00504" > < / a > < span class = "lineno" > 504< / span >   *std::max_element(costs.begin(), costs.end());< / div >
< div class = "line" > < a name = "l00505" > < / a > < span class = "lineno" > 505< / span >   < / div >
< div class = "line" > < a name = "l00506" > < / a > < span class = "lineno" > 506< / span >   < span class = "comment" > // Print the number of variables with a non-zero cost.< / span > < / div >
< div class = "line" > < a name = "l00507" > < / a > < span class = "lineno" > 507< / span >   logger.Log(absl::StrFormat(< span class = "stringliteral" > " c #weights:%u #vars:%d #constraints:%d" < / span > ,< / div >
< div class = "line" > < a name = "l00508" > < / a > < span class = "lineno" > 508< / span >   assumptions.size(), problem.num_variables(),< / div >
< div class = "line" > < a name = "l00509" > < / a > < span class = "lineno" > 509< / span >   problem.constraints_size()));< / div >
< div class = "line" > < a name = "l00510" > < / a > < span class = "lineno" > 510< / span >   < / div >
< div class = "line" > < a name = "l00511" > < / a > < span class = "lineno" > 511< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > iter = 0;; ++iter) {< / div >
< div class = "line" > < a name = "l00512" > < / a > < span class = "lineno" > 512< / span >   < span class = "comment" > // This is called " hardening" in the literature.< / span > < / div >
< div class = "line" > < a name = "l00513" > < / a > < span class = "lineno" > 513< / span >   < span class = "comment" > // Basically, we know that there is only hardening_threshold weight left< / span > < / div >
< div class = "line" > < a name = "l00514" > < / a > < span class = "lineno" > 514< / span >   < span class = "comment" > // to distribute, so any assumption with a greater cost than this can never< / span > < / div >
< div class = "line" > < a name = "l00515" > < / a > < span class = "lineno" > 515< / span >   < span class = "comment" > // be false. We fix it instead of treating it as an assumption.< / span > < / div >
< div class = "line" > < a name = "l00516" > < / a > < span class = "lineno" > 516< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
< div class = "line" > < a name = "l00517" > < / a > < span class = "lineno" > 517< / span >   < span class = "keyword" > const< / span > Coefficient hardening_threshold = upper_bound - lower_bound;< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00518" > < / a > < span class = "lineno" > 518< / span >   < a class = "code" href = "base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9" > CHECK_GE< / a > (hardening_threshold, 0);< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00519" > < / a > < span class = "lineno" > 519< / span >   std::vector< int> to_delete;< / div >
< div class = "line" > < a name = "l00520" > < / a > < span class = "lineno" > 520< / span >   < span class = "keywordtype" > int< / span > num_above_threshold = 0;< / div >
< div class = "line" > < a name = "l00521" > < / a > < span class = "lineno" > 521< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < assumptions.size(); ++i) {< / div >
< div class = "line" > < a name = "l00522" > < / a > < span class = "lineno" > 522< / span >   < span class = "keywordflow" > if< / span > (costs[i] > hardening_threshold) {< / div >
< div class = "line" > < a name = "l00523" > < / a > < span class = "lineno" > 523< / span >   < span class = "keywordflow" > if< / span > (!solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9" > AddUnitClause< / a > (assumptions[i])) {< / div >
< div class = "line" > < a name = "l00524" > < / a > < span class = "lineno" > 524< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00525" > < / a > < span class = "lineno" > 525< / span >   }< / div >
< div class = "line" > < a name = "l00526" > < / a > < span class = "lineno" > 526< / span >   to_delete.push_back(i);< / div >
< div class = "line" > < a name = "l00527" > < / a > < span class = "lineno" > 527< / span >   ++num_above_threshold;< / div >
< div class = "line" > < a name = "l00528" > < / a > < span class = "lineno" > 528< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l00529" > < / a > < span class = "lineno" > 529< / span >   < span class = "comment" > // This impact the stratification heuristic.< / span > < / div >
< div class = "line" > < a name = "l00530" > < / a > < span class = "lineno" > 530< / span >   < span class = "keywordflow" > if< / span > (solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8" > Assignment< / a > ().< a class = "code" href = "classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e" > LiteralIsTrue< / a > (assumptions[i])) {< / div >
< div class = "line" > < a name = "l00531" > < / a > < span class = "lineno" > 531< / span >   to_delete.push_back(i);< / div >
< div class = "line" > < a name = "l00532" > < / a > < span class = "lineno" > 532< / span >   }< / div >
< div class = "line" > < a name = "l00533" > < / a > < span class = "lineno" > 533< / span >   }< / div >
< div class = "line" > < a name = "l00534" > < / a > < span class = "lineno" > 534< / span >   }< / div >
< div class = "line" > < a name = "l00535" > < / a > < span class = "lineno" > 535< / span >   < span class = "keywordflow" > if< / span > (!to_delete.empty()) {< / div >
< div class = "line" > < a name = "l00536" > < / a > < span class = "lineno" > 536< / span >   logger.Log(absl::StrFormat(< span class = "stringliteral" > " c fixed %u assumptions, %d with cost > %d" < / span > ,< / div >
< div class = "line" > < a name = "l00537" > < / a > < span class = "lineno" > 537< / span >   to_delete.size(), num_above_threshold,< / div >
< div class = "line" > < a name = "l00538" > < / a > < span class = "lineno" > 538< / span >   hardening_threshold.value()));< / div >
< div class = "line" > < a name = "l00539" > < / a > < span class = "lineno" > 539< / span >   DeleteVectorIndices(to_delete, & assumptions);< / div >
< div class = "line" > < a name = "l00540" > < / a > < span class = "lineno" > 540< / span >   DeleteVectorIndices(to_delete, & costs);< / div >
< div class = "line" > < a name = "l00541" > < / a > < span class = "lineno" > 541< / span >   DeleteVectorIndices(to_delete, & reference);< / div >
< div class = "line" > < a name = "l00542" > < / a > < span class = "lineno" > 542< / span >   symmetry.DeleteIndices(to_delete);< / div >
< div class = "line" > < a name = "l00543" > < / a > < span class = "lineno" > 543< / span >   }< / div >
< div class = "line" > < a name = "l00544" > < / a > < span class = "lineno" > 544< / span >   < / div >
< div class = "line" > < a name = "l00545" > < / a > < span class = "lineno" > 545< / span >   < span class = "comment" > // This is the " stratification" part.< / span > < / div >
< div class = "line" > < a name = "l00546" > < / a > < span class = "lineno" > 546< / span >   < span class = "comment" > // Extract the assumptions with a cost > = stratified_lower_bound.< / span > < / div >
< div class = "line" > < a name = "l00547" > < / a > < span class = "lineno" > 547< / span >   std::vector< Literal> assumptions_subset;< / div >
< div class = "line" > < a name = "l00548" > < / a > < span class = "lineno" > 548< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < assumptions.size(); ++i) {< / div >
< div class = "line" > < a name = "l00549" > < / a > < span class = "lineno" > 549< / span >   < span class = "keywordflow" > if< / span > (costs[i] > = stratified_lower_bound) {< / div >
< div class = "line" > < a name = "l00550" > < / a > < span class = "lineno" > 550< / span >   assumptions_subset.push_back(assumptions[i]);< / div >
< div class = "line" > < a name = "l00551" > < / a > < span class = "lineno" > 551< / span >   }< / div >
< div class = "line" > < a name = "l00552" > < / a > < span class = "lineno" > 552< / span >   }< / div >
< div class = "line" > < a name = "l00553" > < / a > < span class = "lineno" > 553< / span >   < / div >
< div class = "line" > < a name = "l00554" > < / a > < span class = "lineno" > 554< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > result =< / div >
< div class = "line" > < a name = "l00555" > < / a > < span class = "lineno" > 555< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a2abca6db0c780a4482d1ac9eb6365057" > ResetAndSolveWithGivenAssumptions< / a > (assumptions_subset);< / div >
< div class = "line" > < a name = "l00556" > < / a > < span class = "lineno" > 556< / span >   < span class = "keywordflow" > if< / span > (result == < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ) {< / div >
< div class = "line" > < a name = "l00557" > < / a > < span class = "lineno" > 557< / span >   < span class = "comment" > // If not all assumptions were taken, continue with a lower stratified< / span > < / div >
< div class = "line" > < a name = "l00558" > < / a > < span class = "lineno" > 558< / span >   < span class = "comment" > // bound. Otherwise we have an optimal solution!< / span > < / div >
< div class = "line" > < a name = "l00559" > < / a > < span class = "lineno" > 559< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00560" > < / a > < span class = "lineno" > 560< / span >   < span class = "comment" > // TODO(user): Try more advanced variant where the bound is lowered by< / span > < / div >
< div class = "line" > < a name = "l00561" > < / a > < span class = "lineno" > 561< / span >   < span class = "comment" > // more than this minimal amount.< / span > < / div >
< div class = "line" > < a name = "l00562" > < / a > < span class = "lineno" > 562< / span >   < span class = "keyword" > const< / span > Coefficient old_lower_bound = stratified_lower_bound;< / div >
< div class = "line" > < a name = "l00563" > < / a > < span class = "lineno" > 563< / span >   < span class = "keywordflow" > for< / span > (Coefficient < a class = "code" href = "routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4" > cost< / a > : costs) {< / div >
< div class = "line" > < a name = "l00564" > < / a > < span class = "lineno" > 564< / span >   < span class = "keywordflow" > if< / span > (< a class = "code" href = "routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4" > cost< / a > < old_lower_bound) {< / div >
< div class = "line" > < a name = "l00565" > < / a > < span class = "lineno" > 565< / span >   < span class = "keywordflow" > if< / span > (stratified_lower_bound == old_lower_bound ||< / div >
< div class = "line" > < a name = "l00566" > < / a > < span class = "lineno" > 566< / span >   < a class = "code" href = "routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4" > cost< / a > > stratified_lower_bound) {< / div >
< div class = "line" > < a name = "l00567" > < / a > < span class = "lineno" > 567< / span >   stratified_lower_bound = < a class = "code" href = "routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4" > cost< / a > ;< / div >
< div class = "line" > < a name = "l00568" > < / a > < span class = "lineno" > 568< / span >   }< / div >
< div class = "line" > < a name = "l00569" > < / a > < span class = "lineno" > 569< / span >   }< / div >
< div class = "line" > < a name = "l00570" > < / a > < span class = "lineno" > 570< / span >   }< / div >
< div class = "line" > < a name = "l00571" > < / a > < span class = "lineno" > 571< / span >   < / div >
< div class = "line" > < a name = "l00572" > < / a > < span class = "lineno" > 572< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838" > ExtractAssignment< / a > (problem, *solver, solution);< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00573" > < / a > < span class = "lineno" > 573< / span >   < a class = "code" href = "base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006" > DCHECK< / a > (< a class = "code" href = "namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1" > IsAssignmentValid< / a > (problem, *solution));< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00574" > < / a > < span class = "lineno" > 574< / span >   < span class = "keyword" > const< / span > Coefficient objective_offset(< / div >
< div class = "line" > < a name = "l00575" > < / a > < span class = "lineno" > 575< / span >   < span class = "keyword" > static_cast< < / span > < a class = "code" href = "integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a" > int64< / a > < span class = "keyword" > > < / span > (problem.objective().offset()));< / div >
< div class = "line" > < a name = "l00576" > < / a > < span class = "lineno" > 576< / span >   < span class = "keyword" > const< / span > Coefficient objective = < a class = "code" href = "namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f" > ComputeObjectiveValue< / a > (problem, *solution);< / div >
< div class = "line" > < a name = "l00577" > < / a > < span class = "lineno" > 577< / span >   < span class = "keywordflow" > if< / span > (objective + objective_offset < upper_bound) {< / div >
< div class = "line" > < a name = "l00578" > < / a > < span class = "lineno" > 578< / span >   logger.Log(CnfObjectiveLine(problem, objective));< / div >
< div class = "line" > < a name = "l00579" > < / a > < span class = "lineno" > 579< / span >   upper_bound = objective + objective_offset;< / div >
< div class = "line" > < a name = "l00580" > < / a > < span class = "lineno" > 580< / span >   }< / div >
< div class = "line" > < a name = "l00581" > < / a > < span class = "lineno" > 581< / span >   < / div >
< div class = "line" > < a name = "l00582" > < / a > < span class = "lineno" > 582< / span >   < span class = "keywordflow" > if< / span > (stratified_lower_bound < old_lower_bound) < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l00583" > < / a > < span class = "lineno" > 583< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00584" > < / a > < span class = "lineno" > 584< / span >   }< / div >
< div class = "line" > < a name = "l00585" > < / a > < span class = "lineno" > 585< / span >   < span class = "keywordflow" > if< / span > (result != < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885" > SatSolver::ASSUMPTIONS_UNSAT< / a > ) < span class = "keywordflow" > return< / span > result;< / div >
< div class = "line" > < a name = "l00586" > < / a > < span class = "lineno" > 586< / span >   < / div >
< div class = "line" > < a name = "l00587" > < / a > < span class = "lineno" > 587< / span >   < span class = "comment" > // The interesting case: we have an unsat core.< / span > < / div >
< div class = "line" > < a name = "l00588" > < / a > < span class = "lineno" > 588< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00589" > < / a > < span class = "lineno" > 589< / span >   < span class = "comment" > // We need to add new " blocking" variables b_i for all the objective< / span > < / div >
< div class = "line" > < a name = "l00590" > < / a > < span class = "lineno" > 590< / span >   < span class = "comment" > // variables appearing in the core. Moreover, we will only relax as little< / span > < / div >
< div class = "line" > < a name = "l00591" > < / a > < span class = "lineno" > 591< / span >   < span class = "comment" > // as possible (to not miss the optimal), so we will enforce that the sum< / span > < / div >
< div class = "line" > < a name = "l00592" > < / a > < span class = "lineno" > 592< / span >   < span class = "comment" > // of the b_i is exactly one.< / span > < / div >
< div class = "line" > < a name = "l00593" > < / a > < span class = "lineno" > 593< / span >   std::vector< Literal> core = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#acfbfa9df611cb625ff79785c05784580" > GetLastIncompatibleDecisions< / a > ();< / div >
< div class = "line" > < a name = "l00594" > < / a > < span class = "lineno" > 594< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#a6fb8349259fa849de0789a4ec58a8492" > MinimizeCore< / a > (solver, & core);< / div >
< div class = "line" > < a name = "l00595" > < / a > < span class = "lineno" > 595< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
< div class = "line" > < a name = "l00596" > < / a > < span class = "lineno" > 596< / span >   < / div >
< div class = "line" > < a name = "l00597" > < / a > < span class = "lineno" > 597< / span >   < span class = "comment" > // Compute the min cost of all the assertions in the core.< / span > < / div >
< div class = "line" > < a name = "l00598" > < / a > < span class = "lineno" > 598< / span >   < span class = "comment" > // The lower bound will be updated by that much.< / span > < / div >
< div class = "line" > < a name = "l00599" > < / a > < span class = "lineno" > 599< / span >   Coefficient min_cost = < a class = "code" href = "namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18" > kCoefficientMax< / a > ;< / div >
< div class = "line" > < a name = "l00600" > < / a > < span class = "lineno" > 600< / span >   {< / div >
< div class = "line" > < a name = "l00601" > < / a > < span class = "lineno" > 601< / span >   < span class = "keywordtype" > int< / span > < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > = 0;< / div >
< div class = "line" > < a name = "l00602" > < / a > < span class = "lineno" > 602< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < core.size(); ++i) {< / div >
< div class = "line" > < a name = "l00603" > < / a > < span class = "lineno" > 603< / span >   < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > =< / div >
< div class = "line" > < a name = "l00604" > < / a > < span class = "lineno" > 604< / span >   std::find(assumptions.begin() + < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > , assumptions.end(), core[i]) -< / div >
< div class = "line" > < a name = "l00605" > < / a > < span class = "lineno" > 605< / span >   assumptions.begin();< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00606" > < / a > < span class = "lineno" > 606< / span >   < a class = "code" href = "base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82" > CHECK_LT< / a > (< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > , assumptions.size());< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00607" > < / a > < span class = "lineno" > 607< / span >   min_cost = < a class = "code" href = "alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37" > std::min< / a > (min_cost, costs[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ]);< / div >
< div class = "line" > < a name = "l00608" > < / a > < span class = "lineno" > 608< / span >   }< / div >
< div class = "line" > < a name = "l00609" > < / a > < span class = "lineno" > 609< / span >   }< / div >
< div class = "line" > < a name = "l00610" > < / a > < span class = "lineno" > 610< / span >   lower_bound += min_cost;< / div >
< div class = "line" > < a name = "l00611" > < / a > < span class = "lineno" > 611< / span >   < / div >
< div class = "line" > < a name = "l00612" > < / a > < span class = "lineno" > 612< / span >   < span class = "comment" > // Print the search progress.< / span > < / div >
< div class = "line" > < a name = "l00613" > < / a > < span class = "lineno" > 613< / span >   logger.Log(absl::StrFormat(< / div >
< div class = "line" > < a name = "l00614" > < / a > < span class = "lineno" > 614< / span >   < span class = "stringliteral" > " c iter:%d core:%u lb:%d min_cost:%d strat:%d" < / span > , iter, core.size(),< / div >
< div class = "line" > < a name = "l00615" > < / a > < span class = "lineno" > 615< / span >   lower_bound.value(), min_cost.value(), stratified_lower_bound.value()));< / div >
< div class = "line" > < a name = "l00616" > < / a > < span class = "lineno" > 616< / span >   < / div >
< div class = "line" > < a name = "l00617" > < / a > < span class = "lineno" > 617< / span >   < span class = "comment" > // This simple line helps a lot on the packup-wpms instances!< / span > < / div >
< div class = "line" > < a name = "l00618" > < / a > < span class = "lineno" > 618< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00619" > < / a > < span class = "lineno" > 619< / span >   < span class = "comment" > // TODO(user): That was because of a bug before in the way< / span > < / div >
< div class = "line" > < a name = "l00620" > < / a > < span class = "lineno" > 620< / span >   < span class = "comment" > // stratified_lower_bound was decremented, not sure it helps that much now.< / span > < / div >
< div class = "line" > < a name = "l00621" > < / a > < span class = "lineno" > 621< / span >   < span class = "keywordflow" > if< / span > (min_cost > stratified_lower_bound) {< / div >
< div class = "line" > < a name = "l00622" > < / a > < span class = "lineno" > 622< / span >   stratified_lower_bound = min_cost;< / div >
< div class = "line" > < a name = "l00623" > < / a > < span class = "lineno" > 623< / span >   }< / div >
< div class = "line" > < a name = "l00624" > < / a > < span class = "lineno" > 624< / span >   < / div >
< div class = "line" > < a name = "l00625" > < / a > < span class = "lineno" > 625< / span >   < span class = "comment" > // Special case for a singleton core.< / span > < / div >
< div class = "line" > < a name = "l00626" > < / a > < span class = "lineno" > 626< / span >   < span class = "keywordflow" > if< / span > (core.size() == 1) {< / div >
< div class = "line" > < a name = "l00627" > < / a > < span class = "lineno" > 627< / span >   < span class = "comment" > // Find the index of the " objective" variable that need to be fixed in< / span > < / div >
< div class = "line" > < a name = "l00628" > < / a > < span class = "lineno" > 628< / span >   < span class = "comment" > // its " costly" state.< / span > < / div >
< div class = "line" > < a name = "l00629" > < / a > < span class = "lineno" > 629< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > =< / div >
< div class = "line" > < a name = "l00630" > < / a > < span class = "lineno" > 630< / span >   std::find(assumptions.begin(), assumptions.end(), core[0]) -< / div >
< div class = "line" > < a name = "l00631" > < / a > < span class = "lineno" > 631< / span >   assumptions.begin();< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00632" > < / a > < span class = "lineno" > 632< / span >   < a class = "code" href = "base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82" > CHECK_LT< / a > (< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > , assumptions.size());< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00633" > < / a > < span class = "lineno" > 633< / span >   < / div >
< div class = "line" > < a name = "l00634" > < / a > < span class = "lineno" > 634< / span >   < span class = "comment" > // Fix it.< / span > < / div >
< div class = "line" > < a name = "l00635" > < / a > < span class = "lineno" > 635< / span >   < span class = "keywordflow" > if< / span > (!solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9" > AddUnitClause< / a > (core[0].Negated())) {< / div >
< div class = "line" > < a name = "l00636" > < / a > < span class = "lineno" > 636< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00637" > < / a > < span class = "lineno" > 637< / span >   }< / div >
< div class = "line" > < a name = "l00638" > < / a > < span class = "lineno" > 638< / span >   < / div >
< div class = "line" > < a name = "l00639" > < / a > < span class = "lineno" > 639< / span >   < span class = "comment" > // Erase this entry from the current " objective" .< / span > < / div >
< div class = "line" > < a name = "l00640" > < / a > < span class = "lineno" > 640< / span >   std::vector< int> to_delete(1, < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > );< / div >
< div class = "line" > < a name = "l00641" > < / a > < span class = "lineno" > 641< / span >   DeleteVectorIndices(to_delete, & assumptions);< / div >
< div class = "line" > < a name = "l00642" > < / a > < span class = "lineno" > 642< / span >   DeleteVectorIndices(to_delete, & costs);< / div >
< div class = "line" > < a name = "l00643" > < / a > < span class = "lineno" > 643< / span >   DeleteVectorIndices(to_delete, & reference);< / div >
< div class = "line" > < a name = "l00644" > < / a > < span class = "lineno" > 644< / span >   symmetry.DeleteIndices(to_delete);< / div >
< div class = "line" > < a name = "l00645" > < / a > < span class = "lineno" > 645< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l00646" > < / a > < span class = "lineno" > 646< / span >   symmetry.StartResolvingNewCore(iter);< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00647" > < / a > < span class = "lineno" > 647< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00648" > < / a > < span class = "lineno" > 648< / span >   < span class = "comment" > // We will add 2 * |core.size()| variables.< / span > < / div >
< div class = "line" > < a name = "l00649" > < / a > < span class = "lineno" > 649< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > old_num_variables = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2" > NumVariables< / a > ();< / div >
< div class = "line" > < a name = "l00650" > < / a > < span class = "lineno" > 650< / span >   < span class = "keywordflow" > if< / span > (core.size() == 2) {< / div >
< div class = "line" > < a name = "l00651" > < / a > < span class = "lineno" > 651< / span >   < span class = "comment" > // Special case. If core.size() == 2, we can use only one blocking< / span > < / div >
< div class = "line" > < a name = "l00652" > < / a > < span class = "lineno" > 652< / span >   < span class = "comment" > // variable (the other one beeing its negation). This actually do happen< / span > < / div >
< div class = "line" > < a name = "l00653" > < / a > < span class = "lineno" > 653< / span >   < span class = "comment" > // quite often in practice, so it is worth it.< / span > < / div >
< div class = "line" > < a name = "l00654" > < / a > < span class = "lineno" > 654< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb" > SetNumVariables< / a > (old_num_variables + 3);< / div >
< div class = "line" > < a name = "l00655" > < / a > < span class = "lineno" > 655< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l00656" > < / a > < span class = "lineno" > 656< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb" > SetNumVariables< / a > (old_num_variables + 2 * core.size());< / div >
< div class = "line" > < a name = "l00657" > < / a > < span class = "lineno" > 657< / span >   }< / div >
< div class = "line" > < a name = "l00658" > < / a > < span class = "lineno" > 658< / span >   < / div >
< div class = "line" > < a name = "l00659" > < / a > < span class = "lineno" > 659< / span >   < span class = "comment" > // Temporary vectors for the constraint (sum new blocking variable == 1).< / span > < / div >
< div class = "line" > < a name = "l00660" > < / a > < span class = "lineno" > 660< / span >   std::vector< LiteralWithCoeff> at_most_one_constraint;< / div >
< div class = "line" > < a name = "l00661" > < / a > < span class = "lineno" > 661< / span >   std::vector< Literal> at_least_one_constraint;< / div >
< div class = "line" > < a name = "l00662" > < / a > < span class = "lineno" > 662< / span >   < / div >
< div class = "line" > < a name = "l00663" > < / a > < span class = "lineno" > 663< / span >   < span class = "comment" > // This will be set to false if the problem becomes unsat while adding a< / span > < / div >
< div class = "line" > < a name = "l00664" > < / a > < span class = "lineno" > 664< / span >   < span class = "comment" > // new clause. This is unlikely, but may be possible.< / span > < / div >
< div class = "line" > < a name = "l00665" > < / a > < span class = "lineno" > 665< / span >   < span class = "keywordtype" > bool< / span > ok = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l00666" > < / a > < span class = "lineno" > 666< / span >   < / div >
< div class = "line" > < a name = "l00667" > < / a > < span class = "lineno" > 667< / span >   < span class = "comment" > // Loop over the core.< / span > < / div >
< div class = "line" > < a name = "l00668" > < / a > < span class = "lineno" > 668< / span >   < span class = "keywordtype" > int< / span > < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > = 0;< / div >
< div class = "line" > < a name = "l00669" > < / a > < span class = "lineno" > 669< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < core.size(); ++i) {< / div >
< div class = "line" > < a name = "l00670" > < / a > < span class = "lineno" > 670< / span >   < span class = "comment" > // Since the assumptions appear in order in the core, we can find the< / span > < / div >
< div class = "line" > < a name = "l00671" > < / a > < span class = "lineno" > 671< / span >   < span class = "comment" > // relevant " objective" variable efficiently with a simple linear scan< / span > < / div >
< div class = "line" > < a name = "l00672" > < / a > < span class = "lineno" > 672< / span >   < span class = "comment" > // in the assumptions vector (done with index).< / span > < / div >
< div class = "line" > < a name = "l00673" > < / a > < span class = "lineno" > 673< / span >   < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > =< / div >
< div class = "line" > < a name = "l00674" > < / a > < span class = "lineno" > 674< / span >   std::find(assumptions.begin() + < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > , assumptions.end(), core[i]) -< / div >
< div class = "line" > < a name = "l00675" > < / a > < span class = "lineno" > 675< / span >   assumptions.begin();< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00676" > < / a > < span class = "lineno" > 676< / span >   < a class = "code" href = "base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82" > CHECK_LT< / a > (< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > , assumptions.size());< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00677" > < / a > < span class = "lineno" > 677< / span >   < / div >
< div class = "line" > < a name = "l00678" > < / a > < span class = "lineno" > 678< / span >   < span class = "comment" > // The new blocking and assumption variables for this core entry.< / span > < / div >
< div class = "line" > < a name = "l00679" > < / a > < span class = "lineno" > 679< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code" href = "constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2" > a< / a > (BooleanVariable(old_num_variables + i), < span class = "keyword" > true< / span > );< / div >
< div class = "line" > < a name = "l00680" > < / a > < span class = "lineno" > 680< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > (BooleanVariable(old_num_variables + core.size() + i), < span class = "keyword" > true< / span > );< / div >
< div class = "line" > < a name = "l00681" > < / a > < span class = "lineno" > 681< / span >   < span class = "keywordflow" > if< / span > (core.size() == 2) {< / div >
< div class = "line" > < a name = "l00682" > < / a > < span class = "lineno" > 682< / span >   < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > = < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > (BooleanVariable(old_num_variables + 2), < span class = "keyword" > true< / span > );< / div >
< div class = "line" > < a name = "l00683" > < / a > < span class = "lineno" > 683< / span >   < span class = "keywordflow" > if< / span > (i == 1) < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > = < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > .Negated();< / div >
< div class = "line" > < a name = "l00684" > < / a > < span class = "lineno" > 684< / span >   }< / div >
< div class = "line" > < a name = "l00685" > < / a > < span class = "lineno" > 685< / span >   < / div >
< div class = "line" > < a name = "l00686" > < / a > < span class = "lineno" > 686< / span >   < span class = "comment" > // a false & b false => previous assumptions (which was false).< / span > < / div >
< div class = "line" > < a name = "l00687" > < / a > < span class = "lineno" > 687< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > old_a = assumptions[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ];< / div >
< div class = "line" > < a name = "l00688" > < / a > < span class = "lineno" > 688< / span >   ok & = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a0e8b0117614d340615ab66abec430d78" > AddTernaryClause< / a > (< a class = "code" href = "constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2" > a< / a > , < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > , old_a);< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00689" > < / a > < span class = "lineno" > 689< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00690" > < / a > < span class = "lineno" > 690< / span >   < span class = "comment" > // Optional. Also add the two implications a => x and b => x where x is< / span > < / div >
< div class = "line" > < a name = "l00691" > < / a > < span class = "lineno" > 691< / span >   < span class = "comment" > // the negation of the previous assumption variable.< / span > < / div >
< div class = "line" > < a name = "l00692" > < / a > < span class = "lineno" > 692< / span >   ok & = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094" > AddBinaryClause< / a > (< a class = "code" href = "constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2" > a< / a > .Negated(), old_a.< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644" > Negated< / a > ());< / div >
< div class = "line" > < a name = "l00693" > < / a > < span class = "lineno" > 693< / span >   ok & = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094" > AddBinaryClause< / a > (< a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > .Negated(), old_a.< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644" > Negated< / a > ());< / div >
< div class = "line" > < a name = "l00694" > < / a > < span class = "lineno" > 694< / span >   < / div >
< div class = "line" > < a name = "l00695" > < / a > < span class = "lineno" > 695< / span >   < span class = "comment" > // Optional. Also add the implication a => not(b).< / span > < / div >
< div class = "line" > < a name = "l00696" > < / a > < span class = "lineno" > 696< / span >   ok & = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094" > AddBinaryClause< / a > (< a class = "code" href = "constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2" > a< / a > .Negated(), < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > .Negated());< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00697" > < / a > < span class = "lineno" > 697< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00698" > < / a > < span class = "lineno" > 698< / span >   < span class = "comment" > // This is the difference with the Fu & Malik algorithm.< / span > < / div >
< div class = "line" > < a name = "l00699" > < / a > < span class = "lineno" > 699< / span >   < span class = "comment" > // If the soft clause protected by old_a has a cost greater than< / span > < / div >
< div class = "line" > < a name = "l00700" > < / a > < span class = "lineno" > 700< / span >   < span class = "comment" > // min_cost then:< / span > < / div >
< div class = "line" > < a name = "l00701" > < / a > < span class = "lineno" > 701< / span >   < span class = "comment" > // - its cost is disminished by min_cost.< / span > < / div >
< div class = "line" > < a name = "l00702" > < / a > < span class = "lineno" > 702< / span >   < span class = "comment" > // - an identical clause with cost min_cost is artifically added to< / span > < / div >
< div class = "line" > < a name = "l00703" > < / a > < span class = "lineno" > 703< / span >   < span class = "comment" > // the problem.< / span > < / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00704" > < / a > < span class = "lineno" > 704< / span >   < a class = "code" href = "base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9" > CHECK_GE< / a > (costs[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ], min_cost);< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00705" > < / a > < span class = "lineno" > 705< / span >   < span class = "keywordflow" > if< / span > (costs[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ] == min_cost) {< / div >
< div class = "line" > < a name = "l00706" > < / a > < span class = "lineno" > 706< / span >   < span class = "comment" > // The new assumption variable replaces the old one.< / span > < / div >
< div class = "line" > < a name = "l00707" > < / a > < span class = "lineno" > 707< / span >   assumptions[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ] = < a class = "code" href = "constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2" > a< / a > .Negated();< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00708" > < / a > < span class = "lineno" > 708< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00709" > < / a > < span class = "lineno" > 709< / span >   < span class = "comment" > // Symmetry breaking clauses.< / span > < / div >
< div class = "line" > < a name = "l00710" > < / a > < span class = "lineno" > 710< / span >   < span class = "keywordflow" > for< / span > (< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > l : symmetry.ProcessLiteral(< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > , < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > )) {< / div >
< div class = "line" > < a name = "l00711" > < / a > < span class = "lineno" > 711< / span >   ok & = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094" > AddBinaryClause< / a > (l.Negated(), < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > .Negated());< / div >
< div class = "line" > < a name = "l00712" > < / a > < span class = "lineno" > 712< / span >   }< / div >
< div class = "line" > < a name = "l00713" > < / a > < span class = "lineno" > 713< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l00714" > < / a > < span class = "lineno" > 714< / span >   < span class = "comment" > // Since the cost of the given index changes, we need to start a new< / span > < / div >
< div class = "line" > < a name = "l00715" > < / a > < span class = "lineno" > 715< / span >   < span class = "comment" > // " equivalence" class for the symmetry breaking algo and clear the< / span > < / div >
< div class = "line" > < a name = "l00716" > < / a > < span class = "lineno" > 716< / span >   < span class = "comment" > // old one.< / span > < / div >
< div class = "line" > < a name = "l00717" > < / a > < span class = "lineno" > 717< / span >   symmetry.AddInfo(assumptions.size(), < a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > );< / div >
< div class = "line" > < a name = "l00718" > < / a > < span class = "lineno" > 718< / span >   symmetry.ClearInfo(< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > );< / div >
< div class = "line" > < a name = "l00719" > < / a > < span class = "lineno" > 719< / span >   < / div >
< div class = "line" > < a name = "l00720" > < / a > < span class = "lineno" > 720< / span >   < span class = "comment" > // Reduce the cost of the old assumption.< / span > < / div >
< div class = "line" > < a name = "l00721" > < / a > < span class = "lineno" > 721< / span >   costs[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ] -= min_cost;< / div >
< div class = "line" > < a name = "l00722" > < / a > < span class = "lineno" > 722< / span >   < / div >
< div class = "line" > < a name = "l00723" > < / a > < span class = "lineno" > 723< / span >   < span class = "comment" > // We add the new assumption with a cost of min_cost.< / span > < / div >
< div class = "line" > < a name = "l00724" > < / a > < span class = "lineno" > 724< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00725" > < / a > < span class = "lineno" > 725< / span >   < span class = "comment" > // Note(user): I think it is nice that these are added after old_a< / span > < / div >
< div class = "line" > < a name = "l00726" > < / a > < span class = "lineno" > 726< / span >   < span class = "comment" > // because assuming old_a will implies all the derived assumptions to< / span > < / div >
< div class = "line" > < a name = "l00727" > < / a > < span class = "lineno" > 727< / span >   < span class = "comment" > // true, and thus they will never appear in a core until old_a is not< / span > < / div >
< div class = "line" > < a name = "l00728" > < / a > < span class = "lineno" > 728< / span >   < span class = "comment" > // an assumption anymore.< / span > < / div >
< div class = "line" > < a name = "l00729" > < / a > < span class = "lineno" > 729< / span >   assumptions.push_back(< a class = "code" href = "constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2" > a< / a > .Negated());< / div >
< div class = "line" > < a name = "l00730" > < / a > < span class = "lineno" > 730< / span >   costs.push_back(min_cost);< / div >
< div class = "line" > < a name = "l00731" > < / a > < span class = "lineno" > 731< / span >   reference.push_back(reference[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ]);< / div >
< div class = "line" > < a name = "l00732" > < / a > < span class = "lineno" > 732< / span >   }< / div >
< div class = "line" > < a name = "l00733" > < / a > < span class = "lineno" > 733< / span >   < / div >
< div class = "line" > < a name = "l00734" > < / a > < span class = "lineno" > 734< / span >   < span class = "comment" > // For the " < = 1" constraint on the blocking literals.< / span > < / div >
< div class = "line" > < a name = "l00735" > < / a > < span class = "lineno" > 735< / span >   < span class = "comment" > // Note(user): we don' t add the " > = 1" side because it is not needed for< / span > < / div >
< div class = "line" > < a name = "l00736" > < / a > < span class = "lineno" > 736< / span >   < span class = "comment" > // the correctness and it doesn' t seems to help.< / span > < / div >
< div class = "line" > < a name = "l00737" > < / a > < span class = "lineno" > 737< / span >   at_most_one_constraint.push_back(< a class = "code" href = "structoperations__research_1_1sat_1_1_literal_with_coeff.html" > LiteralWithCoeff< / a > (< a class = "code" href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > , 1.0));< / div >
< div class = "line" > < a name = "l00738" > < / a > < span class = "lineno" > 738< / span >   < / div >
< div class = "line" > < a name = "l00739" > < / a > < span class = "lineno" > 739< / span >   < span class = "comment" > // Because we have a core, we know that at least one of the initial< / span > < / div >
< div class = "line" > < a name = "l00740" > < / a > < span class = "lineno" > 740< / span >   < span class = "comment" > // problem variables must be true. This seems to help a bit.< / span > < / div >
< div class = "line" > < a name = "l00741" > < / a > < span class = "lineno" > 741< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00742" > < / a > < span class = "lineno" > 742< / span >   < span class = "comment" > // TODO(user): Experiment more.< / span > < / div >
< div class = "line" > < a name = "l00743" > < / a > < span class = "lineno" > 743< / span >   at_least_one_constraint.push_back(reference[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ].Negated());< / div >
< div class = "line" > < a name = "l00744" > < / a > < span class = "lineno" > 744< / span >   }< / div >
< div class = "line" > < a name = "l00745" > < / a > < span class = "lineno" > 745< / span >   < / div >
< div class = "line" > < a name = "l00746" > < / a > < span class = "lineno" > 746< / span >   < span class = "comment" > // Add the " < = 1" side of the " == 1" constraint.< / span > < / div >
< div class = "line" > < a name = "l00747" > < / a > < span class = "lineno" > 747< / span >   ok & = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653" > AddLinearConstraint< / a > (< span class = "keyword" > false< / span > , Coefficient(0), < span class = "keyword" > true< / span > ,< / div >
< div class = "line" > < a name = "l00748" > < / a > < span class = "lineno" > 748< / span >   Coefficient(1.0),< / div >
< div class = "line" > < a name = "l00749" > < / a > < span class = "lineno" > 749< / span >   & at_most_one_constraint);< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00750" > < / a > < span class = "lineno" > 750< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00751" > < / a > < span class = "lineno" > 751< / span >   < span class = "comment" > // Optional. Add the " > = 1" constraint on the initial problem variables.< / span > < / div >
< div class = "line" > < a name = "l00752" > < / a > < span class = "lineno" > 752< / span >   ok & = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#af67fe279478772a6d1492a7f673bda5d" > AddProblemClause< / a > (at_least_one_constraint);< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00753" > < / a > < span class = "lineno" > 753< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00754" > < / a > < span class = "lineno" > 754< / span >   < span class = "keywordflow" > if< / span > (!ok) {< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00755" > < / a > < span class = "lineno" > 755< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9" > INFO< / a > ) < < < span class = "stringliteral" > " Unsat while adding a clause." < / span > ;< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00756" > < / a > < span class = "lineno" > 756< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00757" > < / a > < span class = "lineno" > 757< / span >   }< / div >
< div class = "line" > < a name = "l00758" > < / a > < span class = "lineno" > 758< / span >   }< / div >
< div class = "line" > < a name = "l00759" > < / a > < span class = "lineno" > 759< / span >   }< / div >
< div class = "line" > < a name = "l00760" > < / a > < span class = "lineno" > 760< / span >   }< / div >
< div class = "line" > < a name = "l00761" > < / a > < span class = "lineno" > 761< / span >   < / div >
< div class = "line" > < a name = "l00762" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#adb8f016144f3565c4b693b59f9dc69b8" > 762< / a > < / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > < a class = "code" href = "namespaceoperations__research_1_1sat.html#adb8f016144f3565c4b693b59f9dc69b8" > SolveWithRandomParameters< / a > (< a class = "code" href = "namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238" > LogBehavior< / a > log,< / div >
< div class = "line" > < a name = "l00763" > < / a > < span class = "lineno" > 763< / span >   < span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00764" > < / a > < span class = "lineno" > 764< / span >   < span class = "keywordtype" > int< / span > num_times, < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > * solver,< / div >
< div class = "line" > < a name = "l00765" > < / a > < span class = "lineno" > 765< / span >   std::vector< bool> * solution) {< / div >
< div class = "line" > < a name = "l00766" > < / a > < span class = "lineno" > 766< / span >   Logger logger(log);< / div >
< div class = "line" > < a name = "l00767" > < / a > < span class = "lineno" > 767< / span >   < span class = "keyword" > const< / span > SatParameters initial_parameters = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9" > parameters< / a > ();< / div >
< div class = "line" > < a name = "l00768" > < / a > < span class = "lineno" > 768< / span >   < / div >
< div class = "line" > < a name = "l00769" > < / a > < span class = "lineno" > 769< / span >   < a class = "code" href = "classoperations__research_1_1_m_t_random.html" > MTRandom< / a > random(< span class = "stringliteral" > " A random seed." < / span > );< / div >
< div class = "line" > < a name = "l00770" > < / a > < span class = "lineno" > 770< / span >   SatParameters < a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > = initial_parameters;< / div >
< div class = "line" > < a name = "l00771" > < / a > < span class = "lineno" > 771< / span >   < a class = "code" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > < a class = "code" href = "cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47" > time_limit< / a > (< a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > .max_time_in_seconds());< / div >
< div class = "line" > < a name = "l00772" > < / a > < span class = "lineno" > 772< / span >   < / div >
< div class = "line" > < a name = "l00773" > < / a > < span class = "lineno" > 773< / span >   < span class = "comment" > // We start with a low conflict limit and increase it until we are able to< / span > < / div >
< div class = "line" > < a name = "l00774" > < / a > < span class = "lineno" > 774< / span >   < span class = "comment" > // solve the problem at least once. After this, the limit stays the same.< / span > < / div >
< div class = "line" > < a name = "l00775" > < / a > < span class = "lineno" > 775< / span >   < span class = "keywordtype" > int< / span > max_number_of_conflicts = 5;< / div >
< div class = "line" > < a name = "l00776" > < / a > < span class = "lineno" > 776< / span >   < a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > .set_log_search_progress(< span class = "keyword" > false< / span > );< / div >
< div class = "line" > < a name = "l00777" > < / a > < span class = "lineno" > 777< / span >   < / div >
< div class = "line" > < a name = "l00778" > < / a > < span class = "lineno" > 778< / span >   Coefficient min_seen(< a class = "code" href = "alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a" > std::numeric_limits< int64> ::max< / a > ());< / div >
< div class = "line" > < a name = "l00779" > < / a > < span class = "lineno" > 779< / span >   Coefficient max_seen(< a class = "code" href = "alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37" > std::numeric_limits< int64> ::min< / a > ());< / div >
< div class = "line" > < a name = "l00780" > < / a > < span class = "lineno" > 780< / span >   Coefficient best(min_seen);< / div >
< div class = "line" > < a name = "l00781" > < / a > < span class = "lineno" > 781< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < num_times; ++i) {< / div >
< div class = "line" > < a name = "l00782" > < / a > < span class = "lineno" > 782< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
< div class = "line" > < a name = "l00783" > < / a > < span class = "lineno" > 783< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#aef1ea7e6296a28c0fa0752328d8cb900" > RandomizeDecisionHeuristic< / a > (& random, & < a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > );< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00784" > < / a > < span class = "lineno" > 784< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00785" > < / a > < span class = "lineno" > 785< / span >   < a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > .set_max_number_of_conflicts(max_number_of_conflicts);< / div >
< div class = "line" > < a name = "l00786" > < / a > < span class = "lineno" > 786< / span >   < a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > .set_max_time_in_seconds(< a class = "code" href = "cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47" > time_limit< / a > .GetTimeLeft());< / div >
< div class = "line" > < a name = "l00787" > < / a > < span class = "lineno" > 787< / span >   < a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > .set_random_seed(i);< / div >
< div class = "line" > < a name = "l00788" > < / a > < span class = "lineno" > 788< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9d584b84d7b882a6017b072b33475172" > SetParameters< / a > (< a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > );< / div >
< div class = "line" > < a name = "l00789" > < / a > < span class = "lineno" > 789< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a1dc177ee88f0a7ce2e46a032e5c3cf02" > ResetDecisionHeuristic< / a > ();< / div >
< div class = "line" > < a name = "l00790" > < / a > < span class = "lineno" > 790< / span >   < / div >
< div class = "line" > < a name = "l00791" > < / a > < span class = "lineno" > 791< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > bool< / span > use_obj = absl::Bernoulli(random, 1.0 / 4);< / div >
< div class = "line" > < a name = "l00792" > < / a > < span class = "lineno" > 792< / span >   < span class = "keywordflow" > if< / span > (use_obj) < a class = "code" href = "namespaceoperations__research_1_1sat.html#a40254eb00d4590a09d811fe94c727c2a" > UseObjectiveForSatAssignmentPreference< / a > (problem, solver);< / div >
< div class = "line" > < a name = "l00793" > < / a > < span class = "lineno" > 793< / span >   < / div >
< div class = "line" > < a name = "l00794" > < / a > < span class = "lineno" > 794< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > result = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a2b006481369eb4f4cb7f3037dfdd8404" > Solve< / a > ();< / div >
< div class = "line" > < a name = "l00795" > < / a > < span class = "lineno" > 795< / span >   < span class = "keywordflow" > if< / span > (result == < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ) {< / div >
< div class = "line" > < a name = "l00796" > < / a > < span class = "lineno" > 796< / span >   < span class = "comment" > // If the problem is INFEASIBLE after we over-constrained the objective,< / span > < / div >
< div class = "line" > < a name = "l00797" > < / a > < span class = "lineno" > 797< / span >   < span class = "comment" > // then we found an optimal solution, otherwise, even the decision problem< / span > < / div >
< div class = "line" > < a name = "l00798" > < / a > < span class = "lineno" > 798< / span >   < span class = "comment" > // is INFEASIBLE.< / span > < / div >
< div class = "line" > < a name = "l00799" > < / a > < span class = "lineno" > 799< / span >   < span class = "keywordflow" > if< / span > (best == < a class = "code" href = "namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18" > kCoefficientMax< / a > ) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00800" > < / a > < span class = "lineno" > 800< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00801" > < / a > < span class = "lineno" > 801< / span >   }< / div >
< div class = "line" > < a name = "l00802" > < / a > < span class = "lineno" > 802< / span >   < span class = "keywordflow" > if< / span > (result == < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > SatSolver::LIMIT_REACHED< / a > ) {< / div >
< div class = "line" > < a name = "l00803" > < / a > < span class = "lineno" > 803< / span >   < span class = "comment" > // We augment the number of conflict until we have one feasible solution.< / span > < / div >
< div class = "line" > < a name = "l00804" > < / a > < span class = "lineno" > 804< / span >   < span class = "keywordflow" > if< / span > (best == < a class = "code" href = "namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18" > kCoefficientMax< / a > ) ++max_number_of_conflicts;< / div >
< div class = "line" > < a name = "l00805" > < / a > < span class = "lineno" > 805< / span >   < span class = "keywordflow" > if< / span > (< a class = "code" href = "cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47" > time_limit< / a > .LimitReached()) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > SatSolver::LIMIT_REACHED< / a > ;< / div >
< div class = "line" > < a name = "l00806" > < / a > < span class = "lineno" > 806< / span >   < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l00807" > < / a > < span class = "lineno" > 807< / span >   }< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00808" > < / a > < span class = "lineno" > 808< / span >   < / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00809" > < / a > < span class = "lineno" > 809< / span >   < a class = "code" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (result, < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > );< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00810" > < / a > < span class = "lineno" > 810< / span >   std::vector< bool> candidate;< / div >
< div class = "line" > < a name = "l00811" > < / a > < span class = "lineno" > 811< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838" > ExtractAssignment< / a > (problem, *solver, & candidate);< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00812" > < / a > < span class = "lineno" > 812< / span >   < a class = "code" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (< a class = "code" href = "namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1" > IsAssignmentValid< / a > (problem, candidate));< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00813" > < / a > < span class = "lineno" > 813< / span >   < span class = "keyword" > const< / span > Coefficient objective = < a class = "code" href = "namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f" > ComputeObjectiveValue< / a > (problem, candidate);< / div >
< div class = "line" > < a name = "l00814" > < / a > < span class = "lineno" > 814< / span >   < span class = "keywordflow" > if< / span > (objective < best) {< / div >
< div class = "line" > < a name = "l00815" > < / a > < span class = "lineno" > 815< / span >   *solution = candidate;< / div >
< div class = "line" > < a name = "l00816" > < / a > < span class = "lineno" > 816< / span >   best = objective;< / div >
< div class = "line" > < a name = "l00817" > < / a > < span class = "lineno" > 817< / span >   logger.Log(CnfObjectiveLine(problem, objective));< / div >
< div class = "line" > < a name = "l00818" > < / a > < span class = "lineno" > 818< / span >   < / div >
< div class = "line" > < a name = "l00819" > < / a > < span class = "lineno" > 819< / span >   < span class = "comment" > // Overconstrain the objective.< / span > < / div >
< div class = "line" > < a name = "l00820" > < / a > < span class = "lineno" > 820< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
< div class = "line" > < a name = "l00821" > < / a > < span class = "lineno" > 821< / span >   < span class = "keywordflow" > if< / span > (!< a class = "code" href = "namespaceoperations__research_1_1sat.html#a07c4372fa55782d13edd24b86130e3ba" > AddObjectiveConstraint< / a > (problem, < span class = "keyword" > false< / span > , Coefficient(0), < span class = "keyword" > true< / span > ,< / div >
< div class = "line" > < a name = "l00822" > < / a > < span class = "lineno" > 822< / span >   objective - 1, solver)) {< / div >
< div class = "line" > < a name = "l00823" > < / a > < span class = "lineno" > 823< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00824" > < / a > < span class = "lineno" > 824< / span >   }< / div >
< div class = "line" > < a name = "l00825" > < / a > < span class = "lineno" > 825< / span >   }< / div >
< div class = "line" > < a name = "l00826" > < / a > < span class = "lineno" > 826< / span >   min_seen = < a class = "code" href = "alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37" > std::min< / a > (min_seen, objective);< / div >
< div class = "line" > < a name = "l00827" > < / a > < span class = "lineno" > 827< / span >   max_seen = < a class = "code" href = "alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a" > std::max< / a > (max_seen, objective);< / div >
< div class = "line" > < a name = "l00828" > < / a > < span class = "lineno" > 828< / span >   < / div >
< div class = "line" > < a name = "l00829" > < / a > < span class = "lineno" > 829< / span >   logger.Log(absl::StrCat(< / div >
< div class = "line" > < a name = "l00830" > < / a > < span class = "lineno" > 830< / span >   < span class = "stringliteral" > " c " < / span > , objective.value(), < span class = "stringliteral" > " [" < / span > , min_seen.value(), < span class = "stringliteral" > " , " < / span > , max_seen.value(),< / div >
< div class = "line" > < a name = "l00831" > < / a > < span class = "lineno" > 831< / span >   < span class = "stringliteral" > " ] objective_preference: " < / span > , use_obj ? < span class = "stringliteral" > " true" < / span > : < span class = "stringliteral" > " false" < / span > , < span class = "stringliteral" > " " < / span > ,< / div >
< div class = "line" > < a name = "l00832" > < / a > < span class = "lineno" > 832< / span >   < a class = "code" href = "namespaceoperations__research.html#a87d7aa58897e0042898d1c2207deda18" > ProtobufShortDebugString< / a > (< a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > )));< / div >
< div class = "line" > < a name = "l00833" > < / a > < span class = "lineno" > 833< / span >   }< / div >
< div class = "line" > < a name = "l00834" > < / a > < span class = "lineno" > 834< / span >   < / div >
< div class = "line" > < a name = "l00835" > < / a > < span class = "lineno" > 835< / span >   < span class = "comment" > // Retore the initial parameter (with an updated time limit).< / span > < / div >
< div class = "line" > < a name = "l00836" > < / a > < span class = "lineno" > 836< / span >   < a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > = initial_parameters;< / div >
< div class = "line" > < a name = "l00837" > < / a > < span class = "lineno" > 837< / span >   < a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > .set_max_time_in_seconds(< a class = "code" href = "cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47" > time_limit< / a > .GetTimeLeft());< / div >
< div class = "line" > < a name = "l00838" > < / a > < span class = "lineno" > 838< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9d584b84d7b882a6017b072b33475172" > SetParameters< / a > (< a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > );< / div >
< div class = "line" > < a name = "l00839" > < / a > < span class = "lineno" > 839< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > SatSolver::LIMIT_REACHED< / a > ;< / div >
< div class = "line" > < a name = "l00840" > < / a > < span class = "lineno" > 840< / span >   }< / div >
< div class = "line" > < a name = "l00841" > < / a > < span class = "lineno" > 841< / span >   < / div >
< div class = "line" > < a name = "l00842" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a5cafa03de29acf965c3fc23dfa7eba0a" > 842< / a > < / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > < a class = "code" href = "namespaceoperations__research_1_1sat.html#a5cafa03de29acf965c3fc23dfa7eba0a" > SolveWithLinearScan< / a > (< a class = "code" href = "namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238" > LogBehavior< / a > log,< / div >
< div class = "line" > < a name = "l00843" > < / a > < span class = "lineno" > 843< / span >   < span class = "keyword" > const< / span > LinearBooleanProblem& problem,< / div >
< div class = "line" > < a name = "l00844" > < / a > < span class = "lineno" > 844< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > * solver,< / div >
< div class = "line" > < a name = "l00845" > < / a > < span class = "lineno" > 845< / span >   std::vector< bool> * solution) {< / div >
< div class = "line" > < a name = "l00846" > < / a > < span class = "lineno" > 846< / span >   Logger logger(log);< / div >
< div class = "line" > < a name = "l00847" > < / a > < span class = "lineno" > 847< / span >   < / div >
< div class = "line" > < a name = "l00848" > < / a > < span class = "lineno" > 848< / span >   < span class = "comment" > // This has a big positive impact on most problems.< / span > < / div >
< div class = "line" > < a name = "l00849" > < / a > < span class = "lineno" > 849< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#a40254eb00d4590a09d811fe94c727c2a" > UseObjectiveForSatAssignmentPreference< / a > (problem, solver);< / div >
< div class = "line" > < a name = "l00850" > < / a > < span class = "lineno" > 850< / span >   < / div >
< div class = "line" > < a name = "l00851" > < / a > < span class = "lineno" > 851< / span >   Coefficient objective = < a class = "code" href = "namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18" > kCoefficientMax< / a > ;< / div >
< div class = "line" > < a name = "l00852" > < / a > < span class = "lineno" > 852< / span >   < span class = "keywordflow" > if< / span > (!solution-> empty()) {< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00853" > < / a > < span class = "lineno" > 853< / span >   < a class = "code" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (< a class = "code" href = "namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1" > IsAssignmentValid< / a > (problem, *solution));< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00854" > < / a > < span class = "lineno" > 854< / span >   objective = < a class = "code" href = "namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f" > ComputeObjectiveValue< / a > (problem, *solution);< / div >
< div class = "line" > < a name = "l00855" > < / a > < span class = "lineno" > 855< / span >   }< / div >
< div class = "line" > < a name = "l00856" > < / a > < span class = "lineno" > 856< / span >   < span class = "keywordflow" > while< / span > (< span class = "keyword" > true< / span > ) {< / div >
< div class = "line" > < a name = "l00857" > < / a > < span class = "lineno" > 857< / span >   < span class = "keywordflow" > if< / span > (objective != < a class = "code" href = "namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18" > kCoefficientMax< / a > ) {< / div >
< div class = "line" > < a name = "l00858" > < / a > < span class = "lineno" > 858< / span >   < span class = "comment" > // Over constrain the objective.< / span > < / div >
< div class = "line" > < a name = "l00859" > < / a > < span class = "lineno" > 859< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
< div class = "line" > < a name = "l00860" > < / a > < span class = "lineno" > 860< / span >   < span class = "keywordflow" > if< / span > (!< a class = "code" href = "namespaceoperations__research_1_1sat.html#a07c4372fa55782d13edd24b86130e3ba" > AddObjectiveConstraint< / a > (problem, < span class = "keyword" > false< / span > , Coefficient(0), < span class = "keyword" > true< / span > ,< / div >
< div class = "line" > < a name = "l00861" > < / a > < span class = "lineno" > 861< / span >   objective - 1, solver)) {< / div >
< div class = "line" > < a name = "l00862" > < / a > < span class = "lineno" > 862< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00863" > < / a > < span class = "lineno" > 863< / span >   }< / div >
< div class = "line" > < a name = "l00864" > < / a > < span class = "lineno" > 864< / span >   }< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00865" > < / a > < span class = "lineno" > 865< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00866" > < / a > < span class = "lineno" > 866< / span >   < span class = "comment" > // Solve the problem.< / span > < / div >
< div class = "line" > < a name = "l00867" > < / a > < span class = "lineno" > 867< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > result = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a2b006481369eb4f4cb7f3037dfdd8404" > Solve< / a > ();< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00868" > < / a > < span class = "lineno" > 868< / span >   < a class = "code" href = "base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb" > CHECK_NE< / a > (result, < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885" > SatSolver::ASSUMPTIONS_UNSAT< / a > );< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00869" > < / a > < span class = "lineno" > 869< / span >   < span class = "keywordflow" > if< / span > (result == < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ) {< / div >
< div class = "line" > < a name = "l00870" > < / a > < span class = "lineno" > 870< / span >   < span class = "keywordflow" > if< / span > (objective == < a class = "code" href = "namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18" > kCoefficientMax< / a > ) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00871" > < / a > < span class = "lineno" > 871< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00872" > < / a > < span class = "lineno" > 872< / span >   }< / div >
< div class = "line" > < a name = "l00873" > < / a > < span class = "lineno" > 873< / span >   < span class = "keywordflow" > if< / span > (result == < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > SatSolver::LIMIT_REACHED< / a > ) {< / div >
< div class = "line" > < a name = "l00874" > < / a > < span class = "lineno" > 874< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > SatSolver::LIMIT_REACHED< / a > ;< / div >
< div class = "line" > < a name = "l00875" > < / a > < span class = "lineno" > 875< / span >   }< / div >
< div class = "line" > < a name = "l00876" > < / a > < span class = "lineno" > 876< / span >   < / div >
< div class = "line" > < a name = "l00877" > < / a > < span class = "lineno" > 877< / span >   < span class = "comment" > // Extract the new best solution.< / span > < / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00878" > < / a > < span class = "lineno" > 878< / span >   < a class = "code" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (result, < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > );< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00879" > < / a > < span class = "lineno" > 879< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838" > ExtractAssignment< / a > (problem, *solver, solution);< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00880" > < / a > < span class = "lineno" > 880< / span >   < a class = "code" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (< a class = "code" href = "namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1" > IsAssignmentValid< / a > (problem, *solution));< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00881" > < / a > < span class = "lineno" > 881< / span >   < span class = "keyword" > const< / span > Coefficient old_objective = objective;< / div >
< div class = "line" > < a name = "l00882" > < / a > < span class = "lineno" > 882< / span >   objective = < a class = "code" href = "namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f" > ComputeObjectiveValue< / a > (problem, *solution);< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00883" > < / a > < span class = "lineno" > 883< / span >   < a class = "code" href = "base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82" > CHECK_LT< / a > (objective, old_objective);< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00884" > < / a > < span class = "lineno" > 884< / span >   logger.Log(CnfObjectiveLine(problem, objective));< / div >
< div class = "line" > < a name = "l00885" > < / a > < span class = "lineno" > 885< / span >   }< / div >
< div class = "line" > < a name = "l00886" > < / a > < span class = "lineno" > 886< / span >   }< / div >
< div class = "line" > < a name = "l00887" > < / a > < span class = "lineno" > 887< / span >   < / div >
< div class = "line" > < a name = "l00888" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#ae471a0701f750ca0c32a3fe8828f04f2" > 888< / a > < / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > < a class = "code" href = "namespaceoperations__research_1_1sat.html#ae471a0701f750ca0c32a3fe8828f04f2" > SolveWithCardinalityEncoding< / a > (< / div >
< div class = "line" > < a name = "l00889" > < / a > < span class = "lineno" > 889< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238" > LogBehavior< / a > log, < span class = "keyword" > const< / span > LinearBooleanProblem& problem, < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > * solver,< / div >
< div class = "line" > < a name = "l00890" > < / a > < span class = "lineno" > 890< / span >   std::vector< bool> * solution) {< / div >
< div class = "line" > < a name = "l00891" > < / a > < span class = "lineno" > 891< / span >   Logger logger(log);< / div >
< div class = "line" > < a name = "l00892" > < / a > < span class = "lineno" > 892< / span >   std::deque< EncodingNode> repository;< / div >
< div class = "line" > < a name = "l00893" > < / a > < span class = "lineno" > 893< / span >   < / div >
< div class = "line" > < a name = "l00894" > < / a > < span class = "lineno" > 894< / span >   < span class = "comment" > // Create one initial node per variables with cost.< / span > < / div >
< div class = "line" > < a name = "l00895" > < / a > < span class = "lineno" > 895< / span >   Coefficient offset(0);< / div >
< div class = "line" > < a name = "l00896" > < / a > < span class = "lineno" > 896< / span >   std::vector< EncodingNode*> nodes =< / div >
< div class = "line" > < a name = "l00897" > < / a > < span class = "lineno" > 897< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#aea70549adb843d22d06bef763a0960c8" > CreateInitialEncodingNodes< / a > (problem.objective(), & offset, & repository);< / div >
< div class = "line" > < a name = "l00898" > < / a > < span class = "lineno" > 898< / span >   < / div >
< div class = "line" > < a name = "l00899" > < / a > < span class = "lineno" > 899< / span >   < span class = "comment" > // This algorithm only work with weights of the same magnitude.< / span > < / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00900" > < / a > < span class = "lineno" > 900< / span >   < a class = "code" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (!nodes.empty());< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00901" > < / a > < span class = "lineno" > 901< / span >   < span class = "keyword" > const< / span > Coefficient reference = nodes.front()-> weight();< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00902" > < / a > < span class = "lineno" > 902< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_encoding_node.html" > EncodingNode< / a > * n : nodes) < a class = "code" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (n-> weight(), reference);< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00903" > < / a > < span class = "lineno" > 903< / span >   < / div >
< div class = "line" > < a name = "l00904" > < / a > < span class = "lineno" > 904< / span >   < span class = "comment" > // Initialize the current objective.< / span > < / div >
< div class = "line" > < a name = "l00905" > < / a > < span class = "lineno" > 905< / span >   Coefficient objective = < a class = "code" href = "namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18" > kCoefficientMax< / a > ;< / div >
< div class = "line" > < a name = "l00906" > < / a > < span class = "lineno" > 906< / span >   Coefficient upper_bound = < a class = "code" href = "namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18" > kCoefficientMax< / a > ;< / div >
< div class = "line" > < a name = "l00907" > < / a > < span class = "lineno" > 907< / span >   < span class = "keywordflow" > if< / span > (!solution-> empty()) {< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00908" > < / a > < span class = "lineno" > 908< / span >   < a class = "code" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (< a class = "code" href = "namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1" > IsAssignmentValid< / a > (problem, *solution));< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00909" > < / a > < span class = "lineno" > 909< / span >   objective = < a class = "code" href = "namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f" > ComputeObjectiveValue< / a > (problem, *solution);< / div >
< div class = "line" > < a name = "l00910" > < / a > < span class = "lineno" > 910< / span >   upper_bound = objective + offset;< / div >
< div class = "line" > < a name = "l00911" > < / a > < span class = "lineno" > 911< / span >   }< / div >
< div class = "line" > < a name = "l00912" > < / a > < span class = "lineno" > 912< / span >   < / div >
< div class = "line" > < a name = "l00913" > < / a > < span class = "lineno" > 913< / span >   < span class = "comment" > // Print the number of variables with a non-zero cost.< / span > < / div >
< div class = "line" > < a name = "l00914" > < / a > < span class = "lineno" > 914< / span >   logger.Log(absl::StrFormat(< span class = "stringliteral" > " c #weights:%u #vars:%d #constraints:%d" < / span > ,< / div >
< div class = "line" > < a name = "l00915" > < / a > < span class = "lineno" > 915< / span >   nodes.size(), problem.num_variables(),< / div >
< div class = "line" > < a name = "l00916" > < / a > < span class = "lineno" > 916< / span >   problem.constraints_size()));< / div >
< div class = "line" > < a name = "l00917" > < / a > < span class = "lineno" > 917< / span >   < / div >
< div class = "line" > < a name = "l00918" > < / a > < span class = "lineno" > 918< / span >   < span class = "comment" > // Create the sorter network.< / span > < / div >
< div class = "line" > < a name = "l00919" > < / a > < span class = "lineno" > 919< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
< div class = "line" > < a name = "l00920" > < / a > < span class = "lineno" > 920< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_encoding_node.html" > EncodingNode< / a > * root =< / div >
< div class = "line" > < a name = "l00921" > < / a > < span class = "lineno" > 921< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#a29ff75f2188e0ac1c58fa4b0cf793a00" > MergeAllNodesWithDeque< / a > (upper_bound, nodes, solver, & repository);< / div >
< div class = "line" > < a name = "l00922" > < / a > < span class = "lineno" > 922< / span >   logger.Log(absl::StrFormat(< span class = "stringliteral" > " c encoding depth:%d" < / span > , root-> < a class = "code" href = "classoperations__research_1_1sat_1_1_encoding_node.html#a6fdd73f8011695b97659f2bea29325cb" > depth< / a > ()));< / div >
< div class = "line" > < a name = "l00923" > < / a > < span class = "lineno" > 923< / span >   < / div >
< div class = "line" > < a name = "l00924" > < / a > < span class = "lineno" > 924< / span >   < span class = "keywordflow" > while< / span > (< span class = "keyword" > true< / span > ) {< / div >
< div class = "line" > < a name = "l00925" > < / a > < span class = "lineno" > 925< / span >   < span class = "keywordflow" > if< / span > (objective != < a class = "code" href = "namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18" > kCoefficientMax< / a > ) {< / div >
< div class = "line" > < a name = "l00926" > < / a > < span class = "lineno" > 926< / span >   < span class = "comment" > // Over constrain the objective by fixing the variable index - 1 of the< / span > < / div >
< div class = "line" > < a name = "l00927" > < / a > < span class = "lineno" > 927< / span >   < span class = "comment" > // root node to 0.< / span > < / div >
< div class = "line" > < a name = "l00928" > < / a > < span class = "lineno" > 928< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > = offset.value() + objective.value();< / div >
< div class = "line" > < a name = "l00929" > < / a > < span class = "lineno" > 929< / span >   < span class = "keywordflow" > if< / span > (< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > == 0) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00930" > < / a > < span class = "lineno" > 930< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
< div class = "line" > < a name = "l00931" > < / a > < span class = "lineno" > 931< / span >   < span class = "keywordflow" > if< / span > (!solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9" > AddUnitClause< / a > (root-> < a class = "code" href = "classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198" > literal< / a > (< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > - 1).< a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644" > Negated< / a > ())) {< / div >
< div class = "line" > < a name = "l00932" > < / a > < span class = "lineno" > 932< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00933" > < / a > < span class = "lineno" > 933< / span >   }< / div >
< div class = "line" > < a name = "l00934" > < / a > < span class = "lineno" > 934< / span >   }< / div >
< div class = "line" > < a name = "l00935" > < / a > < span class = "lineno" > 935< / span >   < / div >
< div class = "line" > < a name = "l00936" > < / a > < span class = "lineno" > 936< / span >   < span class = "comment" > // Solve the problem.< / span > < / div >
< div class = "line" > < a name = "l00937" > < / a > < span class = "lineno" > 937< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > result = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a2b006481369eb4f4cb7f3037dfdd8404" > Solve< / a > ();< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00938" > < / a > < span class = "lineno" > 938< / span >   < a class = "code" href = "base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb" > CHECK_NE< / a > (result, < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885" > SatSolver::ASSUMPTIONS_UNSAT< / a > );< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00939" > < / a > < span class = "lineno" > 939< / span >   < span class = "keywordflow" > if< / span > (result == < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ) {< / div >
< div class = "line" > < a name = "l00940" > < / a > < span class = "lineno" > 940< / span >   < span class = "keywordflow" > if< / span > (objective == < a class = "code" href = "namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18" > kCoefficientMax< / a > ) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00941" > < / a > < span class = "lineno" > 941< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00942" > < / a > < span class = "lineno" > 942< / span >   }< / div >
< div class = "line" > < a name = "l00943" > < / a > < span class = "lineno" > 943< / span >   < span class = "keywordflow" > if< / span > (result == < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > SatSolver::LIMIT_REACHED< / a > ) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > SatSolver::LIMIT_REACHED< / a > ;< / div >
< div class = "line" > < a name = "l00944" > < / a > < span class = "lineno" > 944< / span >   < / div >
< div class = "line" > < a name = "l00945" > < / a > < span class = "lineno" > 945< / span >   < span class = "comment" > // Extract the new best solution.< / span > < / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00946" > < / a > < span class = "lineno" > 946< / span >   < a class = "code" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (result, < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > );< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00947" > < / a > < span class = "lineno" > 947< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838" > ExtractAssignment< / a > (problem, *solver, solution);< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00948" > < / a > < span class = "lineno" > 948< / span >   < a class = "code" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (< a class = "code" href = "namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1" > IsAssignmentValid< / a > (problem, *solution));< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00949" > < / a > < span class = "lineno" > 949< / span >   < span class = "keyword" > const< / span > Coefficient old_objective = objective;< / div >
< div class = "line" > < a name = "l00950" > < / a > < span class = "lineno" > 950< / span >   objective = < a class = "code" href = "namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f" > ComputeObjectiveValue< / a > (problem, *solution);< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00951" > < / a > < span class = "lineno" > 951< / span >   < a class = "code" href = "base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82" > CHECK_LT< / a > (objective, old_objective);< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00952" > < / a > < span class = "lineno" > 952< / span >   logger.Log(CnfObjectiveLine(problem, objective));< / div >
< div class = "line" > < a name = "l00953" > < / a > < span class = "lineno" > 953< / span >   }< / div >
< div class = "line" > < a name = "l00954" > < / a > < span class = "lineno" > 954< / span >   }< / div >
< div class = "line" > < a name = "l00955" > < / a > < span class = "lineno" > 955< / span >   < / div >
< div class = "line" > < a name = "l00956" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a1b36a95b81f69a73d04b1b42fd40c4db" > 956< / a > < / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > < a class = "code" href = "namespaceoperations__research_1_1sat.html#a1b36a95b81f69a73d04b1b42fd40c4db" > SolveWithCardinalityEncodingAndCore< / a > (< / div >
< div class = "line" > < a name = "l00957" > < / a > < span class = "lineno" > 957< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238" > LogBehavior< / a > log, < span class = "keyword" > const< / span > LinearBooleanProblem& problem, < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > * solver,< / div >
< div class = "line" > < a name = "l00958" > < / a > < span class = "lineno" > 958< / span >   std::vector< bool> * solution) {< / div >
< div class = "line" > < a name = "l00959" > < / a > < span class = "lineno" > 959< / span >   Logger logger(log);< / div >
< div class = "line" > < a name = "l00960" > < / a > < span class = "lineno" > 960< / span >   SatParameters < a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9" > parameters< / a > ();< / div >
< div class = "line" > < a name = "l00961" > < / a > < span class = "lineno" > 961< / span >   < / div >
< div class = "line" > < a name = "l00962" > < / a > < span class = "lineno" > 962< / span >   < span class = "comment" > // Create one initial nodes per variables with cost.< / span > < / div >
< div class = "line" > < a name = "l00963" > < / a > < span class = "lineno" > 963< / span >   Coefficient offset(0);< / div >
< div class = "line" > < a name = "l00964" > < / a > < span class = "lineno" > 964< / span >   std::deque< EncodingNode> repository;< / div >
< div class = "line" > < a name = "l00965" > < / a > < span class = "lineno" > 965< / span >   std::vector< EncodingNode*> nodes =< / div >
< div class = "line" > < a name = "l00966" > < / a > < span class = "lineno" > 966< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#aea70549adb843d22d06bef763a0960c8" > CreateInitialEncodingNodes< / a > (problem.objective(), & offset, & repository);< / div >
< div class = "line" > < a name = "l00967" > < / a > < span class = "lineno" > 967< / span >   < / div >
< div class = "line" > < a name = "l00968" > < / a > < span class = "lineno" > 968< / span >   < span class = "comment" > // Initialize the bounds.< / span > < / div >
< div class = "line" > < a name = "l00969" > < / a > < span class = "lineno" > 969< / span >   < span class = "comment" > // This is in term of number of variables not at their minimal value.< / span > < / div >
< div class = "line" > < a name = "l00970" > < / a > < span class = "lineno" > 970< / span >   Coefficient lower_bound(0);< / div >
< div class = "line" > < a name = "l00971" > < / a > < span class = "lineno" > 971< / span >   Coefficient upper_bound(< a class = "code" href = "integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719" > kint64max< / a > );< / div >
< div class = "line" > < a name = "l00972" > < / a > < span class = "lineno" > 972< / span >   < span class = "keywordflow" > if< / span > (!solution-> empty()) {< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l00973" > < / a > < span class = "lineno" > 973< / span >   < a class = "code" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (< a class = "code" href = "namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1" > IsAssignmentValid< / a > (problem, *solution));< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l00974" > < / a > < span class = "lineno" > 974< / span >   upper_bound = < a class = "code" href = "namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f" > ComputeObjectiveValue< / a > (problem, *solution) + offset;< / div >
< div class = "line" > < a name = "l00975" > < / a > < span class = "lineno" > 975< / span >   }< / div >
< div class = "line" > < a name = "l00976" > < / a > < span class = "lineno" > 976< / span >   < / div >
< div class = "line" > < a name = "l00977" > < / a > < span class = "lineno" > 977< / span >   < span class = "comment" > // Print the number of variables with a non-zero cost.< / span > < / div >
< div class = "line" > < a name = "l00978" > < / a > < span class = "lineno" > 978< / span >   logger.Log(absl::StrFormat(< span class = "stringliteral" > " c #weights:%u #vars:%d #constraints:%d" < / span > ,< / div >
< div class = "line" > < a name = "l00979" > < / a > < span class = "lineno" > 979< / span >   nodes.size(), problem.num_variables(),< / div >
< div class = "line" > < a name = "l00980" > < / a > < span class = "lineno" > 980< / span >   problem.constraints_size()));< / div >
< div class = "line" > < a name = "l00981" > < / a > < span class = "lineno" > 981< / span >   < / div >
< div class = "line" > < a name = "l00982" > < / a > < span class = "lineno" > 982< / span >   < span class = "comment" > // This is used by the " stratified" approach.< / span > < / div >
< div class = "line" > < a name = "l00983" > < / a > < span class = "lineno" > 983< / span >   Coefficient stratified_lower_bound(0);< / div >
< div class = "line" > < a name = "l00984" > < / a > < span class = "lineno" > 984< / span >   < span class = "keywordflow" > if< / span > (< a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > .max_sat_stratification() ==< / div >
< div class = "line" > < a name = "l00985" > < / a > < span class = "lineno" > 985< / span >   SatParameters::STRATIFICATION_DESCENT) {< / div >
< div class = "line" > < a name = "l00986" > < / a > < span class = "lineno" > 986< / span >   < span class = "comment" > // In this case, we initialize it to the maximum assumption weights.< / span > < / div >
< div class = "line" > < a name = "l00987" > < / a > < span class = "lineno" > 987< / span >   < span class = "keywordflow" > for< / span > (< a class = "code" href = "classoperations__research_1_1sat_1_1_encoding_node.html" > EncodingNode< / a > * n : nodes) {< / div >
< div class = "line" > < a name = "l00988" > < / a > < span class = "lineno" > 988< / span >   stratified_lower_bound = < a class = "code" href = "alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a" > std::max< / a > (stratified_lower_bound, n-> weight());< / div >
< div class = "line" > < a name = "l00989" > < / a > < span class = "lineno" > 989< / span >   }< / div >
< div class = "line" > < a name = "l00990" > < / a > < span class = "lineno" > 990< / span >   }< / div >
< div class = "line" > < a name = "l00991" > < / a > < span class = "lineno" > 991< / span >   < / div >
< div class = "line" > < a name = "l00992" > < / a > < span class = "lineno" > 992< / span >   < span class = "comment" > // Start the algorithm.< / span > < / div >
< div class = "line" > < a name = "l00993" > < / a > < span class = "lineno" > 993< / span >   < span class = "keywordtype" > int< / span > max_depth = 0;< / div >
< div class = "line" > < a name = "l00994" > < / a > < span class = "lineno" > 994< / span >   std::string previous_core_info = < span class = "stringliteral" > " " < / span > ;< / div >
< div class = "line" > < a name = "l00995" > < / a > < span class = "lineno" > 995< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > iter = 0;; ++iter) {< / div >
< div class = "line" > < a name = "l00996" > < / a > < span class = "lineno" > 996< / span >   < span class = "keyword" > const< / span > std::vector< Literal> assumptions = < a class = "code" href = "namespaceoperations__research_1_1sat.html#a3c7b9fb850d243d90ea59790db13a676" > ReduceNodesAndExtractAssumptions< / a > (< / div >
< div class = "line" > < a name = "l00997" > < / a > < span class = "lineno" > 997< / span >   upper_bound, stratified_lower_bound, & lower_bound, & nodes, solver);< / div >
< div class = "line" > < a name = "l00998" > < / a > < span class = "lineno" > 998< / span >   < span class = "keywordflow" > if< / span > (assumptions.empty()) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l00999" > < / a > < span class = "lineno" > 999< / span >   < / div >
< div class = "line" > < a name = "l01000" > < / a > < span class = "lineno" > 1000< / span >   < span class = "comment" > // Display the progress.< / span > < / div >
< div class = "line" > < a name = "l01001" > < / a > < span class = "lineno" > 1001< / span >   < span class = "keyword" > const< / span > std::string gap_string =< / div >
< div class = "line" > < a name = "l01002" > < / a > < span class = "lineno" > 1002< / span >   (upper_bound == < a class = "code" href = "namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18" > kCoefficientMax< / a > )< / div >
< div class = "line" > < a name = "l01003" > < / a > < span class = "lineno" > 1003< / span >   ? < span class = "stringliteral" > " " < / span > < / div >
< div class = "line" > < a name = "l01004" > < / a > < span class = "lineno" > 1004< / span >   : absl::StrFormat(< span class = "stringliteral" > " gap:%d" < / span > , (upper_bound - lower_bound).value());< / div >
< div class = "line" > < a name = "l01005" > < / a > < span class = "lineno" > 1005< / span >   logger.Log(< / div >
< div class = "line" > < a name = "l01006" > < / a > < span class = "lineno" > 1006< / span >   absl::StrFormat(< span class = "stringliteral" > " c iter:%d [%s] lb:%d%s assumptions:%u depth:%d" < / span > , iter,< / div >
< div class = "line" > < a name = "l01007" > < / a > < span class = "lineno" > 1007< / span >   previous_core_info,< / div >
< div class = "line" > < a name = "l01008" > < / a > < span class = "lineno" > 1008< / span >   lower_bound.value() - offset.value() +< / div >
< div class = "line" > < a name = "l01009" > < / a > < span class = "lineno" > 1009< / span >   < span class = "keyword" > static_cast< < / span > < a class = "code" href = "integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a" > int64< / a > < span class = "keyword" > > < / span > (problem.objective().offset()),< / div >
< div class = "line" > < a name = "l01010" > < / a > < span class = "lineno" > 1010< / span >   gap_string, nodes.size(), max_depth));< / div >
< div class = "line" > < a name = "l01011" > < / a > < span class = "lineno" > 1011< / span >   < / div >
< div class = "line" > < a name = "l01012" > < / a > < span class = "lineno" > 1012< / span >   < span class = "comment" > // Solve under the assumptions.< / span > < / div >
< div class = "line" > < a name = "l01013" > < / a > < span class = "lineno" > 1013< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > result =< / div >
< div class = "line" > < a name = "l01014" > < / a > < span class = "lineno" > 1014< / span >   solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a2abca6db0c780a4482d1ac9eb6365057" > ResetAndSolveWithGivenAssumptions< / a > (assumptions);< / div >
< div class = "line" > < a name = "l01015" > < / a > < span class = "lineno" > 1015< / span >   < span class = "keywordflow" > if< / span > (result == < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ) {< / div >
< div class = "line" > < a name = "l01016" > < / a > < span class = "lineno" > 1016< / span >   < span class = "comment" > // Extract the new solution and save it if it is the best found so far.< / span > < / div >
< div class = "line" > < a name = "l01017" > < / a > < span class = "lineno" > 1017< / span >   std::vector< bool> temp_solution;< / div >
< div class = "line" > < a name = "l01018" > < / a > < span class = "lineno" > 1018< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#ae787aad51dac94ee684cf971def30838" > ExtractAssignment< / a > (problem, *solver, & temp_solution);< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l01019" > < / a > < span class = "lineno" > 1019< / span >   < a class = "code" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (< a class = "code" href = "namespaceoperations__research_1_1sat.html#aab5216003fbe0c2f21e7433084d358e1" > IsAssignmentValid< / a > (problem, temp_solution));< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01020" > < / a > < span class = "lineno" > 1020< / span >   < span class = "keyword" > const< / span > Coefficient obj = < a class = "code" href = "namespaceoperations__research_1_1sat.html#abb66766a5d79e878ff67851bc55ca24f" > ComputeObjectiveValue< / a > (problem, temp_solution);< / div >
< div class = "line" > < a name = "l01021" > < / a > < span class = "lineno" > 1021< / span >   < span class = "keywordflow" > if< / span > (obj + offset < upper_bound) {< / div >
< div class = "line" > < a name = "l01022" > < / a > < span class = "lineno" > 1022< / span >   *solution = temp_solution;< / div >
< div class = "line" > < a name = "l01023" > < / a > < span class = "lineno" > 1023< / span >   logger.Log(CnfObjectiveLine(problem, obj));< / div >
< div class = "line" > < a name = "l01024" > < / a > < span class = "lineno" > 1024< / span >   upper_bound = obj + offset;< / div >
< div class = "line" > < a name = "l01025" > < / a > < span class = "lineno" > 1025< / span >   }< / div >
< div class = "line" > < a name = "l01026" > < / a > < span class = "lineno" > 1026< / span >   < / div >
< div class = "line" > < a name = "l01027" > < / a > < span class = "lineno" > 1027< / span >   < span class = "comment" > // If not all assumptions were taken, continue with a lower stratified< / span > < / div >
< div class = "line" > < a name = "l01028" > < / a > < span class = "lineno" > 1028< / span >   < span class = "comment" > // bound. Otherwise we have an optimal solution.< / span > < / div >
< div class = "line" > < a name = "l01029" > < / a > < span class = "lineno" > 1029< / span >   stratified_lower_bound =< / div >
< div class = "line" > < a name = "l01030" > < / a > < span class = "lineno" > 1030< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#ad6c9cfad7e2fa7ae1bbff31720394436" > MaxNodeWeightSmallerThan< / a > (nodes, stratified_lower_bound);< / div >
< div class = "line" > < a name = "l01031" > < / a > < span class = "lineno" > 1031< / span >   < span class = "keywordflow" > if< / span > (stratified_lower_bound > 0) < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01032" > < / a > < span class = "lineno" > 1032< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l01033" > < / a > < span class = "lineno" > 1033< / span >   }< / div >
< div class = "line" > < a name = "l01034" > < / a > < span class = "lineno" > 1034< / span >   < span class = "keywordflow" > if< / span > (result != < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885" > SatSolver::ASSUMPTIONS_UNSAT< / a > ) < span class = "keywordflow" > return< / span > result;< / div >
< div class = "line" > < a name = "l01035" > < / a > < span class = "lineno" > 1035< / span >   < / div >
< div class = "line" > < a name = "l01036" > < / a > < span class = "lineno" > 1036< / span >   < span class = "comment" > // We have a new core.< / span > < / div >
< div class = "line" > < a name = "l01037" > < / a > < span class = "lineno" > 1037< / span >   std::vector< Literal> core = solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#acfbfa9df611cb625ff79785c05784580" > GetLastIncompatibleDecisions< / a > ();< / div >
< div class = "line" > < a name = "l01038" > < / a > < span class = "lineno" > 1038< / span >   < span class = "keywordflow" > if< / span > (< a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > .minimize_core()) < a class = "code" href = "namespaceoperations__research_1_1sat.html#a6fb8349259fa849de0789a4ec58a8492" > MinimizeCore< / a > (solver, & core);< / div >
< div class = "line" > < a name = "l01039" > < / a > < span class = "lineno" > 1039< / span >   < / div >
< div class = "line" > < a name = "l01040" > < / a > < span class = "lineno" > 1040< / span >   < span class = "comment" > // Compute the min weight of all the nodes in the core.< / span > < / div >
< div class = "line" > < a name = "l01041" > < / a > < span class = "lineno" > 1041< / span >   < span class = "comment" > // The lower bound will be increased by that much.< / span > < / div >
< div class = "line" > < a name = "l01042" > < / a > < span class = "lineno" > 1042< / span >   < span class = "keyword" > const< / span > Coefficient min_weight = < a class = "code" href = "namespaceoperations__research_1_1sat.html#a1c9d74b9b207b6e5513334dd135a00a9" > ComputeCoreMinWeight< / a > (nodes, core);< / div >
< div class = "line" > < a name = "l01043" > < / a > < span class = "lineno" > 1043< / span >   previous_core_info =< / div >
< div class = "line" > < a name = "l01044" > < / a > < span class = "lineno" > 1044< / span >   absl::StrFormat(< span class = "stringliteral" > " core:%u mw:%d" < / span > , core.size(), min_weight.value());< / div >
< div class = "line" > < a name = "l01045" > < / a > < span class = "lineno" > 1045< / span >   < / div >
< div class = "line" > < a name = "l01046" > < / a > < span class = "lineno" > 1046< / span >   < span class = "comment" > // Increase stratified_lower_bound according to the parameters.< / span > < / div >
< div class = "line" > < a name = "l01047" > < / a > < span class = "lineno" > 1047< / span >   < span class = "keywordflow" > if< / span > (stratified_lower_bound < min_weight & & < / div >
< div class = "line" > < a name = "l01048" > < / a > < span class = "lineno" > 1048< / span >   < a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > .max_sat_stratification() ==< / div >
< div class = "line" > < a name = "l01049" > < / a > < span class = "lineno" > 1049< / span >   SatParameters::STRATIFICATION_ASCENT) {< / div >
< div class = "line" > < a name = "l01050" > < / a > < span class = "lineno" > 1050< / span >   stratified_lower_bound = min_weight;< / div >
< div class = "line" > < a name = "l01051" > < / a > < span class = "lineno" > 1051< / span >   }< / div >
< div class = "line" > < a name = "l01052" > < / a > < span class = "lineno" > 1052< / span >   < / div >
< div class = "line" > < a name = "l01053" > < / a > < span class = "lineno" > 1053< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#ab87119f7f6691eca8af4c552828fc4c4" > ProcessCore< / a > (core, min_weight, & repository, & nodes, solver);< / div >
< div class = "line" > < a name = "l01054" > < / a > < span class = "lineno" > 1054< / span >   max_depth = < a class = "code" href = "alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a" > std::max< / a > (max_depth, nodes.back()-> depth());< / div >
< div class = "line" > < a name = "l01055" > < / a > < span class = "lineno" > 1055< / span >   }< / div >
< div class = "line" > < a name = "l01056" > < / a > < span class = "lineno" > 1056< / span >   }< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l01057" > < / a > < span class = "lineno" > 1057< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01058" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#affe1669ec9e0e7cbd54e895bbbff43af" > 1058< / a > < / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > < a class = "code" href = "namespaceoperations__research_1_1sat.html#affe1669ec9e0e7cbd54e895bbbff43af" > MinimizeIntegerVariableWithLinearScanAndLazyEncoding< / a > (< / div >
< div class = "line" > < a name = "l01059" > < / a > < span class = "lineno" > 1059< / span >   IntegerVariable objective_var,< / div >
< div class = "line" > < a name = "l01060" > < / a > < span class = "lineno" > 1060< / span >   < span class = "keyword" > const< / span > std::function< < span class = "keywordtype" > void< / span > ()> & feasible_solution_observer, < a class = "code" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ) {< / div >
< div class = "line" > < a name = "l01061" > < / a > < span class = "lineno" > 1061< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > * sat_solver = < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > > ();< / div >
< div class = "line" > < a name = "l01062" > < / a > < span class = "lineno" > 1062< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html" > IntegerTrail< / a > * integer_trail = < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html" > IntegerTrail< / a > > ();< / div >
< div class = "line" > < a name = "l01063" > < / a > < span class = "lineno" > 1063< / span >   < span class = "keyword" > const< / span > SatParameters& < a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > = *(< a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< SatParameters> ());< / div >
< div class = "line" > < a name = "l01064" > < / a > < span class = "lineno" > 1064< / span >   < / div >
< div class = "line" > < a name = "l01065" > < / a > < span class = "lineno" > 1065< / span >   < span class = "comment" > // Simple linear scan algorithm to find the optimal.< / span > < / div >
< div class = "line" > < a name = "l01066" > < / a > < span class = "lineno" > 1066< / span >   < span class = "keywordflow" > while< / span > (< span class = "keyword" > true< / span > ) {< / div >
< div class = "line" > < a name = "l01067" > < / a > < span class = "lineno" > 1067< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > result = < a class = "code" href = "namespaceoperations__research_1_1sat.html#a8bea9a6a0de60c8fdab99ad7dfdf8498" > SolveIntegerProblem< / a > (< a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > );< / div >
< div class = "line" > < a name = "l01068" > < / a > < span class = "lineno" > 1068< / span >   < span class = "keywordflow" > if< / span > (result != < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ) < span class = "keywordflow" > return< / span > result;< / div >
< div class = "line" > < a name = "l01069" > < / a > < span class = "lineno" > 1069< / span >   < / div >
< div class = "line" > < a name = "l01070" > < / a > < span class = "lineno" > 1070< / span >   < span class = "comment" > // The objective is the current lower bound of the objective_var.< / span > < / div >
< div class = "line" > < a name = "l01071" > < / a > < span class = "lineno" > 1071< / span >   < span class = "keyword" > const< / span > IntegerValue objective = integer_trail-> LowerBound(objective_var);< / div >
< div class = "line" > < a name = "l01072" > < / a > < span class = "lineno" > 1072< / span >   < / div >
< div class = "line" > < a name = "l01073" > < / a > < span class = "lineno" > 1073< / span >   < span class = "comment" > // We have a solution!< / span > < / div >
< div class = "line" > < a name = "l01074" > < / a > < span class = "lineno" > 1074< / span >   < span class = "keywordflow" > if< / span > (feasible_solution_observer != < span class = "keyword" > nullptr< / span > ) {< / div >
< div class = "line" > < a name = "l01075" > < / a > < span class = "lineno" > 1075< / span >   feasible_solution_observer();< / div >
< div class = "line" > < a name = "l01076" > < / a > < span class = "lineno" > 1076< / span >   }< / div >
< div class = "line" > < a name = "l01077" > < / a > < span class = "lineno" > 1077< / span >   < span class = "keywordflow" > if< / span > (< a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > .stop_after_first_solution()) {< / div >
< div class = "line" > < a name = "l01078" > < / a > < span class = "lineno" > 1078< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > SatSolver::LIMIT_REACHED< / a > ;< / div >
< div class = "line" > < a name = "l01079" > < / a > < span class = "lineno" > 1079< / span >   }< / div >
< div class = "line" > < a name = "l01080" > < / a > < span class = "lineno" > 1080< / span >   < / div >
< div class = "line" > < a name = "l01081" > < / a > < span class = "lineno" > 1081< / span >   < span class = "comment" > // Restrict the objective.< / span > < / div >
< div class = "line" > < a name = "l01082" > < / a > < span class = "lineno" > 1082< / span >   sat_solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
< div class = "line" > < a name = "l01083" > < / a > < span class = "lineno" > 1083< / span >   < span class = "keywordflow" > if< / span > (!integer_trail-> Enqueue(< / div >
< div class = "line" > < a name = "l01084" > < / a > < span class = "lineno" > 1084< / span >   < a class = "code" href = "structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f" > IntegerLiteral::LowerOrEqual< / a > (objective_var, objective - 1), {},< / div >
< div class = "line" > < a name = "l01085" > < / a > < span class = "lineno" > 1085< / span >   {})) {< / div >
< div class = "line" > < a name = "l01086" > < / a > < span class = "lineno" > 1086< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l01087" > < / a > < span class = "lineno" > 1087< / span >   }< / div >
< div class = "line" > < a name = "l01088" > < / a > < span class = "lineno" > 1088< / span >   }< / div >
< div class = "line" > < a name = "l01089" > < / a > < span class = "lineno" > 1089< / span >   }< / div >
< div class = "line" > < a name = "l01090" > < / a > < span class = "lineno" > 1090< / span >   < / div >
< div class = "line" > < a name = "l01091" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a166c4d1be17bdfcad1986b1f72c49e52" > 1091< / a > < / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#a166c4d1be17bdfcad1986b1f72c49e52" > RestrictObjectiveDomainWithBinarySearch< / a > (< / div >
< div class = "line" > < a name = "l01092" > < / a > < span class = "lineno" > 1092< / span >   IntegerVariable objective_var,< / div >
< div class = "line" > < a name = "l01093" > < / a > < span class = "lineno" > 1093< / span >   < span class = "keyword" > const< / span > std::function< < span class = "keywordtype" > void< / span > ()> & feasible_solution_observer, < a class = "code" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ) {< / div >
< div class = "line" > < a name = "l01094" > < / a > < span class = "lineno" > 1094< / span >   < span class = "keyword" > const< / span > SatParameters old_params = *< a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< SatParameters> ();< / div >
< div class = "line" > < a name = "l01095" > < / a > < span class = "lineno" > 1095< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > * sat_solver = < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > > ();< / div >
< div class = "line" > < a name = "l01096" > < / a > < span class = "lineno" > 1096< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html" > IntegerTrail< / a > * integer_trail = < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html" > IntegerTrail< / a > > ();< / div >
< div class = "line" > < a name = "l01097" > < / a > < span class = "lineno" > 1097< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_encoder.html" > IntegerEncoder< / a > * integer_encoder = < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_encoder.html" > IntegerEncoder< / a > > ();< / div >
< div class = "line" > < a name = "l01098" > < / a > < span class = "lineno" > 1098< / span >   < / div >
< div class = "line" > < a name = "l01099" > < / a > < span class = "lineno" > 1099< / span >   < span class = "comment" > // Set the requested conflict limit.< / span > < / div >
< div class = "line" > < a name = "l01100" > < / a > < span class = "lineno" > 1100< / span >   {< / div >
< div class = "line" > < a name = "l01101" > < / a > < span class = "lineno" > 1101< / span >   SatParameters new_params = old_params;< / div >
< div class = "line" > < a name = "l01102" > < / a > < span class = "lineno" > 1102< / span >   new_params.set_max_number_of_conflicts(< / div >
< div class = "line" > < a name = "l01103" > < / a > < span class = "lineno" > 1103< / span >   old_params.binary_search_num_conflicts());< / div >
< div class = "line" > < a name = "l01104" > < / a > < span class = "lineno" > 1104< / span >   *< a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< SatParameters> () = new_params;< / div >
< div class = "line" > < a name = "l01105" > < / a > < span class = "lineno" > 1105< / span >   }< / div >
< div class = "line" > < a name = "l01106" > < / a > < span class = "lineno" > 1106< / span >   < / div >
< div class = "line" > < a name = "l01107" > < / a > < span class = "lineno" > 1107< / span >   < span class = "comment" > // The assumption (objective < = value) for values in< / span > < / div >
< div class = "line" > < a name = "l01108" > < / a > < span class = "lineno" > 1108< / span >   < span class = "comment" > // [unknown_min, unknown_max] reached the conflict limit.< / span > < / div >
< div class = "line" > < a name = "l01109" > < / a > < span class = "lineno" > 1109< / span >   < span class = "keywordtype" > bool< / span > loop = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l01110" > < / a > < span class = "lineno" > 1110< / span >   IntegerValue unknown_min = integer_trail-> UpperBound(objective_var);< / div >
< div class = "line" > < a name = "l01111" > < / a > < span class = "lineno" > 1111< / span >   IntegerValue unknown_max = integer_trail-> LowerBound(objective_var);< / div >
< div class = "line" > < a name = "l01112" > < / a > < span class = "lineno" > 1112< / span >   < span class = "keywordflow" > while< / span > (loop) {< / div >
< div class = "line" > < a name = "l01113" > < / a > < span class = "lineno" > 1113< / span >   sat_solver-> Backtrack(0);< / div >
< div class = "line" > < a name = "l01114" > < / a > < span class = "lineno" > 1114< / span >   < span class = "keyword" > const< / span > IntegerValue lb = integer_trail-> LowerBound(objective_var);< / div >
< div class = "line" > < a name = "l01115" > < / a > < span class = "lineno" > 1115< / span >   < span class = "keyword" > const< / span > IntegerValue ub = integer_trail-> UpperBound(objective_var);< / div >
< div class = "line" > < a name = "l01116" > < / a > < span class = "lineno" > 1116< / span >   unknown_min = < a class = "code" href = "alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37" > std::min< / a > (unknown_min, ub);< / div >
< div class = "line" > < a name = "l01117" > < / a > < span class = "lineno" > 1117< / span >   unknown_max = < a class = "code" href = "alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a" > std::max< / a > (unknown_max, lb);< / div >
< div class = "line" > < a name = "l01118" > < / a > < span class = "lineno" > 1118< / span >   < / div >
< div class = "line" > < a name = "l01119" > < / a > < span class = "lineno" > 1119< / span >   < span class = "comment" > // We first refine the lower bound and then the upper bound.< / span > < / div >
< div class = "line" > < a name = "l01120" > < / a > < span class = "lineno" > 1120< / span >   IntegerValue target;< / div >
< div class = "line" > < a name = "l01121" > < / a > < span class = "lineno" > 1121< / span >   < span class = "keywordflow" > if< / span > (lb < unknown_min) {< / div >
< div class = "line" > < a name = "l01122" > < / a > < span class = "lineno" > 1122< / span >   target = lb + (unknown_min - lb) / 2;< / div >
< div class = "line" > < a name = "l01123" > < / a > < span class = "lineno" > 1123< / span >   } < span class = "keywordflow" > else< / span > < span class = "keywordflow" > if< / span > (unknown_max < ub) {< / div >
< div class = "line" > < a name = "l01124" > < / a > < span class = "lineno" > 1124< / span >   target = ub - (ub - unknown_max) / 2;< / div >
< div class = "line" > < a name = "l01125" > < / a > < span class = "lineno" > 1125< / span >   } < span class = "keywordflow" > else< / span > {< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l01126" > < / a > < span class = "lineno" > 1126< / span >   < a class = "code" href = "base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927" > VLOG< / a > (1) < < < span class = "stringliteral" > " Binary-search, done." < / span > ;< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01127" > < / a > < span class = "lineno" > 1127< / span >   < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a name = "l01128" > < / a > < span class = "lineno" > 1128< / span >   }< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l01129" > < / a > < span class = "lineno" > 1129< / span >   < a class = "code" href = "base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927" > VLOG< / a > (1) < < < span class = "stringliteral" > " Binary-search, objective: [" < / span > < < lb < < < span class = "stringliteral" > " ," < / span > < < ub < < < span class = "stringliteral" > " ]" < / span > < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01130" > < / a > < span class = "lineno" > 1130< / span >   < < < span class = "stringliteral" > " tried: [" < / span > < < unknown_min < < < span class = "stringliteral" > " ," < / span > < < unknown_max < < < span class = "stringliteral" > " ]" < / span > < / div >
< div class = "line" > < a name = "l01131" > < / a > < span class = "lineno" > 1131< / span >   < < < span class = "stringliteral" > " target: obj< =" < / span > < < target;< / div >
< div class = "line" > < a name = "l01132" > < / a > < span class = "lineno" > 1132< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > result;< / div >
< div class = "line" > < a name = "l01133" > < / a > < span class = "lineno" > 1133< / span >   < span class = "keywordflow" > if< / span > (target < ub) {< / div >
< div class = "line" > < a name = "l01134" > < / a > < span class = "lineno" > 1134< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > assumption = integer_encoder-> GetOrCreateAssociatedLiteral(< / div >
< div class = "line" > < a name = "l01135" > < / a > < span class = "lineno" > 1135< / span >   < a class = "code" href = "structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f" > IntegerLiteral::LowerOrEqual< / a > (objective_var, target));< / div >
< div class = "line" > < a name = "l01136" > < / a > < span class = "lineno" > 1136< / span >   result = < a class = "code" href = "namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a" > ResetAndSolveIntegerProblem< / a > ({assumption}, < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > );< / div >
< div class = "line" > < a name = "l01137" > < / a > < span class = "lineno" > 1137< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l01138" > < / a > < span class = "lineno" > 1138< / span >   result = < a class = "code" href = "namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a" > ResetAndSolveIntegerProblem< / a > ({}, < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > );< / div >
< div class = "line" > < a name = "l01139" > < / a > < span class = "lineno" > 1139< / span >   }< / div >
< div class = "line" > < a name = "l01140" > < / a > < span class = "lineno" > 1140< / span >   < / div >
< div class = "line" > < a name = "l01141" > < / a > < span class = "lineno" > 1141< / span >   < span class = "keywordflow" > switch< / span > (result) {< / div >
< div class = "line" > < a name = "l01142" > < / a > < span class = "lineno" > 1142< / span >   < span class = "keywordflow" > case< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > : {< / div >
< div class = "line" > < a name = "l01143" > < / a > < span class = "lineno" > 1143< / span >   loop = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l01144" > < / a > < span class = "lineno" > 1144< / span >   < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a name = "l01145" > < / a > < span class = "lineno" > 1145< / span >   }< / div >
< div class = "line" > < a name = "l01146" > < / a > < span class = "lineno" > 1146< / span >   < span class = "keywordflow" > case< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885" > SatSolver::ASSUMPTIONS_UNSAT< / a > : {< / div >
< div class = "line" > < a name = "l01147" > < / a > < span class = "lineno" > 1147< / span >   < span class = "comment" > // Update the objective lower bound.< / span > < / div >
< div class = "line" > < a name = "l01148" > < / a > < span class = "lineno" > 1148< / span >   sat_solver-> Backtrack(0);< / div >
< div class = "line" > < a name = "l01149" > < / a > < span class = "lineno" > 1149< / span >   < span class = "keywordflow" > if< / span > (!integer_trail-> Enqueue(< / div >
< div class = "line" > < a name = "l01150" > < / a > < span class = "lineno" > 1150< / span >   < a class = "code" href = "structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63" > IntegerLiteral::GreaterOrEqual< / a > (objective_var, target + 1), {},< / div >
< div class = "line" > < a name = "l01151" > < / a > < span class = "lineno" > 1151< / span >   {})) {< / div >
< div class = "line" > < a name = "l01152" > < / a > < span class = "lineno" > 1152< / span >   loop = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l01153" > < / a > < span class = "lineno" > 1153< / span >   }< / div >
< div class = "line" > < a name = "l01154" > < / a > < span class = "lineno" > 1154< / span >   < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a name = "l01155" > < / a > < span class = "lineno" > 1155< / span >   }< / div >
< div class = "line" > < a name = "l01156" > < / a > < span class = "lineno" > 1156< / span >   < span class = "keywordflow" > case< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > : {< / div >
< div class = "line" > < a name = "l01157" > < / a > < span class = "lineno" > 1157< / span >   < span class = "comment" > // The objective is the current lower bound of the objective_var.< / span > < / div >
< div class = "line" > < a name = "l01158" > < / a > < span class = "lineno" > 1158< / span >   < span class = "keyword" > const< / span > IntegerValue objective = integer_trail-> LowerBound(objective_var);< / div >
< div class = "line" > < a name = "l01159" > < / a > < span class = "lineno" > 1159< / span >   < span class = "keywordflow" > if< / span > (feasible_solution_observer != < span class = "keyword" > nullptr< / span > ) {< / div >
< div class = "line" > < a name = "l01160" > < / a > < span class = "lineno" > 1160< / span >   feasible_solution_observer();< / div >
< div class = "line" > < a name = "l01161" > < / a > < span class = "lineno" > 1161< / span >   }< / div >
< div class = "line" > < a name = "l01162" > < / a > < span class = "lineno" > 1162< / span >   < / div >
< div class = "line" > < a name = "l01163" > < / a > < span class = "lineno" > 1163< / span >   < span class = "comment" > // We have a solution, restrict the objective upper bound to only look< / span > < / div >
< div class = "line" > < a name = "l01164" > < / a > < span class = "lineno" > 1164< / span >   < span class = "comment" > // for better ones now.< / span > < / div >
< div class = "line" > < a name = "l01165" > < / a > < span class = "lineno" > 1165< / span >   sat_solver-> Backtrack(0);< / div >
< div class = "line" > < a name = "l01166" > < / a > < span class = "lineno" > 1166< / span >   < span class = "keywordflow" > if< / span > (!integer_trail-> Enqueue(< / div >
< div class = "line" > < a name = "l01167" > < / a > < span class = "lineno" > 1167< / span >   < a class = "code" href = "structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f" > IntegerLiteral::LowerOrEqual< / a > (objective_var, objective - 1), {},< / div >
< div class = "line" > < a name = "l01168" > < / a > < span class = "lineno" > 1168< / span >   {})) {< / div >
< div class = "line" > < a name = "l01169" > < / a > < span class = "lineno" > 1169< / span >   loop = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l01170" > < / a > < span class = "lineno" > 1170< / span >   }< / div >
< div class = "line" > < a name = "l01171" > < / a > < span class = "lineno" > 1171< / span >   < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a name = "l01172" > < / a > < span class = "lineno" > 1172< / span >   }< / div >
< div class = "line" > < a name = "l01173" > < / a > < span class = "lineno" > 1173< / span >   < span class = "keywordflow" > case< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > SatSolver::LIMIT_REACHED< / a > : {< / div >
< div class = "line" > < a name = "l01174" > < / a > < span class = "lineno" > 1174< / span >   unknown_min = < a class = "code" href = "alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37" > std::min< / a > (target, unknown_min);< / div >
< div class = "line" > < a name = "l01175" > < / a > < span class = "lineno" > 1175< / span >   unknown_max = < a class = "code" href = "alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a" > std::max< / a > (target, unknown_max);< / div >
< div class = "line" > < a name = "l01176" > < / a > < span class = "lineno" > 1176< / span >   < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a name = "l01177" > < / a > < span class = "lineno" > 1177< / span >   }< / div >
< div class = "line" > < a name = "l01178" > < / a > < span class = "lineno" > 1178< / span >   }< / div >
< div class = "line" > < a name = "l01179" > < / a > < span class = "lineno" > 1179< / span >   }< / div >
< div class = "line" > < a name = "l01180" > < / a > < span class = "lineno" > 1180< / span >   < / div >
< div class = "line" > < a name = "l01181" > < / a > < span class = "lineno" > 1181< / span >   sat_solver-> Backtrack(0);< / div >
< div class = "line" > < a name = "l01182" > < / a > < span class = "lineno" > 1182< / span >   *< a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< SatParameters> () = old_params;< / div >
< div class = "line" > < a name = "l01183" > < / a > < span class = "lineno" > 1183< / span >   }< / div >
< div class = "line" > < a name = "l01184" > < / a > < span class = "lineno" > 1184< / span >   < / div >
< div class = "line" > < a name = "l01185" > < / a > < span class = "lineno" > 1185< / span >   < span class = "keyword" > namespace < / span > {< / div >
< div class = "line" > < a name = "l01186" > < / a > < span class = "lineno" > 1186< / span >   < / div >
< div class = "line" > < a name = "l01187" > < / a > < span class = "lineno" > 1187< / span >   < span class = "comment" > // If the given model is unsat under the given assumptions, returns one or more< / span > < / div >
< div class = "line" > < a name = "l01188" > < / a > < span class = "lineno" > 1188< / span >   < span class = "comment" > // non-overlapping set of assumptions, each set making the problem infeasible on< / span > < / div >
< div class = "line" > < a name = "l01189" > < / a > < span class = "lineno" > 1189< / span >   < span class = "comment" > // its own (the cores).< / span > < / div >
< div class = "line" > < a name = "l01190" > < / a > < span class = "lineno" > 1190< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l01191" > < / a > < span class = "lineno" > 1191< / span >   < span class = "comment" > // In presence of weights, we " generalize" the notions of disjoints core using< / span > < / div >
< div class = "line" > < a name = "l01192" > < / a > < span class = "lineno" > 1192< / span >   < span class = "comment" > // the WCE idea describe in " Weight-Aware Core Extraction in SAT-Based MaxSAT< / span > < / div >
< div class = "line" > < a name = "l01193" > < / a > < span class = "lineno" > 1193< / span >   < span class = "comment" > // solving" Jeremias Berg And Matti Jarvisalo.< / span > < / div >
< div class = "line" > < a name = "l01194" > < / a > < span class = "lineno" > 1194< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l01195" > < / a > < span class = "lineno" > 1195< / span >   < span class = "comment" > // The returned status can be either:< / span > < / div >
< div class = "line" > < a name = "l01196" > < / a > < span class = "lineno" > 1196< / span >   < span class = "comment" > // - ASSUMPTIONS_UNSAT if the set of returned core perfectly cover the given< / span > < / div >
< div class = "line" > < a name = "l01197" > < / a > < span class = "lineno" > 1197< / span >   < span class = "comment" > // assumptions, in this case, we don' t bother trying to find a SAT solution< / span > < / div >
< div class = "line" > < a name = "l01198" > < / a > < span class = "lineno" > 1198< / span >   < span class = "comment" > // with no assumptions.< / span > < / div >
< div class = "line" > < a name = "l01199" > < / a > < span class = "lineno" > 1199< / span >   < span class = "comment" > // - FEASIBLE if after finding zero or more core we have a solution.< / span > < / div >
< div class = "line" > < a name = "l01200" > < / a > < span class = "lineno" > 1200< / span >   < span class = "comment" > // - LIMIT_REACHED if we reached the time-limit before one of the two status< / span > < / div >
< div class = "line" > < a name = "l01201" > < / a > < span class = "lineno" > 1201< / span >   < span class = "comment" > // above could be decided.< / span > < / div >
< div class = "line" > < a name = "l01202" > < / a > < span class = "lineno" > 1202< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l01203" > < / a > < span class = "lineno" > 1203< / span >   < span class = "comment" > // TODO(user): There is many way to combine the WCE and stratification< / span > < / div >
< div class = "line" > < a name = "l01204" > < / a > < span class = "lineno" > 1204< / span >   < span class = "comment" > // heuristics. I didn' t had time to properly compare the different approach. See< / span > < / div >
< div class = "line" > < a name = "l01205" > < / a > < span class = "lineno" > 1205< / span >   < span class = "comment" > // the WCE papers for some ideas, but there is many more ways to try to find a< / span > < / div >
< div class = "line" > < a name = "l01206" > < / a > < span class = "lineno" > 1206< / span >   < span class = "comment" > // lot of core at once and try to minimize the minimum weight of each of the< / span > < / div >
< div class = "line" > < a name = "l01207" > < / a > < span class = "lineno" > 1207< / span >   < span class = "comment" > // cores.< / span > < / div >
< div class = "line" > < a name = "l01208" > < / a > < span class = "lineno" > 1208< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > FindCores(std::vector< Literal> assumptions,< / div >
< div class = "line" > < a name = "l01209" > < / a > < span class = "lineno" > 1209< / span >   std::vector< IntegerValue> assumption_weights,< / div >
< div class = "line" > < a name = "l01210" > < / a > < span class = "lineno" > 1210< / span >   IntegerValue stratified_threshold, Model* < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ,< / div >
< div class = "line" > < a name = "l01211" > < / a > < span class = "lineno" > 1211< / span >   std::vector< std::vector< Literal> > * cores) {< / div >
< div class = "line" > < a name = "l01212" > < / a > < span class = "lineno" > 1212< / span >   cores-> clear();< / div >
< div class = "line" > < a name = "l01213" > < / a > < span class = "lineno" > 1213< / span >   SatSolver* sat_solver = < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< SatSolver> ();< / div >
< div class = "line" > < a name = "l01214" > < / a > < span class = "lineno" > 1214< / span >   < a class = "code" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > * limit = < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > > ();< / div >
< div class = "line" > < a name = "l01215" > < / a > < span class = "lineno" > 1215< / span >   < span class = "keywordflow" > do< / span > {< / div >
< div class = "line" > < a name = "l01216" > < / a > < span class = "lineno" > 1216< / span >   < span class = "keywordflow" > if< / span > (limit-> LimitReached()) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > SatSolver::LIMIT_REACHED< / a > ;< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l01217" > < / a > < span class = "lineno" > 1217< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01218" > < / a > < span class = "lineno" > 1218< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > result =< / div >
< div class = "line" > < a name = "l01219" > < / a > < span class = "lineno" > 1219< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a" > ResetAndSolveIntegerProblem< / a > (assumptions, < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > );< / div >
< div class = "line" > < a name = "l01220" > < / a > < span class = "lineno" > 1220< / span >   < span class = "keywordflow" > if< / span > (result != < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885" > SatSolver::ASSUMPTIONS_UNSAT< / a > ) < span class = "keywordflow" > return< / span > result;< / div >
< div class = "line" > < a name = "l01221" > < / a > < span class = "lineno" > 1221< / span >   std::vector< Literal> core = sat_solver-> GetLastIncompatibleDecisions();< / div >
< div class = "line" > < a name = "l01222" > < / a > < span class = "lineno" > 1222< / span >   < span class = "keywordflow" > if< / span > (sat_solver-> parameters().minimize_core()) {< / div >
2021-02-26 14:48:18 +01:00
< div class = "line" > < a name = "l01223" > < / a > < span class = "lineno" > 1223< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#ab76a35e6ff810ad9ea8b58c7c11606cb" > MinimizeCoreWithPropagation< / a > (limit, sat_solver, & core);< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01224" > < / a > < span class = "lineno" > 1224< / span >   }< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l01225" > < / a > < span class = "lineno" > 1225< / span >   < a class = "code" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (!core.empty());< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01226" > < / a > < span class = "lineno" > 1226< / span >   cores-> push_back(core);< / div >
< div class = "line" > < a name = "l01227" > < / a > < span class = "lineno" > 1227< / span >   < span class = "keywordflow" > if< / span > (!sat_solver-> parameters().find_multiple_cores()) < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a name = "l01228" > < / a > < span class = "lineno" > 1228< / span >   < / div >
< div class = "line" > < a name = "l01229" > < / a > < span class = "lineno" > 1229< / span >   < span class = "comment" > // Recover the original indices of the assumptions that are part of the< / span > < / div >
< div class = "line" > < a name = "l01230" > < / a > < span class = "lineno" > 1230< / span >   < span class = "comment" > // core.< / span > < / div >
< div class = "line" > < a name = "l01231" > < / a > < span class = "lineno" > 1231< / span >   std::vector< int> indices;< / div >
< div class = "line" > < a name = "l01232" > < / a > < span class = "lineno" > 1232< / span >   {< / div >
< div class = "line" > < a name = "l01233" > < / a > < span class = "lineno" > 1233< / span >   std::set< Literal> temp(core.begin(), core.end());< / div >
< div class = "line" > < a name = "l01234" > < / a > < span class = "lineno" > 1234< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < assumptions.size(); ++i) {< / div >
< div class = "line" > < a name = "l01235" > < / a > < span class = "lineno" > 1235< / span >   < span class = "keywordflow" > if< / span > (< a class = "code" href = "namespacegtl.html#aae28e97bd1fa93cb0032642550da7455" > gtl::ContainsKey< / a > (temp, assumptions[i])) {< / div >
< div class = "line" > < a name = "l01236" > < / a > < span class = "lineno" > 1236< / span >   indices.push_back(i);< / div >
< div class = "line" > < a name = "l01237" > < / a > < span class = "lineno" > 1237< / span >   }< / div >
< div class = "line" > < a name = "l01238" > < / a > < span class = "lineno" > 1238< / span >   }< / div >
< div class = "line" > < a name = "l01239" > < / a > < span class = "lineno" > 1239< / span >   }< / div >
< div class = "line" > < a name = "l01240" > < / a > < span class = "lineno" > 1240< / span >   < / div >
< div class = "line" > < a name = "l01241" > < / a > < span class = "lineno" > 1241< / span >   < span class = "comment" > // Remove min_weight from the weights of all the assumptions in the core.< / span > < / div >
< div class = "line" > < a name = "l01242" > < / a > < span class = "lineno" > 1242< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l01243" > < / a > < span class = "lineno" > 1243< / span >   < span class = "comment" > // TODO(user): push right away the objective bound by that much? This should< / span > < / div >
< div class = "line" > < a name = "l01244" > < / a > < span class = "lineno" > 1244< / span >   < span class = "comment" > // be better in a multi-threading context as we can share more quickly the< / span > < / div >
< div class = "line" > < a name = "l01245" > < / a > < span class = "lineno" > 1245< / span >   < span class = "comment" > // better bound.< / span > < / div >
< div class = "line" > < a name = "l01246" > < / a > < span class = "lineno" > 1246< / span >   IntegerValue min_weight = assumption_weights[indices.front()];< / div >
< div class = "line" > < a name = "l01247" > < / a > < span class = "lineno" > 1247< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > i : indices) {< / div >
< div class = "line" > < a name = "l01248" > < / a > < span class = "lineno" > 1248< / span >   min_weight = < a class = "code" href = "alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37" > std::min< / a > (min_weight, assumption_weights[i]);< / div >
< div class = "line" > < a name = "l01249" > < / a > < span class = "lineno" > 1249< / span >   }< / div >
< div class = "line" > < a name = "l01250" > < / a > < span class = "lineno" > 1250< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > i : indices) {< / div >
< div class = "line" > < a name = "l01251" > < / a > < span class = "lineno" > 1251< / span >   assumption_weights[i] -= min_weight;< / div >
< div class = "line" > < a name = "l01252" > < / a > < span class = "lineno" > 1252< / span >   }< / div >
< div class = "line" > < a name = "l01253" > < / a > < span class = "lineno" > 1253< / span >   < / div >
< div class = "line" > < a name = "l01254" > < / a > < span class = "lineno" > 1254< / span >   < span class = "comment" > // Remove from assumptions all the one with a new weight smaller than the< / span > < / div >
< div class = "line" > < a name = "l01255" > < / a > < span class = "lineno" > 1255< / span >   < span class = "comment" > // current stratification threshold and see if we can find another core.< / span > < / div >
< div class = "line" > < a name = "l01256" > < / a > < span class = "lineno" > 1256< / span >   < span class = "keywordtype" > int< / span > new_size = 0;< / div >
< div class = "line" > < a name = "l01257" > < / a > < span class = "lineno" > 1257< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < assumptions.size(); ++i) {< / div >
< div class = "line" > < a name = "l01258" > < / a > < span class = "lineno" > 1258< / span >   < span class = "keywordflow" > if< / span > (assumption_weights[i] < stratified_threshold) < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01259" > < / a > < span class = "lineno" > 1259< / span >   assumptions[new_size] = assumptions[i];< / div >
< div class = "line" > < a name = "l01260" > < / a > < span class = "lineno" > 1260< / span >   assumption_weights[new_size] = assumption_weights[i];< / div >
< div class = "line" > < a name = "l01261" > < / a > < span class = "lineno" > 1261< / span >   ++new_size;< / div >
< div class = "line" > < a name = "l01262" > < / a > < span class = "lineno" > 1262< / span >   }< / div >
< div class = "line" > < a name = "l01263" > < / a > < span class = "lineno" > 1263< / span >   assumptions.resize(new_size);< / div >
< div class = "line" > < a name = "l01264" > < / a > < span class = "lineno" > 1264< / span >   assumption_weights.resize(new_size);< / div >
< div class = "line" > < a name = "l01265" > < / a > < span class = "lineno" > 1265< / span >   } < span class = "keywordflow" > while< / span > (!assumptions.empty());< / div >
< div class = "line" > < a name = "l01266" > < / a > < span class = "lineno" > 1266< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885" > SatSolver::ASSUMPTIONS_UNSAT< / a > ;< / div >
< div class = "line" > < a name = "l01267" > < / a > < span class = "lineno" > 1267< / span >   }< / div >
< div class = "line" > < a name = "l01268" > < / a > < span class = "lineno" > 1268< / span >   < / div >
< div class = "line" > < a name = "l01269" > < / a > < span class = "lineno" > 1269< / span >   < span class = "comment" > // Slightly different algo than FindCores() which aim to extract more cores, but< / span > < / div >
< div class = "line" > < a name = "l01270" > < / a > < span class = "lineno" > 1270< / span >   < span class = "comment" > // not necessarily non-overlaping ones.< / span > < / div >
< div class = "line" > < a name = "l01271" > < / a > < span class = "lineno" > 1271< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > FindMultipleCoresForMaxHs(< / div >
< div class = "line" > < a name = "l01272" > < / a > < span class = "lineno" > 1272< / span >   std::vector< Literal> assumptions, Model* < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ,< / div >
< div class = "line" > < a name = "l01273" > < / a > < span class = "lineno" > 1273< / span >   std::vector< std::vector< Literal> > * cores) {< / div >
< div class = "line" > < a name = "l01274" > < / a > < span class = "lineno" > 1274< / span >   cores-> clear();< / div >
< div class = "line" > < a name = "l01275" > < / a > < span class = "lineno" > 1275< / span >   SatSolver* sat_solver = < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< SatSolver> ();< / div >
2020-12-07 17:47:46 +01:00
< div class = "line" > < a name = "l01276" > < / a > < span class = "lineno" > 1276< / span >   TimeLimit* limit = < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< TimeLimit> ();< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01277" > < / a > < span class = "lineno" > 1277< / span >   < span class = "keywordflow" > do< / span > {< / div >
< div class = "line" > < a name = "l01278" > < / a > < span class = "lineno" > 1278< / span >   < span class = "keywordflow" > if< / span > (limit-> LimitReached()) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > SatSolver::LIMIT_REACHED< / a > ;< / div >
< div class = "line" > < a name = "l01279" > < / a > < span class = "lineno" > 1279< / span >   < / div >
< div class = "line" > < a name = "l01280" > < / a > < span class = "lineno" > 1280< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > result =< / div >
< div class = "line" > < a name = "l01281" > < / a > < span class = "lineno" > 1281< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a" > ResetAndSolveIntegerProblem< / a > (assumptions, < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > );< / div >
< div class = "line" > < a name = "l01282" > < / a > < span class = "lineno" > 1282< / span >   < span class = "keywordflow" > if< / span > (result != < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885" > SatSolver::ASSUMPTIONS_UNSAT< / a > ) < span class = "keywordflow" > return< / span > result;< / div >
< div class = "line" > < a name = "l01283" > < / a > < span class = "lineno" > 1283< / span >   std::vector< Literal> core = sat_solver-> GetLastIncompatibleDecisions();< / div >
< div class = "line" > < a name = "l01284" > < / a > < span class = "lineno" > 1284< / span >   < span class = "keywordflow" > if< / span > (sat_solver-> parameters().minimize_core()) {< / div >
2021-02-26 14:48:18 +01:00
< div class = "line" > < a name = "l01285" > < / a > < span class = "lineno" > 1285< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#ab76a35e6ff810ad9ea8b58c7c11606cb" > MinimizeCoreWithPropagation< / a > (limit, sat_solver, & core);< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01286" > < / a > < span class = "lineno" > 1286< / span >   }< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l01287" > < / a > < span class = "lineno" > 1287< / span >   < a class = "code" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (!core.empty());< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01288" > < / a > < span class = "lineno" > 1288< / span >   cores-> push_back(core);< / div >
< div class = "line" > < a name = "l01289" > < / a > < span class = "lineno" > 1289< / span >   < span class = "keywordflow" > if< / span > (!sat_solver-> parameters().find_multiple_cores()) < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a name = "l01290" > < / a > < span class = "lineno" > 1290< / span >   < / div >
< div class = "line" > < a name = "l01291" > < / a > < span class = "lineno" > 1291< / span >   < span class = "comment" > // Pick a random literal from the core and remove it from the set of< / span > < / div >
< div class = "line" > < a name = "l01292" > < / a > < span class = "lineno" > 1292< / span >   < span class = "comment" > // assumptions.< / span > < / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l01293" > < / a > < span class = "lineno" > 1293< / span >   < a class = "code" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (!core.empty());< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01294" > < / a > < span class = "lineno" > 1294< / span >   < span class = "keyword" > auto< / span > * random = < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< ModelRandomGenerator> ();< / div >
< div class = "line" > < a name = "l01295" > < / a > < span class = "lineno" > 1295< / span >   < span class = "keyword" > const< / span > Literal random_literal =< / div >
< div class = "line" > < a name = "l01296" > < / a > < span class = "lineno" > 1296< / span >   core[absl::Uniform< int> (*random, 0, core.size())];< / div >
< div class = "line" > < a name = "l01297" > < / a > < span class = "lineno" > 1297< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < assumptions.size(); ++i) {< / div >
< div class = "line" > < a name = "l01298" > < / a > < span class = "lineno" > 1298< / span >   < span class = "keywordflow" > if< / span > (assumptions[i] == random_literal) {< / div >
< div class = "line" > < a name = "l01299" > < / a > < span class = "lineno" > 1299< / span >   std::swap(assumptions[i], assumptions.back());< / div >
< div class = "line" > < a name = "l01300" > < / a > < span class = "lineno" > 1300< / span >   assumptions.pop_back();< / div >
< div class = "line" > < a name = "l01301" > < / a > < span class = "lineno" > 1301< / span >   < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a name = "l01302" > < / a > < span class = "lineno" > 1302< / span >   }< / div >
< div class = "line" > < a name = "l01303" > < / a > < span class = "lineno" > 1303< / span >   }< / div >
< div class = "line" > < a name = "l01304" > < / a > < span class = "lineno" > 1304< / span >   } < span class = "keywordflow" > while< / span > (!assumptions.empty());< / div >
< div class = "line" > < a name = "l01305" > < / a > < span class = "lineno" > 1305< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885" > SatSolver::ASSUMPTIONS_UNSAT< / a > ;< / div >
< div class = "line" > < a name = "l01306" > < / a > < span class = "lineno" > 1306< / span >   }< / div >
< div class = "line" > < a name = "l01307" > < / a > < span class = "lineno" > 1307< / span >   < / div >
< div class = "line" > < a name = "l01308" > < / a > < span class = "lineno" > 1308< / span >   } < span class = "comment" > // namespace< / span > < / div >
< div class = "line" > < a name = "l01309" > < / a > < span class = "lineno" > 1309< / span >   < / div >
< div class = "line" > < a name = "l01310" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_core_based_optimizer.html#a02a9dc1603fd32ca7d13e2db95316bb2" > 1310< / a > < / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_core_based_optimizer.html#a02a9dc1603fd32ca7d13e2db95316bb2" > CoreBasedOptimizer::CoreBasedOptimizer< / a > (< / div >
< div class = "line" > < a name = "l01311" > < / a > < span class = "lineno" > 1311< / span >   IntegerVariable objective_var,< / div >
< div class = "line" > < a name = "l01312" > < / a > < span class = "lineno" > 1312< / span >   < span class = "keyword" > const< / span > std::vector< IntegerVariable> & variables,< / div >
< div class = "line" > < a name = "l01313" > < / a > < span class = "lineno" > 1313< / span >   < span class = "keyword" > const< / span > std::vector< IntegerValue> & < a class = "code" href = "sat_2lp__utils_8cc.html#ab1734711414da2e668957d24a41b1ddf" > coefficients< / a > ,< / div >
< div class = "line" > < a name = "l01314" > < / a > < span class = "lineno" > 1314< / span >   std::function< < span class = "keywordtype" > void< / span > ()> feasible_solution_observer, < a class = "code" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > )< / div >
< div class = "line" > < a name = "l01315" > < / a > < span class = "lineno" > 1315< / span >   : parameters_(< a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< SatParameters> ()),< / div >
< div class = "line" > < a name = "l01316" > < / a > < span class = "lineno" > 1316< / span >   sat_solver_(< a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > > ()),< / div >
< div class = "line" > < a name = "l01317" > < / a > < span class = "lineno" > 1317< / span >   time_limit_(< a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > > ()),< / div >
< div class = "line" > < a name = "l01318" > < / a > < span class = "lineno" > 1318< / span >   integer_trail_(< a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html" > IntegerTrail< / a > > ()),< / div >
< div class = "line" > < a name = "l01319" > < / a > < span class = "lineno" > 1319< / span >   integer_encoder_(< a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_encoder.html" > IntegerEncoder< / a > > ()),< / div >
< div class = "line" > < a name = "l01320" > < / a > < span class = "lineno" > 1320< / span >   model_(< a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ),< / div >
< div class = "line" > < a name = "l01321" > < / a > < span class = "lineno" > 1321< / span >   objective_var_(objective_var),< / div >
< div class = "line" > < a name = "l01322" > < / a > < span class = "lineno" > 1322< / span >   feasible_solution_observer_(std::move(feasible_solution_observer)) {< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l01323" > < / a > < span class = "lineno" > 1323< / span >   < a class = "code" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (variables.size(), < a class = "code" href = "sat_2lp__utils_8cc.html#ab1734711414da2e668957d24a41b1ddf" > coefficients< / a > .size());< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01324" > < / a > < span class = "lineno" > 1324< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < variables.size(); ++i) {< / div >
< div class = "line" > < a name = "l01325" > < / a > < span class = "lineno" > 1325< / span >   < span class = "keywordflow" > if< / span > (< a class = "code" href = "sat_2lp__utils_8cc.html#ab1734711414da2e668957d24a41b1ddf" > coefficients< / a > [i] > 0) {< / div >
< div class = "line" > < a name = "l01326" > < / a > < span class = "lineno" > 1326< / span >   terms_.push_back({variables[i], < a class = "code" href = "sat_2lp__utils_8cc.html#ab1734711414da2e668957d24a41b1ddf" > coefficients< / a > [i]});< / div >
< div class = "line" > < a name = "l01327" > < / a > < span class = "lineno" > 1327< / span >   } < span class = "keywordflow" > else< / span > < span class = "keywordflow" > if< / span > (< a class = "code" href = "sat_2lp__utils_8cc.html#ab1734711414da2e668957d24a41b1ddf" > coefficients< / a > [i] < 0) {< / div >
< div class = "line" > < a name = "l01328" > < / a > < span class = "lineno" > 1328< / span >   terms_.push_back({< a class = "code" href = "namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22" > NegationOf< / a > (variables[i]), -< a class = "code" href = "sat_2lp__utils_8cc.html#ab1734711414da2e668957d24a41b1ddf" > coefficients< / a > [i]});< / div >
< div class = "line" > < a name = "l01329" > < / a > < span class = "lineno" > 1329< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l01330" > < / a > < span class = "lineno" > 1330< / span >   < span class = "keywordflow" > continue< / span > ; < span class = "comment" > // coefficients[i] == 0< / span > < / div >
< div class = "line" > < a name = "l01331" > < / a > < span class = "lineno" > 1331< / span >   }< / div >
< div class = "line" > < a name = "l01332" > < / a > < span class = "lineno" > 1332< / span >   terms_.back().depth = 0;< / div >
< div class = "line" > < a name = "l01333" > < / a > < span class = "lineno" > 1333< / span >   }< / div >
< div class = "line" > < a name = "l01334" > < / a > < span class = "lineno" > 1334< / span >   < / div >
< div class = "line" > < a name = "l01335" > < / a > < span class = "lineno" > 1335< / span >   < span class = "comment" > // This is used by the " stratified" approach. We will only consider terms with< / span > < / div >
< div class = "line" > < a name = "l01336" > < / a > < span class = "lineno" > 1336< / span >   < span class = "comment" > // a weight not lower than this threshold. The threshold will decrease as the< / span > < / div >
< div class = "line" > < a name = "l01337" > < / a > < span class = "lineno" > 1337< / span >   < span class = "comment" > // algorithm progress.< / span > < / div >
< div class = "line" > < a name = "l01338" > < / a > < span class = "lineno" > 1338< / span >   stratification_threshold_ = parameters_-> max_sat_stratification() ==< / div >
< div class = "line" > < a name = "l01339" > < / a > < span class = "lineno" > 1339< / span >   SatParameters::STRATIFICATION_NONE< / div >
< div class = "line" > < a name = "l01340" > < / a > < span class = "lineno" > 1340< / span >   ? IntegerValue(1)< / div >
< div class = "line" > < a name = "l01341" > < / a > < span class = "lineno" > 1341< / span >   : < a class = "code" href = "namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8" > kMaxIntegerValue< / a > ;< / div >
< div class = "line" > < a name = "l01342" > < / a > < span class = "lineno" > 1342< / span >   }< / div >
< div class = "line" > < a name = "l01343" > < / a > < span class = "lineno" > 1343< / span >   < / div >
< div class = "line" > < a name = "l01344" > < / a > < span class = "lineno" > 1344< / span >   < span class = "keywordtype" > bool< / span > CoreBasedOptimizer::ProcessSolution() {< / div >
< div class = "line" > < a name = "l01345" > < / a > < span class = "lineno" > 1345< / span >   < span class = "comment" > // We don' t assume that objective_var is linked with its linear term, so< / span > < / div >
< div class = "line" > < a name = "l01346" > < / a > < span class = "lineno" > 1346< / span >   < span class = "comment" > // we recompute the objective here.< / span > < / div >
< div class = "line" > < a name = "l01347" > < / a > < span class = "lineno" > 1347< / span >   IntegerValue objective(0);< / div >
< div class = "line" > < a name = "l01348" > < / a > < span class = "lineno" > 1348< / span >   < span class = "keywordflow" > for< / span > (ObjectiveTerm& term : terms_) {< / div >
< div class = "line" > < a name = "l01349" > < / a > < span class = "lineno" > 1349< / span >   < span class = "keyword" > const< / span > IntegerValue < a class = "code" href = "demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf" > value< / a > = integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9" > LowerBound< / a > (term.var);< / div >
< div class = "line" > < a name = "l01350" > < / a > < span class = "lineno" > 1350< / span >   objective += term.weight * < a class = "code" href = "demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf" > value< / a > ;< / div >
< div class = "line" > < a name = "l01351" > < / a > < span class = "lineno" > 1351< / span >   < / div >
< div class = "line" > < a name = "l01352" > < / a > < span class = "lineno" > 1352< / span >   < span class = "comment" > // Also keep in term.cover_ub the minimum value for term.var that we have< / span > < / div >
< div class = "line" > < a name = "l01353" > < / a > < span class = "lineno" > 1353< / span >   < span class = "comment" > // seens amongst all the feasible solutions found so far.< / span > < / div >
< div class = "line" > < a name = "l01354" > < / a > < span class = "lineno" > 1354< / span >   term.cover_ub = < a class = "code" href = "alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37" > std::min< / a > (term.cover_ub, < a class = "code" href = "demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf" > value< / a > );< / div >
< div class = "line" > < a name = "l01355" > < / a > < span class = "lineno" > 1355< / span >   }< / div >
< div class = "line" > < a name = "l01356" > < / a > < span class = "lineno" > 1356< / span >   < / div >
< div class = "line" > < a name = "l01357" > < / a > < span class = "lineno" > 1357< / span >   < span class = "comment" > // We use the level zero upper bound of the objective to indicate an upper< / span > < / div >
< div class = "line" > < a name = "l01358" > < / a > < span class = "lineno" > 1358< / span >   < span class = "comment" > // limit for the solution objective we are looking for. Again, because the< / span > < / div >
< div class = "line" > < a name = "l01359" > < / a > < span class = "lineno" > 1359< / span >   < span class = "comment" > // objective_var is not assumed to be linked, it could take any value in the< / span > < / div >
< div class = "line" > < a name = "l01360" > < / a > < span class = "lineno" > 1360< / span >   < span class = "comment" > // current solution.< / span > < / div >
< div class = "line" > < a name = "l01361" > < / a > < span class = "lineno" > 1361< / span >   < span class = "keywordflow" > if< / span > (objective > integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08" > LevelZeroUpperBound< / a > (objective_var_)) {< / div >
< div class = "line" > < a name = "l01362" > < / a > < span class = "lineno" > 1362< / span >   < span class = "keywordflow" > return< / span > < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l01363" > < / a > < span class = "lineno" > 1363< / span >   }< / div >
< div class = "line" > < a name = "l01364" > < / a > < span class = "lineno" > 1364< / span >   < / div >
< div class = "line" > < a name = "l01365" > < / a > < span class = "lineno" > 1365< / span >   < span class = "keywordflow" > if< / span > (feasible_solution_observer_ != < span class = "keyword" > nullptr< / span > ) {< / div >
< div class = "line" > < a name = "l01366" > < / a > < span class = "lineno" > 1366< / span >   feasible_solution_observer_();< / div >
< div class = "line" > < a name = "l01367" > < / a > < span class = "lineno" > 1367< / span >   }< / div >
< div class = "line" > < a name = "l01368" > < / a > < span class = "lineno" > 1368< / span >   < span class = "keywordflow" > if< / span > (parameters_-> stop_after_first_solution()) {< / div >
< div class = "line" > < a name = "l01369" > < / a > < span class = "lineno" > 1369< / span >   stop_ = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l01370" > < / a > < span class = "lineno" > 1370< / span >   }< / div >
< div class = "line" > < a name = "l01371" > < / a > < span class = "lineno" > 1371< / span >   < / div >
< div class = "line" > < a name = "l01372" > < / a > < span class = "lineno" > 1372< / span >   < span class = "comment" > // Constrain objective_var. This has a better result when objective_var is< / span > < / div >
< div class = "line" > < a name = "l01373" > < / a > < span class = "lineno" > 1373< / span >   < span class = "comment" > // used in an LP relaxation for instance.< / span > < / div >
< div class = "line" > < a name = "l01374" > < / a > < span class = "lineno" > 1374< / span >   sat_solver_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
< div class = "line" > < a name = "l01375" > < / a > < span class = "lineno" > 1375< / span >   sat_solver_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440" > SetAssumptionLevel< / a > (0);< / div >
< div class = "line" > < a name = "l01376" > < / a > < span class = "lineno" > 1376< / span >   < span class = "keywordflow" > return< / span > integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32" > Enqueue< / a > (< / div >
< div class = "line" > < a name = "l01377" > < / a > < span class = "lineno" > 1377< / span >   < a class = "code" href = "structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f" > IntegerLiteral::LowerOrEqual< / a > (objective_var_, objective - 1), {}, {});< / div >
< div class = "line" > < a name = "l01378" > < / a > < span class = "lineno" > 1378< / span >   }< / div >
< div class = "line" > < a name = "l01379" > < / a > < span class = "lineno" > 1379< / span >   < / div >
< div class = "line" > < a name = "l01380" > < / a > < span class = "lineno" > 1380< / span >   < span class = "keywordtype" > bool< / span > CoreBasedOptimizer::PropagateObjectiveBounds() {< / div >
< div class = "line" > < a name = "l01381" > < / a > < span class = "lineno" > 1381< / span >   < span class = "comment" > // We assumes all terms (modulo stratification) at their lower-bound.< / span > < / div >
< div class = "line" > < a name = "l01382" > < / a > < span class = "lineno" > 1382< / span >   < span class = "keywordtype" > bool< / span > some_bound_were_tightened = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l01383" > < / a > < span class = "lineno" > 1383< / span >   < span class = "keywordflow" > while< / span > (some_bound_were_tightened) {< / div >
< div class = "line" > < a name = "l01384" > < / a > < span class = "lineno" > 1384< / span >   some_bound_were_tightened = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l01385" > < / a > < span class = "lineno" > 1385< / span >   < span class = "keywordflow" > if< / span > (!sat_solver_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029" > ResetToLevelZero< / a > ()) < span class = "keywordflow" > return< / span > < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l01386" > < / a > < span class = "lineno" > 1386< / span >   < / div >
< div class = "line" > < a name = "l01387" > < / a > < span class = "lineno" > 1387< / span >   < span class = "comment" > // Compute implied lb.< / span > < / div >
< div class = "line" > < a name = "l01388" > < / a > < span class = "lineno" > 1388< / span >   IntegerValue implied_objective_lb(0);< / div >
< div class = "line" > < a name = "l01389" > < / a > < span class = "lineno" > 1389< / span >   < span class = "keywordflow" > for< / span > (ObjectiveTerm& term : terms_) {< / div >
< div class = "line" > < a name = "l01390" > < / a > < span class = "lineno" > 1390< / span >   < span class = "keyword" > const< / span > IntegerValue var_lb = integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9" > LowerBound< / a > (term.var);< / div >
< div class = "line" > < a name = "l01391" > < / a > < span class = "lineno" > 1391< / span >   term.old_var_lb = var_lb;< / div >
< div class = "line" > < a name = "l01392" > < / a > < span class = "lineno" > 1392< / span >   implied_objective_lb += term.weight * var_lb.value();< / div >
< div class = "line" > < a name = "l01393" > < / a > < span class = "lineno" > 1393< / span >   }< / div >
< div class = "line" > < a name = "l01394" > < / a > < span class = "lineno" > 1394< / span >   < / div >
< div class = "line" > < a name = "l01395" > < / a > < span class = "lineno" > 1395< / span >   < span class = "comment" > // Update the objective lower bound with our current bound.< / span > < / div >
< div class = "line" > < a name = "l01396" > < / a > < span class = "lineno" > 1396< / span >   < span class = "keywordflow" > if< / span > (implied_objective_lb > integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9" > LowerBound< / a > (objective_var_)) {< / div >
< div class = "line" > < a name = "l01397" > < / a > < span class = "lineno" > 1397< / span >   < span class = "keywordflow" > if< / span > (!integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32" > Enqueue< / a > (< a class = "code" href = "structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63" > IntegerLiteral::GreaterOrEqual< / a > (< / div >
< div class = "line" > < a name = "l01398" > < / a > < span class = "lineno" > 1398< / span >   objective_var_, implied_objective_lb),< / div >
< div class = "line" > < a name = "l01399" > < / a > < span class = "lineno" > 1399< / span >   {}, {})) {< / div >
< div class = "line" > < a name = "l01400" > < / a > < span class = "lineno" > 1400< / span >   < span class = "keywordflow" > return< / span > < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l01401" > < / a > < span class = "lineno" > 1401< / span >   }< / div >
< div class = "line" > < a name = "l01402" > < / a > < span class = "lineno" > 1402< / span >   < / div >
< div class = "line" > < a name = "l01403" > < / a > < span class = "lineno" > 1403< / span >   some_bound_were_tightened = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l01404" > < / a > < span class = "lineno" > 1404< / span >   }< / div >
< div class = "line" > < a name = "l01405" > < / a > < span class = "lineno" > 1405< / span >   < / div >
< div class = "line" > < a name = "l01406" > < / a > < span class = "lineno" > 1406< / span >   < span class = "comment" > // The gap is used to propagate the upper-bound of all variable that are< / span > < / div >
< div class = "line" > < a name = "l01407" > < / a > < span class = "lineno" > 1407< / span >   < span class = "comment" > // in the current objective (Exactly like done in the propagation of a< / span > < / div >
< div class = "line" > < a name = "l01408" > < / a > < span class = "lineno" > 1408< / span >   < span class = "comment" > // linear constraint with the slack). When this fix a variable to its< / span > < / div >
< div class = "line" > < a name = "l01409" > < / a > < span class = "lineno" > 1409< / span >   < span class = "comment" > // lower bound, it is called " hardening" in the max-sat literature. This< / span > < / div >
< div class = "line" > < a name = "l01410" > < / a > < span class = "lineno" > 1410< / span >   < span class = "comment" > // has a really beneficial effect on some weighted max-sat problems like< / span > < / div >
< div class = "line" > < a name = "l01411" > < / a > < span class = "lineno" > 1411< / span >   < span class = "comment" > // the haplotyping-pedigrees ones.< / span > < / div >
< div class = "line" > < a name = "l01412" > < / a > < span class = "lineno" > 1412< / span >   < span class = "keyword" > const< / span > IntegerValue gap =< / div >
< div class = "line" > < a name = "l01413" > < / a > < span class = "lineno" > 1413< / span >   integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac" > UpperBound< / a > (objective_var_) - implied_objective_lb;< / div >
< div class = "line" > < a name = "l01414" > < / a > < span class = "lineno" > 1414< / span >   < / div >
< div class = "line" > < a name = "l01415" > < / a > < span class = "lineno" > 1415< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > ObjectiveTerm& term : terms_) {< / div >
< div class = "line" > < a name = "l01416" > < / a > < span class = "lineno" > 1416< / span >   < span class = "keywordflow" > if< / span > (term.weight == 0) < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01417" > < / a > < span class = "lineno" > 1417< / span >   < span class = "keyword" > const< / span > IntegerValue var_lb = integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9" > LowerBound< / a > (term.var);< / div >
< div class = "line" > < a name = "l01418" > < / a > < span class = "lineno" > 1418< / span >   < span class = "keyword" > const< / span > IntegerValue var_ub = integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac" > UpperBound< / a > (term.var);< / div >
< div class = "line" > < a name = "l01419" > < / a > < span class = "lineno" > 1419< / span >   < span class = "keywordflow" > if< / span > (var_lb == var_ub) < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01420" > < / a > < span class = "lineno" > 1420< / span >   < / div >
< div class = "line" > < a name = "l01421" > < / a > < span class = "lineno" > 1421< / span >   < span class = "comment" > // Hardening. This basically just propagate the implied upper bound on< / span > < / div >
< div class = "line" > < a name = "l01422" > < / a > < span class = "lineno" > 1422< / span >   < span class = "comment" > // term.var from the current best solution. Note that the gap is< / span > < / div >
< div class = "line" > < a name = "l01423" > < / a > < span class = "lineno" > 1423< / span >   < span class = "comment" > // non-negative and the weight positive here. The test is done in order< / span > < / div >
< div class = "line" > < a name = "l01424" > < / a > < span class = "lineno" > 1424< / span >   < span class = "comment" > // to avoid any integer overflow provided (ub - lb) do not overflow, but< / span > < / div >
< div class = "line" > < a name = "l01425" > < / a > < span class = "lineno" > 1425< / span >   < span class = "comment" > // this is a precondition in our cp-model.< / span > < / div >
< div class = "line" > < a name = "l01426" > < / a > < span class = "lineno" > 1426< / span >   < span class = "keywordflow" > if< / span > (gap / term.weight < var_ub - var_lb) {< / div >
< div class = "line" > < a name = "l01427" > < / a > < span class = "lineno" > 1427< / span >   some_bound_were_tightened = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l01428" > < / a > < span class = "lineno" > 1428< / span >   < span class = "keyword" > const< / span > IntegerValue new_ub = var_lb + gap / term.weight;< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l01429" > < / a > < span class = "lineno" > 1429< / span >   < a class = "code" href = "base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82" > CHECK_LT< / a > (new_ub, var_ub);< / div >
< div class = "line" > < a name = "l01430" > < / a > < span class = "lineno" > 1430< / span >   < a class = "code" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (!integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#a309d057e12c8d4d393f13975eea2e2a9" > IsCurrentlyIgnored< / a > (term.var));< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01431" > < / a > < span class = "lineno" > 1431< / span >   < span class = "keywordflow" > if< / span > (!integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32" > Enqueue< / a > (< / div >
< div class = "line" > < a name = "l01432" > < / a > < span class = "lineno" > 1432< / span >   < a class = "code" href = "structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f" > IntegerLiteral::LowerOrEqual< / a > (term.var, new_ub), {}, {})) {< / div >
< div class = "line" > < a name = "l01433" > < / a > < span class = "lineno" > 1433< / span >   < span class = "keywordflow" > return< / span > < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l01434" > < / a > < span class = "lineno" > 1434< / span >   }< / div >
< div class = "line" > < a name = "l01435" > < / a > < span class = "lineno" > 1435< / span >   }< / div >
< div class = "line" > < a name = "l01436" > < / a > < span class = "lineno" > 1436< / span >   }< / div >
< div class = "line" > < a name = "l01437" > < / a > < span class = "lineno" > 1437< / span >   }< / div >
< div class = "line" > < a name = "l01438" > < / a > < span class = "lineno" > 1438< / span >   < span class = "keywordflow" > return< / span > < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l01439" > < / a > < span class = "lineno" > 1439< / span >   }< / div >
< div class = "line" > < a name = "l01440" > < / a > < span class = "lineno" > 1440< / span >   < / div >
< div class = "line" > < a name = "l01441" > < / a > < span class = "lineno" > 1441< / span >   < span class = "comment" > // A basic algorithm is to take the next one, or at least the next one< / span > < / div >
< div class = "line" > < a name = "l01442" > < / a > < span class = "lineno" > 1442< / span >   < span class = "comment" > // that invalidate the current solution. But to avoid corner cases for< / span > < / div >
< div class = "line" > < a name = "l01443" > < / a > < span class = "lineno" > 1443< / span >   < span class = "comment" > // problem with a lot of terms all with different objective weights (in< / span > < / div >
< div class = "line" > < a name = "l01444" > < / a > < span class = "lineno" > 1444< / span >   < span class = "comment" > // which case we will kind of introduce only one assumption per loop< / span > < / div >
< div class = "line" > < a name = "l01445" > < / a > < span class = "lineno" > 1445< / span >   < span class = "comment" > // which is little), we use an heuristic and take the 90% percentile of< / span > < / div >
< div class = "line" > < a name = "l01446" > < / a > < span class = "lineno" > 1446< / span >   < span class = "comment" > // the unique weights not yet included.< / span > < / div >
< div class = "line" > < a name = "l01447" > < / a > < span class = "lineno" > 1447< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l01448" > < / a > < span class = "lineno" > 1448< / span >   < span class = "comment" > // TODO(user): There is many other possible heuristics here, and I< / span > < / div >
< div class = "line" > < a name = "l01449" > < / a > < span class = "lineno" > 1449< / span >   < span class = "comment" > // didn' t have the time to properly compare them.< / span > < / div >
< div class = "line" > < a name = "l01450" > < / a > < span class = "lineno" > 1450< / span >   < span class = "keywordtype" > void< / span > CoreBasedOptimizer::ComputeNextStratificationThreshold() {< / div >
< div class = "line" > < a name = "l01451" > < / a > < span class = "lineno" > 1451< / span >   std::vector< IntegerValue> weights;< / div >
< div class = "line" > < a name = "l01452" > < / a > < span class = "lineno" > 1452< / span >   < span class = "keywordflow" > for< / span > (ObjectiveTerm& term : terms_) {< / div >
< div class = "line" > < a name = "l01453" > < / a > < span class = "lineno" > 1453< / span >   < span class = "keywordflow" > if< / span > (term.weight > = stratification_threshold_) < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01454" > < / a > < span class = "lineno" > 1454< / span >   < span class = "keywordflow" > if< / span > (term.weight == 0) < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01455" > < / a > < span class = "lineno" > 1455< / span >   < / div >
< div class = "line" > < a name = "l01456" > < / a > < span class = "lineno" > 1456< / span >   < span class = "keyword" > const< / span > IntegerValue var_lb = integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b" > LevelZeroLowerBound< / a > (term.var);< / div >
< div class = "line" > < a name = "l01457" > < / a > < span class = "lineno" > 1457< / span >   < span class = "keyword" > const< / span > IntegerValue var_ub = integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08" > LevelZeroUpperBound< / a > (term.var);< / div >
< div class = "line" > < a name = "l01458" > < / a > < span class = "lineno" > 1458< / span >   < span class = "keywordflow" > if< / span > (var_lb == var_ub) < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01459" > < / a > < span class = "lineno" > 1459< / span >   < / div >
< div class = "line" > < a name = "l01460" > < / a > < span class = "lineno" > 1460< / span >   weights.push_back(term.weight);< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l01461" > < / a > < span class = "lineno" > 1461< / span >   }< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01462" > < / a > < span class = "lineno" > 1462< / span >   < span class = "keywordflow" > if< / span > (weights.empty()) {< / div >
< div class = "line" > < a name = "l01463" > < / a > < span class = "lineno" > 1463< / span >   stratification_threshold_ = IntegerValue(0);< / div >
< div class = "line" > < a name = "l01464" > < / a > < span class = "lineno" > 1464< / span >   < span class = "keywordflow" > return< / span > ;< / div >
< div class = "line" > < a name = "l01465" > < / a > < span class = "lineno" > 1465< / span >   }< / div >
< div class = "line" > < a name = "l01466" > < / a > < span class = "lineno" > 1466< / span >   < / div >
< div class = "line" > < a name = "l01467" > < / a > < span class = "lineno" > 1467< / span >   < a class = "code" href = "namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d" > gtl::STLSortAndRemoveDuplicates< / a > (& weights);< / div >
< div class = "line" > < a name = "l01468" > < / a > < span class = "lineno" > 1468< / span >   stratification_threshold_ =< / div >
< div class = "line" > < a name = "l01469" > < / a > < span class = "lineno" > 1469< / span >   weights[< span class = "keyword" > static_cast< < / span > < span class = "keywordtype" > int< / span > < span class = "keyword" > > < / span > (std::floor(0.9 * weights.size()))];< / div >
< div class = "line" > < a name = "l01470" > < / a > < span class = "lineno" > 1470< / span >   }< / div >
< div class = "line" > < a name = "l01471" > < / a > < span class = "lineno" > 1471< / span >   < / div >
< div class = "line" > < a name = "l01472" > < / a > < span class = "lineno" > 1472< / span >   < span class = "keywordtype" > bool< / span > CoreBasedOptimizer::CoverOptimization() {< / div >
< div class = "line" > < a name = "l01473" > < / a > < span class = "lineno" > 1473< / span >   < span class = "comment" > // We set a fix deterministic time limit per all sub-solve and skip to the< / span > < / div >
< div class = "line" > < a name = "l01474" > < / a > < span class = "lineno" > 1474< / span >   < span class = "comment" > // next core if the sum of the subsolve is also over this limit.< / span > < / div >
< div class = "line" > < a name = "l01475" > < / a > < span class = "lineno" > 1475< / span >   constexpr < span class = "keywordtype" > double< / span > max_dtime_per_core = 0.5;< / div >
< div class = "line" > < a name = "l01476" > < / a > < span class = "lineno" > 1476< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > double< / span > old_time_limit = parameters_-> max_deterministic_time();< / div >
< div class = "line" > < a name = "l01477" > < / a > < span class = "lineno" > 1477< / span >   parameters_-> set_max_deterministic_time(max_dtime_per_core);< / div >
< div class = "line" > < a name = "l01478" > < / a > < span class = "lineno" > 1478< / span >   < span class = "keyword" > auto< / span > cleanup = < a class = "code" href = "namespaceabsl.html#a9bfb260a67150f0bc1da17aac9199866" > ::absl::MakeCleanup< / a > ([old_time_limit, < span class = "keyword" > this< / span > ]() {< / div >
< div class = "line" > < a name = "l01479" > < / a > < span class = "lineno" > 1479< / span >   parameters_-> set_max_deterministic_time(old_time_limit);< / div >
< div class = "line" > < a name = "l01480" > < / a > < span class = "lineno" > 1480< / span >   });< / div >
< div class = "line" > < a name = "l01481" > < / a > < span class = "lineno" > 1481< / span >   < / div >
< div class = "line" > < a name = "l01482" > < / a > < span class = "lineno" > 1482< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > ObjectiveTerm& term : terms_) {< / div >
< div class = "line" > < a name = "l01483" > < / a > < span class = "lineno" > 1483< / span >   < span class = "comment" > // We currently skip the initial objective terms as there could be many< / span > < / div >
< div class = "line" > < a name = "l01484" > < / a > < span class = "lineno" > 1484< / span >   < span class = "comment" > // of them. TODO(user): provide an option to cover-optimize them? I< / span > < / div >
< div class = "line" > < a name = "l01485" > < / a > < span class = "lineno" > 1485< / span >   < span class = "comment" > // fear that this will slow down the solver too much though.< / span > < / div >
< div class = "line" > < a name = "l01486" > < / a > < span class = "lineno" > 1486< / span >   < span class = "keywordflow" > if< / span > (term.depth == 0) < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01487" > < / a > < span class = "lineno" > 1487< / span >   < / div >
< div class = "line" > < a name = "l01488" > < / a > < span class = "lineno" > 1488< / span >   < span class = "comment" > // Find out the true lower bound of var. This is called " cover< / span > < / div >
< div class = "line" > < a name = "l01489" > < / a > < span class = "lineno" > 1489< / span >   < span class = "comment" > // optimization" in some of the max-SAT literature. It can helps on some< / span > < / div >
< div class = "line" > < a name = "l01490" > < / a > < span class = "lineno" > 1490< / span >   < span class = "comment" > // problem families and hurt on others, but the overall impact is< / span > < / div >
< div class = "line" > < a name = "l01491" > < / a > < span class = "lineno" > 1491< / span >   < span class = "comment" > // positive.< / span > < / div >
< div class = "line" > < a name = "l01492" > < / a > < span class = "lineno" > 1492< / span >   < span class = "keyword" > const< / span > IntegerVariable < a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > = term.var;< / div >
< div class = "line" > < a name = "l01493" > < / a > < span class = "lineno" > 1493< / span >   IntegerValue best =< / div >
< div class = "line" > < a name = "l01494" > < / a > < span class = "lineno" > 1494< / span >   < a class = "code" href = "alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37" > std::min< / a > (term.cover_ub, integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac" > UpperBound< / a > (< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > ));< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l01495" > < / a > < span class = "lineno" > 1495< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01496" > < / a > < span class = "lineno" > 1496< / span >   < span class = "comment" > // Note(user): this can happen in some corner case because each time we< / span > < / div >
< div class = "line" > < a name = "l01497" > < / a > < span class = "lineno" > 1497< / span >   < span class = "comment" > // find a solution, we constrain the objective to be smaller than it, so< / span > < / div >
< div class = "line" > < a name = "l01498" > < / a > < span class = "lineno" > 1498< / span >   < span class = "comment" > // it is possible that a previous best is now infeasible.< / span > < / div >
< div class = "line" > < a name = "l01499" > < / a > < span class = "lineno" > 1499< / span >   < span class = "keywordflow" > if< / span > (best < = integer_trail_-> < a class = "code" href = "namespaceoperations__research_1_1sat.html#a1000a311929a470e5485258d765eeabd" > LowerBound< / a > (< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > )) < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01500" > < / a > < span class = "lineno" > 1500< / span >   < / div >
< div class = "line" > < a name = "l01501" > < / a > < span class = "lineno" > 1501< / span >   < span class = "comment" > // Compute the global deterministic time for this core cover< / span > < / div >
< div class = "line" > < a name = "l01502" > < / a > < span class = "lineno" > 1502< / span >   < span class = "comment" > // optimization.< / span > < / div >
< div class = "line" > < a name = "l01503" > < / a > < span class = "lineno" > 1503< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > double< / span > deterministic_limit =< / div >
< div class = "line" > < a name = "l01504" > < / a > < span class = "lineno" > 1504< / span >   time_limit_-> < a class = "code" href = "classoperations__research_1_1_time_limit.html#ac7e861414a70fc937d18bc7ca743fc98" > GetElapsedDeterministicTime< / a > () + max_dtime_per_core;< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l01505" > < / a > < span class = "lineno" > 1505< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01506" > < / a > < span class = "lineno" > 1506< / span >   < span class = "comment" > // Simple linear scan algorithm to find the optimal of var.< / span > < / div >
< div class = "line" > < a name = "l01507" > < / a > < span class = "lineno" > 1507< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > result;< / div >
< div class = "line" > < a name = "l01508" > < / a > < span class = "lineno" > 1508< / span >   < span class = "keywordflow" > while< / span > (best > integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9" > LowerBound< / a > (< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > )) {< / div >
< div class = "line" > < a name = "l01509" > < / a > < span class = "lineno" > 1509< / span >   < span class = "keyword" > const< / span > Literal assumption = integer_encoder_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_encoder.html#afcd4038298bec97a2f7a61274c6ef8c7" > GetOrCreateAssociatedLiteral< / a > (< / div >
< div class = "line" > < a name = "l01510" > < / a > < span class = "lineno" > 1510< / span >   < a class = "code" href = "structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f" > IntegerLiteral::LowerOrEqual< / a > (< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > , best - 1));< / div >
< div class = "line" > < a name = "l01511" > < / a > < span class = "lineno" > 1511< / span >   result = < a class = "code" href = "namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a" > ResetAndSolveIntegerProblem< / a > ({assumption}, model_);< / div >
< div class = "line" > < a name = "l01512" > < / a > < span class = "lineno" > 1512< / span >   < span class = "keywordflow" > if< / span > (result != < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ) < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a name = "l01513" > < / a > < span class = "lineno" > 1513< / span >   < / div >
< div class = "line" > < a name = "l01514" > < / a > < span class = "lineno" > 1514< / span >   best = integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9" > LowerBound< / a > (< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > );< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l01515" > < / a > < span class = "lineno" > 1515< / span >   < a class = "code" href = "base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927" > VLOG< / a > (1) < < < span class = "stringliteral" > " cover_opt var:" < / span > < < < a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > < < < span class = "stringliteral" > " domain:[" < / span > < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01516" > < / a > < span class = "lineno" > 1516< / span >   < < integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b" > LevelZeroLowerBound< / a > (< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > ) < < < span class = "stringliteral" > " ," < / span > < < best < < < span class = "stringliteral" > " ]" < / span > ;< / div >
< div class = "line" > < a name = "l01517" > < / a > < span class = "lineno" > 1517< / span >   < span class = "keywordflow" > if< / span > (!ProcessSolution()) < span class = "keywordflow" > return< / span > < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l01518" > < / a > < span class = "lineno" > 1518< / span >   < span class = "keywordflow" > if< / span > (!sat_solver_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029" > ResetToLevelZero< / a > ()) < span class = "keywordflow" > return< / span > < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l01519" > < / a > < span class = "lineno" > 1519< / span >   < span class = "keywordflow" > if< / span > (stop_ ||< / div >
< div class = "line" > < a name = "l01520" > < / a > < span class = "lineno" > 1520< / span >   time_limit_-> < a class = "code" href = "classoperations__research_1_1_time_limit.html#ac7e861414a70fc937d18bc7ca743fc98" > GetElapsedDeterministicTime< / a > () > deterministic_limit) {< / div >
< div class = "line" > < a name = "l01521" > < / a > < span class = "lineno" > 1521< / span >   < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a name = "l01522" > < / a > < span class = "lineno" > 1522< / span >   }< / div >
< div class = "line" > < a name = "l01523" > < / a > < span class = "lineno" > 1523< / span >   }< / div >
< div class = "line" > < a name = "l01524" > < / a > < span class = "lineno" > 1524< / span >   < span class = "keywordflow" > if< / span > (result == < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ) < span class = "keywordflow" > return< / span > < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l01525" > < / a > < span class = "lineno" > 1525< / span >   < span class = "keywordflow" > if< / span > (result == < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885" > SatSolver::ASSUMPTIONS_UNSAT< / a > ) {< / div >
< div class = "line" > < a name = "l01526" > < / a > < span class = "lineno" > 1526< / span >   < span class = "comment" > // TODO(user): If we improve the lower bound of var, we should check< / span > < / div >
< div class = "line" > < a name = "l01527" > < / a > < span class = "lineno" > 1527< / span >   < span class = "comment" > // if our global lower bound reached our current best solution in< / span > < / div >
< div class = "line" > < a name = "l01528" > < / a > < span class = "lineno" > 1528< / span >   < span class = "comment" > // order to abort early if the optimal is proved.< / span > < / div >
< div class = "line" > < a name = "l01529" > < / a > < span class = "lineno" > 1529< / span >   < span class = "keywordflow" > if< / span > (!integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32" > Enqueue< / a > (< a class = "code" href = "structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63" > IntegerLiteral::GreaterOrEqual< / a > (< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > , best),< / div >
< div class = "line" > < a name = "l01530" > < / a > < span class = "lineno" > 1530< / span >   {}, {})) {< / div >
< div class = "line" > < a name = "l01531" > < / a > < span class = "lineno" > 1531< / span >   < span class = "keywordflow" > return< / span > < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l01532" > < / a > < span class = "lineno" > 1532< / span >   }< / div >
< div class = "line" > < a name = "l01533" > < / a > < span class = "lineno" > 1533< / span >   }< / div >
< div class = "line" > < a name = "l01534" > < / a > < span class = "lineno" > 1534< / span >   }< / div >
< div class = "line" > < a name = "l01535" > < / a > < span class = "lineno" > 1535< / span >   < / div >
< div class = "line" > < a name = "l01536" > < / a > < span class = "lineno" > 1536< / span >   < span class = "keywordflow" > if< / span > (!PropagateObjectiveBounds()) < span class = "keywordflow" > return< / span > < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l01537" > < / a > < span class = "lineno" > 1537< / span >   < span class = "keywordflow" > return< / span > < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l01538" > < / a > < span class = "lineno" > 1538< / span >   }< / div >
< div class = "line" > < a name = "l01539" > < / a > < span class = "lineno" > 1539< / span >   < / div >
< div class = "line" > < a name = "l01540" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_core_based_optimizer.html#a4398d89730acb3b628a3c81d55bac96f" > 1540< / a > < / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > < a class = "code" href = "classoperations__research_1_1sat_1_1_core_based_optimizer.html#a4398d89730acb3b628a3c81d55bac96f" > CoreBasedOptimizer::Optimize< / a > () {< / div >
< div class = "line" > < a name = "l01541" > < / a > < span class = "lineno" > 1541< / span >   < span class = "comment" > // TODO(user): The core is returned in the same order as the assumptions,< / span > < / div >
< div class = "line" > < a name = "l01542" > < / a > < span class = "lineno" > 1542< / span >   < span class = "comment" > // so we don' t really need this map, we could just do a linear scan to< / span > < / div >
< div class = "line" > < a name = "l01543" > < / a > < span class = "lineno" > 1543< / span >   < span class = "comment" > // recover which node are part of the core. This however needs to be properly< / span > < / div >
< div class = "line" > < a name = "l01544" > < / a > < span class = "lineno" > 1544< / span >   < span class = "comment" > // unit tested before usage.< / span > < / div >
< div class = "line" > < a name = "l01545" > < / a > < span class = "lineno" > 1545< / span >   std::map< LiteralIndex, int> literal_to_term_index;< / div >
< div class = "line" > < a name = "l01546" > < / a > < span class = "lineno" > 1546< / span >   < / div >
< div class = "line" > < a name = "l01547" > < / a > < span class = "lineno" > 1547< / span >   < span class = "comment" > // Start the algorithm.< / span > < / div >
< div class = "line" > < a name = "l01548" > < / a > < span class = "lineno" > 1548< / span >   stop_ = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l01549" > < / a > < span class = "lineno" > 1549< / span >   < span class = "keywordflow" > while< / span > (< span class = "keyword" > true< / span > ) {< / div >
< div class = "line" > < a name = "l01550" > < / a > < span class = "lineno" > 1550< / span >   < span class = "comment" > // TODO(user): This always resets the solver to level zero.< / span > < / div >
< div class = "line" > < a name = "l01551" > < / a > < span class = "lineno" > 1551< / span >   < span class = "comment" > // Because of that we don' t resume a solve in " chunk" perfectly. Fix.< / span > < / div >
< div class = "line" > < a name = "l01552" > < / a > < span class = "lineno" > 1552< / span >   < span class = "keywordflow" > if< / span > (!PropagateObjectiveBounds()) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l01553" > < / a > < span class = "lineno" > 1553< / span >   < / div >
< div class = "line" > < a name = "l01554" > < / a > < span class = "lineno" > 1554< / span >   < span class = "comment" > // Bulk cover optimization.< / span > < / div >
< div class = "line" > < a name = "l01555" > < / a > < span class = "lineno" > 1555< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l01556" > < / a > < span class = "lineno" > 1556< / span >   < span class = "comment" > // TODO(user): If the search is aborted during this phase and we solve in< / span > < / div >
< div class = "line" > < a name = "l01557" > < / a > < span class = "lineno" > 1557< / span >   < span class = "comment" > // " chunk" , we don' t resume perfectly from where it was. Fix.< / span > < / div >
< div class = "line" > < a name = "l01558" > < / a > < span class = "lineno" > 1558< / span >   < span class = "keywordflow" > if< / span > (parameters_-> cover_optimization()) {< / div >
< div class = "line" > < a name = "l01559" > < / a > < span class = "lineno" > 1559< / span >   < span class = "keywordflow" > if< / span > (!CoverOptimization()) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l01560" > < / a > < span class = "lineno" > 1560< / span >   < span class = "keywordflow" > if< / span > (stop_) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > SatSolver::LIMIT_REACHED< / a > ;< / div >
< div class = "line" > < a name = "l01561" > < / a > < span class = "lineno" > 1561< / span >   }< / div >
< div class = "line" > < a name = "l01562" > < / a > < span class = "lineno" > 1562< / span >   < / div >
< div class = "line" > < a name = "l01563" > < / a > < span class = "lineno" > 1563< / span >   < span class = "comment" > // We assumes all terms (modulo stratification) at their lower-bound.< / span > < / div >
< div class = "line" > < a name = "l01564" > < / a > < span class = "lineno" > 1564< / span >   std::vector< int> term_indices;< / div >
< div class = "line" > < a name = "l01565" > < / a > < span class = "lineno" > 1565< / span >   std::vector< IntegerLiteral> integer_assumptions;< / div >
< div class = "line" > < a name = "l01566" > < / a > < span class = "lineno" > 1566< / span >   std::vector< IntegerValue> assumption_weights;< / div >
< div class = "line" > < a name = "l01567" > < / a > < span class = "lineno" > 1567< / span >   IntegerValue objective_offset(0);< / div >
< div class = "line" > < a name = "l01568" > < / a > < span class = "lineno" > 1568< / span >   < span class = "keywordtype" > bool< / span > some_assumptions_were_skipped = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l01569" > < / a > < span class = "lineno" > 1569< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < terms_.size(); ++i) {< / div >
< div class = "line" > < a name = "l01570" > < / a > < span class = "lineno" > 1570< / span >   < span class = "keyword" > const< / span > ObjectiveTerm term = terms_[i];< / div >
< div class = "line" > < a name = "l01571" > < / a > < span class = "lineno" > 1571< / span >   < / div >
< div class = "line" > < a name = "l01572" > < / a > < span class = "lineno" > 1572< / span >   < span class = "comment" > // TODO(user): These can be simply removed from the list.< / span > < / div >
< div class = "line" > < a name = "l01573" > < / a > < span class = "lineno" > 1573< / span >   < span class = "keywordflow" > if< / span > (term.weight == 0) < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01574" > < / a > < span class = "lineno" > 1574< / span >   < / div >
< div class = "line" > < a name = "l01575" > < / a > < span class = "lineno" > 1575< / span >   < span class = "comment" > // Skip fixed terms.< / span > < / div >
< div class = "line" > < a name = "l01576" > < / a > < span class = "lineno" > 1576< / span >   < span class = "comment" > // We still keep them around for a proper lower-bound computation.< / span > < / div >
< div class = "line" > < a name = "l01577" > < / a > < span class = "lineno" > 1577< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l01578" > < / a > < span class = "lineno" > 1578< / span >   < span class = "comment" > // TODO(user): we could keep an objective offset instead.< / span > < / div >
< div class = "line" > < a name = "l01579" > < / a > < span class = "lineno" > 1579< / span >   < span class = "keyword" > const< / span > IntegerValue var_lb = integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9" > LowerBound< / a > (term.var);< / div >
< div class = "line" > < a name = "l01580" > < / a > < span class = "lineno" > 1580< / span >   < span class = "keyword" > const< / span > IntegerValue var_ub = integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac" > UpperBound< / a > (term.var);< / div >
< div class = "line" > < a name = "l01581" > < / a > < span class = "lineno" > 1581< / span >   < span class = "keywordflow" > if< / span > (var_lb == var_ub) {< / div >
< div class = "line" > < a name = "l01582" > < / a > < span class = "lineno" > 1582< / span >   objective_offset += term.weight * var_lb.value();< / div >
< div class = "line" > < a name = "l01583" > < / a > < span class = "lineno" > 1583< / span >   < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01584" > < / a > < span class = "lineno" > 1584< / span >   }< / div >
< div class = "line" > < a name = "l01585" > < / a > < span class = "lineno" > 1585< / span >   < / div >
< div class = "line" > < a name = "l01586" > < / a > < span class = "lineno" > 1586< / span >   < span class = "comment" > // Only consider the terms above the threshold.< / span > < / div >
< div class = "line" > < a name = "l01587" > < / a > < span class = "lineno" > 1587< / span >   < span class = "keywordflow" > if< / span > (term.weight > = stratification_threshold_) {< / div >
< div class = "line" > < a name = "l01588" > < / a > < span class = "lineno" > 1588< / span >   integer_assumptions.push_back(< / div >
< div class = "line" > < a name = "l01589" > < / a > < span class = "lineno" > 1589< / span >   < a class = "code" href = "structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f" > IntegerLiteral::LowerOrEqual< / a > (term.var, var_lb));< / div >
< div class = "line" > < a name = "l01590" > < / a > < span class = "lineno" > 1590< / span >   assumption_weights.push_back(term.weight);< / div >
< div class = "line" > < a name = "l01591" > < / a > < span class = "lineno" > 1591< / span >   term_indices.push_back(i);< / div >
< div class = "line" > < a name = "l01592" > < / a > < span class = "lineno" > 1592< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l01593" > < / a > < span class = "lineno" > 1593< / span >   some_assumptions_were_skipped = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l01594" > < / a > < span class = "lineno" > 1594< / span >   }< / div >
< div class = "line" > < a name = "l01595" > < / a > < span class = "lineno" > 1595< / span >   }< / div >
< div class = "line" > < a name = "l01596" > < / a > < span class = "lineno" > 1596< / span >   < / div >
< div class = "line" > < a name = "l01597" > < / a > < span class = "lineno" > 1597< / span >   < span class = "comment" > // No assumptions with the current stratification? use the next one.< / span > < / div >
< div class = "line" > < a name = "l01598" > < / a > < span class = "lineno" > 1598< / span >   < span class = "keywordflow" > if< / span > (term_indices.empty() & & some_assumptions_were_skipped) {< / div >
< div class = "line" > < a name = "l01599" > < / a > < span class = "lineno" > 1599< / span >   ComputeNextStratificationThreshold();< / div >
< div class = "line" > < a name = "l01600" > < / a > < span class = "lineno" > 1600< / span >   < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01601" > < / a > < span class = "lineno" > 1601< / span >   }< / div >
< div class = "line" > < a name = "l01602" > < / a > < span class = "lineno" > 1602< / span >   < / div >
< div class = "line" > < a name = "l01603" > < / a > < span class = "lineno" > 1603< / span >   < span class = "comment" > // If there is only one or two assumptions left, we switch the algorithm.< / span > < / div >
< div class = "line" > < a name = "l01604" > < / a > < span class = "lineno" > 1604< / span >   < span class = "keywordflow" > if< / span > (term_indices.size() < = 2 & & !some_assumptions_were_skipped) {< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l01605" > < / a > < span class = "lineno" > 1605< / span >   < a class = "code" href = "base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927" > VLOG< / a > (1) < < < span class = "stringliteral" > " Switching to linear scan..." < / span > ;< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01606" > < / a > < span class = "lineno" > 1606< / span >   < span class = "keywordflow" > if< / span > (!already_switched_to_linear_scan_) {< / div >
< div class = "line" > < a name = "l01607" > < / a > < span class = "lineno" > 1607< / span >   already_switched_to_linear_scan_ = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l01608" > < / a > < span class = "lineno" > 1608< / span >   std::vector< IntegerVariable> constraint_vars;< / div >
< div class = "line" > < a name = "l01609" > < / a > < span class = "lineno" > 1609< / span >   std::vector< int64> constraint_coeffs;< / div >
< div class = "line" > < a name = "l01610" > < / a > < span class = "lineno" > 1610< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > : term_indices) {< / div >
< div class = "line" > < a name = "l01611" > < / a > < span class = "lineno" > 1611< / span >   constraint_vars.push_back(terms_[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ].< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > );< / div >
< div class = "line" > < a name = "l01612" > < / a > < span class = "lineno" > 1612< / span >   constraint_coeffs.push_back(terms_[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ].< a class = "code" href = "pack_8cc.html#ae42ca38a167164c07831993889216903" > weight< / a > .value());< / div >
< div class = "line" > < a name = "l01613" > < / a > < span class = "lineno" > 1613< / span >   }< / div >
< div class = "line" > < a name = "l01614" > < / a > < span class = "lineno" > 1614< / span >   constraint_vars.push_back(objective_var_);< / div >
< div class = "line" > < a name = "l01615" > < / a > < span class = "lineno" > 1615< / span >   constraint_coeffs.push_back(-1);< / div >
< div class = "line" > < a name = "l01616" > < / a > < span class = "lineno" > 1616< / span >   model_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_model.html#a7b8d774b566431b8932ba0f3c921ec7d" > Add< / a > (< a class = "code" href = "namespaceoperations__research_1_1sat.html#a949fa684e53fd6a18a2d1f79133fd80a" > WeightedSumLowerOrEqual< / a > (constraint_vars, constraint_coeffs,< / div >
< div class = "line" > < a name = "l01617" > < / a > < span class = "lineno" > 1617< / span >   -objective_offset.value()));< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l01618" > < / a > < span class = "lineno" > 1618< / span >   }< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01619" > < / a > < span class = "lineno" > 1619< / span >   < / div >
< div class = "line" > < a name = "l01620" > < / a > < span class = "lineno" > 1620< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "namespaceoperations__research_1_1sat.html#affe1669ec9e0e7cbd54e895bbbff43af" > MinimizeIntegerVariableWithLinearScanAndLazyEncoding< / a > (< / div >
< div class = "line" > < a name = "l01621" > < / a > < span class = "lineno" > 1621< / span >   objective_var_, feasible_solution_observer_, model_);< / div >
< div class = "line" > < a name = "l01622" > < / a > < span class = "lineno" > 1622< / span >   }< / div >
< div class = "line" > < a name = "l01623" > < / a > < span class = "lineno" > 1623< / span >   < / div >
< div class = "line" > < a name = "l01624" > < / a > < span class = "lineno" > 1624< / span >   < span class = "comment" > // Display the progress.< / span > < / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l01625" > < / a > < span class = "lineno" > 1625< / span >   < span class = "keywordflow" > if< / span > (< a class = "code" href = "vlog__is__on_8h.html#a956152cad330225654d128f35c00efce" > VLOG_IS_ON< / a > (1)) {< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01626" > < / a > < span class = "lineno" > 1626< / span >   < span class = "keywordtype" > int< / span > max_depth = 0;< / div >
< div class = "line" > < a name = "l01627" > < / a > < span class = "lineno" > 1627< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > ObjectiveTerm& term : terms_) {< / div >
< div class = "line" > < a name = "l01628" > < / a > < span class = "lineno" > 1628< / span >   max_depth = < a class = "code" href = "alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a" > std::max< / a > (max_depth, term.depth);< / div >
< div class = "line" > < a name = "l01629" > < / a > < span class = "lineno" > 1629< / span >   }< / div >
< div class = "line" > < a name = "l01630" > < / a > < span class = "lineno" > 1630< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a" > int64< / a > lb = integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9" > LowerBound< / a > (objective_var_).value();< / div >
< div class = "line" > < a name = "l01631" > < / a > < span class = "lineno" > 1631< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a" > int64< / a > ub = integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac" > UpperBound< / a > (objective_var_).value();< / div >
< div class = "line" > < a name = "l01632" > < / a > < span class = "lineno" > 1632< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > gap =< / div >
< div class = "line" > < a name = "l01633" > < / a > < span class = "lineno" > 1633< / span >   lb == ub< / div >
< div class = "line" > < a name = "l01634" > < / a > < span class = "lineno" > 1634< / span >   ? 0< / div >
< div class = "line" > < a name = "l01635" > < / a > < span class = "lineno" > 1635< / span >   : < span class = "keyword" > static_cast< < / span > < span class = "keywordtype" > int< / span > < span class = "keyword" > > < / span > (std::ceil(< / div >
< div class = "line" > < a name = "l01636" > < / a > < span class = "lineno" > 1636< / span >   100.0 * (ub - lb) / < a class = "code" href = "alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a" > std::max< / a > (std::abs(ub), std::abs(lb))));< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l01637" > < / a > < span class = "lineno" > 1637< / span >   < a class = "code" href = "base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927" > VLOG< / a > (1) < < absl::StrCat(< span class = "stringliteral" > " unscaled_next_obj_range:[" < / span > , lb, < span class = "stringliteral" > " ," < / span > , ub,< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01638" > < / a > < span class = "lineno" > 1638< / span >   < span class = "stringliteral" > " ]" < / span > < / div >
< div class = "line" > < a name = "l01639" > < / a > < span class = "lineno" > 1639< / span >   < span class = "stringliteral" > " gap:" < / span > ,< / div >
< div class = "line" > < a name = "l01640" > < / a > < span class = "lineno" > 1640< / span >   gap, < span class = "stringliteral" > " %" < / span > , < span class = "stringliteral" > " assumptions:" < / span > , term_indices.size(),< / div >
< div class = "line" > < a name = "l01641" > < / a > < span class = "lineno" > 1641< / span >   < span class = "stringliteral" > " strat:" < / span > , stratification_threshold_.value(),< / div >
< div class = "line" > < a name = "l01642" > < / a > < span class = "lineno" > 1642< / span >   < span class = "stringliteral" > " depth:" < / span > , max_depth);< / div >
< div class = "line" > < a name = "l01643" > < / a > < span class = "lineno" > 1643< / span >   }< / div >
< div class = "line" > < a name = "l01644" > < / a > < span class = "lineno" > 1644< / span >   < / div >
< div class = "line" > < a name = "l01645" > < / a > < span class = "lineno" > 1645< / span >   < span class = "comment" > // Convert integer_assumptions to Literals.< / span > < / div >
< div class = "line" > < a name = "l01646" > < / a > < span class = "lineno" > 1646< / span >   std::vector< Literal> assumptions;< / div >
< div class = "line" > < a name = "l01647" > < / a > < span class = "lineno" > 1647< / span >   literal_to_term_index.clear();< / div >
< div class = "line" > < a name = "l01648" > < / a > < span class = "lineno" > 1648< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < integer_assumptions.size(); ++i) {< / div >
< div class = "line" > < a name = "l01649" > < / a > < span class = "lineno" > 1649< / span >   assumptions.push_back(integer_encoder_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_encoder.html#afcd4038298bec97a2f7a61274c6ef8c7" > GetOrCreateAssociatedLiteral< / a > (< / div >
< div class = "line" > < a name = "l01650" > < / a > < span class = "lineno" > 1650< / span >   integer_assumptions[i]));< / div >
< div class = "line" > < a name = "l01651" > < / a > < span class = "lineno" > 1651< / span >   < / div >
< div class = "line" > < a name = "l01652" > < / a > < span class = "lineno" > 1652< / span >   < span class = "comment" > // Tricky: In some rare case, it is possible that the same literal< / span > < / div >
< div class = "line" > < a name = "l01653" > < / a > < span class = "lineno" > 1653< / span >   < span class = "comment" > // correspond to more that one assumptions. In this case, we can just< / span > < / div >
< div class = "line" > < a name = "l01654" > < / a > < span class = "lineno" > 1654< / span >   < span class = "comment" > // pick one of them when converting back a core to term indices.< / span > < / div >
< div class = "line" > < a name = "l01655" > < / a > < span class = "lineno" > 1655< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l01656" > < / a > < span class = "lineno" > 1656< / span >   < span class = "comment" > // TODO(user): We can probably be smarter about the cost of the< / span > < / div >
< div class = "line" > < a name = "l01657" > < / a > < span class = "lineno" > 1657< / span >   < span class = "comment" > // assumptions though.< / span > < / div >
< div class = "line" > < a name = "l01658" > < / a > < span class = "lineno" > 1658< / span >   literal_to_term_index[assumptions.back().Index()] = term_indices[i];< / div >
< div class = "line" > < a name = "l01659" > < / a > < span class = "lineno" > 1659< / span >   }< / div >
< div class = "line" > < a name = "l01660" > < / a > < span class = "lineno" > 1660< / span >   < / div >
< div class = "line" > < a name = "l01661" > < / a > < span class = "lineno" > 1661< / span >   < span class = "comment" > // Solve under the assumptions.< / span > < / div >
< div class = "line" > < a name = "l01662" > < / a > < span class = "lineno" > 1662< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l01663" > < / a > < span class = "lineno" > 1663< / span >   < span class = "comment" > // TODO(user): If the " search" is interupted while computing cores, we< / span > < / div >
< div class = "line" > < a name = "l01664" > < / a > < span class = "lineno" > 1664< / span >   < span class = "comment" > // currently do not resume it flawlessly. We however add any cores we found< / span > < / div >
< div class = "line" > < a name = "l01665" > < / a > < span class = "lineno" > 1665< / span >   < span class = "comment" > // before aborting.< / span > < / div >
< div class = "line" > < a name = "l01666" > < / a > < span class = "lineno" > 1666< / span >   std::vector< std::vector< Literal> > cores;< / div >
< div class = "line" > < a name = "l01667" > < / a > < span class = "lineno" > 1667< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > result =< / div >
< div class = "line" > < a name = "l01668" > < / a > < span class = "lineno" > 1668< / span >   FindCores(assumptions, assumption_weights, stratification_threshold_,< / div >
< div class = "line" > < a name = "l01669" > < / a > < span class = "lineno" > 1669< / span >   model_, & cores);< / div >
< div class = "line" > < a name = "l01670" > < / a > < span class = "lineno" > 1670< / span >   < span class = "keywordflow" > if< / span > (result == < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l01671" > < / a > < span class = "lineno" > 1671< / span >   < span class = "keywordflow" > if< / span > (result == < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ) {< / div >
< div class = "line" > < a name = "l01672" > < / a > < span class = "lineno" > 1672< / span >   < span class = "keywordflow" > if< / span > (!ProcessSolution()) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l01673" > < / a > < span class = "lineno" > 1673< / span >   < span class = "keywordflow" > if< / span > (stop_) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > SatSolver::LIMIT_REACHED< / a > ;< / div >
< div class = "line" > < a name = "l01674" > < / a > < span class = "lineno" > 1674< / span >   < span class = "keywordflow" > if< / span > (cores.empty()) {< / div >
< div class = "line" > < a name = "l01675" > < / a > < span class = "lineno" > 1675< / span >   ComputeNextStratificationThreshold();< / div >
< div class = "line" > < a name = "l01676" > < / a > < span class = "lineno" > 1676< / span >   < span class = "keywordflow" > if< / span > (stratification_threshold_ == 0) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l01677" > < / a > < span class = "lineno" > 1677< / span >   < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01678" > < / a > < span class = "lineno" > 1678< / span >   }< / div >
< div class = "line" > < a name = "l01679" > < / a > < span class = "lineno" > 1679< / span >   }< / div >
< div class = "line" > < a name = "l01680" > < / a > < span class = "lineno" > 1680< / span >   < / div >
< div class = "line" > < a name = "l01681" > < / a > < span class = "lineno" > 1681< / span >   < span class = "comment" > // Process the cores by creating new variables and transferring the minimum< / span > < / div >
< div class = "line" > < a name = "l01682" > < / a > < span class = "lineno" > 1682< / span >   < span class = "comment" > // weight of each core to it.< / span > < / div >
< div class = "line" > < a name = "l01683" > < / a > < span class = "lineno" > 1683< / span >   < span class = "keywordflow" > if< / span > (!sat_solver_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029" > ResetToLevelZero< / a > ()) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l01684" > < / a > < span class = "lineno" > 1684< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > std::vector< Literal> & core : cores) {< / div >
< div class = "line" > < a name = "l01685" > < / a > < span class = "lineno" > 1685< / span >   < span class = "comment" > // This just increase the lower-bound of the corresponding node, which< / span > < / div >
< div class = "line" > < a name = "l01686" > < / a > < span class = "lineno" > 1686< / span >   < span class = "comment" > // should already be done by the solver.< / span > < / div >
< div class = "line" > < a name = "l01687" > < / a > < span class = "lineno" > 1687< / span >   < span class = "keywordflow" > if< / span > (core.size() == 1) < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01688" > < / a > < span class = "lineno" > 1688< / span >   < / div >
< div class = "line" > < a name = "l01689" > < / a > < span class = "lineno" > 1689< / span >   < span class = "comment" > // Compute the min weight of all the terms in the core. The lower bound< / span > < / div >
< div class = "line" > < a name = "l01690" > < / a > < span class = "lineno" > 1690< / span >   < span class = "comment" > // will be increased by that much because at least one assumption in the< / span > < / div >
< div class = "line" > < a name = "l01691" > < / a > < span class = "lineno" > 1691< / span >   < span class = "comment" > // core must be true. This is also why we can start at 1 for new_var_lb.< / span > < / div >
< div class = "line" > < a name = "l01692" > < / a > < span class = "lineno" > 1692< / span >   < span class = "keywordtype" > bool< / span > ignore_this_core = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l01693" > < / a > < span class = "lineno" > 1693< / span >   IntegerValue min_weight = < a class = "code" href = "namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8" > kMaxIntegerValue< / a > ;< / div >
< div class = "line" > < a name = "l01694" > < / a > < span class = "lineno" > 1694< / span >   IntegerValue max_weight(0);< / div >
< div class = "line" > < a name = "l01695" > < / a > < span class = "lineno" > 1695< / span >   IntegerValue new_var_lb(1);< / div >
< div class = "line" > < a name = "l01696" > < / a > < span class = "lineno" > 1696< / span >   IntegerValue new_var_ub(0);< / div >
< div class = "line" > < a name = "l01697" > < / a > < span class = "lineno" > 1697< / span >   < span class = "keywordtype" > int< / span > new_depth = 0;< / div >
< div class = "line" > < a name = "l01698" > < / a > < span class = "lineno" > 1698< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > lit : core) {< / div >
< div class = "line" > < a name = "l01699" > < / a > < span class = "lineno" > 1699< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > = < a class = "code" href = "namespacegtl.html#abce27d097bc5680207b294bdad75f59f" > gtl::FindOrDie< / a > (literal_to_term_index, lit.Index());< / div >
< div class = "line" > < a name = "l01700" > < / a > < span class = "lineno" > 1700< / span >   < / div >
< div class = "line" > < a name = "l01701" > < / a > < span class = "lineno" > 1701< / span >   < span class = "comment" > // When this happen, the core is now trivially " minimized" by the new< / span > < / div >
< div class = "line" > < a name = "l01702" > < / a > < span class = "lineno" > 1702< / span >   < span class = "comment" > // bound on this variable, so there is no point in adding it.< / span > < / div >
< div class = "line" > < a name = "l01703" > < / a > < span class = "lineno" > 1703< / span >   < span class = "keywordflow" > if< / span > (terms_[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ].old_var_lb < < / div >
< div class = "line" > < a name = "l01704" > < / a > < span class = "lineno" > 1704< / span >   integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9" > LowerBound< / a > (terms_[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ].var)) {< / div >
< div class = "line" > < a name = "l01705" > < / a > < span class = "lineno" > 1705< / span >   ignore_this_core = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l01706" > < / a > < span class = "lineno" > 1706< / span >   < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a name = "l01707" > < / a > < span class = "lineno" > 1707< / span >   }< / div >
< div class = "line" > < a name = "l01708" > < / a > < span class = "lineno" > 1708< / span >   < / div >
< div class = "line" > < a name = "l01709" > < / a > < span class = "lineno" > 1709< / span >   < span class = "keyword" > const< / span > IntegerValue < a class = "code" href = "pack_8cc.html#ae42ca38a167164c07831993889216903" > weight< / a > = terms_[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ].weight;< / div >
< div class = "line" > < a name = "l01710" > < / a > < span class = "lineno" > 1710< / span >   min_weight = < a class = "code" href = "alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37" > std::min< / a > (min_weight, < a class = "code" href = "pack_8cc.html#ae42ca38a167164c07831993889216903" > weight< / a > );< / div >
< div class = "line" > < a name = "l01711" > < / a > < span class = "lineno" > 1711< / span >   max_weight = < a class = "code" href = "alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a" > std::max< / a > (max_weight, < a class = "code" href = "pack_8cc.html#ae42ca38a167164c07831993889216903" > weight< / a > );< / div >
< div class = "line" > < a name = "l01712" > < / a > < span class = "lineno" > 1712< / span >   new_depth = < a class = "code" href = "alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a" > std::max< / a > (new_depth, terms_[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ].depth + 1);< / div >
< div class = "line" > < a name = "l01713" > < / a > < span class = "lineno" > 1713< / span >   new_var_lb += integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9" > LowerBound< / a > (terms_[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ].< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > );< / div >
< div class = "line" > < a name = "l01714" > < / a > < span class = "lineno" > 1714< / span >   new_var_ub += integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac" > UpperBound< / a > (terms_[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ].< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > );< / div >
< div class = "line" > < a name = "l01715" > < / a > < span class = "lineno" > 1715< / span >   }< / div >
< div class = "line" > < a name = "l01716" > < / a > < span class = "lineno" > 1716< / span >   < span class = "keywordflow" > if< / span > (ignore_this_core) < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01717" > < / a > < span class = "lineno" > 1717< / span >   < / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l01718" > < / a > < span class = "lineno" > 1718< / span >   < a class = "code" href = "base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927" > VLOG< / a > (1) < < absl::StrFormat(< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01719" > < / a > < span class = "lineno" > 1719< / span >   < span class = "stringliteral" > " core:%u weight:[%d,%d] domain:[%d,%d] depth:%d" < / span > , core.size(),< / div >
< div class = "line" > < a name = "l01720" > < / a > < span class = "lineno" > 1720< / span >   min_weight.value(), max_weight.value(), new_var_lb.value(),< / div >
< div class = "line" > < a name = "l01721" > < / a > < span class = "lineno" > 1721< / span >   new_var_ub.value(), new_depth);< / div >
< div class = "line" > < a name = "l01722" > < / a > < span class = "lineno" > 1722< / span >   < / div >
< div class = "line" > < a name = "l01723" > < / a > < span class = "lineno" > 1723< / span >   < span class = "comment" > // We will " transfer" min_weight from all the variables of the core< / span > < / div >
< div class = "line" > < a name = "l01724" > < / a > < span class = "lineno" > 1724< / span >   < span class = "comment" > // to a new variable.< / span > < / div >
< div class = "line" > < a name = "l01725" > < / a > < span class = "lineno" > 1725< / span >   < span class = "keyword" > const< / span > IntegerVariable new_var =< / div >
< div class = "line" > < a name = "l01726" > < / a > < span class = "lineno" > 1726< / span >   integer_trail_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html#aa2d7b702e17a5cd4108b465385dd9acd" > AddIntegerVariable< / a > (new_var_lb, new_var_ub);< / div >
< div class = "line" > < a name = "l01727" > < / a > < span class = "lineno" > 1727< / span >   terms_.push_back({new_var, min_weight, new_depth});< / div >
< div class = "line" > < a name = "l01728" > < / a > < span class = "lineno" > 1728< / span >   terms_.back().cover_ub = new_var_ub;< / div >
< div class = "line" > < a name = "l01729" > < / a > < span class = "lineno" > 1729< / span >   < / div >
< div class = "line" > < a name = "l01730" > < / a > < span class = "lineno" > 1730< / span >   < span class = "comment" > // Sum variables in the core < = new_var.< / span > < / div >
< div class = "line" > < a name = "l01731" > < / a > < span class = "lineno" > 1731< / span >   {< / div >
< div class = "line" > < a name = "l01732" > < / a > < span class = "lineno" > 1732< / span >   std::vector< IntegerVariable> constraint_vars;< / div >
< div class = "line" > < a name = "l01733" > < / a > < span class = "lineno" > 1733< / span >   std::vector< int64> constraint_coeffs;< / div >
< div class = "line" > < a name = "l01734" > < / a > < span class = "lineno" > 1734< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > lit : core) {< / div >
< div class = "line" > < a name = "l01735" > < / a > < span class = "lineno" > 1735< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > = < a class = "code" href = "namespacegtl.html#abce27d097bc5680207b294bdad75f59f" > gtl::FindOrDie< / a > (literal_to_term_index, lit.Index());< / div >
< div class = "line" > < a name = "l01736" > < / a > < span class = "lineno" > 1736< / span >   terms_[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ].weight -= min_weight;< / div >
< div class = "line" > < a name = "l01737" > < / a > < span class = "lineno" > 1737< / span >   constraint_vars.push_back(terms_[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ].< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > );< / div >
< div class = "line" > < a name = "l01738" > < / a > < span class = "lineno" > 1738< / span >   constraint_coeffs.push_back(1);< / div >
< div class = "line" > < a name = "l01739" > < / a > < span class = "lineno" > 1739< / span >   }< / div >
< div class = "line" > < a name = "l01740" > < / a > < span class = "lineno" > 1740< / span >   constraint_vars.push_back(new_var);< / div >
< div class = "line" > < a name = "l01741" > < / a > < span class = "lineno" > 1741< / span >   constraint_coeffs.push_back(-1);< / div >
< div class = "line" > < a name = "l01742" > < / a > < span class = "lineno" > 1742< / span >   model_-> < a class = "code" href = "classoperations__research_1_1sat_1_1_model.html#a7b8d774b566431b8932ba0f3c921ec7d" > Add< / a > (< / div >
< div class = "line" > < a name = "l01743" > < / a > < span class = "lineno" > 1743< / span >   < a class = "code" href = "namespaceoperations__research_1_1sat.html#a949fa684e53fd6a18a2d1f79133fd80a" > WeightedSumLowerOrEqual< / a > (constraint_vars, constraint_coeffs, 0));< / div >
< div class = "line" > < a name = "l01744" > < / a > < span class = "lineno" > 1744< / span >   }< / div >
< div class = "line" > < a name = "l01745" > < / a > < span class = "lineno" > 1745< / span >   }< / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l01746" > < / a > < span class = "lineno" > 1746< / span >   < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01747" > < / a > < span class = "lineno" > 1747< / span >   < span class = "comment" > // Abort if we reached the time limit. Note that we still add any cores we< / span > < / div >
< div class = "line" > < a name = "l01748" > < / a > < span class = "lineno" > 1748< / span >   < span class = "comment" > // found in case the solve is splitted in " chunk" .< / span > < / div >
< div class = "line" > < a name = "l01749" > < / a > < span class = "lineno" > 1749< / span >   < span class = "keywordflow" > if< / span > (result == < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > SatSolver::LIMIT_REACHED< / a > ) < span class = "keywordflow" > return< / span > result;< / div >
< div class = "line" > < a name = "l01750" > < / a > < span class = "lineno" > 1750< / span >   }< / div >
< div class = "line" > < a name = "l01751" > < / a > < span class = "lineno" > 1751< / span >   }< / div >
< div class = "line" > < a name = "l01752" > < / a > < span class = "lineno" > 1752< / span >   < / div >
< div class = "line" > < a name = "l01753" > < / a > < span class = "lineno" > 1753< / span >   < span class = "comment" > // TODO(user): take the MPModelRequest or MPModelProto directly, so that we can< / span > < / div >
< div class = "line" > < a name = "l01754" > < / a > < span class = "lineno" > 1754< / span >   < span class = "comment" > // have initial constraints!< / span > < / div >
< div class = "line" > < a name = "l01755" > < / a > < span class = "lineno" > 1755< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l01756" > < / a > < span class = "lineno" > 1756< / span >   < span class = "comment" > // TODO(user): remove code duplication with MinimizeWithCoreAndLazyEncoding();< / span > < / div >
< div class = "line" > < a name = "l01757" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a7d1c65f24756bb9dad18da1f5e82bb9c" > 1757< / a > < / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > < a class = "code" href = "namespaceoperations__research_1_1sat.html#a7d1c65f24756bb9dad18da1f5e82bb9c" > MinimizeWithHittingSetAndLazyEncoding< / a > (< / div >
< div class = "line" > < a name = "l01758" > < / a > < span class = "lineno" > 1758< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "structoperations__research_1_1sat_1_1_objective_definition.html" > ObjectiveDefinition< / a > & objective_definition,< / div >
< div class = "line" > < a name = "l01759" > < / a > < span class = "lineno" > 1759< / span >   < span class = "keyword" > const< / span > std::function< < span class = "keywordtype" > void< / span > ()> & feasible_solution_observer, < a class = "code" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ) {< / div >
< div class = "line" > < a name = "l01760" > < / a > < span class = "lineno" > 1760< / span >   < span class = "preprocessor" > #if !defined(__PORTABLE_PLATFORM__) & & defined(USE_SCIP)< / span > < / div >
< div class = "line" > < a name = "l01761" > < / a > < span class = "lineno" > 1761< / span >   < / div >
< div class = "line" > < a name = "l01762" > < / a > < span class = "lineno" > 1762< / span >   IntegerVariable objective_var = objective_definition.< a class = "code" href = "structoperations__research_1_1sat_1_1_objective_definition.html#aa3c0b31567c91babfffd5f9afc3161dc" > objective_var< / a > ;< / div >
< div class = "line" > < a name = "l01763" > < / a > < span class = "lineno" > 1763< / span >   std::vector< IntegerVariable> variables = objective_definition.< a class = "code" href = "structoperations__research_1_1sat_1_1_objective_definition.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1" > vars< / a > ;< / div >
< div class = "line" > < a name = "l01764" > < / a > < span class = "lineno" > 1764< / span >   std::vector< IntegerValue> < a class = "code" href = "sat_2lp__utils_8cc.html#ab1734711414da2e668957d24a41b1ddf" > coefficients< / a > = objective_definition.< a class = "code" href = "structoperations__research_1_1sat_1_1_objective_definition.html#a4053d5aed2a34995e0aeb2042878ca7a" > coeffs< / a > ;< / div >
< div class = "line" > < a name = "l01765" > < / a > < span class = "lineno" > 1765< / span >   < / div >
< div class = "line" > < a name = "l01766" > < / a > < span class = "lineno" > 1766< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > * sat_solver = < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > > ();< / div >
< div class = "line" > < a name = "l01767" > < / a > < span class = "lineno" > 1767< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html" > IntegerTrail< / a > * integer_trail = < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html" > IntegerTrail< / a > > ();< / div >
< div class = "line" > < a name = "l01768" > < / a > < span class = "lineno" > 1768< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_encoder.html" > IntegerEncoder< / a > * integer_encoder = < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_encoder.html" > IntegerEncoder< / a > > ();< / div >
< div class = "line" > < a name = "l01769" > < / a > < span class = "lineno" > 1769< / span >   < / div >
< div class = "line" > < a name = "l01770" > < / a > < span class = "lineno" > 1770< / span >   < span class = "comment" > // This will be called each time a feasible solution is found.< / span > < / div >
< div class = "line" > < a name = "l01771" > < / a > < span class = "lineno" > 1771< / span >   < span class = "keyword" > const< / span > < span class = "keyword" > auto< / span > process_solution = [& ]() {< / div >
< div class = "line" > < a name = "l01772" > < / a > < span class = "lineno" > 1772< / span >   < span class = "comment" > // We don' t assume that objective_var is linked with its linear term, so< / span > < / div >
< div class = "line" > < a name = "l01773" > < / a > < span class = "lineno" > 1773< / span >   < span class = "comment" > // we recompute the objective here.< / span > < / div >
< div class = "line" > < a name = "l01774" > < / a > < span class = "lineno" > 1774< / span >   IntegerValue objective(0);< / div >
< div class = "line" > < a name = "l01775" > < / a > < span class = "lineno" > 1775< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < variables.size(); ++i) {< / div >
< div class = "line" > < a name = "l01776" > < / a > < span class = "lineno" > 1776< / span >   objective +=< / div >
< div class = "line" > < a name = "l01777" > < / a > < span class = "lineno" > 1777< / span >   < a class = "code" href = "sat_2lp__utils_8cc.html#ab1734711414da2e668957d24a41b1ddf" > coefficients< / a > [i] * IntegerValue(< a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> Get(< a class = "code" href = "namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59" > Value< / a > (variables[i])));< / div >
< div class = "line" > < a name = "l01778" > < / a > < span class = "lineno" > 1778< / span >   }< / div >
< div class = "line" > < a name = "l01779" > < / a > < span class = "lineno" > 1779< / span >   < span class = "keywordflow" > if< / span > (objective > integer_trail-> UpperBound(objective_var)) < span class = "keywordflow" > return< / span > < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l01780" > < / a > < span class = "lineno" > 1780< / span >   < / div >
< div class = "line" > < a name = "l01781" > < / a > < span class = "lineno" > 1781< / span >   < span class = "keywordflow" > if< / span > (feasible_solution_observer != < span class = "keyword" > nullptr< / span > ) {< / div >
< div class = "line" > < a name = "l01782" > < / a > < span class = "lineno" > 1782< / span >   feasible_solution_observer();< / div >
< div class = "line" > < a name = "l01783" > < / a > < span class = "lineno" > 1783< / span >   }< / div >
< div class = "line" > < a name = "l01784" > < / a > < span class = "lineno" > 1784< / span >   < / div >
< div class = "line" > < a name = "l01785" > < / a > < span class = "lineno" > 1785< / span >   < span class = "comment" > // Constrain objective_var. This has a better result when objective_var is< / span > < / div >
< div class = "line" > < a name = "l01786" > < / a > < span class = "lineno" > 1786< / span >   < span class = "comment" > // used in an LP relaxation for instance.< / span > < / div >
< div class = "line" > < a name = "l01787" > < / a > < span class = "lineno" > 1787< / span >   sat_solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
< div class = "line" > < a name = "l01788" > < / a > < span class = "lineno" > 1788< / span >   sat_solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440" > SetAssumptionLevel< / a > (0);< / div >
< div class = "line" > < a name = "l01789" > < / a > < span class = "lineno" > 1789< / span >   < span class = "keywordflow" > if< / span > (!integer_trail-> Enqueue(< / div >
< div class = "line" > < a name = "l01790" > < / a > < span class = "lineno" > 1790< / span >   < a class = "code" href = "structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f" > IntegerLiteral::LowerOrEqual< / a > (objective_var, objective - 1), {},< / div >
< div class = "line" > < a name = "l01791" > < / a > < span class = "lineno" > 1791< / span >   {})) {< / div >
< div class = "line" > < a name = "l01792" > < / a > < span class = "lineno" > 1792< / span >   < span class = "keywordflow" > return< / span > < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l01793" > < / a > < span class = "lineno" > 1793< / span >   }< / div >
< div class = "line" > < a name = "l01794" > < / a > < span class = "lineno" > 1794< / span >   < span class = "keywordflow" > return< / span > < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a name = "l01795" > < / a > < span class = "lineno" > 1795< / span >   };< / div >
< div class = "line" > < a name = "l01796" > < / a > < span class = "lineno" > 1796< / span >   < / div >
< div class = "line" > < a name = "l01797" > < / a > < span class = "lineno" > 1797< / span >   < span class = "comment" > // This is the " generalized" hitting set problem we will solve. Each time< / span > < / div >
< div class = "line" > < a name = "l01798" > < / a > < span class = "lineno" > 1798< / span >   < span class = "comment" > // we find a core, a new constraint will be added to this problem.< / span > < / div >
< div class = "line" > < a name = "l01799" > < / a > < span class = "lineno" > 1799< / span >   MPModelRequest request;< / div >
< div class = "line" > < a name = "l01800" > < / a > < span class = "lineno" > 1800< / span >   request.set_solver_specific_parameters(< span class = "stringliteral" > " limits/gap = 0" < / span > );< / div >
< div class = "line" > < a name = "l01801" > < / a > < span class = "lineno" > 1801< / span >   request.set_solver_type(MPModelRequest::SCIP_MIXED_INTEGER_PROGRAMMING);< / div >
< div class = "line" > < a name = "l01802" > < / a > < span class = "lineno" > 1802< / span >   < / div >
< div class = "line" > < a name = "l01803" > < / a > < span class = "lineno" > 1803< / span >   MPModelProto& hs_model = *request.mutable_model();< / div >
< div class = "line" > < a name = "l01804" > < / a > < span class = "lineno" > 1804< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_variables_in_objective = variables.size();< / div >
< div class = "line" > < a name = "l01805" > < / a > < span class = "lineno" > 1805< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < num_variables_in_objective; ++i) {< / div >
< div class = "line" > < a name = "l01806" > < / a > < span class = "lineno" > 1806< / span >   < span class = "keywordflow" > if< / span > (< a class = "code" href = "sat_2lp__utils_8cc.html#ab1734711414da2e668957d24a41b1ddf" > coefficients< / a > [i] < 0) {< / div >
< div class = "line" > < a name = "l01807" > < / a > < span class = "lineno" > 1807< / span >   variables[i] = < a class = "code" href = "namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22" > NegationOf< / a > (variables[i]);< / div >
< div class = "line" > < a name = "l01808" > < / a > < span class = "lineno" > 1808< / span >   < a class = "code" href = "sat_2lp__utils_8cc.html#ab1734711414da2e668957d24a41b1ddf" > coefficients< / a > [i] = -< a class = "code" href = "sat_2lp__utils_8cc.html#ab1734711414da2e668957d24a41b1ddf" > coefficients< / a > [i];< / div >
< div class = "line" > < a name = "l01809" > < / a > < span class = "lineno" > 1809< / span >   }< / div >
< div class = "line" > < a name = "l01810" > < / a > < span class = "lineno" > 1810< / span >   < span class = "keyword" > const< / span > IntegerVariable < a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > = variables[i];< / div >
< div class = "line" > < a name = "l01811" > < / a > < span class = "lineno" > 1811< / span >   MPVariableProto* var_proto = hs_model.add_variable();< / div >
< div class = "line" > < a name = "l01812" > < / a > < span class = "lineno" > 1812< / span >   var_proto-> set_lower_bound(integer_trail-> LowerBound(< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > ).value());< / div >
< div class = "line" > < a name = "l01813" > < / a > < span class = "lineno" > 1813< / span >   var_proto-> set_upper_bound(integer_trail-> UpperBound(< a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > ).value());< / div >
< div class = "line" > < a name = "l01814" > < / a > < span class = "lineno" > 1814< / span >   var_proto-> set_objective_coefficient(< a class = "code" href = "sat_2lp__utils_8cc.html#ab1734711414da2e668957d24a41b1ddf" > coefficients< / a > [i].< a class = "code" href = "demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf" > value< / a > ());< / div >
< div class = "line" > < a name = "l01815" > < / a > < span class = "lineno" > 1815< / span >   var_proto-> set_is_integer(< span class = "keyword" > true< / span > );< / div >
< div class = "line" > < a name = "l01816" > < / a > < span class = "lineno" > 1816< / span >   }< / div >
< div class = "line" > < a name = "l01817" > < / a > < span class = "lineno" > 1817< / span >   < / div >
< div class = "line" > < a name = "l01818" > < / a > < span class = "lineno" > 1818< / span >   MPSolutionResponse < a class = "code" href = "cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829" > response< / a > ;< / div >
< div class = "line" > < a name = "l01819" > < / a > < span class = "lineno" > 1819< / span >   < / div >
< div class = "line" > < a name = "l01820" > < / a > < span class = "lineno" > 1820< / span >   < span class = "comment" > // This is used by the " stratified" approach. We will only consider terms with< / span > < / div >
< div class = "line" > < a name = "l01821" > < / a > < span class = "lineno" > 1821< / span >   < span class = "comment" > // a weight not lower than this threshold. The threshold will decrease as the< / span > < / div >
< div class = "line" > < a name = "l01822" > < / a > < span class = "lineno" > 1822< / span >   < span class = "comment" > // algorithm progress.< / span > < / div >
< div class = "line" > < a name = "l01823" > < / a > < span class = "lineno" > 1823< / span >   IntegerValue stratified_threshold = < a class = "code" href = "namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8" > kMaxIntegerValue< / a > ;< / div >
< div class = "line" > < a name = "l01824" > < / a > < span class = "lineno" > 1824< / span >   < / div >
< div class = "line" > < a name = "l01825" > < / a > < span class = "lineno" > 1825< / span >   < span class = "comment" > // TODO(user): The core is returned in the same order as the assumptions,< / span > < / div >
< div class = "line" > < a name = "l01826" > < / a > < span class = "lineno" > 1826< / span >   < span class = "comment" > // so we don' t really need this map, we could just do a linear scan to< / span > < / div >
< div class = "line" > < a name = "l01827" > < / a > < span class = "lineno" > 1827< / span >   < span class = "comment" > // recover which node are part of the core.< / span > < / div >
< div class = "line" > < a name = "l01828" > < / a > < span class = "lineno" > 1828< / span >   std::map< LiteralIndex, std::vector< int> > assumption_to_indices;< / div >
< div class = "line" > < a name = "l01829" > < / a > < span class = "lineno" > 1829< / span >   < / div >
< div class = "line" > < a name = "l01830" > < / a > < span class = "lineno" > 1830< / span >   < span class = "comment" > // New Booleans variable in the MIP model to represent X > = cte.< / span > < / div >
< div class = "line" > < a name = "l01831" > < / a > < span class = "lineno" > 1831< / span >   std::map< std::pair< int, double> , < span class = "keywordtype" > int< / span > > created_var;< / div >
< div class = "line" > < a name = "l01832" > < / a > < span class = "lineno" > 1832< / span >   < / div >
< div class = "line" > < a name = "l01833" > < / a > < span class = "lineno" > 1833< / span >   < span class = "keyword" > const< / span > SatParameters& < a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > = *(< a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< SatParameters> ());< / div >
< div class = "line" > < a name = "l01834" > < / a > < span class = "lineno" > 1834< / span >   < / div >
< div class = "line" > < a name = "l01835" > < / a > < span class = "lineno" > 1835< / span >   < span class = "comment" > // Start the algorithm.< / span > < / div >
< div class = "line" > < a name = "l01836" > < / a > < span class = "lineno" > 1836< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > result;< / div >
< div class = "line" > < a name = "l01837" > < / a > < span class = "lineno" > 1837< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > iter = 0;; ++iter) {< / div >
< div class = "line" > < a name = "l01838" > < / a > < span class = "lineno" > 1838< / span >   < span class = "comment" > // TODO(user): Even though we keep the same solver, currently the solve is< / span > < / div >
< div class = "line" > < a name = "l01839" > < / a > < span class = "lineno" > 1839< / span >   < span class = "comment" > // not really done incrementally. It might be hard to improve though.< / span > < / div >
< div class = "line" > < a name = "l01840" > < / a > < span class = "lineno" > 1840< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l01841" > < / a > < span class = "lineno" > 1841< / span >   < span class = "comment" > // TODO(user): deal with time limit.< / span > < / div >
< div class = "line" > < a name = "l01842" > < / a > < span class = "lineno" > 1842< / span >   < a class = "code" href = "classoperations__research_1_1_m_p_solver.html#a5a1af4aceca49fa23cdeec088394dea4" > MPSolver::SolveWithProto< / a > (request, & < a class = "code" href = "cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829" > response< / a > );< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l01843" > < / a > < span class = "lineno" > 1843< / span >   < a class = "code" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (< a class = "code" href = "cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829" > response< / a > .status(), < a class = "code" href = "namespaceoperations__research.html#aeaeaf340789f2dd271dcf9204279cb1ba9cff14a44a54cc44f4b91d65e8cd73b1" > MPSolverResponseStatus::MPSOLVER_OPTIMAL< / a > );< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01844" > < / a > < span class = "lineno" > 1844< / span >   < / div >
< div class = "line" > < a name = "l01845" > < / a > < span class = "lineno" > 1845< / span >   < span class = "keyword" > const< / span > IntegerValue mip_objective(< / div >
< div class = "line" > < a name = "l01846" > < / a > < span class = "lineno" > 1846< / span >   < span class = "keyword" > static_cast< < / span > < a class = "code" href = "integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a" > int64< / a > < span class = "keyword" > > < / span > (std::round(< a class = "code" href = "cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829" > response< / a > .objective_value())));< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l01847" > < / a > < span class = "lineno" > 1847< / span >   < a class = "code" href = "base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927" > VLOG< / a > (1) < < < span class = "stringliteral" > " constraints: " < / span > < < hs_model.constraint_size()< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01848" > < / a > < span class = "lineno" > 1848< / span >   < < < span class = "stringliteral" > " variables: " < / span > < < hs_model.variable_size() < < < span class = "stringliteral" > " hs_lower_bound: " < / span > < / div >
< div class = "line" > < a name = "l01849" > < / a > < span class = "lineno" > 1849< / span >   < < objective_definition.< a class = "code" href = "structoperations__research_1_1sat_1_1_objective_definition.html#adb0775f26a8a26bbd760d700d66c5281" > ScaleIntegerObjective< / a > (mip_objective)< / div >
< div class = "line" > < a name = "l01850" > < / a > < span class = "lineno" > 1850< / span >   < < < span class = "stringliteral" > " strat: " < / span > < < stratified_threshold;< / div >
< div class = "line" > < a name = "l01851" > < / a > < span class = "lineno" > 1851< / span >   < / div >
< div class = "line" > < a name = "l01852" > < / a > < span class = "lineno" > 1852< / span >   < span class = "comment" > // Update the objective lower bound with our current bound.< / span > < / div >
< div class = "line" > < a name = "l01853" > < / a > < span class = "lineno" > 1853< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l01854" > < / a > < span class = "lineno" > 1854< / span >   < span class = "comment" > // Note(user): This is not needed for correctness, but it might cause< / span > < / div >
< div class = "line" > < a name = "l01855" > < / a > < span class = "lineno" > 1855< / span >   < span class = "comment" > // more propagation and is nice to have for reporting/logging purpose.< / span > < / div >
< div class = "line" > < a name = "l01856" > < / a > < span class = "lineno" > 1856< / span >   < span class = "keywordflow" > if< / span > (!integer_trail-> Enqueue(< / div >
< div class = "line" > < a name = "l01857" > < / a > < span class = "lineno" > 1857< / span >   < a class = "code" href = "structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63" > IntegerLiteral::GreaterOrEqual< / a > (objective_var, mip_objective), {},< / div >
< div class = "line" > < a name = "l01858" > < / a > < span class = "lineno" > 1858< / span >   {})) {< / div >
< div class = "line" > < a name = "l01859" > < / a > < span class = "lineno" > 1859< / span >   result = < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l01860" > < / a > < span class = "lineno" > 1860< / span >   < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a name = "l01861" > < / a > < span class = "lineno" > 1861< / span >   }< / div >
< div class = "line" > < a name = "l01862" > < / a > < span class = "lineno" > 1862< / span >   < / div >
< div class = "line" > < a name = "l01863" > < / a > < span class = "lineno" > 1863< / span >   sat_solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
< div class = "line" > < a name = "l01864" > < / a > < span class = "lineno" > 1864< / span >   sat_solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440" > SetAssumptionLevel< / a > (0);< / div >
< div class = "line" > < a name = "l01865" > < / a > < span class = "lineno" > 1865< / span >   std::vector< Literal> assumptions;< / div >
< div class = "line" > < a name = "l01866" > < / a > < span class = "lineno" > 1866< / span >   assumption_to_indices.clear();< / div >
< div class = "line" > < a name = "l01867" > < / a > < span class = "lineno" > 1867< / span >   IntegerValue next_stratified_threshold(0);< / div >
< div class = "line" > < a name = "l01868" > < / a > < span class = "lineno" > 1868< / span >   < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < num_variables_in_objective; ++i) {< / div >
< div class = "line" > < a name = "l01869" > < / a > < span class = "lineno" > 1869< / span >   < span class = "keyword" > const< / span > IntegerValue hs_value(< / div >
< div class = "line" > < a name = "l01870" > < / a > < span class = "lineno" > 1870< / span >   < span class = "keyword" > static_cast< < / span > < a class = "code" href = "integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a" > int64< / a > < span class = "keyword" > > < / span > (< a class = "code" href = "cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829" > response< / a > .variable_value(i)));< / div >
< div class = "line" > < a name = "l01871" > < / a > < span class = "lineno" > 1871< / span >   < span class = "keywordflow" > if< / span > (hs_value == integer_trail-> UpperBound(variables[i])) < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01872" > < / a > < span class = "lineno" > 1872< / span >   < / div >
< div class = "line" > < a name = "l01873" > < / a > < span class = "lineno" > 1873< / span >   < span class = "comment" > // Only consider the terms above the threshold.< / span > < / div >
< div class = "line" > < a name = "l01874" > < / a > < span class = "lineno" > 1874< / span >   < span class = "keywordflow" > if< / span > (< a class = "code" href = "sat_2lp__utils_8cc.html#ab1734711414da2e668957d24a41b1ddf" > coefficients< / a > [i] < stratified_threshold) {< / div >
< div class = "line" > < a name = "l01875" > < / a > < span class = "lineno" > 1875< / span >   next_stratified_threshold =< / div >
< div class = "line" > < a name = "l01876" > < / a > < span class = "lineno" > 1876< / span >   < a class = "code" href = "alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a" > std::max< / a > (next_stratified_threshold, < a class = "code" href = "sat_2lp__utils_8cc.html#ab1734711414da2e668957d24a41b1ddf" > coefficients< / a > [i]);< / div >
< div class = "line" > < a name = "l01877" > < / a > < span class = "lineno" > 1877< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l01878" > < / a > < span class = "lineno" > 1878< / span >   < span class = "comment" > // It is possible that different variables have the same associated< / span > < / div >
< div class = "line" > < a name = "l01879" > < / a > < span class = "lineno" > 1879< / span >   < span class = "comment" > // literal. So we do need to consider this case.< / span > < / div >
< div class = "line" > < a name = "l01880" > < / a > < span class = "lineno" > 1880< / span >   assumptions.push_back(integer_encoder-> GetOrCreateAssociatedLiteral(< / div >
< div class = "line" > < a name = "l01881" > < / a > < span class = "lineno" > 1881< / span >   < a class = "code" href = "structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f" > IntegerLiteral::LowerOrEqual< / a > (variables[i], hs_value)));< / div >
< div class = "line" > < a name = "l01882" > < / a > < span class = "lineno" > 1882< / span >   assumption_to_indices[assumptions.back().Index()].push_back(i);< / div >
< div class = "line" > < a name = "l01883" > < / a > < span class = "lineno" > 1883< / span >   }< / div >
< div class = "line" > < a name = "l01884" > < / a > < span class = "lineno" > 1884< / span >   }< / div >
< div class = "line" > < a name = "l01885" > < / a > < span class = "lineno" > 1885< / span >   < / div >
< div class = "line" > < a name = "l01886" > < / a > < span class = "lineno" > 1886< / span >   < span class = "comment" > // No assumptions with the current stratified_threshold? use the new one.< / span > < / div >
< div class = "line" > < a name = "l01887" > < / a > < span class = "lineno" > 1887< / span >   < span class = "keywordflow" > if< / span > (assumptions.empty() & & next_stratified_threshold > 0) {< / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l01888" > < / a > < span class = "lineno" > 1888< / span >   < a class = "code" href = "base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82" > CHECK_LT< / a > (next_stratified_threshold, stratified_threshold);< / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01889" > < / a > < span class = "lineno" > 1889< / span >   stratified_threshold = next_stratified_threshold;< / div >
< div class = "line" > < a name = "l01890" > < / a > < span class = "lineno" > 1890< / span >   --iter; < span class = "comment" > // " false" iteration, the lower bound does not increase.< / span > < / div >
< div class = "line" > < a name = "l01891" > < / a > < span class = "lineno" > 1891< / span >   < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01892" > < / a > < span class = "lineno" > 1892< / span >   }< / div >
< div class = "line" > < a name = "l01893" > < / a > < span class = "lineno" > 1893< / span >   < / div >
< div class = "line" > < a name = "l01894" > < / a > < span class = "lineno" > 1894< / span >   < span class = "comment" > // TODO(user): we could also randomly shuffle the assumptions to find more< / span > < / div >
< div class = "line" > < a name = "l01895" > < / a > < span class = "lineno" > 1895< / span >   < span class = "comment" > // cores for only one MIP solve.< / span > < / div >
< div class = "line" > < a name = "l01896" > < / a > < span class = "lineno" > 1896< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l01897" > < / a > < span class = "lineno" > 1897< / span >   < span class = "comment" > // TODO(user): Use the real weights and exploit the extra cores.< / span > < / div >
< div class = "line" > < a name = "l01898" > < / a > < span class = "lineno" > 1898< / span >   std::vector< std::vector< Literal> > cores;< / div >
< div class = "line" > < a name = "l01899" > < / a > < span class = "lineno" > 1899< / span >   result = FindMultipleCoresForMaxHs(assumptions, < a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > , & cores);< / div >
< div class = "line" > < a name = "l01900" > < / a > < span class = "lineno" > 1900< / span >   < span class = "keywordflow" > if< / span > (result == < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > SatSolver::FEASIBLE< / a > ) {< / div >
< div class = "line" > < a name = "l01901" > < / a > < span class = "lineno" > 1901< / span >   < span class = "keywordflow" > if< / span > (!process_solution()) < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > SatSolver::INFEASIBLE< / a > ;< / div >
< div class = "line" > < a name = "l01902" > < / a > < span class = "lineno" > 1902< / span >   < span class = "keywordflow" > if< / span > (< a class = "code" href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > .stop_after_first_solution()) {< / div >
< div class = "line" > < a name = "l01903" > < / a > < span class = "lineno" > 1903< / span >   < span class = "keywordflow" > return< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > SatSolver::LIMIT_REACHED< / a > ;< / div >
< div class = "line" > < a name = "l01904" > < / a > < span class = "lineno" > 1904< / span >   }< / div >
< div class = "line" > < a name = "l01905" > < / a > < span class = "lineno" > 1905< / span >   < span class = "keywordflow" > if< / span > (cores.empty()) {< / div >
< div class = "line" > < a name = "l01906" > < / a > < span class = "lineno" > 1906< / span >   < span class = "comment" > // If not all assumptions were taken, continue with a lower stratified< / span > < / div >
< div class = "line" > < a name = "l01907" > < / a > < span class = "lineno" > 1907< / span >   < span class = "comment" > // bound. Otherwise we have an optimal solution.< / span > < / div >
< div class = "line" > < a name = "l01908" > < / a > < span class = "lineno" > 1908< / span >   stratified_threshold = next_stratified_threshold;< / div >
< div class = "line" > < a name = "l01909" > < / a > < span class = "lineno" > 1909< / span >   < span class = "keywordflow" > if< / span > (stratified_threshold == 0) < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a name = "l01910" > < / a > < span class = "lineno" > 1910< / span >   --iter; < span class = "comment" > // " false" iteration, the lower bound does not increase.< / span > < / div >
< div class = "line" > < a name = "l01911" > < / a > < span class = "lineno" > 1911< / span >   < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01912" > < / a > < span class = "lineno" > 1912< / span >   }< / div >
< div class = "line" > < a name = "l01913" > < / a > < span class = "lineno" > 1913< / span >   } < span class = "keywordflow" > else< / span > < span class = "keywordflow" > if< / span > (result != < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885" > SatSolver::ASSUMPTIONS_UNSAT< / a > ) {< / div >
< div class = "line" > < a name = "l01914" > < / a > < span class = "lineno" > 1914< / span >   < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a name = "l01915" > < / a > < span class = "lineno" > 1915< / span >   }< / div >
< div class = "line" > < a name = "l01916" > < / a > < span class = "lineno" > 1916< / span >   < / div >
< div class = "line" > < a name = "l01917" > < / a > < span class = "lineno" > 1917< / span >   sat_solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
< div class = "line" > < a name = "l01918" > < / a > < span class = "lineno" > 1918< / span >   sat_solver-> < a class = "code" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440" > SetAssumptionLevel< / a > (0);< / div >
< div class = "line" > < a name = "l01919" > < / a > < span class = "lineno" > 1919< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > std::vector< Literal> & core : cores) {< / div >
< div class = "line" > < a name = "l01920" > < / a > < span class = "lineno" > 1920< / span >   < span class = "keywordflow" > if< / span > (core.size() == 1) {< / div >
< div class = "line" > < a name = "l01921" > < / a > < span class = "lineno" > 1921< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > :< / div >
< div class = "line" > < a name = "l01922" > < / a > < span class = "lineno" > 1922< / span >   < a class = "code" href = "namespacegtl.html#abce27d097bc5680207b294bdad75f59f" > gtl::FindOrDie< / a > (assumption_to_indices, core.front().Index())) {< / div >
< div class = "line" > < a name = "l01923" > < / a > < span class = "lineno" > 1923< / span >   hs_model.mutable_variable(< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > )-> set_lower_bound(< / div >
< div class = "line" > < a name = "l01924" > < / a > < span class = "lineno" > 1924< / span >   integer_trail-> LowerBound(variables[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ]).value());< / div >
< div class = "line" > < a name = "l01925" > < / a > < span class = "lineno" > 1925< / span >   }< / div >
< div class = "line" > < a name = "l01926" > < / a > < span class = "lineno" > 1926< / span >   < span class = "keywordflow" > continue< / span > ;< / div >
< div class = "line" > < a name = "l01927" > < / a > < span class = "lineno" > 1927< / span >   }< / div >
< div class = "line" > < a name = "l01928" > < / a > < span class = "lineno" > 1928< / span >   < / div >
< div class = "line" > < a name = "l01929" > < / a > < span class = "lineno" > 1929< / span >   < span class = "comment" > // Add the corresponding constraint to hs_model.< / span > < / div >
< div class = "line" > < a name = "l01930" > < / a > < span class = "lineno" > 1930< / span >   MPConstraintProto* < a class = "code" href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > = hs_model.add_constraint();< / div >
< div class = "line" > < a name = "l01931" > < / a > < span class = "lineno" > 1931< / span >   < a class = "code" href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > -> set_lower_bound(1.0);< / div >
< div class = "line" > < a name = "l01932" > < / a > < span class = "lineno" > 1932< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > lit : core) {< / div >
< div class = "line" > < a name = "l01933" > < / a > < span class = "lineno" > 1933< / span >   < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > :< / div >
< div class = "line" > < a name = "l01934" > < / a > < span class = "lineno" > 1934< / span >   < a class = "code" href = "namespacegtl.html#abce27d097bc5680207b294bdad75f59f" > gtl::FindOrDie< / a > (assumption_to_indices, lit.Index())) {< / div >
< div class = "line" > < a name = "l01935" > < / a > < span class = "lineno" > 1935< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > double< / span > lb = integer_trail-> LowerBound(variables[< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ]).value();< / div >
< div class = "line" > < a name = "l01936" > < / a > < span class = "lineno" > 1936< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > double< / span > hs_value = < a class = "code" href = "cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829" > response< / a > .variable_value(< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > );< / div >
< div class = "line" > < a name = "l01937" > < / a > < span class = "lineno" > 1937< / span >   < span class = "keywordflow" > if< / span > (hs_value == lb) {< / div >
< div class = "line" > < a name = "l01938" > < / a > < span class = "lineno" > 1938< / span >   < a class = "code" href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > -> add_var_index(< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > );< / div >
< div class = "line" > < a name = "l01939" > < / a > < span class = "lineno" > 1939< / span >   < a class = "code" href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > -> add_coefficient(1.0);< / div >
< div class = "line" > < a name = "l01940" > < / a > < span class = "lineno" > 1940< / span >   < a class = "code" href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > -> set_lower_bound(< a class = "code" href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > -> lower_bound() + lb);< / div >
< div class = "line" > < a name = "l01941" > < / a > < span class = "lineno" > 1941< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l01942" > < / a > < span class = "lineno" > 1942< / span >   < span class = "keyword" > const< / span > std::pair< int, double> key = {< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > , hs_value};< / div >
< div class = "line" > < a name = "l01943" > < / a > < span class = "lineno" > 1943< / span >   < span class = "keywordflow" > if< / span > (!< a class = "code" href = "namespacegtl.html#aae28e97bd1fa93cb0032642550da7455" > gtl::ContainsKey< / a > (created_var, key)) {< / div >
< div class = "line" > < a name = "l01944" > < / a > < span class = "lineno" > 1944< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > new_var_index = hs_model.variable_size();< / div >
< div class = "line" > < a name = "l01945" > < / a > < span class = "lineno" > 1945< / span >   created_var[key] = new_var_index;< / div >
< div class = "line" > < a name = "l01946" > < / a > < span class = "lineno" > 1946< / span >   < / div >
< div class = "line" > < a name = "l01947" > < / a > < span class = "lineno" > 1947< / span >   MPVariableProto* new_var = hs_model.add_variable();< / div >
< div class = "line" > < a name = "l01948" > < / a > < span class = "lineno" > 1948< / span >   new_var-> set_lower_bound(0);< / div >
< div class = "line" > < a name = "l01949" > < / a > < span class = "lineno" > 1949< / span >   new_var-> set_upper_bound(1);< / div >
< div class = "line" > < a name = "l01950" > < / a > < span class = "lineno" > 1950< / span >   new_var-> set_is_integer(< span class = "keyword" > true< / span > );< / div >
< div class = "line" > < a name = "l01951" > < / a > < span class = "lineno" > 1951< / span >   < / div >
< div class = "line" > < a name = "l01952" > < / a > < span class = "lineno" > 1952< / span >   < span class = "comment" > // (new_var == 1) => x > hs_value.< / span > < / div >
< div class = "line" > < a name = "l01953" > < / a > < span class = "lineno" > 1953< / span >   < span class = "comment" > // (x - lb) - (hs_value - lb + 1) * new_var > = 0.< / span > < / div >
< div class = "line" > < a name = "l01954" > < / a > < span class = "lineno" > 1954< / span >   MPConstraintProto* implication = hs_model.add_constraint();< / div >
< div class = "line" > < a name = "l01955" > < / a > < span class = "lineno" > 1955< / span >   implication-> set_lower_bound(lb);< / div >
< div class = "line" > < a name = "l01956" > < / a > < span class = "lineno" > 1956< / span >   implication-> add_var_index(< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > );< / div >
< div class = "line" > < a name = "l01957" > < / a > < span class = "lineno" > 1957< / span >   implication-> add_coefficient(1.0);< / div >
< div class = "line" > < a name = "l01958" > < / a > < span class = "lineno" > 1958< / span >   implication-> add_var_index(new_var_index);< / div >
< div class = "line" > < a name = "l01959" > < / a > < span class = "lineno" > 1959< / span >   implication-> add_coefficient(lb - hs_value - 1);< / div >
< div class = "line" > < a name = "l01960" > < / a > < span class = "lineno" > 1960< / span >   }< / div >
< div class = "line" > < a name = "l01961" > < / a > < span class = "lineno" > 1961< / span >   < a class = "code" href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > -> add_var_index(< a class = "code" href = "namespacegtl.html#ad8c492791dfd0115c7cdddd24678666f" > gtl::FindOrDieNoPrint< / a > (created_var, key));< / div >
< div class = "line" > < a name = "l01962" > < / a > < span class = "lineno" > 1962< / span >   < a class = "code" href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > -> add_coefficient(1.0);< / div >
< div class = "line" > < a name = "l01963" > < / a > < span class = "lineno" > 1963< / span >   }< / div >
< div class = "line" > < a name = "l01964" > < / a > < span class = "lineno" > 1964< / span >   }< / div >
< div class = "line" > < a name = "l01965" > < / a > < span class = "lineno" > 1965< / span >   }< / div >
< div class = "line" > < a name = "l01966" > < / a > < span class = "lineno" > 1966< / span >   }< / div >
< div class = "line" > < a name = "l01967" > < / a > < span class = "lineno" > 1967< / span >   }< / div >
< div class = "line" > < a name = "l01968" > < / a > < span class = "lineno" > 1968< / span >   < / div >
< div class = "line" > < a name = "l01969" > < / a > < span class = "lineno" > 1969< / span >   < span class = "keywordflow" > return< / span > result;< / div >
2021-01-26 11:28:50 +01:00
< div class = "line" > < a name = "l01970" > < / a > < span class = "lineno" > 1970< / span >   < span class = "preprocessor" > #else < / span > < span class = "comment" > // !__PORTABLE_PLATFORM__ & & USE_SCIP< / span > < / div >
2020-11-18 14:53:30 +01:00
< div class = "line" > < a name = "l01971" > < / a > < span class = "lineno" > 1971< / span >   < a class = "code" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code" href = "log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda" > FATAL< / a > ) < < < span class = "stringliteral" > " Not supported." < / span > ;< / div >
2021-01-26 11:28:50 +01:00
< div class = "line" > < a name = "l01972" > < / a > < span class = "lineno" > 1972< / span >   < span class = "preprocessor" > #endif < / span > < span class = "comment" > // !__PORTABLE_PLATFORM__ & & USE_SCIP< / span > < / div >
2020-10-09 12:00:09 +02:00
< div class = "line" > < a name = "l01973" > < / a > < span class = "lineno" > 1973< / span >   }< / div >
< div class = "line" > < a name = "l01974" > < / a > < span class = "lineno" > 1974< / span >   < / div >
< div class = "line" > < a name = "l01975" > < / a > < span class = "lineno" > 1975< / span >   } < span class = "comment" > // namespace sat< / span > < / div >
< div class = "line" > < a name = "l01976" > < / a > < span class = "lineno" > 1976< / span >   } < span class = "comment" > // namespace operations_research< / span > < / div >
2020-09-02 09:42:51 +02:00
< div class = "ttc" id = "aalldiff__cst_8cc_html_a021e695f54a13bd809c34b2f4ca87c37" > < div class = "ttname" > < a href = "alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37" > min< / a > < / div > < div class = "ttdeci" > int64 min< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "alldiff__cst_8cc_source.html#l00138" > alldiff_cst.cc:138< / a > < / div > < / div >
< div class = "ttc" id = "aalldiff__cst_8cc_html_a9d0c202d5fdd62f4fa2c613339ff168a" > < div class = "ttname" > < a href = "alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a" > max< / a > < / div > < div class = "ttdeci" > int64 max< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "alldiff__cst_8cc_source.html#l00139" > alldiff_cst.cc:139< / a > < / div > < / div >
< div class = "ttc" id = "abase_2logging_8h_html" > < div class = "ttname" > < a href = "base_2logging_8h.html" > logging.h< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274" > < div class = "ttname" > < a href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > < / div > < div class = "ttdeci" > #define CHECK(condition)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "base_2logging_8h_source.html#l00495" > base/logging.h:495< / a > < / div > < / div >
2020-11-18 14:53:30 +01:00
< div class = "ttc" id = "abase_2logging_8h_html_a4bd2e815ca2f702a4b6aa744b1ff3b82" > < div class = "ttname" > < a href = "base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82" > CHECK_LT< / a > < / div > < div class = "ttdeci" > #define CHECK_LT(val1, val2)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "base_2logging_8h_source.html#l00700" > base/logging.h:700< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "abase_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#l00697" > base/logging.h:697< / a > < / div > < / div >
< div class = "ttc" id = "abase_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9" > < div class = "ttname" > < a href = "base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9" > CHECK_GE< / a > < / div > < div class = "ttdeci" > #define CHECK_GE(val1, val2)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "base_2logging_8h_source.html#l00701" > base/logging.h:701< / a > < / div > < / div >
< div class = "ttc" id = "abase_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#l00702" > base/logging.h:702< / a > < / div > < / div >
< div class = "ttc" id = "abase_2logging_8h_html_ab25e01a2942b821d66371fc68d53f2eb" > < div class = "ttname" > < a href = "base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb" > CHECK_NE< / a > < / div > < div class = "ttdeci" > #define CHECK_NE(val1, val2)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "base_2logging_8h_source.html#l00698" > base/logging.h:698< / a > < / div > < / div >
< div class = "ttc" id = "abase_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae" > < div class = "ttname" > < a href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > < / div > < div class = "ttdeci" > #define LOG(severity)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "base_2logging_8h_source.html#l00420" > base/logging.h:420< / a > < / div > < / div >
< div class = "ttc" id = "abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006" > < div class = "ttname" > < a href = "base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006" > DCHECK< / a > < / div > < div class = "ttdeci" > #define DCHECK(condition)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "base_2logging_8h_source.html#l00884" > base/logging.h:884< / a > < / div > < / div >
< div class = "ttc" id = "abase_2logging_8h_html_ae4db23f10f5d4aad6d735f5a74cd6f8c" > < div class = "ttname" > < a href = "base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c" > CHECK_LE< / a > < / div > < div class = "ttdeci" > #define CHECK_LE(val1, val2)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "base_2logging_8h_source.html#l00699" > base/logging.h:699< / a > < / div > < / div >
< div class = "ttc" id = "abase_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927" > < div class = "ttname" > < a href = "base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927" > VLOG< / a > < / div > < div class = "ttdeci" > #define VLOG(verboselevel)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "base_2logging_8h_source.html#l00978" > base/logging.h:978< / a > < / div > < / div >
< div class = "ttc" id = "aboolean__problem_8h_html" > < div class = "ttname" > < a href = "boolean__problem_8h.html" > boolean_problem.h< / a > < / div > < / div >
2021-02-16 18:34:57 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1_m_p_solver_html_a5a1af4aceca49fa23cdeec088394dea4" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_p_solver.html#a5a1af4aceca49fa23cdeec088394dea4" > operations_research::MPSolver::SolveWithProto< / a > < / div > < div class = "ttdeci" > static void SolveWithProto(const MPModelRequest & model_request, MPSolutionResponse *response)< / div > < div class = "ttdoc" > Solves the model encoded by a MPModelRequest protocol buffer and fills the solution encoded as a MPSo...< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8cc_source.html#l00838" > linear_solver.cc:838< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1_m_t_random_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_t_random.html" > operations_research::MTRandom< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "random_8h_source.html#l00055" > random.h:55< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_time_limit_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_time_limit.html" > operations_research::TimeLimit< / a > < / div > < div class = "ttdoc" > A simple class to enforce both an elapsed time limit and a deterministic time limit in the same threa...< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "time__limit_8h_source.html#l00105" > time_limit.h:105< / a > < / div > < / div >
2021-02-26 14:48:18 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1_time_limit_html_a810d5f7aaf80cc09cf5a094e20c1aaca" > < div class = "ttname" > < a href = "classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca" > operations_research::TimeLimit::LimitReached< / a > < / div > < div class = "ttdeci" > bool LimitReached()< / div > < div class = "ttdoc" > Returns true when the external limit is true, or the deterministic time is over the deterministic lim...< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "time__limit_8h_source.html#l00532" > time_limit.h:532< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1_time_limit_html_ac7e861414a70fc937d18bc7ca743fc98" > < div class = "ttname" > < a href = "classoperations__research_1_1_time_limit.html#ac7e861414a70fc937d18bc7ca743fc98" > operations_research::TimeLimit::GetElapsedDeterministicTime< / a > < / div > < div class = "ttdeci" > double GetElapsedDeterministicTime() const< / div > < div class = "ttdoc" > Returns the elapsed deterministic time since the construction of this object.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "time__limit_8h_source.html#l00260" > time_limit.h:260< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_core_based_optimizer_html_a02a9dc1603fd32ca7d13e2db95316bb2" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_core_based_optimizer.html#a02a9dc1603fd32ca7d13e2db95316bb2" > operations_research::sat::CoreBasedOptimizer::CoreBasedOptimizer< / a > < / div > < div class = "ttdeci" > CoreBasedOptimizer(IntegerVariable objective_var, const std::vector< IntegerVariable > & variables, const std::vector< IntegerValue > & coefficients, std::function< void()> feasible_solution_observer, Model *model)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "optimization_8cc_source.html#l01310" > optimization.cc:1310< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_core_based_optimizer_html_a4398d89730acb3b628a3c81d55bac96f" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_core_based_optimizer.html#a4398d89730acb3b628a3c81d55bac96f" > operations_research::sat::CoreBasedOptimizer::Optimize< / a > < / div > < div class = "ttdeci" > SatSolver::Status Optimize()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "optimization_8cc_source.html#l01540" > optimization.cc:1540< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_encoding_node_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_encoding_node.html" > operations_research::sat::EncodingNode< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "encoding_8h_source.html#l00053" > encoding.h:53< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_encoding_node_html_a6fdd73f8011695b97659f2bea29325cb" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_encoding_node.html#a6fdd73f8011695b97659f2bea29325cb" > operations_research::sat::EncodingNode::depth< / a > < / div > < div class = "ttdeci" > int depth() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "encoding_8h_source.html#l00108" > encoding.h:108< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_encoding_node_html_a8d59d3e1fa9887ff055c7a6853055198" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_encoding_node.html#a8d59d3e1fa9887ff055c7a6853055198" > operations_research::sat::EncodingNode::literal< / a > < / div > < div class = "ttdeci" > Literal literal(int i) const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "encoding_8h_source.html#l00078" > encoding.h:78< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_integer_encoder_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_integer_encoder.html" > operations_research::sat::IntegerEncoder< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l00276" > integer.h:276< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_integer_encoder_html_afcd4038298bec97a2f7a61274c6ef8c7" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_integer_encoder.html#afcd4038298bec97a2f7a61274c6ef8c7" > operations_research::sat::IntegerEncoder::GetOrCreateAssociatedLiteral< / a > < / div > < div class = "ttdeci" > Literal GetOrCreateAssociatedLiteral(IntegerLiteral i_lit)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8cc_source.html#l00202" > integer.cc:202< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_integer_trail_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_integer_trail.html" > operations_research::sat::IntegerTrail< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l00540" > integer.h:540< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_integer_trail_html_a05e837bb93eeabbbd94e8f690dd59d32" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32" > operations_research::sat::IntegerTrail::Enqueue< / a > < / div > < div class = "ttdeci" > ABSL_MUST_USE_RESULT bool Enqueue(IntegerLiteral i_lit, absl::Span< const Literal > literal_reason, absl::Span< const IntegerLiteral > integer_reason)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8cc_source.html#l00989" > integer.cc:989< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_integer_trail_html_a309d057e12c8d4d393f13975eea2e2a9" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_integer_trail.html#a309d057e12c8d4d393f13975eea2e2a9" > operations_research::sat::IntegerTrail::IsCurrentlyIgnored< / a > < / div > < div class = "ttdeci" > bool IsCurrentlyIgnored(IntegerVariable i) const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l00625" > integer.h:625< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_integer_trail_html_a8b6d5a25e6ad3d28a85b1924471e2cac" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac" > operations_research::sat::IntegerTrail::UpperBound< / a > < / div > < div class = "ttdeci" > IntegerValue UpperBound(IntegerVariable i) const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l01304" > integer.h:1304< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_integer_trail_html_a9ab880b5e67213a0607c5c3935da9f08" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08" > operations_research::sat::IntegerTrail::LevelZeroUpperBound< / a > < / div > < div class = "ttdeci" > IntegerValue LevelZeroUpperBound(IntegerVariable var) const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l01355" > integer.h:1355< / a > < / div > < / div >
2020-12-07 17:47:46 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_integer_trail_html_aa2d7b702e17a5cd4108b465385dd9acd" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_integer_trail.html#aa2d7b702e17a5cd4108b465385dd9acd" > operations_research::sat::IntegerTrail::AddIntegerVariable< / a > < / div > < div class = "ttdeci" > IntegerVariable AddIntegerVariable(IntegerValue lower_bound, IntegerValue upper_bound)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8cc_source.html#l00603" > integer.cc:603< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_integer_trail_html_aa68cc40c827bff2fb311040e2b848f9b" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b" > operations_research::sat::IntegerTrail::LevelZeroLowerBound< / a > < / div > < div class = "ttdeci" > IntegerValue LevelZeroLowerBound(IntegerVariable var) const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l01350" > integer.h:1350< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_integer_trail_html_ab857cd2aead68952d9fe92a8ad8d3ac9" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9" > operations_research::sat::IntegerTrail::LowerBound< / a > < / div > < div class = "ttdeci" > IntegerValue LowerBound(IntegerVariable i) const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l01300" > integer.h:1300< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_literal_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_literal.html" > operations_research::sat::Literal< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__base_8h_source.html#l00064" > sat_base.h:64< / a > < / div > < / div >
2020-10-09 12:00:09 +02:00
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_literal_html_a886e9c024f7209181c0a850b6e90c644" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644" > operations_research::sat::Literal::Negated< / a > < / div > < div class = "ttdeci" > Literal Negated() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__base_8h_source.html#l00091" > sat_base.h:91< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_model_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_model.html" > operations_research::sat::Model< / a > < / div > < div class = "ttdoc" > Class that owns everything related to a particular optimization model.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat_2model_8h_source.html#l00038" > sat/model.h:38< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_model_html_a7b8d774b566431b8932ba0f3c921ec7d" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_model.html#a7b8d774b566431b8932ba0f3c921ec7d" > operations_research::sat::Model::Add< / a > < / div > < div class = "ttdeci" > T Add(std::function< T(Model *)> f)< / div > < div class = "ttdoc" > This makes it possible to have a nicer API on the client side, and it allows both of these forms:< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat_2model_8h_source.html#l00081" > sat/model.h:81< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html" > operations_research::sat::SatSolver< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00057" > sat_solver.h:57< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a05c49a95f6af6f8d873c96cae6ab6653" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653" > operations_research::sat::SatSolver::AddLinearConstraint< / a > < / div > < div class = "ttdeci" > bool AddLinearConstraint(bool use_lower_bound, Coefficient lower_bound, bool use_upper_bound, Coefficient upper_bound, std::vector< LiteralWithCoeff > *cst)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00299" > sat_solver.cc:299< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a0b58ef3a397720b272662f8bc45585cb" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb" > operations_research::sat::SatSolver::SetNumVariables< / a > < / div > < div class = "ttdeci" > void SetNumVariables(int num_variables)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00064" > sat_solver.cc:64< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a0e8b0117614d340615ab66abec430d78" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a0e8b0117614d340615ab66abec430d78" > operations_research::sat::SatSolver::AddTernaryClause< / a > < / div > < div class = "ttdeci" > bool AddTernaryClause(Literal a, Literal b, Literal c)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00191" > sat_solver.cc:191< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a1a5e26554d014197de9434d2c39e07e9" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9" > operations_research::sat::SatSolver::parameters< / a > < / div > < div class = "ttdeci" > const SatParameters & parameters() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00110" > sat_solver.cc:110< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a1dc177ee88f0a7ce2e46a032e5c3cf02" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a1dc177ee88f0a7ce2e46a032e5c3cf02" > operations_research::sat::SatSolver::ResetDecisionHeuristic< / a > < / div > < div class = "ttdeci" > void ResetDecisionHeuristic()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00156" > sat_solver.h:156< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a2abca6db0c780a4482d1ac9eb6365057" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a2abca6db0c780a4482d1ac9eb6365057" > operations_research::sat::SatSolver::ResetAndSolveWithGivenAssumptions< / a > < / div > < div class = "ttdeci" > Status ResetAndSolveWithGivenAssumptions(const std::vector< Literal > & assumptions)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00947" > sat_solver.cc:947< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a2b006481369eb4f4cb7f3037dfdd8404" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a2b006481369eb4f4cb7f3037dfdd8404" > operations_research::sat::SatSolver::Solve< / a > < / div > < div class = "ttdeci" > Status Solve()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00972" > sat_solver.cc:972< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a5ca47674a4a0b5e7f40eb430ab474440" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440" > operations_research::sat::SatSolver::SetAssumptionLevel< / a > < / div > < div class = "ttdeci" > void SetAssumptionLevel(int assumption_level)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00962" > sat_solver.cc:962< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70b" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > operations_research::sat::SatSolver::Status< / a > < / div > < div class = "ttdeci" > Status< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00180" > sat_solver.h:180< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > operations_research::sat::SatSolver::FEASIBLE< / a > < / div > < div class = "ttdeci" > @ FEASIBLE< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00183" > sat_solver.h:183< / a > < / div > < / div >
2020-12-29 22:27:47 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > operations_research::sat::SatSolver::INFEASIBLE< / a > < / div > < div class = "ttdeci" > @ INFEASIBLE< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00182" > sat_solver.h:182< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > operations_research::sat::SatSolver::LIMIT_REACHED< / a > < / div > < div class = "ttdeci" > @ LIMIT_REACHED< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00184" > sat_solver.h:184< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885" > operations_research::sat::SatSolver::ASSUMPTIONS_UNSAT< / a > < / div > < div class = "ttdeci" > @ ASSUMPTIONS_UNSAT< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00181" > sat_solver.h:181< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a9789bf03dba611e9be5679d6e902d0c8" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8" > operations_research::sat::SatSolver::Assignment< / a > < / div > < div class = "ttdeci" > const VariablesAssignment & Assignment() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00362" > sat_solver.h:362< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a9ae69b015a43c1a94e8815ab0dd8189c" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9ae69b015a43c1a94e8815ab0dd8189c" > operations_research::sat::SatSolver::EnqueueDecisionAndBackjumpOnConflict< / a > < / div > < div class = "ttdeci" > int EnqueueDecisionAndBackjumpOnConflict(Literal true_literal)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00499" > sat_solver.cc:499< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a9d3beb2afe4ae647674b054bf29290e2" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2" > operations_research::sat::SatSolver::NumVariables< / a > < / div > < div class = "ttdeci" > int NumVariables() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00082" > sat_solver.h:82< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a9d584b84d7b882a6017b072b33475172" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9d584b84d7b882a6017b072b33475172" > operations_research::sat::SatSolver::SetParameters< / a > < / div > < div class = "ttdeci" > void SetParameters(const SatParameters & parameters)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00115" > sat_solver.cc:115< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a9da38c8d2910442d551db5e360423029" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029" > operations_research::sat::SatSolver::ResetToLevelZero< / a > < / div > < div class = "ttdeci" > bool ResetToLevelZero()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00529" > sat_solver.cc:529< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_aac912e9410b8989493f492fcbb2d9094" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094" > operations_research::sat::SatSolver::AddBinaryClause< / a > < / div > < div class = "ttdeci" > bool AddBinaryClause(Literal a, Literal b)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00180" > sat_solver.cc:180< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_ab63a08713131e63e9cc4109f98ecf859" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#ab63a08713131e63e9cc4109f98ecf859" > operations_research::sat::SatSolver::EnqueueDecisionAndBacktrackOnConflict< / a > < / div > < div class = "ttdeci" > int EnqueueDecisionAndBacktrackOnConflict(Literal true_literal)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00861" > sat_solver.cc:861< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_ac035378cea0ed7b0978105547402faa8" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > operations_research::sat::SatSolver::Backtrack< / a > < / div > < div class = "ttdeci" > void Backtrack(int target_level)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00888" > sat_solver.cc:888< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_acfbfa9df611cb625ff79785c05784580" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#acfbfa9df611cb625ff79785c05784580" > operations_research::sat::SatSolver::GetLastIncompatibleDecisions< / a > < / div > < div class = "ttdeci" > std::vector< Literal > GetLastIncompatibleDecisions()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l01272" > sat_solver.cc:1272< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_ad2a33e1d9335cce63548abed6b5c8aab" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab" > operations_research::sat::SatSolver::IsModelUnsat< / a > < / div > < div class = "ttdeci" > bool IsModelUnsat() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00136" > sat_solver.h:136< / a > < / div > < / div >
2020-12-29 22:27:47 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_ad63c4461a1384629cb99413c6df8b9ca" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca" > operations_research::sat::SatSolver::CurrentDecisionLevel< / a > < / div > < div class = "ttdeci" > int CurrentDecisionLevel() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00360" > sat_solver.h:360< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_af67fe279478772a6d1492a7f673bda5d" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#af67fe279478772a6d1492a7f673bda5d" > operations_research::sat::SatSolver::AddProblemClause< / a > < / div > < div class = "ttdeci" > bool AddProblemClause(absl::Span< const Literal > literals)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00203" > sat_solver.cc:203< / a > < / div > < / div >
2020-11-18 14:53:30 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_afbbbc2f0845a82a5a5cfb3f00a61abe9" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9" > operations_research::sat::SatSolver::AddUnitClause< / a > < / div > < div class = "ttdeci" > bool AddUnitClause(Literal true_literal)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00164" > sat_solver.cc:164< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_variables_assignment_html_a5300129913f51dcb0b1c531e3248490e" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e" > operations_research::sat::VariablesAssignment::LiteralIsTrue< / a > < / div > < div class = "ttdeci" > bool LiteralIsTrue(Literal literal) const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__base_8h_source.html#l00150" > sat_base.h:150< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_variables_assignment_html_acfd1646011e643f58fd7dc66d9cc90a5" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5" > operations_research::sat::VariablesAssignment::LiteralIsFalse< / a > < / div > < div class = "ttdeci" > bool LiteralIsFalse(Literal literal) const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__base_8h_source.html#l00147" > sat_base.h:147< / a > < / div > < / div >
< div class = "ttc" id = "acleanup_8h_html" > < div class = "ttname" > < a href = "cleanup_8h.html" > cleanup.h< / a > < / div > < / div >
< div class = "ttc" id = "aconstraint__solver_2table_8cc_html_a344010e26426d6a13411648d988bc9b6" > < div class = "ttname" > < a href = "constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6" > b< / a > < / div > < div class = "ttdeci" > int64 b< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "constraint__solver_2table_8cc_source.html#l00043" > constraint_solver/table.cc:43< / a > < / div > < / div >
< div class = "ttc" id = "aconstraint__solver_2table_8cc_html_af730895c6c6ef6e03caaf6251192dfd2" > < div class = "ttname" > < a href = "constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2" > a< / a > < / div > < div class = "ttdeci" > int64 a< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "constraint__solver_2table_8cc_source.html#l00042" > constraint_solver/table.cc:42< / a > < / div > < / div >
< div class = "ttc" id = "acp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219" > < div class = "ttname" > < a href = "cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219" > parameters< / a > < / div > < div class = "ttdeci" > SatParameters parameters< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "cp__model__fz__solver_8cc_source.html#l00108" > cp_model_fz_solver.cc:108< / a > < / div > < / div >
2021-02-26 14:48:18 +01:00
< div class = "ttc" id = "acp__model__solver_8cc_html_abcd33b18ce6d5a90a4ba5c37cfa58829" > < div class = "ttname" > < a href = "cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829" > response< / a > < / div > < div class = "ttdeci" > SharedResponseManager * response< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "cp__model__solver_8cc_source.html#l02118" > cp_model_solver.cc:2118< / a > < / div > < / div >
< div class = "ttc" id = "acp__model__solver_8cc_html_ac3cf9db02b23ea1455b5ae6955d03e47" > < div class = "ttname" > < a href = "cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47" > time_limit< / a > < / div > < div class = "ttdeci" > SharedTimeLimit * time_limit< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "cp__model__solver_8cc_source.html#l02116" > cp_model_solver.cc:2116< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "ademon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695" > < div class = "ttname" > < a href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > < / div > < div class = "ttdeci" > const Constraint * ct< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "demon__profiler_8cc_source.html#l00042" > demon_profiler.cc:42< / a > < / div > < / div >
< div class = "ttc" id = "ademon__profiler_8cc_html_a21edc7ca4cc5802c8779d68556bc09cf" > < div class = "ttname" > < a href = "demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf" > value< / a > < / div > < div class = "ttdeci" > int64 value< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "demon__profiler_8cc_source.html#l00043" > demon_profiler.cc:43< / a > < / div > < / div >
< div class = "ttc" id = "aencoding_8h_html" > < div class = "ttname" > < a href = "encoding_8h.html" > encoding.h< / a > < / div > < / div >
< div class = "ttc" id = "aexpr__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#l01858" > expr_array.cc:1858< / a > < / div > < / div >
< div class = "ttc" id = "agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf" > < div class = "ttname" > < a href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > < / div > < div class = "ttdeci" > GRBmodel * model< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "gurobi__interface_8cc_source.html#l00272" > gurobi_interface.cc:272< / a > < / div > < / div >
2020-09-02 09:42:51 +02:00
< div class = "ttc" id = "aint__type_8h_html" > < div class = "ttname" > < a href = "int__type_8h.html" > int_type.h< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "ainteger__expr_8h_html" > < div class = "ttname" > < a href = "integer__expr_8h.html" > integer_expr.h< / a > < / div > < / div >
2021-02-16 18:34:57 +01:00
< div class = "ttc" id = "aintegral__types_8h_html_a74ea76ea27f48fb1b6e148e1577b3719" > < div class = "ttname" > < a href = "integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719" > kint64max< / a > < / div > < div class = "ttdeci" > static const int64 kint64max< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integral__types_8h_source.html#l00053" > integral_types.h:53< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a" > < div class = "ttname" > < a href = "integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a" > int64< / a > < / div > < div class = "ttdeci" > int64_t int64< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integral__types_8h_source.html#l00034" > integral_types.h:34< / a > < / div > < / div >
< div class = "ttc" id = "alinear__solver_8h_html" > < div class = "ttname" > < a href = "linear__solver_8h.html" > linear_solver.h< / a > < / div > < div class = "ttdoc" > A C++ wrapper that provides a simple and unified interface to several linear programming and mixed in...< / div > < / div >
< div class = "ttc" id = "alinear__solver_8pb_8h_html" > < div class = "ttname" > < a href = "linear__solver_8pb_8h.html" > linear_solver.pb.h< / a > < / div > < / div >
< div class = "ttc" id = "alog__severity_8h_html_ab4a2cbab234914b320b7fae11b6e8cb9" > < div class = "ttname" > < a href = "log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9" > INFO< / a > < / div > < div class = "ttdeci" > const int INFO< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "log__severity_8h_source.html#l00031" > log_severity.h:31< / a > < / div > < / div >
< div class = "ttc" id = "alog__severity_8h_html_acdd38e3c9f22f127d7776920e3079eda" > < div class = "ttname" > < a href = "log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda" > FATAL< / a > < / div > < div class = "ttdeci" > const int FATAL< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "log__severity_8h_source.html#l00032" > log_severity.h:32< / a > < / div > < / div >
< div class = "ttc" id = "amacros_8h_html" > < div class = "ttname" > < a href = "macros_8h.html" > macros.h< / a > < / div > < / div >
< div class = "ttc" id = "amacros_8h_html_af8df3547bfde53a5acb93e2607b0034a" > < div class = "ttname" > < a href = "macros_8h.html#af8df3547bfde53a5acb93e2607b0034a" > DISALLOW_COPY_AND_ASSIGN< / a > < / div > < div class = "ttdeci" > #define DISALLOW_COPY_AND_ASSIGN(TypeName)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "macros_8h_source.html#l00029" > macros.h:29< / a > < / div > < / div >
< div class = "ttc" id = "amap__util_8h_html" > < div class = "ttname" > < a href = "map__util_8h.html" > map_util.h< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceabsl_html_a9bfb260a67150f0bc1da17aac9199866" > < div class = "ttname" > < a href = "namespaceabsl.html#a9bfb260a67150f0bc1da17aac9199866" > absl::MakeCleanup< / a > < / div > < div class = "ttdeci" > absl::Cleanup< absl::decay_t< Callback > > MakeCleanup(Callback & & callback)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "cleanup_8h_source.html#l00120" > cleanup.h:120< / a > < / div > < / div >
2020-09-02 09:42:51 +02:00
< div class = "ttc" id = "anamespacegtl_html_a288a1dc92da5d3ad62d4bc4cec9e8b1d" > < div class = "ttname" > < a href = "namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d" > gtl::STLSortAndRemoveDuplicates< / a > < / div > < div class = "ttdeci" > void STLSortAndRemoveDuplicates(T *v, const LessFunc & less_func)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "stl__util_8h_source.html#l00058" > stl_util.h:58< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "anamespacegtl_html_aae28e97bd1fa93cb0032642550da7455" > < div class = "ttname" > < a href = "namespacegtl.html#aae28e97bd1fa93cb0032642550da7455" > gtl::ContainsKey< / a > < / div > < div class = "ttdeci" > bool ContainsKey(const Collection & collection, const Key & key)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "map__util_8h_source.html#l00170" > map_util.h:170< / a > < / div > < / div >
< div class = "ttc" id = "anamespacegtl_html_abce27d097bc5680207b294bdad75f59f" > < div class = "ttname" > < a href = "namespacegtl.html#abce27d097bc5680207b294bdad75f59f" > gtl::FindOrDie< / a > < / div > < div class = "ttdeci" > const Collection::value_type::second_type & FindOrDie(const Collection & collection, const typename Collection::value_type::first_type & key)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "map__util_8h_source.html#l00176" > map_util.h:176< / a > < / div > < / div >
< div class = "ttc" id = "anamespacegtl_html_ad8c492791dfd0115c7cdddd24678666f" > < div class = "ttname" > < a href = "namespacegtl.html#ad8c492791dfd0115c7cdddd24678666f" > gtl::FindOrDieNoPrint< / a > < / div > < div class = "ttdeci" > const Collection::value_type::second_type & FindOrDieNoPrint(const Collection & collection, const typename Collection::value_type::first_type & key)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "map__util_8h_source.html#l00186" > map_util.h:186< / 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#l00337" > boolean_problem.cc:337< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a1000a311929a470e5485258d765eeabd" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a1000a311929a470e5485258d765eeabd" > operations_research::sat::LowerBound< / a > < / div > < div class = "ttdeci" > std::function< int64(const Model & )> LowerBound(IntegerVariable v)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l01467" > integer.h:1467< / a > < / div > < / div >
2020-09-02 09:42:51 +02:00
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a1227e67513602591fb959e35c9de66e8" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8" > operations_research::sat::kMaxIntegerValue< / a > < / div > < div class = "ttdeci" > constexpr IntegerValue kMaxIntegerValue(std::numeric_limits< IntegerValue::ValueType > ::max() - 1)< / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a166c4d1be17bdfcad1986b1f72c49e52" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a166c4d1be17bdfcad1986b1f72c49e52" > operations_research::sat::RestrictObjectiveDomainWithBinarySearch< / a > < / div > < div class = "ttdeci" > void RestrictObjectiveDomainWithBinarySearch(IntegerVariable objective_var, const std::function< void()> & feasible_solution_observer, Model *model)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "optimization_8cc_source.html#l01091" > optimization.cc:1091< / a > < / div > < / div >
2020-09-02 09:42:51 +02: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-01-26 11:28:50 +01:00
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a17b20b0845d9e02829d417294aded36a" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a17b20b0845d9e02829d417294aded36a" > operations_research::sat::ResetAndSolveIntegerProblem< / a > < / div > < div class = "ttdeci" > SatSolver::Status ResetAndSolveIntegerProblem(const std::vector< Literal > & assumptions, Model *model)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer__search_8cc_source.html#l00891" > integer_search.cc:891< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a1b36a95b81f69a73d04b1b42fd40c4db" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a1b36a95b81f69a73d04b1b42fd40c4db" > operations_research::sat::SolveWithCardinalityEncodingAndCore< / a > < / div > < div class = "ttdeci" > SatSolver::Status SolveWithCardinalityEncodingAndCore(LogBehavior log, const LinearBooleanProblem & problem, SatSolver *solver, std::vector< bool > *solution)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "optimization_8cc_source.html#l00956" > optimization.cc:956< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a1c9d74b9b207b6e5513334dd135a00a9" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a1c9d74b9b207b6e5513334dd135a00a9" > operations_research::sat::ComputeCoreMinWeight< / a > < / div > < div class = "ttdeci" > Coefficient ComputeCoreMinWeight(const std::vector< EncodingNode * > & nodes, const std::vector< Literal > & core)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "encoding_8cc_source.html#l00418" > encoding.cc:418< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a29ff75f2188e0ac1c58fa4b0cf793a00" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a29ff75f2188e0ac1c58fa4b0cf793a00" > operations_research::sat::MergeAllNodesWithDeque< / a > < / div > < div class = "ttdeci" > EncodingNode * MergeAllNodesWithDeque(Coefficient upper_bound, const std::vector< EncodingNode * > & nodes, SatSolver *solver, std::deque< EncodingNode > *repository)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "encoding_8cc_source.html#l00263" > encoding.cc:263< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a2ef3eb1f5fe6506a5e24115f10d724fc" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a2ef3eb1f5fe6506a5e24115f10d724fc" > operations_research::sat::MoveOneUnprocessedLiteralLast< / a > < / div > < div class = "ttdeci" > int MoveOneUnprocessedLiteralLast(const std::set< LiteralIndex > & processed, int relevant_prefix_size, std::vector< Literal > *literals)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat_2util_8cc_source.html#l00024" > sat/util.cc:24< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a3c7b9fb850d243d90ea59790db13a676" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a3c7b9fb850d243d90ea59790db13a676" > operations_research::sat::ReduceNodesAndExtractAssumptions< / a > < / div > < div class = "ttdeci" > std::vector< Literal > ReduceNodesAndExtractAssumptions(Coefficient upper_bound, Coefficient stratified_lower_bound, Coefficient *lower_bound, std::vector< EncodingNode * > *nodes, SatSolver *solver)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "encoding_8cc_source.html#l00366" > encoding.cc:366< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a3f1a1b8a7a1a488e263a2e74f45d2a59" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59" > operations_research::sat::Value< / a > < / div > < div class = "ttdeci" > std::function< int64(const Model & )> Value(IntegerVariable v)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l01487" > integer.h:1487< / 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#l00308" > boolean_problem.cc:308< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a5cafa03de29acf965c3fc23dfa7eba0a" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a5cafa03de29acf965c3fc23dfa7eba0a" > operations_research::sat::SolveWithLinearScan< / a > < / div > < div class = "ttdeci" > SatSolver::Status SolveWithLinearScan(LogBehavior log, const LinearBooleanProblem & problem, SatSolver *solver, std::vector< bool > *solution)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "optimization_8cc_source.html#l00842" > optimization.cc:842< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a6fb8349259fa849de0789a4ec58a8492" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a6fb8349259fa849de0789a4ec58a8492" > operations_research::sat::MinimizeCore< / a > < / div > < div class = "ttdeci" > void MinimizeCore(SatSolver *solver, std::vector< Literal > *core)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l02547" > sat_solver.cc:2547< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a7d1c65f24756bb9dad18da1f5e82bb9c" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a7d1c65f24756bb9dad18da1f5e82bb9c" > operations_research::sat::MinimizeWithHittingSetAndLazyEncoding< / a > < / div > < div class = "ttdeci" > SatSolver::Status MinimizeWithHittingSetAndLazyEncoding(const ObjectiveDefinition & objective_definition, const std::function< void()> & feasible_solution_observer, Model *model)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "optimization_8cc_source.html#l01757" > optimization.cc:1757< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a8bea9a6a0de60c8fdab99ad7dfdf8498" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a8bea9a6a0de60c8fdab99ad7dfdf8498" > operations_research::sat::SolveIntegerProblem< / a > < / div > < div class = "ttdeci" > SatSolver::Status SolveIntegerProblem(Model *model)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer__search_8cc_source.html#l00652" > integer_search.cc:652< / a > < / div > < / div >
2020-11-18 14:53:30 +01:00
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a949fa684e53fd6a18a2d1f79133fd80a" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a949fa684e53fd6a18a2d1f79133fd80a" > operations_research::sat::WeightedSumLowerOrEqual< / a > < / div > < div class = "ttdeci" > std::function< void(Model *)> WeightedSumLowerOrEqual(const std::vector< IntegerVariable > & vars, const VectorInt & coefficients, int64 upper_bound)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer__expr_8h_source.html#l00299" > integer_expr.h:299< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_aa4fe3dc3bb5374a3ae58ae0f551be128" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#aa4fe3dc3bb5374a3ae58ae0f551be128" > operations_research::sat::SolveWithWPM1< / a > < / div > < div class = "ttdeci" > SatSolver::Status SolveWithWPM1(LogBehavior log, const LinearBooleanProblem & problem, SatSolver *solver, std::vector< bool > *solution)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "optimization_8cc_source.html#l00465" > optimization.cc:465< / 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#l00361" > boolean_problem.cc:361< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_aae43e784db06c0974ce59ebbe8dd2b22" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22" > operations_research::sat::NegationOf< / a > < / div > < div class = "ttdeci" > std::vector< IntegerVariable > NegationOf(const std::vector< IntegerVariable > & vars)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8cc_source.html#l00027" > integer.cc:27< / a > < / div > < / div >
2021-02-26 14:48:18 +01:00
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_ab76a35e6ff810ad9ea8b58c7c11606cb" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#ab76a35e6ff810ad9ea8b58c7c11606cb" > operations_research::sat::MinimizeCoreWithPropagation< / a > < / div > < div class = "ttdeci" > void MinimizeCoreWithPropagation(TimeLimit *limit, SatSolver *solver, std::vector< Literal > *core)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "optimization_8cc_source.html#l00218" > optimization.cc:218< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_ab87119f7f6691eca8af4c552828fc4c4" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#ab87119f7f6691eca8af4c552828fc4c4" > operations_research::sat::ProcessCore< / a > < / div > < div class = "ttdeci" > void ProcessCore(const std::vector< Literal > & core, Coefficient min_weight, std::deque< EncodingNode > *repository, std::vector< EncodingNode * > *nodes, SatSolver *solver)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "encoding_8cc_source.html#l00445" > encoding.cc:445< / a > < / div > < / div >
2020-12-29 22:27:47 +01:00
< 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#l00347" > boolean_problem.cc:347< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_ac8d4f52bbb23604c511dfeca406b1685" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#ac8d4f52bbb23604c511dfeca406b1685" > operations_research::sat::SolveWithFuMalik< / a > < / div > < div class = "ttdeci" > SatSolver::Status SolveWithFuMalik(LogBehavior log, const LinearBooleanProblem & problem, SatSolver *solver, std::vector< bool > *solution)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "optimization_8cc_source.html#l00268" > optimization.cc:268< / a > < / div > < / div >
2020-09-02 09:42:51 +02:00
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_ad6c9cfad7e2fa7ae1bbff31720394436" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#ad6c9cfad7e2fa7ae1bbff31720394436" > operations_research::sat::MaxNodeWeightSmallerThan< / a > < / div > < div class = "ttdeci" > Coefficient MaxNodeWeightSmallerThan(const std::vector< EncodingNode * > & nodes, Coefficient upper_bound)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "encoding_8cc_source.html#l00433" > encoding.cc:433< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_adb8f016144f3565c4b693b59f9dc69b8" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#adb8f016144f3565c4b693b59f9dc69b8" > operations_research::sat::SolveWithRandomParameters< / a > < / div > < div class = "ttdeci" > SatSolver::Status SolveWithRandomParameters(LogBehavior log, const LinearBooleanProblem & problem, int num_times, SatSolver *solver, std::vector< bool > *solution)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "optimization_8cc_source.html#l00762" > optimization.cc:762< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_ae471a0701f750ca0c32a3fe8828f04f2" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#ae471a0701f750ca0c32a3fe8828f04f2" > operations_research::sat::SolveWithCardinalityEncoding< / a > < / div > < div class = "ttdeci" > SatSolver::Status SolveWithCardinalityEncoding(LogBehavior log, const LinearBooleanProblem & problem, SatSolver *solver, std::vector< bool > *solution)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "optimization_8cc_source.html#l00888" > optimization.cc:888< / 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#l00051" > boolean_problem.cc:51< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_aea70549adb843d22d06bef763a0960c8" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#aea70549adb843d22d06bef763a0960c8" > operations_research::sat::CreateInitialEncodingNodes< / a > < / div > < div class = "ttdeci" > std::vector< EncodingNode * > CreateInitialEncodingNodes(const std::vector< Literal > & literals, const std::vector< Coefficient > & coeffs, Coefficient *offset, std::deque< EncodingNode > *repository)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "encoding_8cc_source.html#l00302" > encoding.cc:302< / a > < / div > < / div >
2021-02-26 14:48:18 +01:00
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_aef1ea7e6296a28c0fa0752328d8cb900" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#aef1ea7e6296a28c0fa0752328d8cb900" > operations_research::sat::RandomizeDecisionHeuristic< / a > < / div > < div class = "ttdeci" > void RandomizeDecisionHeuristic(URBG *random, SatParameters *parameters)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat_2util_8h_source.html#l00100" > sat/util.h:100< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_af6b2a98aa9ebc72821c544fac3e01238" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238" > operations_research::sat::LogBehavior< / a > < / div > < div class = "ttdeci" > LogBehavior< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "optimization_8h_source.html#l00047" > optimization.h:47< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_af6b2a98aa9ebc72821c544fac3e01238a6c3f20e225309c66fdb5481433e5bd2f" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#af6b2a98aa9ebc72821c544fac3e01238a6c3f20e225309c66fdb5481433e5bd2f" > operations_research::sat::STDOUT_LOG< / a > < / div > < div class = "ttdeci" > @ STDOUT_LOG< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "optimization_8h_source.html#l00047" > optimization.h:47< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_afd482f2c4b9533b4d1f7379a578e9b18" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#afd482f2c4b9533b4d1f7379a578e9b18" > operations_research::sat::kCoefficientMax< / a > < / div > < div class = "ttdeci" > const Coefficient kCoefficientMax(std::numeric_limits< Coefficient::ValueType > ::max())< / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_affe1669ec9e0e7cbd54e895bbbff43af" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#affe1669ec9e0e7cbd54e895bbbff43af" > operations_research::sat::MinimizeIntegerVariableWithLinearScanAndLazyEncoding< / a > < / div > < div class = "ttdeci" > SatSolver::Status MinimizeIntegerVariableWithLinearScanAndLazyEncoding(IntegerVariable objective_var, const std::function< void()> & feasible_solution_observer, Model *model)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "optimization_8cc_source.html#l01058" > optimization.cc:1058< / 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" > The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...< / 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 >
2020-09-02 09:42:51 +02:00
< div class = "ttc" id = "anamespaceoperations__research_html_a87d7aa58897e0042898d1c2207deda18" > < div class = "ttname" > < a href = "namespaceoperations__research.html#a87d7aa58897e0042898d1c2207deda18" > operations_research::ProtobufShortDebugString< / a > < / div > < div class = "ttdeci" > std::string ProtobufShortDebugString(const P & message)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "port_2proto__utils_8h_source.html#l00058" > port/proto_utils.h:58< / a > < / div > < / div >
2020-12-07 17:47:46 +01:00
< div class = "ttc" id = "anamespaceoperations__research_html_aeaeaf340789f2dd271dcf9204279cb1ba9cff14a44a54cc44f4b91d65e8cd73b1" > < div class = "ttname" > < a href = "namespaceoperations__research.html#aeaeaf340789f2dd271dcf9204279cb1ba9cff14a44a54cc44f4b91d65e8cd73b1" > operations_research::MPSOLVER_OPTIMAL< / a > < / div > < div class = "ttdeci" > @ MPSOLVER_OPTIMAL< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8pb_8h_source.html#l00228" > linear_solver.pb.h:228< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "aoptimization_8cc_html_a829582ce81a6c838e6f9c73c78814cff" > < div class = "ttname" > < a href = "optimization_8cc.html#a829582ce81a6c838e6f9c73c78814cff" > core_index< / a > < / div > < div class = "ttdeci" > int core_index< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "optimization_8cc_source.html#l00085" > optimization.cc:85< / a > < / div > < / div >
2020-09-02 09:42:51 +02:00
< div class = "ttc" id = "aoptimization_8cc_html_af63dcc00f2023fdf498e0829e6fb8a6b" > < div class = "ttname" > < a href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > < / div > < div class = "ttdeci" > Literal literal< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "optimization_8cc_source.html#l00084" > optimization.cc:84< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "aoptimization_8h_html" > < div class = "ttname" > < a href = "optimization_8h.html" > optimization.h< / a > < / div > < / div >
< div class = "ttc" id = "apack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0" > < div class = "ttname" > < a href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > < / div > < div class = "ttdeci" > int index< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "pack_8cc_source.html#l00508" > pack.cc:508< / a > < / div > < / div >
< div class = "ttc" id = "apack_8cc_html_ae42ca38a167164c07831993889216903" > < div class = "ttname" > < a href = "pack_8cc.html#ae42ca38a167164c07831993889216903" > weight< / a > < / div > < div class = "ttdeci" > int64 weight< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "pack_8cc_source.html#l00509" > pack.cc:509< / a > < / div > < / div >
< 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 = "aport_2proto__utils_8h_html" > < div class = "ttname" > < a href = "port_2proto__utils_8h.html" > proto_utils.h< / a > < / div > < / div >
< div class = "ttc" id = "arandom_8h_html" > < div class = "ttname" > < a href = "random_8h.html" > random.h< / a > < / div > < / div >
< div class = "ttc" id = "arouting__flow_8cc_html_a26a8cbbc7bcf4117c2bf65104b4a54b4" > < div class = "ttname" > < a href = "routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4" > cost< / a > < / div > < div class = "ttdeci" > int64 cost< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "routing__flow_8cc_source.html#l00130" > routing_flow.cc:130< / a > < / div > < / div >
< div class = "ttc" id = "asat_2lp__utils_8cc_html_ab1734711414da2e668957d24a41b1ddf" > < div class = "ttname" > < a href = "sat_2lp__utils_8cc.html#ab1734711414da2e668957d24a41b1ddf" > coefficients< / a > < / div > < div class = "ttdeci" > std::vector< double > coefficients< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat_2lp__utils_8cc_source.html#l00496" > sat/lp_utils.cc:496< / a > < / div > < / div >
< div class = "ttc" id = "asat_2util_8h_html" > < div class = "ttname" > < a href = "sat_2util_8h.html" > util.h< / a > < / div > < / div >
< div class = "ttc" id = "asat__parameters_8pb_8h_html" > < div class = "ttname" > < a href = "sat__parameters_8pb_8h.html" > sat_parameters.pb.h< / a > < / div > < / div >
< div class = "ttc" id = "astl__util_8h_html" > < div class = "ttname" > < a href = "stl__util_8h.html" > stl_util.h< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_integer_literal_html_a3e2eb445631727dd4abf1d5343f16b2f" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f" > operations_research::sat::IntegerLiteral::LowerOrEqual< / a > < / div > < div class = "ttdeci" > static IntegerLiteral LowerOrEqual(IntegerVariable i, IntegerValue bound)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l01270" > integer.h:1270< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_integer_literal_html_a6c233aafac25ea66d69de93a83c9be63" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63" > operations_research::sat::IntegerLiteral::GreaterOrEqual< / a > < / div > < div class = "ttdeci" > static IntegerLiteral GreaterOrEqual(IntegerVariable i, IntegerValue bound)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l01264" > integer.h:1264< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_literal_with_coeff_html" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_literal_with_coeff.html" > operations_research::sat::LiteralWithCoeff< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "pb__constraint_8h_source.html#l00049" > pb_constraint.h:49< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_objective_definition_html" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_objective_definition.html" > operations_research::sat::ObjectiveDefinition< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "cp__model__loader_8h_source.html#l00038" > cp_model_loader.h:38< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_objective_definition_html_a4053d5aed2a34995e0aeb2042878ca7a" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_objective_definition.html#a4053d5aed2a34995e0aeb2042878ca7a" > operations_research::sat::ObjectiveDefinition::coeffs< / a > < / div > < div class = "ttdeci" > std::vector< IntegerValue > coeffs< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "cp__model__loader_8h_source.html#l00048" > cp_model_loader.h:48< / a > < / div > < / div >
2020-10-09 12:00:09 +02:00
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_objective_definition_html_a73e4094f2d4e2adbe5e8d79a5b61fcd1" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_objective_definition.html#a73e4094f2d4e2adbe5e8d79a5b61fcd1" > operations_research::sat::ObjectiveDefinition::vars< / a > < / div > < div class = "ttdeci" > std::vector< IntegerVariable > vars< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "cp__model__loader_8h_source.html#l00047" > cp_model_loader.h:47< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_objective_definition_html_aa3c0b31567c91babfffd5f9afc3161dc" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_objective_definition.html#aa3c0b31567c91babfffd5f9afc3161dc" > operations_research::sat::ObjectiveDefinition::objective_var< / a > < / div > < div class = "ttdeci" > IntegerVariable objective_var< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "cp__model__loader_8h_source.html#l00041" > cp_model_loader.h:41< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_objective_definition_html_adb0775f26a8a26bbd760d700d66c5281" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_objective_definition.html#adb0775f26a8a26bbd760d700d66c5281" > operations_research::sat::ObjectiveDefinition::ScaleIntegerObjective< / a > < / div > < div class = "ttdeci" > double ScaleIntegerObjective(IntegerValue value) const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "cp__model__loader_8h_source.html#l00055" > cp_model_loader.h:55< / a > < / div > < / div >
< div class = "ttc" id = "atime__limit_8h_html" > < div class = "ttname" > < a href = "time__limit_8h.html" > time_limit.h< / a > < / div > < / div >
< div class = "ttc" id = "atimer_8h_html" > < div class = "ttname" > < a href = "timer_8h.html" > timer.h< / a > < / div > < / div >
< div class = "ttc" id = "atrace_8cc_html_a36bd74109f547f7f8198faf5a12d2879" > < div class = "ttname" > < a href = "trace_8cc.html#a36bd74109f547f7f8198faf5a12d2879" > message< / a > < / div > < div class = "ttdeci" > std::string message< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "trace_8cc_source.html#l00395" > trace.cc:395< / a > < / div > < / div >
< div class = "ttc" id = "avlog__is__on_8h_html_a956152cad330225654d128f35c00efce" > < div class = "ttname" > < a href = "vlog__is__on_8h.html#a956152cad330225654d128f35c00efce" > VLOG_IS_ON< / a > < / div > < div class = "ttdeci" > #define VLOG_IS_ON(verboselevel)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "vlog__is__on_8h_source.html#l00041" > vlog_is_on.h:41< / a > < / div > < / div >
< / div > <!-- fragment --> < / div > <!-- contents -->
< / div > <!-- doc - content -->
2020-09-02 09:42:51 +02:00
<!-- HTML footer for doxygen 1.8.18 -->
<!-- start footer part -->
< div id = "nav-path" class = "navpath" > <!-- id is needed for treeview function! -->
< ul >
< li class = "navelem" > < a class = "el" href = "dir_a7cc1eeded8f693d0da6c729bc88c45a.html" > ortools< / a > < / li > < li class = "navelem" > < a class = "el" href = "dir_dddac007a45022d9da6ea1dee012c3b9.html" > sat< / a > < / li > < li class = "navelem" > < a class = "el" href = "optimization_8cc.html" > optimization.cc< / 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-02 09:42:51 +02:00
< / ul >
< / div >
< / body >
< / html >
