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" / >
2022-01-17 21:42:14 +01:00
< meta name = "generator" content = "Doxygen 1.9.3" / >
2020-09-02 09:42:51 +02:00
< meta name = "viewport" content = "width=device-width, initial-scale=1" / >
< title > OR-Tools: knapsack_solver.cc Source File< / title >
< link href = "tabs.css" rel = "stylesheet" type = "text/css" / >
< script type = "text/javascript" src = "jquery.js" > < / script >
< script type = "text/javascript" src = "dynsections.js" > < / script >
< link href = "navtree.css" rel = "stylesheet" type = "text/css" / >
< script type = "text/javascript" src = "resize.js" > < / script >
< script type = "text/javascript" src = "navtreedata.js" > < / script >
< script type = "text/javascript" src = "navtree.js" > < / script >
< link href = "search/search.css" rel = "stylesheet" type = "text/css" / >
< script type = "text/javascript" src = "search/searchdata.js" > < / script >
< script type = "text/javascript" src = "search/search.js" > < / script >
< link href = "doxygen.css" rel = "stylesheet" type = "text/css" / >
< link href = "styleSheet.tmp.css" rel = "stylesheet" type = "text/css" / >
< / head >
< body >
< div id = "top" > <!-- do not remove this div, it is closed by doxygen! -->
< div id = "titlearea" >
< table cellspacing = "0" cellpadding = "0" >
< tbody >
< tr style = "height: 56px;" >
< td id = "projectlogo" > < img alt = "Logo" src = "orLogo.png" / > < / td >
< td id = "projectalign" style = "padding-left: 0.5em;" >
< div id = "projectname" > OR-Tools
2022-03-04 00:11:33 +01:00
  < span id = "projectnumber" > 9.3< / span >
2020-09-02 09:42:51 +02:00
< / div >
< / td >
< / tr >
< / tbody >
< / table >
< / div >
<!-- end header part -->
2022-01-17 21:42:14 +01:00
<!-- Generated by Doxygen 1.9.3 -->
2020-09-02 09:42:51 +02:00
< script type = "text/javascript" >
2022-01-17 21:42:14 +01:00
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699& dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search",'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" >
2022-01-17 21:42:14 +01:00
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699& dn=expat.txt MIT */
2020-09-02 09:42:51 +02:00
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
2022-01-17 21:42:14 +01:00
/* @license-end */
< / script >
2020-09-02 09:42:51 +02:00
< 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" >
2022-01-17 21:42:14 +01:00
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699& dn=expat.txt MIT */
$(document).ready(function(){initNavTree('knapsack__solver_8cc_source.html',''); initResizable(); });
2020-09-02 09:42:51 +02:00
/* @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" >
2022-01-17 21:42:14 +01:00
< div class = "headertitle" > < div class = "title" > knapsack_solver.cc< / div > < / div >
2020-09-02 09:42:51 +02:00
< / div > <!-- header -->
< div class = "contents" >
2022-01-17 21:42:14 +01:00
< a href = "knapsack__solver_8cc.html" > Go to the documentation of this file.< / a > < div class = "fragment" > < div class = "line" > < a id = "l00001" name = "l00001" > < / a > < span class = "lineno" > 1< / span > < span class = "comment" > // Copyright 2010-2021 Google LLC< / span > < / div >
< div class = "line" > < a id = "l00002" 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 id = "l00003" 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 id = "l00004" 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 id = "l00005" name = "l00005" > < / a > < span class = "lineno" > 5< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00006" 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 id = "l00007" name = "l00007" > < / a > < span class = "lineno" > 7< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00008" 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 id = "l00009" 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 id = "l00010" 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 id = "l00011" 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 id = "l00012" name = "l00012" > < / a > < span class = "lineno" > 12< / span > < span class = "comment" > // limitations under the License.< / span > < / div >
< div class = "line" > < a id = "l00013" name = "l00013" > < / a > < span class = "lineno" > 13< / span > < / div >
< div class = "line" > < a id = "l00014" name = "l00014" > < / a > < span class = "lineno" > 14< / span > < span class = "preprocessor" > #include " < a class = "code" href = "knapsack__solver_8h.html" > ortools/algorithms/knapsack_solver.h< / a > " < / span > < / div >
< div class = "line" > < a id = "l00015" name = "l00015" > < / a > < span class = "lineno" > 15< / span > < / div >
< div class = "line" > < a id = "l00016" name = "l00016" > < / a > < span class = "lineno" > 16< / span > < span class = "preprocessor" > #include < algorithm> < / span > < / div >
< div class = "line" > < a id = "l00017" name = "l00017" > < / a > < span class = "lineno" > 17< / span > < span class = "preprocessor" > #include < cstdint> < / span > < / div >
< div class = "line" > < a id = "l00018" name = "l00018" > < / a > < span class = "lineno" > 18< / span > < span class = "preprocessor" > #include < limits> < / span > < / div >
< div class = "line" > < a id = "l00019" name = "l00019" > < / a > < span class = "lineno" > 19< / span > < span class = "preprocessor" > #include < queue> < / span > < / div >
< div class = "line" > < a id = "l00020" name = "l00020" > < / a > < span class = "lineno" > 20< / span > < span class = "preprocessor" > #include < string> < / span > < / div >
< div class = "line" > < a id = "l00021" name = "l00021" > < / a > < span class = "lineno" > 21< / span > < span class = "preprocessor" > #include < vector> < / span > < / div >
< div class = "line" > < a id = "l00022" name = "l00022" > < / a > < span class = "lineno" > 22< / span > < / div >
< div class = "line" > < a id = "l00023" name = "l00023" > < / a > < span class = "lineno" > 23< / span > < span class = "preprocessor" > #include " absl/memory/memory.h" < / span > < / div >
< div class = "line" > < a id = "l00024" name = "l00024" > < / a > < span class = "lineno" > 24< / span > < span class = "preprocessor" > #include " < a class = "code" href = "stl__util_8h.html" > ortools/base/stl_util.h< / a > " < / span > < / div >
< div class = "line" > < a id = "l00025" name = "l00025" > < / a > < span class = "lineno" > 25< / span > < span class = "preprocessor" > #include " < a class = "code" href = "linear__solver_8h.html" > ortools/linear_solver/linear_solver.h< / a > " < / span > < / div >
< div class = "line" > < a id = "l00026" name = "l00026" > < / a > < span class = "lineno" > 26< / span > < span class = "preprocessor" > #include " < a class = "code" href = "bitset_8h.html" > ortools/util/bitset.h< / a > " < / span > < / div >
< div class = "line" > < a id = "l00027" name = "l00027" > < / a > < span class = "lineno" > 27< / 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 id = "l00028" name = "l00028" > < / a > < span class = "lineno" > 28< / span > < / div >
< div class = "line" > < a id = "l00029" name = "l00029" > < / a > < span class = "lineno" > 29< / span > < span class = "keyword" > namespace < / span > < a class = "code hl_namespace" href = "namespaceoperations__research.html" > operations_research< / a > {< / div >
< div class = "line" > < a id = "l00030" name = "l00030" > < / a > < span class = "lineno" > 30< / span > < / div >
< div class = "line" > < a id = "l00031" name = "l00031" > < / a > < span class = "lineno" > 31< / span > < span class = "keyword" > namespace < / span > {< / div >
< div class = "line" > < a id = "l00032" name = "l00032" > < / a > < span class = "lineno" > 32< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > kNoSelection = -1;< / div >
< div class = "line" > < a id = "l00033" name = "l00033" > < / a > < span class = "lineno" > 33< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > kMasterPropagatorId = 0;< / div >
< div class = "line" > < a id = "l00034" name = "l00034" > < / a > < span class = "lineno" > 34< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > kMaxNumberOfBruteForceItems = 30;< / div >
< div class = "line" > < a id = "l00035" name = "l00035" > < / a > < span class = "lineno" > 35< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > kMaxNumberOf64Items = 64;< / div >
< div class = "line" > < a id = "l00036" name = "l00036" > < / a > < span class = "lineno" > 36< / span > < / div >
< div class = "line" > < a id = "l00037" name = "l00037" > < / a > < span class = "lineno" > 37< / span > < span class = "comment" > // Comparator used to sort item in decreasing efficiency order< / span > < / div >
< div class = "line" > < a id = "l00038" name = "l00038" > < / a > < span class = "lineno" > 38< / span > < span class = "comment" > // (see KnapsackCapacityPropagator).< / span > < / div >
< div class = "line" > < a id = "l00039" name = "l00039" > < / a > < span class = "lineno" > 39< / span > < span class = "keyword" > struct < / span > CompareKnapsackItemsInDecreasingEfficiencyOrder {< / div >
< div class = "line" > < a id = "l00040" name = "l00040" > < / a > < span class = "lineno" > 40< / span > < span class = "keyword" > explicit< / span > CompareKnapsackItemsInDecreasingEfficiencyOrder(int64_t _profit_max)< / div >
< div class = "line" > < a id = "l00041" name = "l00041" > < / a > < span class = "lineno" > 41< / span > : < a class = "code hl_variable" href = "knapsack__solver_8cc.html#a3cb2fc3bc89582cef0819ea753e8a44d" > profit_max< / a > (_profit_max) {}< / div >
< div class = "line" > < a id = "l00042" name = "l00042" > < / a > < span class = "lineno" > 42< / span > < span class = "keywordtype" > bool< / span > operator()(< span class = "keyword" > const< / span > < a class = "code hl_typedef" href = "namespaceoperations__research.html#ada7d9b46f657c6053a197273a85043a7" > KnapsackItemPtr< / a > & item1,< / div >
< div class = "line" > < a id = "l00043" name = "l00043" > < / a > < span class = "lineno" > 43< / span > < span class = "keyword" > const< / span > < a class = "code hl_typedef" href = "namespaceoperations__research.html#ada7d9b46f657c6053a197273a85043a7" > KnapsackItemPtr< / a > & item2)< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a id = "l00044" name = "l00044" > < / a > < span class = "lineno" > 44< / span > < span class = "keywordflow" > return< / span > item1-> GetEfficiency(< a class = "code hl_variable" href = "knapsack__solver_8cc.html#a3cb2fc3bc89582cef0819ea753e8a44d" > profit_max< / a > ) > item2-> GetEfficiency(< a class = "code hl_variable" href = "knapsack__solver_8cc.html#a3cb2fc3bc89582cef0819ea753e8a44d" > profit_max< / a > );< / div >
< div class = "line" > < a id = "l00045" name = "l00045" > < / a > < span class = "lineno" > 45< / span > }< / div >
< div class = "line" > < a id = "l00046" name = "l00046" > < / a > < span class = "lineno" > < a class = "line" href = "knapsack__solver_8cc.html#a3cb2fc3bc89582cef0819ea753e8a44d" > 46< / a > < / span > < span class = "keyword" > const< / span > int64_t < a class = "code hl_variable" href = "knapsack__solver_8cc.html#a3cb2fc3bc89582cef0819ea753e8a44d" > profit_max< / a > ;< / div >
< div class = "line" > < a id = "l00047" name = "l00047" > < / a > < span class = "lineno" > 47< / span > };< / div >
< div class = "line" > < a id = "l00048" name = "l00048" > < / a > < span class = "lineno" > 48< / span > < / div >
< div class = "line" > < a id = "l00049" name = "l00049" > < / a > < span class = "lineno" > 49< / span > < span class = "comment" > // Comparator used to sort search nodes in the priority queue in order< / span > < / div >
< div class = "line" > < a id = "l00050" name = "l00050" > < / a > < span class = "lineno" > 50< / span > < span class = "comment" > // to pop first the node with the highest profit upper bound< / span > < / div >
< div class = "line" > < a id = "l00051" name = "l00051" > < / a > < span class = "lineno" > 51< / span > < span class = "comment" > // (see KnapsackSearchNode). When two nodes have the same upper bound, we< / span > < / div >
< div class = "line" > < a id = "l00052" name = "l00052" > < / a > < span class = "lineno" > 52< / span > < span class = "comment" > // prefer the one with the highest current profit, ie. usually the one closer< / span > < / div >
< div class = "line" > < a id = "l00053" name = "l00053" > < / a > < span class = "lineno" > 53< / span > < span class = "comment" > // to a leaf. In practice, the main advantage is to have smaller path.< / span > < / div >
< div class = "line" > < a id = "l00054" name = "l00054" > < / a > < span class = "lineno" > 54< / span > < span class = "keyword" > struct < / span > CompareKnapsackSearchNodePtrInDecreasingUpperBoundOrder {< / div >
< div class = "line" > < a id = "l00055" name = "l00055" > < / a > < span class = "lineno" > 55< / span > < span class = "keywordtype" > bool< / span > operator()(< span class = "keyword" > const< / span > KnapsackSearchNode* node_1,< / div >
< div class = "line" > < a id = "l00056" name = "l00056" > < / a > < span class = "lineno" > 56< / span > < span class = "keyword" > const< / span > KnapsackSearchNode* node_2)< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a id = "l00057" name = "l00057" > < / a > < span class = "lineno" > 57< / span > < span class = "keyword" > const< / span > int64_t profit_upper_bound_1 = node_1-> profit_upper_bound();< / div >
< div class = "line" > < a id = "l00058" name = "l00058" > < / a > < span class = "lineno" > 58< / span > < span class = "keyword" > const< / span > int64_t profit_upper_bound_2 = node_2-> profit_upper_bound();< / div >
< div class = "line" > < a id = "l00059" name = "l00059" > < / a > < span class = "lineno" > 59< / span > < span class = "keywordflow" > if< / span > (profit_upper_bound_1 == profit_upper_bound_2) {< / div >
< div class = "line" > < a id = "l00060" name = "l00060" > < / a > < span class = "lineno" > 60< / span > < span class = "keywordflow" > return< / span > node_1-> current_profit() < node_2-> current_profit();< / div >
< div class = "line" > < a id = "l00061" name = "l00061" > < / a > < span class = "lineno" > 61< / span > }< / div >
< div class = "line" > < a id = "l00062" name = "l00062" > < / a > < span class = "lineno" > 62< / span > < span class = "keywordflow" > return< / span > profit_upper_bound_1 < profit_upper_bound_2;< / div >
< div class = "line" > < a id = "l00063" name = "l00063" > < / a > < span class = "lineno" > 63< / span > }< / div >
< div class = "line" > < a id = "l00064" name = "l00064" > < / a > < span class = "lineno" > 64< / span > };< / div >
< div class = "line" > < a id = "l00065" name = "l00065" > < / a > < span class = "lineno" > 65< / span > < / div >
< div class = "line" > < a id = "l00066" name = "l00066" > < / a > < span class = "lineno" > 66< / span > < span class = "keyword" > typedef< / span > std::priority_queue< < / div >
< div class = "line" > < a id = "l00067" name = "l00067" > < / a > < span class = "lineno" > 67< / span > KnapsackSearchNode*, std::vector< KnapsackSearchNode*> ,< / div >
< div class = "line" > < a id = "l00068" name = "l00068" > < / a > < span class = "lineno" > 68< / span > CompareKnapsackSearchNodePtrInDecreasingUpperBoundOrder> < / div >
< div class = "line" > < a id = "l00069" name = "l00069" > < / a > < span class = "lineno" > 69< / span > SearchQueue;< / div >
< div class = "line" > < a id = "l00070" name = "l00070" > < / a > < span class = "lineno" > 70< / span > < / div >
< div class = "line" > < a id = "l00071" name = "l00071" > < / a > < span class = "lineno" > 71< / span > < span class = "comment" > // Returns true when value_1 * value_2 may overflow int64_t.< / span > < / div >
< div class = "line" > < a id = "l00072" name = "l00072" > < / a > < span class = "lineno" > 72< / span > < span class = "keyword" > inline< / span > < span class = "keywordtype" > bool< / span > WillProductOverflow(int64_t value_1, int64_t value_2) {< / div >
< div class = "line" > < a id = "l00073" name = "l00073" > < / a > < span class = "lineno" > 73< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > MostSignificantBitPosition1 = < a class = "code hl_function" href = "namespaceoperations__research.html#afa6ef9aef70f95b9d5bcee2c10937bc8" > MostSignificantBitPosition64< / a > (value_1);< / div >
< div class = "line" > < a id = "l00074" name = "l00074" > < / a > < span class = "lineno" > 74< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > MostSignificantBitPosition2 = < a class = "code hl_function" href = "namespaceoperations__research.html#afa6ef9aef70f95b9d5bcee2c10937bc8" > MostSignificantBitPosition64< / a > (value_2);< / div >
< div class = "line" > < a id = "l00075" name = "l00075" > < / a > < span class = "lineno" > 75< / span > < span class = "comment" > // The sum should be less than 61 to be safe as we are only considering the< / span > < / div >
< div class = "line" > < a id = "l00076" name = "l00076" > < / a > < span class = "lineno" > 76< / span > < span class = "comment" > // most significant bit and dealing with int64_t instead of uint64_t.< / span > < / div >
< div class = "line" > < a id = "l00077" name = "l00077" > < / a > < span class = "lineno" > 77< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > kOverflow = 61;< / div >
< div class = "line" > < a id = "l00078" name = "l00078" > < / a > < span class = "lineno" > 78< / span > < span class = "keywordflow" > return< / span > MostSignificantBitPosition1 + MostSignificantBitPosition2 > kOverflow;< / div >
< div class = "line" > < a id = "l00079" name = "l00079" > < / a > < span class = "lineno" > 79< / span > }< / div >
< div class = "line" > < a id = "l00080" name = "l00080" > < / a > < span class = "lineno" > 80< / span > < / div >
< div class = "line" > < a id = "l00081" name = "l00081" > < / a > < span class = "lineno" > 81< / span > < span class = "comment" > // Returns an upper bound of (numerator_1 * numerator_2) / denominator< / span > < / div >
< div class = "line" > < a id = "l00082" name = "l00082" > < / a > < span class = "lineno" > 82< / span > int64_t UpperBoundOfRatio(int64_t numerator_1, int64_t numerator_2,< / div >
< div class = "line" > < a id = "l00083" name = "l00083" > < / a > < span class = "lineno" > 83< / span > int64_t denominator) {< / div >
< div class = "line" > < a id = "l00084" name = "l00084" > < / a > < span class = "lineno" > 84< / span > < a class = "code hl_define" href = "base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a" > DCHECK_GT< / a > (denominator, int64_t{0});< / div >
< div class = "line" > < a id = "l00085" name = "l00085" > < / a > < span class = "lineno" > 85< / span > < span class = "keywordflow" > if< / span > (!WillProductOverflow(numerator_1, numerator_2)) {< / div >
< div class = "line" > < a id = "l00086" name = "l00086" > < / a > < span class = "lineno" > 86< / span > < span class = "keyword" > const< / span > int64_t numerator = numerator_1 * numerator_2;< / div >
< div class = "line" > < a id = "l00087" name = "l00087" > < / a > < span class = "lineno" > 87< / span > < span class = "comment" > // Round to zero.< / span > < / div >
< div class = "line" > < a id = "l00088" name = "l00088" > < / a > < span class = "lineno" > 88< / span > < span class = "keyword" > const< / span > int64_t result = numerator / denominator;< / div >
< div class = "line" > < a id = "l00089" name = "l00089" > < / a > < span class = "lineno" > 89< / span > < span class = "keywordflow" > return< / span > result;< / div >
< div class = "line" > < a id = "l00090" name = "l00090" > < / a > < span class = "lineno" > 90< / span > } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a id = "l00091" name = "l00091" > < / a > < span class = "lineno" > 91< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > double< / span > < a class = "code hl_variable" href = "revised__simplex_8cc.html#af01c50e388647c921aa7d9c77f2b72b2" > ratio< / a > =< / div >
< div class = "line" > < a id = "l00092" name = "l00092" > < / a > < span class = "lineno" > 92< / span > (< span class = "keyword" > static_cast< < / span > < span class = "keywordtype" > double< / span > < span class = "keyword" > > < / span > (numerator_1) * < span class = "keyword" > static_cast< < / span > < span class = "keywordtype" > double< / span > < span class = "keyword" > > < / span > (numerator_2)) /< / div >
< div class = "line" > < a id = "l00093" name = "l00093" > < / a > < span class = "lineno" > 93< / span > < span class = "keyword" > static_cast< < / span > < span class = "keywordtype" > double< / span > < span class = "keyword" > > < / span > (denominator);< / div >
< div class = "line" > < a id = "l00094" name = "l00094" > < / a > < span class = "lineno" > 94< / span > < span class = "comment" > // Round near.< / span > < / div >
< div class = "line" > < a id = "l00095" name = "l00095" > < / a > < span class = "lineno" > 95< / span > < span class = "keyword" > const< / span > int64_t result = < span class = "keyword" > static_cast< < / span > int64_t< span class = "keyword" > > < / span > (floor(< a class = "code hl_variable" href = "revised__simplex_8cc.html#af01c50e388647c921aa7d9c77f2b72b2" > ratio< / a > + 0.5));< / div >
< div class = "line" > < a id = "l00096" name = "l00096" > < / a > < span class = "lineno" > 96< / span > < span class = "keywordflow" > return< / span > result;< / div >
< div class = "line" > < a id = "l00097" name = "l00097" > < / a > < span class = "lineno" > 97< / span > }< / div >
< div class = "line" > < a id = "l00098" name = "l00098" > < / a > < span class = "lineno" > 98< / span > }< / div >
< div class = "line" > < a id = "l00099" name = "l00099" > < / a > < span class = "lineno" > 99< / span > < / div >
< div class = "line" > < a id = "l00100" name = "l00100" > < / a > < span class = "lineno" > 100< / span > } < span class = "comment" > // namespace< / span > < / div >
< div class = "line" > < a id = "l00101" name = "l00101" > < / a > < span class = "lineno" > 101< / span > < / div >
< div class = "line" > < a id = "l00102" name = "l00102" > < / a > < span class = "lineno" > 102< / span > < span class = "comment" > // ----- KnapsackSearchNode -----< / span > < / div >
< div class = "line" > < a id = "l00103" name = "l00103" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_search_node.html#ad17e46a2afcf393a4ec9159162c969f2" > 103< / a > < / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_node.html#ad17e46a2afcf393a4ec9159162c969f2" > KnapsackSearchNode::KnapsackSearchNode< / a > (< span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_search_node.html" > KnapsackSearchNode< / a > * < span class = "keyword" > const< / span > parent,< / div >
< div class = "line" > < a id = "l00104" name = "l00104" > < / a > < span class = "lineno" > 104< / span > < span class = "keyword" > const< / span > < a class = "code hl_struct" href = "structoperations__research_1_1_knapsack_assignment.html" > KnapsackAssignment< / a > & assignment)< / div >
< div class = "line" > < a id = "l00105" name = "l00105" > < / a > < span class = "lineno" > 105< / span > : depth_((parent == nullptr) ? 0 : parent-> depth() + 1),< / div >
< div class = "line" > < a id = "l00106" name = "l00106" > < / a > < span class = "lineno" > 106< / span > parent_(parent),< / div >
< div class = "line" > < a id = "l00107" name = "l00107" > < / a > < span class = "lineno" > 107< / span > assignment_(assignment),< / div >
< div class = "line" > < a id = "l00108" name = "l00108" > < / a > < span class = "lineno" > 108< / span > current_profit_(0),< / div >
< div class = "line" > < a id = "l00109" name = "l00109" > < / a > < span class = "lineno" > 109< / span > profit_upper_bound_(< a class = "code hl_namespace" href = "namespacestd.html" > std< / a > ::numeric_limits< int64_t> ::< a class = "code hl_variable" href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > max< / a > ()),< / div >
< div class = "line" > < a id = "l00110" name = "l00110" > < / a > < span class = "lineno" > 110< / span > next_item_id_(kNoSelection) {}< / div >
< div class = "line" > < a id = "l00111" name = "l00111" > < / a > < span class = "lineno" > 111< / span > < / div >
< div class = "line" > < a id = "l00112" name = "l00112" > < / a > < span class = "lineno" > 112< / span > < span class = "comment" > // ----- KnapsackSearchPath -----< / span > < / div >
< div class = "line" > < a id = "l00113" name = "l00113" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_search_path.html#a3dc3602e1a640bc986956e0ce5e88d04" > 113< / a > < / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_path.html#a3dc3602e1a640bc986956e0ce5e88d04" > KnapsackSearchPath::KnapsackSearchPath< / a > (< span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_search_node.html" > KnapsackSearchNode< / a > & from,< / div >
< div class = "line" > < a id = "l00114" name = "l00114" > < / a > < span class = "lineno" > 114< / span > < span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_search_node.html" > KnapsackSearchNode< / a > & to)< / div >
< div class = "line" > < a id = "l00115" name = "l00115" > < / a > < span class = "lineno" > 115< / span > : from_(from), via_(nullptr), to_(to) {}< / div >
< div class = "line" > < a id = "l00116" name = "l00116" > < / a > < span class = "lineno" > 116< / span > < / div >
< div class = "line" > < a id = "l00117" name = "l00117" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_search_path.html#a1e3b6d38df0786ccf7f938d60e386aae" > 117< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_path.html#a1e3b6d38df0786ccf7f938d60e386aae" > KnapsackSearchPath::Init< / a > () {< / div >
< div class = "line" > < a id = "l00118" name = "l00118" > < / a > < span class = "lineno" > 118< / span > < span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_search_node.html" > KnapsackSearchNode< / a > * node_from = < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_path.html#a09f219a2226f7c0de0f50b6f00c099e3" > MoveUpToDepth< / a > (from_, to_.< a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_node.html#a6fdd73f8011695b97659f2bea29325cb" > depth< / a > ());< / div >
< div class = "line" > < a id = "l00119" name = "l00119" > < / a > < span class = "lineno" > 119< / span > < span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_search_node.html" > KnapsackSearchNode< / a > * node_to = < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_path.html#a09f219a2226f7c0de0f50b6f00c099e3" > MoveUpToDepth< / a > (to_, from_.< a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_node.html#a6fdd73f8011695b97659f2bea29325cb" > depth< / a > ());< / div >
< div class = "line" > < a id = "l00120" name = "l00120" > < / a > < span class = "lineno" > 120< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (node_from-> < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_node.html#a6fdd73f8011695b97659f2bea29325cb" > depth< / a > (), node_to-> < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_node.html#a6fdd73f8011695b97659f2bea29325cb" > depth< / a > ());< / div >
< div class = "line" > < a id = "l00121" name = "l00121" > < / a > < span class = "lineno" > 121< / span > < / div >
< div class = "line" > < a id = "l00122" name = "l00122" > < / a > < span class = "lineno" > 122< / span > < span class = "comment" > // Find common parent.< / span > < / div >
< div class = "line" > < a id = "l00123" name = "l00123" > < / a > < span class = "lineno" > 123< / span > < span class = "keywordflow" > while< / span > (node_from != node_to) {< / div >
< div class = "line" > < a id = "l00124" name = "l00124" > < / a > < span class = "lineno" > 124< / span > node_from = node_from-> < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_node.html#a94edd193a3f600c604a314803f723d93" > parent< / a > ();< / div >
< div class = "line" > < a id = "l00125" name = "l00125" > < / a > < span class = "lineno" > 125< / span > node_to = node_to-> < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_node.html#a94edd193a3f600c604a314803f723d93" > parent< / a > ();< / div >
< div class = "line" > < a id = "l00126" name = "l00126" > < / a > < span class = "lineno" > 126< / span > }< / div >
< div class = "line" > < a id = "l00127" name = "l00127" > < / a > < span class = "lineno" > 127< / span > via_ = node_from;< / div >
< div class = "line" > < a id = "l00128" name = "l00128" > < / a > < span class = "lineno" > 128< / span > }< / div >
< div class = "line" > < a id = "l00129" name = "l00129" > < / a > < span class = "lineno" > 129< / span > < / div >
< div class = "line" > < a id = "l00130" name = "l00130" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_search_path.html#a09f219a2226f7c0de0f50b6f00c099e3" > 130< / a > < / span > < span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_search_node.html" > KnapsackSearchNode< / a > * < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_path.html#a09f219a2226f7c0de0f50b6f00c099e3" > KnapsackSearchPath::MoveUpToDepth< / a > (< / div >
< div class = "line" > < a id = "l00131" name = "l00131" > < / a > < span class = "lineno" > 131< / span > < span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_search_node.html" > KnapsackSearchNode< / a > & node, < span class = "keywordtype" > int< / span > depth)< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a id = "l00132" name = "l00132" > < / a > < span class = "lineno" > 132< / span > < span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_search_node.html" > KnapsackSearchNode< / a > * current_node = & node;< / div >
< div class = "line" > < a id = "l00133" name = "l00133" > < / a > < span class = "lineno" > 133< / span > < span class = "keywordflow" > while< / span > (current_node-> < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_node.html#a6fdd73f8011695b97659f2bea29325cb" > depth< / a > () > depth) {< / div >
< div class = "line" > < a id = "l00134" name = "l00134" > < / a > < span class = "lineno" > 134< / span > current_node = current_node-> < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_node.html#a94edd193a3f600c604a314803f723d93" > parent< / a > ();< / div >
< div class = "line" > < a id = "l00135" name = "l00135" > < / a > < span class = "lineno" > 135< / span > }< / div >
< div class = "line" > < a id = "l00136" name = "l00136" > < / a > < span class = "lineno" > 136< / span > < span class = "keywordflow" > return< / span > current_node;< / div >
< div class = "line" > < a id = "l00137" name = "l00137" > < / a > < span class = "lineno" > 137< / span > }< / div >
< div class = "line" > < a id = "l00138" name = "l00138" > < / a > < span class = "lineno" > 138< / span > < / div >
< div class = "line" > < a id = "l00139" name = "l00139" > < / a > < span class = "lineno" > 139< / span > < span class = "comment" > // ----- KnapsackState -----< / span > < / div >
< div class = "line" > < a id = "l00140" name = "l00140" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_state.html#a41f9430cc0090383e7797a88c1dbacbc" > 140< / a > < / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_state.html#a41f9430cc0090383e7797a88c1dbacbc" > KnapsackState::KnapsackState< / a > () : is_bound_(), is_in_() {}< / div >
< div class = "line" > < a id = "l00141" name = "l00141" > < / a > < span class = "lineno" > 141< / span > < / div >
< div class = "line" > < a id = "l00142" name = "l00142" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_state.html#a6308c7a97200f84f6ebf5b2c487b0362" > 142< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_state.html#a6308c7a97200f84f6ebf5b2c487b0362" > KnapsackState::Init< / a > (< span class = "keywordtype" > int< / span > number_of_items) {< / div >
< div class = "line" > < a id = "l00143" name = "l00143" > < / a > < span class = "lineno" > 143< / span > is_bound_.assign(number_of_items, < span class = "keyword" > false< / span > );< / div >
< div class = "line" > < a id = "l00144" name = "l00144" > < / a > < span class = "lineno" > 144< / span > is_in_.assign(number_of_items, < span class = "keyword" > false< / span > );< / div >
< div class = "line" > < a id = "l00145" name = "l00145" > < / a > < span class = "lineno" > 145< / span > }< / div >
< div class = "line" > < a id = "l00146" name = "l00146" > < / a > < span class = "lineno" > 146< / span > < / div >
< div class = "line" > < a id = "l00147" name = "l00147" > < / a > < span class = "lineno" > 147< / span > < span class = "comment" > // Returns false when the state is invalid.< / span > < / div >
< div class = "line" > < a id = "l00148" name = "l00148" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_state.html#ab771ac0e538f991b73b011ee3ba11f05" > 148< / a > < / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_state.html#ab771ac0e538f991b73b011ee3ba11f05" > KnapsackState::UpdateState< / a > (< span class = "keywordtype" > bool< / span > revert,< / div >
< div class = "line" > < a id = "l00149" name = "l00149" > < / a > < span class = "lineno" > 149< / span > < span class = "keyword" > const< / span > < a class = "code hl_struct" href = "structoperations__research_1_1_knapsack_assignment.html" > KnapsackAssignment< / a > & assignment) {< / div >
< div class = "line" > < a id = "l00150" name = "l00150" > < / a > < span class = "lineno" > 150< / span > < span class = "keywordflow" > if< / span > (revert) {< / div >
< div class = "line" > < a id = "l00151" name = "l00151" > < / a > < span class = "lineno" > 151< / span > is_bound_[assignment.< a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32" > item_id< / a > ] = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a id = "l00152" name = "l00152" > < / a > < span class = "lineno" > 152< / span > } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a id = "l00153" name = "l00153" > < / a > < span class = "lineno" > 153< / span > < span class = "keywordflow" > if< / span > (is_bound_[assignment.< a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32" > item_id< / a > ] & & < / div >
< div class = "line" > < a id = "l00154" name = "l00154" > < / a > < span class = "lineno" > 154< / span > is_in_[assignment.< a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32" > item_id< / a > ] != assignment.< a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_assignment.html#a922620900c7a18d22de686d47e25d4ed" > is_in< / a > ) {< / div >
< div class = "line" > < a id = "l00155" name = "l00155" > < / a > < span class = "lineno" > 155< / span > < span class = "keywordflow" > return< / span > < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a id = "l00156" name = "l00156" > < / a > < span class = "lineno" > 156< / span > }< / div >
< div class = "line" > < a id = "l00157" name = "l00157" > < / a > < span class = "lineno" > 157< / span > is_bound_[assignment.< a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32" > item_id< / a > ] = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l00158" name = "l00158" > < / a > < span class = "lineno" > 158< / span > is_in_[assignment.< a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32" > item_id< / a > ] = assignment.< a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_assignment.html#a922620900c7a18d22de686d47e25d4ed" > is_in< / a > ;< / div >
< div class = "line" > < a id = "l00159" name = "l00159" > < / a > < span class = "lineno" > 159< / span > }< / div >
< div class = "line" > < a id = "l00160" name = "l00160" > < / a > < span class = "lineno" > 160< / span > < span class = "keywordflow" > return< / span > < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l00161" name = "l00161" > < / a > < span class = "lineno" > 161< / span > }< / div >
< div class = "line" > < a id = "l00162" name = "l00162" > < / a > < span class = "lineno" > 162< / span > < / div >
< div class = "line" > < a id = "l00163" name = "l00163" > < / a > < span class = "lineno" > 163< / span > < span class = "comment" > // ----- KnapsackPropagator -----< / span > < / div >
< div class = "line" > < a id = "l00164" name = "l00164" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_propagator.html#af28391017c090a638200c57b4c8a2ac1" > 164< / a > < / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#af28391017c090a638200c57b4c8a2ac1" > KnapsackPropagator::KnapsackPropagator< / a > (< span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_state.html" > KnapsackState< / a > & state)< / div >
< div class = "line" > < a id = "l00165" name = "l00165" > < / a > < span class = "lineno" > 165< / span > : items_(),< / div >
< div class = "line" > < a id = "l00166" name = "l00166" > < / a > < span class = "lineno" > 166< / span > current_profit_(0),< / div >
< div class = "line" > < a id = "l00167" name = "l00167" > < / a > < span class = "lineno" > 167< / span > profit_lower_bound_(0),< / div >
< div class = "line" > < a id = "l00168" name = "l00168" > < / a > < span class = "lineno" > 168< / span > profit_upper_bound_(< a class = "code hl_namespace" href = "namespacestd.html" > std< / a > ::numeric_limits< int64_t> ::< a class = "code hl_variable" href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > max< / a > ()),< / div >
< div class = "line" > < a id = "l00169" name = "l00169" > < / a > < span class = "lineno" > 169< / span > state_(state) {}< / div >
< div class = "line" > < a id = "l00170" name = "l00170" > < / a > < span class = "lineno" > 170< / span > < / div >
< div class = "line" > < a id = "l00171" name = "l00171" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_propagator.html#af15d878d664ee8a07cf3b710f8047cba" > 171< / a > < / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#af15d878d664ee8a07cf3b710f8047cba" > KnapsackPropagator::~KnapsackPropagator< / a > () { < a class = "code hl_function" href = "namespacegtl.html#a4ee3db0c4acaa0f277a0d7006f5ad1e6" > gtl::STLDeleteElements< / a > (& items_); }< / div >
< div class = "line" > < a id = "l00172" name = "l00172" > < / a > < span class = "lineno" > 172< / span > < / div >
< div class = "line" > < a id = "l00173" name = "l00173" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_propagator.html#a04d8883567a6e02787f2362e6543a21b" > 173< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#a04d8883567a6e02787f2362e6543a21b" > KnapsackPropagator::Init< / a > (< span class = "keyword" > const< / span > std::vector< int64_t> & profits,< / div >
< div class = "line" > < a id = "l00174" name = "l00174" > < / a > < span class = "lineno" > 174< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & weights) {< / div >
< div class = "line" > < a id = "l00175" name = "l00175" > < / a > < span class = "lineno" > 175< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > number_of_items = profits.size();< / div >
< div class = "line" > < a id = "l00176" name = "l00176" > < / a > < span class = "lineno" > 176< / span > items_.assign(number_of_items, < span class = "keyword" > static_cast< < / span > < a class = "code hl_struct" href = "structoperations__research_1_1_knapsack_item.html" > KnapsackItemPtr< / a > < span class = "keyword" > > < / span > (< span class = "keyword" > nullptr< / span > ));< / div >
< div class = "line" > < a id = "l00177" name = "l00177" > < / a > < span class = "lineno" > 177< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < number_of_items; ++i) {< / div >
< div class = "line" > < a id = "l00178" name = "l00178" > < / a > < span class = "lineno" > 178< / span > items_[i] = < span class = "keyword" > new< / span > < a class = "code hl_struct" href = "structoperations__research_1_1_knapsack_item.html" > KnapsackItem< / a > (i, weights[i], profits[i]);< / div >
< div class = "line" > < a id = "l00179" name = "l00179" > < / a > < span class = "lineno" > 179< / span > }< / div >
< div class = "line" > < a id = "l00180" name = "l00180" > < / a > < span class = "lineno" > 180< / span > current_profit_ = 0;< / div >
< div class = "line" > < a id = "l00181" name = "l00181" > < / a > < span class = "lineno" > 181< / span > profit_lower_bound_ = < a class = "code hl_variable" href = "alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045" > std::numeric_limits< int64_t> ::min< / a > ();< / div >
< div class = "line" > < a id = "l00182" name = "l00182" > < / a > < span class = "lineno" > 182< / span > profit_upper_bound_ = < a class = "code hl_variable" href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > std::numeric_limits< int64_t> ::max< / a > ();< / div >
< div class = "line" > < a id = "l00183" name = "l00183" > < / a > < span class = "lineno" > 183< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#a883cd053b1e7322727eb9e19940f69f6" > InitPropagator< / a > ();< / div >
< div class = "line" > < a id = "l00184" name = "l00184" > < / a > < span class = "lineno" > 184< / span > }< / div >
< div class = "line" > < a id = "l00185" name = "l00185" > < / a > < span class = "lineno" > 185< / span > < / div >
< div class = "line" > < a id = "l00186" name = "l00186" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_propagator.html#af4b38123d3654471f0868774c5ff877d" > 186< / a > < / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#af4b38123d3654471f0868774c5ff877d" > KnapsackPropagator::Update< / a > (< span class = "keywordtype" > bool< / span > revert,< / div >
< div class = "line" > < a id = "l00187" name = "l00187" > < / a > < span class = "lineno" > 187< / span > < span class = "keyword" > const< / span > < a class = "code hl_struct" href = "structoperations__research_1_1_knapsack_assignment.html" > KnapsackAssignment< / a > & assignment) {< / div >
< div class = "line" > < a id = "l00188" name = "l00188" > < / a > < span class = "lineno" > 188< / span > < span class = "keywordflow" > if< / span > (assignment.< a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_assignment.html#a922620900c7a18d22de686d47e25d4ed" > is_in< / a > ) {< / div >
< div class = "line" > < a id = "l00189" name = "l00189" > < / a > < span class = "lineno" > 189< / span > < span class = "keywordflow" > if< / span > (revert) {< / div >
< div class = "line" > < a id = "l00190" name = "l00190" > < / a > < span class = "lineno" > 190< / span > current_profit_ -= items_[assignment.< a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32" > item_id< / a > ]-> profit;< / div >
< div class = "line" > < a id = "l00191" name = "l00191" > < / a > < span class = "lineno" > 191< / span > } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a id = "l00192" name = "l00192" > < / a > < span class = "lineno" > 192< / span > current_profit_ += items_[assignment.< a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32" > item_id< / a > ]-> profit;< / div >
< div class = "line" > < a id = "l00193" name = "l00193" > < / a > < span class = "lineno" > 193< / span > }< / div >
< div class = "line" > < a id = "l00194" name = "l00194" > < / a > < span class = "lineno" > 194< / span > }< / div >
< div class = "line" > < a id = "l00195" name = "l00195" > < / a > < span class = "lineno" > 195< / span > < span class = "keywordflow" > return< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#a5a0d11be6f0d5b521477226fb7573db8" > UpdatePropagator< / a > (revert, assignment);< / div >
< div class = "line" > < a id = "l00196" name = "l00196" > < / a > < span class = "lineno" > 196< / span > }< / div >
< div class = "line" > < a id = "l00197" name = "l00197" > < / a > < span class = "lineno" > 197< / span > < / div >
< div class = "line" > < a id = "l00198" name = "l00198" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_propagator.html#a1fa45af1bf0d6aa9d5f86e2ed9ae5323" > 198< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#a1fa45af1bf0d6aa9d5f86e2ed9ae5323" > KnapsackPropagator::CopyCurrentStateToSolution< / a > (< / div >
< div class = "line" > < a id = "l00199" name = "l00199" > < / a > < span class = "lineno" > 199< / span > < span class = "keywordtype" > bool< / span > has_one_propagator, std::vector< bool> * solution)< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a id = "l00200" name = "l00200" > < / a > < span class = "lineno" > 200< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (solution != < span class = "keyword" > nullptr< / span > );< / div >
< div class = "line" > < a id = "l00201" name = "l00201" > < / a > < span class = "lineno" > 201< / span > < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < a class = "code hl_struct" href = "structoperations__research_1_1_knapsack_item.html" > KnapsackItem< / a > * < span class = "keyword" > const< / span > item : items_) {< / div >
< div class = "line" > < a id = "l00202" name = "l00202" > < / a > < span class = "lineno" > 202< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > item_id = item-> id;< / div >
< div class = "line" > < a id = "l00203" name = "l00203" > < / a > < span class = "lineno" > 203< / span > (*solution)[item_id] = state_.< a class = "code hl_function" href = "classoperations__research_1_1_knapsack_state.html#a89aa280d2321c1316aa1305106f1bb49" > is_bound< / a > (item_id) & & state_.< a class = "code hl_function" href = "classoperations__research_1_1_knapsack_state.html#a862bf4e908cd82ea44f72e98558016ad" > is_in< / a > (item_id);< / div >
< div class = "line" > < a id = "l00204" name = "l00204" > < / a > < span class = "lineno" > 204< / span > }< / div >
< div class = "line" > < a id = "l00205" name = "l00205" > < / a > < span class = "lineno" > 205< / span > < span class = "keywordflow" > if< / span > (has_one_propagator) {< / div >
< div class = "line" > < a id = "l00206" name = "l00206" > < / a > < span class = "lineno" > 206< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#ab803770e8e21bb448a2f3d940ab125f8" > CopyCurrentStateToSolutionPropagator< / a > (solution);< / div >
< div class = "line" > < a id = "l00207" name = "l00207" > < / a > < span class = "lineno" > 207< / span > }< / div >
< div class = "line" > < a id = "l00208" name = "l00208" > < / a > < span class = "lineno" > 208< / span > }< / div >
< div class = "line" > < a id = "l00209" name = "l00209" > < / a > < span class = "lineno" > 209< / span > < / div >
< div class = "line" > < a id = "l00210" name = "l00210" > < / a > < span class = "lineno" > 210< / span > < span class = "comment" > // ----- KnapsackCapacityPropagator -----< / span > < / div >
< div class = "line" > < a id = "l00211" name = "l00211" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_capacity_propagator.html#a2ce43dc07784f3d9634df0a5c0dc39b0" > 211< / a > < / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_capacity_propagator.html#a2ce43dc07784f3d9634df0a5c0dc39b0" > KnapsackCapacityPropagator::KnapsackCapacityPropagator< / a > (< / div >
< div class = "line" > < a id = "l00212" name = "l00212" > < / a > < span class = "lineno" > 212< / span > < span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_state.html" > KnapsackState< / a > & state, int64_t < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > )< / div >
< div class = "line" > < a id = "l00213" name = "l00213" > < / a > < span class = "lineno" > 213< / span > : < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_propagator.html" > KnapsackPropagator< / a > (state),< / div >
< div class = "line" > < a id = "l00214" name = "l00214" > < / a > < span class = "lineno" > 214< / span > capacity_(< a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > ),< / div >
< div class = "line" > < a id = "l00215" name = "l00215" > < / a > < span class = "lineno" > 215< / span > consumed_capacity_(0),< / div >
< div class = "line" > < a id = "l00216" name = "l00216" > < / a > < span class = "lineno" > 216< / span > break_item_id_(kNoSelection),< / div >
< div class = "line" > < a id = "l00217" name = "l00217" > < / a > < span class = "lineno" > 217< / span > sorted_items_(),< / div >
< div class = "line" > < a id = "l00218" name = "l00218" > < / a > < span class = "lineno" > 218< / span > profit_max_(0) {}< / div >
< div class = "line" > < a id = "l00219" name = "l00219" > < / a > < span class = "lineno" > 219< / span > < / div >
< div class = "line" > < a id = "l00220" name = "l00220" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_capacity_propagator.html#aa14e63156675c18c06073ac1cb8aa170" > 220< / a > < / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_capacity_propagator.html#aa14e63156675c18c06073ac1cb8aa170" > KnapsackCapacityPropagator::~KnapsackCapacityPropagator< / a > () {}< / div >
< div class = "line" > < a id = "l00221" name = "l00221" > < / a > < span class = "lineno" > 221< / span > < / div >
< div class = "line" > < a id = "l00222" name = "l00222" > < / a > < span class = "lineno" > 222< / span > < span class = "comment" > // TODO(user): Make it more incremental, by saving the break item in a< / span > < / div >
< div class = "line" > < a id = "l00223" name = "l00223" > < / a > < span class = "lineno" > 223< / span > < span class = "comment" > // search node for instance.< / span > < / div >
< div class = "line" > < a id = "l00224" name = "l00224" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_capacity_propagator.html#a9921c39ed90a9cd32301ee0fee9491cb" > 224< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_capacity_propagator.html#a9921c39ed90a9cd32301ee0fee9491cb" > KnapsackCapacityPropagator::ComputeProfitBounds< / a > () {< / div >
< div class = "line" > < a id = "l00225" name = "l00225" > < / a > < span class = "lineno" > 225< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#ae29226a5be6204e26f1d563a6630ab9e" > set_profit_lower_bound< / a > (< a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#a08beea2d857241d99287935a91be5217" > current_profit< / a > ());< / div >
< div class = "line" > < a id = "l00226" name = "l00226" > < / a > < span class = "lineno" > 226< / span > break_item_id_ = kNoSelection;< / div >
< div class = "line" > < a id = "l00227" name = "l00227" > < / a > < span class = "lineno" > 227< / span > < / div >
< div class = "line" > < a id = "l00228" name = "l00228" > < / a > < span class = "lineno" > 228< / span > int64_t remaining_capacity = capacity_ - consumed_capacity_;< / div >
< div class = "line" > < a id = "l00229" name = "l00229" > < / a > < span class = "lineno" > 229< / span > < span class = "keywordtype" > int< / span > break_sorted_item_id = kNoSelection;< / div >
< div class = "line" > < a id = "l00230" name = "l00230" > < / a > < span class = "lineno" > 230< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > number_of_sorted_items = sorted_items_.size();< / div >
< div class = "line" > < a id = "l00231" name = "l00231" > < / a > < span class = "lineno" > 231< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > sorted_id = 0; sorted_id < number_of_sorted_items; ++sorted_id) {< / div >
< div class = "line" > < a id = "l00232" name = "l00232" > < / a > < span class = "lineno" > 232< / span > < span class = "keyword" > const< / span > < a class = "code hl_struct" href = "structoperations__research_1_1_knapsack_item.html" > KnapsackItem< / a > * < span class = "keyword" > const< / span > item = sorted_items_[sorted_id];< / div >
< div class = "line" > < a id = "l00233" name = "l00233" > < / a > < span class = "lineno" > 233< / span > < span class = "keywordflow" > if< / span > (!< a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#afebda22d5e2e068671aa4dbfbe9024df" > state< / a > ().is_bound(item-> < a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_item.html#a64ae40793ade89d800a8c5646d2980fc" > id< / a > )) {< / div >
< div class = "line" > < a id = "l00234" name = "l00234" > < / a > < span class = "lineno" > 234< / span > break_item_id_ = item-> < a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_item.html#a64ae40793ade89d800a8c5646d2980fc" > id< / a > ;< / div >
< div class = "line" > < a id = "l00235" name = "l00235" > < / a > < span class = "lineno" > 235< / span > < / div >
< div class = "line" > < a id = "l00236" name = "l00236" > < / a > < span class = "lineno" > 236< / span > < span class = "keywordflow" > if< / span > (remaining_capacity > = item-> < a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_item.html#a523234416a08d890505d4b34fb0513ee" > weight< / a > ) {< / div >
< div class = "line" > < a id = "l00237" name = "l00237" > < / a > < span class = "lineno" > 237< / span > remaining_capacity -= item-> < a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_item.html#a523234416a08d890505d4b34fb0513ee" > weight< / a > ;< / div >
< div class = "line" > < a id = "l00238" name = "l00238" > < / a > < span class = "lineno" > 238< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#ae29226a5be6204e26f1d563a6630ab9e" > set_profit_lower_bound< / a > (< a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#ae04e419341e0b9772a057aff10ce63a0" > profit_lower_bound< / a > () + item-> < a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_item.html#a75dd99d0e31e3a347e5ebad01561e31d" > profit< / a > );< / div >
< div class = "line" > < a id = "l00239" name = "l00239" > < / a > < span class = "lineno" > 239< / span > } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a id = "l00240" name = "l00240" > < / a > < span class = "lineno" > 240< / span > break_sorted_item_id = sorted_id;< / div >
< div class = "line" > < a id = "l00241" name = "l00241" > < / a > < span class = "lineno" > 241< / span > < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a id = "l00242" name = "l00242" > < / a > < span class = "lineno" > 242< / span > }< / div >
< div class = "line" > < a id = "l00243" name = "l00243" > < / a > < span class = "lineno" > 243< / span > }< / div >
< div class = "line" > < a id = "l00244" name = "l00244" > < / a > < span class = "lineno" > 244< / span > }< / div >
< div class = "line" > < a id = "l00245" name = "l00245" > < / a > < span class = "lineno" > 245< / span > < / div >
< div class = "line" > < a id = "l00246" name = "l00246" > < / a > < span class = "lineno" > 246< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#af991b29f273c53c8b35cb09bcccf3a5d" > set_profit_upper_bound< / a > (< a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#ae04e419341e0b9772a057aff10ce63a0" > profit_lower_bound< / a > ());< / div >
< div class = "line" > < a id = "l00247" name = "l00247" > < / a > < span class = "lineno" > 247< / span > < / div >
< div class = "line" > < a id = "l00248" name = "l00248" > < / a > < span class = "lineno" > 248< / span > < span class = "keywordflow" > if< / span > (break_sorted_item_id != kNoSelection) {< / div >
< div class = "line" > < a id = "l00249" name = "l00249" > < / a > < span class = "lineno" > 249< / span > < span class = "keyword" > const< / span > int64_t additional_profit =< / div >
< div class = "line" > < a id = "l00250" name = "l00250" > < / a > < span class = "lineno" > 250< / span > GetAdditionalProfit(remaining_capacity, break_sorted_item_id);< / div >
< div class = "line" > < a id = "l00251" name = "l00251" > < / a > < span class = "lineno" > 251< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#af991b29f273c53c8b35cb09bcccf3a5d" > set_profit_upper_bound< / a > (< a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#aa68069fd1180cb37fcdbc99d6230bc3e" > profit_upper_bound< / a > () + additional_profit);< / div >
< div class = "line" > < a id = "l00252" name = "l00252" > < / a > < span class = "lineno" > 252< / span > }< / div >
< div class = "line" > < a id = "l00253" name = "l00253" > < / a > < span class = "lineno" > 253< / span > }< / div >
< div class = "line" > < a id = "l00254" name = "l00254" > < / a > < span class = "lineno" > 254< / span > < / div >
< div class = "line" > < a id = "l00255" name = "l00255" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_capacity_propagator.html#ae2545020be753ee6a66c277daac41784" > 255< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_capacity_propagator.html#ae2545020be753ee6a66c277daac41784" > KnapsackCapacityPropagator::InitPropagator< / a > () {< / div >
< div class = "line" > < a id = "l00256" name = "l00256" > < / a > < span class = "lineno" > 256< / span > consumed_capacity_ = 0;< / div >
< div class = "line" > < a id = "l00257" name = "l00257" > < / a > < span class = "lineno" > 257< / span > break_item_id_ = kNoSelection;< / div >
< div class = "line" > < a id = "l00258" name = "l00258" > < / a > < span class = "lineno" > 258< / span > sorted_items_ = < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#a701e8fc6dbf7ffeb4c48512ffa6d7501" > items< / a > ();< / div >
< div class = "line" > < a id = "l00259" name = "l00259" > < / a > < span class = "lineno" > 259< / span > profit_max_ = 0;< / div >
< div class = "line" > < a id = "l00260" name = "l00260" > < / a > < span class = "lineno" > 260< / span > < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < a class = "code hl_struct" href = "structoperations__research_1_1_knapsack_item.html" > KnapsackItem< / a > * < span class = "keyword" > const< / span > item : sorted_items_) {< / div >
< div class = "line" > < a id = "l00261" name = "l00261" > < / a > < span class = "lineno" > 261< / span > profit_max_ = < a class = "code hl_variable" href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > std::max< / a > (profit_max_, item-> profit);< / div >
< div class = "line" > < a id = "l00262" name = "l00262" > < / a > < span class = "lineno" > 262< / span > }< / div >
< div class = "line" > < a id = "l00263" name = "l00263" > < / a > < span class = "lineno" > 263< / span > ++profit_max_;< / div >
< div class = "line" > < a id = "l00264" name = "l00264" > < / a > < span class = "lineno" > 264< / span > CompareKnapsackItemsInDecreasingEfficiencyOrder compare_object(profit_max_);< / div >
< div class = "line" > < a id = "l00265" name = "l00265" > < / a > < span class = "lineno" > 265< / span > std::stable_sort(sorted_items_.begin(), sorted_items_.end(), compare_object);< / div >
< div class = "line" > < a id = "l00266" name = "l00266" > < / a > < span class = "lineno" > 266< / span > }< / div >
< div class = "line" > < a id = "l00267" name = "l00267" > < / a > < span class = "lineno" > 267< / span > < / div >
< div class = "line" > < a id = "l00268" name = "l00268" > < / a > < span class = "lineno" > 268< / span > < span class = "comment" > // Returns false when the propagator fails.< / span > < / div >
< div class = "line" > < a id = "l00269" name = "l00269" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_capacity_propagator.html#a3cde41b7fa0c9734783a562aadd9ef8c" > 269< / a > < / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_capacity_propagator.html#a3cde41b7fa0c9734783a562aadd9ef8c" > KnapsackCapacityPropagator::UpdatePropagator< / a > (< / div >
< div class = "line" > < a id = "l00270" name = "l00270" > < / a > < span class = "lineno" > 270< / span > < span class = "keywordtype" > bool< / span > revert, < span class = "keyword" > const< / span > < a class = "code hl_struct" href = "structoperations__research_1_1_knapsack_assignment.html" > KnapsackAssignment< / a > & assignment) {< / div >
< div class = "line" > < a id = "l00271" name = "l00271" > < / a > < span class = "lineno" > 271< / span > < span class = "keywordflow" > if< / span > (assignment.< a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_assignment.html#a922620900c7a18d22de686d47e25d4ed" > is_in< / a > ) {< / div >
< div class = "line" > < a id = "l00272" name = "l00272" > < / a > < span class = "lineno" > 272< / span > < span class = "keywordflow" > if< / span > (revert) {< / div >
< div class = "line" > < a id = "l00273" name = "l00273" > < / a > < span class = "lineno" > 273< / span > consumed_capacity_ -= < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#a701e8fc6dbf7ffeb4c48512ffa6d7501" > items< / a > ()[assignment.< a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32" > item_id< / a > ]-> weight;< / div >
< div class = "line" > < a id = "l00274" name = "l00274" > < / a > < span class = "lineno" > 274< / span > } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a id = "l00275" name = "l00275" > < / a > < span class = "lineno" > 275< / span > consumed_capacity_ += < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#a701e8fc6dbf7ffeb4c48512ffa6d7501" > items< / a > ()[assignment.< a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32" > item_id< / a > ]-> weight;< / div >
< div class = "line" > < a id = "l00276" name = "l00276" > < / a > < span class = "lineno" > 276< / span > < span class = "keywordflow" > if< / span > (consumed_capacity_ > capacity_) {< / div >
< div class = "line" > < a id = "l00277" name = "l00277" > < / a > < span class = "lineno" > 277< / span > < span class = "keywordflow" > return< / span > < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a id = "l00278" name = "l00278" > < / a > < span class = "lineno" > 278< / span > }< / div >
< div class = "line" > < a id = "l00279" name = "l00279" > < / a > < span class = "lineno" > 279< / span > }< / div >
< div class = "line" > < a id = "l00280" name = "l00280" > < / a > < span class = "lineno" > 280< / span > }< / div >
< div class = "line" > < a id = "l00281" name = "l00281" > < / a > < span class = "lineno" > 281< / span > < span class = "keywordflow" > return< / span > < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l00282" name = "l00282" > < / a > < span class = "lineno" > 282< / span > }< / div >
< div class = "line" > < a id = "l00283" name = "l00283" > < / a > < span class = "lineno" > 283< / span > < / div >
< div class = "line" > < a id = "l00284" name = "l00284" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_capacity_propagator.html#a706a3a7c9568016131afd718f347ec8d" > 284< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_capacity_propagator.html#a706a3a7c9568016131afd718f347ec8d" > KnapsackCapacityPropagator::CopyCurrentStateToSolutionPropagator< / a > (< / div >
< div class = "line" > < a id = "l00285" name = "l00285" > < / a > < span class = "lineno" > 285< / span > std::vector< bool> * solution)< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a id = "l00286" name = "l00286" > < / a > < span class = "lineno" > 286< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (solution != < span class = "keyword" > nullptr< / span > );< / div >
< div class = "line" > < a id = "l00287" name = "l00287" > < / a > < span class = "lineno" > 287< / span > int64_t remaining_capacity = capacity_ - consumed_capacity_;< / div >
< div class = "line" > < a id = "l00288" name = "l00288" > < / a > < span class = "lineno" > 288< / span > < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < a class = "code hl_struct" href = "structoperations__research_1_1_knapsack_item.html" > KnapsackItem< / a > * < span class = "keyword" > const< / span > item : sorted_items_) {< / div >
< div class = "line" > < a id = "l00289" name = "l00289" > < / a > < span class = "lineno" > 289< / span > < span class = "keywordflow" > if< / span > (!< a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#afebda22d5e2e068671aa4dbfbe9024df" > state< / a > ().is_bound(item-> id)) {< / div >
< div class = "line" > < a id = "l00290" name = "l00290" > < / a > < span class = "lineno" > 290< / span > < span class = "keywordflow" > if< / span > (remaining_capacity > = item-> weight) {< / div >
< div class = "line" > < a id = "l00291" name = "l00291" > < / a > < span class = "lineno" > 291< / span > remaining_capacity -= item-> weight;< / div >
< div class = "line" > < a id = "l00292" name = "l00292" > < / a > < span class = "lineno" > 292< / span > (*solution)[item-> id] = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l00293" name = "l00293" > < / a > < span class = "lineno" > 293< / span > } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a id = "l00294" name = "l00294" > < / a > < span class = "lineno" > 294< / span > < span class = "keywordflow" > return< / span > ;< / div >
< div class = "line" > < a id = "l00295" name = "l00295" > < / a > < span class = "lineno" > 295< / span > }< / div >
< div class = "line" > < a id = "l00296" name = "l00296" > < / a > < span class = "lineno" > 296< / span > }< / div >
< div class = "line" > < a id = "l00297" name = "l00297" > < / a > < span class = "lineno" > 297< / span > }< / div >
< div class = "line" > < a id = "l00298" name = "l00298" > < / a > < span class = "lineno" > 298< / span > }< / div >
< div class = "line" > < a id = "l00299" name = "l00299" > < / a > < span class = "lineno" > 299< / span > < / div >
< div class = "line" > < a id = "l00300" name = "l00300" > < / a > < span class = "lineno" > 300< / span > int64_t KnapsackCapacityPropagator::GetAdditionalProfit(< / div >
< div class = "line" > < a id = "l00301" name = "l00301" > < / a > < span class = "lineno" > 301< / span > int64_t remaining_capacity, < span class = "keywordtype" > int< / span > break_item_id)< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a id = "l00302" name = "l00302" > < / a > < span class = "lineno" > 302< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > after_break_item_id = break_item_id + 1;< / div >
< div class = "line" > < a id = "l00303" name = "l00303" > < / a > < span class = "lineno" > 303< / span > int64_t additional_profit_when_no_break_item = 0;< / div >
< div class = "line" > < a id = "l00304" name = "l00304" > < / a > < span class = "lineno" > 304< / span > < span class = "keywordflow" > if< / span > (after_break_item_id < sorted_items_.size()) {< / div >
< div class = "line" > < a id = "l00305" name = "l00305" > < / a > < span class = "lineno" > 305< / span > < span class = "comment" > // As items are sorted by decreasing profit / weight ratio, and the current< / span > < / div >
< div class = "line" > < a id = "l00306" name = "l00306" > < / a > < span class = "lineno" > 306< / span > < span class = "comment" > // weight is non-zero, the next_weight is non-zero too.< / span > < / div >
< div class = "line" > < a id = "l00307" name = "l00307" > < / a > < span class = "lineno" > 307< / span > < span class = "keyword" > const< / span > int64_t next_weight = sorted_items_[after_break_item_id]-> weight;< / div >
< div class = "line" > < a id = "l00308" name = "l00308" > < / a > < span class = "lineno" > 308< / span > < span class = "keyword" > const< / span > int64_t next_profit = sorted_items_[after_break_item_id]-> profit;< / div >
< div class = "line" > < a id = "l00309" name = "l00309" > < / a > < span class = "lineno" > 309< / span > additional_profit_when_no_break_item =< / div >
< div class = "line" > < a id = "l00310" name = "l00310" > < / a > < span class = "lineno" > 310< / span > UpperBoundOfRatio(remaining_capacity, next_profit, next_weight);< / div >
< div class = "line" > < a id = "l00311" name = "l00311" > < / a > < span class = "lineno" > 311< / span > }< / div >
< div class = "line" > < a id = "l00312" name = "l00312" > < / a > < span class = "lineno" > 312< / span > < / div >
< div class = "line" > < a id = "l00313" name = "l00313" > < / a > < span class = "lineno" > 313< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > before_break_item_id = break_item_id - 1;< / div >
< div class = "line" > < a id = "l00314" name = "l00314" > < / a > < span class = "lineno" > 314< / span > int64_t additional_profit_when_break_item = 0;< / div >
< div class = "line" > < a id = "l00315" name = "l00315" > < / a > < span class = "lineno" > 315< / span > < span class = "keywordflow" > if< / span > (before_break_item_id > = 0) {< / div >
< div class = "line" > < a id = "l00316" name = "l00316" > < / a > < span class = "lineno" > 316< / span > < span class = "keyword" > const< / span > int64_t previous_weight = sorted_items_[before_break_item_id]-> weight;< / div >
< div class = "line" > < a id = "l00317" name = "l00317" > < / a > < span class = "lineno" > 317< / span > < span class = "comment" > // Having previous_weight == 0 means the total capacity is smaller than< / span > < / div >
< div class = "line" > < a id = "l00318" name = "l00318" > < / a > < span class = "lineno" > 318< / span > < span class = "comment" > // the weight of the current item. In such a case the item cannot be part< / span > < / div >
< div class = "line" > < a id = "l00319" name = "l00319" > < / a > < span class = "lineno" > 319< / span > < span class = "comment" > // of a solution of the local one dimension problem.< / span > < / div >
< div class = "line" > < a id = "l00320" name = "l00320" > < / a > < span class = "lineno" > 320< / span > < span class = "keywordflow" > if< / span > (previous_weight != 0) {< / div >
< div class = "line" > < a id = "l00321" name = "l00321" > < / a > < span class = "lineno" > 321< / span > < span class = "keyword" > const< / span > int64_t previous_profit =< / div >
< div class = "line" > < a id = "l00322" name = "l00322" > < / a > < span class = "lineno" > 322< / span > sorted_items_[before_break_item_id]-> profit;< / div >
< div class = "line" > < a id = "l00323" name = "l00323" > < / a > < span class = "lineno" > 323< / span > < span class = "keyword" > const< / span > int64_t overused_capacity =< / div >
< div class = "line" > < a id = "l00324" name = "l00324" > < / a > < span class = "lineno" > 324< / span > sorted_items_[break_item_id]-> weight - remaining_capacity;< / div >
< div class = "line" > < a id = "l00325" name = "l00325" > < / a > < span class = "lineno" > 325< / span > < span class = "keyword" > const< / span > int64_t < a class = "code hl_variable" href = "revised__simplex_8cc.html#af01c50e388647c921aa7d9c77f2b72b2" > ratio< / a > = UpperBoundOfRatio(overused_capacity,< / div >
< div class = "line" > < a id = "l00326" name = "l00326" > < / a > < span class = "lineno" > 326< / span > previous_profit, previous_weight);< / div >
< div class = "line" > < a id = "l00327" name = "l00327" > < / a > < span class = "lineno" > 327< / span > additional_profit_when_break_item =< / div >
< div class = "line" > < a id = "l00328" name = "l00328" > < / a > < span class = "lineno" > 328< / span > sorted_items_[break_item_id]-> profit - < a class = "code hl_variable" href = "revised__simplex_8cc.html#af01c50e388647c921aa7d9c77f2b72b2" > ratio< / a > ;< / div >
< div class = "line" > < a id = "l00329" name = "l00329" > < / a > < span class = "lineno" > 329< / span > }< / div >
< div class = "line" > < a id = "l00330" name = "l00330" > < / a > < span class = "lineno" > 330< / span > }< / div >
< div class = "line" > < a id = "l00331" name = "l00331" > < / a > < span class = "lineno" > 331< / span > < / div >
< div class = "line" > < a id = "l00332" name = "l00332" > < / a > < span class = "lineno" > 332< / span > < span class = "keyword" > const< / span > int64_t additional_profit = < a class = "code hl_variable" href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > std::max< / a > (< / div >
< div class = "line" > < a id = "l00333" name = "l00333" > < / a > < span class = "lineno" > 333< / span > additional_profit_when_no_break_item, additional_profit_when_break_item);< / div >
< div class = "line" > < a id = "l00334" name = "l00334" > < / a > < span class = "lineno" > 334< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9" > CHECK_GE< / a > (additional_profit, 0);< / div >
< div class = "line" > < a id = "l00335" name = "l00335" > < / a > < span class = "lineno" > 335< / span > < span class = "keywordflow" > return< / span > additional_profit;< / div >
< div class = "line" > < a id = "l00336" name = "l00336" > < / a > < span class = "lineno" > 336< / span > }< / div >
< div class = "line" > < a id = "l00337" name = "l00337" > < / a > < span class = "lineno" > 337< / span > < / div >
< div class = "line" > < a id = "l00338" name = "l00338" > < / a > < span class = "lineno" > 338< / span > < span class = "comment" > // ----- KnapsackGenericSolver -----< / span > < / div >
< div class = "line" > < a id = "l00339" name = "l00339" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_generic_solver.html#a2a7bff5cf8a51192eadec54eb0499064" > 339< / a > < / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_generic_solver.html#a2a7bff5cf8a51192eadec54eb0499064" > KnapsackGenericSolver::KnapsackGenericSolver< / a > (< span class = "keyword" > const< / span > std::string& solver_name)< / div >
< div class = "line" > < a id = "l00340" name = "l00340" > < / a > < span class = "lineno" > 340< / span > : < a class = "code hl_class" href = "classoperations__research_1_1_base_knapsack_solver.html" > BaseKnapsackSolver< / a > (solver_name),< / div >
< div class = "line" > < a id = "l00341" name = "l00341" > < / a > < span class = "lineno" > 341< / span > propagators_(),< / div >
< div class = "line" > < a id = "l00342" name = "l00342" > < / a > < span class = "lineno" > 342< / span > master_propagator_id_(kMasterPropagatorId),< / div >
< div class = "line" > < a id = "l00343" name = "l00343" > < / a > < span class = "lineno" > 343< / span > search_nodes_(),< / div >
< div class = "line" > < a id = "l00344" name = "l00344" > < / a > < span class = "lineno" > 344< / span > state_(),< / div >
< div class = "line" > < a id = "l00345" name = "l00345" > < / a > < span class = "lineno" > 345< / span > best_solution_profit_(0),< / div >
< div class = "line" > < a id = "l00346" name = "l00346" > < / a > < span class = "lineno" > 346< / span > best_solution_() {}< / div >
< div class = "line" > < a id = "l00347" name = "l00347" > < / a > < span class = "lineno" > 347< / span > < / div >
< div class = "line" > < a id = "l00348" name = "l00348" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_generic_solver.html#a2a25594d97a0a532f9d814bdc6dea380" > 348< / a > < / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_generic_solver.html#a2a25594d97a0a532f9d814bdc6dea380" > KnapsackGenericSolver::~KnapsackGenericSolver< / a > () { Clear(); }< / div >
< div class = "line" > < a id = "l00349" name = "l00349" > < / a > < span class = "lineno" > 349< / span > < / div >
< div class = "line" > < a id = "l00350" name = "l00350" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_generic_solver.html#a734b6464309adbbdeb63ef759f690ff1" > 350< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_generic_solver.html#a734b6464309adbbdeb63ef759f690ff1" > KnapsackGenericSolver::Init< / a > (< / div >
< div class = "line" > < a id = "l00351" name = "l00351" > < / a > < span class = "lineno" > 351< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & profits,< / div >
< div class = "line" > < a id = "l00352" name = "l00352" > < / a > < span class = "lineno" > 352< / span > < span class = "keyword" > const< / span > std::vector< std::vector< int64_t> > & weights,< / div >
< div class = "line" > < a id = "l00353" name = "l00353" > < / a > < span class = "lineno" > 353< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & capacities) {< / div >
< div class = "line" > < a id = "l00354" name = "l00354" > < / a > < span class = "lineno" > 354< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (capacities.size(), weights.size());< / div >
< div class = "line" > < a id = "l00355" name = "l00355" > < / a > < span class = "lineno" > 355< / span > < / div >
< div class = "line" > < a id = "l00356" name = "l00356" > < / a > < span class = "lineno" > 356< / span > Clear();< / div >
< div class = "line" > < a id = "l00357" name = "l00357" > < / a > < span class = "lineno" > 357< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > number_of_items = profits.size();< / div >
< div class = "line" > < a id = "l00358" name = "l00358" > < / a > < span class = "lineno" > 358< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > number_of_dimensions = weights.size();< / div >
< div class = "line" > < a id = "l00359" name = "l00359" > < / a > < span class = "lineno" > 359< / span > state_.< a class = "code hl_function" href = "classoperations__research_1_1_knapsack_state.html#a6308c7a97200f84f6ebf5b2c487b0362" > Init< / a > (number_of_items);< / div >
< div class = "line" > < a id = "l00360" name = "l00360" > < / a > < span class = "lineno" > 360< / span > best_solution_.assign(number_of_items, < span class = "keyword" > false< / span > );< / div >
< div class = "line" > < a id = "l00361" name = "l00361" > < / a > < span class = "lineno" > 361< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < number_of_dimensions; ++i) {< / div >
< div class = "line" > < a id = "l00362" name = "l00362" > < / a > < span class = "lineno" > 362< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (number_of_items, weights[i].size());< / div >
< div class = "line" > < a id = "l00363" name = "l00363" > < / a > < span class = "lineno" > 363< / span > < / div >
< div class = "line" > < a id = "l00364" name = "l00364" > < / a > < span class = "lineno" > 364< / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_capacity_propagator.html" > KnapsackCapacityPropagator< / a > * propagator =< / div >
< div class = "line" > < a id = "l00365" name = "l00365" > < / a > < span class = "lineno" > 365< / span > < span class = "keyword" > new< / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_capacity_propagator.html" > KnapsackCapacityPropagator< / a > (state_, capacities[i]);< / div >
< div class = "line" > < a id = "l00366" name = "l00366" > < / a > < span class = "lineno" > 366< / span > propagator-> < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_propagator.html#a04d8883567a6e02787f2362e6543a21b" > Init< / a > (profits, weights[i]);< / div >
< div class = "line" > < a id = "l00367" name = "l00367" > < / a > < span class = "lineno" > 367< / span > propagators_.push_back(propagator);< / div >
< div class = "line" > < a id = "l00368" name = "l00368" > < / a > < span class = "lineno" > 368< / span > }< / div >
< div class = "line" > < a id = "l00369" name = "l00369" > < / a > < span class = "lineno" > 369< / span > master_propagator_id_ = kMasterPropagatorId;< / div >
< div class = "line" > < a id = "l00370" name = "l00370" > < / a > < span class = "lineno" > 370< / span > }< / div >
< div class = "line" > < a id = "l00371" name = "l00371" > < / a > < span class = "lineno" > 371< / span > < / div >
< div class = "line" > < a id = "l00372" name = "l00372" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_generic_solver.html#ac9849a7043959c65033fa6f4a63bb10e" > 372< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_generic_solver.html#ac9849a7043959c65033fa6f4a63bb10e" > KnapsackGenericSolver::GetLowerAndUpperBoundWhenItem< / a > (< / div >
< div class = "line" > < a id = "l00373" name = "l00373" > < / a > < span class = "lineno" > 373< / span > < span class = "keywordtype" > int< / span > item_id, < span class = "keywordtype" > bool< / span > is_item_in, int64_t* < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > , int64_t* < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > ) {< / div >
< div class = "line" > < a id = "l00374" name = "l00374" > < / a > < span class = "lineno" > 374< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > != < span class = "keyword" > nullptr< / span > );< / div >
< div class = "line" > < a id = "l00375" name = "l00375" > < / a > < span class = "lineno" > 375< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > != < span class = "keyword" > nullptr< / span > );< / div >
< div class = "line" > < a id = "l00376" name = "l00376" > < / a > < span class = "lineno" > 376< / span > < a class = "code hl_struct" href = "structoperations__research_1_1_knapsack_assignment.html" > KnapsackAssignment< / a > assignment(item_id, is_item_in);< / div >
< div class = "line" > < a id = "l00377" name = "l00377" > < / a > < span class = "lineno" > 377< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > bool< / span > fail = !IncrementalUpdate(< span class = "keyword" > false< / span > , assignment);< / div >
< div class = "line" > < a id = "l00378" name = "l00378" > < / a > < span class = "lineno" > 378< / span > < span class = "keywordflow" > if< / span > (fail) {< / div >
< div class = "line" > < a id = "l00379" name = "l00379" > < / a > < span class = "lineno" > 379< / span > *< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > = 0LL;< / div >
< div class = "line" > < a id = "l00380" name = "l00380" > < / a > < span class = "lineno" > 380< / span > *< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > = 0LL;< / div >
< div class = "line" > < a id = "l00381" name = "l00381" > < / a > < span class = "lineno" > 381< / span > } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a id = "l00382" name = "l00382" > < / a > < span class = "lineno" > 382< / span > *< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > =< / div >
< div class = "line" > < a id = "l00383" name = "l00383" > < / a > < span class = "lineno" > 383< / span > (HasOnePropagator())< / div >
< div class = "line" > < a id = "l00384" name = "l00384" > < / a > < span class = "lineno" > 384< / span > ? propagators_[master_propagator_id_]-> profit_lower_bound()< / div >
< div class = "line" > < a id = "l00385" name = "l00385" > < / a > < span class = "lineno" > 385< / span > : 0LL;< / div >
< div class = "line" > < a id = "l00386" name = "l00386" > < / a > < span class = "lineno" > 386< / span > *< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > = GetAggregatedProfitUpperBound();< / div >
< div class = "line" > < a id = "l00387" name = "l00387" > < / a > < span class = "lineno" > 387< / span > }< / div >
< div class = "line" > < a id = "l00388" name = "l00388" > < / a > < span class = "lineno" > 388< / span > < / div >
< div class = "line" > < a id = "l00389" name = "l00389" > < / a > < span class = "lineno" > 389< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > bool< / span > fail_revert = !IncrementalUpdate(< span class = "keyword" > true< / span > , assignment);< / div >
< div class = "line" > < a id = "l00390" name = "l00390" > < / a > < span class = "lineno" > 390< / span > < span class = "keywordflow" > if< / span > (fail_revert) {< / div >
< div class = "line" > < a id = "l00391" name = "l00391" > < / a > < span class = "lineno" > 391< / span > *< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > = 0LL;< / div >
< div class = "line" > < a id = "l00392" name = "l00392" > < / a > < span class = "lineno" > 392< / span > *< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > = 0LL;< / div >
< div class = "line" > < a id = "l00393" name = "l00393" > < / a > < span class = "lineno" > 393< / span > }< / div >
< div class = "line" > < a id = "l00394" name = "l00394" > < / a > < span class = "lineno" > 394< / span > }< / div >
< div class = "line" > < a id = "l00395" name = "l00395" > < / a > < span class = "lineno" > 395< / span > < / div >
< div class = "line" > < a id = "l00396" name = "l00396" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_generic_solver.html#a788a597dac89a082d3ed4994d654dec1" > 396< / a > < / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_generic_solver.html#a788a597dac89a082d3ed4994d654dec1" > KnapsackGenericSolver::Solve< / a > (< a class = "code hl_class" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > * < a class = "code hl_variable" href = "cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21" > time_limit< / a > ,< / div >
< div class = "line" > < a id = "l00397" name = "l00397" > < / a > < span class = "lineno" > 397< / span > < span class = "keywordtype" > bool< / span > * is_solution_optimal) {< / div >
< div class = "line" > < a id = "l00398" name = "l00398" > < / a > < span class = "lineno" > 398< / span > < a class = "code hl_define" href = "base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006" > DCHECK< / a > (< a class = "code hl_variable" href = "cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21" > time_limit< / a > != < span class = "keyword" > nullptr< / span > );< / div >
< div class = "line" > < a id = "l00399" name = "l00399" > < / a > < span class = "lineno" > 399< / span > < a class = "code hl_define" href = "base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006" > DCHECK< / a > (is_solution_optimal != < span class = "keyword" > nullptr< / span > );< / div >
< div class = "line" > < a id = "l00400" name = "l00400" > < / a > < span class = "lineno" > 400< / span > best_solution_profit_ = 0LL;< / div >
< div class = "line" > < a id = "l00401" name = "l00401" > < / a > < span class = "lineno" > 401< / span > *is_solution_optimal = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l00402" name = "l00402" > < / a > < span class = "lineno" > 402< / span > < / div >
< div class = "line" > < a id = "l00403" name = "l00403" > < / a > < span class = "lineno" > 403< / span > SearchQueue search_queue;< / div >
< div class = "line" > < a id = "l00404" name = "l00404" > < / a > < span class = "lineno" > 404< / span > < span class = "keyword" > const< / span > < a class = "code hl_struct" href = "structoperations__research_1_1_knapsack_assignment.html" > KnapsackAssignment< / a > assignment(kNoSelection, < span class = "keyword" > true< / span > );< / div >
< div class = "line" > < a id = "l00405" name = "l00405" > < / a > < span class = "lineno" > 405< / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_search_node.html" > KnapsackSearchNode< / a > * root_node = < span class = "keyword" > new< / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_search_node.html" > KnapsackSearchNode< / a > (< span class = "keyword" > nullptr< / span > , assignment);< / div >
< div class = "line" > < a id = "l00406" name = "l00406" > < / a > < span class = "lineno" > 406< / span > root_node-> < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_node.html#a48521e7b1a381bd3f3f452fa6e697bde" > set_current_profit< / a > (GetCurrentProfit());< / div >
< div class = "line" > < a id = "l00407" name = "l00407" > < / a > < span class = "lineno" > 407< / span > root_node-> < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_node.html#af991b29f273c53c8b35cb09bcccf3a5d" > set_profit_upper_bound< / a > (GetAggregatedProfitUpperBound());< / div >
< div class = "line" > < a id = "l00408" name = "l00408" > < / a > < span class = "lineno" > 408< / span > root_node-> < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_node.html#a9962698a737cd21789c77ff32bef0d98" > set_next_item_id< / a > (GetNextItemId());< / div >
< div class = "line" > < a id = "l00409" name = "l00409" > < / a > < span class = "lineno" > 409< / span > search_nodes_.push_back(root_node);< / div >
< div class = "line" > < a id = "l00410" name = "l00410" > < / a > < span class = "lineno" > 410< / span > < / div >
< div class = "line" > < a id = "l00411" name = "l00411" > < / a > < span class = "lineno" > 411< / span > < span class = "keywordflow" > if< / span > (MakeNewNode(*root_node, < span class = "keyword" > false< / span > )) {< / div >
< div class = "line" > < a id = "l00412" name = "l00412" > < / a > < span class = "lineno" > 412< / span > search_queue.push(search_nodes_.back());< / div >
< div class = "line" > < a id = "l00413" name = "l00413" > < / a > < span class = "lineno" > 413< / span > }< / div >
< div class = "line" > < a id = "l00414" name = "l00414" > < / a > < span class = "lineno" > 414< / span > < span class = "keywordflow" > if< / span > (MakeNewNode(*root_node, < span class = "keyword" > true< / span > )) {< / div >
< div class = "line" > < a id = "l00415" name = "l00415" > < / a > < span class = "lineno" > 415< / span > search_queue.push(search_nodes_.back());< / div >
< div class = "line" > < a id = "l00416" name = "l00416" > < / a > < span class = "lineno" > 416< / span > }< / div >
< div class = "line" > < a id = "l00417" name = "l00417" > < / a > < span class = "lineno" > 417< / span > < / div >
< div class = "line" > < a id = "l00418" name = "l00418" > < / a > < span class = "lineno" > 418< / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_search_node.html" > KnapsackSearchNode< / a > * current_node = root_node;< / div >
< div class = "line" > < a id = "l00419" name = "l00419" > < / a > < span class = "lineno" > 419< / span > < span class = "keywordflow" > while< / span > (!search_queue.empty() & & < / div >
< div class = "line" > < a id = "l00420" name = "l00420" > < / a > < span class = "lineno" > 420< / span > search_queue.top()-> profit_upper_bound() > best_solution_profit_) {< / div >
< div class = "line" > < a id = "l00421" name = "l00421" > < / a > < span class = "lineno" > 421< / span > < span class = "keywordflow" > if< / span > (< a class = "code hl_variable" href = "cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21" > time_limit< / a > -> LimitReached()) {< / div >
< div class = "line" > < a id = "l00422" name = "l00422" > < / a > < span class = "lineno" > 422< / span > *is_solution_optimal = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a id = "l00423" name = "l00423" > < / a > < span class = "lineno" > 423< / span > < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a id = "l00424" name = "l00424" > < / a > < span class = "lineno" > 424< / span > }< / div >
< div class = "line" > < a id = "l00425" name = "l00425" > < / a > < span class = "lineno" > 425< / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_search_node.html" > KnapsackSearchNode< / a > * < span class = "keyword" > const< / span > node = search_queue.top();< / div >
< div class = "line" > < a id = "l00426" name = "l00426" > < / a > < span class = "lineno" > 426< / span > search_queue.pop();< / div >
< div class = "line" > < a id = "l00427" name = "l00427" > < / a > < span class = "lineno" > 427< / span > < / div >
< div class = "line" > < a id = "l00428" name = "l00428" > < / a > < span class = "lineno" > 428< / span > < span class = "keywordflow" > if< / span > (node != current_node) {< / div >
< div class = "line" > < a id = "l00429" name = "l00429" > < / a > < span class = "lineno" > 429< / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_search_path.html" > KnapsackSearchPath< / a > path(*current_node, *node);< / div >
< div class = "line" > < a id = "l00430" name = "l00430" > < / a > < span class = "lineno" > 430< / span > path.< a class = "code hl_function" href = "classoperations__research_1_1_knapsack_search_path.html#a1e3b6d38df0786ccf7f938d60e386aae" > Init< / a > ();< / div >
< div class = "line" > < a id = "l00431" name = "l00431" > < / a > < span class = "lineno" > 431< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > bool< / span > no_fail = UpdatePropagators(path);< / div >
< div class = "line" > < a id = "l00432" name = "l00432" > < / a > < span class = "lineno" > 432< / span > current_node = node;< / div >
< div class = "line" > < a id = "l00433" name = "l00433" > < / a > < span class = "lineno" > 433< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (no_fail, < span class = "keyword" > true< / span > );< / div >
< div class = "line" > < a id = "l00434" name = "l00434" > < / a > < span class = "lineno" > 434< / span > }< / div >
< div class = "line" > < a id = "l00435" name = "l00435" > < / a > < span class = "lineno" > 435< / span > < / div >
< div class = "line" > < a id = "l00436" name = "l00436" > < / a > < span class = "lineno" > 436< / span > < span class = "keywordflow" > if< / span > (MakeNewNode(*node, < span class = "keyword" > false< / span > )) {< / div >
< div class = "line" > < a id = "l00437" name = "l00437" > < / a > < span class = "lineno" > 437< / span > search_queue.push(search_nodes_.back());< / div >
< div class = "line" > < a id = "l00438" name = "l00438" > < / a > < span class = "lineno" > 438< / span > }< / div >
< div class = "line" > < a id = "l00439" name = "l00439" > < / a > < span class = "lineno" > 439< / span > < span class = "keywordflow" > if< / span > (MakeNewNode(*node, < span class = "keyword" > true< / span > )) {< / div >
< div class = "line" > < a id = "l00440" name = "l00440" > < / a > < span class = "lineno" > 440< / span > search_queue.push(search_nodes_.back());< / div >
< div class = "line" > < a id = "l00441" name = "l00441" > < / a > < span class = "lineno" > 441< / span > }< / div >
< div class = "line" > < a id = "l00442" name = "l00442" > < / a > < span class = "lineno" > 442< / span > }< / div >
< div class = "line" > < a id = "l00443" name = "l00443" > < / a > < span class = "lineno" > 443< / span > < span class = "keywordflow" > return< / span > best_solution_profit_;< / div >
< div class = "line" > < a id = "l00444" name = "l00444" > < / a > < span class = "lineno" > 444< / span > }< / div >
< div class = "line" > < a id = "l00445" name = "l00445" > < / a > < span class = "lineno" > 445< / span > < / div >
< div class = "line" > < a id = "l00446" name = "l00446" > < / a > < span class = "lineno" > 446< / span > < span class = "keywordtype" > void< / span > KnapsackGenericSolver::Clear() {< / div >
< div class = "line" > < a id = "l00447" name = "l00447" > < / a > < span class = "lineno" > 447< / span > < a class = "code hl_function" href = "namespacegtl.html#a4ee3db0c4acaa0f277a0d7006f5ad1e6" > gtl::STLDeleteElements< / a > (& propagators_);< / div >
< div class = "line" > < a id = "l00448" name = "l00448" > < / a > < span class = "lineno" > 448< / span > < a class = "code hl_function" href = "namespacegtl.html#a4ee3db0c4acaa0f277a0d7006f5ad1e6" > gtl::STLDeleteElements< / a > (& search_nodes_);< / div >
< div class = "line" > < a id = "l00449" name = "l00449" > < / a > < span class = "lineno" > 449< / span > }< / div >
< div class = "line" > < a id = "l00450" name = "l00450" > < / a > < span class = "lineno" > 450< / span > < / div >
< div class = "line" > < a id = "l00451" name = "l00451" > < / a > < span class = "lineno" > 451< / span > < span class = "comment" > // Returns false when at least one propagator fails.< / span > < / div >
< div class = "line" > < a id = "l00452" name = "l00452" > < / a > < span class = "lineno" > 452< / span > < span class = "keywordtype" > bool< / span > KnapsackGenericSolver::UpdatePropagators(< span class = "keyword" > const< / span > KnapsackSearchPath& path) {< / div >
< div class = "line" > < a id = "l00453" name = "l00453" > < / a > < span class = "lineno" > 453< / span > < span class = "keywordtype" > bool< / span > no_fail = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l00454" name = "l00454" > < / a > < span class = "lineno" > 454< / span > < span class = "comment" > // Revert previous changes.< / span > < / div >
< div class = "line" > < a id = "l00455" name = "l00455" > < / a > < span class = "lineno" > 455< / span > < span class = "keyword" > const< / span > KnapsackSearchNode* node = & path.from();< / div >
< div class = "line" > < a id = "l00456" name = "l00456" > < / a > < span class = "lineno" > 456< / span > < span class = "keyword" > const< / span > KnapsackSearchNode* via = & path.via();< / div >
< div class = "line" > < a id = "l00457" name = "l00457" > < / a > < span class = "lineno" > 457< / span > < span class = "keywordflow" > while< / span > (node != via) {< / div >
< div class = "line" > < a id = "l00458" name = "l00458" > < / a > < span class = "lineno" > 458< / span > no_fail = IncrementalUpdate(< span class = "keyword" > true< / span > , node-> assignment()) & & no_fail;< / div >
< div class = "line" > < a id = "l00459" name = "l00459" > < / a > < span class = "lineno" > 459< / span > node = node-> parent();< / div >
< div class = "line" > < a id = "l00460" name = "l00460" > < / a > < span class = "lineno" > 460< / span > }< / div >
< div class = "line" > < a id = "l00461" name = "l00461" > < / a > < span class = "lineno" > 461< / span > < span class = "comment" > // Apply current changes.< / span > < / div >
< div class = "line" > < a id = "l00462" name = "l00462" > < / a > < span class = "lineno" > 462< / span > node = & path.to();< / div >
< div class = "line" > < a id = "l00463" name = "l00463" > < / a > < span class = "lineno" > 463< / span > < span class = "keywordflow" > while< / span > (node != via) {< / div >
< div class = "line" > < a id = "l00464" name = "l00464" > < / a > < span class = "lineno" > 464< / span > no_fail = IncrementalUpdate(< span class = "keyword" > false< / span > , node-> assignment()) & & no_fail;< / div >
< div class = "line" > < a id = "l00465" name = "l00465" > < / a > < span class = "lineno" > 465< / span > node = node-> parent();< / div >
< div class = "line" > < a id = "l00466" name = "l00466" > < / a > < span class = "lineno" > 466< / span > }< / div >
< div class = "line" > < a id = "l00467" name = "l00467" > < / a > < span class = "lineno" > 467< / span > < span class = "keywordflow" > return< / span > no_fail;< / div >
< div class = "line" > < a id = "l00468" name = "l00468" > < / a > < span class = "lineno" > 468< / span > }< / div >
< div class = "line" > < a id = "l00469" name = "l00469" > < / a > < span class = "lineno" > 469< / span > < / div >
< div class = "line" > < a id = "l00470" name = "l00470" > < / a > < span class = "lineno" > 470< / span > int64_t KnapsackGenericSolver::GetAggregatedProfitUpperBound()< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a id = "l00471" name = "l00471" > < / a > < span class = "lineno" > 471< / span > int64_t < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > = < a class = "code hl_variable" href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > std::numeric_limits< int64_t> ::max< / a > ();< / div >
< div class = "line" > < a id = "l00472" name = "l00472" > < / a > < span class = "lineno" > 472< / span > < span class = "keywordflow" > for< / span > (KnapsackPropagator* < span class = "keyword" > const< / span > prop : propagators_) {< / div >
< div class = "line" > < a id = "l00473" name = "l00473" > < / a > < span class = "lineno" > 473< / span > prop-> ComputeProfitBounds();< / div >
< div class = "line" > < a id = "l00474" name = "l00474" > < / a > < span class = "lineno" > 474< / span > < span class = "keyword" > const< / span > int64_t propagator_upper_bound = prop-> profit_upper_bound();< / div >
< div class = "line" > < a id = "l00475" name = "l00475" > < / a > < span class = "lineno" > 475< / span > < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > = < a class = "code hl_variable" href = "alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045" > std::min< / a > (< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > , propagator_upper_bound);< / div >
< div class = "line" > < a id = "l00476" name = "l00476" > < / a > < span class = "lineno" > 476< / span > }< / div >
< div class = "line" > < a id = "l00477" name = "l00477" > < / a > < span class = "lineno" > 477< / span > < span class = "keywordflow" > return< / span > < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > ;< / div >
< div class = "line" > < a id = "l00478" name = "l00478" > < / a > < span class = "lineno" > 478< / span > }< / div >
< div class = "line" > < a id = "l00479" name = "l00479" > < / a > < span class = "lineno" > 479< / span > < / div >
< div class = "line" > < a id = "l00480" name = "l00480" > < / a > < span class = "lineno" > 480< / span > < span class = "keywordtype" > bool< / span > KnapsackGenericSolver::MakeNewNode(< span class = "keyword" > const< / span > KnapsackSearchNode& node,< / div >
< div class = "line" > < a id = "l00481" name = "l00481" > < / a > < span class = "lineno" > 481< / span > < span class = "keywordtype" > bool< / span > is_in) {< / div >
< div class = "line" > < a id = "l00482" name = "l00482" > < / a > < span class = "lineno" > 482< / span > < span class = "keywordflow" > if< / span > (node.next_item_id() == kNoSelection) {< / div >
< div class = "line" > < a id = "l00483" name = "l00483" > < / a > < span class = "lineno" > 483< / span > < span class = "keywordflow" > return< / span > < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a id = "l00484" name = "l00484" > < / a > < span class = "lineno" > 484< / span > }< / div >
< div class = "line" > < a id = "l00485" name = "l00485" > < / a > < span class = "lineno" > 485< / span > KnapsackAssignment assignment(node.next_item_id(), is_in);< / div >
< div class = "line" > < a id = "l00486" name = "l00486" > < / a > < span class = "lineno" > 486< / span > KnapsackSearchNode new_node(& node, assignment);< / div >
< div class = "line" > < a id = "l00487" name = "l00487" > < / a > < span class = "lineno" > 487< / span > < / div >
< div class = "line" > < a id = "l00488" name = "l00488" > < / a > < span class = "lineno" > 488< / span > KnapsackSearchPath path(node, new_node);< / div >
< div class = "line" > < a id = "l00489" name = "l00489" > < / a > < span class = "lineno" > 489< / span > path.Init();< / div >
< div class = "line" > < a id = "l00490" name = "l00490" > < / a > < span class = "lineno" > 490< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > bool< / span > no_fail = UpdatePropagators(path);< / div >
< div class = "line" > < a id = "l00491" name = "l00491" > < / a > < span class = "lineno" > 491< / span > < span class = "keywordflow" > if< / span > (no_fail) {< / div >
< div class = "line" > < a id = "l00492" name = "l00492" > < / a > < span class = "lineno" > 492< / span > new_node.set_current_profit(GetCurrentProfit());< / div >
< div class = "line" > < a id = "l00493" name = "l00493" > < / a > < span class = "lineno" > 493< / span > new_node.set_profit_upper_bound(GetAggregatedProfitUpperBound());< / div >
< div class = "line" > < a id = "l00494" name = "l00494" > < / a > < span class = "lineno" > 494< / span > new_node.set_next_item_id(GetNextItemId());< / div >
< div class = "line" > < a id = "l00495" name = "l00495" > < / a > < span class = "lineno" > 495< / span > UpdateBestSolution();< / div >
< div class = "line" > < a id = "l00496" name = "l00496" > < / a > < span class = "lineno" > 496< / span > }< / div >
< div class = "line" > < a id = "l00497" name = "l00497" > < / a > < span class = "lineno" > 497< / span > < / div >
< div class = "line" > < a id = "l00498" name = "l00498" > < / a > < span class = "lineno" > 498< / span > < span class = "comment" > // Revert to be able to create another node from parent.< / span > < / div >
< div class = "line" > < a id = "l00499" name = "l00499" > < / a > < span class = "lineno" > 499< / span > KnapsackSearchPath revert_path(new_node, node);< / div >
< div class = "line" > < a id = "l00500" name = "l00500" > < / a > < span class = "lineno" > 500< / span > revert_path.Init();< / div >
< div class = "line" > < a id = "l00501" name = "l00501" > < / a > < span class = "lineno" > 501< / span > UpdatePropagators(revert_path);< / div >
< div class = "line" > < a id = "l00502" name = "l00502" > < / a > < span class = "lineno" > 502< / span > < / div >
< div class = "line" > < a id = "l00503" name = "l00503" > < / a > < span class = "lineno" > 503< / span > < span class = "keywordflow" > if< / span > (!no_fail || new_node.profit_upper_bound() < best_solution_profit_) {< / div >
< div class = "line" > < a id = "l00504" name = "l00504" > < / a > < span class = "lineno" > 504< / span > < span class = "keywordflow" > return< / span > < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a id = "l00505" name = "l00505" > < / a > < span class = "lineno" > 505< / span > }< / div >
< div class = "line" > < a id = "l00506" name = "l00506" > < / a > < span class = "lineno" > 506< / span > < / div >
< div class = "line" > < a id = "l00507" name = "l00507" > < / a > < span class = "lineno" > 507< / span > < span class = "comment" > // The node is relevant.< / span > < / div >
< div class = "line" > < a id = "l00508" name = "l00508" > < / a > < span class = "lineno" > 508< / span > KnapsackSearchNode* relevant_node = < span class = "keyword" > new< / span > KnapsackSearchNode(& node, assignment);< / div >
< div class = "line" > < a id = "l00509" name = "l00509" > < / a > < span class = "lineno" > 509< / span > relevant_node-> set_current_profit(new_node.current_profit());< / div >
< div class = "line" > < a id = "l00510" name = "l00510" > < / a > < span class = "lineno" > 510< / span > relevant_node-> set_profit_upper_bound(new_node.profit_upper_bound());< / div >
< div class = "line" > < a id = "l00511" name = "l00511" > < / a > < span class = "lineno" > 511< / span > relevant_node-> set_next_item_id(new_node.next_item_id());< / div >
< div class = "line" > < a id = "l00512" name = "l00512" > < / a > < span class = "lineno" > 512< / span > search_nodes_.push_back(relevant_node);< / div >
< div class = "line" > < a id = "l00513" name = "l00513" > < / a > < span class = "lineno" > 513< / span > < / div >
< div class = "line" > < a id = "l00514" name = "l00514" > < / a > < span class = "lineno" > 514< / span > < span class = "keywordflow" > return< / span > < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l00515" name = "l00515" > < / a > < span class = "lineno" > 515< / span > }< / div >
< div class = "line" > < a id = "l00516" name = "l00516" > < / a > < span class = "lineno" > 516< / span > < / div >
< div class = "line" > < a id = "l00517" name = "l00517" > < / a > < span class = "lineno" > 517< / span > < span class = "keywordtype" > bool< / span > KnapsackGenericSolver::IncrementalUpdate(< / div >
< div class = "line" > < a id = "l00518" name = "l00518" > < / a > < span class = "lineno" > 518< / span > < span class = "keywordtype" > bool< / span > revert, < span class = "keyword" > const< / span > KnapsackAssignment& assignment) {< / div >
< div class = "line" > < a id = "l00519" name = "l00519" > < / a > < span class = "lineno" > 519< / span > < span class = "comment" > // Do not stop on a failure: To be able to be incremental on the update,< / span > < / div >
< div class = "line" > < a id = "l00520" name = "l00520" > < / a > < span class = "lineno" > 520< / span > < span class = "comment" > // partial solution (state) and propagators must all be in the same state.< / span > < / div >
< div class = "line" > < a id = "l00521" name = "l00521" > < / a > < span class = "lineno" > 521< / span > < span class = "keywordtype" > bool< / span > no_fail = state_.< a class = "code hl_function" href = "classoperations__research_1_1_knapsack_state.html#ab771ac0e538f991b73b011ee3ba11f05" > UpdateState< / a > (revert, assignment);< / div >
< div class = "line" > < a id = "l00522" name = "l00522" > < / a > < span class = "lineno" > 522< / span > < span class = "keywordflow" > for< / span > (KnapsackPropagator* < span class = "keyword" > const< / span > prop : propagators_) {< / div >
< div class = "line" > < a id = "l00523" name = "l00523" > < / a > < span class = "lineno" > 523< / span > no_fail = prop-> Update(revert, assignment) & & no_fail;< / div >
< div class = "line" > < a id = "l00524" name = "l00524" > < / a > < span class = "lineno" > 524< / span > }< / div >
< div class = "line" > < a id = "l00525" name = "l00525" > < / a > < span class = "lineno" > 525< / span > < span class = "keywordflow" > return< / span > no_fail;< / div >
< div class = "line" > < a id = "l00526" name = "l00526" > < / a > < span class = "lineno" > 526< / span > }< / div >
< div class = "line" > < a id = "l00527" name = "l00527" > < / a > < span class = "lineno" > 527< / span > < / div >
< div class = "line" > < a id = "l00528" name = "l00528" > < / a > < span class = "lineno" > 528< / span > < span class = "keywordtype" > void< / span > KnapsackGenericSolver::UpdateBestSolution() {< / div >
< div class = "line" > < a id = "l00529" name = "l00529" > < / a > < span class = "lineno" > 529< / span > < span class = "keyword" > const< / span > int64_t profit_lower_bound =< / div >
< div class = "line" > < a id = "l00530" name = "l00530" > < / a > < span class = "lineno" > 530< / span > (HasOnePropagator())< / div >
< div class = "line" > < a id = "l00531" name = "l00531" > < / a > < span class = "lineno" > 531< / span > ? propagators_[master_propagator_id_]-> profit_lower_bound()< / div >
< div class = "line" > < a id = "l00532" name = "l00532" > < / a > < span class = "lineno" > 532< / span > : propagators_[master_propagator_id_]-> current_profit();< / div >
< div class = "line" > < a id = "l00533" name = "l00533" > < / a > < span class = "lineno" > 533< / span > < / div >
< div class = "line" > < a id = "l00534" name = "l00534" > < / a > < span class = "lineno" > 534< / span > < span class = "keywordflow" > if< / span > (best_solution_profit_ < profit_lower_bound) {< / div >
< div class = "line" > < a id = "l00535" name = "l00535" > < / a > < span class = "lineno" > 535< / span > best_solution_profit_ = profit_lower_bound;< / div >
< div class = "line" > < a id = "l00536" name = "l00536" > < / a > < span class = "lineno" > 536< / span > propagators_[master_propagator_id_]-> CopyCurrentStateToSolution(< / div >
< div class = "line" > < a id = "l00537" name = "l00537" > < / a > < span class = "lineno" > 537< / span > HasOnePropagator(), & best_solution_);< / div >
< div class = "line" > < a id = "l00538" name = "l00538" > < / a > < span class = "lineno" > 538< / span > }< / div >
< div class = "line" > < a id = "l00539" name = "l00539" > < / a > < span class = "lineno" > 539< / span > }< / div >
< div class = "line" > < a id = "l00540" name = "l00540" > < / a > < span class = "lineno" > 540< / span > < / div >
< div class = "line" > < a id = "l00541" name = "l00541" > < / a > < span class = "lineno" > 541< / span > < span class = "comment" > // ----- KnapsackBruteForceSolver -----< / span > < / div >
< div class = "line" > < a id = "l00542" name = "l00542" > < / a > < span class = "lineno" > 542< / span > < span class = "comment" > // KnapsackBruteForceSolver solves the 0-1 knapsack problem when the number of< / span > < / div >
< div class = "line" > < a id = "l00543" name = "l00543" > < / a > < span class = "lineno" > 543< / span > < span class = "comment" > // items is less or equal to 30 with brute force, ie. explores all states.< / span > < / div >
< div class = "line" > < a id = "l00544" name = "l00544" > < / a > < span class = "lineno" > 544< / span > < span class = "comment" > // Experiments show better results than KnapsackGenericSolver when the< / span > < / div >
< div class = "line" > < a id = "l00545" name = "l00545" > < / a > < span class = "lineno" > 545< / span > < span class = "comment" > // number of items is less than 15.< / span > < / div >
< div class = "line" > < a id = "l00546" name = "l00546" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_brute_force_solver.html" > 546< / a > < / span > < span class = "keyword" > class < / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_brute_force_solver.html" > KnapsackBruteForceSolver< / a > : < span class = "keyword" > public< / span > < a class = "code hl_class" href = "classoperations__research_1_1_base_knapsack_solver.html" > BaseKnapsackSolver< / a > {< / div >
< div class = "line" > < a id = "l00547" name = "l00547" > < / a > < span class = "lineno" > 547< / span > < span class = "keyword" > public< / span > :< / div >
< div class = "line" > < a id = "l00548" name = "l00548" > < / a > < span class = "lineno" > 548< / span > < span class = "keyword" > explicit< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_brute_force_solver.html#a4f9df2a0d826265d62cd86f04070d439" > KnapsackBruteForceSolver< / a > (< span class = "keyword" > const< / span > std::string& solver_name);< / div >
< div class = "line" > < a id = "l00549" name = "l00549" > < / a > < span class = "lineno" > 549< / span > < / div >
< div class = "line" > < a id = "l00550" name = "l00550" > < / a > < span class = "lineno" > 550< / span > < span class = "comment" > // Initializes the solver and enters the problem to be solved.< / span > < / div >
< div class = "line" > < a id = "l00551" name = "l00551" > < / a > < span class = "lineno" > 551< / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_brute_force_solver.html#a734b6464309adbbdeb63ef759f690ff1" > Init< / a > (< span class = "keyword" > const< / span > std::vector< int64_t> & profits,< / div >
< div class = "line" > < a id = "l00552" name = "l00552" > < / a > < span class = "lineno" > 552< / span > < span class = "keyword" > const< / span > std::vector< std::vector< int64_t> > & weights,< / div >
< div class = "line" > < a id = "l00553" name = "l00553" > < / a > < span class = "lineno" > 553< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & capacities) < span class = "keyword" > override< / span > ;< / div >
< div class = "line" > < a id = "l00554" name = "l00554" > < / a > < span class = "lineno" > 554< / span > < / div >
< div class = "line" > < a id = "l00555" name = "l00555" > < / a > < span class = "lineno" > 555< / span > < span class = "comment" > // Solves the problem and returns the profit of the optimal solution.< / span > < / div >
< div class = "line" > < a id = "l00556" name = "l00556" > < / a > < span class = "lineno" > 556< / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_brute_force_solver.html#a788a597dac89a082d3ed4994d654dec1" > Solve< / a > (< a class = "code hl_class" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > * < a class = "code hl_variable" href = "cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21" > time_limit< / a > , < span class = "keywordtype" > bool< / span > * is_solution_optimal) < span class = "keyword" > override< / span > ;< / div >
< div class = "line" > < a id = "l00557" name = "l00557" > < / a > < span class = "lineno" > 557< / span > < / div >
< div class = "line" > < a id = "l00558" name = "l00558" > < / a > < span class = "lineno" > 558< / span > < span class = "comment" > // Returns true if the item ' item_id' is packed in the optimal knapsack.< / span > < / div >
< div class = "line" > < a id = "l00559" name = "l00559" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_brute_force_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4" > 559< / a > < / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_brute_force_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4" > best_solution< / a > (< span class = "keywordtype" > int< / span > item_id)< span class = "keyword" > const override < / span > {< / div >
< div class = "line" > < a id = "l00560" name = "l00560" > < / a > < span class = "lineno" > 560< / span > < span class = "keywordflow" > return< / span > (best_solution_ & < a class = "code hl_function" href = "namespaceoperations__research.html#aa400cb586d3da8079abd2dfe15434c26" > OneBit32< / a > (item_id)) != 0U;< / div >
< div class = "line" > < a id = "l00561" name = "l00561" > < / a > < span class = "lineno" > 561< / span > }< / div >
< div class = "line" > < a id = "l00562" name = "l00562" > < / a > < span class = "lineno" > 562< / span > < / div >
< div class = "line" > < a id = "l00563" name = "l00563" > < / a > < span class = "lineno" > 563< / span > < span class = "keyword" > private< / span > :< / div >
< div class = "line" > < a id = "l00564" name = "l00564" > < / a > < span class = "lineno" > 564< / span > < span class = "keywordtype" > int< / span > num_items_;< / div >
< div class = "line" > < a id = "l00565" name = "l00565" > < / a > < span class = "lineno" > 565< / span > int64_t profits_weights_[kMaxNumberOfBruteForceItems * 2];< / div >
< div class = "line" > < a id = "l00566" name = "l00566" > < / a > < span class = "lineno" > 566< / span > int64_t capacity_;< / div >
< div class = "line" > < a id = "l00567" name = "l00567" > < / a > < span class = "lineno" > 567< / span > int64_t best_solution_profit_;< / div >
< div class = "line" > < a id = "l00568" name = "l00568" > < / a > < span class = "lineno" > 568< / span > uint32_t best_solution_;< / div >
< div class = "line" > < a id = "l00569" name = "l00569" > < / a > < span class = "lineno" > 569< / span > < / div >
< div class = "line" > < a id = "l00570" name = "l00570" > < / a > < span class = "lineno" > 570< / span > DISALLOW_COPY_AND_ASSIGN(< a class = "code hl_class" href = "classoperations__research_1_1_knapsack_brute_force_solver.html" > KnapsackBruteForceSolver< / a > );< / div >
< div class = "line" > < a id = "l00571" name = "l00571" > < / a > < span class = "lineno" > 571< / span > };< / div >
< div class = "line" > < a id = "l00572" name = "l00572" > < / a > < span class = "lineno" > 572< / span > < / div >
< div class = "line" > < a id = "l00573" name = "l00573" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_brute_force_solver.html#a4f9df2a0d826265d62cd86f04070d439" > 573< / a > < / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_brute_force_solver.html#a4f9df2a0d826265d62cd86f04070d439" > KnapsackBruteForceSolver::KnapsackBruteForceSolver< / a > (< / div >
< div class = "line" > < a id = "l00574" name = "l00574" > < / a > < span class = "lineno" > 574< / span > < span class = "keyword" > const< / span > std::string& solver_name)< / div >
< div class = "line" > < a id = "l00575" name = "l00575" > < / a > < span class = "lineno" > 575< / span > : < a class = "code hl_class" href = "classoperations__research_1_1_base_knapsack_solver.html" > BaseKnapsackSolver< / a > (solver_name),< / div >
< div class = "line" > < a id = "l00576" name = "l00576" > < / a > < span class = "lineno" > 576< / span > num_items_(0),< / div >
< div class = "line" > < a id = "l00577" name = "l00577" > < / a > < span class = "lineno" > 577< / span > capacity_(0LL),< / div >
< div class = "line" > < a id = "l00578" name = "l00578" > < / a > < span class = "lineno" > 578< / span > best_solution_profit_(0LL),< / div >
< div class = "line" > < a id = "l00579" name = "l00579" > < / a > < span class = "lineno" > 579< / span > best_solution_(0U) {}< / div >
< div class = "line" > < a id = "l00580" name = "l00580" > < / a > < span class = "lineno" > 580< / span > < / div >
< div class = "line" > < a id = "l00581" name = "l00581" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_brute_force_solver.html#a734b6464309adbbdeb63ef759f690ff1" > 581< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_brute_force_solver.html#a734b6464309adbbdeb63ef759f690ff1" > KnapsackBruteForceSolver::Init< / a > (< / div >
< div class = "line" > < a id = "l00582" name = "l00582" > < / a > < span class = "lineno" > 582< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & profits,< / div >
< div class = "line" > < a id = "l00583" name = "l00583" > < / a > < span class = "lineno" > 583< / span > < span class = "keyword" > const< / span > std::vector< std::vector< int64_t> > & weights,< / div >
< div class = "line" > < a id = "l00584" name = "l00584" > < / a > < span class = "lineno" > 584< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & capacities) {< / div >
< div class = "line" > < a id = "l00585" name = "l00585" > < / a > < span class = "lineno" > 585< / span > < span class = "comment" > // TODO(user): Implement multi-dimensional brute force solver.< / span > < / div >
< div class = "line" > < a id = "l00586" name = "l00586" > < / a > < span class = "lineno" > 586< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (weights.size(), 1)< / div >
< div class = "line" > < a id = "l00587" name = "l00587" > < / a > < span class = "lineno" > 587< / span > < < < span class = "stringliteral" > " Brute force solver only works with one dimension." < / span > ;< / div >
< div class = "line" > < a id = "l00588" name = "l00588" > < / a > < span class = "lineno" > 588< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (capacities.size(), weights.size());< / div >
< div class = "line" > < a id = "l00589" name = "l00589" > < / a > < span class = "lineno" > 589< / span > < / div >
< div class = "line" > < a id = "l00590" name = "l00590" > < / a > < span class = "lineno" > 590< / span > num_items_ = profits.size();< / div >
< div class = "line" > < a id = "l00591" name = "l00591" > < / a > < span class = "lineno" > 591< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (num_items_, weights.at(0).size());< / div >
< div class = "line" > < a id = "l00592" name = "l00592" > < / a > < span class = "lineno" > 592< / span > < a class = "code hl_define" href = "base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c" > CHECK_LE< / a > (num_items_, kMaxNumberOfBruteForceItems)< / div >
< div class = "line" > < a id = "l00593" name = "l00593" > < / a > < span class = "lineno" > 593< / span > < < < span class = "stringliteral" > " To use KnapsackBruteForceSolver the number of items should be " < / span > < / div >
< div class = "line" > < a id = "l00594" name = "l00594" > < / a > < span class = "lineno" > 594< / span > < < < span class = "stringliteral" > " less than " < / span > < < kMaxNumberOfBruteForceItems< / div >
< div class = "line" > < a id = "l00595" name = "l00595" > < / a > < span class = "lineno" > 595< / span > < < < span class = "stringliteral" > " . Current value: " < / span > < < num_items_ < < < span class = "stringliteral" > " ." < / span > ;< / div >
< div class = "line" > < a id = "l00596" name = "l00596" > < / a > < span class = "lineno" > 596< / span > < / div >
< div class = "line" > < a id = "l00597" name = "l00597" > < / a > < span class = "lineno" > 597< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < num_items_; ++i) {< / div >
< div class = "line" > < a id = "l00598" name = "l00598" > < / a > < span class = "lineno" > 598< / span > profits_weights_[i * 2] = profits.at(i);< / div >
< div class = "line" > < a id = "l00599" name = "l00599" > < / a > < span class = "lineno" > 599< / span > profits_weights_[i * 2 + 1] = weights.at(0).at(i);< / div >
< div class = "line" > < a id = "l00600" name = "l00600" > < / a > < span class = "lineno" > 600< / span > }< / div >
< div class = "line" > < a id = "l00601" name = "l00601" > < / a > < span class = "lineno" > 601< / span > capacity_ = capacities.at(0);< / div >
< div class = "line" > < a id = "l00602" name = "l00602" > < / a > < span class = "lineno" > 602< / span > }< / div >
< div class = "line" > < a id = "l00603" name = "l00603" > < / a > < span class = "lineno" > 603< / span > < / div >
< div class = "line" > < a id = "l00604" name = "l00604" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_brute_force_solver.html#a788a597dac89a082d3ed4994d654dec1" > 604< / a > < / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_brute_force_solver.html#a788a597dac89a082d3ed4994d654dec1" > KnapsackBruteForceSolver::Solve< / a > (< a class = "code hl_class" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > * < a class = "code hl_variable" href = "cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21" > time_limit< / a > ,< / div >
< div class = "line" > < a id = "l00605" name = "l00605" > < / a > < span class = "lineno" > 605< / span > < span class = "keywordtype" > bool< / span > * is_solution_optimal) {< / div >
< div class = "line" > < a id = "l00606" name = "l00606" > < / a > < span class = "lineno" > 606< / span > < a class = "code hl_define" href = "base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006" > DCHECK< / a > (is_solution_optimal != < span class = "keyword" > nullptr< / span > );< / div >
< div class = "line" > < a id = "l00607" name = "l00607" > < / a > < span class = "lineno" > 607< / span > *is_solution_optimal = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l00608" name = "l00608" > < / a > < span class = "lineno" > 608< / span > best_solution_profit_ = 0LL;< / div >
< div class = "line" > < a id = "l00609" name = "l00609" > < / a > < span class = "lineno" > 609< / span > best_solution_ = 0U;< / div >
< div class = "line" > < a id = "l00610" name = "l00610" > < / a > < span class = "lineno" > 610< / span > < / div >
< div class = "line" > < a id = "l00611" name = "l00611" > < / a > < span class = "lineno" > 611< / span > < span class = "keyword" > const< / span > uint32_t num_states = < a class = "code hl_function" href = "namespaceoperations__research.html#aa400cb586d3da8079abd2dfe15434c26" > OneBit32< / a > (num_items_);< / div >
< div class = "line" > < a id = "l00612" name = "l00612" > < / a > < span class = "lineno" > 612< / span > uint32_t prev_state = 0U;< / div >
< div class = "line" > < a id = "l00613" name = "l00613" > < / a > < span class = "lineno" > 613< / span > uint64_t sum_profit = 0ULL;< / div >
< div class = "line" > < a id = "l00614" name = "l00614" > < / a > < span class = "lineno" > 614< / span > uint64_t sum_weight = 0ULL;< / div >
< div class = "line" > < a id = "l00615" name = "l00615" > < / a > < span class = "lineno" > 615< / span > uint32_t diff_state = 0U;< / div >
< div class = "line" > < a id = "l00616" name = "l00616" > < / a > < span class = "lineno" > 616< / span > uint32_t local_state = 0U;< / div >
< div class = "line" > < a id = "l00617" name = "l00617" > < / a > < span class = "lineno" > 617< / span > < span class = "keywordtype" > int< / span > item_id = 0;< / div >
< div class = "line" > < a id = "l00618" name = "l00618" > < / a > < span class = "lineno" > 618< / span > < span class = "comment" > // This loop starts at 1, because state = 0 was already considered previously,< / span > < / div >
< div class = "line" > < a id = "l00619" name = "l00619" > < / a > < span class = "lineno" > 619< / span > < span class = "comment" > // ie. when no items are in, sum_profit = 0.< / span > < / div >
< div class = "line" > < a id = "l00620" name = "l00620" > < / a > < span class = "lineno" > 620< / span > < span class = "keywordflow" > for< / span > (uint32_t state = 1U; state < num_states; ++state, ++prev_state) {< / div >
< div class = "line" > < a id = "l00621" name = "l00621" > < / a > < span class = "lineno" > 621< / span > diff_state = state ^ prev_state;< / div >
< div class = "line" > < a id = "l00622" name = "l00622" > < / a > < span class = "lineno" > 622< / span > local_state = state;< / div >
< div class = "line" > < a id = "l00623" name = "l00623" > < / a > < span class = "lineno" > 623< / span > item_id = 0;< / div >
< div class = "line" > < a id = "l00624" name = "l00624" > < / a > < span class = "lineno" > 624< / span > < span class = "keywordflow" > while< / span > (diff_state) {< / div >
< div class = "line" > < a id = "l00625" name = "l00625" > < / a > < span class = "lineno" > 625< / span > < span class = "keywordflow" > if< / span > (diff_state & 1U) { < span class = "comment" > // There is a diff.< / span > < / div >
< div class = "line" > < a id = "l00626" name = "l00626" > < / a > < span class = "lineno" > 626< / span > < span class = "keywordflow" > if< / span > (local_state & 1U) { < span class = "comment" > // This item is now in the knapsack.< / span > < / div >
< div class = "line" > < a id = "l00627" name = "l00627" > < / a > < span class = "lineno" > 627< / span > sum_profit += profits_weights_[item_id];< / div >
< div class = "line" > < a id = "l00628" name = "l00628" > < / a > < span class = "lineno" > 628< / span > sum_weight += profits_weights_[item_id + 1];< / div >
< div class = "line" > < a id = "l00629" name = "l00629" > < / a > < span class = "lineno" > 629< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82" > CHECK_LT< / a > (item_id + 1, 2 * num_items_);< / div >
< div class = "line" > < a id = "l00630" name = "l00630" > < / a > < span class = "lineno" > 630< / span > } < span class = "keywordflow" > else< / span > { < span class = "comment" > // This item has been removed of the knapsack.< / span > < / div >
< div class = "line" > < a id = "l00631" name = "l00631" > < / a > < span class = "lineno" > 631< / span > sum_profit -= profits_weights_[item_id];< / div >
< div class = "line" > < a id = "l00632" name = "l00632" > < / a > < span class = "lineno" > 632< / span > sum_weight -= profits_weights_[item_id + 1];< / div >
< div class = "line" > < a id = "l00633" name = "l00633" > < / a > < span class = "lineno" > 633< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82" > CHECK_LT< / a > (item_id + 1, 2 * num_items_);< / div >
< div class = "line" > < a id = "l00634" name = "l00634" > < / a > < span class = "lineno" > 634< / span > }< / div >
< div class = "line" > < a id = "l00635" name = "l00635" > < / a > < span class = "lineno" > 635< / span > }< / div >
< div class = "line" > < a id = "l00636" name = "l00636" > < / a > < span class = "lineno" > 636< / span > item_id += 2;< / div >
< div class = "line" > < a id = "l00637" name = "l00637" > < / a > < span class = "lineno" > 637< / span > local_state = local_state > > 1;< / div >
< div class = "line" > < a id = "l00638" name = "l00638" > < / a > < span class = "lineno" > 638< / span > diff_state = diff_state > > 1;< / div >
< div class = "line" > < a id = "l00639" name = "l00639" > < / a > < span class = "lineno" > 639< / span > }< / div >
< div class = "line" > < a id = "l00640" name = "l00640" > < / a > < span class = "lineno" > 640< / span > < / div >
< div class = "line" > < a id = "l00641" name = "l00641" > < / a > < span class = "lineno" > 641< / span > < span class = "keywordflow" > if< / span > (sum_weight < = capacity_ & & best_solution_profit_ < sum_profit) {< / div >
< div class = "line" > < a id = "l00642" name = "l00642" > < / a > < span class = "lineno" > 642< / span > best_solution_profit_ = sum_profit;< / div >
< div class = "line" > < a id = "l00643" name = "l00643" > < / a > < span class = "lineno" > 643< / span > best_solution_ = state;< / div >
< div class = "line" > < a id = "l00644" name = "l00644" > < / a > < span class = "lineno" > 644< / span > }< / div >
< div class = "line" > < a id = "l00645" name = "l00645" > < / a > < span class = "lineno" > 645< / span > }< / div >
< div class = "line" > < a id = "l00646" name = "l00646" > < / a > < span class = "lineno" > 646< / span > < / div >
< div class = "line" > < a id = "l00647" name = "l00647" > < / a > < span class = "lineno" > 647< / span > < span class = "keywordflow" > return< / span > best_solution_profit_;< / div >
< div class = "line" > < a id = "l00648" name = "l00648" > < / a > < span class = "lineno" > 648< / span > }< / div >
< div class = "line" > < a id = "l00649" name = "l00649" > < / a > < span class = "lineno" > 649< / span > < / div >
< div class = "line" > < a id = "l00650" name = "l00650" > < / a > < span class = "lineno" > 650< / span > < span class = "comment" > // ----- KnapsackItemWithEfficiency -----< / span > < / div >
< div class = "line" > < a id = "l00651" name = "l00651" > < / a > < span class = "lineno" > 651< / span > < span class = "comment" > // KnapsackItem is a small struct to pair an item weight with its< / span > < / div >
< div class = "line" > < a id = "l00652" name = "l00652" > < / a > < span class = "lineno" > 652< / span > < span class = "comment" > // corresponding profit.< / span > < / div >
< div class = "line" > < a id = "l00653" name = "l00653" > < / a > < span class = "lineno" > 653< / span > < span class = "comment" > // This struct is used by Knapsack64ItemsSolver. As this solver deals only< / span > < / div >
< div class = "line" > < a id = "l00654" name = "l00654" > < / a > < span class = "lineno" > 654< / span > < span class = "comment" > // with one dimension, that' s more efficient to store ' efficiency' than< / span > < / div >
< div class = "line" > < a id = "l00655" name = "l00655" > < / a > < span class = "lineno" > 655< / span > < span class = "comment" > // computing it on the fly.< / span > < / div >
< div class = "line" > < a id = "l00656" name = "l00656" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html" > 656< / a > < / span > < span class = "keyword" > struct < / span > < a class = "code hl_struct" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html" > KnapsackItemWithEfficiency< / a > {< / div >
< div class = "line" > < a id = "l00657" name = "l00657" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a6b3684e68faf736fcdb5cbbb2c652ec7" > 657< / a > < / span > < a class = "code hl_function" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a6b3684e68faf736fcdb5cbbb2c652ec7" > KnapsackItemWithEfficiency< / a > (< span class = "keywordtype" > int< / span > _id, int64_t _profit, int64_t _weight,< / div >
< div class = "line" > < a id = "l00658" name = "l00658" > < / a > < span class = "lineno" > 658< / span > int64_t _profit_max)< / div >
< div class = "line" > < a id = "l00659" name = "l00659" > < / a > < span class = "lineno" > 659< / span > : < a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a7441ef0865bcb3db9b8064dd7375c1ea" > id< / a > (_id),< / div >
< div class = "line" > < a id = "l00660" name = "l00660" > < / a > < span class = "lineno" > 660< / span > < a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#ac4db398e132b8e254cd485f4aac8d1bf" > profit< / a > (_profit),< / div >
< div class = "line" > < a id = "l00661" name = "l00661" > < / a > < span class = "lineno" > 661< / span > < a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > (_weight),< / div >
< div class = "line" > < a id = "l00662" name = "l00662" > < / a > < span class = "lineno" > 662< / span > < a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a036eb5930698269322fab01797c24255" > efficiency< / a > ((< a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > > 0) ? static_cast< double> (_profit) /< / div >
< div class = "line" > < a id = "l00663" name = "l00663" > < / a > < span class = "lineno" > 663< / span > static_cast< double> (_weight)< / div >
< div class = "line" > < a id = "l00664" name = "l00664" > < / a > < span class = "lineno" > 664< / span > : static_cast< double> (_profit_max)) {}< / div >
< div class = "line" > < a id = "l00665" name = "l00665" > < / a > < span class = "lineno" > 665< / span > < / div >
< div class = "line" > < a id = "l00666" name = "l00666" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a7441ef0865bcb3db9b8064dd7375c1ea" > 666< / a > < / span > < span class = "keywordtype" > int< / span > < a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a7441ef0865bcb3db9b8064dd7375c1ea" > id< / a > ;< / div >
< div class = "line" > < a id = "l00667" name = "l00667" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#ac4db398e132b8e254cd485f4aac8d1bf" > 667< / a > < / span > int64_t < a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#ac4db398e132b8e254cd485f4aac8d1bf" > profit< / a > ;< / div >
< div class = "line" > < a id = "l00668" name = "l00668" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a4255f714cea26cdd64f6a0ee72d34a8c" > 668< / a > < / span > int64_t < a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > ;< / div >
< div class = "line" > < a id = "l00669" name = "l00669" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a036eb5930698269322fab01797c24255" > 669< / a > < / span > < span class = "keywordtype" > double< / span > < a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a036eb5930698269322fab01797c24255" > efficiency< / a > ;< / div >
< div class = "line" > < a id = "l00670" name = "l00670" > < / a > < span class = "lineno" > 670< / span > };< / div >
< div class = "line" > < a id = "l00671" name = "l00671" > < / a > < span class = "lineno" > 671< / span > < / div >
< div class = "line" > < a id = "l00672" name = "l00672" > < / a > < span class = "lineno" > 672< / span > < span class = "comment" > // ----- Knapsack64ItemsSolver -----< / span > < / div >
< div class = "line" > < a id = "l00673" name = "l00673" > < / a > < span class = "lineno" > 673< / span > < span class = "comment" > // Knapsack64ItemsSolver solves the 0-1 knapsack problem when the number of< / span > < / div >
< div class = "line" > < a id = "l00674" name = "l00674" > < / a > < span class = "lineno" > 674< / span > < span class = "comment" > // items is less or equal to 64. This implementation is about 4 times faster< / span > < / div >
< div class = "line" > < a id = "l00675" name = "l00675" > < / a > < span class = "lineno" > 675< / span > < span class = "comment" > // than KnapsackGenericSolver.< / span > < / div >
< div class = "line" > < a id = "l00676" name = "l00676" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack64_items_solver.html" > 676< / a > < / span > < span class = "keyword" > class < / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack64_items_solver.html" > Knapsack64ItemsSolver< / a > : < span class = "keyword" > public< / span > < a class = "code hl_class" href = "classoperations__research_1_1_base_knapsack_solver.html" > BaseKnapsackSolver< / a > {< / div >
< div class = "line" > < a id = "l00677" name = "l00677" > < / a > < span class = "lineno" > 677< / span > < span class = "keyword" > public< / span > :< / div >
< div class = "line" > < a id = "l00678" name = "l00678" > < / a > < span class = "lineno" > 678< / span > < span class = "keyword" > explicit< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack64_items_solver.html#a6efbe15e2ab4e192b6af2fdcdda41ca2" > Knapsack64ItemsSolver< / a > (< span class = "keyword" > const< / span > std::string& solver_name);< / div >
< div class = "line" > < a id = "l00679" name = "l00679" > < / a > < span class = "lineno" > 679< / span > < / div >
< div class = "line" > < a id = "l00680" name = "l00680" > < / a > < span class = "lineno" > 680< / span > < span class = "comment" > // Initializes the solver and enters the problem to be solved.< / span > < / div >
< div class = "line" > < a id = "l00681" name = "l00681" > < / a > < span class = "lineno" > 681< / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack64_items_solver.html#a734b6464309adbbdeb63ef759f690ff1" > Init< / a > (< span class = "keyword" > const< / span > std::vector< int64_t> & profits,< / div >
< div class = "line" > < a id = "l00682" name = "l00682" > < / a > < span class = "lineno" > 682< / span > < span class = "keyword" > const< / span > std::vector< std::vector< int64_t> > & weights,< / div >
< div class = "line" > < a id = "l00683" name = "l00683" > < / a > < span class = "lineno" > 683< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & capacities) < span class = "keyword" > override< / span > ;< / div >
< div class = "line" > < a id = "l00684" name = "l00684" > < / a > < span class = "lineno" > 684< / span > < / div >
< div class = "line" > < a id = "l00685" name = "l00685" > < / a > < span class = "lineno" > 685< / span > < span class = "comment" > // Solves the problem and returns the profit of the optimal solution.< / span > < / div >
< div class = "line" > < a id = "l00686" name = "l00686" > < / a > < span class = "lineno" > 686< / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1_knapsack64_items_solver.html#a788a597dac89a082d3ed4994d654dec1" > Solve< / a > (< a class = "code hl_class" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > * < a class = "code hl_variable" href = "cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21" > time_limit< / a > , < span class = "keywordtype" > bool< / span > * is_solution_optimal) < span class = "keyword" > override< / span > ;< / div >
< div class = "line" > < a id = "l00687" name = "l00687" > < / a > < span class = "lineno" > 687< / span > < / div >
< div class = "line" > < a id = "l00688" name = "l00688" > < / a > < span class = "lineno" > 688< / span > < span class = "comment" > // Returns true if the item ' item_id' is packed in the optimal knapsack.< / span > < / div >
< div class = "line" > < a id = "l00689" name = "l00689" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack64_items_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4" > 689< / a > < / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack64_items_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4" > best_solution< / a > (< span class = "keywordtype" > int< / span > item_id)< span class = "keyword" > const override < / span > {< / div >
< div class = "line" > < a id = "l00690" name = "l00690" > < / a > < span class = "lineno" > 690< / span > < span class = "keywordflow" > return< / span > (best_solution_ & < a class = "code hl_function" href = "namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71" > OneBit64< / a > (item_id)) != 0ULL;< / div >
< div class = "line" > < a id = "l00691" name = "l00691" > < / a > < span class = "lineno" > 691< / span > }< / div >
< div class = "line" > < a id = "l00692" name = "l00692" > < / a > < span class = "lineno" > 692< / span > < / div >
< div class = "line" > < a id = "l00693" name = "l00693" > < / a > < span class = "lineno" > 693< / span > < span class = "keyword" > private< / span > :< / div >
< div class = "line" > < a id = "l00694" name = "l00694" > < / a > < span class = "lineno" > 694< / span > < span class = "keywordtype" > int< / span > GetBreakItemId(int64_t < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > ) < span class = "keyword" > const< / span > ;< / div >
< div class = "line" > < a id = "l00695" name = "l00695" > < / a > < span class = "lineno" > 695< / span > < span class = "keywordtype" > void< / span > GetLowerAndUpperBound(int64_t* < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > , int64_t* < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > ) < span class = "keyword" > const< / span > ;< / div >
< div class = "line" > < a id = "l00696" name = "l00696" > < / a > < span class = "lineno" > 696< / span > < span class = "keywordtype" > void< / span > GoToNextState(< span class = "keywordtype" > bool< / span > has_failed);< / div >
< div class = "line" > < a id = "l00697" name = "l00697" > < / a > < span class = "lineno" > 697< / span > < span class = "keywordtype" > void< / span > BuildBestSolution();< / div >
< div class = "line" > < a id = "l00698" name = "l00698" > < / a > < span class = "lineno" > 698< / span > < / div >
< div class = "line" > < a id = "l00699" name = "l00699" > < / a > < span class = "lineno" > 699< / span > std::vector< KnapsackItemWithEfficiency> sorted_items_;< / div >
< div class = "line" > < a id = "l00700" name = "l00700" > < / a > < span class = "lineno" > 700< / span > std::vector< int64_t> sum_profits_;< / div >
< div class = "line" > < a id = "l00701" name = "l00701" > < / a > < span class = "lineno" > 701< / span > std::vector< int64_t> sum_weights_;< / div >
< div class = "line" > < a id = "l00702" name = "l00702" > < / a > < span class = "lineno" > 702< / span > int64_t capacity_;< / div >
< div class = "line" > < a id = "l00703" name = "l00703" > < / a > < span class = "lineno" > 703< / span > uint64_t state_;< / div >
< div class = "line" > < a id = "l00704" name = "l00704" > < / a > < span class = "lineno" > 704< / span > < span class = "keywordtype" > int< / span > state_depth_;< / div >
< div class = "line" > < a id = "l00705" name = "l00705" > < / a > < span class = "lineno" > 705< / span > < / div >
< div class = "line" > < a id = "l00706" name = "l00706" > < / a > < span class = "lineno" > 706< / span > int64_t best_solution_profit_;< / div >
< div class = "line" > < a id = "l00707" name = "l00707" > < / a > < span class = "lineno" > 707< / span > uint64_t best_solution_;< / div >
< div class = "line" > < a id = "l00708" name = "l00708" > < / a > < span class = "lineno" > 708< / span > < span class = "keywordtype" > int< / span > best_solution_depth_;< / div >
< div class = "line" > < a id = "l00709" name = "l00709" > < / a > < span class = "lineno" > 709< / span > < / div >
< div class = "line" > < a id = "l00710" name = "l00710" > < / a > < span class = "lineno" > 710< / span > < span class = "comment" > // Sum of weights of included item in state.< / span > < / div >
< div class = "line" > < a id = "l00711" name = "l00711" > < / a > < span class = "lineno" > 711< / span > int64_t state_weight_;< / div >
< div class = "line" > < a id = "l00712" name = "l00712" > < / a > < span class = "lineno" > 712< / span > < span class = "comment" > // Sum of profits of non included items in state.< / span > < / div >
< div class = "line" > < a id = "l00713" name = "l00713" > < / a > < span class = "lineno" > 713< / span > int64_t rejected_items_profit_;< / div >
< div class = "line" > < a id = "l00714" name = "l00714" > < / a > < span class = "lineno" > 714< / span > < span class = "comment" > // Sum of weights of non included items in state.< / span > < / div >
< div class = "line" > < a id = "l00715" name = "l00715" > < / a > < span class = "lineno" > 715< / span > int64_t rejected_items_weight_;< / div >
< div class = "line" > < a id = "l00716" name = "l00716" > < / a > < span class = "lineno" > 716< / span > };< / div >
< div class = "line" > < a id = "l00717" name = "l00717" > < / a > < span class = "lineno" > 717< / span > < / div >
< div class = "line" > < a id = "l00718" name = "l00718" > < / a > < span class = "lineno" > 718< / span > < span class = "comment" > // Comparator used to sort item in decreasing efficiency order< / span > < / div >
< div class = "line" > < a id = "l00719" name = "l00719" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research.html#a627ab892a9c19c32b05c8f118e7660e0" > 719< / a > < / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "namespaceoperations__research.html#a627ab892a9c19c32b05c8f118e7660e0" > CompareKnapsackItemWithEfficiencyInDecreasingEfficiencyOrder< / a > (< / div >
< div class = "line" > < a id = "l00720" name = "l00720" > < / a > < span class = "lineno" > 720< / span > < span class = "keyword" > const< / span > < a class = "code hl_struct" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html" > KnapsackItemWithEfficiency< / a > & item1,< / div >
< div class = "line" > < a id = "l00721" name = "l00721" > < / a > < span class = "lineno" > 721< / span > < span class = "keyword" > const< / span > < a class = "code hl_struct" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html" > KnapsackItemWithEfficiency< / a > & item2) {< / div >
< div class = "line" > < a id = "l00722" name = "l00722" > < / a > < span class = "lineno" > 722< / span > < span class = "keywordflow" > return< / span > item1.< a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a036eb5930698269322fab01797c24255" > efficiency< / a > > item2.< a class = "code hl_variable" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a036eb5930698269322fab01797c24255" > efficiency< / a > ;< / div >
< div class = "line" > < a id = "l00723" name = "l00723" > < / a > < span class = "lineno" > 723< / span > }< / div >
< div class = "line" > < a id = "l00724" name = "l00724" > < / a > < span class = "lineno" > 724< / span > < / div >
< div class = "line" > < a id = "l00725" name = "l00725" > < / a > < span class = "lineno" > 725< / span > < span class = "comment" > // ----- Knapsack64ItemsSolver -----< / span > < / div >
< div class = "line" > < a id = "l00726" name = "l00726" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack64_items_solver.html#a6efbe15e2ab4e192b6af2fdcdda41ca2" > 726< / a > < / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack64_items_solver.html#a6efbe15e2ab4e192b6af2fdcdda41ca2" > Knapsack64ItemsSolver::Knapsack64ItemsSolver< / a > (< span class = "keyword" > const< / span > std::string& solver_name)< / div >
< div class = "line" > < a id = "l00727" name = "l00727" > < / a > < span class = "lineno" > 727< / span > : < a class = "code hl_class" href = "classoperations__research_1_1_base_knapsack_solver.html" > BaseKnapsackSolver< / a > (solver_name),< / div >
< div class = "line" > < a id = "l00728" name = "l00728" > < / a > < span class = "lineno" > 728< / span > sorted_items_(),< / div >
< div class = "line" > < a id = "l00729" name = "l00729" > < / a > < span class = "lineno" > 729< / span > sum_profits_(),< / div >
< div class = "line" > < a id = "l00730" name = "l00730" > < / a > < span class = "lineno" > 730< / span > sum_weights_(),< / div >
< div class = "line" > < a id = "l00731" name = "l00731" > < / a > < span class = "lineno" > 731< / span > capacity_(0LL),< / div >
< div class = "line" > < a id = "l00732" name = "l00732" > < / a > < span class = "lineno" > 732< / span > state_(0ULL),< / div >
< div class = "line" > < a id = "l00733" name = "l00733" > < / a > < span class = "lineno" > 733< / span > state_depth_(0),< / div >
< div class = "line" > < a id = "l00734" name = "l00734" > < / a > < span class = "lineno" > 734< / span > best_solution_profit_(0LL),< / div >
< div class = "line" > < a id = "l00735" name = "l00735" > < / a > < span class = "lineno" > 735< / span > best_solution_(0ULL),< / div >
< div class = "line" > < a id = "l00736" name = "l00736" > < / a > < span class = "lineno" > 736< / span > best_solution_depth_(0),< / div >
< div class = "line" > < a id = "l00737" name = "l00737" > < / a > < span class = "lineno" > 737< / span > state_weight_(0LL),< / div >
< div class = "line" > < a id = "l00738" name = "l00738" > < / a > < span class = "lineno" > 738< / span > rejected_items_profit_(0LL),< / div >
< div class = "line" > < a id = "l00739" name = "l00739" > < / a > < span class = "lineno" > 739< / span > rejected_items_weight_(0LL) {}< / div >
< div class = "line" > < a id = "l00740" name = "l00740" > < / a > < span class = "lineno" > 740< / span > < / div >
< div class = "line" > < a id = "l00741" name = "l00741" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack64_items_solver.html#a734b6464309adbbdeb63ef759f690ff1" > 741< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack64_items_solver.html#a734b6464309adbbdeb63ef759f690ff1" > Knapsack64ItemsSolver::Init< / a > (< / div >
< div class = "line" > < a id = "l00742" name = "l00742" > < / a > < span class = "lineno" > 742< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & profits,< / div >
< div class = "line" > < a id = "l00743" name = "l00743" > < / a > < span class = "lineno" > 743< / span > < span class = "keyword" > const< / span > std::vector< std::vector< int64_t> > & weights,< / div >
< div class = "line" > < a id = "l00744" name = "l00744" > < / a > < span class = "lineno" > 744< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & capacities) {< / div >
< div class = "line" > < a id = "l00745" name = "l00745" > < / a > < span class = "lineno" > 745< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (weights.size(), 1)< / div >
< div class = "line" > < a id = "l00746" name = "l00746" > < / a > < span class = "lineno" > 746< / span > < < < span class = "stringliteral" > " Brute force solver only works with one dimension." < / span > ;< / div >
< div class = "line" > < a id = "l00747" name = "l00747" > < / a > < span class = "lineno" > 747< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (capacities.size(), weights.size());< / div >
< div class = "line" > < a id = "l00748" name = "l00748" > < / a > < span class = "lineno" > 748< / span > < / div >
< div class = "line" > < a id = "l00749" name = "l00749" > < / a > < span class = "lineno" > 749< / span > sorted_items_.clear();< / div >
< div class = "line" > < a id = "l00750" name = "l00750" > < / a > < span class = "lineno" > 750< / span > sum_profits_.clear();< / div >
< div class = "line" > < a id = "l00751" name = "l00751" > < / a > < span class = "lineno" > 751< / span > sum_weights_.clear();< / div >
< div class = "line" > < a id = "l00752" name = "l00752" > < / a > < span class = "lineno" > 752< / span > < / div >
< div class = "line" > < a id = "l00753" name = "l00753" > < / a > < span class = "lineno" > 753< / span > capacity_ = capacities[0];< / div >
< div class = "line" > < a id = "l00754" name = "l00754" > < / a > < span class = "lineno" > 754< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_items = profits.size();< / div >
< div class = "line" > < a id = "l00755" name = "l00755" > < / a > < span class = "lineno" > 755< / span > < a class = "code hl_define" href = "base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c" > CHECK_LE< / a > (num_items, kMaxNumberOf64Items)< / div >
< div class = "line" > < a id = "l00756" name = "l00756" > < / a > < span class = "lineno" > 756< / span > < < < span class = "stringliteral" > " To use Knapsack64ItemsSolver the number of items should be " < / span > < / div >
< div class = "line" > < a id = "l00757" name = "l00757" > < / a > < span class = "lineno" > 757< / span > < < < span class = "stringliteral" > " less than " < / span > < < kMaxNumberOf64Items < < < span class = "stringliteral" > " . Current value: " < / span > < < num_items< / div >
< div class = "line" > < a id = "l00758" name = "l00758" > < / a > < span class = "lineno" > 758< / span > < < < span class = "stringliteral" > " ." < / span > ;< / div >
< div class = "line" > < a id = "l00759" name = "l00759" > < / a > < span class = "lineno" > 759< / span > int64_t < a class = "code hl_variable" href = "knapsack__solver_8cc.html#a3cb2fc3bc89582cef0819ea753e8a44d" > profit_max< / a > = *std::max_element(profits.begin(), profits.end());< / div >
< div class = "line" > < a id = "l00760" name = "l00760" > < / a > < span class = "lineno" > 760< / span > < / div >
< div class = "line" > < a id = "l00761" name = "l00761" > < / a > < span class = "lineno" > 761< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < num_items; ++i) {< / div >
< div class = "line" > < a id = "l00762" name = "l00762" > < / a > < span class = "lineno" > 762< / span > sorted_items_.push_back(< / div >
< div class = "line" > < a id = "l00763" name = "l00763" > < / a > < span class = "lineno" > 763< / span > < a class = "code hl_struct" href = "structoperations__research_1_1_knapsack_item_with_efficiency.html" > KnapsackItemWithEfficiency< / a > (i, profits[i], weights[0][i], < a class = "code hl_variable" href = "knapsack__solver_8cc.html#a3cb2fc3bc89582cef0819ea753e8a44d" > profit_max< / a > ));< / div >
< div class = "line" > < a id = "l00764" name = "l00764" > < / a > < span class = "lineno" > 764< / span > }< / div >
< div class = "line" > < a id = "l00765" name = "l00765" > < / a > < span class = "lineno" > 765< / span > < / div >
< div class = "line" > < a id = "l00766" name = "l00766" > < / a > < span class = "lineno" > 766< / span > std::sort(sorted_items_.begin(), sorted_items_.end(),< / div >
< div class = "line" > < a id = "l00767" name = "l00767" > < / a > < span class = "lineno" > 767< / span > < a class = "code hl_function" href = "namespaceoperations__research.html#a627ab892a9c19c32b05c8f118e7660e0" > CompareKnapsackItemWithEfficiencyInDecreasingEfficiencyOrder< / a > );< / div >
< div class = "line" > < a id = "l00768" name = "l00768" > < / a > < span class = "lineno" > 768< / span > < / div >
< div class = "line" > < a id = "l00769" name = "l00769" > < / a > < span class = "lineno" > 769< / span > int64_t sum_profit = 0;< / div >
< div class = "line" > < a id = "l00770" name = "l00770" > < / a > < span class = "lineno" > 770< / span > int64_t sum_weight = 0;< / div >
< div class = "line" > < a id = "l00771" name = "l00771" > < / a > < span class = "lineno" > 771< / span > sum_profits_.push_back(sum_profit);< / div >
< div class = "line" > < a id = "l00772" name = "l00772" > < / a > < span class = "lineno" > 772< / span > sum_weights_.push_back(sum_weight);< / div >
< div class = "line" > < a id = "l00773" name = "l00773" > < / a > < span class = "lineno" > 773< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < num_items; ++i) {< / div >
< div class = "line" > < a id = "l00774" name = "l00774" > < / a > < span class = "lineno" > 774< / span > sum_profit += sorted_items_[i].profit;< / div >
< div class = "line" > < a id = "l00775" name = "l00775" > < / a > < span class = "lineno" > 775< / span > sum_weight += sorted_items_[i].weight;< / div >
< div class = "line" > < a id = "l00776" name = "l00776" > < / a > < span class = "lineno" > 776< / span > < / div >
< div class = "line" > < a id = "l00777" name = "l00777" > < / a > < span class = "lineno" > 777< / span > sum_profits_.push_back(sum_profit);< / div >
< div class = "line" > < a id = "l00778" name = "l00778" > < / a > < span class = "lineno" > 778< / span > sum_weights_.push_back(sum_weight);< / div >
< div class = "line" > < a id = "l00779" name = "l00779" > < / a > < span class = "lineno" > 779< / span > }< / div >
< div class = "line" > < a id = "l00780" name = "l00780" > < / a > < span class = "lineno" > 780< / span > }< / div >
< div class = "line" > < a id = "l00781" name = "l00781" > < / a > < span class = "lineno" > 781< / span > < / div >
< div class = "line" > < a id = "l00782" name = "l00782" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack64_items_solver.html#a788a597dac89a082d3ed4994d654dec1" > 782< / a > < / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1_knapsack64_items_solver.html#a788a597dac89a082d3ed4994d654dec1" > Knapsack64ItemsSolver::Solve< / a > (< a class = "code hl_class" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > * < a class = "code hl_variable" href = "cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21" > time_limit< / a > ,< / div >
< div class = "line" > < a id = "l00783" name = "l00783" > < / a > < span class = "lineno" > 783< / span > < span class = "keywordtype" > bool< / span > * is_solution_optimal) {< / div >
< div class = "line" > < a id = "l00784" name = "l00784" > < / a > < span class = "lineno" > 784< / span > < a class = "code hl_define" href = "base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006" > DCHECK< / a > (is_solution_optimal != < span class = "keyword" > nullptr< / span > );< / div >
< div class = "line" > < a id = "l00785" name = "l00785" > < / a > < span class = "lineno" > 785< / span > *is_solution_optimal = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l00786" name = "l00786" > < / a > < span class = "lineno" > 786< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_items = sorted_items_.size();< / div >
< div class = "line" > < a id = "l00787" name = "l00787" > < / a > < span class = "lineno" > 787< / span > state_ = 1ULL;< / div >
< div class = "line" > < a id = "l00788" name = "l00788" > < / a > < span class = "lineno" > 788< / span > state_depth_ = 0;< / div >
< div class = "line" > < a id = "l00789" name = "l00789" > < / a > < span class = "lineno" > 789< / span > state_weight_ = sorted_items_[0].weight;< / div >
< div class = "line" > < a id = "l00790" name = "l00790" > < / a > < span class = "lineno" > 790< / span > rejected_items_profit_ = 0LL;< / div >
< div class = "line" > < a id = "l00791" name = "l00791" > < / a > < span class = "lineno" > 791< / span > rejected_items_weight_ = 0LL;< / div >
< div class = "line" > < a id = "l00792" name = "l00792" > < / a > < span class = "lineno" > 792< / span > best_solution_profit_ = 0LL;< / div >
< div class = "line" > < a id = "l00793" name = "l00793" > < / a > < span class = "lineno" > 793< / span > best_solution_ = 0ULL;< / div >
< div class = "line" > < a id = "l00794" name = "l00794" > < / a > < span class = "lineno" > 794< / span > best_solution_depth_ = 0;< / div >
< div class = "line" > < a id = "l00795" name = "l00795" > < / a > < span class = "lineno" > 795< / span > < / div >
< div class = "line" > < a id = "l00796" name = "l00796" > < / a > < span class = "lineno" > 796< / span > int64_t < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > = 0LL;< / div >
< div class = "line" > < a id = "l00797" name = "l00797" > < / a > < span class = "lineno" > 797< / span > int64_t < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > = 0LL;< / div >
< div class = "line" > < a id = "l00798" name = "l00798" > < / a > < span class = "lineno" > 798< / span > < span class = "keywordtype" > bool< / span > fail = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a id = "l00799" name = "l00799" > < / a > < span class = "lineno" > 799< / span > < span class = "keywordflow" > while< / span > (state_depth_ > = 0) {< / div >
< div class = "line" > < a id = "l00800" name = "l00800" > < / a > < span class = "lineno" > 800< / span > fail = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a id = "l00801" name = "l00801" > < / a > < span class = "lineno" > 801< / span > < span class = "keywordflow" > if< / span > (state_weight_ > capacity_ || state_depth_ > = num_items) {< / div >
< div class = "line" > < a id = "l00802" name = "l00802" > < / a > < span class = "lineno" > 802< / span > fail = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l00803" name = "l00803" > < / a > < span class = "lineno" > 803< / span > } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a id = "l00804" name = "l00804" > < / a > < span class = "lineno" > 804< / span > GetLowerAndUpperBound(& < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > , & < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > );< / div >
< div class = "line" > < a id = "l00805" name = "l00805" > < / a > < span class = "lineno" > 805< / span > < span class = "keywordflow" > if< / span > (best_solution_profit_ < < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > ) {< / div >
< div class = "line" > < a id = "l00806" name = "l00806" > < / a > < span class = "lineno" > 806< / span > best_solution_profit_ = < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > ;< / div >
< div class = "line" > < a id = "l00807" name = "l00807" > < / a > < span class = "lineno" > 807< / span > best_solution_ = state_;< / div >
< div class = "line" > < a id = "l00808" name = "l00808" > < / a > < span class = "lineno" > 808< / span > best_solution_depth_ = state_depth_;< / div >
< div class = "line" > < a id = "l00809" name = "l00809" > < / a > < span class = "lineno" > 809< / span > }< / div >
< div class = "line" > < a id = "l00810" name = "l00810" > < / a > < span class = "lineno" > 810< / span > }< / div >
< div class = "line" > < a id = "l00811" name = "l00811" > < / a > < span class = "lineno" > 811< / span > fail = fail || best_solution_profit_ > = < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > ;< / div >
< div class = "line" > < a id = "l00812" name = "l00812" > < / a > < span class = "lineno" > 812< / span > GoToNextState(fail);< / div >
< div class = "line" > < a id = "l00813" name = "l00813" > < / a > < span class = "lineno" > 813< / span > }< / div >
< div class = "line" > < a id = "l00814" name = "l00814" > < / a > < span class = "lineno" > 814< / span > < / div >
< div class = "line" > < a id = "l00815" name = "l00815" > < / a > < span class = "lineno" > 815< / span > BuildBestSolution();< / div >
< div class = "line" > < a id = "l00816" name = "l00816" > < / a > < span class = "lineno" > 816< / span > < span class = "keywordflow" > return< / span > best_solution_profit_;< / div >
< div class = "line" > < a id = "l00817" name = "l00817" > < / a > < span class = "lineno" > 817< / span > }< / div >
< div class = "line" > < a id = "l00818" name = "l00818" > < / a > < span class = "lineno" > 818< / span > < / div >
< div class = "line" > < a id = "l00819" name = "l00819" > < / a > < span class = "lineno" > 819< / span > < span class = "keywordtype" > int< / span > Knapsack64ItemsSolver::GetBreakItemId(int64_t < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > )< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a id = "l00820" name = "l00820" > < / a > < span class = "lineno" > 820< / span > std::vector< int64_t> ::const_iterator binary_search_iterator =< / div >
< div class = "line" > < a id = "l00821" name = "l00821" > < / a > < span class = "lineno" > 821< / span > < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > std::upper_bound< / a > (sum_weights_.begin(), sum_weights_.end(), < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > );< / div >
< div class = "line" > < a id = "l00822" name = "l00822" > < / a > < span class = "lineno" > 822< / span > < span class = "keywordflow" > return< / span > < span class = "keyword" > static_cast< < / span > < span class = "keywordtype" > int< / span > < span class = "keyword" > > < / span > (binary_search_iterator - sum_weights_.begin()) - 1;< / div >
< div class = "line" > < a id = "l00823" name = "l00823" > < / a > < span class = "lineno" > 823< / span > }< / div >
< div class = "line" > < a id = "l00824" name = "l00824" > < / a > < span class = "lineno" > 824< / span > < / div >
< div class = "line" > < a id = "l00825" name = "l00825" > < / a > < span class = "lineno" > 825< / span > < span class = "comment" > // This method is called for each possible state.< / span > < / div >
< div class = "line" > < a id = "l00826" name = "l00826" > < / a > < span class = "lineno" > 826< / span > < span class = "comment" > // Lower and upper bounds can be equal from one state to another.< / span > < / div >
< div class = "line" > < a id = "l00827" name = "l00827" > < / a > < span class = "lineno" > 827< / span > < span class = "comment" > // For instance state 1010???? and state 101011?? have exactly the same< / span > < / div >
< div class = "line" > < a id = "l00828" name = "l00828" > < / a > < span class = "lineno" > 828< / span > < span class = "comment" > // bounds. So it sounds like a good idea to cache those bounds.< / span > < / div >
< div class = "line" > < a id = "l00829" name = "l00829" > < / a > < span class = "lineno" > 829< / span > < span class = "comment" > // Unfortunately, experiments show equivalent results with or without this< / span > < / div >
< div class = "line" > < a id = "l00830" name = "l00830" > < / a > < span class = "lineno" > 830< / span > < span class = "comment" > // code optimization (only 1/7 of calls can be reused).< / span > < / div >
< div class = "line" > < a id = "l00831" name = "l00831" > < / a > < span class = "lineno" > 831< / span > < span class = "comment" > // In order to simplify the code, this optimization is not implemented.< / span > < / div >
< div class = "line" > < a id = "l00832" name = "l00832" > < / a > < span class = "lineno" > 832< / span > < span class = "keywordtype" > void< / span > Knapsack64ItemsSolver::GetLowerAndUpperBound(int64_t* < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > ,< / div >
< div class = "line" > < a id = "l00833" name = "l00833" > < / a > < span class = "lineno" > 833< / span > int64_t* < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > )< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a id = "l00834" name = "l00834" > < / a > < span class = "lineno" > 834< / span > < span class = "keyword" > const< / span > int64_t available_capacity = capacity_ + rejected_items_weight_;< / div >
< div class = "line" > < a id = "l00835" name = "l00835" > < / a > < span class = "lineno" > 835< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > break_item_id = GetBreakItemId(available_capacity);< / div >
< div class = "line" > < a id = "l00836" name = "l00836" > < / a > < span class = "lineno" > 836< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_items = sorted_items_.size();< / div >
< div class = "line" > < a id = "l00837" name = "l00837" > < / a > < span class = "lineno" > 837< / span > < span class = "keywordflow" > if< / span > (break_item_id > = num_items) {< / div >
< div class = "line" > < a id = "l00838" name = "l00838" > < / a > < span class = "lineno" > 838< / span > *< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > = sum_profits_[num_items] - rejected_items_profit_;< / div >
< div class = "line" > < a id = "l00839" name = "l00839" > < / a > < span class = "lineno" > 839< / span > *< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > = *< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > ;< / div >
< div class = "line" > < a id = "l00840" name = "l00840" > < / a > < span class = "lineno" > 840< / span > < span class = "keywordflow" > return< / span > ;< / div >
< div class = "line" > < a id = "l00841" name = "l00841" > < / a > < span class = "lineno" > 841< / span > }< / div >
< div class = "line" > < a id = "l00842" name = "l00842" > < / a > < span class = "lineno" > 842< / span > < / div >
< div class = "line" > < a id = "l00843" name = "l00843" > < / a > < span class = "lineno" > 843< / span > *< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > = sum_profits_[break_item_id] - rejected_items_profit_;< / div >
< div class = "line" > < a id = "l00844" name = "l00844" > < / a > < span class = "lineno" > 844< / span > *< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > = *< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > ;< / div >
< div class = "line" > < a id = "l00845" name = "l00845" > < / a > < span class = "lineno" > 845< / span > < span class = "keyword" > const< / span > int64_t consumed_capacity = sum_weights_[break_item_id];< / div >
< div class = "line" > < a id = "l00846" name = "l00846" > < / a > < span class = "lineno" > 846< / span > < span class = "keyword" > const< / span > int64_t remaining_capacity = available_capacity - consumed_capacity;< / div >
< div class = "line" > < a id = "l00847" name = "l00847" > < / a > < span class = "lineno" > 847< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > double< / span > efficiency = sorted_items_[break_item_id].efficiency;< / div >
< div class = "line" > < a id = "l00848" name = "l00848" > < / a > < span class = "lineno" > 848< / span > < span class = "keyword" > const< / span > int64_t additional_profit =< / div >
< div class = "line" > < a id = "l00849" name = "l00849" > < / a > < span class = "lineno" > 849< / span > < span class = "keyword" > static_cast< < / span > int64_t< span class = "keyword" > > < / span > (remaining_capacity * efficiency);< / div >
< div class = "line" > < a id = "l00850" name = "l00850" > < / a > < span class = "lineno" > 850< / span > *< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > += additional_profit;< / div >
< div class = "line" > < a id = "l00851" name = "l00851" > < / a > < span class = "lineno" > 851< / span > }< / div >
< div class = "line" > < a id = "l00852" name = "l00852" > < / a > < span class = "lineno" > 852< / span > < / div >
< div class = "line" > < a id = "l00853" name = "l00853" > < / a > < span class = "lineno" > 853< / span > < span class = "comment" > // As state_depth_ is the position of the most significant bit on state_< / span > < / div >
< div class = "line" > < a id = "l00854" name = "l00854" > < / a > < span class = "lineno" > 854< / span > < span class = "comment" > // it is possible to remove the loop and so be in O(1) instead of O(depth).< / span > < / div >
< div class = "line" > < a id = "l00855" name = "l00855" > < / a > < span class = "lineno" > 855< / span > < span class = "comment" > // In such a case rejected_items_profit_ is computed using sum_profits_ array.< / span > < / div >
< div class = "line" > < a id = "l00856" name = "l00856" > < / a > < span class = "lineno" > 856< / span > < span class = "comment" > // Unfortunately experiments show smaller computation time using the ' while' < / span > < / div >
< div class = "line" > < a id = "l00857" name = "l00857" > < / a > < span class = "lineno" > 857< / span > < span class = "comment" > // (10% speed-up). That' s the reason why the loop version is implemented.< / span > < / div >
< div class = "line" > < a id = "l00858" name = "l00858" > < / a > < span class = "lineno" > 858< / span > < span class = "keywordtype" > void< / span > Knapsack64ItemsSolver::GoToNextState(< span class = "keywordtype" > bool< / span > has_failed) {< / div >
< div class = "line" > < a id = "l00859" name = "l00859" > < / a > < span class = "lineno" > 859< / span > uint64_t mask = < a class = "code hl_function" href = "namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71" > OneBit64< / a > (state_depth_);< / div >
< div class = "line" > < a id = "l00860" name = "l00860" > < / a > < span class = "lineno" > 860< / span > < span class = "keywordflow" > if< / span > (!has_failed) { < span class = "comment" > // Go to next item.< / span > < / div >
< div class = "line" > < a id = "l00861" name = "l00861" > < / a > < span class = "lineno" > 861< / span > ++state_depth_;< / div >
< div class = "line" > < a id = "l00862" name = "l00862" > < / a > < span class = "lineno" > 862< / span > state_ = state_ | (mask < < 1);< / div >
< div class = "line" > < a id = "l00863" name = "l00863" > < / a > < span class = "lineno" > 863< / span > state_weight_ += sorted_items_[state_depth_].weight;< / div >
< div class = "line" > < a id = "l00864" name = "l00864" > < / a > < span class = "lineno" > 864< / span > } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a id = "l00865" name = "l00865" > < / a > < span class = "lineno" > 865< / span > < span class = "comment" > // Backtrack to last item in.< / span > < / div >
< div class = "line" > < a id = "l00866" name = "l00866" > < / a > < span class = "lineno" > 866< / span > < span class = "keywordflow" > while< / span > ((state_ & mask) == 0ULL & & state_depth_ > = 0) {< / div >
< div class = "line" > < a id = "l00867" name = "l00867" > < / a > < span class = "lineno" > 867< / span > < span class = "keyword" > const< / span > KnapsackItemWithEfficiency& item = sorted_items_[state_depth_];< / div >
< div class = "line" > < a id = "l00868" name = "l00868" > < / a > < span class = "lineno" > 868< / span > rejected_items_profit_ -= item.profit;< / div >
< div class = "line" > < a id = "l00869" name = "l00869" > < / a > < span class = "lineno" > 869< / span > rejected_items_weight_ -= item.weight;< / div >
< div class = "line" > < a id = "l00870" name = "l00870" > < / a > < span class = "lineno" > 870< / span > --state_depth_;< / div >
< div class = "line" > < a id = "l00871" name = "l00871" > < / a > < span class = "lineno" > 871< / span > mask = mask > > 1ULL;< / div >
< div class = "line" > < a id = "l00872" name = "l00872" > < / a > < span class = "lineno" > 872< / span > }< / div >
< div class = "line" > < a id = "l00873" name = "l00873" > < / a > < span class = "lineno" > 873< / span > < / div >
< div class = "line" > < a id = "l00874" name = "l00874" > < / a > < span class = "lineno" > 874< / span > < span class = "keywordflow" > if< / span > (state_ & mask) { < span class = "comment" > // Item was in, remove it.< / span > < / div >
< div class = "line" > < a id = "l00875" name = "l00875" > < / a > < span class = "lineno" > 875< / span > state_ = state_ & ~mask;< / div >
< div class = "line" > < a id = "l00876" name = "l00876" > < / a > < span class = "lineno" > 876< / span > < span class = "keyword" > const< / span > KnapsackItemWithEfficiency& item = sorted_items_[state_depth_];< / div >
< div class = "line" > < a id = "l00877" name = "l00877" > < / a > < span class = "lineno" > 877< / span > rejected_items_profit_ += item.profit;< / div >
< div class = "line" > < a id = "l00878" name = "l00878" > < / a > < span class = "lineno" > 878< / span > rejected_items_weight_ += item.weight;< / div >
< div class = "line" > < a id = "l00879" name = "l00879" > < / a > < span class = "lineno" > 879< / span > state_weight_ -= item.weight;< / div >
< div class = "line" > < a id = "l00880" name = "l00880" > < / a > < span class = "lineno" > 880< / span > }< / div >
< div class = "line" > < a id = "l00881" name = "l00881" > < / a > < span class = "lineno" > 881< / span > }< / div >
< div class = "line" > < a id = "l00882" name = "l00882" > < / a > < span class = "lineno" > 882< / span > }< / div >
< div class = "line" > < a id = "l00883" name = "l00883" > < / a > < span class = "lineno" > 883< / span > < / div >
< div class = "line" > < a id = "l00884" name = "l00884" > < / a > < span class = "lineno" > 884< / span > < span class = "keywordtype" > void< / span > Knapsack64ItemsSolver::BuildBestSolution() {< / div >
< div class = "line" > < a id = "l00885" name = "l00885" > < / a > < span class = "lineno" > 885< / span > int64_t remaining_capacity = capacity_;< / div >
< div class = "line" > < a id = "l00886" name = "l00886" > < / a > < span class = "lineno" > 886< / span > int64_t check_profit = 0LL;< / div >
< div class = "line" > < a id = "l00887" name = "l00887" > < / a > < span class = "lineno" > 887< / span > < / div >
< div class = "line" > < a id = "l00888" name = "l00888" > < / a > < span class = "lineno" > 888< / span > < span class = "comment" > // Compute remaining capacity at best_solution_depth_ to be able to redo< / span > < / div >
< div class = "line" > < a id = "l00889" name = "l00889" > < / a > < span class = "lineno" > 889< / span > < span class = "comment" > // the GetLowerAndUpperBound computation.< / span > < / div >
< div class = "line" > < a id = "l00890" name = "l00890" > < / a > < span class = "lineno" > 890< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < = best_solution_depth_; ++i) {< / div >
< div class = "line" > < a id = "l00891" name = "l00891" > < / a > < span class = "lineno" > 891< / span > < span class = "keywordflow" > if< / span > (best_solution_ & < a class = "code hl_function" href = "namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71" > OneBit64< / a > (i)) {< / div >
< div class = "line" > < a id = "l00892" name = "l00892" > < / a > < span class = "lineno" > 892< / span > remaining_capacity -= sorted_items_[i].weight;< / div >
< div class = "line" > < a id = "l00893" name = "l00893" > < / a > < span class = "lineno" > 893< / span > check_profit += sorted_items_[i].profit;< / div >
< div class = "line" > < a id = "l00894" name = "l00894" > < / a > < span class = "lineno" > 894< / span > }< / div >
< div class = "line" > < a id = "l00895" name = "l00895" > < / a > < span class = "lineno" > 895< / span > }< / div >
< div class = "line" > < a id = "l00896" name = "l00896" > < / a > < span class = "lineno" > 896< / span > < / div >
< div class = "line" > < a id = "l00897" name = "l00897" > < / a > < span class = "lineno" > 897< / span > < span class = "comment" > // Add all items till the break item.< / span > < / div >
< div class = "line" > < a id = "l00898" name = "l00898" > < / a > < span class = "lineno" > 898< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_items = sorted_items_.size();< / div >
< div class = "line" > < a id = "l00899" name = "l00899" > < / a > < span class = "lineno" > 899< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = best_solution_depth_ + 1; i < num_items; ++i) {< / div >
< div class = "line" > < a id = "l00900" name = "l00900" > < / a > < span class = "lineno" > 900< / span > int64_t < a class = "code hl_variable" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > = sorted_items_[i].weight;< / div >
< div class = "line" > < a id = "l00901" name = "l00901" > < / a > < span class = "lineno" > 901< / span > < span class = "keywordflow" > if< / span > (remaining_capacity > = < a class = "code hl_variable" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > ) {< / div >
< div class = "line" > < a id = "l00902" name = "l00902" > < / a > < span class = "lineno" > 902< / span > remaining_capacity -= < a class = "code hl_variable" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > ;< / div >
< div class = "line" > < a id = "l00903" name = "l00903" > < / a > < span class = "lineno" > 903< / span > check_profit += sorted_items_[i].profit;< / div >
< div class = "line" > < a id = "l00904" name = "l00904" > < / a > < span class = "lineno" > 904< / span > best_solution_ = best_solution_ | < a class = "code hl_function" href = "namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71" > OneBit64< / a > (i);< / div >
< div class = "line" > < a id = "l00905" name = "l00905" > < / a > < span class = "lineno" > 905< / span > } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a id = "l00906" name = "l00906" > < / a > < span class = "lineno" > 906< / span > best_solution_ = best_solution_ & ~OneBit64(i);< / div >
< div class = "line" > < a id = "l00907" name = "l00907" > < / a > < span class = "lineno" > 907< / span > }< / div >
< div class = "line" > < a id = "l00908" name = "l00908" > < / a > < span class = "lineno" > 908< / span > }< / div >
< div class = "line" > < a id = "l00909" name = "l00909" > < / a > < span class = "lineno" > 909< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (best_solution_profit_, check_profit);< / div >
< div class = "line" > < a id = "l00910" name = "l00910" > < / a > < span class = "lineno" > 910< / span > < / div >
< div class = "line" > < a id = "l00911" name = "l00911" > < / a > < span class = "lineno" > 911< / span > < span class = "comment" > // Items were sorted by efficiency, solution should be unsorted to be< / span > < / div >
< div class = "line" > < a id = "l00912" name = "l00912" > < / a > < span class = "lineno" > 912< / span > < span class = "comment" > // in user order.< / span > < / div >
< div class = "line" > < a id = "l00913" name = "l00913" > < / a > < span class = "lineno" > 913< / span > < span class = "comment" > // Note that best_solution_ will not be in the same order than other data< / span > < / div >
< div class = "line" > < a id = "l00914" name = "l00914" > < / a > < span class = "lineno" > 914< / span > < span class = "comment" > // structures anymore.< / span > < / div >
< div class = "line" > < a id = "l00915" name = "l00915" > < / a > < span class = "lineno" > 915< / span > uint64_t tmp_solution = 0ULL;< / div >
< div class = "line" > < a id = "l00916" name = "l00916" > < / a > < span class = "lineno" > 916< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < num_items; ++i) {< / div >
< div class = "line" > < a id = "l00917" name = "l00917" > < / a > < span class = "lineno" > 917< / span > < span class = "keywordflow" > if< / span > (best_solution_ & < a class = "code hl_function" href = "namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71" > OneBit64< / a > (i)) {< / div >
< div class = "line" > < a id = "l00918" name = "l00918" > < / a > < span class = "lineno" > 918< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > original_id = sorted_items_[i].id;< / div >
< div class = "line" > < a id = "l00919" name = "l00919" > < / a > < span class = "lineno" > 919< / span > tmp_solution = tmp_solution | < a class = "code hl_function" href = "namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71" > OneBit64< / a > (original_id);< / div >
< div class = "line" > < a id = "l00920" name = "l00920" > < / a > < span class = "lineno" > 920< / span > }< / div >
< div class = "line" > < a id = "l00921" name = "l00921" > < / a > < span class = "lineno" > 921< / span > }< / div >
< div class = "line" > < a id = "l00922" name = "l00922" > < / a > < span class = "lineno" > 922< / span > < / div >
< div class = "line" > < a id = "l00923" name = "l00923" > < / a > < span class = "lineno" > 923< / span > best_solution_ = tmp_solution;< / div >
< div class = "line" > < a id = "l00924" name = "l00924" > < / a > < span class = "lineno" > 924< / span > }< / div >
< div class = "line" > < a id = "l00925" name = "l00925" > < / a > < span class = "lineno" > 925< / span > < / div >
< div class = "line" > < a id = "l00926" name = "l00926" > < / a > < span class = "lineno" > 926< / span > < span class = "comment" > // ----- KnapsackDynamicProgrammingSolver -----< / span > < / div >
< div class = "line" > < a id = "l00927" name = "l00927" > < / a > < span class = "lineno" > 927< / span > < span class = "comment" > // KnapsackDynamicProgrammingSolver solves the 0-1 knapsack problem< / span > < / div >
< div class = "line" > < a id = "l00928" name = "l00928" > < / a > < span class = "lineno" > 928< / span > < span class = "comment" > // using dynamic programming. This algorithm is pseudo-polynomial because it< / span > < / div >
< div class = "line" > < a id = "l00929" name = "l00929" > < / a > < span class = "lineno" > 929< / span > < span class = "comment" > // depends on capacity, ie. the time and space complexity is< / span > < / div >
< div class = "line" > < a id = "l00930" name = "l00930" > < / a > < span class = "lineno" > 930< / span > < span class = "comment" > // O(capacity * number_of_items).< / span > < / div >
< div class = "line" > < a id = "l00931" name = "l00931" > < / a > < span class = "lineno" > 931< / span > < span class = "comment" > // The implemented algorithm is ' DP-3' in " Knapsack problems" , Hans Kellerer,< / span > < / div >
< div class = "line" > < a id = "l00932" name = "l00932" > < / a > < span class = "lineno" > 932< / span > < span class = "comment" > // Ulrich Pferschy and David Pisinger, Springer book (ISBN 978-3540402862).< / span > < / div >
< div class = "line" > < a id = "l00933" name = "l00933" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html" > 933< / a > < / span > < span class = "keyword" > class < / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html" > KnapsackDynamicProgrammingSolver< / a > : < span class = "keyword" > public< / span > < a class = "code hl_class" href = "classoperations__research_1_1_base_knapsack_solver.html" > BaseKnapsackSolver< / a > {< / div >
< div class = "line" > < a id = "l00934" name = "l00934" > < / a > < span class = "lineno" > 934< / span > < span class = "keyword" > public< / span > :< / div >
< div class = "line" > < a id = "l00935" name = "l00935" > < / a > < span class = "lineno" > 935< / span > < span class = "keyword" > explicit< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html#ad12d8a6596d658d1b3fabafdeb505d16" > KnapsackDynamicProgrammingSolver< / a > (< span class = "keyword" > const< / span > std::string& solver_name);< / div >
< div class = "line" > < a id = "l00936" name = "l00936" > < / a > < span class = "lineno" > 936< / span > < / div >
< div class = "line" > < a id = "l00937" name = "l00937" > < / a > < span class = "lineno" > 937< / span > < span class = "comment" > // Initializes the solver and enters the problem to be solved.< / span > < / div >
< div class = "line" > < a id = "l00938" name = "l00938" > < / a > < span class = "lineno" > 938< / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html#a734b6464309adbbdeb63ef759f690ff1" > Init< / a > (< span class = "keyword" > const< / span > std::vector< int64_t> & profits,< / div >
< div class = "line" > < a id = "l00939" name = "l00939" > < / a > < span class = "lineno" > 939< / span > < span class = "keyword" > const< / span > std::vector< std::vector< int64_t> > & weights,< / div >
< div class = "line" > < a id = "l00940" name = "l00940" > < / a > < span class = "lineno" > 940< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & capacities) < span class = "keyword" > override< / span > ;< / div >
< div class = "line" > < a id = "l00941" name = "l00941" > < / a > < span class = "lineno" > 941< / span > < / div >
< div class = "line" > < a id = "l00942" name = "l00942" > < / a > < span class = "lineno" > 942< / span > < span class = "comment" > // Solves the problem and returns the profit of the optimal solution.< / span > < / div >
< div class = "line" > < a id = "l00943" name = "l00943" > < / a > < span class = "lineno" > 943< / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html#a788a597dac89a082d3ed4994d654dec1" > Solve< / a > (< a class = "code hl_class" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > * < a class = "code hl_variable" href = "cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21" > time_limit< / a > , < span class = "keywordtype" > bool< / span > * is_solution_optimal) < span class = "keyword" > override< / span > ;< / div >
< div class = "line" > < a id = "l00944" name = "l00944" > < / a > < span class = "lineno" > 944< / span > < / div >
< div class = "line" > < a id = "l00945" name = "l00945" > < / a > < span class = "lineno" > 945< / span > < span class = "comment" > // Returns true if the item ' item_id' is packed in the optimal knapsack.< / span > < / div >
< div class = "line" > < a id = "l00946" name = "l00946" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4" > 946< / a > < / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4" > best_solution< / a > (< span class = "keywordtype" > int< / span > item_id)< span class = "keyword" > const override < / span > {< / div >
< div class = "line" > < a id = "l00947" name = "l00947" > < / a > < span class = "lineno" > 947< / span > < span class = "keywordflow" > return< / span > best_solution_.at(item_id);< / div >
< div class = "line" > < a id = "l00948" name = "l00948" > < / a > < span class = "lineno" > 948< / span > }< / div >
< div class = "line" > < a id = "l00949" name = "l00949" > < / a > < span class = "lineno" > 949< / span > < / div >
< div class = "line" > < a id = "l00950" name = "l00950" > < / a > < span class = "lineno" > 950< / span > < span class = "keyword" > private< / span > :< / div >
< div class = "line" > < a id = "l00951" name = "l00951" > < / a > < span class = "lineno" > 951< / span > int64_t SolveSubProblem(int64_t < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > , < span class = "keywordtype" > int< / span > num_items);< / div >
< div class = "line" > < a id = "l00952" name = "l00952" > < / a > < span class = "lineno" > 952< / span > < / div >
< div class = "line" > < a id = "l00953" name = "l00953" > < / a > < span class = "lineno" > 953< / span > std::vector< int64_t> profits_;< / div >
< div class = "line" > < a id = "l00954" name = "l00954" > < / a > < span class = "lineno" > 954< / span > std::vector< int64_t> weights_;< / div >
< div class = "line" > < a id = "l00955" name = "l00955" > < / a > < span class = "lineno" > 955< / span > int64_t capacity_;< / div >
< div class = "line" > < a id = "l00956" name = "l00956" > < / a > < span class = "lineno" > 956< / span > std::vector< int64_t> computed_profits_;< / div >
< div class = "line" > < a id = "l00957" name = "l00957" > < / a > < span class = "lineno" > 957< / span > std::vector< int> selected_item_ids_;< / div >
< div class = "line" > < a id = "l00958" name = "l00958" > < / a > < span class = "lineno" > 958< / span > std::vector< bool> best_solution_;< / div >
< div class = "line" > < a id = "l00959" name = "l00959" > < / a > < span class = "lineno" > 959< / span > };< / div >
< div class = "line" > < a id = "l00960" name = "l00960" > < / a > < span class = "lineno" > 960< / span > < / div >
< div class = "line" > < a id = "l00961" name = "l00961" > < / a > < span class = "lineno" > 961< / span > < span class = "comment" > // ----- KnapsackDynamicProgrammingSolver -----< / span > < / div >
< div class = "line" > < a id = "l00962" name = "l00962" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html#ad12d8a6596d658d1b3fabafdeb505d16" > 962< / a > < / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html#ad12d8a6596d658d1b3fabafdeb505d16" > KnapsackDynamicProgrammingSolver::KnapsackDynamicProgrammingSolver< / a > (< / div >
< div class = "line" > < a id = "l00963" name = "l00963" > < / a > < span class = "lineno" > 963< / span > < span class = "keyword" > const< / span > std::string& solver_name)< / div >
< div class = "line" > < a id = "l00964" name = "l00964" > < / a > < span class = "lineno" > 964< / span > : < a class = "code hl_class" href = "classoperations__research_1_1_base_knapsack_solver.html" > BaseKnapsackSolver< / a > (solver_name),< / div >
< div class = "line" > < a id = "l00965" name = "l00965" > < / a > < span class = "lineno" > 965< / span > profits_(),< / div >
< div class = "line" > < a id = "l00966" name = "l00966" > < / a > < span class = "lineno" > 966< / span > weights_(),< / div >
< div class = "line" > < a id = "l00967" name = "l00967" > < / a > < span class = "lineno" > 967< / span > capacity_(0),< / div >
< div class = "line" > < a id = "l00968" name = "l00968" > < / a > < span class = "lineno" > 968< / span > computed_profits_(),< / div >
< div class = "line" > < a id = "l00969" name = "l00969" > < / a > < span class = "lineno" > 969< / span > selected_item_ids_(),< / div >
< div class = "line" > < a id = "l00970" name = "l00970" > < / a > < span class = "lineno" > 970< / span > best_solution_() {}< / div >
< div class = "line" > < a id = "l00971" name = "l00971" > < / a > < span class = "lineno" > 971< / span > < / div >
< div class = "line" > < a id = "l00972" name = "l00972" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html#a734b6464309adbbdeb63ef759f690ff1" > 972< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html#a734b6464309adbbdeb63ef759f690ff1" > KnapsackDynamicProgrammingSolver::Init< / a > (< / div >
< div class = "line" > < a id = "l00973" name = "l00973" > < / a > < span class = "lineno" > 973< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & profits,< / div >
< div class = "line" > < a id = "l00974" name = "l00974" > < / a > < span class = "lineno" > 974< / span > < span class = "keyword" > const< / span > std::vector< std::vector< int64_t> > & weights,< / div >
< div class = "line" > < a id = "l00975" name = "l00975" > < / a > < span class = "lineno" > 975< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & capacities) {< / div >
< div class = "line" > < a id = "l00976" name = "l00976" > < / a > < span class = "lineno" > 976< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (weights.size(), 1)< / div >
< div class = "line" > < a id = "l00977" name = "l00977" > < / a > < span class = "lineno" > 977< / span > < < < span class = "stringliteral" > " Current implementation of the dynamic programming solver only deals" < / span > < / div >
< div class = "line" > < a id = "l00978" name = "l00978" > < / a > < span class = "lineno" > 978< / span > < < < span class = "stringliteral" > " with one dimension." < / span > ;< / div >
< div class = "line" > < a id = "l00979" name = "l00979" > < / a > < span class = "lineno" > 979< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (capacities.size(), weights.size());< / div >
< div class = "line" > < a id = "l00980" name = "l00980" > < / a > < span class = "lineno" > 980< / span > < / div >
< div class = "line" > < a id = "l00981" name = "l00981" > < / a > < span class = "lineno" > 981< / span > profits_ = profits;< / div >
< div class = "line" > < a id = "l00982" name = "l00982" > < / a > < span class = "lineno" > 982< / span > weights_ = weights[0];< / div >
< div class = "line" > < a id = "l00983" name = "l00983" > < / a > < span class = "lineno" > 983< / span > capacity_ = capacities[0];< / div >
< div class = "line" > < a id = "l00984" name = "l00984" > < / a > < span class = "lineno" > 984< / span > }< / div >
< div class = "line" > < a id = "l00985" name = "l00985" > < / a > < span class = "lineno" > 985< / span > < / div >
< div class = "line" > < a id = "l00986" name = "l00986" > < / a > < span class = "lineno" > 986< / span > int64_t KnapsackDynamicProgrammingSolver::SolveSubProblem(int64_t < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > ,< / div >
< div class = "line" > < a id = "l00987" name = "l00987" > < / a > < span class = "lineno" > 987< / span > < span class = "keywordtype" > int< / span > num_items) {< / div >
< div class = "line" > < a id = "l00988" name = "l00988" > < / a > < span class = "lineno" > 988< / span > < span class = "keyword" > const< / span > int64_t capacity_plus_1 = < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > + 1;< / div >
< div class = "line" > < a id = "l00989" name = "l00989" > < / a > < span class = "lineno" > 989< / span > std::fill_n(selected_item_ids_.begin(), capacity_plus_1, 0);< / div >
< div class = "line" > < a id = "l00990" name = "l00990" > < / a > < span class = "lineno" > 990< / span > std::fill_n(computed_profits_.begin(), capacity_plus_1, int64_t{0});< / div >
< div class = "line" > < a id = "l00991" name = "l00991" > < / a > < span class = "lineno" > 991< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > item_id = 0; item_id < num_items; ++item_id) {< / div >
< div class = "line" > < a id = "l00992" name = "l00992" > < / a > < span class = "lineno" > 992< / span > < span class = "keyword" > const< / span > int64_t item_weight = weights_[item_id];< / div >
< div class = "line" > < a id = "l00993" name = "l00993" > < / a > < span class = "lineno" > 993< / span > < span class = "keyword" > const< / span > int64_t item_profit = profits_[item_id];< / div >
< div class = "line" > < a id = "l00994" name = "l00994" > < / a > < span class = "lineno" > 994< / span > < span class = "keywordflow" > for< / span > (int64_t used_capacity = < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > ; used_capacity > = item_weight;< / div >
< div class = "line" > < a id = "l00995" name = "l00995" > < / a > < span class = "lineno" > 995< / span > --used_capacity) {< / div >
< div class = "line" > < a id = "l00996" name = "l00996" > < / a > < span class = "lineno" > 996< / span > < span class = "keywordflow" > if< / span > (computed_profits_[used_capacity - item_weight] + item_profit > < / div >
< div class = "line" > < a id = "l00997" name = "l00997" > < / a > < span class = "lineno" > 997< / span > computed_profits_[used_capacity]) {< / div >
< div class = "line" > < a id = "l00998" name = "l00998" > < / a > < span class = "lineno" > 998< / span > computed_profits_[used_capacity] =< / div >
< div class = "line" > < a id = "l00999" name = "l00999" > < / a > < span class = "lineno" > 999< / span > computed_profits_[used_capacity - item_weight] + item_profit;< / div >
< div class = "line" > < a id = "l01000" name = "l01000" > < / a > < span class = "lineno" > 1000< / span > selected_item_ids_[used_capacity] = item_id;< / div >
< div class = "line" > < a id = "l01001" name = "l01001" > < / a > < span class = "lineno" > 1001< / span > }< / div >
< div class = "line" > < a id = "l01002" name = "l01002" > < / a > < span class = "lineno" > 1002< / span > }< / div >
< div class = "line" > < a id = "l01003" name = "l01003" > < / a > < span class = "lineno" > 1003< / span > }< / div >
< div class = "line" > < a id = "l01004" name = "l01004" > < / a > < span class = "lineno" > 1004< / span > < span class = "keywordflow" > return< / span > selected_item_ids_.at(< a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > );< / div >
< div class = "line" > < a id = "l01005" name = "l01005" > < / a > < span class = "lineno" > 1005< / span > }< / div >
< div class = "line" > < a id = "l01006" name = "l01006" > < / a > < span class = "lineno" > 1006< / span > < / div >
< div class = "line" > < a id = "l01007" name = "l01007" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html#a788a597dac89a082d3ed4994d654dec1" > 1007< / a > < / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html#a788a597dac89a082d3ed4994d654dec1" > KnapsackDynamicProgrammingSolver::Solve< / a > (< a class = "code hl_class" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > * < a class = "code hl_variable" href = "cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21" > time_limit< / a > ,< / div >
< div class = "line" > < a id = "l01008" name = "l01008" > < / a > < span class = "lineno" > 1008< / span > < span class = "keywordtype" > bool< / span > * is_solution_optimal) {< / div >
< div class = "line" > < a id = "l01009" name = "l01009" > < / a > < span class = "lineno" > 1009< / span > < a class = "code hl_define" href = "base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006" > DCHECK< / a > (is_solution_optimal != < span class = "keyword" > nullptr< / span > );< / div >
< div class = "line" > < a id = "l01010" name = "l01010" > < / a > < span class = "lineno" > 1010< / span > *is_solution_optimal = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l01011" name = "l01011" > < / a > < span class = "lineno" > 1011< / span > < span class = "keyword" > const< / span > int64_t capacity_plus_1 = capacity_ + 1;< / div >
< div class = "line" > < a id = "l01012" name = "l01012" > < / a > < span class = "lineno" > 1012< / span > selected_item_ids_.assign(capacity_plus_1, 0);< / div >
< div class = "line" > < a id = "l01013" name = "l01013" > < / a > < span class = "lineno" > 1013< / span > computed_profits_.assign(capacity_plus_1, 0LL);< / div >
< div class = "line" > < a id = "l01014" name = "l01014" > < / a > < span class = "lineno" > 1014< / span > < / div >
< div class = "line" > < a id = "l01015" name = "l01015" > < / a > < span class = "lineno" > 1015< / span > int64_t remaining_capacity = capacity_;< / div >
< div class = "line" > < a id = "l01016" name = "l01016" > < / a > < span class = "lineno" > 1016< / span > < span class = "keywordtype" > int< / span > num_items = profits_.size();< / div >
< div class = "line" > < a id = "l01017" name = "l01017" > < / a > < span class = "lineno" > 1017< / span > best_solution_.assign(num_items, < span class = "keyword" > false< / span > );< / div >
< div class = "line" > < a id = "l01018" name = "l01018" > < / a > < span class = "lineno" > 1018< / span > < / div >
< div class = "line" > < a id = "l01019" name = "l01019" > < / a > < span class = "lineno" > 1019< / span > < span class = "keywordflow" > while< / span > (remaining_capacity > 0 & & num_items > 0) {< / div >
< div class = "line" > < a id = "l01020" name = "l01020" > < / a > < span class = "lineno" > 1020< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > selected_item_id = SolveSubProblem(remaining_capacity, num_items);< / div >
< div class = "line" > < a id = "l01021" name = "l01021" > < / a > < span class = "lineno" > 1021< / span > remaining_capacity -= weights_[selected_item_id];< / div >
< div class = "line" > < a id = "l01022" name = "l01022" > < / a > < span class = "lineno" > 1022< / span > num_items = selected_item_id;< / div >
< div class = "line" > < a id = "l01023" name = "l01023" > < / a > < span class = "lineno" > 1023< / span > < span class = "keywordflow" > if< / span > (remaining_capacity > = 0) {< / div >
< div class = "line" > < a id = "l01024" name = "l01024" > < / a > < span class = "lineno" > 1024< / span > best_solution_[selected_item_id] = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l01025" name = "l01025" > < / a > < span class = "lineno" > 1025< / span > }< / div >
< div class = "line" > < a id = "l01026" name = "l01026" > < / a > < span class = "lineno" > 1026< / span > }< / div >
< div class = "line" > < a id = "l01027" name = "l01027" > < / a > < span class = "lineno" > 1027< / span > < / div >
< div class = "line" > < a id = "l01028" name = "l01028" > < / a > < span class = "lineno" > 1028< / span > < span class = "keywordflow" > return< / span > computed_profits_[capacity_];< / div >
< div class = "line" > < a id = "l01029" name = "l01029" > < / a > < span class = "lineno" > 1029< / span > }< / div >
< div class = "line" > < a id = "l01030" name = "l01030" > < / a > < span class = "lineno" > 1030< / span > < span class = "comment" > // ----- KnapsackDivideAndConquerSolver -----< / span > < / div >
< div class = "line" > < a id = "l01031" name = "l01031" > < / a > < span class = "lineno" > 1031< / span > < span class = "comment" > // KnapsackDivideAndConquerSolver solves the 0-1 knapsack problem (KP)< / span > < / div >
< div class = "line" > < a id = "l01032" name = "l01032" > < / a > < span class = "lineno" > 1032< / span > < span class = "comment" > // using divide and conquer and dynamic programming.< / span > < / div >
< div class = "line" > < a id = "l01033" name = "l01033" > < / a > < span class = "lineno" > 1033< / span > < span class = "comment" > // By using one-dimensional vectors it keeps a complexity of O(capacity *< / span > < / div >
< div class = "line" > < a id = "l01034" name = "l01034" > < / a > < span class = "lineno" > 1034< / span > < span class = "comment" > // number_of_items) in time, but reduces the space complexity to O(capacity +< / span > < / div >
< div class = "line" > < a id = "l01035" name = "l01035" > < / a > < span class = "lineno" > 1035< / span > < span class = "comment" > // number_of_items) and is therefore suitable for large hard to solve< / span > < / div >
< div class = "line" > < a id = "l01036" name = "l01036" > < / a > < span class = "lineno" > 1036< / span > < span class = "comment" > // (KP)/(SSP). The implemented algorithm is based on ' DP-2' and Divide and< / span > < / div >
< div class = "line" > < a id = "l01037" name = "l01037" > < / a > < span class = "lineno" > 1037< / span > < span class = "comment" > // Conquer for storage reduction from [Hans Kellerer et al., " Knapsack problems" < / span > < / div >
< div class = "line" > < a id = "l01038" name = "l01038" > < / a > < span class = "lineno" > 1038< / span > < span class = "comment" > // (DOI 10.1007/978-3-540-24777-7)].< / span > < / div >
< div class = "line" > < a id = "l01039" name = "l01039" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html" > 1039< / a > < / span > < span class = "keyword" > class < / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html" > KnapsackDivideAndConquerSolver< / a > : < span class = "keyword" > public< / span > < a class = "code hl_class" href = "classoperations__research_1_1_base_knapsack_solver.html" > BaseKnapsackSolver< / a > {< / div >
< div class = "line" > < a id = "l01040" name = "l01040" > < / a > < span class = "lineno" > 1040< / span > < span class = "keyword" > public< / span > :< / div >
< div class = "line" > < a id = "l01041" name = "l01041" > < / a > < span class = "lineno" > 1041< / span > < span class = "keyword" > explicit< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html#a7ab851afcd52d261c81d45ee40a1a072" > KnapsackDivideAndConquerSolver< / a > (< span class = "keyword" > const< / span > std::string& solver_name);< / div >
< div class = "line" > < a id = "l01042" name = "l01042" > < / a > < span class = "lineno" > 1042< / span > < / div >
< div class = "line" > < a id = "l01043" name = "l01043" > < / a > < span class = "lineno" > 1043< / span > < span class = "comment" > // Initializes the solver and enters the problem to be solved.< / span > < / div >
< div class = "line" > < a id = "l01044" name = "l01044" > < / a > < span class = "lineno" > 1044< / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html#a734b6464309adbbdeb63ef759f690ff1" > Init< / a > (< span class = "keyword" > const< / span > std::vector< int64_t> & profits,< / div >
< div class = "line" > < a id = "l01045" name = "l01045" > < / a > < span class = "lineno" > 1045< / span > < span class = "keyword" > const< / span > std::vector< std::vector< int64_t> > & weights,< / div >
< div class = "line" > < a id = "l01046" name = "l01046" > < / a > < span class = "lineno" > 1046< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & capacities) < span class = "keyword" > override< / span > ;< / div >
< div class = "line" > < a id = "l01047" name = "l01047" > < / a > < span class = "lineno" > 1047< / span > < / div >
< div class = "line" > < a id = "l01048" name = "l01048" > < / a > < span class = "lineno" > 1048< / span > < span class = "comment" > // Solves the problem and returns the profit of the optimal solution.< / span > < / div >
< div class = "line" > < a id = "l01049" name = "l01049" > < / a > < span class = "lineno" > 1049< / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html#a788a597dac89a082d3ed4994d654dec1" > Solve< / a > (< a class = "code hl_class" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > * < a class = "code hl_variable" href = "cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21" > time_limit< / a > , < span class = "keywordtype" > bool< / span > * is_solution_optimal) < span class = "keyword" > override< / span > ;< / div >
< div class = "line" > < a id = "l01050" name = "l01050" > < / a > < span class = "lineno" > 1050< / span > < / div >
< div class = "line" > < a id = "l01051" name = "l01051" > < / a > < span class = "lineno" > 1051< / span > < span class = "comment" > // Returns true if the item ' item_id' is packed in the optimal knapsack.< / span > < / div >
< div class = "line" > < a id = "l01052" name = "l01052" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4" > 1052< / a > < / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4" > best_solution< / a > (< span class = "keywordtype" > int< / span > item_id)< span class = "keyword" > const override < / span > {< / div >
< div class = "line" > < a id = "l01053" name = "l01053" > < / a > < span class = "lineno" > 1053< / span > < span class = "keywordflow" > return< / span > best_solution_.at(item_id);< / div >
< div class = "line" > < a id = "l01054" name = "l01054" > < / a > < span class = "lineno" > 1054< / span > }< / div >
< div class = "line" > < a id = "l01055" name = "l01055" > < / a > < span class = "lineno" > 1055< / span > < / div >
< div class = "line" > < a id = "l01056" name = "l01056" > < / a > < span class = "lineno" > 1056< / span > < span class = "keyword" > private< / span > :< / div >
< div class = "line" > < a id = "l01057" name = "l01057" > < / a > < span class = "lineno" > 1057< / span > < span class = "comment" > // ' DP 2' computes solution ' z' for 0 up to capacitiy< / span > < / div >
< div class = "line" > < a id = "l01058" name = "l01058" > < / a > < span class = "lineno" > 1058< / span > < span class = "keywordtype" > void< / span > SolveSubProblem(< span class = "keywordtype" > bool< / span > first_storage, int64_t < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > , < span class = "keywordtype" > int< / span > start_item,< / div >
< div class = "line" > < a id = "l01059" name = "l01059" > < / a > < span class = "lineno" > 1059< / span > < span class = "keywordtype" > int< / span > end_item);< / div >
< div class = "line" > < a id = "l01060" name = "l01060" > < / a > < span class = "lineno" > 1060< / span > < / div >
< div class = "line" > < a id = "l01061" name = "l01061" > < / a > < span class = "lineno" > 1061< / span > < span class = "comment" > // Calculates best_solution_ and return ' z' from first instance< / span > < / div >
< div class = "line" > < a id = "l01062" name = "l01062" > < / a > < span class = "lineno" > 1062< / span > int64_t DivideAndConquer(int64_t < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > , < span class = "keywordtype" > int< / span > start_item, < span class = "keywordtype" > int< / span > end_item);< / div >
< div class = "line" > < a id = "l01063" name = "l01063" > < / a > < span class = "lineno" > 1063< / span > < / div >
< div class = "line" > < a id = "l01064" name = "l01064" > < / a > < span class = "lineno" > 1064< / span > std::vector< int64_t> profits_;< / div >
< div class = "line" > < a id = "l01065" name = "l01065" > < / a > < span class = "lineno" > 1065< / span > std::vector< int64_t> weights_;< / div >
< div class = "line" > < a id = "l01066" name = "l01066" > < / a > < span class = "lineno" > 1066< / span > int64_t capacity_;< / div >
< div class = "line" > < a id = "l01067" name = "l01067" > < / a > < span class = "lineno" > 1067< / span > std::vector< int64_t> computed_profits_storage1_;< / div >
< div class = "line" > < a id = "l01068" name = "l01068" > < / a > < span class = "lineno" > 1068< / span > std::vector< int64_t> computed_profits_storage2_;< / div >
< div class = "line" > < a id = "l01069" name = "l01069" > < / a > < span class = "lineno" > 1069< / span > std::vector< bool> best_solution_;< / div >
< div class = "line" > < a id = "l01070" name = "l01070" > < / a > < span class = "lineno" > 1070< / span > };< / div >
< div class = "line" > < a id = "l01071" name = "l01071" > < / a > < span class = "lineno" > 1071< / span > < / div >
< div class = "line" > < a id = "l01072" name = "l01072" > < / a > < span class = "lineno" > 1072< / span > < span class = "comment" > // ----- KnapsackDivideAndConquerSolver -----< / span > < / div >
< div class = "line" > < a id = "l01073" name = "l01073" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html#a7ab851afcd52d261c81d45ee40a1a072" > 1073< / a > < / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html#a7ab851afcd52d261c81d45ee40a1a072" > KnapsackDivideAndConquerSolver::KnapsackDivideAndConquerSolver< / a > (< / div >
< div class = "line" > < a id = "l01074" name = "l01074" > < / a > < span class = "lineno" > 1074< / span > < span class = "keyword" > const< / span > std::string& solver_name)< / div >
< div class = "line" > < a id = "l01075" name = "l01075" > < / a > < span class = "lineno" > 1075< / span > : < a class = "code hl_class" href = "classoperations__research_1_1_base_knapsack_solver.html" > BaseKnapsackSolver< / a > (solver_name),< / div >
< div class = "line" > < a id = "l01076" name = "l01076" > < / a > < span class = "lineno" > 1076< / span > profits_(),< / div >
< div class = "line" > < a id = "l01077" name = "l01077" > < / a > < span class = "lineno" > 1077< / span > weights_(),< / div >
< div class = "line" > < a id = "l01078" name = "l01078" > < / a > < span class = "lineno" > 1078< / span > capacity_(0),< / div >
< div class = "line" > < a id = "l01079" name = "l01079" > < / a > < span class = "lineno" > 1079< / span > computed_profits_storage1_(),< / div >
< div class = "line" > < a id = "l01080" name = "l01080" > < / a > < span class = "lineno" > 1080< / span > computed_profits_storage2_(),< / div >
< div class = "line" > < a id = "l01081" name = "l01081" > < / a > < span class = "lineno" > 1081< / span > best_solution_() {}< / div >
< div class = "line" > < a id = "l01082" name = "l01082" > < / a > < span class = "lineno" > 1082< / span > < / div >
< div class = "line" > < a id = "l01083" name = "l01083" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html#a734b6464309adbbdeb63ef759f690ff1" > 1083< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html#a734b6464309adbbdeb63ef759f690ff1" > KnapsackDivideAndConquerSolver::Init< / a > (< / div >
< div class = "line" > < a id = "l01084" name = "l01084" > < / a > < span class = "lineno" > 1084< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & profits,< / div >
< div class = "line" > < a id = "l01085" name = "l01085" > < / a > < span class = "lineno" > 1085< / span > < span class = "keyword" > const< / span > std::vector< std::vector< int64_t> > & weights,< / div >
< div class = "line" > < a id = "l01086" name = "l01086" > < / a > < span class = "lineno" > 1086< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & capacities) {< / div >
< div class = "line" > < a id = "l01087" name = "l01087" > < / a > < span class = "lineno" > 1087< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (weights.size(), 1)< / div >
< div class = "line" > < a id = "l01088" name = "l01088" > < / a > < span class = "lineno" > 1088< / span > < < < span class = "stringliteral" > " Current implementation of the divide and conquer solver only deals" < / span > < / div >
< div class = "line" > < a id = "l01089" name = "l01089" > < / a > < span class = "lineno" > 1089< / span > < < < span class = "stringliteral" > " with one dimension." < / span > ;< / div >
< div class = "line" > < a id = "l01090" name = "l01090" > < / a > < span class = "lineno" > 1090< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (capacities.size(), weights.size());< / div >
< div class = "line" > < a id = "l01091" name = "l01091" > < / a > < span class = "lineno" > 1091< / span > < / div >
< div class = "line" > < a id = "l01092" name = "l01092" > < / a > < span class = "lineno" > 1092< / span > profits_ = profits;< / div >
< div class = "line" > < a id = "l01093" name = "l01093" > < / a > < span class = "lineno" > 1093< / span > weights_ = weights[0];< / div >
< div class = "line" > < a id = "l01094" name = "l01094" > < / a > < span class = "lineno" > 1094< / span > capacity_ = capacities[0];< / div >
< div class = "line" > < a id = "l01095" name = "l01095" > < / a > < span class = "lineno" > 1095< / span > }< / div >
< div class = "line" > < a id = "l01096" name = "l01096" > < / a > < span class = "lineno" > 1096< / span > < / div >
< div class = "line" > < a id = "l01097" name = "l01097" > < / a > < span class = "lineno" > 1097< / span > < span class = "keywordtype" > void< / span > KnapsackDivideAndConquerSolver::SolveSubProblem(< span class = "keywordtype" > bool< / span > first_storage,< / div >
< div class = "line" > < a id = "l01098" name = "l01098" > < / a > < span class = "lineno" > 1098< / span > int64_t < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > ,< / div >
< div class = "line" > < a id = "l01099" name = "l01099" > < / a > < span class = "lineno" > 1099< / span > < span class = "keywordtype" > int< / span > start_item,< / div >
< div class = "line" > < a id = "l01100" name = "l01100" > < / a > < span class = "lineno" > 1100< / span > < span class = "keywordtype" > int< / span > end_item) {< / div >
< div class = "line" > < a id = "l01101" name = "l01101" > < / a > < span class = "lineno" > 1101< / span > std::vector< int64_t> & computed_profits_storage_ =< / div >
< div class = "line" > < a id = "l01102" name = "l01102" > < / a > < span class = "lineno" > 1102< / span > (first_storage) ? computed_profits_storage1_ : computed_profits_storage2_;< / div >
< div class = "line" > < a id = "l01103" name = "l01103" > < / a > < span class = "lineno" > 1103< / span > < span class = "keyword" > const< / span > int64_t capacity_plus_1 = < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > + 1;< / div >
< div class = "line" > < a id = "l01104" name = "l01104" > < / a > < span class = "lineno" > 1104< / span > std::fill_n(computed_profits_storage_.begin(), capacity_plus_1, 0LL);< / div >
< div class = "line" > < a id = "l01105" name = "l01105" > < / a > < span class = "lineno" > 1105< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > item_id = start_item; item_id < end_item; ++item_id) {< / div >
< div class = "line" > < a id = "l01106" name = "l01106" > < / a > < span class = "lineno" > 1106< / span > < span class = "keyword" > const< / span > int64_t item_weight = weights_[item_id];< / div >
< div class = "line" > < a id = "l01107" name = "l01107" > < / a > < span class = "lineno" > 1107< / span > < span class = "keyword" > const< / span > int64_t item_profit = profits_[item_id];< / div >
< div class = "line" > < a id = "l01108" name = "l01108" > < / a > < span class = "lineno" > 1108< / span > < span class = "keywordflow" > for< / span > (int64_t used_capacity = < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > ; used_capacity > = item_weight;< / div >
< div class = "line" > < a id = "l01109" name = "l01109" > < / a > < span class = "lineno" > 1109< / span > --used_capacity) {< / div >
< div class = "line" > < a id = "l01110" name = "l01110" > < / a > < span class = "lineno" > 1110< / span > < span class = "keywordflow" > if< / span > (computed_profits_storage_[used_capacity - item_weight] + item_profit > < / div >
< div class = "line" > < a id = "l01111" name = "l01111" > < / a > < span class = "lineno" > 1111< / span > computed_profits_storage_[used_capacity]) {< / div >
< div class = "line" > < a id = "l01112" name = "l01112" > < / a > < span class = "lineno" > 1112< / span > computed_profits_storage_[used_capacity] =< / div >
< div class = "line" > < a id = "l01113" name = "l01113" > < / a > < span class = "lineno" > 1113< / span > computed_profits_storage_[used_capacity - item_weight] +< / div >
< div class = "line" > < a id = "l01114" name = "l01114" > < / a > < span class = "lineno" > 1114< / span > item_profit;< / div >
< div class = "line" > < a id = "l01115" name = "l01115" > < / a > < span class = "lineno" > 1115< / span > }< / div >
< div class = "line" > < a id = "l01116" name = "l01116" > < / a > < span class = "lineno" > 1116< / span > }< / div >
< div class = "line" > < a id = "l01117" name = "l01117" > < / a > < span class = "lineno" > 1117< / span > }< / div >
< div class = "line" > < a id = "l01118" name = "l01118" > < / a > < span class = "lineno" > 1118< / span > }< / div >
< div class = "line" > < a id = "l01119" name = "l01119" > < / a > < span class = "lineno" > 1119< / span > < / div >
< div class = "line" > < a id = "l01120" name = "l01120" > < / a > < span class = "lineno" > 1120< / span > int64_t KnapsackDivideAndConquerSolver::DivideAndConquer(int64_t < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > ,< / div >
< div class = "line" > < a id = "l01121" name = "l01121" > < / a > < span class = "lineno" > 1121< / span > < span class = "keywordtype" > int< / span > start_item,< / div >
< div class = "line" > < a id = "l01122" name = "l01122" > < / a > < span class = "lineno" > 1122< / span > < span class = "keywordtype" > int< / span > end_item) {< / div >
< div class = "line" > < a id = "l01123" name = "l01123" > < / a > < span class = "lineno" > 1123< / span > < span class = "keyword" > const< / span > int64_t capacity_plus_1 = capacity_ + 1;< / div >
< div class = "line" > < a id = "l01124" name = "l01124" > < / a > < span class = "lineno" > 1124< / span > < span class = "keywordtype" > int< / span > item_boundary_ = start_item + ((end_item - start_item) / 2);< / div >
< div class = "line" > < a id = "l01125" name = "l01125" > < / a > < span class = "lineno" > 1125< / span > < / div >
< div class = "line" > < a id = "l01126" name = "l01126" > < / a > < span class = "lineno" > 1126< / span > SolveSubProblem(< span class = "keyword" > true< / span > , < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > , start_item, item_boundary_);< / div >
< div class = "line" > < a id = "l01127" name = "l01127" > < / a > < span class = "lineno" > 1127< / span > SolveSubProblem(< span class = "keyword" > false< / span > , < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > , item_boundary_, end_item);< / div >
< div class = "line" > < a id = "l01128" name = "l01128" > < / a > < span class = "lineno" > 1128< / span > < / div >
< div class = "line" > < a id = "l01129" name = "l01129" > < / a > < span class = "lineno" > 1129< / span > int64_t max_solution_ = 0, capacity1_ = 0, capacity2_ = 0;< / div >
< div class = "line" > < a id = "l01130" name = "l01130" > < / a > < span class = "lineno" > 1130< / span > < / div >
< div class = "line" > < a id = "l01131" name = "l01131" > < / a > < span class = "lineno" > 1131< / span > < span class = "keywordflow" > for< / span > (int64_t capacity_id = 0; capacity_id < = < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > ; capacity_id++) {< / div >
< div class = "line" > < a id = "l01132" name = "l01132" > < / a > < span class = "lineno" > 1132< / span > < span class = "keywordflow" > if< / span > ((computed_profits_storage1_[capacity_id] +< / div >
< div class = "line" > < a id = "l01133" name = "l01133" > < / a > < span class = "lineno" > 1133< / span > computed_profits_storage2_[(< a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > - capacity_id)]) > < / div >
< div class = "line" > < a id = "l01134" name = "l01134" > < / a > < span class = "lineno" > 1134< / span > max_solution_) {< / div >
< div class = "line" > < a id = "l01135" name = "l01135" > < / a > < span class = "lineno" > 1135< / span > capacity1_ = capacity_id;< / div >
< div class = "line" > < a id = "l01136" name = "l01136" > < / a > < span class = "lineno" > 1136< / span > capacity2_ = < a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > - capacity_id;< / div >
< div class = "line" > < a id = "l01137" name = "l01137" > < / a > < span class = "lineno" > 1137< / span > max_solution_ = (computed_profits_storage1_[capacity_id] +< / div >
< div class = "line" > < a id = "l01138" name = "l01138" > < / a > < span class = "lineno" > 1138< / span > computed_profits_storage2_[(< a class = "code hl_variable" href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > - capacity_id)]);< / div >
< div class = "line" > < a id = "l01139" name = "l01139" > < / a > < span class = "lineno" > 1139< / span > }< / div >
< div class = "line" > < a id = "l01140" name = "l01140" > < / a > < span class = "lineno" > 1140< / span > }< / div >
< div class = "line" > < a id = "l01141" name = "l01141" > < / a > < span class = "lineno" > 1141< / span > < / div >
< div class = "line" > < a id = "l01142" name = "l01142" > < / a > < span class = "lineno" > 1142< / span > < span class = "keywordflow" > if< / span > ((item_boundary_ - start_item) == 1) {< / div >
< div class = "line" > < a id = "l01143" name = "l01143" > < / a > < span class = "lineno" > 1143< / span > < span class = "keywordflow" > if< / span > (weights_[start_item] < = capacity1_) best_solution_[start_item] = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l01144" name = "l01144" > < / a > < span class = "lineno" > 1144< / span > } < span class = "keywordflow" > else< / span > < span class = "keywordflow" > if< / span > ((item_boundary_ - start_item) > 1)< / div >
< div class = "line" > < a id = "l01145" name = "l01145" > < / a > < span class = "lineno" > 1145< / span > DivideAndConquer(capacity1_, start_item, item_boundary_);< / div >
< div class = "line" > < a id = "l01146" name = "l01146" > < / a > < span class = "lineno" > 1146< / span > < / div >
< div class = "line" > < a id = "l01147" name = "l01147" > < / a > < span class = "lineno" > 1147< / span > < span class = "keywordflow" > if< / span > ((end_item - item_boundary_) == 1) {< / div >
< div class = "line" > < a id = "l01148" name = "l01148" > < / a > < span class = "lineno" > 1148< / span > < span class = "keywordflow" > if< / span > (weights_[item_boundary_] < = capacity2_)< / div >
< div class = "line" > < a id = "l01149" name = "l01149" > < / a > < span class = "lineno" > 1149< / span > best_solution_[item_boundary_] = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l01150" name = "l01150" > < / a > < span class = "lineno" > 1150< / span > } < span class = "keywordflow" > else< / span > < span class = "keywordflow" > if< / span > ((end_item - item_boundary_) > 1)< / div >
< div class = "line" > < a id = "l01151" name = "l01151" > < / a > < span class = "lineno" > 1151< / span > DivideAndConquer(capacity2_, item_boundary_, end_item);< / div >
< div class = "line" > < a id = "l01152" name = "l01152" > < / a > < span class = "lineno" > 1152< / span > < / div >
< div class = "line" > < a id = "l01153" name = "l01153" > < / a > < span class = "lineno" > 1153< / span > < span class = "keywordflow" > return< / span > max_solution_;< / div >
< div class = "line" > < a id = "l01154" name = "l01154" > < / a > < span class = "lineno" > 1154< / span > }< / div >
< div class = "line" > < a id = "l01155" name = "l01155" > < / a > < span class = "lineno" > 1155< / span > < / div >
< div class = "line" > < a id = "l01156" name = "l01156" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html#a788a597dac89a082d3ed4994d654dec1" > 1156< / a > < / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html#a788a597dac89a082d3ed4994d654dec1" > KnapsackDivideAndConquerSolver::Solve< / a > (< a class = "code hl_class" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > * < a class = "code hl_variable" href = "cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21" > time_limit< / a > ,< / div >
< div class = "line" > < a id = "l01157" name = "l01157" > < / a > < span class = "lineno" > 1157< / span > < span class = "keywordtype" > bool< / span > * is_solution_optimal) {< / div >
< div class = "line" > < a id = "l01158" name = "l01158" > < / a > < span class = "lineno" > 1158< / span > < a class = "code hl_define" href = "base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006" > DCHECK< / a > (is_solution_optimal != < span class = "keyword" > nullptr< / span > );< / div >
< div class = "line" > < a id = "l01159" name = "l01159" > < / a > < span class = "lineno" > 1159< / span > *is_solution_optimal = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l01160" name = "l01160" > < / a > < span class = "lineno" > 1160< / span > < span class = "keyword" > const< / span > int64_t capacity_plus_1 = capacity_ + 1;< / div >
< div class = "line" > < a id = "l01161" name = "l01161" > < / a > < span class = "lineno" > 1161< / span > computed_profits_storage1_.assign(capacity_plus_1, 0LL);< / div >
< div class = "line" > < a id = "l01162" name = "l01162" > < / a > < span class = "lineno" > 1162< / span > computed_profits_storage2_.assign(capacity_plus_1, 0LL);< / div >
< div class = "line" > < a id = "l01163" name = "l01163" > < / a > < span class = "lineno" > 1163< / span > best_solution_.assign(profits_.size(), < span class = "keyword" > false< / span > );< / div >
< div class = "line" > < a id = "l01164" name = "l01164" > < / a > < span class = "lineno" > 1164< / span > < / div >
< div class = "line" > < a id = "l01165" name = "l01165" > < / a > < span class = "lineno" > 1165< / span > < span class = "keywordflow" > return< / span > DivideAndConquer(capacity_, 0, profits_.size());< / div >
< div class = "line" > < a id = "l01166" name = "l01166" > < / a > < span class = "lineno" > 1166< / span > }< / div >
< div class = "line" > < a id = "l01167" name = "l01167" > < / a > < span class = "lineno" > 1167< / span > < span class = "comment" > // ----- KnapsackMIPSolver -----< / span > < / div >
< div class = "line" > < a id = "l01168" name = "l01168" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_m_i_p_solver.html" > 1168< / a > < / span > < span class = "keyword" > class < / span > < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_m_i_p_solver.html" > KnapsackMIPSolver< / a > : < span class = "keyword" > public< / span > < a class = "code hl_class" href = "classoperations__research_1_1_base_knapsack_solver.html" > BaseKnapsackSolver< / a > {< / div >
< div class = "line" > < a id = "l01169" name = "l01169" > < / a > < span class = "lineno" > 1169< / span > < span class = "keyword" > public< / span > :< / div >
< div class = "line" > < a id = "l01170" name = "l01170" > < / a > < span class = "lineno" > 1170< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_m_i_p_solver.html#a86d45985fb2256114f8fa235af155cff" > KnapsackMIPSolver< / a > (< a class = "code hl_enumeration" href = "classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8" > MPSolver::OptimizationProblemType< / a > < a class = "code hl_variable" href = "linear__solver_8cc.html#acdf66e64954cbe33c30a45395b4d74b6" > problem_type< / a > ,< / div >
< div class = "line" > < a id = "l01171" name = "l01171" > < / a > < span class = "lineno" > 1171< / span > < span class = "keyword" > const< / span > std::string& solver_name);< / div >
< div class = "line" > < a id = "l01172" name = "l01172" > < / a > < span class = "lineno" > 1172< / span > < / div >
< div class = "line" > < a id = "l01173" name = "l01173" > < / a > < span class = "lineno" > 1173< / span > < span class = "comment" > // Initializes the solver and enters the problem to be solved.< / span > < / div >
< div class = "line" > < a id = "l01174" name = "l01174" > < / a > < span class = "lineno" > 1174< / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_m_i_p_solver.html#a734b6464309adbbdeb63ef759f690ff1" > Init< / a > (< span class = "keyword" > const< / span > std::vector< int64_t> & profits,< / div >
< div class = "line" > < a id = "l01175" name = "l01175" > < / a > < span class = "lineno" > 1175< / span > < span class = "keyword" > const< / span > std::vector< std::vector< int64_t> > & weights,< / div >
< div class = "line" > < a id = "l01176" name = "l01176" > < / a > < span class = "lineno" > 1176< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & capacities) < span class = "keyword" > override< / span > ;< / div >
< div class = "line" > < a id = "l01177" name = "l01177" > < / a > < span class = "lineno" > 1177< / span > < / div >
< div class = "line" > < a id = "l01178" name = "l01178" > < / a > < span class = "lineno" > 1178< / span > < span class = "comment" > // Solves the problem and returns the profit of the optimal solution.< / span > < / div >
< div class = "line" > < a id = "l01179" name = "l01179" > < / a > < span class = "lineno" > 1179< / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_m_i_p_solver.html#a788a597dac89a082d3ed4994d654dec1" > Solve< / a > (< a class = "code hl_class" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > * < a class = "code hl_variable" href = "cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21" > time_limit< / a > , < span class = "keywordtype" > bool< / span > * is_solution_optimal) < span class = "keyword" > override< / span > ;< / div >
< div class = "line" > < a id = "l01180" name = "l01180" > < / a > < span class = "lineno" > 1180< / span > < / div >
< div class = "line" > < a id = "l01181" name = "l01181" > < / a > < span class = "lineno" > 1181< / span > < span class = "comment" > // Returns true if the item ' item_id' is packed in the optimal knapsack.< / span > < / div >
< div class = "line" > < a id = "l01182" name = "l01182" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_m_i_p_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4" > 1182< / a > < / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_m_i_p_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4" > best_solution< / a > (< span class = "keywordtype" > int< / span > item_id)< span class = "keyword" > const override < / span > {< / div >
< div class = "line" > < a id = "l01183" name = "l01183" > < / a > < span class = "lineno" > 1183< / span > < span class = "keywordflow" > return< / span > best_solution_.at(item_id);< / div >
< div class = "line" > < a id = "l01184" name = "l01184" > < / a > < span class = "lineno" > 1184< / span > }< / div >
< div class = "line" > < a id = "l01185" name = "l01185" > < / a > < span class = "lineno" > 1185< / span > < / div >
< div class = "line" > < a id = "l01186" name = "l01186" > < / a > < span class = "lineno" > 1186< / span > < span class = "keyword" > private< / span > :< / div >
< div class = "line" > < a id = "l01187" name = "l01187" > < / a > < span class = "lineno" > 1187< / span > < a class = "code hl_enumeration" href = "classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8" > MPSolver::OptimizationProblemType< / a > problem_type_;< / div >
< div class = "line" > < a id = "l01188" name = "l01188" > < / a > < span class = "lineno" > 1188< / span > std::vector< int64_t> profits_;< / div >
< div class = "line" > < a id = "l01189" name = "l01189" > < / a > < span class = "lineno" > 1189< / span > std::vector< std::vector< int64_t> > weights_;< / div >
< div class = "line" > < a id = "l01190" name = "l01190" > < / a > < span class = "lineno" > 1190< / span > std::vector< int64_t> capacities_;< / div >
< div class = "line" > < a id = "l01191" name = "l01191" > < / a > < span class = "lineno" > 1191< / span > std::vector< bool> best_solution_;< / div >
< div class = "line" > < a id = "l01192" name = "l01192" > < / a > < span class = "lineno" > 1192< / span > };< / div >
< div class = "line" > < a id = "l01193" name = "l01193" > < / a > < span class = "lineno" > 1193< / span > < / div >
< div class = "line" > < a id = "l01194" name = "l01194" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_m_i_p_solver.html#a86d45985fb2256114f8fa235af155cff" > 1194< / a > < / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_m_i_p_solver.html#a86d45985fb2256114f8fa235af155cff" > KnapsackMIPSolver::KnapsackMIPSolver< / a > (< / div >
< div class = "line" > < a id = "l01195" name = "l01195" > < / a > < span class = "lineno" > 1195< / span > < a class = "code hl_enumeration" href = "classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8" > MPSolver::OptimizationProblemType< / a > < a class = "code hl_variable" href = "linear__solver_8cc.html#acdf66e64954cbe33c30a45395b4d74b6" > problem_type< / a > ,< / div >
< div class = "line" > < a id = "l01196" name = "l01196" > < / a > < span class = "lineno" > 1196< / span > < span class = "keyword" > const< / span > std::string& solver_name)< / div >
< div class = "line" > < a id = "l01197" name = "l01197" > < / a > < span class = "lineno" > 1197< / span > : < a class = "code hl_class" href = "classoperations__research_1_1_base_knapsack_solver.html" > BaseKnapsackSolver< / a > (solver_name),< / div >
< div class = "line" > < a id = "l01198" name = "l01198" > < / a > < span class = "lineno" > 1198< / span > problem_type_(< a class = "code hl_variable" href = "linear__solver_8cc.html#acdf66e64954cbe33c30a45395b4d74b6" > problem_type< / a > ),< / div >
< div class = "line" > < a id = "l01199" name = "l01199" > < / a > < span class = "lineno" > 1199< / span > profits_(),< / div >
< div class = "line" > < a id = "l01200" name = "l01200" > < / a > < span class = "lineno" > 1200< / span > weights_(),< / div >
< div class = "line" > < a id = "l01201" name = "l01201" > < / a > < span class = "lineno" > 1201< / span > capacities_(),< / div >
< div class = "line" > < a id = "l01202" name = "l01202" > < / a > < span class = "lineno" > 1202< / span > best_solution_() {}< / div >
< div class = "line" > < a id = "l01203" name = "l01203" > < / a > < span class = "lineno" > 1203< / span > < / div >
< div class = "line" > < a id = "l01204" name = "l01204" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_m_i_p_solver.html#a734b6464309adbbdeb63ef759f690ff1" > 1204< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_m_i_p_solver.html#a734b6464309adbbdeb63ef759f690ff1" > KnapsackMIPSolver::Init< / a > (< span class = "keyword" > const< / span > std::vector< int64_t> & profits,< / div >
< div class = "line" > < a id = "l01205" name = "l01205" > < / a > < span class = "lineno" > 1205< / span > < span class = "keyword" > const< / span > std::vector< std::vector< int64_t> > & weights,< / div >
< div class = "line" > < a id = "l01206" name = "l01206" > < / a > < span class = "lineno" > 1206< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & capacities) {< / div >
< div class = "line" > < a id = "l01207" name = "l01207" > < / a > < span class = "lineno" > 1207< / span > profits_ = profits;< / div >
< div class = "line" > < a id = "l01208" name = "l01208" > < / a > < span class = "lineno" > 1208< / span > weights_ = weights;< / div >
< div class = "line" > < a id = "l01209" name = "l01209" > < / a > < span class = "lineno" > 1209< / span > capacities_ = capacities;< / div >
< div class = "line" > < a id = "l01210" name = "l01210" > < / a > < span class = "lineno" > 1210< / span > }< / div >
< div class = "line" > < a id = "l01211" name = "l01211" > < / a > < span class = "lineno" > 1211< / span > < / div >
< div class = "line" > < a id = "l01212" name = "l01212" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_m_i_p_solver.html#a788a597dac89a082d3ed4994d654dec1" > 1212< / a > < / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_m_i_p_solver.html#a788a597dac89a082d3ed4994d654dec1" > KnapsackMIPSolver::Solve< / a > (< a class = "code hl_class" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > * < a class = "code hl_variable" href = "cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21" > time_limit< / a > ,< / div >
< div class = "line" > < a id = "l01213" name = "l01213" > < / a > < span class = "lineno" > 1213< / span > < span class = "keywordtype" > bool< / span > * is_solution_optimal) {< / div >
< div class = "line" > < a id = "l01214" name = "l01214" > < / a > < span class = "lineno" > 1214< / span > < a class = "code hl_define" href = "base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006" > DCHECK< / a > (is_solution_optimal != < span class = "keyword" > nullptr< / span > );< / div >
< div class = "line" > < a id = "l01215" name = "l01215" > < / a > < span class = "lineno" > 1215< / span > *is_solution_optimal = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l01216" name = "l01216" > < / a > < span class = "lineno" > 1216< / span > < a class = "code hl_class" href = "classoperations__research_1_1_m_p_solver.html" > MPSolver< / a > solver(< a class = "code hl_function" href = "classoperations__research_1_1_base_knapsack_solver.html#ae194e7bee4a383e5ee6c8ed341b49b7e" > GetName< / a > (), problem_type_);< / div >
< div class = "line" > < a id = "l01217" name = "l01217" > < / a > < span class = "lineno" > 1217< / span > < / div >
< div class = "line" > < a id = "l01218" name = "l01218" > < / a > < span class = "lineno" > 1218< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_items = profits_.size();< / div >
< div class = "line" > < a id = "l01219" name = "l01219" > < / a > < span class = "lineno" > 1219< / span > std::vector< MPVariable*> variables;< / div >
< div class = "line" > < a id = "l01220" name = "l01220" > < / a > < span class = "lineno" > 1220< / span > solver.< a class = "code hl_function" href = "classoperations__research_1_1_m_p_solver.html#a200ccd114eb5057856c05501c2d4abe5" > MakeBoolVarArray< / a > (num_items, < span class = "stringliteral" > " x" < / span > , & variables);< / div >
< div class = "line" > < a id = "l01221" name = "l01221" > < / a > < span class = "lineno" > 1221< / span > < / div >
< div class = "line" > < a id = "l01222" name = "l01222" > < / a > < span class = "lineno" > 1222< / span > < span class = "comment" > // Add constraints.< / span > < / div >
< div class = "line" > < a id = "l01223" name = "l01223" > < / a > < span class = "lineno" > 1223< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_dimensions = capacities_.size();< / div >
< div class = "line" > < a id = "l01224" name = "l01224" > < / a > < span class = "lineno" > 1224< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (weights_.size() == num_dimensions)< / div >
< div class = "line" > < a id = "l01225" name = "l01225" > < / a > < span class = "lineno" > 1225< / span > < < < span class = "stringliteral" > " Weights should be vector of num_dimensions (" < / span > < < num_dimensions< / div >
< div class = "line" > < a id = "l01226" name = "l01226" > < / a > < span class = "lineno" > 1226< / span > < < < span class = "stringliteral" > " ) vectors of size num_items (" < / span > < < num_items < < < span class = "stringliteral" > " )." < / span > ;< / div >
< div class = "line" > < a id = "l01227" name = "l01227" > < / a > < span class = "lineno" > 1227< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < num_dimensions; ++i) {< / div >
< div class = "line" > < a id = "l01228" name = "l01228" > < / a > < span class = "lineno" > 1228< / span > < a class = "code hl_class" href = "classoperations__research_1_1_m_p_constraint.html" > MPConstraint< / a > * < span class = "keyword" > const< / span > < a class = "code hl_variable" href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > = solver.< a class = "code hl_function" href = "classoperations__research_1_1_m_p_solver.html#a43d6ca2f978ca6f622a16117166ff69a" > MakeRowConstraint< / a > (0LL, capacities_.at(i));< / div >
< div class = "line" > < a id = "l01229" name = "l01229" > < / a > < span class = "lineno" > 1229< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > j = 0; j < num_items; ++j) {< / div >
< div class = "line" > < a id = "l01230" name = "l01230" > < / a > < span class = "lineno" > 1230< / span > < a class = "code hl_variable" href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > -> SetCoefficient(variables.at(j), weights_.at(i).at(j));< / div >
< div class = "line" > < a id = "l01231" name = "l01231" > < / a > < span class = "lineno" > 1231< / span > }< / div >
< div class = "line" > < a id = "l01232" name = "l01232" > < / a > < span class = "lineno" > 1232< / span > }< / div >
< div class = "line" > < a id = "l01233" name = "l01233" > < / a > < span class = "lineno" > 1233< / span > < / div >
< div class = "line" > < a id = "l01234" name = "l01234" > < / a > < span class = "lineno" > 1234< / span > < span class = "comment" > // Define objective to minimize. Minimization is used instead of maximization< / span > < / div >
< div class = "line" > < a id = "l01235" name = "l01235" > < / a > < span class = "lineno" > 1235< / span > < span class = "comment" > // because of an issue with CBC solver which does not always find the optimal< / span > < / div >
< div class = "line" > < a id = "l01236" name = "l01236" > < / a > < span class = "lineno" > 1236< / span > < span class = "comment" > // solution on maximization problems.< / span > < / div >
< div class = "line" > < a id = "l01237" name = "l01237" > < / a > < span class = "lineno" > 1237< / span > < a class = "code hl_class" href = "classoperations__research_1_1_m_p_objective.html" > MPObjective< / a > * < span class = "keyword" > const< / span > objective = solver.< a class = "code hl_function" href = "classoperations__research_1_1_m_p_solver.html#aede63007883156c3cd3cc336096f0305" > MutableObjective< / a > ();< / div >
< div class = "line" > < a id = "l01238" name = "l01238" > < / a > < span class = "lineno" > 1238< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > j = 0; j < num_items; ++j) {< / div >
< div class = "line" > < a id = "l01239" name = "l01239" > < / a > < span class = "lineno" > 1239< / span > objective-> < a class = "code hl_function" href = "classoperations__research_1_1_m_p_objective.html#a2def997791a2a5119c3502aa68c34181" > SetCoefficient< / a > (variables.at(j), -profits_.at(j));< / div >
< div class = "line" > < a id = "l01240" name = "l01240" > < / a > < span class = "lineno" > 1240< / span > }< / div >
< div class = "line" > < a id = "l01241" name = "l01241" > < / a > < span class = "lineno" > 1241< / span > objective-> < a class = "code hl_function" href = "classoperations__research_1_1_m_p_objective.html#ac187b2ba08422f3a06b8d1e1502ceea6" > SetMinimization< / a > ();< / div >
< div class = "line" > < a id = "l01242" name = "l01242" > < / a > < span class = "lineno" > 1242< / span > < / div >
< div class = "line" > < a id = "l01243" name = "l01243" > < / a > < span class = "lineno" > 1243< / span > solver.< a class = "code hl_function" href = "classoperations__research_1_1_m_p_solver.html#ae1df08a9aabad59b5d620930126e6d91" > SuppressOutput< / a > ();< / div >
< div class = "line" > < a id = "l01244" name = "l01244" > < / a > < span class = "lineno" > 1244< / span > solver.< a class = "code hl_function" href = "classoperations__research_1_1_m_p_solver.html#acede9075c58cb2f506c99a9fe6f20303" > Solve< / a > ();< / div >
< div class = "line" > < a id = "l01245" name = "l01245" > < / a > < span class = "lineno" > 1245< / span > < / div >
< div class = "line" > < a id = "l01246" name = "l01246" > < / a > < span class = "lineno" > 1246< / span > < span class = "comment" > // Store best solution.< / span > < / div >
< div class = "line" > < a id = "l01247" name = "l01247" > < / a > < span class = "lineno" > 1247< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > float< / span > kRoundNear = 0.5;< / div >
< div class = "line" > < a id = "l01248" name = "l01248" > < / a > < span class = "lineno" > 1248< / span > best_solution_.assign(num_items, < span class = "keyword" > false< / span > );< / div >
< div class = "line" > < a id = "l01249" name = "l01249" > < / a > < span class = "lineno" > 1249< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > j = 0; j < num_items; ++j) {< / div >
< div class = "line" > < a id = "l01250" name = "l01250" > < / a > < span class = "lineno" > 1250< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > double< / span > < a class = "code hl_variable" href = "demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514" > value< / a > = variables.at(j)-> solution_value();< / div >
< div class = "line" > < a id = "l01251" name = "l01251" > < / a > < span class = "lineno" > 1251< / span > best_solution_.at(j) = < a class = "code hl_variable" href = "demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514" > value< / a > > = kRoundNear;< / div >
< div class = "line" > < a id = "l01252" name = "l01252" > < / a > < span class = "lineno" > 1252< / span > }< / div >
< div class = "line" > < a id = "l01253" name = "l01253" > < / a > < span class = "lineno" > 1253< / span > < / div >
< div class = "line" > < a id = "l01254" name = "l01254" > < / a > < span class = "lineno" > 1254< / span > < span class = "keywordflow" > return< / span > -objective-> < a class = "code hl_function" href = "classoperations__research_1_1_m_p_objective.html#a8554e97d98d05016f16300cedf2be9f6" > Value< / a > () + kRoundNear;< / div >
< div class = "line" > < a id = "l01255" name = "l01255" > < / a > < span class = "lineno" > 1255< / span > }< / div >
< div class = "line" > < a id = "l01256" name = "l01256" > < / a > < span class = "lineno" > 1256< / span > < / div >
< div class = "line" > < a id = "l01257" name = "l01257" > < / a > < span class = "lineno" > 1257< / span > < span class = "comment" > // ----- KnapsackSolver -----< / span > < / div >
< div class = "line" > < a id = "l01258" name = "l01258" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_solver.html#a6b46c35c8977efde66ae7ad97423bdf2" > 1258< / a > < / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_solver.html#a6b46c35c8977efde66ae7ad97423bdf2" > KnapsackSolver::KnapsackSolver< / a > (< span class = "keyword" > const< / span > std::string& solver_name)< / div >
< div class = "line" > < a id = "l01259" name = "l01259" > < / a > < span class = "lineno" > 1259< / span > : < a class = "code hl_class" href = "classoperations__research_1_1_knapsack_solver.html" > KnapsackSolver< / a > (KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER,< / div >
< div class = "line" > < a id = "l01260" name = "l01260" > < / a > < span class = "lineno" > 1260< / span > solver_name) {}< / div >
< div class = "line" > < a id = "l01261" name = "l01261" > < / a > < span class = "lineno" > 1261< / span > < / div >
< div class = "line" > < a id = "l01262" name = "l01262" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_solver.html#a09627cf25401a9880d2e94551ecbf993" > 1262< / a > < / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_solver.html#a6b46c35c8977efde66ae7ad97423bdf2" > KnapsackSolver::KnapsackSolver< / a > (< a class = "code hl_enumeration" href = "classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306ec" > SolverType< / a > solver_type,< / div >
< div class = "line" > < a id = "l01263" name = "l01263" > < / a > < span class = "lineno" > 1263< / span > < span class = "keyword" > const< / span > std::string& solver_name)< / div >
< div class = "line" > < a id = "l01264" name = "l01264" > < / a > < span class = "lineno" > 1264< / span > : solver_(),< / div >
< div class = "line" > < a id = "l01265" name = "l01265" > < / a > < span class = "lineno" > 1265< / span > known_value_(),< / div >
< div class = "line" > < a id = "l01266" name = "l01266" > < / a > < span class = "lineno" > 1266< / span > best_solution_(),< / div >
< div class = "line" > < a id = "l01267" name = "l01267" > < / a > < span class = "lineno" > 1267< / span > mapping_reduced_item_id_(),< / div >
< div class = "line" > < a id = "l01268" name = "l01268" > < / a > < span class = "lineno" > 1268< / span > is_problem_solved_(false),< / div >
< div class = "line" > < a id = "l01269" name = "l01269" > < / a > < span class = "lineno" > 1269< / span > additional_profit_(0LL),< / div >
< div class = "line" > < a id = "l01270" name = "l01270" > < / a > < span class = "lineno" > 1270< / span > use_reduction_(true),< / div >
< div class = "line" > < a id = "l01271" name = "l01271" > < / a > < span class = "lineno" > 1271< / span > time_limit_seconds_(< a class = "code hl_namespace" href = "namespacestd.html" > std< / a > ::numeric_limits< double> ::infinity()) {< / div >
< div class = "line" > < a id = "l01272" name = "l01272" > < / a > < span class = "lineno" > 1272< / span > < span class = "keywordflow" > switch< / span > (solver_type) {< / div >
< div class = "line" > < a id = "l01273" name = "l01273" > < / a > < span class = "lineno" > 1273< / span > < span class = "keywordflow" > case< / span > < a class = "code hl_enumvalue" href = "classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306ecac43056d6d2f96cee37fcb8a752b0ff45" > KNAPSACK_BRUTE_FORCE_SOLVER< / a > :< / div >
< div class = "line" > < a id = "l01274" name = "l01274" > < / a > < span class = "lineno" > 1274< / span > solver_ = absl::make_unique< KnapsackBruteForceSolver> (solver_name);< / div >
< div class = "line" > < a id = "l01275" name = "l01275" > < / a > < span class = "lineno" > 1275< / span > < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a id = "l01276" name = "l01276" > < / a > < span class = "lineno" > 1276< / span > < span class = "keywordflow" > case< / span > < a class = "code hl_enumvalue" href = "classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306ecaa020f211a1ff184e712aa4f372d6ea34" > KNAPSACK_64ITEMS_SOLVER< / a > :< / div >
< div class = "line" > < a id = "l01277" name = "l01277" > < / a > < span class = "lineno" > 1277< / span > solver_ = absl::make_unique< Knapsack64ItemsSolver> (solver_name);< / div >
< div class = "line" > < a id = "l01278" name = "l01278" > < / a > < span class = "lineno" > 1278< / span > < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a id = "l01279" name = "l01279" > < / a > < span class = "lineno" > 1279< / span > < span class = "keywordflow" > case< / span > < a class = "code hl_enumvalue" href = "classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306eca793d998526508cfcc2bfc89fe25b3edd" > KNAPSACK_DYNAMIC_PROGRAMMING_SOLVER< / a > :< / div >
< div class = "line" > < a id = "l01280" name = "l01280" > < / a > < span class = "lineno" > 1280< / span > solver_ =< / div >
< div class = "line" > < a id = "l01281" name = "l01281" > < / a > < span class = "lineno" > 1281< / span > absl::make_unique< KnapsackDynamicProgrammingSolver> (solver_name);< / div >
< div class = "line" > < a id = "l01282" name = "l01282" > < / a > < span class = "lineno" > 1282< / span > < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a id = "l01283" name = "l01283" > < / a > < span class = "lineno" > 1283< / span > < span class = "keywordflow" > case< / span > < a class = "code hl_enumvalue" href = "classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306eca2a4e77eec4f386d17001e7285e812a0b" > KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER< / a > :< / div >
< div class = "line" > < a id = "l01284" name = "l01284" > < / a > < span class = "lineno" > 1284< / span > solver_ = absl::make_unique< KnapsackGenericSolver> (solver_name);< / div >
< div class = "line" > < a id = "l01285" name = "l01285" > < / a > < span class = "lineno" > 1285< / span > < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a id = "l01286" name = "l01286" > < / a > < span class = "lineno" > 1286< / span > < span class = "keywordflow" > case< / span > < a class = "code hl_enumvalue" href = "classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306eca9d4c4118c9e4dc258e5052c0a457098d" > KNAPSACK_DIVIDE_AND_CONQUER_SOLVER< / a > :< / div >
< div class = "line" > < a id = "l01287" name = "l01287" > < / a > < span class = "lineno" > 1287< / span > solver_ = absl::make_unique< KnapsackDivideAndConquerSolver> (solver_name);< / div >
< div class = "line" > < a id = "l01288" name = "l01288" > < / a > < span class = "lineno" > 1288< / span > < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a id = "l01289" name = "l01289" > < / a > < span class = "lineno" > 1289< / span > < span class = "preprocessor" > #if defined(USE_CBC)< / span > < / div >
< div class = "line" > < a id = "l01290" name = "l01290" > < / a > < span class = "lineno" > 1290< / span > < span class = "keywordflow" > case< / span > < a class = "code hl_enumvalue" href = "classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306ecae2ce6e36a247621de398e875d5feb575" > KNAPSACK_MULTIDIMENSION_CBC_MIP_SOLVER< / a > :< / div >
< div class = "line" > < a id = "l01291" name = "l01291" > < / a > < span class = "lineno" > 1291< / span > solver_ = absl::make_unique< KnapsackMIPSolver> (< / div >
< div class = "line" > < a id = "l01292" name = "l01292" > < / a > < span class = "lineno" > 1292< / span > < a class = "code hl_enumvalue" href = "classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8ad183dc62c63346a3b984b93fbda0137a" > MPSolver::CBC_MIXED_INTEGER_PROGRAMMING< / a > , solver_name);< / div >
< div class = "line" > < a id = "l01293" name = "l01293" > < / a > < span class = "lineno" > 1293< / span > < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a id = "l01294" name = "l01294" > < / a > < span class = "lineno" > 1294< / span > < span class = "preprocessor" > #endif < / span > < span class = "comment" > // USE_CBC< / span > < / div >
< div class = "line" > < a id = "l01295" name = "l01295" > < / a > < span class = "lineno" > 1295< / span > < span class = "preprocessor" > #if defined(USE_SCIP)< / span > < / div >
< div class = "line" > < a id = "l01296" name = "l01296" > < / a > < span class = "lineno" > 1296< / span > < span class = "keywordflow" > case< / span > < a class = "code hl_enumvalue" href = "classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306eca1f4e1e2f80ab9c7d4fc1b14d9f5da959" > KNAPSACK_MULTIDIMENSION_SCIP_MIP_SOLVER< / a > :< / div >
< div class = "line" > < a id = "l01297" name = "l01297" > < / a > < span class = "lineno" > 1297< / span > solver_ = absl::make_unique< KnapsackMIPSolver> (< / div >
< div class = "line" > < a id = "l01298" name = "l01298" > < / a > < span class = "lineno" > 1298< / span > < a class = "code hl_enumvalue" href = "classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8a83b85675904f261c34c280b2abdcd9ae" > MPSolver::SCIP_MIXED_INTEGER_PROGRAMMING< / a > , solver_name);< / div >
< div class = "line" > < a id = "l01299" name = "l01299" > < / a > < span class = "lineno" > 1299< / span > < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a id = "l01300" name = "l01300" > < / a > < span class = "lineno" > 1300< / span > < span class = "preprocessor" > #endif < / span > < span class = "comment" > // USE_SCIP< / span > < / div >
< div class = "line" > < a id = "l01301" name = "l01301" > < / a > < span class = "lineno" > 1301< / span > < span class = "preprocessor" > #if defined(USE_XPRESS)< / span > < / div >
< div class = "line" > < a id = "l01302" name = "l01302" > < / a > < span class = "lineno" > 1302< / span > < span class = "keywordflow" > case< / span > KNAPSACK_MULTIDIMENSION_XPRESS_MIP_SOLVER:< / div >
< div class = "line" > < a id = "l01303" name = "l01303" > < / a > < span class = "lineno" > 1303< / span > solver_ = absl::make_unique< KnapsackMIPSolver> (< / div >
< div class = "line" > < a id = "l01304" name = "l01304" > < / a > < span class = "lineno" > 1304< / span > < a class = "code hl_enumvalue" href = "classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8a5a62faa5ec0ffed2abbc2d526bd53286" > MPSolver::XPRESS_MIXED_INTEGER_PROGRAMMING< / a > , solver_name);< / div >
< div class = "line" > < a id = "l01305" name = "l01305" > < / a > < span class = "lineno" > 1305< / span > < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a id = "l01306" name = "l01306" > < / a > < span class = "lineno" > 1306< / span > < span class = "preprocessor" > #endif< / span > < / div >
< div class = "line" > < a id = "l01307" name = "l01307" > < / a > < span class = "lineno" > 1307< / span > < span class = "preprocessor" > #if defined(USE_CPLEX)< / span > < / div >
< div class = "line" > < a id = "l01308" name = "l01308" > < / a > < span class = "lineno" > 1308< / span > < span class = "keywordflow" > case< / span > KNAPSACK_MULTIDIMENSION_CPLEX_MIP_SOLVER:< / div >
< div class = "line" > < a id = "l01309" name = "l01309" > < / a > < span class = "lineno" > 1309< / span > solver_ = absl::make_unique< KnapsackMIPSolver> (< / div >
< div class = "line" > < a id = "l01310" name = "l01310" > < / a > < span class = "lineno" > 1310< / span > < a class = "code hl_enumvalue" href = "classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8a223fb1b5c8d153d5fef50b8d6f0426e9" > MPSolver::CPLEX_MIXED_INTEGER_PROGRAMMING< / a > , solver_name);< / div >
< div class = "line" > < a id = "l01311" name = "l01311" > < / a > < span class = "lineno" > 1311< / span > < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a id = "l01312" name = "l01312" > < / a > < span class = "lineno" > 1312< / span > < span class = "preprocessor" > #endif< / span > < / div >
< div class = "line" > < a id = "l01313" name = "l01313" > < / a > < span class = "lineno" > 1313< / span > < span class = "keywordflow" > default< / span > :< / div >
< div class = "line" > < a id = "l01314" name = "l01314" > < / a > < span class = "lineno" > 1314< / span > < a class = "code hl_define" href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > (< a class = "code hl_variable" href = "log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda" > FATAL< / a > ) < < < span class = "stringliteral" > " Unknown knapsack solver type." < / span > ;< / div >
< div class = "line" > < a id = "l01315" name = "l01315" > < / a > < span class = "lineno" > 1315< / span > }< / div >
< div class = "line" > < a id = "l01316" name = "l01316" > < / a > < span class = "lineno" > 1316< / span > }< / div >
< div class = "line" > < a id = "l01317" name = "l01317" > < / a > < span class = "lineno" > 1317< / span > < / div >
< div class = "line" > < a id = "l01318" name = "l01318" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_solver.html#abb19dddb08cf912baec8995cfd2f1f42" > 1318< / a > < / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_solver.html#abb19dddb08cf912baec8995cfd2f1f42" > KnapsackSolver::~KnapsackSolver< / a > () {}< / div >
< div class = "line" > < a id = "l01319" name = "l01319" > < / a > < span class = "lineno" > 1319< / span > < / div >
< div class = "line" > < a id = "l01320" name = "l01320" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_solver.html#ae5982edf1a2974495d20201775a765e2" > 1320< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_solver.html#ae5982edf1a2974495d20201775a765e2" > KnapsackSolver::Init< / a > (< span class = "keyword" > const< / span > std::vector< int64_t> & profits,< / div >
< div class = "line" > < a id = "l01321" name = "l01321" > < / a > < span class = "lineno" > 1321< / span > < span class = "keyword" > const< / span > std::vector< std::vector< int64_t> > & weights,< / div >
< div class = "line" > < a id = "l01322" name = "l01322" > < / a > < span class = "lineno" > 1322< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & capacities) {< / div >
< div class = "line" > < a id = "l01323" name = "l01323" > < / a > < span class = "lineno" > 1323< / span > < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > std::vector< int64_t> & w : weights) {< / div >
< div class = "line" > < a id = "l01324" name = "l01324" > < / a > < span class = "lineno" > 1324< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (profits.size(), w.size())< / div >
< div class = "line" > < a id = "l01325" name = "l01325" > < / a > < span class = "lineno" > 1325< / span > < < < span class = "stringliteral" > " Profits and inner weights must have the same size (#items)" < / span > ;< / div >
< div class = "line" > < a id = "l01326" name = "l01326" > < / a > < span class = "lineno" > 1326< / span > }< / div >
< div class = "line" > < a id = "l01327" name = "l01327" > < / a > < span class = "lineno" > 1327< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (capacities.size(), weights.size())< / div >
< div class = "line" > < a id = "l01328" name = "l01328" > < / a > < span class = "lineno" > 1328< / span > < < < span class = "stringliteral" > " Capacities and weights must have the same size (#bins)" < / span > ;< / div >
< div class = "line" > < a id = "l01329" name = "l01329" > < / a > < span class = "lineno" > 1329< / span > time_limit_ = absl::make_unique< TimeLimit> (time_limit_seconds_);< / div >
< div class = "line" > < a id = "l01330" name = "l01330" > < / a > < span class = "lineno" > 1330< / span > is_solution_optimal_ = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a id = "l01331" name = "l01331" > < / a > < span class = "lineno" > 1331< / span > additional_profit_ = 0LL;< / div >
< div class = "line" > < a id = "l01332" name = "l01332" > < / a > < span class = "lineno" > 1332< / span > is_problem_solved_ = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a id = "l01333" name = "l01333" > < / a > < span class = "lineno" > 1333< / span > < / div >
< div class = "line" > < a id = "l01334" name = "l01334" > < / a > < span class = "lineno" > 1334< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_items = profits.size();< / div >
< div class = "line" > < a id = "l01335" name = "l01335" > < / a > < span class = "lineno" > 1335< / span > std::vector< std::vector< int64_t> > reduced_weights;< / div >
< div class = "line" > < a id = "l01336" name = "l01336" > < / a > < span class = "lineno" > 1336< / span > std::vector< int64_t> reduced_capacities;< / div >
< div class = "line" > < a id = "l01337" name = "l01337" > < / a > < span class = "lineno" > 1337< / span > < span class = "keywordflow" > if< / span > (use_reduction_) {< / div >
< div class = "line" > < a id = "l01338" name = "l01338" > < / a > < span class = "lineno" > 1338< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_reduced_items = ReduceCapacities(< / div >
< div class = "line" > < a id = "l01339" name = "l01339" > < / a > < span class = "lineno" > 1339< / span > num_items, weights, capacities, & reduced_weights, & reduced_capacities);< / div >
< div class = "line" > < a id = "l01340" name = "l01340" > < / a > < span class = "lineno" > 1340< / span > < span class = "keywordflow" > if< / span > (num_reduced_items > 0) {< / div >
< div class = "line" > < a id = "l01341" name = "l01341" > < / a > < span class = "lineno" > 1341< / span > ComputeAdditionalProfit(profits);< / div >
< div class = "line" > < a id = "l01342" name = "l01342" > < / a > < span class = "lineno" > 1342< / span > }< / div >
< div class = "line" > < a id = "l01343" name = "l01343" > < / a > < span class = "lineno" > 1343< / span > } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a id = "l01344" name = "l01344" > < / a > < span class = "lineno" > 1344< / span > reduced_weights = weights;< / div >
< div class = "line" > < a id = "l01345" name = "l01345" > < / a > < span class = "lineno" > 1345< / span > reduced_capacities = capacities;< / div >
< div class = "line" > < a id = "l01346" name = "l01346" > < / a > < span class = "lineno" > 1346< / span > }< / div >
< div class = "line" > < a id = "l01347" name = "l01347" > < / a > < span class = "lineno" > 1347< / span > < span class = "keywordflow" > if< / span > (!is_problem_solved_) {< / div >
< div class = "line" > < a id = "l01348" name = "l01348" > < / a > < span class = "lineno" > 1348< / span > solver_-> Init(profits, reduced_weights, reduced_capacities);< / div >
< div class = "line" > < a id = "l01349" name = "l01349" > < / a > < span class = "lineno" > 1349< / span > < span class = "keywordflow" > if< / span > (use_reduction_) {< / div >
< div class = "line" > < a id = "l01350" name = "l01350" > < / a > < span class = "lineno" > 1350< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_reduced_items = ReduceProblem(num_items);< / div >
< div class = "line" > < a id = "l01351" name = "l01351" > < / a > < span class = "lineno" > 1351< / span > < / div >
< div class = "line" > < a id = "l01352" name = "l01352" > < / a > < span class = "lineno" > 1352< / span > < span class = "keywordflow" > if< / span > (num_reduced_items > 0) {< / div >
< div class = "line" > < a id = "l01353" name = "l01353" > < / a > < span class = "lineno" > 1353< / span > ComputeAdditionalProfit(profits);< / div >
< div class = "line" > < a id = "l01354" name = "l01354" > < / a > < span class = "lineno" > 1354< / span > }< / div >
< div class = "line" > < a id = "l01355" name = "l01355" > < / a > < span class = "lineno" > 1355< / span > < / div >
< div class = "line" > < a id = "l01356" name = "l01356" > < / a > < span class = "lineno" > 1356< / span > < span class = "keywordflow" > if< / span > (num_reduced_items > 0 & & num_reduced_items < num_items) {< / div >
< div class = "line" > < a id = "l01357" name = "l01357" > < / a > < span class = "lineno" > 1357< / span > InitReducedProblem(profits, reduced_weights, reduced_capacities);< / div >
< div class = "line" > < a id = "l01358" name = "l01358" > < / a > < span class = "lineno" > 1358< / span > }< / div >
< div class = "line" > < a id = "l01359" name = "l01359" > < / a > < span class = "lineno" > 1359< / span > }< / div >
< div class = "line" > < a id = "l01360" name = "l01360" > < / a > < span class = "lineno" > 1360< / span > }< / div >
< div class = "line" > < a id = "l01361" name = "l01361" > < / a > < span class = "lineno" > 1361< / span > < span class = "keywordflow" > if< / span > (is_problem_solved_) {< / div >
< div class = "line" > < a id = "l01362" name = "l01362" > < / a > < span class = "lineno" > 1362< / span > is_solution_optimal_ = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l01363" name = "l01363" > < / a > < span class = "lineno" > 1363< / span > }< / div >
< div class = "line" > < a id = "l01364" name = "l01364" > < / a > < span class = "lineno" > 1364< / span > }< / div >
< div class = "line" > < a id = "l01365" name = "l01365" > < / a > < span class = "lineno" > 1365< / span > < / div >
< div class = "line" > < a id = "l01366" name = "l01366" > < / a > < span class = "lineno" > 1366< / span > < span class = "keywordtype" > int< / span > KnapsackSolver::ReduceCapacities(< / div >
< div class = "line" > < a id = "l01367" name = "l01367" > < / a > < span class = "lineno" > 1367< / span > < span class = "keywordtype" > int< / span > num_items, < span class = "keyword" > const< / span > std::vector< std::vector< int64_t> > & weights,< / div >
< div class = "line" > < a id = "l01368" name = "l01368" > < / a > < span class = "lineno" > 1368< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & capacities,< / div >
< div class = "line" > < a id = "l01369" name = "l01369" > < / a > < span class = "lineno" > 1369< / span > std::vector< std::vector< int64_t> > * reduced_weights,< / div >
< div class = "line" > < a id = "l01370" name = "l01370" > < / a > < span class = "lineno" > 1370< / span > std::vector< int64_t> * reduced_capacities) {< / div >
< div class = "line" > < a id = "l01371" name = "l01371" > < / a > < span class = "lineno" > 1371< / span > known_value_.assign(num_items, < span class = "keyword" > false< / span > );< / div >
< div class = "line" > < a id = "l01372" name = "l01372" > < / a > < span class = "lineno" > 1372< / span > best_solution_.assign(num_items, < span class = "keyword" > false< / span > );< / div >
< div class = "line" > < a id = "l01373" name = "l01373" > < / a > < span class = "lineno" > 1373< / span > mapping_reduced_item_id_.assign(num_items, 0);< / div >
< div class = "line" > < a id = "l01374" name = "l01374" > < / a > < span class = "lineno" > 1374< / span > std::vector< bool> active_capacities(weights.size(), < span class = "keyword" > true< / span > );< / div >
< div class = "line" > < a id = "l01375" name = "l01375" > < / a > < span class = "lineno" > 1375< / span > < span class = "keywordtype" > int< / span > number_of_active_capacities = 0;< / div >
< div class = "line" > < a id = "l01376" name = "l01376" > < / a > < span class = "lineno" > 1376< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < weights.size(); ++i) {< / div >
< div class = "line" > < a id = "l01377" name = "l01377" > < / a > < span class = "lineno" > 1377< / span > int64_t max_weight = 0;< / div >
< div class = "line" > < a id = "l01378" name = "l01378" > < / a > < span class = "lineno" > 1378< / span > < span class = "keywordflow" > for< / span > (int64_t < a class = "code hl_variable" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > : weights[i]) {< / div >
< div class = "line" > < a id = "l01379" name = "l01379" > < / a > < span class = "lineno" > 1379< / span > max_weight += < a class = "code hl_variable" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > ;< / div >
< div class = "line" > < a id = "l01380" name = "l01380" > < / a > < span class = "lineno" > 1380< / span > }< / div >
< div class = "line" > < a id = "l01381" name = "l01381" > < / a > < span class = "lineno" > 1381< / span > < span class = "keywordflow" > if< / span > (max_weight < = capacities[i]) {< / div >
< div class = "line" > < a id = "l01382" name = "l01382" > < / a > < span class = "lineno" > 1382< / span > active_capacities[i] = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a id = "l01383" name = "l01383" > < / a > < span class = "lineno" > 1383< / span > } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a id = "l01384" name = "l01384" > < / a > < span class = "lineno" > 1384< / span > ++number_of_active_capacities;< / div >
< div class = "line" > < a id = "l01385" name = "l01385" > < / a > < span class = "lineno" > 1385< / span > }< / div >
< div class = "line" > < a id = "l01386" name = "l01386" > < / a > < span class = "lineno" > 1386< / span > }< / div >
< div class = "line" > < a id = "l01387" name = "l01387" > < / a > < span class = "lineno" > 1387< / span > reduced_weights-> reserve(number_of_active_capacities);< / div >
< div class = "line" > < a id = "l01388" name = "l01388" > < / a > < span class = "lineno" > 1388< / span > reduced_capacities-> reserve(number_of_active_capacities);< / div >
< div class = "line" > < a id = "l01389" name = "l01389" > < / a > < span class = "lineno" > 1389< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < weights.size(); ++i) {< / div >
< div class = "line" > < a id = "l01390" name = "l01390" > < / a > < span class = "lineno" > 1390< / span > < span class = "keywordflow" > if< / span > (active_capacities[i]) {< / div >
< div class = "line" > < a id = "l01391" name = "l01391" > < / a > < span class = "lineno" > 1391< / span > reduced_weights-> push_back(weights[i]);< / div >
< div class = "line" > < a id = "l01392" name = "l01392" > < / a > < span class = "lineno" > 1392< / span > reduced_capacities-> push_back(capacities[i]);< / div >
< div class = "line" > < a id = "l01393" name = "l01393" > < / a > < span class = "lineno" > 1393< / span > }< / div >
< div class = "line" > < a id = "l01394" name = "l01394" > < / a > < span class = "lineno" > 1394< / span > }< / div >
< div class = "line" > < a id = "l01395" name = "l01395" > < / a > < span class = "lineno" > 1395< / span > < span class = "keywordflow" > if< / span > (reduced_capacities-> empty()) {< / div >
< div class = "line" > < a id = "l01396" name = "l01396" > < / a > < span class = "lineno" > 1396< / span > < span class = "comment" > // There are no capacity constraints in the problem so we can reduce all< / span > < / div >
< div class = "line" > < a id = "l01397" name = "l01397" > < / a > < span class = "lineno" > 1397< / span > < span class = "comment" > // items and just add them to the best solution.< / span > < / div >
< div class = "line" > < a id = "l01398" name = "l01398" > < / a > < span class = "lineno" > 1398< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > item_id = 0; item_id < num_items; ++item_id) {< / div >
< div class = "line" > < a id = "l01399" name = "l01399" > < / a > < span class = "lineno" > 1399< / span > known_value_[item_id] = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l01400" name = "l01400" > < / a > < span class = "lineno" > 1400< / span > best_solution_[item_id] = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l01401" name = "l01401" > < / a > < span class = "lineno" > 1401< / span > }< / div >
< div class = "line" > < a id = "l01402" name = "l01402" > < / a > < span class = "lineno" > 1402< / span > is_problem_solved_ = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l01403" name = "l01403" > < / a > < span class = "lineno" > 1403< / span > < span class = "comment" > // All items are reduced.< / span > < / div >
< div class = "line" > < a id = "l01404" name = "l01404" > < / a > < span class = "lineno" > 1404< / span > < span class = "keywordflow" > return< / span > num_items;< / div >
< div class = "line" > < a id = "l01405" name = "l01405" > < / a > < span class = "lineno" > 1405< / span > }< / div >
< div class = "line" > < a id = "l01406" name = "l01406" > < / a > < span class = "lineno" > 1406< / span > < span class = "comment" > // There are still capacity constraints so no item reduction is done.< / span > < / div >
< div class = "line" > < a id = "l01407" name = "l01407" > < / a > < span class = "lineno" > 1407< / span > < span class = "keywordflow" > return< / span > 0;< / div >
< div class = "line" > < a id = "l01408" name = "l01408" > < / a > < span class = "lineno" > 1408< / span > }< / div >
< div class = "line" > < a id = "l01409" name = "l01409" > < / a > < span class = "lineno" > 1409< / span > < / div >
< div class = "line" > < a id = "l01410" name = "l01410" > < / a > < span class = "lineno" > 1410< / span > < span class = "keywordtype" > int< / span > KnapsackSolver::ReduceProblem(< span class = "keywordtype" > int< / span > num_items) {< / div >
< div class = "line" > < a id = "l01411" name = "l01411" > < / a > < span class = "lineno" > 1411< / span > known_value_.assign(num_items, < span class = "keyword" > false< / span > );< / div >
< div class = "line" > < a id = "l01412" name = "l01412" > < / a > < span class = "lineno" > 1412< / span > best_solution_.assign(num_items, < span class = "keyword" > false< / span > );< / div >
< div class = "line" > < a id = "l01413" name = "l01413" > < / a > < span class = "lineno" > 1413< / span > mapping_reduced_item_id_.assign(num_items, 0);< / div >
< div class = "line" > < a id = "l01414" name = "l01414" > < / a > < span class = "lineno" > 1414< / span > additional_profit_ = 0LL;< / div >
< div class = "line" > < a id = "l01415" name = "l01415" > < / a > < span class = "lineno" > 1415< / span > < / div >
< div class = "line" > < a id = "l01416" name = "l01416" > < / a > < span class = "lineno" > 1416< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > item_id = 0; item_id < num_items; ++item_id) {< / div >
< div class = "line" > < a id = "l01417" name = "l01417" > < / a > < span class = "lineno" > 1417< / span > mapping_reduced_item_id_[item_id] = item_id;< / div >
< div class = "line" > < a id = "l01418" name = "l01418" > < / a > < span class = "lineno" > 1418< / span > }< / div >
< div class = "line" > < a id = "l01419" name = "l01419" > < / a > < span class = "lineno" > 1419< / span > < / div >
< div class = "line" > < a id = "l01420" name = "l01420" > < / a > < span class = "lineno" > 1420< / span > int64_t best_lower_bound = 0LL;< / div >
< div class = "line" > < a id = "l01421" name = "l01421" > < / a > < span class = "lineno" > 1421< / span > std::vector< int64_t> J0_upper_bounds(num_items,< / div >
< div class = "line" > < a id = "l01422" name = "l01422" > < / a > < span class = "lineno" > 1422< / span > < a class = "code hl_variable" href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > std::numeric_limits< int64_t> ::max< / a > ());< / div >
< div class = "line" > < a id = "l01423" name = "l01423" > < / a > < span class = "lineno" > 1423< / span > std::vector< int64_t> J1_upper_bounds(num_items,< / div >
< div class = "line" > < a id = "l01424" name = "l01424" > < / a > < span class = "lineno" > 1424< / span > < a class = "code hl_variable" href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > std::numeric_limits< int64_t> ::max< / a > ());< / div >
< div class = "line" > < a id = "l01425" name = "l01425" > < / a > < span class = "lineno" > 1425< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > item_id = 0; item_id < num_items; ++item_id) {< / div >
< div class = "line" > < a id = "l01426" name = "l01426" > < / a > < span class = "lineno" > 1426< / span > < span class = "keywordflow" > if< / span > (time_limit_-> LimitReached()) {< / div >
< div class = "line" > < a id = "l01427" name = "l01427" > < / a > < span class = "lineno" > 1427< / span > < span class = "keywordflow" > break< / span > ;< / div >
< div class = "line" > < a id = "l01428" name = "l01428" > < / a > < span class = "lineno" > 1428< / span > }< / div >
< div class = "line" > < a id = "l01429" name = "l01429" > < / a > < span class = "lineno" > 1429< / span > int64_t < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > = 0LL;< / div >
< div class = "line" > < a id = "l01430" name = "l01430" > < / a > < span class = "lineno" > 1430< / span > int64_t < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > = < a class = "code hl_variable" href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > std::numeric_limits< int64_t> ::max< / a > ();< / div >
< div class = "line" > < a id = "l01431" name = "l01431" > < / a > < span class = "lineno" > 1431< / span > solver_-> GetLowerAndUpperBoundWhenItem(item_id, < span class = "keyword" > false< / span > , & < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > ,< / div >
< div class = "line" > < a id = "l01432" name = "l01432" > < / a > < span class = "lineno" > 1432< / span > & < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > );< / div >
< div class = "line" > < a id = "l01433" name = "l01433" > < / a > < span class = "lineno" > 1433< / span > J1_upper_bounds.at(item_id) = < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > ;< / div >
< div class = "line" > < a id = "l01434" name = "l01434" > < / a > < span class = "lineno" > 1434< / span > best_lower_bound = < a class = "code hl_variable" href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > std::max< / a > (best_lower_bound, < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > );< / div >
< div class = "line" > < a id = "l01435" name = "l01435" > < / a > < span class = "lineno" > 1435< / span > < / div >
< div class = "line" > < a id = "l01436" name = "l01436" > < / a > < span class = "lineno" > 1436< / span > solver_-> GetLowerAndUpperBoundWhenItem(item_id, < span class = "keyword" > true< / span > , & < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > ,< / div >
< div class = "line" > < a id = "l01437" name = "l01437" > < / a > < span class = "lineno" > 1437< / span > & < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > );< / div >
< div class = "line" > < a id = "l01438" name = "l01438" > < / a > < span class = "lineno" > 1438< / span > J0_upper_bounds.at(item_id) = < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > ;< / div >
< div class = "line" > < a id = "l01439" name = "l01439" > < / a > < span class = "lineno" > 1439< / span > best_lower_bound = < a class = "code hl_variable" href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > std::max< / a > (best_lower_bound, < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > );< / div >
< div class = "line" > < a id = "l01440" name = "l01440" > < / a > < span class = "lineno" > 1440< / span > }< / div >
< div class = "line" > < a id = "l01441" name = "l01441" > < / a > < span class = "lineno" > 1441< / span > < / div >
< div class = "line" > < a id = "l01442" name = "l01442" > < / a > < span class = "lineno" > 1442< / span > < span class = "keywordtype" > int< / span > num_reduced_items = 0;< / div >
< div class = "line" > < a id = "l01443" name = "l01443" > < / a > < span class = "lineno" > 1443< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > item_id = 0; item_id < num_items; ++item_id) {< / div >
< div class = "line" > < a id = "l01444" name = "l01444" > < / a > < span class = "lineno" > 1444< / span > < span class = "keywordflow" > if< / span > (best_lower_bound > J0_upper_bounds[item_id]) {< / div >
< div class = "line" > < a id = "l01445" name = "l01445" > < / a > < span class = "lineno" > 1445< / span > known_value_[item_id] = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l01446" name = "l01446" > < / a > < span class = "lineno" > 1446< / span > best_solution_[item_id] = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a id = "l01447" name = "l01447" > < / a > < span class = "lineno" > 1447< / span > ++num_reduced_items;< / div >
< div class = "line" > < a id = "l01448" name = "l01448" > < / a > < span class = "lineno" > 1448< / span > } < span class = "keywordflow" > else< / span > < span class = "keywordflow" > if< / span > (best_lower_bound > J1_upper_bounds[item_id]) {< / div >
< div class = "line" > < a id = "l01449" name = "l01449" > < / a > < span class = "lineno" > 1449< / span > known_value_[item_id] = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l01450" name = "l01450" > < / a > < span class = "lineno" > 1450< / span > best_solution_[item_id] = < span class = "keyword" > true< / span > ;< / div >
< div class = "line" > < a id = "l01451" name = "l01451" > < / a > < span class = "lineno" > 1451< / span > ++num_reduced_items;< / div >
< div class = "line" > < a id = "l01452" name = "l01452" > < / a > < span class = "lineno" > 1452< / span > }< / div >
< div class = "line" > < a id = "l01453" name = "l01453" > < / a > < span class = "lineno" > 1453< / span > }< / div >
< div class = "line" > < a id = "l01454" name = "l01454" > < / a > < span class = "lineno" > 1454< / span > < / div >
< div class = "line" > < a id = "l01455" name = "l01455" > < / a > < span class = "lineno" > 1455< / span > is_problem_solved_ = num_reduced_items == num_items;< / div >
< div class = "line" > < a id = "l01456" name = "l01456" > < / a > < span class = "lineno" > 1456< / span > < span class = "keywordflow" > return< / span > num_reduced_items;< / div >
< div class = "line" > < a id = "l01457" name = "l01457" > < / a > < span class = "lineno" > 1457< / span > }< / div >
< div class = "line" > < a id = "l01458" name = "l01458" > < / a > < span class = "lineno" > 1458< / span > < / div >
< div class = "line" > < a id = "l01459" name = "l01459" > < / a > < span class = "lineno" > 1459< / span > < span class = "keywordtype" > void< / span > KnapsackSolver::ComputeAdditionalProfit(< / div >
< div class = "line" > < a id = "l01460" name = "l01460" > < / a > < span class = "lineno" > 1460< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & profits) {< / div >
< div class = "line" > < a id = "l01461" name = "l01461" > < / a > < span class = "lineno" > 1461< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_items = profits.size();< / div >
< div class = "line" > < a id = "l01462" name = "l01462" > < / a > < span class = "lineno" > 1462< / span > additional_profit_ = 0LL;< / div >
< div class = "line" > < a id = "l01463" name = "l01463" > < / a > < span class = "lineno" > 1463< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > item_id = 0; item_id < num_items; ++item_id) {< / div >
< div class = "line" > < a id = "l01464" name = "l01464" > < / a > < span class = "lineno" > 1464< / span > < span class = "keywordflow" > if< / span > (known_value_[item_id] & & best_solution_[item_id]) {< / div >
< div class = "line" > < a id = "l01465" name = "l01465" > < / a > < span class = "lineno" > 1465< / span > additional_profit_ += profits[item_id];< / div >
< div class = "line" > < a id = "l01466" name = "l01466" > < / a > < span class = "lineno" > 1466< / span > }< / div >
< div class = "line" > < a id = "l01467" name = "l01467" > < / a > < span class = "lineno" > 1467< / span > }< / div >
< div class = "line" > < a id = "l01468" name = "l01468" > < / a > < span class = "lineno" > 1468< / span > }< / div >
< div class = "line" > < a id = "l01469" name = "l01469" > < / a > < span class = "lineno" > 1469< / span > < / div >
< div class = "line" > < a id = "l01470" name = "l01470" > < / a > < span class = "lineno" > 1470< / span > < span class = "keywordtype" > void< / span > KnapsackSolver::InitReducedProblem(< / div >
< div class = "line" > < a id = "l01471" name = "l01471" > < / a > < span class = "lineno" > 1471< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & profits,< / div >
< div class = "line" > < a id = "l01472" name = "l01472" > < / a > < span class = "lineno" > 1472< / span > < span class = "keyword" > const< / span > std::vector< std::vector< int64_t> > & weights,< / div >
< div class = "line" > < a id = "l01473" name = "l01473" > < / a > < span class = "lineno" > 1473< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & capacities) {< / div >
< div class = "line" > < a id = "l01474" name = "l01474" > < / a > < span class = "lineno" > 1474< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_items = profits.size();< / div >
< div class = "line" > < a id = "l01475" name = "l01475" > < / a > < span class = "lineno" > 1475< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_dimensions = capacities.size();< / div >
< div class = "line" > < a id = "l01476" name = "l01476" > < / a > < span class = "lineno" > 1476< / span > < / div >
< div class = "line" > < a id = "l01477" name = "l01477" > < / a > < span class = "lineno" > 1477< / span > std::vector< int64_t> reduced_profits;< / div >
< div class = "line" > < a id = "l01478" name = "l01478" > < / a > < span class = "lineno" > 1478< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > item_id = 0; item_id < num_items; ++item_id) {< / div >
< div class = "line" > < a id = "l01479" name = "l01479" > < / a > < span class = "lineno" > 1479< / span > < span class = "keywordflow" > if< / span > (!known_value_[item_id]) {< / div >
< div class = "line" > < a id = "l01480" name = "l01480" > < / a > < span class = "lineno" > 1480< / span > mapping_reduced_item_id_[item_id] = reduced_profits.size();< / div >
< div class = "line" > < a id = "l01481" name = "l01481" > < / a > < span class = "lineno" > 1481< / span > reduced_profits.push_back(profits[item_id]);< / div >
< div class = "line" > < a id = "l01482" name = "l01482" > < / a > < span class = "lineno" > 1482< / span > }< / div >
< div class = "line" > < a id = "l01483" name = "l01483" > < / a > < span class = "lineno" > 1483< / span > }< / div >
< div class = "line" > < a id = "l01484" name = "l01484" > < / a > < span class = "lineno" > 1484< / span > < / div >
< div class = "line" > < a id = "l01485" name = "l01485" > < / a > < span class = "lineno" > 1485< / span > std::vector< std::vector< int64_t> > reduced_weights;< / div >
< div class = "line" > < a id = "l01486" name = "l01486" > < / a > < span class = "lineno" > 1486< / span > std::vector< int64_t> reduced_capacities = capacities;< / div >
< div class = "line" > < a id = "l01487" name = "l01487" > < / a > < span class = "lineno" > 1487< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > dim = 0; dim < num_dimensions; ++dim) {< / div >
< div class = "line" > < a id = "l01488" name = "l01488" > < / a > < span class = "lineno" > 1488< / span > < span class = "keyword" > const< / span > std::vector< int64_t> & one_dimension_weights = weights[dim];< / div >
< div class = "line" > < a id = "l01489" name = "l01489" > < / a > < span class = "lineno" > 1489< / span > std::vector< int64_t> one_dimension_reduced_weights;< / div >
< div class = "line" > < a id = "l01490" name = "l01490" > < / a > < span class = "lineno" > 1490< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > item_id = 0; item_id < num_items; ++item_id) {< / div >
< div class = "line" > < a id = "l01491" name = "l01491" > < / a > < span class = "lineno" > 1491< / span > < span class = "keywordflow" > if< / span > (known_value_[item_id]) {< / div >
< div class = "line" > < a id = "l01492" name = "l01492" > < / a > < span class = "lineno" > 1492< / span > < span class = "keywordflow" > if< / span > (best_solution_[item_id]) {< / div >
< div class = "line" > < a id = "l01493" name = "l01493" > < / a > < span class = "lineno" > 1493< / span > reduced_capacities[dim] -= one_dimension_weights[item_id];< / div >
< div class = "line" > < a id = "l01494" name = "l01494" > < / a > < span class = "lineno" > 1494< / span > }< / div >
< div class = "line" > < a id = "l01495" name = "l01495" > < / a > < span class = "lineno" > 1495< / span > } < span class = "keywordflow" > else< / span > {< / div >
< div class = "line" > < a id = "l01496" name = "l01496" > < / a > < span class = "lineno" > 1496< / span > one_dimension_reduced_weights.push_back(one_dimension_weights[item_id]);< / div >
< div class = "line" > < a id = "l01497" name = "l01497" > < / a > < span class = "lineno" > 1497< / span > }< / div >
< div class = "line" > < a id = "l01498" name = "l01498" > < / a > < span class = "lineno" > 1498< / span > }< / div >
< div class = "line" > < a id = "l01499" name = "l01499" > < / a > < span class = "lineno" > 1499< / span > reduced_weights.push_back(one_dimension_reduced_weights);< / div >
< div class = "line" > < a id = "l01500" name = "l01500" > < / a > < span class = "lineno" > 1500< / span > }< / div >
< div class = "line" > < a id = "l01501" name = "l01501" > < / a > < span class = "lineno" > 1501< / span > solver_-> Init(reduced_profits, reduced_weights, reduced_capacities);< / div >
< div class = "line" > < a id = "l01502" name = "l01502" > < / a > < span class = "lineno" > 1502< / span > }< / div >
< div class = "line" > < a id = "l01503" name = "l01503" > < / a > < span class = "lineno" > 1503< / span > < / div >
< div class = "line" > < a id = "l01504" name = "l01504" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_solver.html#a7f5467b49f2cba3d8804e44ed76e12a2" > 1504< / a > < / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_solver.html#a7f5467b49f2cba3d8804e44ed76e12a2" > KnapsackSolver::Solve< / a > () {< / div >
< div class = "line" > < a id = "l01505" name = "l01505" > < / a > < span class = "lineno" > 1505< / span > < span class = "keywordflow" > return< / span > additional_profit_ +< / div >
< div class = "line" > < a id = "l01506" name = "l01506" > < / a > < span class = "lineno" > 1506< / span > ((is_problem_solved_)< / div >
< div class = "line" > < a id = "l01507" name = "l01507" > < / a > < span class = "lineno" > 1507< / span > ? 0< / div >
< div class = "line" > < a id = "l01508" name = "l01508" > < / a > < span class = "lineno" > 1508< / span > : solver_-> Solve(time_limit_.get(), & is_solution_optimal_));< / div >
< div class = "line" > < a id = "l01509" name = "l01509" > < / a > < span class = "lineno" > 1509< / span > }< / div >
< div class = "line" > < a id = "l01510" name = "l01510" > < / a > < span class = "lineno" > 1510< / span > < / div >
< div class = "line" > < a id = "l01511" name = "l01511" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_solver.html#a57d88f584d14b161580550918c8fbf3b" > 1511< / a > < / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_solver.html#a57d88f584d14b161580550918c8fbf3b" > KnapsackSolver::BestSolutionContains< / a > (< span class = "keywordtype" > int< / span > item_id)< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a id = "l01512" name = "l01512" > < / a > < span class = "lineno" > 1512< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > mapped_item_id =< / div >
< div class = "line" > < a id = "l01513" name = "l01513" > < / a > < span class = "lineno" > 1513< / span > (use_reduction_) ? mapping_reduced_item_id_[item_id] : item_id;< / div >
< div class = "line" > < a id = "l01514" name = "l01514" > < / a > < span class = "lineno" > 1514< / span > < span class = "keywordflow" > return< / span > (use_reduction_ & & known_value_[item_id])< / div >
< div class = "line" > < a id = "l01515" name = "l01515" > < / a > < span class = "lineno" > 1515< / span > ? best_solution_[item_id]< / div >
< div class = "line" > < a id = "l01516" name = "l01516" > < / a > < span class = "lineno" > 1516< / span > : solver_-> best_solution(mapped_item_id);< / div >
< div class = "line" > < a id = "l01517" name = "l01517" > < / a > < span class = "lineno" > 1517< / span > }< / div >
< div class = "line" > < a id = "l01518" name = "l01518" > < / a > < span class = "lineno" > 1518< / span > < / div >
< div class = "line" > < a id = "l01519" name = "l01519" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_knapsack_solver.html#a9a98946a64f3893b085f650932c9dfee" > 1519< / a > < / span > std::string < a class = "code hl_function" href = "classoperations__research_1_1_knapsack_solver.html#a9a98946a64f3893b085f650932c9dfee" > KnapsackSolver::GetName< / a > ()< span class = "keyword" > const < / span > { < span class = "keywordflow" > return< / span > solver_-> GetName(); }< / div >
< div class = "line" > < a id = "l01520" name = "l01520" > < / a > < span class = "lineno" > 1520< / span > < / div >
< div class = "line" > < a id = "l01521" name = "l01521" > < / a > < span class = "lineno" > 1521< / span > < span class = "comment" > // ----- BaseKnapsackSolver -----< / span > < / div >
< div class = "line" > < a id = "l01522" name = "l01522" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1_base_knapsack_solver.html#a4b0049f92bd893d89f1c03ec066d72af" > 1522< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1_base_knapsack_solver.html#a4b0049f92bd893d89f1c03ec066d72af" > BaseKnapsackSolver::GetLowerAndUpperBoundWhenItem< / a > (< span class = "keywordtype" > int< / span > item_id,< / div >
< div class = "line" > < a id = "l01523" name = "l01523" > < / a > < span class = "lineno" > 1523< / span > < span class = "keywordtype" > bool< / span > is_item_in,< / div >
< div class = "line" > < a id = "l01524" name = "l01524" > < / a > < span class = "lineno" > 1524< / span > int64_t* < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > ,< / div >
< div class = "line" > < a id = "l01525" name = "l01525" > < / a > < span class = "lineno" > 1525< / span > int64_t* < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > ) {< / div >
< div class = "line" > < a id = "l01526" name = "l01526" > < / a > < span class = "lineno" > 1526< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > != < span class = "keyword" > nullptr< / span > );< / div >
< div class = "line" > < a id = "l01527" name = "l01527" > < / a > < span class = "lineno" > 1527< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > != < span class = "keyword" > nullptr< / span > );< / div >
< div class = "line" > < a id = "l01528" name = "l01528" > < / a > < span class = "lineno" > 1528< / span > *< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > = 0LL;< / div >
< div class = "line" > < a id = "l01529" name = "l01529" > < / a > < span class = "lineno" > 1529< / span > *< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > = < a class = "code hl_variable" href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > std::numeric_limits< int64_t> ::max< / a > ();< / div >
< div class = "line" > < a id = "l01530" name = "l01530" > < / a > < span class = "lineno" > 1530< / span > }< / div >
< div class = "line" > < a id = "l01531" name = "l01531" > < / a > < span class = "lineno" > 1531< / span > < / div >
< div class = "line" > < a id = "l01532" name = "l01532" > < / a > < span class = "lineno" > 1532< / span > } < span class = "comment" > // namespace operations_research< / span > < / div >
< div class = "ttc" id = "aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f" > < div class = "ttname" > < a href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > max< / a > < / div > < div class = "ttdeci" > int64_t max< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "alldiff__cst_8cc_source.html#l00140" > alldiff_cst.cc:140< / a > < / div > < / div >
< div class = "ttc" id = "aalldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045" > < div class = "ttname" > < a href = "alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045" > min< / a > < / div > < div class = "ttdeci" > int64_t min< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "alldiff__cst_8cc_source.html#l00139" > alldiff_cst.cc:139< / a > < / div > < / div >
< div class = "ttc" id = "abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274" > < div class = "ttname" > < a href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > < / div > < div class = "ttdeci" > #define CHECK(condition)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "base_2logging_8h_source.html#l00495" > base/logging.h:495< / a > < / div > < / div >
2022-03-04 00:11:33 +01:00
< div class = "ttc" id = "abase_2logging_8h_html_a4bd2e815ca2f702a4b6aa744b1ff3b82" > < div class = "ttname" > < a href = "base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82" > CHECK_LT< / a > < / div > < div class = "ttdeci" > #define CHECK_LT(val1, val2)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "base_2logging_8h_source.html#l00706" > base/logging.h:706< / a > < / div > < / div >
< div class = "ttc" id = "abase_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b" > < div class = "ttname" > < a href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > < / div > < div class = "ttdeci" > #define CHECK_EQ(val1, val2)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "base_2logging_8h_source.html#l00703" > base/logging.h:703< / a > < / div > < / div >
< div class = "ttc" id = "abase_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9" > < div class = "ttname" > < a href = "base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9" > CHECK_GE< / a > < / div > < div class = "ttdeci" > #define CHECK_GE(val1, val2)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "base_2logging_8h_source.html#l00707" > base/logging.h:707< / a > < / div > < / div >
< div class = "ttc" id = "abase_2logging_8h_html_ab4f56aa24c4c9cddc47a6abd2d747f9a" > < div class = "ttname" > < a href = "base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a" > DCHECK_GT< / a > < / div > < div class = "ttdeci" > #define DCHECK_GT(val1, val2)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "base_2logging_8h_source.html#l00896" > base/logging.h:896< / a > < / div > < / div >
2022-01-17 21:42:14 +01:00
< div class = "ttc" id = "abase_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae" > < div class = "ttname" > < a href = "base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae" > LOG< / a > < / div > < div class = "ttdeci" > #define LOG(severity)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "base_2logging_8h_source.html#l00420" > base/logging.h:420< / a > < / div > < / div >
2022-03-04 00:11:33 +01:00
< div class = "ttc" id = "abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006" > < div class = "ttname" > < a href = "base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006" > DCHECK< / a > < / div > < div class = "ttdeci" > #define DCHECK(condition)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "base_2logging_8h_source.html#l00890" > base/logging.h:890< / a > < / div > < / div >
< div class = "ttc" id = "abase_2logging_8h_html_ae4db23f10f5d4aad6d735f5a74cd6f8c" > < div class = "ttname" > < a href = "base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c" > CHECK_LE< / a > < / div > < div class = "ttdeci" > #define CHECK_LE(val1, val2)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "base_2logging_8h_source.html#l00705" > base/logging.h:705< / a > < / div > < / div >
2022-01-17 21:42:14 +01:00
< div class = "ttc" id = "abitset_8h_html" > < div class = "ttname" > < a href = "bitset_8h.html" > bitset.h< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_base_knapsack_solver_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_base_knapsack_solver.html" > operations_research::BaseKnapsackSolver< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00575" > knapsack_solver.h:575< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_base_knapsack_solver_html_a4b0049f92bd893d89f1c03ec066d72af" > < div class = "ttname" > < a href = "classoperations__research_1_1_base_knapsack_solver.html#a4b0049f92bd893d89f1c03ec066d72af" > operations_research::BaseKnapsackSolver::GetLowerAndUpperBoundWhenItem< / a > < / div > < div class = "ttdeci" > virtual void GetLowerAndUpperBoundWhenItem(int item_id, bool is_item_in, int64_t *lower_bound, int64_t *upper_bound)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01522" > knapsack_solver.cc:1522< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_base_knapsack_solver_html_ae194e7bee4a383e5ee6c8ed341b49b7e" > < div class = "ttname" > < a href = "classoperations__research_1_1_base_knapsack_solver.html#ae194e7bee4a383e5ee6c8ed341b49b7e" > operations_research::BaseKnapsackSolver::GetName< / a > < / div > < div class = "ttdeci" > virtual std::string GetName() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00599" > knapsack_solver.h:599< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack64_items_solver_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack64_items_solver.html" > operations_research::Knapsack64ItemsSolver< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00676" > knapsack_solver.cc:676< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack64_items_solver_html_a6efbe15e2ab4e192b6af2fdcdda41ca2" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack64_items_solver.html#a6efbe15e2ab4e192b6af2fdcdda41ca2" > operations_research::Knapsack64ItemsSolver::Knapsack64ItemsSolver< / a > < / div > < div class = "ttdeci" > Knapsack64ItemsSolver(const std::string & solver_name)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00726" > knapsack_solver.cc:726< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack64_items_solver_html_a734b6464309adbbdeb63ef759f690ff1" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack64_items_solver.html#a734b6464309adbbdeb63ef759f690ff1" > operations_research::Knapsack64ItemsSolver::Init< / a > < / div > < div class = "ttdeci" > void Init(const std::vector< int64_t > & profits, const std::vector< std::vector< int64_t > > & weights, const std::vector< int64_t > & capacities) override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00741" > knapsack_solver.cc:741< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack64_items_solver_html_a788a597dac89a082d3ed4994d654dec1" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack64_items_solver.html#a788a597dac89a082d3ed4994d654dec1" > operations_research::Knapsack64ItemsSolver::Solve< / a > < / div > < div class = "ttdeci" > int64_t Solve(TimeLimit *time_limit, bool *is_solution_optimal) override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00782" > knapsack_solver.cc:782< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack64_items_solver_html_abfd4cb3faa2f1d6840b8123765fa2fc4" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack64_items_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4" > operations_research::Knapsack64ItemsSolver::best_solution< / a > < / div > < div class = "ttdeci" > bool best_solution(int item_id) const override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00689" > knapsack_solver.cc:689< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_brute_force_solver_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_brute_force_solver.html" > operations_research::KnapsackBruteForceSolver< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00546" > knapsack_solver.cc:546< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_brute_force_solver_html_a4f9df2a0d826265d62cd86f04070d439" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_brute_force_solver.html#a4f9df2a0d826265d62cd86f04070d439" > operations_research::KnapsackBruteForceSolver::KnapsackBruteForceSolver< / a > < / div > < div class = "ttdeci" > KnapsackBruteForceSolver(const std::string & solver_name)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00573" > knapsack_solver.cc:573< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_brute_force_solver_html_a734b6464309adbbdeb63ef759f690ff1" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_brute_force_solver.html#a734b6464309adbbdeb63ef759f690ff1" > operations_research::KnapsackBruteForceSolver::Init< / a > < / div > < div class = "ttdeci" > void Init(const std::vector< int64_t > & profits, const std::vector< std::vector< int64_t > > & weights, const std::vector< int64_t > & capacities) override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00581" > knapsack_solver.cc:581< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_brute_force_solver_html_a788a597dac89a082d3ed4994d654dec1" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_brute_force_solver.html#a788a597dac89a082d3ed4994d654dec1" > operations_research::KnapsackBruteForceSolver::Solve< / a > < / div > < div class = "ttdeci" > int64_t Solve(TimeLimit *time_limit, bool *is_solution_optimal) override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00604" > knapsack_solver.cc:604< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_brute_force_solver_html_abfd4cb3faa2f1d6840b8123765fa2fc4" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_brute_force_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4" > operations_research::KnapsackBruteForceSolver::best_solution< / a > < / div > < div class = "ttdeci" > bool best_solution(int item_id) const override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00559" > knapsack_solver.cc:559< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_capacity_propagator_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_capacity_propagator.html" > operations_research::KnapsackCapacityPropagator< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00534" > knapsack_solver.h:534< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_capacity_propagator_html_a2ce43dc07784f3d9634df0a5c0dc39b0" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_capacity_propagator.html#a2ce43dc07784f3d9634df0a5c0dc39b0" > operations_research::KnapsackCapacityPropagator::KnapsackCapacityPropagator< / a > < / div > < div class = "ttdeci" > KnapsackCapacityPropagator(const KnapsackState & state, int64_t capacity)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00211" > knapsack_solver.cc:211< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_capacity_propagator_html_a3cde41b7fa0c9734783a562aadd9ef8c" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_capacity_propagator.html#a3cde41b7fa0c9734783a562aadd9ef8c" > operations_research::KnapsackCapacityPropagator::UpdatePropagator< / a > < / div > < div class = "ttdeci" > bool UpdatePropagator(bool revert, const KnapsackAssignment & assignment) override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00269" > knapsack_solver.cc:269< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_capacity_propagator_html_a706a3a7c9568016131afd718f347ec8d" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_capacity_propagator.html#a706a3a7c9568016131afd718f347ec8d" > operations_research::KnapsackCapacityPropagator::CopyCurrentStateToSolutionPropagator< / a > < / div > < div class = "ttdeci" > void CopyCurrentStateToSolutionPropagator(std::vector< bool > *solution) const override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00284" > knapsack_solver.cc:284< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_capacity_propagator_html_a9921c39ed90a9cd32301ee0fee9491cb" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_capacity_propagator.html#a9921c39ed90a9cd32301ee0fee9491cb" > operations_research::KnapsackCapacityPropagator::ComputeProfitBounds< / a > < / div > < div class = "ttdeci" > void ComputeProfitBounds() override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00224" > knapsack_solver.cc:224< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_capacity_propagator_html_aa14e63156675c18c06073ac1cb8aa170" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_capacity_propagator.html#aa14e63156675c18c06073ac1cb8aa170" > operations_research::KnapsackCapacityPropagator::~KnapsackCapacityPropagator< / a > < / div > < div class = "ttdeci" > ~KnapsackCapacityPropagator() override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00220" > knapsack_solver.cc:220< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_capacity_propagator_html_ae2545020be753ee6a66c277daac41784" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_capacity_propagator.html#ae2545020be753ee6a66c277daac41784" > operations_research::KnapsackCapacityPropagator::InitPropagator< / a > < / div > < div class = "ttdeci" > void InitPropagator() override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00255" > knapsack_solver.cc:255< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_divide_and_conquer_solver_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html" > operations_research::KnapsackDivideAndConquerSolver< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01039" > knapsack_solver.cc:1039< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_divide_and_conquer_solver_html_a734b6464309adbbdeb63ef759f690ff1" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html#a734b6464309adbbdeb63ef759f690ff1" > operations_research::KnapsackDivideAndConquerSolver::Init< / a > < / div > < div class = "ttdeci" > void Init(const std::vector< int64_t > & profits, const std::vector< std::vector< int64_t > > & weights, const std::vector< int64_t > & capacities) override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01083" > knapsack_solver.cc:1083< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_divide_and_conquer_solver_html_a788a597dac89a082d3ed4994d654dec1" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html#a788a597dac89a082d3ed4994d654dec1" > operations_research::KnapsackDivideAndConquerSolver::Solve< / a > < / div > < div class = "ttdeci" > int64_t Solve(TimeLimit *time_limit, bool *is_solution_optimal) override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01156" > knapsack_solver.cc:1156< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_divide_and_conquer_solver_html_a7ab851afcd52d261c81d45ee40a1a072" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html#a7ab851afcd52d261c81d45ee40a1a072" > operations_research::KnapsackDivideAndConquerSolver::KnapsackDivideAndConquerSolver< / a > < / div > < div class = "ttdeci" > KnapsackDivideAndConquerSolver(const std::string & solver_name)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01073" > knapsack_solver.cc:1073< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_divide_and_conquer_solver_html_abfd4cb3faa2f1d6840b8123765fa2fc4" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_divide_and_conquer_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4" > operations_research::KnapsackDivideAndConquerSolver::best_solution< / a > < / div > < div class = "ttdeci" > bool best_solution(int item_id) const override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01052" > knapsack_solver.cc:1052< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_dynamic_programming_solver_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html" > operations_research::KnapsackDynamicProgrammingSolver< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00933" > knapsack_solver.cc:933< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_dynamic_programming_solver_html_a734b6464309adbbdeb63ef759f690ff1" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html#a734b6464309adbbdeb63ef759f690ff1" > operations_research::KnapsackDynamicProgrammingSolver::Init< / a > < / div > < div class = "ttdeci" > void Init(const std::vector< int64_t > & profits, const std::vector< std::vector< int64_t > > & weights, const std::vector< int64_t > & capacities) override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00972" > knapsack_solver.cc:972< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_dynamic_programming_solver_html_a788a597dac89a082d3ed4994d654dec1" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html#a788a597dac89a082d3ed4994d654dec1" > operations_research::KnapsackDynamicProgrammingSolver::Solve< / a > < / div > < div class = "ttdeci" > int64_t Solve(TimeLimit *time_limit, bool *is_solution_optimal) override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01007" > knapsack_solver.cc:1007< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_dynamic_programming_solver_html_abfd4cb3faa2f1d6840b8123765fa2fc4" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4" > operations_research::KnapsackDynamicProgrammingSolver::best_solution< / a > < / div > < div class = "ttdeci" > bool best_solution(int item_id) const override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00946" > knapsack_solver.cc:946< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_dynamic_programming_solver_html_ad12d8a6596d658d1b3fabafdeb505d16" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_dynamic_programming_solver.html#ad12d8a6596d658d1b3fabafdeb505d16" > operations_research::KnapsackDynamicProgrammingSolver::KnapsackDynamicProgrammingSolver< / a > < / div > < div class = "ttdeci" > KnapsackDynamicProgrammingSolver(const std::string & solver_name)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00962" > knapsack_solver.cc:962< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_generic_solver_html_a2a25594d97a0a532f9d814bdc6dea380" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_generic_solver.html#a2a25594d97a0a532f9d814bdc6dea380" > operations_research::KnapsackGenericSolver::~KnapsackGenericSolver< / a > < / div > < div class = "ttdeci" > ~KnapsackGenericSolver() override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00348" > knapsack_solver.cc:348< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_generic_solver_html_a2a7bff5cf8a51192eadec54eb0499064" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_generic_solver.html#a2a7bff5cf8a51192eadec54eb0499064" > operations_research::KnapsackGenericSolver::KnapsackGenericSolver< / a > < / div > < div class = "ttdeci" > KnapsackGenericSolver(const std::string & solver_name)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00339" > knapsack_solver.cc:339< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_generic_solver_html_a734b6464309adbbdeb63ef759f690ff1" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_generic_solver.html#a734b6464309adbbdeb63ef759f690ff1" > operations_research::KnapsackGenericSolver::Init< / a > < / div > < div class = "ttdeci" > void Init(const std::vector< int64_t > & profits, const std::vector< std::vector< int64_t > > & weights, const std::vector< int64_t > & capacities) override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00350" > knapsack_solver.cc:350< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_generic_solver_html_a788a597dac89a082d3ed4994d654dec1" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_generic_solver.html#a788a597dac89a082d3ed4994d654dec1" > operations_research::KnapsackGenericSolver::Solve< / a > < / div > < div class = "ttdeci" > int64_t Solve(TimeLimit *time_limit, bool *is_solution_optimal) override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00396" > knapsack_solver.cc:396< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_generic_solver_html_ac9849a7043959c65033fa6f4a63bb10e" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_generic_solver.html#ac9849a7043959c65033fa6f4a63bb10e" > operations_research::KnapsackGenericSolver::GetLowerAndUpperBoundWhenItem< / a > < / div > < div class = "ttdeci" > void GetLowerAndUpperBoundWhenItem(int item_id, bool is_item_in, int64_t *lower_bound, int64_t *upper_bound) override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00372" > knapsack_solver.cc:372< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_m_i_p_solver_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_m_i_p_solver.html" > operations_research::KnapsackMIPSolver< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01168" > knapsack_solver.cc:1168< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_m_i_p_solver_html_a734b6464309adbbdeb63ef759f690ff1" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_m_i_p_solver.html#a734b6464309adbbdeb63ef759f690ff1" > operations_research::KnapsackMIPSolver::Init< / a > < / div > < div class = "ttdeci" > void Init(const std::vector< int64_t > & profits, const std::vector< std::vector< int64_t > > & weights, const std::vector< int64_t > & capacities) override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01204" > knapsack_solver.cc:1204< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_m_i_p_solver_html_a788a597dac89a082d3ed4994d654dec1" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_m_i_p_solver.html#a788a597dac89a082d3ed4994d654dec1" > operations_research::KnapsackMIPSolver::Solve< / a > < / div > < div class = "ttdeci" > int64_t Solve(TimeLimit *time_limit, bool *is_solution_optimal) override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01212" > knapsack_solver.cc:1212< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_m_i_p_solver_html_a86d45985fb2256114f8fa235af155cff" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_m_i_p_solver.html#a86d45985fb2256114f8fa235af155cff" > operations_research::KnapsackMIPSolver::KnapsackMIPSolver< / a > < / div > < div class = "ttdeci" > KnapsackMIPSolver(MPSolver::OptimizationProblemType problem_type, const std::string & solver_name)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01194" > knapsack_solver.cc:1194< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_m_i_p_solver_html_abfd4cb3faa2f1d6840b8123765fa2fc4" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_m_i_p_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4" > operations_research::KnapsackMIPSolver::best_solution< / a > < / div > < div class = "ttdeci" > bool best_solution(int item_id) const override< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01182" > knapsack_solver.cc:1182< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_propagator_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_propagator.html" > operations_research::KnapsackPropagator< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00448" > knapsack_solver.h:448< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_propagator_html_a04d8883567a6e02787f2362e6543a21b" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_propagator.html#a04d8883567a6e02787f2362e6543a21b" > operations_research::KnapsackPropagator::Init< / a > < / div > < div class = "ttdeci" > void Init(const std::vector< int64_t > & profits, const std::vector< int64_t > & weights)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00173" > knapsack_solver.cc:173< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_propagator_html_a08beea2d857241d99287935a91be5217" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_propagator.html#a08beea2d857241d99287935a91be5217" > operations_research::KnapsackPropagator::current_profit< / a > < / div > < div class = "ttdeci" > int64_t current_profit() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00467" > knapsack_solver.h:467< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_propagator_html_a1fa45af1bf0d6aa9d5f86e2ed9ae5323" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_propagator.html#a1fa45af1bf0d6aa9d5f86e2ed9ae5323" > operations_research::KnapsackPropagator::CopyCurrentStateToSolution< / a > < / div > < div class = "ttdeci" > void CopyCurrentStateToSolution(bool has_one_propagator, std::vector< bool > *solution) const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00198" > knapsack_solver.cc:198< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_propagator_html_a5a0d11be6f0d5b521477226fb7573db8" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_propagator.html#a5a0d11be6f0d5b521477226fb7573db8" > operations_research::KnapsackPropagator::UpdatePropagator< / a > < / div > < div class = "ttdeci" > virtual bool UpdatePropagator(bool revert, const KnapsackAssignment & assignment)=0< / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_propagator_html_a701e8fc6dbf7ffeb4c48512ffa6d7501" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_propagator.html#a701e8fc6dbf7ffeb4c48512ffa6d7501" > operations_research::KnapsackPropagator::items< / a > < / div > < div class = "ttdeci" > const std::vector< KnapsackItemPtr > & items() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00499" > knapsack_solver.h:499< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_propagator_html_a883cd053b1e7322727eb9e19940f69f6" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_propagator.html#a883cd053b1e7322727eb9e19940f69f6" > operations_research::KnapsackPropagator::InitPropagator< / a > < / div > < div class = "ttdeci" > virtual void InitPropagator()=0< / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_propagator_html_aa68069fd1180cb37fcdbc99d6230bc3e" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_propagator.html#aa68069fd1180cb37fcdbc99d6230bc3e" > operations_research::KnapsackPropagator::profit_upper_bound< / a > < / div > < div class = "ttdeci" > int64_t profit_upper_bound() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00469" > knapsack_solver.h:469< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_propagator_html_ab803770e8e21bb448a2f3d940ab125f8" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_propagator.html#ab803770e8e21bb448a2f3d940ab125f8" > operations_research::KnapsackPropagator::CopyCurrentStateToSolutionPropagator< / a > < / div > < div class = "ttdeci" > virtual void CopyCurrentStateToSolutionPropagator(std::vector< bool > *solution) const =0< / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_propagator_html_ae04e419341e0b9772a057aff10ce63a0" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_propagator.html#ae04e419341e0b9772a057aff10ce63a0" > operations_research::KnapsackPropagator::profit_lower_bound< / a > < / div > < div class = "ttdeci" > int64_t profit_lower_bound() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00468" > knapsack_solver.h:468< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_propagator_html_ae29226a5be6204e26f1d563a6630ab9e" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_propagator.html#ae29226a5be6204e26f1d563a6630ab9e" > operations_research::KnapsackPropagator::set_profit_lower_bound< / a > < / div > < div class = "ttdeci" > void set_profit_lower_bound(int64_t profit)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00501" > knapsack_solver.h:501< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_propagator_html_af15d878d664ee8a07cf3b710f8047cba" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_propagator.html#af15d878d664ee8a07cf3b710f8047cba" > operations_research::KnapsackPropagator::~KnapsackPropagator< / a > < / div > < div class = "ttdeci" > virtual ~KnapsackPropagator()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00171" > knapsack_solver.cc:171< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_propagator_html_af28391017c090a638200c57b4c8a2ac1" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_propagator.html#af28391017c090a638200c57b4c8a2ac1" > operations_research::KnapsackPropagator::KnapsackPropagator< / a > < / div > < div class = "ttdeci" > KnapsackPropagator(const KnapsackState & state)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00164" > knapsack_solver.cc:164< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_propagator_html_af4b38123d3654471f0868774c5ff877d" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_propagator.html#af4b38123d3654471f0868774c5ff877d" > operations_research::KnapsackPropagator::Update< / a > < / div > < div class = "ttdeci" > bool Update(bool revert, const KnapsackAssignment & assignment)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00186" > knapsack_solver.cc:186< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_propagator_html_af991b29f273c53c8b35cb09bcccf3a5d" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_propagator.html#af991b29f273c53c8b35cb09bcccf3a5d" > operations_research::KnapsackPropagator::set_profit_upper_bound< / a > < / div > < div class = "ttdeci" > void set_profit_upper_bound(int64_t profit)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00502" > knapsack_solver.h:502< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_propagator_html_afebda22d5e2e068671aa4dbfbe9024df" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_propagator.html#afebda22d5e2e068671aa4dbfbe9024df" > operations_research::KnapsackPropagator::state< / a > < / div > < div class = "ttdeci" > const KnapsackState & state() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00498" > knapsack_solver.h:498< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_search_node_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_search_node.html" > operations_research::KnapsackSearchNode< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00339" > knapsack_solver.h:339< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_search_node_html_a48521e7b1a381bd3f3f452fa6e697bde" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_search_node.html#a48521e7b1a381bd3f3f452fa6e697bde" > operations_research::KnapsackSearchNode::set_current_profit< / a > < / div > < div class = "ttdeci" > void set_current_profit(int64_t profit)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00348" > knapsack_solver.h:348< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_search_node_html_a6fdd73f8011695b97659f2bea29325cb" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_search_node.html#a6fdd73f8011695b97659f2bea29325cb" > operations_research::KnapsackSearchNode::depth< / a > < / div > < div class = "ttdeci" > int depth() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00343" > knapsack_solver.h:343< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_search_node_html_a94edd193a3f600c604a314803f723d93" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_search_node.html#a94edd193a3f600c604a314803f723d93" > operations_research::KnapsackSearchNode::parent< / a > < / div > < div class = "ttdeci" > const KnapsackSearchNode *const parent() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00344" > knapsack_solver.h:344< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_search_node_html_a9962698a737cd21789c77ff32bef0d98" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_search_node.html#a9962698a737cd21789c77ff32bef0d98" > operations_research::KnapsackSearchNode::set_next_item_id< / a > < / div > < div class = "ttdeci" > void set_next_item_id(int id)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00354" > knapsack_solver.h:354< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_search_node_html_ad17e46a2afcf393a4ec9159162c969f2" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_search_node.html#ad17e46a2afcf393a4ec9159162c969f2" > operations_research::KnapsackSearchNode::KnapsackSearchNode< / a > < / div > < div class = "ttdeci" > KnapsackSearchNode(const KnapsackSearchNode *const parent, const KnapsackAssignment & assignment)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00103" > knapsack_solver.cc:103< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_search_node_html_af991b29f273c53c8b35cb09bcccf3a5d" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_search_node.html#af991b29f273c53c8b35cb09bcccf3a5d" > operations_research::KnapsackSearchNode::set_profit_upper_bound< / a > < / div > < div class = "ttdeci" > void set_profit_upper_bound(int64_t profit)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00351" > knapsack_solver.h:351< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_search_path_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_search_path.html" > operations_research::KnapsackSearchPath< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00393" > knapsack_solver.h:393< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_search_path_html_a09f219a2226f7c0de0f50b6f00c099e3" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_search_path.html#a09f219a2226f7c0de0f50b6f00c099e3" > operations_research::KnapsackSearchPath::MoveUpToDepth< / a > < / div > < div class = "ttdeci" > const KnapsackSearchNode * MoveUpToDepth(const KnapsackSearchNode & node, int depth) const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00130" > knapsack_solver.cc:130< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_search_path_html_a1e3b6d38df0786ccf7f938d60e386aae" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_search_path.html#a1e3b6d38df0786ccf7f938d60e386aae" > operations_research::KnapsackSearchPath::Init< / a > < / div > < div class = "ttdeci" > void Init()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00117" > knapsack_solver.cc:117< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_search_path_html_a3dc3602e1a640bc986956e0ce5e88d04" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_search_path.html#a3dc3602e1a640bc986956e0ce5e88d04" > operations_research::KnapsackSearchPath::KnapsackSearchPath< / a > < / div > < div class = "ttdeci" > KnapsackSearchPath(const KnapsackSearchNode & from, const KnapsackSearchNode & to)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00113" > knapsack_solver.cc:113< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_solver_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_solver.html" > operations_research::KnapsackSolver< / a > < / div > < div class = "ttdoc" > This library solves knapsack problems.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00117" > knapsack_solver.h:117< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_solver_html_a57d88f584d14b161580550918c8fbf3b" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_solver.html#a57d88f584d14b161580550918c8fbf3b" > operations_research::KnapsackSolver::BestSolutionContains< / a > < / div > < div class = "ttdeci" > bool BestSolutionContains(int item_id) const< / div > < div class = "ttdoc" > Returns true if the item 'item_id' is packed in the optimal knapsack.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01511" > knapsack_solver.cc:1511< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_solver_html_a6b46c35c8977efde66ae7ad97423bdf2" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_solver.html#a6b46c35c8977efde66ae7ad97423bdf2" > operations_research::KnapsackSolver::KnapsackSolver< / a > < / div > < div class = "ttdeci" > KnapsackSolver(const std::string & solver_name)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01258" > knapsack_solver.cc:1258< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_solver_html_a7f5467b49f2cba3d8804e44ed76e12a2" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_solver.html#a7f5467b49f2cba3d8804e44ed76e12a2" > operations_research::KnapsackSolver::Solve< / a > < / div > < div class = "ttdeci" > int64_t Solve()< / div > < div class = "ttdoc" > Solves the problem and returns the profit of the optimal solution.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01504" > knapsack_solver.cc:1504< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_solver_html_a8b06041d7c1fb05f379714f4312306ec" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306ec" > operations_research::KnapsackSolver::SolverType< / a > < / div > < div class = "ttdeci" > SolverType< / div > < div class = "ttdoc" > Enum controlling which underlying algorithm is used.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00124" > knapsack_solver.h:124< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_solver_html_a8b06041d7c1fb05f379714f4312306eca1f4e1e2f80ab9c7d4fc1b14d9f5da959" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306eca1f4e1e2f80ab9c7d4fc1b14d9f5da959" > operations_research::KnapsackSolver::KNAPSACK_MULTIDIMENSION_SCIP_MIP_SOLVER< / a > < / div > < div class = "ttdeci" > @ KNAPSACK_MULTIDIMENSION_SCIP_MIP_SOLVER< / div > < div class = "ttdoc" > SCIP based solver.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00171" > knapsack_solver.h:171< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_solver_html_a8b06041d7c1fb05f379714f4312306eca2a4e77eec4f386d17001e7285e812a0b" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306eca2a4e77eec4f386d17001e7285e812a0b" > operations_research::KnapsackSolver::KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER< / a > < / div > < div class = "ttdeci" > @ KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER< / div > < div class = "ttdoc" > Generic Solver.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00163" > knapsack_solver.h:163< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_solver_html_a8b06041d7c1fb05f379714f4312306eca793d998526508cfcc2bfc89fe25b3edd" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306eca793d998526508cfcc2bfc89fe25b3edd" > operations_research::KnapsackSolver::KNAPSACK_DYNAMIC_PROGRAMMING_SOLVER< / a > < / div > < div class = "ttdeci" > @ KNAPSACK_DYNAMIC_PROGRAMMING_SOLVER< / div > < div class = "ttdoc" > Dynamic Programming approach for single dimension problems.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00147" > knapsack_solver.h:147< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_solver_html_a8b06041d7c1fb05f379714f4312306eca9d4c4118c9e4dc258e5052c0a457098d" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306eca9d4c4118c9e4dc258e5052c0a457098d" > operations_research::KnapsackSolver::KNAPSACK_DIVIDE_AND_CONQUER_SOLVER< / a > < / div > < div class = "ttdeci" > @ KNAPSACK_DIVIDE_AND_CONQUER_SOLVER< / div > < div class = "ttdoc" > Divide and Conquer approach for single dimension problems.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00198" > knapsack_solver.h:198< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_solver_html_a8b06041d7c1fb05f379714f4312306ecaa020f211a1ff184e712aa4f372d6ea34" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306ecaa020f211a1ff184e712aa4f372d6ea34" > operations_research::KnapsackSolver::KNAPSACK_64ITEMS_SOLVER< / a > < / div > < div class = "ttdeci" > @ KNAPSACK_64ITEMS_SOLVER< / div > < div class = "ttdoc" > Optimized method for single dimension small problems.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00139" > knapsack_solver.h:139< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_solver_html_a8b06041d7c1fb05f379714f4312306ecac43056d6d2f96cee37fcb8a752b0ff45" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306ecac43056d6d2f96cee37fcb8a752b0ff45" > operations_research::KnapsackSolver::KNAPSACK_BRUTE_FORCE_SOLVER< / a > < / div > < div class = "ttdeci" > @ KNAPSACK_BRUTE_FORCE_SOLVER< / div > < div class = "ttdoc" > Brute force method.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00131" > knapsack_solver.h:131< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_solver_html_a8b06041d7c1fb05f379714f4312306ecae2ce6e36a247621de398e875d5feb575" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_solver.html#a8b06041d7c1fb05f379714f4312306ecae2ce6e36a247621de398e875d5feb575" > operations_research::KnapsackSolver::KNAPSACK_MULTIDIMENSION_CBC_MIP_SOLVER< / a > < / div > < div class = "ttdeci" > @ KNAPSACK_MULTIDIMENSION_CBC_MIP_SOLVER< / div > < div class = "ttdoc" > CBC Based Solver.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00155" > knapsack_solver.h:155< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_solver_html_a9a98946a64f3893b085f650932c9dfee" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_solver.html#a9a98946a64f3893b085f650932c9dfee" > operations_research::KnapsackSolver::GetName< / a > < / div > < div class = "ttdeci" > std::string GetName() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01519" > knapsack_solver.cc:1519< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_solver_html_abb19dddb08cf912baec8995cfd2f1f42" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_solver.html#abb19dddb08cf912baec8995cfd2f1f42" > operations_research::KnapsackSolver::~KnapsackSolver< / a > < / div > < div class = "ttdeci" > virtual ~KnapsackSolver()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01318" > knapsack_solver.cc:1318< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_solver_html_ae5982edf1a2974495d20201775a765e2" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_solver.html#ae5982edf1a2974495d20201775a765e2" > operations_research::KnapsackSolver::Init< / a > < / div > < div class = "ttdeci" > void Init(const std::vector< int64_t > & profits, const std::vector< std::vector< int64_t > > & weights, const std::vector< int64_t > & capacities)< / div > < div class = "ttdoc" > Initializes the solver and enters the problem to be solved.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l01320" > knapsack_solver.cc:1320< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_state_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_state.html" > operations_research::KnapsackState< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00414" > knapsack_solver.h:414< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_state_html_a41f9430cc0090383e7797a88c1dbacbc" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_state.html#a41f9430cc0090383e7797a88c1dbacbc" > operations_research::KnapsackState::KnapsackState< / a > < / div > < div class = "ttdeci" > KnapsackState()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00140" > knapsack_solver.cc:140< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_state_html_a6308c7a97200f84f6ebf5b2c487b0362" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_state.html#a6308c7a97200f84f6ebf5b2c487b0362" > operations_research::KnapsackState::Init< / a > < / div > < div class = "ttdeci" > void Init(int number_of_items)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00142" > knapsack_solver.cc:142< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_state_html_a862bf4e908cd82ea44f72e98558016ad" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_state.html#a862bf4e908cd82ea44f72e98558016ad" > operations_research::KnapsackState::is_in< / a > < / div > < div class = "ttdeci" > bool is_in(int id) const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00427" > knapsack_solver.h:427< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_state_html_a89aa280d2321c1316aa1305106f1bb49" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_state.html#a89aa280d2321c1316aa1305106f1bb49" > operations_research::KnapsackState::is_bound< / a > < / div > < div class = "ttdeci" > bool is_bound(int id) const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00426" > knapsack_solver.h:426< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_knapsack_state_html_ab771ac0e538f991b73b011ee3ba11f05" > < div class = "ttname" > < a href = "classoperations__research_1_1_knapsack_state.html#ab771ac0e538f991b73b011ee3ba11f05" > operations_research::KnapsackState::UpdateState< / a > < / div > < div class = "ttdeci" > bool UpdateState(bool revert, const KnapsackAssignment & assignment)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00148" > knapsack_solver.cc:148< / a > < / div > < / div >
2022-03-04 00:11:33 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1_m_p_constraint_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_p_constraint.html" > operations_research::MPConstraint< / a > < / div > < div class = "ttdoc" > The class for constraints of a Mathematical Programming (MP) model.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8h_source.html#l01219" > linear_solver.h:1219< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_m_p_objective_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_p_objective.html" > operations_research::MPObjective< / a > < / div > < div class = "ttdoc" > A class to express a linear objective.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8h_source.html#l00965" > linear_solver.h:965< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_m_p_objective_html_a2def997791a2a5119c3502aa68c34181" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_p_objective.html#a2def997791a2a5119c3502aa68c34181" > operations_research::MPObjective::SetCoefficient< / a > < / div > < div class = "ttdeci" > void SetCoefficient(const MPVariable *const var, double coeff)< / div > < div class = "ttdoc" > Sets the coefficient of the variable in the objective.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8cc_source.html#l00184" > linear_solver.cc:184< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_m_p_objective_html_a8554e97d98d05016f16300cedf2be9f6" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_p_objective.html#a8554e97d98d05016f16300cedf2be9f6" > operations_research::MPObjective::Value< / a > < / div > < div class = "ttdeci" > double Value() const< / div > < div class = "ttdoc" > Returns the objective value of the best solution found so far.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8cc_source.html#l00256" > linear_solver.cc:256< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_m_p_objective_html_ac187b2ba08422f3a06b8d1e1502ceea6" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_p_objective.html#ac187b2ba08422f3a06b8d1e1502ceea6" > operations_research::MPObjective::SetMinimization< / a > < / div > < div class = "ttdeci" > void SetMinimization()< / div > < div class = "ttdoc" > Sets the optimization direction to minimize.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8h_source.html#l01025" > linear_solver.h:1025< / a > < / div > < / div >
2022-01-17 21:42:14 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1_m_p_solver_html" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_p_solver.html" > operations_research::MPSolver< / a > < / div > < div class = "ttdoc" > This mathematical programming (MP) solver class is the main class though which users build and solve ...< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8h_source.html#l00182" > linear_solver.h:182< / a > < / div > < / div >
2022-03-04 00:11:33 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1_m_p_solver_html_a200ccd114eb5057856c05501c2d4abe5" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_p_solver.html#a200ccd114eb5057856c05501c2d4abe5" > operations_research::MPSolver::MakeBoolVarArray< / a > < / div > < div class = "ttdeci" > void MakeBoolVarArray(int nb, const std::string & name, std::vector< MPVariable * > *vars)< / div > < div class = "ttdoc" > Creates an array of boolean variables.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8cc_source.html#l01313" > linear_solver.cc:1313< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_m_p_solver_html_a43d6ca2f978ca6f622a16117166ff69a" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_p_solver.html#a43d6ca2f978ca6f622a16117166ff69a" > operations_research::MPSolver::MakeRowConstraint< / a > < / div > < div class = "ttdeci" > MPConstraint * MakeRowConstraint(double lb, double ub)< / div > < div class = "ttdoc" > Creates a linear constraint with given bounds.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8cc_source.html#l01318" > linear_solver.cc:1318< / a > < / div > < / div >
2022-01-17 21:42:14 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1_m_p_solver_html_a76c87990aabadd148304b95332a60ff8" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8" > operations_research::MPSolver::OptimizationProblemType< / a > < / div > < div class = "ttdeci" > OptimizationProblemType< / div > < div class = "ttdoc" > The type of problems (LP or MIP) that will be solved and the underlying solver (GLOP,...< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8h_source.html#l00190" > linear_solver.h:190< / a > < / div > < / div >
2022-03-04 00:11:33 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1_m_p_solver_html_a76c87990aabadd148304b95332a60ff8a223fb1b5c8d153d5fef50b8d6f0426e9" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8a223fb1b5c8d153d5fef50b8d6f0426e9" > operations_research::MPSolver::CPLEX_MIXED_INTEGER_PROGRAMMING< / a > < / div > < div class = "ttdeci" > @ CPLEX_MIXED_INTEGER_PROGRAMMING< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8h_source.html#l00211" > linear_solver.h:211< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_m_p_solver_html_a76c87990aabadd148304b95332a60ff8a5a62faa5ec0ffed2abbc2d526bd53286" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8a5a62faa5ec0ffed2abbc2d526bd53286" > operations_research::MPSolver::XPRESS_MIXED_INTEGER_PROGRAMMING< / a > < / div > < div class = "ttdeci" > @ XPRESS_MIXED_INTEGER_PROGRAMMING< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8h_source.html#l00213" > linear_solver.h:213< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_m_p_solver_html_a76c87990aabadd148304b95332a60ff8a83b85675904f261c34c280b2abdcd9ae" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8a83b85675904f261c34c280b2abdcd9ae" > operations_research::MPSolver::SCIP_MIXED_INTEGER_PROGRAMMING< / a > < / div > < div class = "ttdeci" > @ SCIP_MIXED_INTEGER_PROGRAMMING< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8h_source.html#l00203" > linear_solver.h:203< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_m_p_solver_html_a76c87990aabadd148304b95332a60ff8ad183dc62c63346a3b984b93fbda0137a" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8ad183dc62c63346a3b984b93fbda0137a" > operations_research::MPSolver::CBC_MIXED_INTEGER_PROGRAMMING< / a > < / div > < div class = "ttdeci" > @ CBC_MIXED_INTEGER_PROGRAMMING< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8h_source.html#l00205" > linear_solver.h:205< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_m_p_solver_html_acede9075c58cb2f506c99a9fe6f20303" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_p_solver.html#acede9075c58cb2f506c99a9fe6f20303" > operations_research::MPSolver::Solve< / a > < / div > < div class = "ttdeci" > ResultStatus Solve()< / div > < div class = "ttdoc" > Solves the problem using the default parameter values.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8cc_source.html#l01395" > linear_solver.cc:1395< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_m_p_solver_html_ae1df08a9aabad59b5d620930126e6d91" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_p_solver.html#ae1df08a9aabad59b5d620930126e6d91" > operations_research::MPSolver::SuppressOutput< / a > < / div > < div class = "ttdeci" > void SuppressOutput()< / div > < div class = "ttdoc" > Suppresses solver logging.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8cc_source.html#l01674" > linear_solver.cc:1674< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_m_p_solver_html_aede63007883156c3cd3cc336096f0305" > < div class = "ttname" > < a href = "classoperations__research_1_1_m_p_solver.html#aede63007883156c3cd3cc336096f0305" > operations_research::MPSolver::MutableObjective< / a > < / div > < div class = "ttdeci" > MPObjective * MutableObjective()< / div > < div class = "ttdoc" > Returns the mutable objective object.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8h_source.html#l00434" > linear_solver.h:434< / a > < / div > < / div >
2022-01-17 21:42:14 +01: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#l00106" > time_limit.h:106< / a > < / div > < / div >
2022-03-04 00:11:33 +01:00
< div class = "ttc" id = "acp__model__solver_8cc_html_aec8af5c1be4e1b6d4330e1161028de21" > < div class = "ttname" > < a href = "cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21" > time_limit< / a > < / div > < div class = "ttdeci" > ModelSharedTimeLimit * time_limit< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "cp__model__solver_8cc_source.html#l02050" > cp_model_solver.cc:2050< / a > < / div > < / div >
2022-01-17 21:42:14 +01:00
< div class = "ttc" id = "ademon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695" > < div class = "ttname" > < a href = "demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695" > ct< / a > < / div > < div class = "ttdeci" > const Constraint * ct< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "demon__profiler_8cc_source.html#l00043" > demon_profiler.cc:43< / a > < / div > < / div >
< div class = "ttc" id = "ademon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514" > < div class = "ttname" > < a href = "demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514" > value< / a > < / div > < div class = "ttdeci" > int64_t value< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "demon__profiler_8cc_source.html#l00044" > demon_profiler.cc:44< / a > < / div > < / div >
< div class = "ttc" id = "agscip__solver_8cc_html_a1ba5ca0f61f2fa13bd23bf0f89004f35" > < div class = "ttname" > < a href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > < / div > < div class = "ttdeci" > double upper_bound< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "gscip__solver_8cc_source.html#l00137" > gscip_solver.cc:137< / a > < / div > < / div >
< div class = "ttc" id = "agscip__solver_8cc_html_a1e2f9a2352c1d9a6cada9544898fceec" > < div class = "ttname" > < a href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > < / div > < div class = "ttdeci" > double lower_bound< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "gscip__solver_8cc_source.html#l00136" > gscip_solver.cc:136< / a > < / div > < / div >
< div class = "ttc" id = "aknapsack__solver_8cc_html_a3cb2fc3bc89582cef0819ea753e8a44d" > < div class = "ttname" > < a href = "knapsack__solver_8cc.html#a3cb2fc3bc89582cef0819ea753e8a44d" > profit_max< / a > < / div > < div class = "ttdeci" > const int64_t profit_max< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00046" > knapsack_solver.cc:46< / a > < / div > < / div >
< div class = "ttc" id = "aknapsack__solver_8h_html" > < div class = "ttname" > < a href = "knapsack__solver_8h.html" > knapsack_solver.h< / a > < / div > < / div >
2022-03-04 00:11:33 +01:00
< div class = "ttc" id = "alinear__solver_8cc_html_acdf66e64954cbe33c30a45395b4d74b6" > < div class = "ttname" > < a href = "linear__solver_8cc.html#acdf66e64954cbe33c30a45395b4d74b6" > problem_type< / a > < / div > < div class = "ttdeci" > MPSolver::OptimizationProblemType problem_type< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "linear__solver_8cc_source.html#l00514" > linear_solver.cc:514< / a > < / div > < / div >
2022-01-17 21:42:14 +01:00
< div class = "ttc" id = "alinear__solver_8h_html" > < div class = "ttname" > < a href = "linear__solver_8h.html" > linear_solver.h< / a > < / div > < div class = "ttdoc" > A C++ wrapper that provides a simple and unified interface to several linear programming and mixed in...< / div > < / div >
< div class = "ttc" id = "alog__severity_8h_html_acdd38e3c9f22f127d7776920e3079eda" > < div class = "ttname" > < a href = "log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda" > FATAL< / a > < / div > < div class = "ttdeci" > const int FATAL< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "log__severity_8h_source.html#l00032" > log_severity.h:32< / a > < / div > < / div >
< div class = "ttc" id = "anamespacegtl_html_a4ee3db0c4acaa0f277a0d7006f5ad1e6" > < div class = "ttname" > < a href = "namespacegtl.html#a4ee3db0c4acaa0f277a0d7006f5ad1e6" > gtl::STLDeleteElements< / a > < / div > < div class = "ttdeci" > void STLDeleteElements(T *container)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "stl__util_8h_source.html#l00372" > stl_util.h:372< / 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 = "anamespaceoperations__research_html_a627ab892a9c19c32b05c8f118e7660e0" > < div class = "ttname" > < a href = "namespaceoperations__research.html#a627ab892a9c19c32b05c8f118e7660e0" > operations_research::CompareKnapsackItemWithEfficiencyInDecreasingEfficiencyOrder< / a > < / div > < div class = "ttdeci" > bool CompareKnapsackItemWithEfficiencyInDecreasingEfficiencyOrder(const KnapsackItemWithEfficiency & item1, const KnapsackItemWithEfficiency & item2)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00719" > knapsack_solver.cc:719< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_html_aa400cb586d3da8079abd2dfe15434c26" > < div class = "ttname" > < a href = "namespaceoperations__research.html#aa400cb586d3da8079abd2dfe15434c26" > operations_research::OneBit32< / a > < / div > < div class = "ttdeci" > uint32_t OneBit32(int pos)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "bitset_8h_source.html#l00039" > bitset.h:39< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_html_ace10d9b6a07c87e11942df49bb04fc71" > < div class = "ttname" > < a href = "namespaceoperations__research.html#ace10d9b6a07c87e11942df49bb04fc71" > operations_research::OneBit64< / a > < / div > < div class = "ttdeci" > uint64_t OneBit64(int pos)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "bitset_8h_source.html#l00038" > bitset.h:38< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_html_ada7d9b46f657c6053a197273a85043a7" > < div class = "ttname" > < a href = "namespaceoperations__research.html#ada7d9b46f657c6053a197273a85043a7" > operations_research::KnapsackItemPtr< / a > < / div > < div class = "ttdeci" > KnapsackItem * KnapsackItemPtr< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00329" > knapsack_solver.h:329< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_html_afa6ef9aef70f95b9d5bcee2c10937bc8" > < div class = "ttname" > < a href = "namespaceoperations__research.html#afa6ef9aef70f95b9d5bcee2c10937bc8" > operations_research::MostSignificantBitPosition64< / a > < / div > < div class = "ttdeci" > int MostSignificantBitPosition64(uint64_t n)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "bitset_8h_source.html#l00231" > bitset.h:231< / a > < / div > < / div >
< div class = "ttc" id = "anamespacestd_html" > < div class = "ttname" > < a href = "namespacestd.html" > std< / a > < / div > < div class = "ttdoc" > STL namespace.< / div > < / div >
< div class = "ttc" id = "apack_8cc_html_a4255f714cea26cdd64f6a0ee72d34a8c" > < div class = "ttname" > < a href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > < / div > < div class = "ttdeci" > int64_t weight< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "pack_8cc_source.html#l00510" > pack.cc:510< / a > < / div > < / div >
< div class = "ttc" id = "arevised__simplex_8cc_html_af01c50e388647c921aa7d9c77f2b72b2" > < div class = "ttname" > < a href = "revised__simplex_8cc.html#af01c50e388647c921aa7d9c77f2b72b2" > ratio< / a > < / div > < div class = "ttdeci" > Fractional ratio< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "revised__simplex_8cc_source.html#l01981" > revised_simplex.cc:1981< / a > < / div > < / div >
< div class = "ttc" id = "arouting__flow_8cc_html_a2acb49f4df5288066c43610bede123ec" > < div class = "ttname" > < a href = "routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec" > capacity< / a > < / div > < div class = "ttdeci" > int64_t capacity< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "routing__flow_8cc_source.html#l00151" > routing_flow.cc:151< / a > < / div > < / div >
< div class = "ttc" id = "astl__util_8h_html" > < div class = "ttname" > < a href = "stl__util_8h.html" > stl_util.h< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1_knapsack_assignment_html" > < div class = "ttname" > < a href = "structoperations__research_1_1_knapsack_assignment.html" > operations_research::KnapsackAssignment< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00295" > knapsack_solver.h:295< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1_knapsack_assignment_html_a1c0c3c835f3c4363b650fba65c7ebf32" > < div class = "ttname" > < a href = "structoperations__research_1_1_knapsack_assignment.html#a1c0c3c835f3c4363b650fba65c7ebf32" > operations_research::KnapsackAssignment::item_id< / a > < / div > < div class = "ttdeci" > int item_id< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00298" > knapsack_solver.h:298< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1_knapsack_assignment_html_a922620900c7a18d22de686d47e25d4ed" > < div class = "ttname" > < a href = "structoperations__research_1_1_knapsack_assignment.html#a922620900c7a18d22de686d47e25d4ed" > operations_research::KnapsackAssignment::is_in< / a > < / div > < div class = "ttdeci" > bool is_in< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00299" > knapsack_solver.h:299< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1_knapsack_item_html" > < div class = "ttname" > < a href = "structoperations__research_1_1_knapsack_item.html" > operations_research::KnapsackItem< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00314" > knapsack_solver.h:314< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1_knapsack_item_html_a523234416a08d890505d4b34fb0513ee" > < div class = "ttname" > < a href = "structoperations__research_1_1_knapsack_item.html#a523234416a08d890505d4b34fb0513ee" > operations_research::KnapsackItem::weight< / a > < / div > < div class = "ttdeci" > const int64_t weight< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00326" > knapsack_solver.h:326< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1_knapsack_item_html_a64ae40793ade89d800a8c5646d2980fc" > < div class = "ttname" > < a href = "structoperations__research_1_1_knapsack_item.html#a64ae40793ade89d800a8c5646d2980fc" > operations_research::KnapsackItem::id< / a > < / div > < div class = "ttdeci" > const int id< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00325" > knapsack_solver.h:325< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1_knapsack_item_html_a75dd99d0e31e3a347e5ebad01561e31d" > < div class = "ttname" > < a href = "structoperations__research_1_1_knapsack_item.html#a75dd99d0e31e3a347e5ebad01561e31d" > operations_research::KnapsackItem::profit< / a > < / div > < div class = "ttdeci" > const int64_t profit< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8h_source.html#l00327" > knapsack_solver.h:327< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1_knapsack_item_with_efficiency_html" > < div class = "ttname" > < a href = "structoperations__research_1_1_knapsack_item_with_efficiency.html" > operations_research::KnapsackItemWithEfficiency< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00656" > knapsack_solver.cc:656< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1_knapsack_item_with_efficiency_html_a036eb5930698269322fab01797c24255" > < div class = "ttname" > < a href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a036eb5930698269322fab01797c24255" > operations_research::KnapsackItemWithEfficiency::efficiency< / a > < / div > < div class = "ttdeci" > double efficiency< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00669" > knapsack_solver.cc:669< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1_knapsack_item_with_efficiency_html_a4255f714cea26cdd64f6a0ee72d34a8c" > < div class = "ttname" > < a href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a4255f714cea26cdd64f6a0ee72d34a8c" > operations_research::KnapsackItemWithEfficiency::weight< / a > < / div > < div class = "ttdeci" > int64_t weight< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00668" > knapsack_solver.cc:668< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1_knapsack_item_with_efficiency_html_a6b3684e68faf736fcdb5cbbb2c652ec7" > < div class = "ttname" > < a href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a6b3684e68faf736fcdb5cbbb2c652ec7" > operations_research::KnapsackItemWithEfficiency::KnapsackItemWithEfficiency< / a > < / div > < div class = "ttdeci" > KnapsackItemWithEfficiency(int _id, int64_t _profit, int64_t _weight, int64_t _profit_max)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00657" > knapsack_solver.cc:657< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1_knapsack_item_with_efficiency_html_a7441ef0865bcb3db9b8064dd7375c1ea" > < div class = "ttname" > < a href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#a7441ef0865bcb3db9b8064dd7375c1ea" > operations_research::KnapsackItemWithEfficiency::id< / a > < / div > < div class = "ttdeci" > int id< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00666" > knapsack_solver.cc:666< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1_knapsack_item_with_efficiency_html_ac4db398e132b8e254cd485f4aac8d1bf" > < div class = "ttname" > < a href = "structoperations__research_1_1_knapsack_item_with_efficiency.html#ac4db398e132b8e254cd485f4aac8d1bf" > operations_research::KnapsackItemWithEfficiency::profit< / a > < / div > < div class = "ttdeci" > int64_t profit< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "knapsack__solver_8cc_source.html#l00667" > knapsack_solver.cc:667< / a > < / div > < / div >
< div class = "ttc" id = "atime__limit_8h_html" > < div class = "ttname" > < a href = "time__limit_8h.html" > time_limit.h< / a > < / div > < / div >
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_80dda7a75b0dfcf996988638a63eb03a.html" > algorithms< / a > < / li > < li class = "navelem" > < a class = "el" href = "knapsack__solver_8cc.html" > knapsack_solver.cc< / a > < / li >
< li class = "footer" > Generated by
< a href = "http://www.doxygen.org/index.html" >
2022-01-17 21:42:14 +01:00
< img class = "footer" src = "doxygen.png" alt = "doxygen" / > < / a > 1.9.3 < / li >
2020-09-02 09:42:51 +02:00
< / ul >
< / div >
< / body >
< / html >
