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: linear_constraint_manager.h Source File< / title >
< link href = "tabs.css" rel = "stylesheet" type = "text/css" / >
< script type = "text/javascript" src = "jquery.js" > < / script >
< script type = "text/javascript" src = "dynsections.js" > < / script >
< link href = "navtree.css" rel = "stylesheet" type = "text/css" / >
< script type = "text/javascript" src = "resize.js" > < / script >
< script type = "text/javascript" src = "navtreedata.js" > < / script >
< script type = "text/javascript" src = "navtree.js" > < / script >
< link href = "search/search.css" rel = "stylesheet" type = "text/css" / >
< script type = "text/javascript" src = "search/searchdata.js" > < / script >
< script type = "text/javascript" src = "search/search.js" > < / script >
< link href = "doxygen.css" rel = "stylesheet" type = "text/css" / >
< link href = "styleSheet.tmp.css" rel = "stylesheet" type = "text/css" / >
< / head >
< body >
< div id = "top" > <!-- do not remove this div, it is closed by doxygen! -->
< div id = "titlearea" >
< table cellspacing = "0" cellpadding = "0" >
< tbody >
< tr style = "height: 56px;" >
< td id = "projectlogo" > < img alt = "Logo" src = "orLogo.png" / > < / td >
< td id = "projectalign" style = "padding-left: 0.5em;" >
< div id = "projectname" > OR-Tools
2021-04-27 23:00:03 +02:00
  < span id = "projectnumber" > 9.0< / span >
2020-09-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('linear__constraint__manager_8h_source.html',''); initResizable(); });
/* @license-end */
< / script >
< div id = "doc-content" >
<!-- window showing the filter options -->
< div id = "MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
< / div >
<!-- iframe showing the search results (closed by default) -->
< div id = "MSearchResultsWindow" >
< iframe src = "javascript:void(0)" frameborder = "0"
name="MSearchResults" id="MSearchResults">
< / iframe >
< / div >
< div class = "header" >
< div class = "headertitle" >
< div class = "title" > linear_constraint_manager.h< / div > < / div >
< / div > <!-- header -->
< div class = "contents" >
2021-04-27 23:00:03 +02:00
< a href = "linear__constraint__manager_8h.html" > Go to the documentation of this file.< / a > < div class = "fragment" > < div class = "line" > < a name = "l00001" > < / a > < span class = "lineno" > 1< / span >   < span class = "comment" > // Copyright 2010-2021 Google LLC< / span > < / div >
2020-09-02 09:42:51 +02:00
< div class = "line" > < a name = "l00002" > < / a > < span class = "lineno" > 2< / span >   < span class = "comment" > // Licensed under the Apache License, Version 2.0 (the " License" );< / span > < / div >
< div class = "line" > < a name = "l00003" > < / a > < span class = "lineno" > 3< / span >   < span class = "comment" > // you may not use this file except in compliance with the License.< / span > < / div >
< div class = "line" > < a name = "l00004" > < / a > < span class = "lineno" > 4< / span >   < span class = "comment" > // You may obtain a copy of the License at< / span > < / div >
< div class = "line" > < a name = "l00005" > < / a > < span class = "lineno" > 5< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00006" > < / a > < span class = "lineno" > 6< / span >   < span class = "comment" > // http://www.apache.org/licenses/LICENSE-2.0< / span > < / div >
< div class = "line" > < a name = "l00007" > < / a > < span class = "lineno" > 7< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00008" > < / a > < span class = "lineno" > 8< / span >   < span class = "comment" > // Unless required by applicable law or agreed to in writing, software< / span > < / div >
< div class = "line" > < a name = "l00009" > < / a > < span class = "lineno" > 9< / span >   < span class = "comment" > // distributed under the License is distributed on an " AS IS" BASIS,< / span > < / div >
< div class = "line" > < a name = "l00010" > < / a > < span class = "lineno" > 10< / span >   < span class = "comment" > // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.< / span > < / div >
< div class = "line" > < a name = "l00011" > < / a > < span class = "lineno" > 11< / span >   < span class = "comment" > // See the License for the specific language governing permissions and< / span > < / div >
< div class = "line" > < a name = "l00012" > < / a > < span class = "lineno" > 12< / span >   < span class = "comment" > // limitations under the License.< / span > < / div >
< div class = "line" > < a name = "l00013" > < / a > < span class = "lineno" > 13< / span >   < / div >
< div class = "line" > < a name = "l00014" > < / a > < span class = "lineno" > 14< / span >   < span class = "preprocessor" > #ifndef OR_TOOLS_SAT_LINEAR_CONSTRAINT_MANAGER_H_< / span > < / div >
< div class = "line" > < a name = "l00015" > < / a > < span class = "lineno" > 15< / span >   < span class = "preprocessor" > #define OR_TOOLS_SAT_LINEAR_CONSTRAINT_MANAGER_H_< / span > < / div >
< div class = "line" > < a name = "l00016" > < / a > < span class = "lineno" > 16< / span >   < / div >
< div class = "line" > < a name = "l00017" > < / a > < span class = "lineno" > 17< / span >   < span class = "preprocessor" > #include < cstddef> < / span > < / div >
2021-04-27 23:00:03 +02:00
< div class = "line" > < a name = "l00018" > < / a > < span class = "lineno" > 18< / span >   < span class = "preprocessor" > #include < cstdint> < / span > < / div >
< div class = "line" > < a name = "l00019" > < / a > < span class = "lineno" > 19< / span >   < span class = "preprocessor" > #include < vector> < / span > < / div >
< div class = "line" > < a name = "l00020" > < / a > < span class = "lineno" > 20< / span >   < / div >
< div class = "line" > < a name = "l00021" > < / a > < span class = "lineno" > 21< / span >   < span class = "preprocessor" > #include " absl/container/flat_hash_map.h" < / span > < / div >
< div class = "line" > < a name = "l00022" > < / a > < span class = "lineno" > 22< / span >   < span class = "preprocessor" > #include " absl/container/flat_hash_set.h" < / span > < / div >
< div class = "line" > < a name = "l00023" > < / a > < span class = "lineno" > 23< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "strong__vector_8h.html" > ortools/base/strong_vector.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00024" > < / a > < span class = "lineno" > 24< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "revised__simplex_8h.html" > ortools/glop/revised_simplex.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00025" > < / a > < span class = "lineno" > 25< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "sat_2linear__constraint_8h.html" > ortools/sat/linear_constraint.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00026" > < / a > < span class = "lineno" > 26< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "sat_2model_8h.html" > ortools/sat/model.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00027" > < / a > < span class = "lineno" > 27< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "sat__parameters_8pb_8h.html" > ortools/sat/sat_parameters.pb.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00028" > < / a > < span class = "lineno" > 28< / span >   < span class = "preprocessor" > #include " < a class = "code" href = "util_2logging_8h.html" > ortools/util/logging.h< / a > " < / span > < / div >
< div class = "line" > < a name = "l00029" > < / a > < span class = "lineno" > 29< / 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 = "l00030" > < / a > < span class = "lineno" > 30< / span >   < / div >
< div class = "line" > < a name = "l00031" > < / a > < span class = "lineno" > 31< / span >   < span class = "keyword" > namespace < / span > < a class = "code" href = "namespaceoperations__research.html" > operations_research< / a > {< / div >
< div class = "line" > < a name = "l00032" > < / a > < span class = "lineno" > 32< / span >   < span class = "keyword" > namespace < / span > sat {< / div >
< div class = "line" > < a name = "l00033" > < / a > < span class = "lineno" > 33< / span >   < / div >
< div class = "line" > < a name = "l00034" > < / a > < span class = "lineno" > 34< / span >   < span class = "comment" > // This class holds a list of globally valid linear constraints and has some< / span > < / div >
< div class = "line" > < a name = "l00035" > < / a > < span class = "lineno" > 35< / span >   < span class = "comment" > // logic to decide which one should be part of the LP relaxation. We want more< / span > < / div >
< div class = "line" > < a name = "l00036" > < / a > < span class = "lineno" > 36< / span >   < span class = "comment" > // for a better relaxation, but for efficiency we do not want to have too much< / span > < / div >
< div class = "line" > < a name = "l00037" > < / a > < span class = "lineno" > 37< / span >   < span class = "comment" > // constraints while solving the LP.< / span > < / div >
< div class = "line" > < a name = "l00038" > < / a > < span class = "lineno" > 38< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00039" > < / a > < span class = "lineno" > 39< / span >   < span class = "comment" > // This class is meant to contain all the initial constraints of the LP< / span > < / div >
< div class = "line" > < a name = "l00040" > < / a > < span class = "lineno" > 40< / span >   < span class = "comment" > // relaxation and to get new cuts as they are generated. Thus, it can both< / span > < / div >
< div class = "line" > < a name = "l00041" > < / a > < span class = "lineno" > 41< / span >   < span class = "comment" > // manage cuts but also only add the initial constraints lazily if there is too< / span > < / div >
< div class = "line" > < a name = "l00042" > < / a > < span class = "lineno" > 42< / span >   < span class = "comment" > // many of them.< / span > < / div >
< div class = "line" > < a name = "l00043" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html" > 43< / a > < / span >   < span class = "keyword" > class < / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html" > LinearConstraintManager< / a > {< / div >
< div class = "line" > < a name = "l00044" > < / a > < span class = "lineno" > 44< / span >   < span class = "keyword" > public< / span > :< / div >
< div class = "line" > < a name = "l00045" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html" > 45< / a > < / span >   < span class = "keyword" > struct < / span > < a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html" > ConstraintInfo< / a > {< / div >
< div class = "line" > < a name = "l00046" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a032d3e55dc38f64c8914c8a6f9d3ba66" > 46< / a > < / span >   < a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint.html" > LinearConstraint< / a > < a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a032d3e55dc38f64c8914c8a6f9d3ba66" > constraint< / a > ;< / div >
< div class = "line" > < a name = "l00047" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a2a897122b37c5a906205687aecdb627b" > 47< / a > < / span >   < span class = "keywordtype" > double< / span > < a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a2a897122b37c5a906205687aecdb627b" > l2_norm< / a > = 0.0;< / div >
< div class = "line" > < a name = "l00048" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a7913a8eaf1375fa698efc794687abaa5" > 48< / a > < / span >   int64_t < a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a7913a8eaf1375fa698efc794687abaa5" > inactive_count< / a > = 0;< / div >
< div class = "line" > < a name = "l00049" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a0e28c752246171950355c329b48f2642" > 49< / a > < / span >   < span class = "keywordtype" > double< / span > < a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a0e28c752246171950355c329b48f2642" > objective_parallelism< / a > = 0.0;< / div >
< div class = "line" > < a name = "l00050" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a9b067b51be5391d99da97806a62da560" > 50< / a > < / span >   < span class = "keywordtype" > bool< / span > < a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a9b067b51be5391d99da97806a62da560" > objective_parallelism_computed< / a > = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l00051" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a04af0b6ebbb703c086fd02f565893b77" > 51< / a > < / span >   < span class = "keywordtype" > bool< / span > < a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a04af0b6ebbb703c086fd02f565893b77" > is_in_lp< / a > = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l00052" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a2b07c49e916f21a26aa731f4db68785a" > 52< / a > < / span >   < span class = "keywordtype" > size_t< / span > < a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a2b07c49e916f21a26aa731f4db68785a" > hash< / a > ;< / div >
< div class = "line" > < a name = "l00053" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a8a4f9b10d73c36bcab51eaeec3f1e5b6" > 53< / a > < / span >   < span class = "keywordtype" > double< / span > < a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a8a4f9b10d73c36bcab51eaeec3f1e5b6" > current_score< / a > = 0.0;< / div >
< div class = "line" > < a name = "l00054" > < / a > < span class = "lineno" > 54< / span >   < / div >
< div class = "line" > < a name = "l00055" > < / a > < span class = "lineno" > 55< / span >   < span class = "comment" > // Updated only for deletable constraints. This is incremented every time< / span > < / div >
< div class = "line" > < a name = "l00056" > < / a > < span class = "lineno" > 56< / span >   < span class = "comment" > // ChangeLp() is called and the constraint is active in the LP or not in the< / span > < / div >
< div class = "line" > < a name = "l00057" > < / a > < span class = "lineno" > 57< / span >   < span class = "comment" > // LP and violated.< / span > < / div >
< div class = "line" > < a name = "l00058" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a64cbd77208a462a2d718ed0be41d4b6c" > 58< / a > < / span >   < span class = "keywordtype" > double< / span > < a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a64cbd77208a462a2d718ed0be41d4b6c" > active_count< / a > = 0.0;< / div >
< div class = "line" > < a name = "l00059" > < / a > < span class = "lineno" > 59< / span >   < / div >
< div class = "line" > < a name = "l00060" > < / a > < span class = "lineno" > 60< / span >   < span class = "comment" > // For now, we mark all the generated cuts as deletable and the problem< / span > < / div >
< div class = "line" > < a name = "l00061" > < / a > < span class = "lineno" > 61< / span >   < span class = "comment" > // constraints as undeletable.< / span > < / div >
< div class = "line" > < a name = "l00062" > < / a > < span class = "lineno" > 62< / span >   < span class = "comment" > // TODO(user): We can have a better heuristics. Some generated good cuts< / span > < / div >
< div class = "line" > < a name = "l00063" > < / a > < span class = "lineno" > 63< / span >   < span class = "comment" > // can be marked undeletable and some unused problem specified constraints< / span > < / div >
< div class = "line" > < a name = "l00064" > < / a > < span class = "lineno" > 64< / span >   < span class = "comment" > // can be marked deletable.< / span > < / div >
< div class = "line" > < a name = "l00065" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a3aff95685ad7d3e3e26fe0427d3ed1b4" > 65< / a > < / span >   < span class = "keywordtype" > bool< / span > < a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a3aff95685ad7d3e3e26fe0427d3ed1b4" > is_deletable< / a > = < span class = "keyword" > false< / span > ;< / div >
< 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" > < a class = "line" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#ae6b8a1c5b934ebd045481bbd0825229d" > 68< / a > < / span >   < span class = "keyword" > explicit< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#ae6b8a1c5b934ebd045481bbd0825229d" > LinearConstraintManager< / a > (< 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 = "l00069" > < / a > < span class = "lineno" > 69< / span >   : sat_parameters_(*< a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< SatParameters> ()),< / div >
< div class = "line" > < a name = "l00070" > < / a > < span class = "lineno" > 70< / 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 = "l00071" > < / a > < span class = "lineno" > 71< / 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 = "l00072" > < / a > < span class = "lineno" > 72< / span >   model_(< a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ),< / div >
< div class = "line" > < a name = "l00073" > < / a > < span class = "lineno" > 73< / span >   logger_(< a class = "code" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code" href = "classoperations__research_1_1_solver_logger.html" > SolverLogger< / a > > ()) {}< / div >
< div class = "line" > < a name = "l00074" > < / a > < span class = "lineno" > 74< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a032fff0a8f02355526b35c826af7804e" > ~LinearConstraintManager< / a > ();< / div >
< div class = "line" > < a name = "l00075" > < / a > < span class = "lineno" > 75< / span >   < / div >
< div class = "line" > < a name = "l00076" > < / a > < span class = "lineno" > 76< / span >   < span class = "comment" > // Add a new constraint to the manager. Note that we canonicalize constraints< / span > < / div >
< div class = "line" > < a name = "l00077" > < / a > < span class = "lineno" > 77< / span >   < span class = "comment" > // and merge the bounds of constraints with the same terms. We also perform< / span > < / div >
< div class = "line" > < a name = "l00078" > < / a > < span class = "lineno" > 78< / span >   < span class = "comment" > // basic preprocessing. If added is given, it will be set to true if this< / span > < / div >
< div class = "line" > < a name = "l00079" > < / a > < span class = "lineno" > 79< / span >   < span class = "comment" > // constraint was actually a new one and to false if it was dominated by an< / span > < / div >
< div class = "line" > < a name = "l00080" > < / a > < span class = "lineno" > 80< / span >   < span class = "comment" > // already existing one.< / span > < / div >
< div class = "line" > < a name = "l00081" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a06c07e8494062d60f06fbc1752761583" > 81< / a > < / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a06c07e8494062d60f06fbc1752761583" > DEFINE_INT_TYPE< / a > (ConstraintIndex, int32_t);< / div >
< div class = "line" > < a name = "l00082" > < / a > < span class = "lineno" > 82< / span >   ConstraintIndex < a class = "code" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a40e3f0f21a2c16b673c84f734ba6d095" > Add< / a > (< a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint.html" > LinearConstraint< / a > < a class = "code" href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > , < span class = "keywordtype" > bool< / span > * added = < span class = "keyword" > nullptr< / span > );< / div >
< div class = "line" > < a name = "l00083" > < / a > < span class = "lineno" > 83< / span >   < / div >
< div class = "line" > < a name = "l00084" > < / a > < span class = "lineno" > 84< / span >   < span class = "comment" > // Same as Add(), but logs some information about the newly added constraint.< / span > < / div >
< div class = "line" > < a name = "l00085" > < / a > < span class = "lineno" > 85< / span >   < span class = "comment" > // Cuts are also handled slightly differently than normal constraints.< / span > < / div >
< div class = "line" > < a name = "l00086" > < / a > < span class = "lineno" > 86< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00087" > < / a > < span class = "lineno" > 87< / span >   < span class = "comment" > // Returns true if a new cut was added and false if this cut is not< / span > < / div >
< div class = "line" > < a name = "l00088" > < / a > < span class = "lineno" > 88< / span >   < span class = "comment" > // efficacious or if it is a duplicate of an already existing one.< / span > < / div >
< div class = "line" > < a name = "l00089" > < / a > < span class = "lineno" > 89< / span >   < span class = "keywordtype" > bool< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a9456bb31790e4dae791914e3c065b460" > AddCut< / a > (< a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint.html" > LinearConstraint< / a > < a class = "code" href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > , std::string type_name,< / div >
< div class = "line" > < a name = "l00090" > < / a > < span class = "lineno" > 90< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classabsl_1_1_strong_vector.html" > absl::StrongVector< IntegerVariable, double> < / a > & lp_solution,< / div >
< div class = "line" > < a name = "l00091" > < / a > < span class = "lineno" > 91< / span >   std::string extra_info = < span class = "stringliteral" > " " < / span > );< / div >
< div class = "line" > < a name = "l00092" > < / a > < span class = "lineno" > 92< / span >   < / div >
< div class = "line" > < a name = "l00093" > < / a > < span class = "lineno" > 93< / span >   < span class = "comment" > // The objective is used as one of the criterion to score cuts.< / span > < / div >
< div class = "line" > < a name = "l00094" > < / a > < span class = "lineno" > 94< / span >   < span class = "comment" > // The more a cut is parallel to the objective, the better its score is.< / span > < / div >
< div class = "line" > < a name = "l00095" > < / a > < span class = "lineno" > 95< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00096" > < / a > < span class = "lineno" > 96< / span >   < span class = "comment" > // Currently this should only be called once per IntegerVariable (Checked). It< / span > < / div >
< div class = "line" > < a name = "l00097" > < / a > < span class = "lineno" > 97< / span >   < span class = "comment" > // is easy to support dynamic modification if it becomes needed.< / span > < / div >
< div class = "line" > < a name = "l00098" > < / a > < span class = "lineno" > 98< / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a36295bfe464bcdb6465fe796a43d02bf" > SetObjectiveCoefficient< / a > (IntegerVariable < a class = "code" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > , IntegerValue coeff);< / div >
< div class = "line" > < a name = "l00099" > < / a > < span class = "lineno" > 99< / span >   < / div >
< div class = "line" > < a name = "l00100" > < / a > < span class = "lineno" > 100< / span >   < span class = "comment" > // Heuristic to decides what LP is best solved next. The given lp_solution< / span > < / div >
< div class = "line" > < a name = "l00101" > < / a > < span class = "lineno" > 101< / span >   < span class = "comment" > // should usually be the optimal solution of the LP returned by GetLp() before< / span > < / div >
< div class = "line" > < a name = "l00102" > < / a > < span class = "lineno" > 102< / span >   < span class = "comment" > // this call, but is just used as an heuristic.< / span > < / div >
< div class = "line" > < a name = "l00103" > < / a > < span class = "lineno" > 103< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00104" > < / a > < span class = "lineno" > 104< / span >   < span class = "comment" > // The current solution state is used for detecting inactive constraints. It< / span > < / div >
< div class = "line" > < a name = "l00105" > < / a > < span class = "lineno" > 105< / span >   < span class = "comment" > // is also updated correctly on constraint deletion/addition so that the< / span > < / div >
< div class = "line" > < a name = "l00106" > < / a > < span class = "lineno" > 106< / span >   < span class = "comment" > // simplex can be fully iterative on restart by loading this modified state.< / span > < / div >
< div class = "line" > < a name = "l00107" > < / a > < span class = "lineno" > 107< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00108" > < / a > < span class = "lineno" > 108< / span >   < span class = "comment" > // Returns true iff LpConstraints() will return a different LP than before.< / span > < / div >
< div class = "line" > < a name = "l00109" > < / a > < span class = "lineno" > 109< / span >   < span class = "keywordtype" > bool< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a1951610defebe3a3b82d99006793486a" > ChangeLp< / a > (< span class = "keyword" > const< / span > < a class = "code" href = "classabsl_1_1_strong_vector.html" > absl::StrongVector< IntegerVariable, double> < / a > & lp_solution,< / div >
< div class = "line" > < a name = "l00110" > < / a > < span class = "lineno" > 110< / span >   < a class = "code" href = "structoperations__research_1_1glop_1_1_basis_state.html" > glop::BasisState< / a > * solution_state);< / div >
< div class = "line" > < a name = "l00111" > < / a > < span class = "lineno" > 111< / span >   < / div >
< div class = "line" > < a name = "l00112" > < / a > < span class = "lineno" > 112< / span >   < span class = "comment" > // This can be called initially to add all the current constraint to the LP< / span > < / div >
< div class = "line" > < a name = "l00113" > < / a > < span class = "lineno" > 113< / span >   < span class = "comment" > // returned by GetLp().< / span > < / div >
< div class = "line" > < a name = "l00114" > < / a > < span class = "lineno" > 114< / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a87cc96a3e72099107712a0386d89d851" > AddAllConstraintsToLp< / a > ();< / div >
< div class = "line" > < a name = "l00115" > < / a > < span class = "lineno" > 115< / span >   < / div >
< div class = "line" > < a name = "l00116" > < / a > < span class = "lineno" > 116< / span >   < span class = "comment" > // All the constraints managed by this class.< / span > < / div >
< div class = "line" > < a name = "l00117" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a71a79a003419f05324e7951f69265701" > 117< / a > < / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classabsl_1_1_strong_vector.html" > absl::StrongVector< ConstraintIndex, ConstraintInfo> < / a > & < a class = "code" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a71a79a003419f05324e7951f69265701" > AllConstraints< / a > ()< span class = "keyword" > < / span > < / div >
< div class = "line" > < a name = "l00118" > < / a > < span class = "lineno" > 118< / span >   < span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a name = "l00119" > < / a > < span class = "lineno" > 119< / span >   < span class = "keywordflow" > return< / span > constraint_infos_;< / div >
< div class = "line" > < a name = "l00120" > < / a > < span class = "lineno" > 120< / span >   }< / div >
< div class = "line" > < a name = "l00121" > < / a > < span class = "lineno" > 121< / span >   < / div >
< div class = "line" > < a name = "l00122" > < / a > < span class = "lineno" > 122< / span >   < span class = "comment" > // The set of constraints indices in AllConstraints() that should be part< / span > < / div >
< div class = "line" > < a name = "l00123" > < / a > < span class = "lineno" > 123< / span >   < span class = "comment" > // of the next LP to solve.< / span > < / div >
< div class = "line" > < a name = "l00124" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a84ae5ff883fcce91f758a729af446864" > 124< / a > < / span >   < span class = "keyword" > const< / span > std::vector< ConstraintIndex> & < a class = "code" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a84ae5ff883fcce91f758a729af446864" > LpConstraints< / a > ()< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a name = "l00125" > < / a > < span class = "lineno" > 125< / span >   < span class = "keywordflow" > return< / span > lp_constraints_;< / div >
< div class = "line" > < a name = "l00126" > < / a > < span class = "lineno" > 126< / span >   }< / div >
< div class = "line" > < a name = "l00127" > < / a > < span class = "lineno" > 127< / span >   < / div >
< div class = "line" > < a name = "l00128" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a4e8ec9d9279fe2503136ba89f2733c0c" > 128< / a > < / span >   int64_t < a class = "code" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a4e8ec9d9279fe2503136ba89f2733c0c" > num_cuts< / a > ()< span class = "keyword" > const < / span > { < span class = "keywordflow" > return< / span > num_cuts_; }< / div >
< div class = "line" > < a name = "l00129" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a5a155a7d7251f9fd35dbe09ccea840bc" > 129< / a > < / span >   int64_t < a class = "code" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a5a155a7d7251f9fd35dbe09ccea840bc" > num_shortened_constraints< / a > ()< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a name = "l00130" > < / a > < span class = "lineno" > 130< / span >   < span class = "keywordflow" > return< / span > num_shortened_constraints_;< / div >
< div class = "line" > < a name = "l00131" > < / a > < span class = "lineno" > 131< / span >   }< / div >
< div class = "line" > < a name = "l00132" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a043cb91961ad5cc66dd56d8606636282" > 132< / a > < / span >   int64_t < a class = "code" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a043cb91961ad5cc66dd56d8606636282" > num_coeff_strenghtening< / a > ()< span class = "keyword" > const < / span > { < span class = "keywordflow" > return< / span > num_coeff_strenghtening_; }< / div >
2021-02-16 18:34:57 +01:00
< div class = "line" > < a name = "l00133" > < / a > < span class = "lineno" > 133< / span >   < / div >
2021-04-27 23:00:03 +02:00
< div class = "line" > < a name = "l00134" > < / a > < span class = "lineno" > 134< / span >   < span class = "comment" > // If a debug solution has been loaded, this checks if the given constaint cut< / span > < / div >
< div class = "line" > < a name = "l00135" > < / a > < span class = "lineno" > 135< / span >   < span class = "comment" > // it or not. Returns true iff everything is fine and the cut does not violate< / span > < / div >
< div class = "line" > < a name = "l00136" > < / a > < span class = "lineno" > 136< / span >   < span class = "comment" > // the loaded solution.< / span > < / div >
< div class = "line" > < a name = "l00137" > < / a > < span class = "lineno" > 137< / span >   < span class = "keywordtype" > bool< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a1afbe8d162a9cba17a520812ec6d3dd4" > DebugCheckConstraint< / a > (< span class = "keyword" > const< / span > < a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint.html" > LinearConstraint< / a > & cut);< / 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 = "keyword" > private< / span > :< / div >
< div class = "line" > < a name = "l00140" > < / a > < span class = "lineno" > 140< / span >   < span class = "comment" > // Heuristic that decide which constraints we should remove from the current< / span > < / div >
< div class = "line" > < a name = "l00141" > < / a > < span class = "lineno" > 141< / span >   < span class = "comment" > // LP. Note that such constraints can be added back later by the heuristic< / span > < / div >
< div class = "line" > < a name = "l00142" > < / a > < span class = "lineno" > 142< / span >   < span class = "comment" > // responsible for adding new constraints from the pool.< / span > < / div >
< div class = "line" > < a name = "l00143" > < / a > < span class = "lineno" > 143< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00144" > < / a > < span class = "lineno" > 144< / span >   < span class = "comment" > // Returns true iff one or more constraints where removed.< / span > < / div >
< div class = "line" > < a name = "l00145" > < / a > < span class = "lineno" > 145< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00146" > < / a > < span class = "lineno" > 146< / span >   < span class = "comment" > // If the solutions_state is empty, then this function does nothing and< / span > < / div >
< div class = "line" > < a name = "l00147" > < / a > < span class = "lineno" > 147< / span >   < span class = "comment" > // returns false (this is used for tests). Otherwise, the solutions_state is< / span > < / div >
< div class = "line" > < a name = "l00148" > < / a > < span class = "lineno" > 148< / span >   < span class = "comment" > // assumed to correspond to the current LP and to be of the correct size.< / span > < / div >
< div class = "line" > < a name = "l00149" > < / a > < span class = "lineno" > 149< / span >   < span class = "keywordtype" > bool< / span > MaybeRemoveSomeInactiveConstraints(< a class = "code" href = "structoperations__research_1_1glop_1_1_basis_state.html" > glop::BasisState< / a > * solution_state);< / div >
< div class = "line" > < a name = "l00150" > < / a > < span class = "lineno" > 150< / span >   < / div >
< div class = "line" > < a name = "l00151" > < / a > < span class = "lineno" > 151< / span >   < span class = "comment" > // Apply basic inprocessing simplification rules:< / span > < / div >
< div class = "line" > < a name = "l00152" > < / a > < span class = "lineno" > 152< / span >   < span class = "comment" > // - remove fixed variable< / span > < / div >
< div class = "line" > < a name = "l00153" > < / a > < span class = "lineno" > 153< / span >   < span class = "comment" > // - reduce large coefficient (i.e. coeff strenghtenning or big-M reduction).< / span > < / div >
< div class = "line" > < a name = "l00154" > < / a > < span class = "lineno" > 154< / span >   < span class = "comment" > // This uses level-zero bounds.< / span > < / div >
< div class = "line" > < a name = "l00155" > < / a > < span class = "lineno" > 155< / span >   < span class = "comment" > // Returns true if the terms of the constraint changed.< / span > < / div >
< div class = "line" > < a name = "l00156" > < / a > < span class = "lineno" > 156< / span >   < span class = "keywordtype" > bool< / span > SimplifyConstraint(< a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint.html" > LinearConstraint< / a > * < a class = "code" href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > );< / div >
< div class = "line" > < a name = "l00157" > < / a > < span class = "lineno" > 157< / span >   < / div >
< div class = "line" > < a name = "l00158" > < / a > < span class = "lineno" > 158< / span >   < span class = "comment" > // Helper method to compute objective parallelism for a given constraint. This< / span > < / div >
< div class = "line" > < a name = "l00159" > < / a > < span class = "lineno" > 159< / span >   < span class = "comment" > // also lazily computes objective norm.< / span > < / div >
< div class = "line" > < a name = "l00160" > < / a > < span class = "lineno" > 160< / span >   < span class = "keywordtype" > void< / span > ComputeObjectiveParallelism(< span class = "keyword" > const< / span > ConstraintIndex ct_index);< / div >
2021-02-16 18:34:57 +01:00
< div class = "line" > < a name = "l00161" > < / a > < span class = "lineno" > 161< / span >   < / div >
2021-04-27 23:00:03 +02:00
< div class = "line" > < a name = "l00162" > < / a > < span class = "lineno" > 162< / span >   < span class = "comment" > // Multiplies all active counts and the increment counter by the given< / span > < / div >
< div class = "line" > < a name = "l00163" > < / a > < span class = "lineno" > 163< / span >   < span class = "comment" > // ' scaling_factor' . This should be called when at least one of the active< / span > < / div >
< div class = "line" > < a name = "l00164" > < / a > < span class = "lineno" > 164< / span >   < span class = "comment" > // counts is too high.< / span > < / div >
< div class = "line" > < a name = "l00165" > < / a > < span class = "lineno" > 165< / span >   < span class = "keywordtype" > void< / span > RescaleActiveCounts(< span class = "keywordtype" > double< / span > scaling_factor);< / div >
< div class = "line" > < a name = "l00166" > < / a > < span class = "lineno" > 166< / span >   < / div >
< div class = "line" > < a name = "l00167" > < / a > < span class = "lineno" > 167< / span >   < span class = "comment" > // Removes some deletable constraints with low active counts. For now, we< / span > < / div >
< div class = "line" > < a name = "l00168" > < / a > < span class = "lineno" > 168< / span >   < span class = "comment" > // don' t remove any constraints which are already in LP.< / span > < / div >
< div class = "line" > < a name = "l00169" > < / a > < span class = "lineno" > 169< / span >   < span class = "keywordtype" > void< / span > PermanentlyRemoveSomeConstraints();< / div >
< div class = "line" > < a name = "l00170" > < / a > < span class = "lineno" > 170< / span >   < / div >
< div class = "line" > < a name = "l00171" > < / a > < span class = "lineno" > 171< / span >   < span class = "keyword" > const< / span > SatParameters& sat_parameters_;< / div >
< div class = "line" > < a name = "l00172" > < / a > < span class = "lineno" > 172< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_integer_trail.html" > IntegerTrail< / a > & integer_trail_;< / div >
< div class = "line" > < a name = "l00173" > < / a > < span class = "lineno" > 173< / span >   < / div >
< div class = "line" > < a name = "l00174" > < / a > < span class = "lineno" > 174< / span >   < span class = "comment" > // Set at true by Add()/SimplifyConstraint() and at false by ChangeLp().< / span > < / div >
< div class = "line" > < a name = "l00175" > < / a > < span class = "lineno" > 175< / span >   < span class = "keywordtype" > bool< / span > current_lp_is_changed_ = < span class = "keyword" > false< / span > ;< / div >
2020-12-29 22:27:47 +01:00
< div class = "line" > < a name = "l00176" > < / a > < span class = "lineno" > 176< / span >   < / div >
2021-04-27 23:00:03 +02:00
< div class = "line" > < a name = "l00177" > < / a > < span class = "lineno" > 177< / span >   < span class = "comment" > // Optimization to avoid calling SimplifyConstraint() when not needed.< / span > < / div >
< div class = "line" > < a name = "l00178" > < / a > < span class = "lineno" > 178< / span >   int64_t last_simplification_timestamp_ = 0;< / div >
2021-02-16 18:34:57 +01:00
< div class = "line" > < a name = "l00179" > < / a > < span class = "lineno" > 179< / span >   < / div >
2021-04-27 23:00:03 +02:00
< div class = "line" > < a name = "l00180" > < / a > < span class = "lineno" > 180< / span >   < a class = "code" href = "classabsl_1_1_strong_vector.html" > absl::StrongVector< ConstraintIndex, ConstraintInfo> < / a > constraint_infos_;< / div >
< div class = "line" > < a name = "l00181" > < / a > < span class = "lineno" > 181< / span >   < / div >
< div class = "line" > < a name = "l00182" > < / a > < span class = "lineno" > 182< / span >   < span class = "comment" > // The subset of constraints currently in the lp.< / span > < / div >
< div class = "line" > < a name = "l00183" > < / a > < span class = "lineno" > 183< / span >   std::vector< ConstraintIndex> lp_constraints_;< / div >
< div class = "line" > < a name = "l00184" > < / a > < span class = "lineno" > 184< / span >   < / div >
< div class = "line" > < a name = "l00185" > < / a > < span class = "lineno" > 185< / span >   < span class = "comment" > // We keep a map from the hash of our constraint terms to their position in< / span > < / div >
< div class = "line" > < a name = "l00186" > < / a > < span class = "lineno" > 186< / span >   < span class = "comment" > // constraints_. This is an optimization to detect duplicate constraints. We< / span > < / div >
< div class = "line" > < a name = "l00187" > < / a > < span class = "lineno" > 187< / span >   < span class = "comment" > // are robust to collisions because we always relies on the ground truth< / span > < / div >
< div class = "line" > < a name = "l00188" > < / a > < span class = "lineno" > 188< / span >   < span class = "comment" > // contained in constraints_ and the code is still okay if we do not merge the< / span > < / div >
< div class = "line" > < a name = "l00189" > < / a > < span class = "lineno" > 189< / span >   < span class = "comment" > // constraints.< / span > < / div >
< div class = "line" > < a name = "l00190" > < / a > < span class = "lineno" > 190< / span >   absl::flat_hash_map< size_t, ConstraintIndex> equiv_constraints_;< / div >
< div class = "line" > < a name = "l00191" > < / a > < span class = "lineno" > 191< / span >   < / div >
< div class = "line" > < a name = "l00192" > < / a > < span class = "lineno" > 192< / span >   int64_t num_simplifications_ = 0;< / div >
< div class = "line" > < a name = "l00193" > < / a > < span class = "lineno" > 193< / span >   int64_t num_merged_constraints_ = 0;< / div >
< div class = "line" > < a name = "l00194" > < / a > < span class = "lineno" > 194< / span >   int64_t num_shortened_constraints_ = 0;< / div >
< div class = "line" > < a name = "l00195" > < / a > < span class = "lineno" > 195< / span >   int64_t num_splitted_constraints_ = 0;< / div >
< div class = "line" > < a name = "l00196" > < / a > < span class = "lineno" > 196< / span >   int64_t num_coeff_strenghtening_ = 0;< / div >
< div class = "line" > < a name = "l00197" > < / a > < span class = "lineno" > 197< / span >   < / div >
< div class = "line" > < a name = "l00198" > < / a > < span class = "lineno" > 198< / span >   int64_t num_cuts_ = 0;< / div >
< div class = "line" > < a name = "l00199" > < / a > < span class = "lineno" > 199< / span >   int64_t num_add_cut_calls_ = 0;< / div >
< div class = "line" > < a name = "l00200" > < / a > < span class = "lineno" > 200< / span >   std::map< std::string, int> type_to_num_cuts_;< / div >
< div class = "line" > < a name = "l00201" > < / a > < span class = "lineno" > 201< / span >   < / div >
< div class = "line" > < a name = "l00202" > < / a > < span class = "lineno" > 202< / span >   < span class = "keywordtype" > bool< / span > objective_is_defined_ = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l00203" > < / a > < span class = "lineno" > 203< / span >   < span class = "keywordtype" > bool< / span > objective_norm_computed_ = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a name = "l00204" > < / a > < span class = "lineno" > 204< / span >   < span class = "keywordtype" > double< / span > objective_l2_norm_ = 0.0;< / div >
< div class = "line" > < a name = "l00205" > < / a > < span class = "lineno" > 205< / span >   < / div >
< div class = "line" > < a name = "l00206" > < / a > < span class = "lineno" > 206< / span >   < span class = "comment" > // Total deterministic time spent in this class.< / span > < / div >
< div class = "line" > < a name = "l00207" > < / a > < span class = "lineno" > 207< / span >   < span class = "keywordtype" > double< / span > dtime_ = 0.0;< / 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 = "comment" > // Sparse representation of the objective coeffs indexed by positive variables< / span > < / div >
< div class = "line" > < a name = "l00210" > < / a > < span class = "lineno" > 210< / span >   < span class = "comment" > // indices. Important: We cannot use a dense representation here in the corner< / span > < / div >
< div class = "line" > < a name = "l00211" > < / a > < span class = "lineno" > 211< / span >   < span class = "comment" > // case where we have many indepedent LPs. Alternatively, we could share a< / span > < / div >
< div class = "line" > < a name = "l00212" > < / a > < span class = "lineno" > 212< / span >   < span class = "comment" > // dense vector between all LinearConstraintManager.< / span > < / div >
< div class = "line" > < a name = "l00213" > < / a > < span class = "lineno" > 213< / span >   < span class = "keywordtype" > double< / span > sum_of_squared_objective_coeffs_ = 0.0;< / div >
< div class = "line" > < a name = "l00214" > < / a > < span class = "lineno" > 214< / span >   absl::flat_hash_map< IntegerVariable, double> objective_map_;< / 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 >   < a class = "code" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > * time_limit_;< / div >
< div class = "line" > < a name = "l00217" > < / a > < span class = "lineno" > 217< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * model_;< / div >
< div class = "line" > < a name = "l00218" > < / a > < span class = "lineno" > 218< / span >   < a class = "code" href = "classoperations__research_1_1_solver_logger.html" > SolverLogger< / a > * logger_;< / div >
< div class = "line" > < a name = "l00219" > < / a > < span class = "lineno" > 219< / span >   < / div >
< div class = "line" > < a name = "l00220" > < / a > < span class = "lineno" > 220< / span >   < span class = "comment" > // We want to decay the active counts of all constraints at each call and< / span > < / div >
< div class = "line" > < a name = "l00221" > < / a > < span class = "lineno" > 221< / span >   < span class = "comment" > // increase the active counts of active/violated constraints. However this can< / span > < / div >
< div class = "line" > < a name = "l00222" > < / a > < span class = "lineno" > 222< / span >   < span class = "comment" > // be too slow in practice. So instead, we keep an increment counter and< / span > < / div >
< div class = "line" > < a name = "l00223" > < / a > < span class = "lineno" > 223< / span >   < span class = "comment" > // update only the active/violated constraints. The counter itself is< / span > < / div >
< div class = "line" > < a name = "l00224" > < / a > < span class = "lineno" > 224< / span >   < span class = "comment" > // increased by a factor at each call. This has the same effect as decaying< / span > < / div >
< div class = "line" > < a name = "l00225" > < / a > < span class = "lineno" > 225< / span >   < span class = "comment" > // all the active counts at each call. This trick is similar to sat clause< / span > < / div >
< div class = "line" > < a name = "l00226" > < / a > < span class = "lineno" > 226< / span >   < span class = "comment" > // management.< / span > < / div >
< div class = "line" > < a name = "l00227" > < / a > < span class = "lineno" > 227< / span >   < span class = "keywordtype" > double< / span > constraint_active_count_increase_ = 1.0;< / div >
< div class = "line" > < a name = "l00228" > < / a > < span class = "lineno" > 228< / span >   < / div >
< div class = "line" > < a name = "l00229" > < / a > < span class = "lineno" > 229< / span >   int32_t num_deletable_constraints_ = 0;< / div >
< div class = "line" > < a name = "l00230" > < / a > < span class = "lineno" > 230< / span >   };< / div >
< div class = "line" > < a name = "l00231" > < / a > < span class = "lineno" > 231< / span >   < / div >
< div class = "line" > < a name = "l00232" > < / a > < span class = "lineno" > 232< / span >   < span class = "comment" > // Keep the top n elements from a stream of elements.< / span > < / div >
< div class = "line" > < a name = "l00233" > < / a > < span class = "lineno" > 233< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00234" > < / a > < span class = "lineno" > 234< / span >   < span class = "comment" > // TODO(user): We could use gtl::TopN when/if it gets open sourced. Note that< / span > < / div >
< div class = "line" > < a name = "l00235" > < / a > < span class = "lineno" > 235< / span >   < span class = "comment" > // we might be slighlty faster here since we use an indirection and don' t move< / span > < / div >
< div class = "line" > < a name = "l00236" > < / a > < span class = "lineno" > 236< / span >   < span class = "comment" > // the Element class around as much.< / span > < / div >
< div class = "line" > < a name = "l00237" > < / a > < span class = "lineno" > 237< / span >   < span class = "keyword" > template< / span > < < span class = "keyword" > typename< / span > Element> < / div >
< div class = "line" > < a name = "l00238" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_top_n.html" > 238< / a > < / span >   < span class = "keyword" > class < / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_top_n.html" > TopN< / a > {< / div >
< div class = "line" > < a name = "l00239" > < / a > < span class = "lineno" > 239< / span >   < span class = "keyword" > public< / span > :< / div >
< div class = "line" > < a name = "l00240" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_top_n.html#afd1a2718a8d70a5b9a8ca8444f5d6242" > 240< / a > < / span >   < span class = "keyword" > explicit< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_top_n.html#afd1a2718a8d70a5b9a8ca8444f5d6242" > TopN< / a > (< span class = "keywordtype" > int< / span > n) : n_(n) {}< / div >
< div class = "line" > < a name = "l00241" > < / a > < span class = "lineno" > 241< / span >   < / div >
< div class = "line" > < a name = "l00242" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_top_n.html#aa71d36872f416feaa853788a7a7a7ef8" > 242< / a > < / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_top_n.html#aa71d36872f416feaa853788a7a7a7ef8" > Clear< / a > () {< / div >
< div class = "line" > < a name = "l00243" > < / a > < span class = "lineno" > 243< / span >   heap_.clear();< / div >
< div class = "line" > < a name = "l00244" > < / a > < span class = "lineno" > 244< / span >   elements_.clear();< / div >
< div class = "line" > < a name = "l00245" > < / a > < span class = "lineno" > 245< / span >   }< / div >
< div class = "line" > < a name = "l00246" > < / a > < span class = "lineno" > 246< / span >   < / div >
< div class = "line" > < a name = "l00247" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_top_n.html#a6562540dd1028bdfeea27af27d4d4d10" > 247< / a > < / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_top_n.html#a6562540dd1028bdfeea27af27d4d4d10" > Add< / a > (Element e, < span class = "keywordtype" > double< / span > score) {< / div >
< div class = "line" > < a name = "l00248" > < / a > < span class = "lineno" > 248< / span >   < span class = "keywordflow" > if< / span > (heap_.size() < n_) {< / div >
< div class = "line" > < a name = "l00249" > < / a > < span class = "lineno" > 249< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > = elements_.size();< / div >
< div class = "line" > < a name = "l00250" > < / a > < span class = "lineno" > 250< / span >   heap_.push_back({< a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > , score});< / div >
< div class = "line" > < a name = "l00251" > < / a > < span class = "lineno" > 251< / span >   elements_.push_back(std::move(e));< / div >
< div class = "line" > < a name = "l00252" > < / a > < span class = "lineno" > 252< / span >   < span class = "keywordflow" > if< / span > (heap_.size() == n_) {< / div >
< div class = "line" > < a name = "l00253" > < / a > < span class = "lineno" > 253< / span >   < span class = "comment" > // TODO(user): We could delay that on the n + 1 push.< / span > < / div >
< div class = "line" > < a name = "l00254" > < / a > < span class = "lineno" > 254< / span >   std::make_heap(heap_.begin(), heap_.end());< / div >
< div class = "line" > < a name = "l00255" > < / a > < span class = "lineno" > 255< / span >   }< / div >
< div class = "line" > < a name = "l00256" > < / a > < span class = "lineno" > 256< / span >   } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a name = "l00257" > < / a > < span class = "lineno" > 257< / span >   < span class = "keywordflow" > if< / span > (score < = heap_.front().score) < span class = "keywordflow" > return< / span > ;< / div >
< div class = "line" > < a name = "l00258" > < / a > < span class = "lineno" > 258< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > index_to_replace = heap_.front().index;< / div >
< div class = "line" > < a name = "l00259" > < / a > < span class = "lineno" > 259< / span >   elements_[index_to_replace] = std::move(e);< / 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 >   < span class = "comment" > // If needed, we could be faster here with an update operation.< / span > < / div >
< div class = "line" > < a name = "l00262" > < / a > < span class = "lineno" > 262< / span >   std::pop_heap(heap_.begin(), heap_.end());< / div >
< div class = "line" > < a name = "l00263" > < / a > < span class = "lineno" > 263< / span >   heap_.back() = {index_to_replace, score};< / div >
< div class = "line" > < a name = "l00264" > < / a > < span class = "lineno" > 264< / span >   std::push_heap(heap_.begin(), heap_.end());< / div >
< div class = "line" > < a name = "l00265" > < / a > < span class = "lineno" > 265< / span >   }< / div >
< div class = "line" > < a name = "l00266" > < / a > < span class = "lineno" > 266< / span >   }< / div >
< div class = "line" > < a name = "l00267" > < / a > < span class = "lineno" > 267< / span >   < / div >
< div class = "line" > < a name = "l00268" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_top_n.html#a33ac8067c9a2b30fa4906ce9a32dd30f" > 268< / a > < / span >   < span class = "keyword" > const< / span > std::vector< Element> & < a class = "code" href = "classoperations__research_1_1sat_1_1_top_n.html#a33ac8067c9a2b30fa4906ce9a32dd30f" > UnorderedElements< / a > ()< span class = "keyword" > const < / span > { < span class = "keywordflow" > return< / span > elements_; }< / div >
< div class = "line" > < a name = "l00269" > < / a > < span class = "lineno" > 269< / span >   < / div >
< div class = "line" > < a name = "l00270" > < / a > < span class = "lineno" > 270< / span >   < span class = "keyword" > private< / span > :< / div >
< div class = "line" > < a name = "l00271" > < / a > < span class = "lineno" > 271< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > n_;< / div >
< div class = "line" > < a name = "l00272" > < / a > < span class = "lineno" > 272< / span >   < / div >
< div class = "line" > < a name = "l00273" > < / a > < span class = "lineno" > 273< / span >   < span class = "comment" > // We keep a heap of the n lowest score.< / span > < / div >
< div class = "line" > < a name = "l00274" > < / a > < span class = "lineno" > 274< / span >   < span class = "keyword" > struct < / span > HeapElement {< / div >
< div class = "line" > < a name = "l00275" > < / a > < span class = "lineno" > 275< / span >   < span class = "keywordtype" > int< / span > < a class = "code" href = "pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0" > index< / a > ; < span class = "comment" > // in elements_;< / span > < / div >
< div class = "line" > < a name = "l00276" > < / a > < span class = "lineno" > 276< / span >   < span class = "keywordtype" > double< / span > score;< / div >
< div class = "line" > < a name = "l00277" > < / a > < span class = "lineno" > 277< / span >   < span class = "keyword" > const< / span > < span class = "keywordtype" > double< / span > operator< (< span class = "keyword" > const< / span > HeapElement& other)< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a name = "l00278" > < / a > < span class = "lineno" > 278< / span >   < span class = "keywordflow" > return< / span > score > other.score;< / div >
< div class = "line" > < a name = "l00279" > < / a > < span class = "lineno" > 279< / span >   }< / div >
< div class = "line" > < a name = "l00280" > < / a > < span class = "lineno" > 280< / span >   };< / div >
< div class = "line" > < a name = "l00281" > < / a > < span class = "lineno" > 281< / span >   std::vector< HeapElement> heap_;< / div >
< div class = "line" > < a name = "l00282" > < / a > < span class = "lineno" > 282< / span >   std::vector< Element> elements_;< / div >
< div class = "line" > < a name = "l00283" > < / a > < span class = "lineno" > 283< / span >   };< / div >
< div class = "line" > < a name = "l00284" > < / a > < span class = "lineno" > 284< / span >   < / div >
< div class = "line" > < a name = "l00285" > < / a > < span class = "lineno" > 285< / span >   < span class = "comment" > // Before adding cuts to the global pool, it is a classical thing to only keep< / span > < / div >
< div class = "line" > < a name = "l00286" > < / a > < span class = "lineno" > 286< / span >   < span class = "comment" > // the top n of a given type during one generation round. This is there to help< / span > < / div >
< div class = "line" > < a name = "l00287" > < / a > < span class = "lineno" > 287< / span >   < span class = "comment" > // doing that.< / span > < / div >
< div class = "line" > < a name = "l00288" > < / a > < span class = "lineno" > 288< / span >   < span class = "comment" > //< / span > < / div >
< div class = "line" > < a name = "l00289" > < / a > < span class = "lineno" > 289< / span >   < span class = "comment" > // TODO(user): Avoid computing efficacity twice.< / span > < / div >
< div class = "line" > < a name = "l00290" > < / a > < span class = "lineno" > 290< / span >   < span class = "comment" > // TODO(user): We don' t use any orthogonality consideration here.< / span > < / div >
< div class = "line" > < a name = "l00291" > < / a > < span class = "lineno" > 291< / span >   < span class = "comment" > // TODO(user): Detect duplicate cuts?< / span > < / div >
< div class = "line" > < a name = "l00292" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_top_n_cuts.html" > 292< / a > < / span >   < span class = "keyword" > class < / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_top_n_cuts.html" > TopNCuts< / a > {< / div >
< div class = "line" > < a name = "l00293" > < / a > < span class = "lineno" > 293< / span >   < span class = "keyword" > public< / span > :< / div >
< div class = "line" > < a name = "l00294" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_top_n_cuts.html#ae2f332f3da75b289d2e3a2b8e73f4ce1" > 294< / a > < / span >   < span class = "keyword" > explicit< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_top_n_cuts.html#ae2f332f3da75b289d2e3a2b8e73f4ce1" > TopNCuts< / a > (< span class = "keywordtype" > int< / span > n) : cuts_(n) {}< / div >
< div class = "line" > < a name = "l00295" > < / a > < span class = "lineno" > 295< / span >   < / div >
< div class = "line" > < a name = "l00296" > < / a > < span class = "lineno" > 296< / span >   < span class = "comment" > // Add a cut to the local pool< / span > < / div >
< div class = "line" > < a name = "l00297" > < / a > < span class = "lineno" > 297< / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_top_n_cuts.html#a713bdb803c52b7b7ac3c52ba9b869530" > AddCut< / a > (< a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint.html" > LinearConstraint< / a > < a class = "code" href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > , < span class = "keyword" > const< / span > std::string& < a class = "code" href = "default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267" > name< / a > ,< / div >
< div class = "line" > < a name = "l00298" > < / a > < span class = "lineno" > 298< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classabsl_1_1_strong_vector.html" > absl::StrongVector< IntegerVariable, double> < / a > & lp_solution);< / div >
< div class = "line" > < a name = "l00299" > < / a > < span class = "lineno" > 299< / span >   < / div >
< div class = "line" > < a name = "l00300" > < / a > < span class = "lineno" > 300< / span >   < span class = "comment" > // Empty the local pool and add all its content to the manager.< / span > < / div >
< div class = "line" > < a name = "l00301" > < / a > < span class = "lineno" > 301< / span >   < span class = "keywordtype" > void< / span > < a class = "code" href = "classoperations__research_1_1sat_1_1_top_n_cuts.html#afb0f85e921e0f240d59d2a739e6b5712" > TransferToManager< / a > (< / div >
< div class = "line" > < a name = "l00302" > < / a > < span class = "lineno" > 302< / span >   < span class = "keyword" > const< / span > < a class = "code" href = "classabsl_1_1_strong_vector.html" > absl::StrongVector< IntegerVariable, double> < / a > & lp_solution,< / div >
< div class = "line" > < a name = "l00303" > < / a > < span class = "lineno" > 303< / span >   < a class = "code" href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html" > LinearConstraintManager< / a > * manager);< / div >
< div class = "line" > < a name = "l00304" > < / a > < span class = "lineno" > 304< / span >   < / div >
< div class = "line" > < a name = "l00305" > < / a > < span class = "lineno" > 305< / span >   < span class = "keyword" > private< / span > :< / div >
< div class = "line" > < a name = "l00306" > < / a > < span class = "lineno" > 306< / span >   < span class = "keyword" > struct < / span > CutCandidate {< / div >
< div class = "line" > < a name = "l00307" > < / a > < span class = "lineno" > 307< / span >   std::string < a class = "code" href = "default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267" > name< / a > ;< / div >
< div class = "line" > < a name = "l00308" > < / a > < span class = "lineno" > 308< / span >   < a class = "code" href = "structoperations__research_1_1sat_1_1_linear_constraint.html" > LinearConstraint< / a > cut;< / div >
< div class = "line" > < a name = "l00309" > < / a > < span class = "lineno" > 309< / span >   };< / div >
< div class = "line" > < a name = "l00310" > < / a > < span class = "lineno" > 310< / span >   TopN< CutCandidate> cuts_;< / div >
< div class = "line" > < a name = "l00311" > < / a > < span class = "lineno" > 311< / span >   };< / div >
< div class = "line" > < a name = "l00312" > < / a > < span class = "lineno" > 312< / span >   < / div >
< div class = "line" > < a name = "l00313" > < / a > < span class = "lineno" > 313< / span >   } < span class = "comment" > // namespace sat< / span > < / div >
< div class = "line" > < a name = "l00314" > < / a > < span class = "lineno" > 314< / span >   } < span class = "comment" > // namespace operations_research< / span > < / div >
< div class = "line" > < a name = "l00315" > < / a > < span class = "lineno" > 315< / span >   < / div >
< div class = "line" > < a name = "l00316" > < / a > < span class = "lineno" > 316< / span >   < span class = "preprocessor" > #endif < / span > < span class = "comment" > // OR_TOOLS_SAT_LINEAR_CONSTRAINT_MANAGER_H_< / span > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "aclassabsl_1_1_strong_vector_html" > < div class = "ttname" > < a href = "classabsl_1_1_strong_vector.html" > absl::StrongVector< IntegerVariable, double > < / a > < / div > < / div >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "aclassoperations__research_1_1_solver_logger_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_solver_logger.html" > operations_research::SolverLogger< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "util_2logging_8h_source.html#l00033" > util/logging.h:33< / a > < / div > < / div >
2020-10-09 12:00:09 +02:00
< 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-04-27 23:00:03 +02:00
< 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#l00545" > integer.h:545< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html" > operations_research::sat::LinearConstraintManager< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00043" > linear_constraint_manager.h:43< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a032fff0a8f02355526b35c826af7804e" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a032fff0a8f02355526b35c826af7804e" > operations_research::sat::LinearConstraintManager::~LinearConstraintManager< / a > < / div > < div class = "ttdeci" > ~LinearConstraintManager()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8cc_source.html#l00047" > linear_constraint_manager.cc:47< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a043cb91961ad5cc66dd56d8606636282" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a043cb91961ad5cc66dd56d8606636282" > operations_research::sat::LinearConstraintManager::num_coeff_strenghtening< / a > < / div > < div class = "ttdeci" > int64_t num_coeff_strenghtening() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00132" > linear_constraint_manager.h:132< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a06c07e8494062d60f06fbc1752761583" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a06c07e8494062d60f06fbc1752761583" > operations_research::sat::LinearConstraintManager::DEFINE_INT_TYPE< / a > < / div > < div class = "ttdeci" > DEFINE_INT_TYPE(ConstraintIndex, int32_t)< / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a1951610defebe3a3b82d99006793486a" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a1951610defebe3a3b82d99006793486a" > operations_research::sat::LinearConstraintManager::ChangeLp< / a > < / div > < div class = "ttdeci" > bool ChangeLp(const absl::StrongVector< IntegerVariable, double > & lp_solution, glop::BasisState *solution_state)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8cc_source.html#l00456" > linear_constraint_manager.cc:456< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a1afbe8d162a9cba17a520812ec6d3dd4" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a1afbe8d162a9cba17a520812ec6d3dd4" > operations_research::sat::LinearConstraintManager::DebugCheckConstraint< / a > < / div > < div class = "ttdeci" > bool DebugCheckConstraint(const LinearConstraint & cut)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8cc_source.html#l00706" > linear_constraint_manager.cc:706< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a36295bfe464bcdb6465fe796a43d02bf" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a36295bfe464bcdb6465fe796a43d02bf" > operations_research::sat::LinearConstraintManager::SetObjectiveCoefficient< / a > < / div > < div class = "ttdeci" > void SetObjectiveCoefficient(IntegerVariable var, IntegerValue coeff)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8cc_source.html#l00316" > linear_constraint_manager.cc:316< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a40e3f0f21a2c16b673c84f734ba6d095" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a40e3f0f21a2c16b673c84f734ba6d095" > operations_research::sat::LinearConstraintManager::Add< / a > < / div > < div class = "ttdeci" > ConstraintIndex Add(LinearConstraint ct, bool *added=nullptr)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8cc_source.html#l00145" > linear_constraint_manager.cc:145< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a4e8ec9d9279fe2503136ba89f2733c0c" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a4e8ec9d9279fe2503136ba89f2733c0c" > operations_research::sat::LinearConstraintManager::num_cuts< / a > < / div > < div class = "ttdeci" > int64_t num_cuts() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00128" > linear_constraint_manager.h:128< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a5a155a7d7251f9fd35dbe09ccea840bc" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a5a155a7d7251f9fd35dbe09ccea840bc" > operations_research::sat::LinearConstraintManager::num_shortened_constraints< / a > < / div > < div class = "ttdeci" > int64_t num_shortened_constraints() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00129" > linear_constraint_manager.h:129< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a71a79a003419f05324e7951f69265701" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a71a79a003419f05324e7951f69265701" > operations_research::sat::LinearConstraintManager::AllConstraints< / a > < / div > < div class = "ttdeci" > const absl::StrongVector< ConstraintIndex, ConstraintInfo > & AllConstraints() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00117" > linear_constraint_manager.h:117< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a84ae5ff883fcce91f758a729af446864" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a84ae5ff883fcce91f758a729af446864" > operations_research::sat::LinearConstraintManager::LpConstraints< / a > < / div > < div class = "ttdeci" > const std::vector< ConstraintIndex > & LpConstraints() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00124" > linear_constraint_manager.h:124< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a87cc96a3e72099107712a0386d89d851" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a87cc96a3e72099107712a0386d89d851" > operations_research::sat::LinearConstraintManager::AddAllConstraintsToLp< / a > < / div > < div class = "ttdeci" > void AddAllConstraintsToLp()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8cc_source.html#l00698" > linear_constraint_manager.cc:698< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_a9456bb31790e4dae791914e3c065b460" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#a9456bb31790e4dae791914e3c065b460" > operations_research::sat::LinearConstraintManager::AddCut< / a > < / div > < div class = "ttdeci" > bool AddCut(LinearConstraint ct, std::string type_name, const absl::StrongVector< IntegerVariable, double > & lp_solution, std::string extra_info=" " )< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8cc_source.html#l00221" > linear_constraint_manager.cc:221< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_linear_constraint_manager_html_ae6b8a1c5b934ebd045481bbd0825229d" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_linear_constraint_manager.html#ae6b8a1c5b934ebd045481bbd0825229d" > operations_research::sat::LinearConstraintManager::LinearConstraintManager< / a > < / div > < div class = "ttdeci" > LinearConstraintManager(Model *model)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00068" > linear_constraint_manager.h:68< / a > < / div > < / div >
2020-10-09 12:00:09 +02: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 >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_top_n_cuts_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_top_n_cuts.html" > operations_research::sat::TopNCuts< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00292" > linear_constraint_manager.h:292< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_top_n_cuts_html_a713bdb803c52b7b7ac3c52ba9b869530" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_top_n_cuts.html#a713bdb803c52b7b7ac3c52ba9b869530" > operations_research::sat::TopNCuts::AddCut< / a > < / div > < div class = "ttdeci" > void AddCut(LinearConstraint ct, const std::string & name, const absl::StrongVector< IntegerVariable, double > & lp_solution)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8cc_source.html#l00726" > linear_constraint_manager.cc:726< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_top_n_cuts_html_ae2f332f3da75b289d2e3a2b8e73f4ce1" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_top_n_cuts.html#ae2f332f3da75b289d2e3a2b8e73f4ce1" > operations_research::sat::TopNCuts::TopNCuts< / a > < / div > < div class = "ttdeci" > TopNCuts(int n)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00294" > linear_constraint_manager.h:294< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_top_n_cuts_html_afb0f85e921e0f240d59d2a739e6b5712" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_top_n_cuts.html#afb0f85e921e0f240d59d2a739e6b5712" > operations_research::sat::TopNCuts::TransferToManager< / a > < / div > < div class = "ttdeci" > void TransferToManager(const absl::StrongVector< IntegerVariable, double > & lp_solution, LinearConstraintManager *manager)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8cc_source.html#l00737" > linear_constraint_manager.cc:737< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_top_n_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_top_n.html" > operations_research::sat::TopN< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00238" > linear_constraint_manager.h:238< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_top_n_html_a33ac8067c9a2b30fa4906ce9a32dd30f" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_top_n.html#a33ac8067c9a2b30fa4906ce9a32dd30f" > operations_research::sat::TopN::UnorderedElements< / a > < / div > < div class = "ttdeci" > const std::vector< Element > & UnorderedElements() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00268" > linear_constraint_manager.h:268< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_top_n_html_a6562540dd1028bdfeea27af27d4d4d10" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_top_n.html#a6562540dd1028bdfeea27af27d4d4d10" > operations_research::sat::TopN::Add< / a > < / div > < div class = "ttdeci" > void Add(Element e, double score)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00247" > linear_constraint_manager.h:247< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_top_n_html_aa71d36872f416feaa853788a7a7a7ef8" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_top_n.html#aa71d36872f416feaa853788a7a7a7ef8" > operations_research::sat::TopN::Clear< / a > < / div > < div class = "ttdeci" > void Clear()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00242" > linear_constraint_manager.h:242< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_top_n_html_afd1a2718a8d70a5b9a8ca8444f5d6242" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_top_n.html#afd1a2718a8d70a5b9a8ca8444f5d6242" > operations_research::sat::TopN::TopN< / a > < / div > < div class = "ttdeci" > TopN(int n)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00240" > linear_constraint_manager.h:240< / a > < / div > < / div >
< div class = "ttc" id = "adefault__search_8cc_html_ac673bc430bdc3fdaa09f7becf98ef267" > < div class = "ttname" > < a href = "default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267" > name< / a > < / div > < div class = "ttdeci" > const std::string name< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "default__search_8cc_source.html#l00813" > default_search.cc:813< / a > < / div > < / div >
< div class = "ttc" id = "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#l00043" > demon_profiler.cc:43< / 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#l01874" > expr_array.cc:1874< / 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#l00273" > gurobi_interface.cc:273< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_html" > < div class = "ttname" > < a href = "namespaceoperations__research.html" > operations_research< / a > < / div > < div class = "ttdoc" > Collection of objects used to extend the Constraint Solver library.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "dense__doubly__linked__list_8h_source.html#l00021" > dense_doubly_linked_list.h:21< / a > < / div > < / div >
< 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#l00509" > pack.cc:509< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "arevised__simplex_8h_html" > < div class = "ttname" > < a href = "revised__simplex_8h.html" > revised_simplex.h< / a > < / div > < / div >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "asat_2linear__constraint_8h_html" > < div class = "ttname" > < a href = "sat_2linear__constraint_8h.html" > linear_constraint.h< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "asat_2model_8h_html" > < div class = "ttname" > < a href = "sat_2model_8h.html" > model.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 >
2020-12-29 22:27:47 +01:00
< div class = "ttc" id = "astrong__vector_8h_html" > < div class = "ttname" > < a href = "strong__vector_8h.html" > strong_vector.h< / a > < / div > < / div >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "astructoperations__research_1_1glop_1_1_basis_state_html" > < div class = "ttname" > < a href = "structoperations__research_1_1glop_1_1_basis_state.html" > operations_research::glop::BasisState< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "variables__info_8h_source.html#l00035" > variables_info.h:35< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_linear_constraint_html" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_linear_constraint.html" > operations_research::sat::LinearConstraint< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat_2linear__constraint_8h_source.html#l00040" > sat/linear_constraint.h:40< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info_html" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html" > operations_research::sat::LinearConstraintManager::ConstraintInfo< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00045" > linear_constraint_manager.h:45< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info_html_a032d3e55dc38f64c8914c8a6f9d3ba66" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a032d3e55dc38f64c8914c8a6f9d3ba66" > operations_research::sat::LinearConstraintManager::ConstraintInfo::constraint< / a > < / div > < div class = "ttdeci" > LinearConstraint constraint< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00046" > linear_constraint_manager.h:46< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info_html_a04af0b6ebbb703c086fd02f565893b77" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a04af0b6ebbb703c086fd02f565893b77" > operations_research::sat::LinearConstraintManager::ConstraintInfo::is_in_lp< / a > < / div > < div class = "ttdeci" > bool is_in_lp< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00051" > linear_constraint_manager.h:51< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info_html_a0e28c752246171950355c329b48f2642" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a0e28c752246171950355c329b48f2642" > operations_research::sat::LinearConstraintManager::ConstraintInfo::objective_parallelism< / a > < / div > < div class = "ttdeci" > double objective_parallelism< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00049" > linear_constraint_manager.h:49< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info_html_a2a897122b37c5a906205687aecdb627b" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a2a897122b37c5a906205687aecdb627b" > operations_research::sat::LinearConstraintManager::ConstraintInfo::l2_norm< / a > < / div > < div class = "ttdeci" > double l2_norm< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00047" > linear_constraint_manager.h:47< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info_html_a2b07c49e916f21a26aa731f4db68785a" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a2b07c49e916f21a26aa731f4db68785a" > operations_research::sat::LinearConstraintManager::ConstraintInfo::hash< / a > < / div > < div class = "ttdeci" > size_t hash< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00052" > linear_constraint_manager.h:52< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info_html_a3aff95685ad7d3e3e26fe0427d3ed1b4" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a3aff95685ad7d3e3e26fe0427d3ed1b4" > operations_research::sat::LinearConstraintManager::ConstraintInfo::is_deletable< / a > < / div > < div class = "ttdeci" > bool is_deletable< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00065" > linear_constraint_manager.h:65< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info_html_a64cbd77208a462a2d718ed0be41d4b6c" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a64cbd77208a462a2d718ed0be41d4b6c" > operations_research::sat::LinearConstraintManager::ConstraintInfo::active_count< / a > < / div > < div class = "ttdeci" > double active_count< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00058" > linear_constraint_manager.h:58< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info_html_a7913a8eaf1375fa698efc794687abaa5" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a7913a8eaf1375fa698efc794687abaa5" > operations_research::sat::LinearConstraintManager::ConstraintInfo::inactive_count< / a > < / div > < div class = "ttdeci" > int64_t inactive_count< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00048" > linear_constraint_manager.h:48< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info_html_a8a4f9b10d73c36bcab51eaeec3f1e5b6" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a8a4f9b10d73c36bcab51eaeec3f1e5b6" > operations_research::sat::LinearConstraintManager::ConstraintInfo::current_score< / a > < / div > < div class = "ttdeci" > double current_score< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00053" > linear_constraint_manager.h:53< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info_html_a9b067b51be5391d99da97806a62da560" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_linear_constraint_manager_1_1_constraint_info.html#a9b067b51be5391d99da97806a62da560" > operations_research::sat::LinearConstraintManager::ConstraintInfo::objective_parallelism_computed< / a > < / div > < div class = "ttdeci" > bool objective_parallelism_computed< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__constraint__manager_8h_source.html#l00050" > linear_constraint_manager.h:50< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< div class = "ttc" id = "atime__limit_8h_html" > < div class = "ttname" > < a href = "time__limit_8h.html" > time_limit.h< / a > < / div > < / div >
2021-04-27 23:00:03 +02:00
< div class = "ttc" id = "autil_2logging_8h_html" > < div class = "ttname" > < a href = "util_2logging_8h.html" > logging.h< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< / 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 = "linear__constraint__manager_8h.html" > linear_constraint_manager.h< / a > < / li >
< li class = "footer" > Generated by
< a href = "http://www.doxygen.org/index.html" >
2021-01-26 11:28:50 +01:00
< img class = "footer" src = "doxygen.png" alt = "doxygen" / > < / a > 1.9.1 < / li >
2020-09-02 09:42:51 +02:00
< / ul >
< / div >
< / body >
< / html >
