181 lines
82 KiB
HTML
181 lines
82 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.15"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: arc_flow_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>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('arc__flow__solver_8cc_source.html','');});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">arc_flow_solver.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="arc__flow__solver_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2021 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="arc__flow__solver_8h.html">ortools/packing/arc_flow_solver.h</a>"</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <string></span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include "absl/container/btree_map.h"</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include "absl/flags/flag.h"</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="commandlineflags_8h.html">ortools/base/commandlineflags.h</a>"</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="base_2file_8h.html">ortools/base/file.h</a>"</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="timer_8h.html">ortools/base/timer.h</a>"</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="arc__flow__builder_8h.html">ortools/packing/arc_flow_builder.h</a>"</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="vector__bin__packing_8pb_8h.html">ortools/packing/vector_bin_packing.pb.h</a>"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <a class="code" href="arc__flow__solver_8cc.html#a6339fe56643271ddfa529e262e86ee12">ABSL_FLAG</a>(std::string, arc_flow_dump_model, <span class="stringliteral">""</span>,</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="stringliteral">"File to store the solver specific optimization proto."</span>);</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> </div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="keyword">namespace </span>packing {</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">namespace </span>{</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keywordtype">double</span> ConvertVectorBinPackingProblem(<span class="keyword">const</span> vbp::VectorBinPackingProblem& <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>,</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  ArcFlowGraph* graph) {</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <a class="code" href="class_wall_timer.html">WallTimer</a> timer;</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  timer.<a class="code" href="class_wall_timer.html#a07aaf1227e4d645f15e0a964f54ef291">Start</a>();</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_items = <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>.item_size();</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_dims = <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>.resource_capacity_size();</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> </div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="comment">// Collect problem data.</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  std::vector<std::vector<int>> shapes(num_items);</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  std::vector<int> demands(num_items);</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  std::vector<int> capacities(num_dims);</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_items; ++i) {</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  shapes[i].assign(<a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>.item(i).resource_usage().begin(),</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>.item(i).resource_usage().end());</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  demands[i] = <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>.item(i).num_copies();</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  }</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_dims; ++i) {</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  capacities[i] = <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>.resource_capacity(i);</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  }</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> </div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="comment">// Add extra dimensions to encode max_number_of_copies_per_bin.</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_items; ++i) {</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> max_copies = <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>.item(i).max_number_of_copies_per_bin();</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">if</span> (max_copies == 0 || max_copies >= demands[i]) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  capacities.push_back(max_copies);</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < num_items; ++j) {</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  shapes[j].push_back(i == j);</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  }</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  }</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  *graph = <a class="code" href="namespaceoperations__research_1_1packing.html#abf4185c48db1dd3fb87f9d05081de446">BuildArcFlowGraph</a>(capacities, shapes, demands);</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> arc_flow_time = timer.<a class="code" href="class_wall_timer.html#aec56fe080959ecebec3feaed9dafde84">Get</a>();</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"The arc-flow grah has "</span> << graph->nodes.size() << <span class="stringliteral">" nodes, and "</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  << graph->arcs.size() << <span class="stringliteral">" arcs. It was created by exploring "</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  << graph->num_dp_states</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  << <span class="stringliteral">" states in the dynamic programming phase in "</span> << arc_flow_time</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  << <span class="stringliteral">" s"</span>;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">return</span> arc_flow_time;</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> }</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> } <span class="comment">// namespace</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> </div><div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1packing.html#a36688ca99be485c512316b4d27ccd409"> 75</a></span> <a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution.html">vbp::VectorBinPackingSolution</a> <a class="code" href="namespaceoperations__research_1_1packing.html#a36688ca99be485c512316b4d27ccd409">SolveVectorBinPackingWithArcFlow</a>(</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_problem.html">vbp::VectorBinPackingProblem</a>& problem,</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <a class="code" href="classoperations__research_1_1_m_p_solver.html#a76c87990aabadd148304b95332a60ff8">MPSolver::OptimizationProblemType</a> solver_type,</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">const</span> std::string& mip_params, <span class="keywordtype">double</span> <a class="code" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>, <span class="keywordtype">int</span> num_threads,</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordtype">int</span> max_bins) {</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph.html">ArcFlowGraph</a> graph;</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> arc_flow_time = ConvertVectorBinPackingProblem(problem, &graph);</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> </div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordtype">int</span> max_num_bins = 0;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">if</span> (max_bins > 0) {</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  max_num_bins = max_bins;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& item : problem.<a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_problem.html#a0663deb6b445005f11af7f2b76898127">item</a>()) {</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  max_num_bins += item.num_copies();</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  }</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  }</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_types = problem.<a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_problem.html#ad9e5623a8a58e6eb71727a33221818dc">item_size</a>();</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  std::vector<std::vector<MPVariable*>> incoming_vars(graph.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph.html#a405100e4926c5c9e6f758d909ce466d6">nodes</a>.size());</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  std::vector<std::vector<MPVariable*>> outgoing_vars(graph.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph.html#a405100e4926c5c9e6f758d909ce466d6">nodes</a>.size());</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  std::vector<MPVariable*> arc_to_var(graph.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph.html#ab3158b0035dffc988c5c8051c97fb37a">arcs</a>.size());</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  std::vector<std::vector<MPVariable*>> item_to_vars(num_types);</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> </div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <a class="code" href="classoperations__research_1_1_m_p_solver.html">MPSolver</a> solver(<span class="stringliteral">"VectorBinPacking"</span>, solver_type);</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <a class="code" href="base_2logging_8h.html#a9f96ed9f06763f0821fdbb4d29031d8d">CHECK_OK</a>(solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#a849bf49baad56df58c018e8ab09456fb">SetNumThreads</a>(num_threads));</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v = 0; v < graph.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph.html#ab3158b0035dffc988c5c8051c97fb37a">arcs</a>.size(); ++v) {</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph_1_1_arc.html">ArcFlowGraph::Arc</a>& arc = graph.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph.html#ab3158b0035dffc988c5c8051c97fb37a">arcs</a>[v];</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <a class="code" href="classoperations__research_1_1_m_p_variable.html">MPVariable</a>* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> =</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#aca3c14720aba5677f473458f706903a7">MakeIntVar</a>(0, max_num_bins, absl::StrCat(<span class="stringliteral">"a"</span>, v));</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  incoming_vars[arc.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph_1_1_arc.html#a17744967a9eda456c21490b51b74917a">destination</a>].push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  outgoing_vars[arc.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph_1_1_arc.html#a07a87b2e6ed927503e2f95f119c9fc23">source</a>].push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">if</span> (arc.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph_1_1_arc.html#a0540161270ce77bf9080009fb3263264">item_index</a> != -1) {</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  item_to_vars[arc.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph_1_1_arc.html#a0540161270ce77bf9080009fb3263264">item_index</a>].push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  }</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  arc_to_var[v] = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>;</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  }</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">// Per item demand constraint.</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_types; ++i) {</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <a class="code" href="classoperations__research_1_1_m_p_constraint.html">MPConstraint</a>* <span class="keyword">const</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#a43d6ca2f978ca6f622a16117166ff69a">MakeRowConstraint</a>(</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  problem.<a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_problem.html#a0663deb6b445005f11af7f2b76898127">item</a>(i).<a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_item.html#a0c0f5a1fc6571f7cb76b6a0d48525882">num_copies</a>(), problem.<a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_problem.html#a0663deb6b445005f11af7f2b76898127">item</a>(i).<a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_item.html#a0c0f5a1fc6571f7cb76b6a0d48525882">num_copies</a>());</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_m_p_variable.html">MPVariable</a>* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : item_to_vars[i]) {</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->SetCoefficient(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, 1.0);</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  }</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> </div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="comment">// Flow conservation.</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> n = 1; n < graph.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph.html#a405100e4926c5c9e6f758d909ce466d6">nodes</a>.size() - 1; ++n) { <span class="comment">// Ignore source and sink.</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <a class="code" href="classoperations__research_1_1_m_p_constraint.html">MPConstraint</a>* <span class="keyword">const</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#a43d6ca2f978ca6f622a16117166ff69a">MakeRowConstraint</a>(0.0, 0.0);</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_m_p_variable.html">MPVariable</a>* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : incoming_vars[n]) {</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->SetCoefficient(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, 1.0);</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  }</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_m_p_variable.html">MPVariable</a>* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : outgoing_vars[n]) {</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->SetCoefficient(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, -1.0);</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  }</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  }</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <a class="code" href="classoperations__research_1_1_m_p_variable.html">MPVariable</a>* <span class="keyword">const</span> obj_var = solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#aca3c14720aba5677f473458f706903a7">MakeIntVar</a>(0, max_num_bins, <span class="stringliteral">"obj_var"</span>);</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  { <span class="comment">// Source.</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <a class="code" href="classoperations__research_1_1_m_p_constraint.html">MPConstraint</a>* <span class="keyword">const</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#a43d6ca2f978ca6f622a16117166ff69a">MakeRowConstraint</a>(0.0, 0.0);</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_m_p_variable.html">MPVariable</a>* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : outgoing_vars[<span class="comment">/*source*/</span> 0]) {</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->SetCoefficient(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, 1.0);</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  }</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->SetCoefficient(obj_var, -1.0);</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  }</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  { <span class="comment">// Sink.</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <a class="code" href="classoperations__research_1_1_m_p_constraint.html">MPConstraint</a>* <span class="keyword">const</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#a43d6ca2f978ca6f622a16117166ff69a">MakeRowConstraint</a>(0.0, 0.0);</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> sink_node = graph.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph.html#a405100e4926c5c9e6f758d909ce466d6">nodes</a>.size() - 1;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_m_p_variable.html">MPVariable</a>* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : incoming_vars[sink_node]) {</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->SetCoefficient(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, 1.0);</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  }</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->SetCoefficient(obj_var, -1.0);</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  }</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <a class="code" href="classoperations__research_1_1_m_p_objective.html">MPObjective</a>* <span class="keyword">const</span> objective = solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#a226456dfb15300dd4e59d0bf80d0ce07">MutableObjective</a>();</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  objective-><a class="code" href="classoperations__research_1_1_m_p_objective.html#a2def997791a2a5119c3502aa68c34181">SetCoefficient</a>(obj_var, 1.0);</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> </div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">if</span> (!absl::GetFlag(FLAGS_arc_flow_dump_model).empty()) {</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <a class="code" href="classoperations__research_1_1_m_p_model_proto.html">MPModelProto</a> output_model;</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#a880227c1bbe5a1a2a21796a947804615">ExportModelToProto</a>(&output_model);</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <a class="code" href="base_2logging_8h.html#a9f96ed9f06763f0821fdbb4d29031d8d">CHECK_OK</a>(<a class="code" href="namespacefile.html#a9af024752012188b3269e30b0d9021c4">file::SetTextProto</a>(absl::GetFlag(FLAGS_arc_flow_dump_model),</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  output_model, <a class="code" href="namespacefile.html#a1abdf766bb120d38e7a4dfa200972681">file::Defaults</a>()));</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  }</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#ad79f6dc56d90d220de25c15f367b888f">EnableOutput</a>();</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#a77083241e8bdb93b619c7b9feaf82dec">SetSolverSpecificParametersAsString</a>(mip_params);</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#aff1d83614c47aa9934d4f9312e6056d4">SetTimeLimit</a>(absl::Seconds(<a class="code" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>));</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_m_p_solver.html#a573d479910e373f5d771d303e440587d">MPSolver::ResultStatus</a> result_status = solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#acede9075c58cb2f506c99a9fe6f20303">Solve</a>();</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution.html">vbp::VectorBinPackingSolution</a> solution;</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  solution.<a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution.html#a350b8fc3491bde92a8934c001e749a95">set_solve_time_in_seconds</a>(solver.<a class="code" href="classoperations__research_1_1_m_p_solver.html#a6129ea627a9a40fc21ddc24914cc6958">wall_time</a>() / 1000.0);</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  solution.<a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution.html#a87758cd330f117395f2077a4ad062180">set_arc_flow_time_in_seconds</a>(arc_flow_time);</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">// Check that the problem has an optimal solution.</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordflow">if</span> (result_status == <a class="code" href="classoperations__research_1_1_m_p_solver.html#a573d479910e373f5d771d303e440587da2579881e7c83261bc21bafb5a5c92cad">MPSolver::OPTIMAL</a>) {</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  solution.<a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution.html#afb4086dc61e1e7e840c158deb1412afa">set_status</a>(<a class="code" href="namespaceoperations__research_1_1packing_1_1vbp.html#a4604191fbd84a43686f44c25d7bd0161a2579881e7c83261bc21bafb5a5c92cad">vbp::OPTIMAL</a>);</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  solution.<a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution.html#a71a3a7fbc5152e2ebff28db19f303fdc">set_objective_value</a>(objective-><a class="code" href="classoperations__research_1_1_m_p_objective.html#a8554e97d98d05016f16300cedf2be9f6">Value</a>());</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (result_status == <a class="code" href="classoperations__research_1_1_m_p_solver.html#a573d479910e373f5d771d303e440587da03f919221217f95d21a593a7120165e1">MPSolver::FEASIBLE</a>) {</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  solution.<a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution.html#afb4086dc61e1e7e840c158deb1412afa">set_status</a>(<a class="code" href="namespaceoperations__research_1_1packing_1_1vbp.html#a4604191fbd84a43686f44c25d7bd0161a03f919221217f95d21a593a7120165e1">vbp::FEASIBLE</a>);</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  solution.<a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution.html#a71a3a7fbc5152e2ebff28db19f303fdc">set_objective_value</a>(objective-><a class="code" href="classoperations__research_1_1_m_p_objective.html#a8554e97d98d05016f16300cedf2be9f6">Value</a>());</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (result_status == <a class="code" href="classoperations__research_1_1_m_p_solver.html#a573d479910e373f5d771d303e440587da2884fa43446c0cbc9c7a9b74d41d7483">MPSolver::INFEASIBLE</a>) {</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  solution.<a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution.html#afb4086dc61e1e7e840c158deb1412afa">set_status</a>(<a class="code" href="namespaceoperations__research_1_1packing_1_1vbp.html#a4604191fbd84a43686f44c25d7bd0161a2884fa43446c0cbc9c7a9b74d41d7483">vbp::INFEASIBLE</a>);</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  }</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordflow">if</span> (result_status == <a class="code" href="classoperations__research_1_1_m_p_solver.html#a573d479910e373f5d771d303e440587da2579881e7c83261bc21bafb5a5c92cad">MPSolver::OPTIMAL</a> ||</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  result_status == <a class="code" href="classoperations__research_1_1_m_p_solver.html#a573d479910e373f5d771d303e440587da03f919221217f95d21a593a7120165e1">MPSolver::FEASIBLE</a>) {</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">// Create the arc flow graph with the flow quantity in each arc.</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keyword">struct </span>NextCountItem {</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordtype">int</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = -1;</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordtype">int</span> count = 0;</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordtype">int</span> item = -1;</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  };</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  std::vector<std::vector<NextCountItem>> node_to_next_count_item(</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  graph.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph.html#a405100e4926c5c9e6f758d909ce466d6">nodes</a>.size());</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v = 0; v < graph.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph.html#ab3158b0035dffc988c5c8051c97fb37a">arcs</a>.size(); ++v) {</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> count =</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  static_cast<int>(std::round(arc_to_var[v]->solution_value()));</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">if</span> (count == 0) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph_1_1_arc.html">ArcFlowGraph::Arc</a>& arc = graph.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph.html#ab3158b0035dffc988c5c8051c97fb37a">arcs</a>[v];</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  node_to_next_count_item[arc.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph_1_1_arc.html#a07a87b2e6ed927503e2f95f119c9fc23">source</a>].push_back(</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  {arc.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph_1_1_arc.html#a17744967a9eda456c21490b51b74917a">destination</a>, count, arc.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph_1_1_arc.html#a0540161270ce77bf9080009fb3263264">item_index</a>});</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  }</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// Unroll each possible path and rebuild bins.</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keyword">struct </span>NextItem {</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordtype">int</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = -1;</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordtype">int</span> item = -1;</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  };</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keyword">const</span> <span class="keyword">auto</span> pop_next_item = [&node_to_next_count_item](<span class="keywordtype">int</span> node) {</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!node_to_next_count_item[node].empty());</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">auto</span>& [<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, count, item] = node_to_next_count_item[node].back();</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, -1);</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(count, 0);</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">if</span> (--count == 0) {</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  node_to_next_count_item[node].pop_back();</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  }</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">return</span> NextItem({<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, item});</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  };</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> </div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> start_node = 0;</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> end_node = graph.<a class="code" href="structoperations__research_1_1packing_1_1_arc_flow_graph.html#a405100e4926c5c9e6f758d909ce466d6">nodes</a>.size() - 1;</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">while</span> (!node_to_next_count_item[start_node].empty()) {</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  absl::btree_map<int, int> item_count;</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordtype">int</span> current = start_node;</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">while</span> (current != end_node) {</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& [<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, item] = pop_next_item(current);</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">if</span> (item != -1) {</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  item_count[item]++;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, end_node);</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  }</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  current = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  }</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_one_bin_in_solution.html">vbp::VectorBinPackingOneBinInSolution</a>* bin = solution.<a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution.html#a38864637751f84007df940f7c10721ff">add_bins</a>();</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& [item, count] : item_count) {</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  bin-><a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_one_bin_in_solution.html#a6fefdadec50f251922f6cb9c23f4b7ca">add_item_indices</a>(item);</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  bin-><a class="code" href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_one_bin_in_solution.html#a8ecbe14eb6143218fa9ed0cb7802eba3">add_item_copies</a>(count);</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  }</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  }</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  }</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> </div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">return</span> solution;</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> }</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> </div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> } <span class="comment">// namespace packing</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="classoperations__research_1_1_m_p_solver_html_a573d479910e373f5d771d303e440587d"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#a573d479910e373f5d771d303e440587d">operations_research::MPSolver::ResultStatus</a></div><div class="ttdeci">ResultStatus</div><div class="ttdoc">The status of solving the problem.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8h_source.html#l00439">linear_solver.h:439</a></div></div>
|
|
<div class="ttc" id="base_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>
|
|
<div class="ttc" id="classoperations__research_1_1_m_p_solver_html_aca3c14720aba5677f473458f706903a7"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#aca3c14720aba5677f473458f706903a7">operations_research::MPSolver::MakeIntVar</a></div><div class="ttdeci">MPVariable * MakeIntVar(double lb, double ub, const std::string &name)</div><div class="ttdoc">Creates an integer variable.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8cc_source.html#l01270">linear_solver.cc:1270</a></div></div>
|
|
<div class="ttc" id="class_wall_timer_html_aec56fe080959ecebec3feaed9dafde84"><div class="ttname"><a href="class_wall_timer.html#aec56fe080959ecebec3feaed9dafde84">WallTimer::Get</a></div><div class="ttdeci">double Get() const</div><div class="ttdef"><b>Definition:</b> <a href="timer_8h_source.html#l00045">timer.h:45</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1packing_1_1_arc_flow_graph_html_a405100e4926c5c9e6f758d909ce466d6"><div class="ttname"><a href="structoperations__research_1_1packing_1_1_arc_flow_graph.html#a405100e4926c5c9e6f758d909ce466d6">operations_research::packing::ArcFlowGraph::nodes</a></div><div class="ttdeci">std::vector< std::vector< int > > nodes</div><div class="ttdef"><b>Definition:</b> <a href="arc__flow__builder_8h_source.html#l00072">arc_flow_builder.h:72</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1packing_html_a36688ca99be485c512316b4d27ccd409"><div class="ttname"><a href="namespaceoperations__research_1_1packing.html#a36688ca99be485c512316b4d27ccd409">operations_research::packing::SolveVectorBinPackingWithArcFlow</a></div><div class="ttdeci">vbp::VectorBinPackingSolution SolveVectorBinPackingWithArcFlow(const vbp::VectorBinPackingProblem &problem, MPSolver::OptimizationProblemType solver_type, const std::string &mip_params, double time_limit, int num_threads, int max_bins)</div><div class="ttdef"><b>Definition:</b> <a href="arc__flow__solver_8cc_source.html#l00075">arc_flow_solver.cc:75</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00254">linear_solver.cc:254</a></div></div>
|
|
<div class="ttc" id="arc__flow__builder_8h_html"><div class="ttname"><a href="arc__flow__builder_8h.html">arc_flow_builder.h</a></div></div>
|
|
<div class="ttc" id="cp__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#l01951">cp_model_solver.cc:1951</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a9f96ed9f06763f0821fdbb4d29031d8d"><div class="ttname"><a href="base_2logging_8h.html#a9f96ed9f06763f0821fdbb4d29031d8d">CHECK_OK</a></div><div class="ttdeci">#define CHECK_OK(x)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00044">base/logging.h:44</a></div></div>
|
|
<div class="ttc" id="namespacefile_html_a9af024752012188b3269e30b0d9021c4"><div class="ttname"><a href="namespacefile.html#a9af024752012188b3269e30b0d9021c4">file::SetTextProto</a></div><div class="ttdeci">absl::Status SetTextProto(const absl::string_view &filename, const google::protobuf::Message &proto, int flags)</div><div class="ttdef"><b>Definition:</b> <a href="base_2file_8cc_source.html#l00285">base/file.cc:285</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00707">base/logging.h:707</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00983">base/logging.h:983</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1packing_1_1_arc_flow_graph_html_ab3158b0035dffc988c5c8051c97fb37a"><div class="ttname"><a href="structoperations__research_1_1packing_1_1_arc_flow_graph.html#ab3158b0035dffc988c5c8051c97fb37a">operations_research::packing::ArcFlowGraph::arcs</a></div><div class="ttdeci">std::vector< Arc > arcs</div><div class="ttdef"><b>Definition:</b> <a href="arc__flow__builder_8h_source.html#l00066">arc_flow_builder.h:66</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00182">linear_solver.cc:182</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00191">linear_solver.h:191</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00960">linear_solver.h:960</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1packing_1_1_arc_flow_graph_1_1_arc_html_a07a87b2e6ed927503e2f95f119c9fc23"><div class="ttname"><a href="structoperations__research_1_1packing_1_1_arc_flow_graph_1_1_arc.html#a07a87b2e6ed927503e2f95f119c9fc23">operations_research::packing::ArcFlowGraph::Arc::source</a></div><div class="ttdeci">int source</div><div class="ttdef"><b>Definition:</b> <a href="arc__flow__builder_8h_source.html#l00058">arc_flow_builder.h:58</a></div></div>
|
|
<div class="ttc" id="class_wall_timer_html_a07aaf1227e4d645f15e0a964f54ef291"><div class="ttname"><a href="class_wall_timer.html#a07aaf1227e4d645f15e0a964f54ef291">WallTimer::Start</a></div><div class="ttdeci">void Start()</div><div class="ttdef"><b>Definition:</b> <a href="timer_8h_source.html#l00031">timer.h:31</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_m_p_solver_html_a226456dfb15300dd4e59d0bf80d0ce07"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#a226456dfb15300dd4e59d0bf80d0ce07">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#l00431">linear_solver.h:431</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_problem_html_ad9e5623a8a58e6eb71727a33221818dc"><div class="ttname"><a href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_problem.html#ad9e5623a8a58e6eb71727a33221818dc">operations_research::packing::vbp::VectorBinPackingProblem::item_size</a></div><div class="ttdeci">int item_size() const</div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l01273">vector_bin_packing.pb.h:1273</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution_html_a350b8fc3491bde92a8934c001e749a95"><div class="ttname"><a href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution.html#a350b8fc3491bde92a8934c001e749a95">operations_research::packing::vbp::VectorBinPackingSolution::set_solve_time_in_seconds</a></div><div class="ttdeci">void set_solve_time_in_seconds(double value)</div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l01577">vector_bin_packing.pb.h:1577</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution_html_a71a3a7fbc5152e2ebff28db19f303fdc"><div class="ttname"><a href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution.html#a71a3a7fbc5152e2ebff28db19f303fdc">operations_research::packing::vbp::VectorBinPackingSolution::set_objective_value</a></div><div class="ttdeci">void set_objective_value(double value)</div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l01557">vector_bin_packing.pb.h:1557</a></div></div>
|
|
<div class="ttc" id="timer_8h_html"><div class="ttname"><a href="timer_8h.html">timer.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution_html_afb4086dc61e1e7e840c158deb1412afa"><div class="ttname"><a href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution.html#afb4086dc61e1e7e840c158deb1412afa">operations_research::packing::vbp::VectorBinPackingSolution::set_status</a></div><div class="ttdeci">void set_status(::operations_research::packing::vbp::VectorBinPackingSolveStatus value)</div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l01537">vector_bin_packing.pb.h:1537</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1packing_1_1vbp_html_a4604191fbd84a43686f44c25d7bd0161a2579881e7c83261bc21bafb5a5c92cad"><div class="ttname"><a href="namespaceoperations__research_1_1packing_1_1vbp.html#a4604191fbd84a43686f44c25d7bd0161a2579881e7c83261bc21bafb5a5c92cad">operations_research::packing::vbp::OPTIMAL</a></div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l00087">vector_bin_packing.pb.h:87</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_m_p_variable_html"><div class="ttname"><a href="classoperations__research_1_1_m_p_variable.html">operations_research::MPVariable</a></div><div class="ttdoc">The class for variables of a Mathematical Programming (MP) model.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8h_source.html#l01087">linear_solver.h:1087</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_m_p_solver_html_a573d479910e373f5d771d303e440587da2579881e7c83261bc21bafb5a5c92cad"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#a573d479910e373f5d771d303e440587da2579881e7c83261bc21bafb5a5c92cad">operations_research::MPSolver::OPTIMAL</a></div><div class="ttdoc">optimal.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8h_source.html#l00441">linear_solver.h:441</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_m_p_solver_html_a6129ea627a9a40fc21ddc24914cc6958"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#a6129ea627a9a40fc21ddc24914cc6958">operations_research::MPSolver::wall_time</a></div><div class="ttdeci">int64_t wall_time() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8h_source.html#l00831">linear_solver.h:831</a></div></div>
|
|
<div class="ttc" id="vector__bin__packing_8pb_8h_html"><div class="ttname"><a href="vector__bin__packing_8pb_8h.html">vector_bin_packing.pb.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_one_bin_in_solution_html"><div class="ttname"><a href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_one_bin_in_solution.html">operations_research::packing::vbp::VectorBinPackingOneBinInSolution</a></div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l00545">vector_bin_packing.pb.h:545</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_m_p_solver_html_a77083241e8bdb93b619c7b9feaf82dec"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#a77083241e8bdb93b619c7b9feaf82dec">operations_research::MPSolver::SetSolverSpecificParametersAsString</a></div><div class="ttdeci">bool SetSolverSpecificParametersAsString(const std::string &parameters)</div><div class="ttdoc">Advanced usage: pass solver specific parameters in text format.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8cc_source.html#l00351">linear_solver.cc:351</a></div></div>
|
|
<div class="ttc" id="arc__flow__solver_8h_html"><div class="ttname"><a href="arc__flow__solver_8h.html">arc_flow_solver.h</a></div></div>
|
|
<div class="ttc" id="constraint__solver_8cc_html_a395f613555f398dd389670bb4c2a4599"><div class="ttname"><a href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a></div><div class="ttdeci">Block * next</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l00678">constraint_solver.cc:678</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1packing_1_1_arc_flow_graph_1_1_arc_html_a17744967a9eda456c21490b51b74917a"><div class="ttname"><a href="structoperations__research_1_1packing_1_1_arc_flow_graph_1_1_arc.html#a17744967a9eda456c21490b51b74917a">operations_research::packing::ArcFlowGraph::Arc::destination</a></div><div class="ttdeci">int destination</div><div class="ttdef"><b>Definition:</b> <a href="arc__flow__builder_8h_source.html#l00059">arc_flow_builder.h:59</a></div></div>
|
|
<div class="ttc" id="arc__flow__solver_8cc_html_a6339fe56643271ddfa529e262e86ee12"><div class="ttname"><a href="arc__flow__solver_8cc.html#a6339fe56643271ddfa529e262e86ee12">ABSL_FLAG</a></div><div class="ttdeci">ABSL_FLAG(std::string, arc_flow_dump_model, "", "File to store the solver specific optimization proto.")</div></div>
|
|
<div class="ttc" id="namespacefile_html_a1abdf766bb120d38e7a4dfa200972681"><div class="ttname"><a href="namespacefile.html#a1abdf766bb120d38e7a4dfa200972681">file::Defaults</a></div><div class="ttdeci">int Defaults()</div><div class="ttdef"><b>Definition:</b> <a href="base_2file_8h_source.html#l00119">base/file.h:119</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1packing_1_1_arc_flow_graph_1_1_arc_html_a0540161270ce77bf9080009fb3263264"><div class="ttname"><a href="structoperations__research_1_1packing_1_1_arc_flow_graph_1_1_arc.html#a0540161270ce77bf9080009fb3263264">operations_research::packing::ArcFlowGraph::Arc::item_index</a></div><div class="ttdeci">int item_index</div><div class="ttdef"><b>Definition:</b> <a href="arc__flow__builder_8h_source.html#l00060">arc_flow_builder.h:60</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_m_p_solver_html_a849bf49baad56df58c018e8ab09456fb"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#a849bf49baad56df58c018e8ab09456fb">operations_research::MPSolver::SetNumThreads</a></div><div class="ttdeci">absl::Status SetNumThreads(int num_threads)</div><div class="ttdoc">Sets the number of threads to use by the underlying solver.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8cc_source.html#l00340">linear_solver.cc:340</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_m_p_solver_html_a573d479910e373f5d771d303e440587da2884fa43446c0cbc9c7a9b74d41d7483"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#a573d479910e373f5d771d303e440587da2884fa43446c0cbc9c7a9b74d41d7483">operations_research::MPSolver::INFEASIBLE</a></div><div class="ttdoc">proven infeasible.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8h_source.html#l00445">linear_solver.h:445</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution_html"><div class="ttname"><a href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution.html">operations_research::packing::vbp::VectorBinPackingSolution</a></div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l00730">vector_bin_packing.pb.h:730</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution_html_a87758cd330f117395f2077a4ad062180"><div class="ttname"><a href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution.html#a87758cd330f117395f2077a4ad062180">operations_research::packing::vbp::VectorBinPackingSolution::set_arc_flow_time_in_seconds</a></div><div class="ttdeci">void set_arc_flow_time_in_seconds(double value)</div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l01597">vector_bin_packing.pb.h:1597</a></div></div>
|
|
<div class="ttc" id="parser_8yy_8cc_html_a5a634cf4429798b1c921a81de8250051"><div class="ttname"><a href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a></div><div class="ttdeci">static int input(yyscan_t yyscanner)</div></div>
|
|
<div class="ttc" id="classoperations__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#l01212">linear_solver.h:1212</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_m_p_solver_html_a573d479910e373f5d771d303e440587da03f919221217f95d21a593a7120165e1"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#a573d479910e373f5d771d303e440587da03f919221217f95d21a593a7120165e1">operations_research::MPSolver::FEASIBLE</a></div><div class="ttdoc">feasible, or stopped by limit.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8h_source.html#l00443">linear_solver.h:443</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_m_p_solver_html_ad79f6dc56d90d220de25c15f367b888f"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#ad79f6dc56d90d220de25c15f367b888f">operations_research::MPSolver::EnableOutput</a></div><div class="ttdeci">void EnableOutput()</div><div class="ttdoc">Enables solver logging.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8cc_source.html#l01667">linear_solver.cc:1667</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00702">base/logging.h:702</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution_html_a38864637751f84007df940f7c10721ff"><div class="ttname"><a href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_solution.html#a38864637751f84007df940f7c10721ff">operations_research::packing::vbp::VectorBinPackingSolution::add_bins</a></div><div class="ttdeci">::operations_research::packing::vbp::VectorBinPackingOneBinInSolution * add_bins()</div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l01511">vector_bin_packing.pb.h:1511</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_problem_html"><div class="ttname"><a href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_problem.html">operations_research::packing::vbp::VectorBinPackingProblem</a></div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l00312">vector_bin_packing.pb.h:312</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_m_p_solver_html_aff1d83614c47aa9934d4f9312e6056d4"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#aff1d83614c47aa9934d4f9312e6056d4">operations_research::MPSolver::SetTimeLimit</a></div><div class="ttdeci">void SetTimeLimit(absl::Duration time_limit)</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8h_source.html#l00720">linear_solver.h:720</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l01390">linear_solver.cc:1390</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00183">linear_solver.h:183</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="commandlineflags_8h_html"><div class="ttname"><a href="commandlineflags_8h.html">commandlineflags.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_one_bin_in_solution_html_a6fefdadec50f251922f6cb9c23f4b7ca"><div class="ttname"><a href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_one_bin_in_solution.html#a6fefdadec50f251922f6cb9c23f4b7ca">operations_research::packing::vbp::VectorBinPackingOneBinInSolution::add_item_indices</a></div><div class="ttdeci">void add_item_indices(int32_t value)</div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l01357">vector_bin_packing.pb.h:1357</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1packing_1_1vbp_html_a4604191fbd84a43686f44c25d7bd0161a03f919221217f95d21a593a7120165e1"><div class="ttname"><a href="namespaceoperations__research_1_1packing_1_1vbp.html#a4604191fbd84a43686f44c25d7bd0161a03f919221217f95d21a593a7120165e1">operations_research::packing::vbp::FEASIBLE</a></div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l00088">vector_bin_packing.pb.h:88</a></div></div>
|
|
<div class="ttc" id="base_2file_8h_html"><div class="ttname"><a href="base_2file_8h.html">file.h</a></div></div>
|
|
<div class="ttc" id="expr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_m_p_model_proto_html"><div class="ttname"><a href="classoperations__research_1_1_m_p_model_proto.html">operations_research::MPModelProto</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8pb_8h_source.html#l02800">linear_solver.pb.h:2800</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1packing_1_1_arc_flow_graph_html"><div class="ttname"><a href="structoperations__research_1_1packing_1_1_arc_flow_graph.html">operations_research::packing::ArcFlowGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="arc__flow__builder_8h_source.html#l00056">arc_flow_builder.h:56</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1packing_1_1vbp_1_1_item_html_a0c0f5a1fc6571f7cb76b6a0d48525882"><div class="ttname"><a href="classoperations__research_1_1packing_1_1vbp_1_1_item.html#a0c0f5a1fc6571f7cb76b6a0d48525882">operations_research::packing::vbp::Item::num_copies</a></div><div class="ttdeci">int32_t num_copies() const</div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l01059">vector_bin_packing.pb.h:1059</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_m_p_solver_html_a880227c1bbe5a1a2a21796a947804615"><div class="ttname"><a href="classoperations__research_1_1_m_p_solver.html#a880227c1bbe5a1a2a21796a947804615">operations_research::MPSolver::ExportModelToProto</a></div><div class="ttdeci">void ExportModelToProto(MPModelProto *output_model) const</div><div class="ttdoc">Exports model to protocol buffer.</div><div class="ttdef"><b>Definition:</b> <a href="linear__solver_8cc_source.html#l01043">linear_solver.cc:1043</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_one_bin_in_solution_html_a8ecbe14eb6143218fa9ed0cb7802eba3"><div class="ttname"><a href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_one_bin_in_solution.html#a8ecbe14eb6143218fa9ed0cb7802eba3">operations_research::packing::vbp::VectorBinPackingOneBinInSolution::add_item_copies</a></div><div class="ttdeci">void add_item_copies(int32_t value)</div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l01404">vector_bin_packing.pb.h:1404</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1packing_html_abf4185c48db1dd3fb87f9d05081de446"><div class="ttname"><a href="namespaceoperations__research_1_1packing.html#abf4185c48db1dd3fb87f9d05081de446">operations_research::packing::BuildArcFlowGraph</a></div><div class="ttdeci">ArcFlowGraph BuildArcFlowGraph(const std::vector< int > &bin_dimensions, const std::vector< std::vector< int >> &item_dimensions_by_type, const std::vector< int > &demand_by_type)</div><div class="ttdef"><b>Definition:</b> <a href="arc__flow__builder_8cc_source.html#l00399">arc_flow_builder.cc:399</a></div></div>
|
|
<div class="ttc" id="class_wall_timer_html"><div class="ttname"><a href="class_wall_timer.html">WallTimer</a></div><div class="ttdef"><b>Definition:</b> <a href="timer_8h_source.html#l00023">timer.h:23</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1packing_1_1vbp_html_a4604191fbd84a43686f44c25d7bd0161a2884fa43446c0cbc9c7a9b74d41d7483"><div class="ttname"><a href="namespaceoperations__research_1_1packing_1_1vbp.html#a4604191fbd84a43686f44c25d7bd0161a2884fa43446c0cbc9c7a9b74d41d7483">operations_research::packing::vbp::INFEASIBLE</a></div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l00089">vector_bin_packing.pb.h:89</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1packing_1_1_arc_flow_graph_1_1_arc_html"><div class="ttname"><a href="structoperations__research_1_1packing_1_1_arc_flow_graph_1_1_arc.html">operations_research::packing::ArcFlowGraph::Arc</a></div><div class="ttdef"><b>Definition:</b> <a href="arc__flow__builder_8h_source.html#l00057">arc_flow_builder.h:57</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l01313">linear_solver.cc:1313</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ab25e01a2942b821d66371fc68d53f2eb"><div class="ttname"><a href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a></div><div class="ttdeci">#define CHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00703">base/logging.h:703</a></div></div>
|
|
<div class="ttc" id="demon__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="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_problem_html_a0663deb6b445005f11af7f2b76898127"><div class="ttname"><a href="classoperations__research_1_1packing_1_1vbp_1_1_vector_bin_packing_problem.html#a0663deb6b445005f11af7f2b76898127">operations_research::packing::vbp::VectorBinPackingProblem::item</a></div><div class="ttdeci">const ::operations_research::packing::vbp::Item & item(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l01291">vector_bin_packing.pb.h:1291</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_9544e94844c800b2034da286ad05b914.html">packing</a></li><li class="navelem"><a class="el" href="arc__flow__solver_8cc.html">arc_flow_solver.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|