989 lines
238 KiB
HTML
989 lines
238 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.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: routing_lp_scheduling.h Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">8.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<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','.html');
|
|
/* @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('routing__lp__scheduling_8h_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">routing_lp_scheduling.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="routing__lp__scheduling_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#ifndef OR_TOOLS_CONSTRAINT_SOLVER_ROUTING_LP_SCHEDULING_H_</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#define OR_TOOLS_CONSTRAINT_SOLVER_ROUTING_LP_SCHEDULING_H_</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>  </div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include "absl/memory/memory.h"</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include "<a class="code" href="mathutil_8h.html">ortools/base/mathutil.h</a>"</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="routing_8h.html">ortools/constraint_solver/routing.h</a>"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="lp__solver_8h.html">ortools/glop/lp_solver.h</a>"</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="lp__types_8h.html">ortools/lp_data/lp_types.h</a>"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="cp__model_8h.html">ortools/sat/cp_model.h</a>"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="cp__model_8pb_8h.html">ortools/sat/cp_model.pb.h</a>"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.h</a>"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  </div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</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="comment">// Classes to solve dimension cumul placement (aka scheduling) problems using</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// linear programming.</span></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="comment">// Utility class used in the core optimizer to tighten the cumul bounds as much</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// as possible based on the model precedences.</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cumul_bounds_propagator.html"> 34</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_cumul_bounds_propagator.html">CumulBoundsPropagator</a> {</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_cumul_bounds_propagator.html#aff8f29b2fce9f6447474ee6077af1b72">CumulBoundsPropagator</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1_cumul_bounds_propagator.html#a72be8a813404822957fbd808d0405226">dimension</a>);</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  </div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="comment">// Tightens the cumul bounds starting from the current cumul var min/max,</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="comment">// and propagating the precedences resulting from the next_accessor, and the</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="comment">// dimension's precedence rules.</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">// Returns false iff the precedences are infeasible with the given routes.</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="comment">// Otherwise, the user can call CumulMin() and CumulMax() to retrieve the new</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="comment">// bounds of an index.</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_cumul_bounds_propagator.html#a54688e4af975568b0bce87cdf9f26781">PropagateCumulBounds</a>(<span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_offset);</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  </div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cumul_bounds_propagator.html#a921806c74f3dd622afc937929b69d627"> 47</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_cumul_bounds_propagator.html#a921806c74f3dd622afc937929b69d627">CumulMin</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordflow">return</span> propagated_bounds_[PositiveNode(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)];</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  }</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  </div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cumul_bounds_propagator.html#a3b5250c6480d24af0c95d1f68a7556b7"> 51</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_cumul_bounds_propagator.html#a3b5250c6480d24af0c95d1f68a7556b7">CumulMax</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> negated_upper_bound = propagated_bounds_[NegativeNode(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)];</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">return</span> negated_upper_bound == <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a> ? <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a> : -negated_upper_bound;</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  }</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  </div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cumul_bounds_propagator.html#a72be8a813404822957fbd808d0405226"> 56</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>& <a class="code" href="classoperations__research_1_1_cumul_bounds_propagator.html#a72be8a813404822957fbd808d0405226">dimension</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> dimension_; }</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  </div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="comment">// An arc "tail --offset--> head" represents the relation</span></div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// tail + offset <= head.</span></div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// As arcs are stored by tail, we don't store it in the struct.</span></div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keyword">struct </span>ArcInfo {</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordtype">int</span> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>;</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> offset;</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>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> kNoParent;</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> kParentToBePropagated;</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  </div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="comment">// Return the node corresponding to the lower bound of the cumul of index and</span></div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="comment">// -index respectively.</span></div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordtype">int</span> PositiveNode(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> 2 * <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>; }</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordtype">int</span> NegativeNode(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> 2 * <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> + 1; }</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  </div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordtype">void</span> AddNodeToQueue(<span class="keywordtype">int</span> node) {</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">if</span> (!node_in_queue_[node]) {</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  bf_queue_.push_back(node);</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  node_in_queue_[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  }</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  }</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  </div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="comment">// Adds the relation first_index + offset <= second_index, by adding arcs</span></div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">// first_index --offset--> second_index and</span></div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// -second_index --offset--> -first_index.</span></div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordtype">void</span> AddArcs(<span class="keywordtype">int</span> first_index, <span class="keywordtype">int</span> second_index, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> offset);</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  </div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordtype">bool</span> InitializeArcsAndBounds(<span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_offset);</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  </div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordtype">bool</span> UpdateCurrentLowerBoundOfNode(<span class="keywordtype">int</span> node, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_lb, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> offset);</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="keywordtype">bool</span> DisassembleSubtree(<span class="keywordtype">int</span> source, <span class="keywordtype">int</span> target);</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  </div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordtype">bool</span> CleanupAndReturnFalse() {</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// We clean-up node_in_queue_ for future calls, and return false.</span></div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node_to_cleanup : bf_queue_) {</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  node_in_queue_[node_to_cleanup] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  bf_queue_.clear();</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  </div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">const</span> RoutingDimension& dimension_;</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> num_nodes_;</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  </div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// TODO(user): Investigate if all arcs for a given tail can be created</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// at the same time, in which case outgoing_arcs_ could point to an absl::Span</span></div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// for each tail index.</span></div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  std::vector<std::vector<ArcInfo>> outgoing_arcs_;</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  </div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  std::deque<int> bf_queue_;</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  std::vector<bool> node_in_queue_;</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  std::vector<int> tree_parent_node_of_;</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="comment">// After calling PropagateCumulBounds(), for each node index n,</span></div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">// propagated_bounds_[2*n] and -propagated_bounds_[2*n+1] respectively contain</span></div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">// the propagated lower and upper bounds of n's cumul variable.</span></div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  std::vector<int64> propagated_bounds_;</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  </div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="comment">// Vector used in DisassembleSubtree() to avoid memory reallocation.</span></div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  std::vector<int> tmp_dfs_stack_;</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">// Used to store the pickup/delivery pairs encountered on the routes.</span></div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  std::vector<std::pair<int64, int64>></div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  visited_pickup_delivery_indices_for_pair_;</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> };</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  </div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8"> 126</a></span> <span class="keyword">enum class</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> {</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">// An optimal solution was found respecting all constraints.</span></div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">OPTIMAL</a>,</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="comment">// An optimal solution was found, however constraints which were relaxed were</span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="comment">// violated.</span></div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af8cfb2115ef7ab822bca8edd1edac285">RELAXED_OPTIMAL_ONLY</a>,</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="comment">// A solution could not be found.</span></div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">INFEASIBLE</a></div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> };</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  </div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html"> 136</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a> {</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af3a7be118910d54c87da7d9ecf7949ac"> 138</a></span>  <span class="keyword">virtual</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af3a7be118910d54c87da7d9ecf7949ac">~RoutingLinearSolverWrapper</a>() {}</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3"> 139</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3">Clear</a>() = 0;</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a6bcbec446b5474e98e50ef78544c82b0"> 140</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a6bcbec446b5474e98e50ef78544c82b0">CreateNewPositiveVariable</a>() = 0;</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a9e2ef65ea95577f9df6ba20c43813573"> 141</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a9e2ef65ea95577f9df6ba20c43813573">SetVariableBounds</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lower_bound,</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> upper_bound) = 0;</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a2ba069bdfbc07dd513d5d140b19fe70d"> 143</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a2ba069bdfbc07dd513d5d140b19fe70d">SetVariableDisjointBounds</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>,</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keyword">const</span> std::vector<int64>& starts,</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keyword">const</span> std::vector<int64>& ends) = 0;</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a7bdd4be7fd06d5c445403fdf3de0eeda"> 146</a></span>  <span class="keyword">virtual</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a7bdd4be7fd06d5c445403fdf3de0eeda">GetVariableLowerBound</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad56b5d5264e07b44be873dfdcd29cb8e"> 147</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad56b5d5264e07b44be873dfdcd29cb8e">SetObjectiveCoefficient</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keywordtype">double</span> <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>) = 0;</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a4812d528a6d93d471be496e9ca79c820"> 148</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a4812d528a6d93d471be496e9ca79c820">GetObjectiveCoefficient</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab8bd6c2ebc0fe292221efda5c39de361"> 149</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab8bd6c2ebc0fe292221efda5c39de361">ClearObjective</a>() = 0;</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a155f6032f05d373d7375078c1be4a01b"> 150</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a155f6032f05d373d7375078c1be4a01b">NumVariables</a>() <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a1923407036f149ea2c31ac37c11e1337"> 151</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a1923407036f149ea2c31ac37c11e1337">CreateNewConstraint</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lower_bound, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> upper_bound) = 0;</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190"> 152</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">SetCoefficient</a>(<span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keywordtype">double</span> <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>) = 0;</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa2e5858c4b94c8f69486993bfe4ffea9"> 153</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa2e5858c4b94c8f69486993bfe4ffea9">IsCPSATSolver</a>() = 0;</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#afbe78c86a32370311f3ab5d5ac3770ca"> 154</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#afbe78c86a32370311f3ab5d5ac3770ca">AddMaximumConstraint</a>(<span class="keywordtype">int</span> max_var, std::vector<int> vars) = 0;</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a589402033ed732725c2053255cb3ffde"> 155</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a589402033ed732725c2053255cb3ffde">AddProductConstraint</a>(<span class="keywordtype">int</span> product_var, std::vector<int> vars) = 0;</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ada616cd8a8068937fd4a72ae741e05d9"> 156</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ada616cd8a8068937fd4a72ae741e05d9">SetEnforcementLiteral</a>(<span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <span class="keywordtype">int</span> condition) = 0;</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb"> 157</a></span>  <span class="keyword">virtual</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb">Solve</a>(absl::Duration duration_limit) = 0;</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a4d08d6a3c275615e7127461d28090923"> 158</a></span>  <span class="keyword">virtual</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a4d08d6a3c275615e7127461d28090923">GetObjectiveValue</a>() <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ac154a773600edab5f5fbc597c5639cce"> 159</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ac154a773600edab5f5fbc597c5639cce">GetValue</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af1eb90688746692ec522c88d501bd598"> 160</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af1eb90688746692ec522c88d501bd598">SolutionIsInteger</a>() <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  </div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="comment">// Adds a variable with bounds [lower_bound, upper_bound].</span></div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad991a1d6dd97f42e55d45dbe336207a5"> 163</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad991a1d6dd97f42e55d45dbe336207a5">AddVariable</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lower_bound, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> upper_bound) {</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(lower_bound, upper_bound);</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> variable = <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a6bcbec446b5474e98e50ef78544c82b0">CreateNewPositiveVariable</a>();</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a9e2ef65ea95577f9df6ba20c43813573">SetVariableBounds</a>(variable, lower_bound, upper_bound);</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">return</span> variable;</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  }</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">// Adds a linear constraint, enforcing</span></div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// lower_bound <= sum variable * coeff <= upper_bound,</span></div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="comment">// and returns the identifier of that constraint.</span></div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a96c0dc62ea646307ec5007fea27721c5"> 172</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a96c0dc62ea646307ec5007fea27721c5">AddLinearConstraint</a>(</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lower_bound, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> upper_bound,</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keyword">const</span> std::vector<std::pair<int, double>>& variable_coeffs) {</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(lower_bound, upper_bound);</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a1923407036f149ea2c31ac37c11e1337">CreateNewConstraint</a>(lower_bound, upper_bound);</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& variable_coeff : variable_coeffs) {</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">SetCoefficient</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, variable_coeff.first, variable_coeff.second);</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  }</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">return</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>;</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  }</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// Adds a linear constraint and a 0/1 variable that is true iff</span></div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="comment">// lower_bound <= sum variable * coeff <= upper_bound,</span></div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="comment">// and returns the identifier of that variable.</span></div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a5b974fe8e4a3772b79aaebf81b5a6a3c"> 185</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a5b974fe8e4a3772b79aaebf81b5a6a3c">AddReifiedLinearConstraint</a>(</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lower_bound, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> upper_bound,</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keyword">const</span> std::vector<std::pair<int, double>>& weighted_variables) {</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> reification_ct = <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a96c0dc62ea646307ec5007fea27721c5">AddLinearConstraint</a>(1, 1, {});</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">if</span> (<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a> < lower_bound) {</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> under_lower_bound = <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad991a1d6dd97f42e55d45dbe336207a5">AddVariable</a>(0, 1);</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">SetCoefficient</a>(reification_ct, under_lower_bound, 1);</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> under_lower_bound_ct =</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a96c0dc62ea646307ec5007fea27721c5">AddLinearConstraint</a>(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>, lower_bound - 1, weighted_variables);</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ada616cd8a8068937fd4a72ae741e05d9">SetEnforcementLiteral</a>(under_lower_bound_ct, under_lower_bound);</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  }</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">if</span> (upper_bound < <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) {</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> above_upper_bound = <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad991a1d6dd97f42e55d45dbe336207a5">AddVariable</a>(0, 1);</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">SetCoefficient</a>(reification_ct, above_upper_bound, 1);</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> above_upper_bound_ct =</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a96c0dc62ea646307ec5007fea27721c5">AddLinearConstraint</a>(upper_bound + 1, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>, weighted_variables);</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ada616cd8a8068937fd4a72ae741e05d9">SetEnforcementLiteral</a>(above_upper_bound_ct, above_upper_bound);</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="keywordtype">int</span> within_bounds = <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad991a1d6dd97f42e55d45dbe336207a5">AddVariable</a>(0, 1);</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">SetCoefficient</a>(reification_ct, within_bounds, 1);</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> within_bounds_ct =</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a96c0dc62ea646307ec5007fea27721c5">AddLinearConstraint</a>(lower_bound, upper_bound, weighted_variables);</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ada616cd8a8068937fd4a72ae741e05d9">SetEnforcementLiteral</a>(within_bounds_ct, within_bounds);</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">return</span> within_bounds;</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  }</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>  </div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html"> 212</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html">RoutingGlopWrapper</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a> {</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a8f7b46f13332393a627d45a46cfff2a1"> 214</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a8f7b46f13332393a627d45a46cfff2a1">RoutingGlopWrapper</a>(<span class="keyword">const</span> glop::GlopParameters& <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>) {</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  lp_solver_.<a class="code" href="classoperations__research_1_1glop_1_1_l_p_solver.html#ae7202d055b6b172a8a1da4f5b136f9ea">SetParameters</a>(<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>);</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#ae3201a343d8df987411b55830bff7fa3">SetMaximizationProblem</a>(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  }</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc"> 218</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc">Clear</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#ae3201a343d8df987411b55830bff7fa3">SetMaximizationProblem</a>(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  allowed_intervals_.clear();</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  }</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a314fad7efb918f0fe41673b65a44253c"> 223</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a314fad7efb918f0fe41673b65a44253c">CreateNewPositiveVariable</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">return</span> linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a695ac3d8db5a986f572711f2ef3a6a39">CreateNewVariable</a>().value();</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  }</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a7c45556ef2ecb1a436d8e6f453af2420"> 226</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a7c45556ef2ecb1a436d8e6f453af2420">SetVariableBounds</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lower_bound,</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> upper_bound)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(lower_bound, 0);</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="comment">// When variable upper bounds are greater than this threshold, precision</span></div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="comment">// issues arise in GLOP. In this case we are just going to suppose that</span></div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="comment">// these high bound values are infinite and not set the upper bound.</span></div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> kMaxValue = 1e10;</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lp_min = lower_bound;</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lp_max =</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  (upper_bound > kMaxValue) ? <a class="code" href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">glop::kInfinity</a> : upper_bound;</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">if</span> (lp_min <= lp_max) {</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a0fe7ba825c8c6cd1efdcff6dec631093">SetVariableBounds</a>(glop::ColIndex(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>), lp_min, lp_max);</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  }</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// The linear_program would not be feasible, and it cannot handle the</span></div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="comment">// lp_min > lp_max case, so we must detect infeasibility here.</span></div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  }</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a1fac1e151a2a309b171a0fee80e9ea8a"> 244</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a1fac1e151a2a309b171a0fee80e9ea8a">SetVariableDisjointBounds</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keyword">const</span> std::vector<int64>& starts,</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keyword">const</span> std::vector<int64>& ends)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">// TODO(user): Investigate if we can avoid rebuilding the interval list</span></div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="comment">// each time (we could keep a reference to the forbidden interval list in</span></div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="comment">// RoutingDimension but we would need to store cumul offsets and use them</span></div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="comment">// when checking intervals).</span></div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  allowed_intervals_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] =</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  absl::make_unique<SortedDisjointIntervalList>(starts, ends);</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  }</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#aaca77a68804fde0a877dc805eb34ba51"> 253</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#aaca77a68804fde0a877dc805eb34ba51">GetVariableLowerBound</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">return</span> linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a4ba664b00317505a0026d2a38e6dd565">variable_lower_bounds</a>()[glop::ColIndex(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)];</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  }</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#af5469274c2e2ba025997a4677d13be80"> 256</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#af5469274c2e2ba025997a4677d13be80">SetObjectiveCoefficient</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keywordtype">double</span> <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#ab5af7f232cddcd91f70be84c0d398ba9">SetObjectiveCoefficient</a>(glop::ColIndex(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>), <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>);</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  }</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a8b4d155c1cccad5c76188e25b49aad47"> 259</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a8b4d155c1cccad5c76188e25b49aad47">GetObjectiveCoefficient</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordflow">return</span> linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a5c8255f82269d42db81cc944eff0180f">objective_coefficients</a>()[glop::ColIndex(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)];</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  }</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068"> 262</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068">ClearObjective</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">for</span> (glop::ColIndex i(0); i < linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#acd8437353d8dc686a75c98b5897dd871">num_variables</a>(); ++i) {</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#ab5af7f232cddcd91f70be84c0d398ba9">SetObjectiveCoefficient</a>(i, 0);</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  }</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  }</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a0d53b135116dda43796783fc1c812f83"> 267</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a0d53b135116dda43796783fc1c812f83">NumVariables</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">return</span> linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#acd8437353d8dc686a75c98b5897dd871">num_variables</a>().value();</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  }</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#aabef85ece915faf927eeb6899690a45a"> 270</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#aabef85ece915faf927eeb6899690a45a">CreateNewConstraint</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lower_bound, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> upper_bound)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keyword">const</span> glop::RowIndex <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#ad9d564651057c77b3f2ca1293134557f">CreateNewConstraint</a>();</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a62b98dec38b6506442f9fc63f1a9b88f">SetConstraintBounds</a>(</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, (lower_bound == <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>) ? -<a class="code" href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">glop::kInfinity</a> : lower_bound,</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  (upper_bound == <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) ? <a class="code" href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">glop::kInfinity</a> : upper_bound);</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">return</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.value();</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  }</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a691ac6745157fb62e18c3d8cf1c4538b"> 277</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a691ac6745157fb62e18c3d8cf1c4538b">SetCoefficient</a>(<span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keywordtype">double</span> <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a2d695f450ae446d5d9c225b991f8d88e">SetCoefficient</a>(glop::RowIndex(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>), glop::ColIndex(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>),</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>);</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  }</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a16adf99185c4a2351c3eb6c9ab44544d"> 281</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a16adf99185c4a2351c3eb6c9ab44544d">IsCPSATSolver</a>()<span class="keyword"> override </span>{ <span class="keywordflow">return</span> <span class="keyword">false</span>; }</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a6f7b90643fd4e207a1167fc9ee517c02"> 282</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a6f7b90643fd4e207a1167fc9ee517c02">AddMaximumConstraint</a>(<span class="keywordtype">int</span> max_var, std::vector<int> vars)<span class="keyword"> override</span>{};</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a73f41f82e421be82b07fe60a42438c3b"> 283</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a73f41f82e421be82b07fe60a42438c3b">AddProductConstraint</a>(<span class="keywordtype">int</span> product_var, std::vector<int> vars)<span class="keyword"> override</span>{};</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a819cbc555690ea6f6f2eadf989455c82"> 284</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a819cbc555690ea6f6f2eadf989455c82">SetEnforcementLiteral</a>(<span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <span class="keywordtype">int</span> condition)<span class="keyword"> override</span>{};</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a671fad375e30cdfe6c95447a43aed2aa"> 285</a></span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a671fad375e30cdfe6c95447a43aed2aa">Solve</a>(absl::Duration duration_limit)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  lp_solver_.<a class="code" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a71b04920d660067fdb3d2f4eaa5c7dc0">GetMutableParameters</a>()->set_max_time_in_seconds(</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  absl::ToDoubleSeconds(duration_limit));</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  </div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="comment">// Because we construct the lp one constraint at a time and we never call</span></div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="comment">// SetCoefficient() on the same variable twice for a constraint, we know</span></div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="comment">// that the columns do not contain duplicates and are already ordered by</span></div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="comment">// constraint so we do not need to call linear_program->CleanUp() which can</span></div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="comment">// be costly. Note that the assumptions are DCHECKed() in the call below.</span></div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#aab451f1144133e621abdcd566c048a8d">NotifyThatColumnsAreClean</a>();</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#ab4a8456683d4572bd9426efab8489e99">Dump</a>();</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9">glop::ProblemStatus</a> status = lp_solver_.<a class="code" href="classoperations__research_1_1glop_1_1_l_p_solver.html#ad0677fd7b636de2bffe3cffca65dcd20">Solve</a>(linear_program_);</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordflow">if</span> (status != <a class="code" href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9af00c8dbdd6e1f11bdae06be94277d293">glop::ProblemStatus::OPTIMAL</a> &&</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  status != <a class="code" href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9a0beacd9ca195de65e685252f1b46b954">glop::ProblemStatus::IMPRECISE</a>) {</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  }</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& allowed_interval : allowed_intervals_) {</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> value_double = <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0">GetValue</a>(allowed_interval.first);</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> = (value_double >= <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>)</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  ? <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a></div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  : <a class="code" href="classoperations__research_1_1_math_util.html#aec89d533eea50ada5268533f068f97ec">MathUtil::FastInt64Round</a>(value_double);</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_sorted_disjoint_interval_list.html">SortedDisjointIntervalList</a>* <span class="keyword">const</span> interval_list =</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  allowed_interval.second.get();</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keyword">const</span> <span class="keyword">auto</span> it = interval_list-><a class="code" href="classoperations__research_1_1_sorted_disjoint_interval_list.html#ac63f8d1453d2e8d7a2718bf978a88ecd">FirstIntervalGreaterOrEqual</a>(<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>);</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">if</span> (it == interval_list-><a class="code" href="classoperations__research_1_1_sorted_disjoint_interval_list.html#a69b6e2a03c835ca5d658a1f16acbaa9c">end</a>() || <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> < it->start) {</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af8cfb2115ef7ab822bca8edd1edac285">DimensionSchedulingStatus::RELAXED_OPTIMAL_ONLY</a>;</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  }</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  }</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">DimensionSchedulingStatus::OPTIMAL</a>;</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  }</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a02c1e01bedd20314aa8de8b69a79b97b"> 316</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a02c1e01bedd20314aa8de8b69a79b97b">GetObjectiveValue</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_math_util.html#aec89d533eea50ada5268533f068f97ec">MathUtil::FastInt64Round</a>(lp_solver_.<a class="code" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a96c1f660991b5007ca24564f69cd27b8">GetObjectiveValue</a>());</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  }</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0"> 319</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0">GetValue</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordflow">return</span> lp_solver_.<a class="code" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a79f4b1dff56ea4e839e0d380019c4869">variable_values</a>()[glop::ColIndex(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)];</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  }</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#aa8f92595bdcd4aefc72ce6c0015d41cb"> 322</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#aa8f92595bdcd4aefc72ce6c0015d41cb">SolutionIsInteger</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordflow">return</span> linear_program_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a887289f2d9928ca7a603fee5b77df258">SolutionIsInteger</a>(lp_solver_.<a class="code" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a79f4b1dff56ea4e839e0d380019c4869">variable_values</a>(),</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="comment">/*absolute_tolerance*/</span> 1e-3);</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  }</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  </div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html">glop::LinearProgram</a> linear_program_;</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <a class="code" href="classoperations__research_1_1glop_1_1_l_p_solver.html">glop::LPSolver</a> lp_solver_;</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  absl::flat_hash_map<int, std::unique_ptr<SortedDisjointIntervalList>></div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  allowed_intervals_;</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span> };</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  </div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html"> 334</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html">RoutingCPSatWrapper</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a> {</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a28fd517263e8003e3e545d646b96d75f"> 336</a></span>  <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a28fd517263e8003e3e545d646b96d75f">RoutingCPSatWrapper</a>() : objective_offset_(0), first_constraint_to_offset_(0) {</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  parameters_.set_num_search_workers(1);</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="comment">// Keeping presolve but with 0 iterations; as of 11/2019 it is</span></div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="comment">// significantly faster than both full presolve and no presolve.</span></div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  parameters_.set_cp_model_presolve(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  parameters_.set_max_presolve_iterations(0);</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  parameters_.set_catch_sigint_signal(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  parameters_.set_mip_max_bound(1e8);</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  parameters_.set_search_branching(sat::SatParameters::LP_SEARCH);</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  }</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a68ad095b727149311d03f62a86c34080"> 346</a></span>  <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a68ad095b727149311d03f62a86c34080">~RoutingCPSatWrapper</a>()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc"> 347</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc">Clear</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  model_.Clear();</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  response_.Clear();</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  objective_coefficients_.clear();</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  objective_offset_ = 0;</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  variable_offset_.clear();</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  constraint_offset_.clear();</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  first_constraint_to_offset_ = 0;</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  }</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a314fad7efb918f0fe41673b65a44253c"> 356</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a314fad7efb918f0fe41673b65a44253c">CreateNewPositiveVariable</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = model_.variables_size();</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> >= variable_offset_.size()) {</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  variable_offset_.resize(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> + 1, 0);</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  }</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  sat::IntegerVariableProto* <span class="keyword">const</span> variable = model_.add_variables();</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  variable->add_domain(0);</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  variable->add_domain(<span class="keyword">static_cast<</span><a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a><span class="keyword">></span>(parameters_.mip_max_bound()));</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">return</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  }</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a7c45556ef2ecb1a436d8e6f453af2420"> 366</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a7c45556ef2ecb1a436d8e6f453af2420">SetVariableBounds</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lower_bound,</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> upper_bound)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(lower_bound, 0);</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="comment">// TODO(user): Find whether there is a way to make the offsetting</span></div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="comment">// system work with other CP-SAT constraints than linear constraints.</span></div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="comment">// variable_offset_[index] = lower_bound;</span></div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  variable_offset_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = 0;</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> offset_upper_bound =</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  std::min<int64>(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(upper_bound, variable_offset_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]),</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  parameters_.mip_max_bound());</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> offset_lower_bound =</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(lower_bound, variable_offset_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordflow">if</span> (offset_lower_bound > offset_upper_bound) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  sat::IntegerVariableProto* <span class="keyword">const</span> variable = model_.mutable_variables(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  variable->set_domain(0, offset_lower_bound);</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  variable->set_domain(1, offset_upper_bound);</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  }</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a1fac1e151a2a309b171a0fee80e9ea8a"> 384</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a1fac1e151a2a309b171a0fee80e9ea8a">SetVariableDisjointBounds</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keyword">const</span> std::vector<int64>& starts,</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keyword">const</span> std::vector<int64>& ends)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(starts.size(), ends.size());</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aabef85ece915faf927eeb6899690a45a">CreateNewConstraint</a>(1, 1);</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < starts.size(); ++i) {</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> variable = <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a314fad7efb918f0fe41673b65a44253c">CreateNewPositiveVariable</a>();</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a7c45556ef2ecb1a436d8e6f453af2420">SetVariableBounds</a>(variable, 0, 1);</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a00bd8299ff5696ff8a0ef53928901955">SetCoefficient</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, variable, 1);</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> window_ct = <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aabef85ece915faf927eeb6899690a45a">CreateNewConstraint</a>(starts[i], ends[i]);</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a00bd8299ff5696ff8a0ef53928901955">SetCoefficient</a>(window_ct, <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, 1);</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  model_.mutable_constraints(window_ct)->add_enforcement_literal(variable);</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  }</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  }</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aaca77a68804fde0a877dc805eb34ba51"> 397</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aaca77a68804fde0a877dc805eb34ba51">GetVariableLowerBound</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(model_.variables(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>).domain(0), variable_offset_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  }</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af5469274c2e2ba025997a4677d13be80"> 400</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af5469274c2e2ba025997a4677d13be80">SetObjectiveCoefficient</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keywordtype">double</span> <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="comment">// TODO(user): Check variable bounds are never set after setting the</span></div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="comment">// objective coefficient.</span></div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> >= objective_coefficients_.size()) {</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  objective_coefficients_.resize(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> + 1, 0);</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  }</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  objective_coefficients_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>;</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  sat::CpObjectiveProto* <span class="keyword">const</span> objective = model_.mutable_objective();</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  objective->add_vars(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  objective->add_coeffs(<a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>);</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  objective_offset_ += <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a> * variable_offset_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  }</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a8b4d155c1cccad5c76188e25b49aad47"> 412</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a8b4d155c1cccad5c76188e25b49aad47">GetObjectiveCoefficient</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordflow">return</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < objective_coefficients_.size())</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  ? objective_coefficients_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  : 0;</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  }</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068"> 417</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068">ClearObjective</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  model_.mutable_objective()->Clear();</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  objective_offset_ = 0;</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  }</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a0d53b135116dda43796783fc1c812f83"> 421</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a0d53b135116dda43796783fc1c812f83">NumVariables</a>()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> model_.variables_size(); }</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aabef85ece915faf927eeb6899690a45a"> 422</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aabef85ece915faf927eeb6899690a45a">CreateNewConstraint</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lower_bound, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> upper_bound)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> ct_index = model_.constraints_size();</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">if</span> (ct_index >= constraint_offset_.size()) {</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  constraint_offset_.resize(ct_index + 1, 0);</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  }</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  sat::LinearConstraintProto* <span class="keyword">const</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> =</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  model_.add_constraints()->mutable_linear();</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->add_domain(lower_bound);</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->add_domain(upper_bound);</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">return</span> ct_index;</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  }</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a00bd8299ff5696ff8a0ef53928901955"> 433</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a00bd8299ff5696ff8a0ef53928901955">SetCoefficient</a>(<span class="keywordtype">int</span> ct_index, <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keywordtype">double</span> <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="comment">// TODO(user): Check variable bounds are never set after setting the</span></div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="comment">// variable coefficient.</span></div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  sat::LinearConstraintProto* <span class="keyword">const</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> =</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  model_.mutable_constraints(ct_index)->mutable_linear();</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->add_vars(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->add_coeffs(<a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>);</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  constraint_offset_[ct_index] =</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(constraint_offset_[ct_index],</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(variable_offset_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>], <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>));</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  }</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a16adf99185c4a2351c3eb6c9ab44544d"> 444</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a16adf99185c4a2351c3eb6c9ab44544d">IsCPSATSolver</a>()<span class="keyword"> override </span>{ <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a6f7b90643fd4e207a1167fc9ee517c02"> 445</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a6f7b90643fd4e207a1167fc9ee517c02">AddMaximumConstraint</a>(<span class="keywordtype">int</span> max_var, std::vector<int> vars)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  sat::LinearArgumentProto* <span class="keyword">const</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> =</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  model_.add_constraints()->mutable_lin_max();</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->mutable_target()->add_vars(max_var);</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->mutable_target()->add_coeffs(1);</div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars) {</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  sat::LinearExpressionProto* <span class="keyword">const</span> expr = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->add_exprs();</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  expr->add_vars(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  expr->add_coeffs(1);</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  }</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  }</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a73f41f82e421be82b07fe60a42438c3b"> 456</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a73f41f82e421be82b07fe60a42438c3b">AddProductConstraint</a>(<span class="keywordtype">int</span> product_var, std::vector<int> vars)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  sat::IntegerArgumentProto* <span class="keyword">const</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> =</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  model_.add_constraints()->mutable_int_prod();</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->set_target(product_var);</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars) {</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->add_vars(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  }</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  }</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a819cbc555690ea6f6f2eadf989455c82"> 464</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a819cbc555690ea6f6f2eadf989455c82">SetEnforcementLiteral</a>(<span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <span class="keywordtype">int</span> condition)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, constraint_offset_.size());</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  model_.mutable_constraints(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>)->add_enforcement_literal(condition);</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  }</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a671fad375e30cdfe6c95447a43aed2aa"> 468</a></span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a671fad375e30cdfe6c95447a43aed2aa">Solve</a>(absl::Duration duration_limit)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="comment">// Set constraint offsets</span></div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ct_index = first_constraint_to_offset_;</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  ct_index < constraint_offset_.size(); ++ct_index) {</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keywordflow">if</span> (!model_.mutable_constraints(ct_index)->has_linear()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  sat::LinearConstraintProto* <span class="keyword">const</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> =</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  model_.mutable_constraints(ct_index)->mutable_linear();</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->set_domain(0, <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->domain(0), constraint_offset_[ct_index]));</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->set_domain(1, <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->domain(1), constraint_offset_[ct_index]));</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  }</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  first_constraint_to_offset_ = constraint_offset_.size();</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  parameters_.set_max_time_in_seconds(absl::ToDoubleSeconds(duration_limit));</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << model_.DebugString();</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordflow">if</span> (hint_.vars_size() == model_.variables_size()) {</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  *model_.mutable_solution_hint() = hint_;</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  }</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <a class="code" href="classoperations__research_1_1sat_1_1_model.html">sat::Model</a> <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>;</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a1684fe34484d78336d3cdac55ec6de57">sat::NewSatParameters</a>(parameters_));</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  response_ = <a class="code" href="namespaceoperations__research_1_1sat.html#aa9299de04255b99318446500127d79e1">sat::SolveCpModel</a>(model_, &<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << response_.DebugString();</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordflow">if</span> (response_.status() == <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2579881e7c83261bc21bafb5a5c92cad">sat::CpSolverStatus::OPTIMAL</a> ||</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  (response_.status() == <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a03f919221217f95d21a593a7120165e1">sat::CpSolverStatus::FEASIBLE</a> &&</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  !model_.has_objective())) {</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  hint_.Clear();</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < response_.solution_size(); ++i) {</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  hint_.add_vars(i);</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  hint_.add_values(response_.solution(i));</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  }</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">DimensionSchedulingStatus::OPTIMAL</a>;</div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  }</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  }</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a02c1e01bedd20314aa8de8b69a79b97b"> 500</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a02c1e01bedd20314aa8de8b69a79b97b">GetObjectiveValue</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_math_util.html#aec89d533eea50ada5268533f068f97ec">MathUtil::FastInt64Round</a>(response_.objective_value() +</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  objective_offset_);</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  }</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0"> 504</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0">GetValue</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keywordflow">return</span> response_.solution(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) + variable_offset_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  }</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aa8f92595bdcd4aefc72ce6c0015d41cb"> 507</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aa8f92595bdcd4aefc72ce6c0015d41cb">SolutionIsInteger</a>()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  </div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  sat::CpModelProto model_;</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  sat::CpSolverResponse response_;</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  sat::SatParameters parameters_;</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  std::vector<double> objective_coefficients_;</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordtype">double</span> objective_offset_;</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  std::vector<int64> variable_offset_;</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  std::vector<int64> constraint_offset_;</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordtype">int</span> first_constraint_to_offset_;</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  sat::PartialVariableAssignment hint_;</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span> };</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  </div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span> <span class="comment">// Utility class used in Local/GlobalDimensionCumulOptimizer to set the linear</span></div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span> <span class="comment">// solver constraints and solve the problem.</span></div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html"> 523</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html">DimensionCumulOptimizerCore</a> {</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a5967f72ac911a2ed971a1ce103d1c47b">DimensionCumulOptimizerCore</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>,</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keywordtype">bool</span> use_precedence_propagator);</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  </div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="comment">// In the OptimizeSingleRoute() and Optimize() methods, if both "cumul_values"</span></div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="comment">// and "cost" parameters are null, we don't optimize the cost and stop at the</span></div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="comment">// first feasible solution in the linear solver (since in this case only</span></div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="comment">// feasibility is of interest).</span></div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#aa24fe74f74450fedf90dce6611f45f17">OptimizeSingleRoute</a>(</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, std::vector<int64>* cumul_values,</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  std::vector<int64>* break_values, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* transit_cost,</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="keywordtype">bool</span> clear_lp = <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  </div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a730ec73f0aaf770badb796973a909dd2">Optimize</a>(<span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver,</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  std::vector<int64>* cumul_values,</div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  std::vector<int64>* break_values, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>,</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* transit_cost, <span class="keywordtype">bool</span> clear_lp = <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  </div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a251eb2e91129b8df8fb7dade1e2a68c6">OptimizeAndPack</a>(<span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver,</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  std::vector<int64>* cumul_values,</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  std::vector<int64>* break_values);</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  </div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a74b47a791351de6312aefe2d0524688f">OptimizeAndPackSingleRoute</a>(</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, std::vector<int64>* cumul_values,</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  std::vector<int64>* break_values);</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  </div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a6769f38bbc3271d45b0512c12ef31f70"> 554</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> dimension_; }</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  </div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="comment">// Initializes the containers and given solver. Must be called prior to</span></div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="comment">// setting any contraints and solving.</span></div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keywordtype">void</span> InitOptimizer(<a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver);</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  </div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="comment">// Computes the minimum/maximum of cumuls for nodes on "route", and sets them</span></div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="comment">// in current_route_[min|max]_cumuls_ respectively.</span></div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="comment">// If the propagator_ is not null, uses the bounds tightened by the</span></div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="comment">// propagator.</span></div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="comment">// Otherwise, the bounds are computed by going over the nodes on the route</span></div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="comment">// using the CP bounds, and the fixed transits are used to tighten them.</span></div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keywordtype">bool</span> ComputeRouteCumulBounds(<span class="keyword">const</span> std::vector<int64>& route,</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keyword">const</span> std::vector<int64>& fixed_transits,</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_offset);</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  </div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="comment">// Sets the constraints for all nodes on "vehicle"'s route according to</span></div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="comment">// "next_accessor". If optimize_costs is true, also sets the objective</span></div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="comment">// coefficients for the LP.</span></div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="comment">// Returns false if some infeasibility was detected, true otherwise.</span></div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="keywordtype">bool</span> SetRouteCumulConstraints(</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_offset, <span class="keywordtype">bool</span> optimize_costs,</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* route_transit_cost,</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* route_cost_offset);</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  </div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="comment">// Sets the global constraints on the dimension, and adds global objective</span></div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="comment">// cost coefficients if optimize_costs is true.</span></div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="comment">// NOTE: When called, the call to this function MUST come after</span></div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="comment">// SetRouteCumulConstraints() has been called on all routes, so that</span></div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="comment">// index_to_cumul_variable_ and min_start/max_end_cumul_ are correctly</span></div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="comment">// initialized.</span></div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordtype">void</span> SetGlobalConstraints(<span class="keywordtype">bool</span> optimize_costs,</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver);</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  </div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordtype">void</span> SetValuesFromLP(<span class="keyword">const</span> std::vector<int>& lp_variables, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> offset,</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver,</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  std::vector<int64>* lp_values);</div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  </div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="comment">// This function packs the routes of the given vehicles while keeping the cost</span></div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="comment">// of the LP lower than its current (supposed optimal) objective value.</span></div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="comment">// It does so by setting the current objective variables' coefficient to 0 and</span></div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="comment">// setting the coefficient of the route ends to 1, to first minimize the route</span></div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="comment">// ends' cumuls, and then maximizes the starts' cumuls without increasing the</span></div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="comment">// ends.</span></div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> PackRoutes(std::vector<int> vehicles,</div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver);</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  </div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  std::unique_ptr<CumulBoundsPropagator> propagator_;</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  std::vector<int64> current_route_min_cumuls_;</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  std::vector<int64> current_route_max_cumuls_;</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <span class="keyword">const</span> dimension_;</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="comment">// Scheduler variables for current route cumuls and for all nodes cumuls.</span></div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  std::vector<int> current_route_cumul_variables_;</div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  std::vector<int> index_to_cumul_variable_;</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="comment">// Scheduler variables for current route breaks and all vehicle breaks.</span></div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="comment">// There are two variables for each break: start and end.</span></div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="comment">// current_route_break_variables_ has variables corresponding to</span></div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="comment">// break[0] start, break[0] end, break[1] start, break[1] end, etc.</span></div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  std::vector<int> current_route_break_variables_;</div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="comment">// Vector all_break_variables contains the break variables of all vehicles,</span></div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="comment">// in the same format as current_route_break_variables.</span></div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="comment">// It is the concatenation of break variables of vehicles in [0, #vehicles).</span></div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  std::vector<int> all_break_variables_;</div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="comment">// Allows to retrieve break variables of a given vehicle: those go from</span></div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="comment">// all_break_variables_[vehicle_to_all_break_variables_offset_[vehicle]] to</span></div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="comment">// all_break_variables[vehicle_to_all_break_variables_offset_[vehicle+1]-1].</span></div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  std::vector<int> vehicle_to_all_break_variables_offset_;</div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  </div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="keywordtype">int</span> max_end_cumul_;</div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keywordtype">int</span> min_start_cumul_;</div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  std::vector<std::pair<int64, int64>></div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  visited_pickup_delivery_indices_for_pair_;</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span> };</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  </div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span> <span class="comment">// Class used to compute optimal values for dimension cumuls of routes,</span></div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span> <span class="comment">// minimizing cumul soft lower and upper bound costs, and vehicle span costs of</span></div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span> <span class="comment">// a route.</span></div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span> <span class="comment">// In its methods, next_accessor is a callback returning the next node of a</span></div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span> <span class="comment">// given node on a route.</span></div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html"> 635</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html">LocalDimensionCumulOptimizer</a> {</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a5bcbf49ff1a9dd9f92c40750ec0267b4">LocalDimensionCumulOptimizer</a>(</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>,</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  RoutingSearchParameters::SchedulingSolver solver_type);</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  </div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="comment">// If feasible, computes the optimal cost of the route performed by a vehicle,</span></div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="comment">// minimizing cumul soft lower and upper bound costs and vehicle span costs,</span></div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="comment">// and stores it in "optimal_cost" (if not null).</span></div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="comment">// Returns true iff the route respects all constraints.</span></div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a6d0f5e1ec4506fe6aa43a19836c0b476">ComputeRouteCumulCost</a>(</div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* optimal_cost);</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  </div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="comment">// Same as ComputeRouteCumulCost, but the cost computed does not contain</span></div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="comment">// the part of the vehicle span cost due to fixed transits.</span></div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#ab165a7061f3391a4948ca7ae06307799">ComputeRouteCumulCostWithoutFixedTransits</a>(</div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* optimal_cost_without_transits);</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  </div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="comment">// If feasible, computes the optimal values for cumul and break variables</span></div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="comment">// of the route performed by a vehicle, minimizing cumul soft lower, upper</span></div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="comment">// bound costs and vehicle span costs, stores them in "optimal_cumuls"</span></div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="comment">// (if not null), and optimal_breaks, and returns true.</span></div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="comment">// Returns false if the route is not feasible.</span></div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a67fc733931c9c43247ce262b1542d399">ComputeRouteCumuls</a>(</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  std::vector<int64>* optimal_cumuls, std::vector<int64>* optimal_breaks);</div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  </div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="comment">// Similar to ComputeRouteCumuls, but also tries to pack the cumul values on</span></div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="comment">// the route, such that the cost remains the same, the cumul of route end is</span></div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <span class="comment">// minimized, and then the cumul of the start of the route is maximized.</span></div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a40f8457f8f4bf714cb5224ce780c7a28">ComputePackedRouteCumuls</a>(</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  std::vector<int64>* packed_cumuls, std::vector<int64>* packed_breaks);</div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  </div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70"> 671</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="keywordflow">return</span> optimizer_core_.<a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>();</div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  }</div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  </div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  std::vector<std::unique_ptr<RoutingLinearSolverWrapper>> solver_;</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html">DimensionCumulOptimizerCore</a> optimizer_core_;</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span> };</div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  </div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html"> 680</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html">GlobalDimensionCumulOptimizer</a> {</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a69c482660dedcd9e709e459c979790a2">GlobalDimensionCumulOptimizer</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>);</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="comment">// If feasible, computes the optimal cost of the entire model with regards to</span></div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="comment">// the optimizer_core_'s dimension costs, minimizing cumul soft lower/upper</span></div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="comment">// bound costs and vehicle/global span costs, and stores it in "optimal_cost"</span></div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="comment">// (if not null).</span></div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="comment">// Returns true iff all the constraints can be respected.</span></div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a90da6b10d66522633bfeefc1289cf05c">ComputeCumulCostWithoutFixedTransits</a>(</div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* optimal_cost_without_transits);</div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="comment">// If feasible, computes the optimal values for cumul and break variables,</span></div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="comment">// minimizing cumul soft lower/upper bound costs and vehicle/global span</span></div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="comment">// costs, stores them in "optimal_cumuls" (if not null) and optimal breaks,</span></div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="comment">// and returns true.</span></div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="comment">// Returns false if the routes are not feasible.</span></div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a199f142227c12a632986167f1e8339cf">ComputeCumuls</a>(<span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  std::vector<int64>* optimal_cumuls,</div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  std::vector<int64>* optimal_breaks);</div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  </div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="comment">// Returns true iff the routes resulting from the next_accessor are feasible</span></div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="comment">// wrt the constraints on the optimizer_core_.dimension()'s cumuls.</span></div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a501d5aa6957f63484392048ba566b0a3">IsFeasible</a>(<span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor);</div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  </div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="comment">// Similar to ComputeCumuls, but also tries to pack the cumul values on all</span></div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="comment">// routes, such that the cost remains the same, the cumuls of route ends are</span></div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="comment">// minimized, and then the cumuls of the starts of the routes are maximized.</span></div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#ab6947109d87c68e3d51e285cc7477070">ComputePackedCumuls</a>(<span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  std::vector<int64>* packed_cumuls,</div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  std::vector<int64>* packed_breaks);</div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  </div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70"> 711</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="keywordflow">return</span> optimizer_core_.<a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>();</div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  }</div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  </div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  std::unique_ptr<RoutingLinearSolverWrapper> solver_;</div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html">DimensionCumulOptimizerCore</a> optimizer_core_;</div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span> };</div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  </div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  </div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span> <span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_CONSTRAINT_SOLVER_ROUTING_LP_SCHEDULING_H_</span></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00889">base/logging.h:889</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab62f5ed8f2d48e29802be0cbbcd1359a"><div class="ttname"><a href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a></div><div class="ttdeci">#define DCHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00888">base/logging.h:888</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae4db23f10f5d4aad6d735f5a74cd6f8c"><div class="ttname"><a href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a></div><div class="ttdeci">#define CHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00699">base/logging.h:699</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00885">base/logging.h:885</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00978">base/logging.h:978</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html">operations_research::CumulBoundsPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00034">routing_lp_scheduling.h:34</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_a3b5250c6480d24af0c95d1f68a7556b7"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#a3b5250c6480d24af0c95d1f68a7556b7">operations_research::CumulBoundsPropagator::CumulMax</a></div><div class="ttdeci">int64 CumulMax(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00051">routing_lp_scheduling.h:51</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_a54688e4af975568b0bce87cdf9f26781"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#a54688e4af975568b0bce87cdf9f26781">operations_research::CumulBoundsPropagator::PropagateCumulBounds</a></div><div class="ttdeci">bool PropagateCumulBounds(const std::function< int64(int64)> &next_accessor, int64 cumul_offset)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00385">routing_lp_scheduling.cc:385</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_a72be8a813404822957fbd808d0405226"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#a72be8a813404822957fbd808d0405226">operations_research::CumulBoundsPropagator::dimension</a></div><div class="ttdeci">const RoutingDimension & dimension() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00056">routing_lp_scheduling.h:56</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_a921806c74f3dd622afc937929b69d627"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#a921806c74f3dd622afc937929b69d627">operations_research::CumulBoundsPropagator::CumulMin</a></div><div class="ttdeci">int64 CumulMin(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00047">routing_lp_scheduling.h:47</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_aff8f29b2fce9f6447474ee6077af1b72"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#aff8f29b2fce9f6447474ee6077af1b72">operations_research::CumulBoundsPropagator::CumulBoundsPropagator</a></div><div class="ttdeci">CumulBoundsPropagator(const RoutingDimension *dimension)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00225">routing_lp_scheduling.cc:225</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html">operations_research::DimensionCumulOptimizerCore</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00523">routing_lp_scheduling.h:523</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a251eb2e91129b8df8fb7dade1e2a68c6"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a251eb2e91129b8df8fb7dade1e2a68c6">operations_research::DimensionCumulOptimizerCore::OptimizeAndPack</a></div><div class="ttdeci">bool OptimizeAndPack(const std::function< int64(int64)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64 > *cumul_values, std::vector< int64 > *break_values)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00567">routing_lp_scheduling.cc:567</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a5967f72ac911a2ed971a1ce103d1c47b"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a5967f72ac911a2ed971a1ce103d1c47b">operations_research::DimensionCumulOptimizerCore::DimensionCumulOptimizerCore</a></div><div class="ttdeci">DimensionCumulOptimizerCore(const RoutingDimension *dimension, bool use_precedence_propagator)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00438">routing_lp_scheduling.cc:438</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a6769f38bbc3271d45b0512c12ef31f70"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a6769f38bbc3271d45b0512c12ef31f70">operations_research::DimensionCumulOptimizerCore::dimension</a></div><div class="ttdeci">const RoutingDimension * dimension() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00554">routing_lp_scheduling.h:554</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a730ec73f0aaf770badb796973a909dd2"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a730ec73f0aaf770badb796973a909dd2">operations_research::DimensionCumulOptimizerCore::Optimize</a></div><div class="ttdeci">bool Optimize(const std::function< int64(int64)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64 > *cumul_values, std::vector< int64 > *break_values, int64 *cost, int64 *transit_cost, bool clear_lp=true)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00505">routing_lp_scheduling.cc:505</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a74b47a791351de6312aefe2d0524688f"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a74b47a791351de6312aefe2d0524688f">operations_research::DimensionCumulOptimizerCore::OptimizeAndPackSingleRoute</a></div><div class="ttdeci">DimensionSchedulingStatus OptimizeAndPackSingleRoute(int vehicle, const std::function< int64(int64)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64 > *cumul_values, std::vector< int64 > *break_values)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00595">routing_lp_scheduling.cc:595</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_aa24fe74f74450fedf90dce6611f45f17"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#aa24fe74f74450fedf90dce6611f45f17">operations_research::DimensionCumulOptimizerCore::OptimizeSingleRoute</a></div><div class="ttdeci">DimensionSchedulingStatus OptimizeSingleRoute(int vehicle, const std::function< int64(int64)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64 > *cumul_values, std::vector< int64 > *break_values, int64 *cost, int64 *transit_cost, bool clear_lp=true)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00462">routing_lp_scheduling.cc:462</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html">operations_research::GlobalDimensionCumulOptimizer</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00680">routing_lp_scheduling.h:680</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a199f142227c12a632986167f1e8339cf"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a199f142227c12a632986167f1e8339cf">operations_research::GlobalDimensionCumulOptimizer::ComputeCumuls</a></div><div class="ttdeci">bool ComputeCumuls(const std::function< int64(int64)> &next_accessor, std::vector< int64 > *optimal_cumuls, std::vector< int64 > *optimal_breaks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01332">routing_lp_scheduling.cc:1332</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a501d5aa6957f63484392048ba566b0a3"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a501d5aa6957f63484392048ba566b0a3">operations_research::GlobalDimensionCumulOptimizer::IsFeasible</a></div><div class="ttdeci">bool IsFeasible(const std::function< int64(int64)> &next_accessor)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01339">routing_lp_scheduling.cc:1339</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a6769f38bbc3271d45b0512c12ef31f70"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70">operations_research::GlobalDimensionCumulOptimizer::dimension</a></div><div class="ttdeci">const RoutingDimension * dimension() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00711">routing_lp_scheduling.h:711</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a69c482660dedcd9e709e459c979790a2"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a69c482660dedcd9e709e459c979790a2">operations_research::GlobalDimensionCumulOptimizer::GlobalDimensionCumulOptimizer</a></div><div class="ttdeci">GlobalDimensionCumulOptimizer(const RoutingDimension *dimension)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01308">routing_lp_scheduling.cc:1308</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a90da6b10d66522633bfeefc1289cf05c"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a90da6b10d66522633bfeefc1289cf05c">operations_research::GlobalDimensionCumulOptimizer::ComputeCumulCostWithoutFixedTransits</a></div><div class="ttdeci">bool ComputeCumulCostWithoutFixedTransits(const std::function< int64(int64)> &next_accessor, int64 *optimal_cost_without_transits)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01317">routing_lp_scheduling.cc:1317</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_ab6947109d87c68e3d51e285cc7477070"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#ab6947109d87c68e3d51e285cc7477070">operations_research::GlobalDimensionCumulOptimizer::ComputePackedCumuls</a></div><div class="ttdeci">bool ComputePackedCumuls(const std::function< int64(int64)> &next_accessor, std::vector< int64 > *packed_cumuls, std::vector< int64 > *packed_breaks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01345">routing_lp_scheduling.cc:1345</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html">operations_research::LocalDimensionCumulOptimizer</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00635">routing_lp_scheduling.h:635</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a40f8457f8f4bf714cb5224ce780c7a28"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a40f8457f8f4bf714cb5224ce780c7a28">operations_research::LocalDimensionCumulOptimizer::ComputePackedRouteCumuls</a></div><div class="ttdeci">DimensionSchedulingStatus ComputePackedRouteCumuls(int vehicle, const std::function< int64(int64)> &next_accessor, std::vector< int64 > *packed_cumuls, std::vector< int64 > *packed_breaks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00214">routing_lp_scheduling.cc:214</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a5bcbf49ff1a9dd9f92c40750ec0267b4"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a5bcbf49ff1a9dd9f92c40750ec0267b4">operations_research::LocalDimensionCumulOptimizer::LocalDimensionCumulOptimizer</a></div><div class="ttdeci">LocalDimensionCumulOptimizer(const RoutingDimension *dimension, RoutingSearchParameters::SchedulingSolver solver_type)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00154">routing_lp_scheduling.cc:154</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a6769f38bbc3271d45b0512c12ef31f70"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70">operations_research::LocalDimensionCumulOptimizer::dimension</a></div><div class="ttdeci">const RoutingDimension * dimension() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00671">routing_lp_scheduling.h:671</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a67fc733931c9c43247ce262b1542d399"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a67fc733931c9c43247ce262b1542d399">operations_research::LocalDimensionCumulOptimizer::ComputeRouteCumuls</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeRouteCumuls(int vehicle, const std::function< int64(int64)> &next_accessor, std::vector< int64 > *optimal_cumuls, std::vector< int64 > *optimal_breaks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00205">routing_lp_scheduling.cc:205</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a6d0f5e1ec4506fe6aa43a19836c0b476"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a6d0f5e1ec4506fe6aa43a19836c0b476">operations_research::LocalDimensionCumulOptimizer::ComputeRouteCumulCost</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeRouteCumulCost(int vehicle, const std::function< int64(int64)> &next_accessor, int64 *optimal_cost)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00181">routing_lp_scheduling.cc:181</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_ab165a7061f3391a4948ca7ae06307799"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#ab165a7061f3391a4948ca7ae06307799">operations_research::LocalDimensionCumulOptimizer::ComputeRouteCumulCostWithoutFixedTransits</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeRouteCumulCostWithoutFixedTransits(int vehicle, const std::function< int64(int64)> &next_accessor, int64 *optimal_cost_without_transits)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00190">routing_lp_scheduling.cc:190</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_math_util_html_aec89d533eea50ada5268533f068f97ec"><div class="ttname"><a href="classoperations__research_1_1_math_util.html#aec89d533eea50ada5268533f068f97ec">operations_research::MathUtil::FastInt64Round</a></div><div class="ttdeci">static int64 FastInt64Round(double x)</div><div class="ttdef"><b>Definition:</b> <a href="mathutil_8h_source.html#l00138">mathutil.h:138</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html">operations_research::RoutingCPSatWrapper</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00334">routing_lp_scheduling.h:334</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a00bd8299ff5696ff8a0ef53928901955"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a00bd8299ff5696ff8a0ef53928901955">operations_research::RoutingCPSatWrapper::SetCoefficient</a></div><div class="ttdeci">void SetCoefficient(int ct_index, int index, double coefficient) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00433">routing_lp_scheduling.h:433</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a02c1e01bedd20314aa8de8b69a79b97b"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a02c1e01bedd20314aa8de8b69a79b97b">operations_research::RoutingCPSatWrapper::GetObjectiveValue</a></div><div class="ttdeci">int64 GetObjectiveValue() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00500">routing_lp_scheduling.h:500</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a0d53b135116dda43796783fc1c812f83"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a0d53b135116dda43796783fc1c812f83">operations_research::RoutingCPSatWrapper::NumVariables</a></div><div class="ttdeci">int NumVariables() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00421">routing_lp_scheduling.h:421</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a16adf99185c4a2351c3eb6c9ab44544d"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a16adf99185c4a2351c3eb6c9ab44544d">operations_research::RoutingCPSatWrapper::IsCPSATSolver</a></div><div class="ttdeci">bool IsCPSATSolver() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00444">routing_lp_scheduling.h:444</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a1fac1e151a2a309b171a0fee80e9ea8a"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a1fac1e151a2a309b171a0fee80e9ea8a">operations_research::RoutingCPSatWrapper::SetVariableDisjointBounds</a></div><div class="ttdeci">void SetVariableDisjointBounds(int index, const std::vector< int64 > &starts, const std::vector< int64 > &ends) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00384">routing_lp_scheduling.h:384</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a28fd517263e8003e3e545d646b96d75f"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a28fd517263e8003e3e545d646b96d75f">operations_research::RoutingCPSatWrapper::RoutingCPSatWrapper</a></div><div class="ttdeci">RoutingCPSatWrapper()</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00336">routing_lp_scheduling.h:336</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a314fad7efb918f0fe41673b65a44253c"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a314fad7efb918f0fe41673b65a44253c">operations_research::RoutingCPSatWrapper::CreateNewPositiveVariable</a></div><div class="ttdeci">int CreateNewPositiveVariable() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00356">routing_lp_scheduling.h:356</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a51b3d2be66ee6c5461945af52e85a8e0"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0">operations_research::RoutingCPSatWrapper::GetValue</a></div><div class="ttdeci">double GetValue(int index) const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00504">routing_lp_scheduling.h:504</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a671fad375e30cdfe6c95447a43aed2aa"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a671fad375e30cdfe6c95447a43aed2aa">operations_research::RoutingCPSatWrapper::Solve</a></div><div class="ttdeci">DimensionSchedulingStatus Solve(absl::Duration duration_limit) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00468">routing_lp_scheduling.h:468</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a68ad095b727149311d03f62a86c34080"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a68ad095b727149311d03f62a86c34080">operations_research::RoutingCPSatWrapper::~RoutingCPSatWrapper</a></div><div class="ttdeci">~RoutingCPSatWrapper() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00346">routing_lp_scheduling.h:346</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a6f7b90643fd4e207a1167fc9ee517c02"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a6f7b90643fd4e207a1167fc9ee517c02">operations_research::RoutingCPSatWrapper::AddMaximumConstraint</a></div><div class="ttdeci">void AddMaximumConstraint(int max_var, std::vector< int > vars) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00445">routing_lp_scheduling.h:445</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a73f41f82e421be82b07fe60a42438c3b"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a73f41f82e421be82b07fe60a42438c3b">operations_research::RoutingCPSatWrapper::AddProductConstraint</a></div><div class="ttdeci">void AddProductConstraint(int product_var, std::vector< int > vars) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00456">routing_lp_scheduling.h:456</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a7c45556ef2ecb1a436d8e6f453af2420"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a7c45556ef2ecb1a436d8e6f453af2420">operations_research::RoutingCPSatWrapper::SetVariableBounds</a></div><div class="ttdeci">bool SetVariableBounds(int index, int64 lower_bound, int64 upper_bound) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00366">routing_lp_scheduling.h:366</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a819cbc555690ea6f6f2eadf989455c82"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a819cbc555690ea6f6f2eadf989455c82">operations_research::RoutingCPSatWrapper::SetEnforcementLiteral</a></div><div class="ttdeci">void SetEnforcementLiteral(int ct, int condition) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00464">routing_lp_scheduling.h:464</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a8b4d155c1cccad5c76188e25b49aad47"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a8b4d155c1cccad5c76188e25b49aad47">operations_research::RoutingCPSatWrapper::GetObjectiveCoefficient</a></div><div class="ttdeci">double GetObjectiveCoefficient(int index) const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00412">routing_lp_scheduling.h:412</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_aa8f92595bdcd4aefc72ce6c0015d41cb"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aa8f92595bdcd4aefc72ce6c0015d41cb">operations_research::RoutingCPSatWrapper::SolutionIsInteger</a></div><div class="ttdeci">bool SolutionIsInteger() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00507">routing_lp_scheduling.h:507</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_aabef85ece915faf927eeb6899690a45a"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aabef85ece915faf927eeb6899690a45a">operations_research::RoutingCPSatWrapper::CreateNewConstraint</a></div><div class="ttdeci">int CreateNewConstraint(int64 lower_bound, int64 upper_bound) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00422">routing_lp_scheduling.h:422</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_aaca77a68804fde0a877dc805eb34ba51"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aaca77a68804fde0a877dc805eb34ba51">operations_research::RoutingCPSatWrapper::GetVariableLowerBound</a></div><div class="ttdeci">int64 GetVariableLowerBound(int index) const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00397">routing_lp_scheduling.h:397</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_ac2fdf117e3886bbce4baa56a77d3e9cc"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc">operations_research::RoutingCPSatWrapper::Clear</a></div><div class="ttdeci">void Clear() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00347">routing_lp_scheduling.h:347</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_af5469274c2e2ba025997a4677d13be80"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af5469274c2e2ba025997a4677d13be80">operations_research::RoutingCPSatWrapper::SetObjectiveCoefficient</a></div><div class="ttdeci">void SetObjectiveCoefficient(int index, double coefficient) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00400">routing_lp_scheduling.h:400</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_af9cf3c86b3e07b1f6761f3d12f04b068"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068">operations_research::RoutingCPSatWrapper::ClearObjective</a></div><div class="ttdeci">void ClearObjective() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00417">routing_lp_scheduling.h:417</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html">operations_research::RoutingDimension</a></div><div class="ttdoc">Dimensions represent quantities accumulated at nodes along the routes.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02357">routing.h:2357</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html">operations_research::RoutingGlopWrapper</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00212">routing_lp_scheduling.h:212</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a02c1e01bedd20314aa8de8b69a79b97b"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a02c1e01bedd20314aa8de8b69a79b97b">operations_research::RoutingGlopWrapper::GetObjectiveValue</a></div><div class="ttdeci">int64 GetObjectiveValue() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00316">routing_lp_scheduling.h:316</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a0d53b135116dda43796783fc1c812f83"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a0d53b135116dda43796783fc1c812f83">operations_research::RoutingGlopWrapper::NumVariables</a></div><div class="ttdeci">int NumVariables() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00267">routing_lp_scheduling.h:267</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a16adf99185c4a2351c3eb6c9ab44544d"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a16adf99185c4a2351c3eb6c9ab44544d">operations_research::RoutingGlopWrapper::IsCPSATSolver</a></div><div class="ttdeci">bool IsCPSATSolver() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00281">routing_lp_scheduling.h:281</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a1fac1e151a2a309b171a0fee80e9ea8a"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a1fac1e151a2a309b171a0fee80e9ea8a">operations_research::RoutingGlopWrapper::SetVariableDisjointBounds</a></div><div class="ttdeci">void SetVariableDisjointBounds(int index, const std::vector< int64 > &starts, const std::vector< int64 > &ends) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00244">routing_lp_scheduling.h:244</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a314fad7efb918f0fe41673b65a44253c"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a314fad7efb918f0fe41673b65a44253c">operations_research::RoutingGlopWrapper::CreateNewPositiveVariable</a></div><div class="ttdeci">int CreateNewPositiveVariable() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00223">routing_lp_scheduling.h:223</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a51b3d2be66ee6c5461945af52e85a8e0"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0">operations_research::RoutingGlopWrapper::GetValue</a></div><div class="ttdeci">double GetValue(int index) const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00319">routing_lp_scheduling.h:319</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a671fad375e30cdfe6c95447a43aed2aa"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a671fad375e30cdfe6c95447a43aed2aa">operations_research::RoutingGlopWrapper::Solve</a></div><div class="ttdeci">DimensionSchedulingStatus Solve(absl::Duration duration_limit) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00285">routing_lp_scheduling.h:285</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a691ac6745157fb62e18c3d8cf1c4538b"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a691ac6745157fb62e18c3d8cf1c4538b">operations_research::RoutingGlopWrapper::SetCoefficient</a></div><div class="ttdeci">void SetCoefficient(int ct, int index, double coefficient) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00277">routing_lp_scheduling.h:277</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a6f7b90643fd4e207a1167fc9ee517c02"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a6f7b90643fd4e207a1167fc9ee517c02">operations_research::RoutingGlopWrapper::AddMaximumConstraint</a></div><div class="ttdeci">void AddMaximumConstraint(int max_var, std::vector< int > vars) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00282">routing_lp_scheduling.h:282</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a73f41f82e421be82b07fe60a42438c3b"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a73f41f82e421be82b07fe60a42438c3b">operations_research::RoutingGlopWrapper::AddProductConstraint</a></div><div class="ttdeci">void AddProductConstraint(int product_var, std::vector< int > vars) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00283">routing_lp_scheduling.h:283</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a7c45556ef2ecb1a436d8e6f453af2420"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a7c45556ef2ecb1a436d8e6f453af2420">operations_research::RoutingGlopWrapper::SetVariableBounds</a></div><div class="ttdeci">bool SetVariableBounds(int index, int64 lower_bound, int64 upper_bound) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00226">routing_lp_scheduling.h:226</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a819cbc555690ea6f6f2eadf989455c82"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a819cbc555690ea6f6f2eadf989455c82">operations_research::RoutingGlopWrapper::SetEnforcementLiteral</a></div><div class="ttdeci">void SetEnforcementLiteral(int ct, int condition) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00284">routing_lp_scheduling.h:284</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a8b4d155c1cccad5c76188e25b49aad47"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a8b4d155c1cccad5c76188e25b49aad47">operations_research::RoutingGlopWrapper::GetObjectiveCoefficient</a></div><div class="ttdeci">double GetObjectiveCoefficient(int index) const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00259">routing_lp_scheduling.h:259</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a8f7b46f13332393a627d45a46cfff2a1"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a8f7b46f13332393a627d45a46cfff2a1">operations_research::RoutingGlopWrapper::RoutingGlopWrapper</a></div><div class="ttdeci">RoutingGlopWrapper(const glop::GlopParameters &parameters)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00214">routing_lp_scheduling.h:214</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_aa8f92595bdcd4aefc72ce6c0015d41cb"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#aa8f92595bdcd4aefc72ce6c0015d41cb">operations_research::RoutingGlopWrapper::SolutionIsInteger</a></div><div class="ttdeci">bool SolutionIsInteger() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00322">routing_lp_scheduling.h:322</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_aabef85ece915faf927eeb6899690a45a"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#aabef85ece915faf927eeb6899690a45a">operations_research::RoutingGlopWrapper::CreateNewConstraint</a></div><div class="ttdeci">int CreateNewConstraint(int64 lower_bound, int64 upper_bound) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00270">routing_lp_scheduling.h:270</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_aaca77a68804fde0a877dc805eb34ba51"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#aaca77a68804fde0a877dc805eb34ba51">operations_research::RoutingGlopWrapper::GetVariableLowerBound</a></div><div class="ttdeci">int64 GetVariableLowerBound(int index) const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00253">routing_lp_scheduling.h:253</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_ac2fdf117e3886bbce4baa56a77d3e9cc"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc">operations_research::RoutingGlopWrapper::Clear</a></div><div class="ttdeci">void Clear() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00218">routing_lp_scheduling.h:218</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_af5469274c2e2ba025997a4677d13be80"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#af5469274c2e2ba025997a4677d13be80">operations_research::RoutingGlopWrapper::SetObjectiveCoefficient</a></div><div class="ttdeci">void SetObjectiveCoefficient(int index, double coefficient) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00256">routing_lp_scheduling.h:256</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_af9cf3c86b3e07b1f6761f3d12f04b068"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068">operations_research::RoutingGlopWrapper::ClearObjective</a></div><div class="ttdeci">void ClearObjective() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00262">routing_lp_scheduling.h:262</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html">operations_research::RoutingLinearSolverWrapper</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00136">routing_lp_scheduling.h:136</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a01ce5bca7f91b37ff459b4d7b63e5190"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">operations_research::RoutingLinearSolverWrapper::SetCoefficient</a></div><div class="ttdeci">virtual void SetCoefficient(int ct, int index, double coefficient)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a155f6032f05d373d7375078c1be4a01b"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a155f6032f05d373d7375078c1be4a01b">operations_research::RoutingLinearSolverWrapper::NumVariables</a></div><div class="ttdeci">virtual int NumVariables() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a1923407036f149ea2c31ac37c11e1337"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a1923407036f149ea2c31ac37c11e1337">operations_research::RoutingLinearSolverWrapper::CreateNewConstraint</a></div><div class="ttdeci">virtual int CreateNewConstraint(int64 lower_bound, int64 upper_bound)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a2ba069bdfbc07dd513d5d140b19fe70d"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a2ba069bdfbc07dd513d5d140b19fe70d">operations_research::RoutingLinearSolverWrapper::SetVariableDisjointBounds</a></div><div class="ttdeci">virtual void SetVariableDisjointBounds(int index, const std::vector< int64 > &starts, const std::vector< int64 > &ends)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a4812d528a6d93d471be496e9ca79c820"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a4812d528a6d93d471be496e9ca79c820">operations_research::RoutingLinearSolverWrapper::GetObjectiveCoefficient</a></div><div class="ttdeci">virtual double GetObjectiveCoefficient(int index) const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a4d08d6a3c275615e7127461d28090923"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a4d08d6a3c275615e7127461d28090923">operations_research::RoutingLinearSolverWrapper::GetObjectiveValue</a></div><div class="ttdeci">virtual int64 GetObjectiveValue() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a589402033ed732725c2053255cb3ffde"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a589402033ed732725c2053255cb3ffde">operations_research::RoutingLinearSolverWrapper::AddProductConstraint</a></div><div class="ttdeci">virtual void AddProductConstraint(int product_var, std::vector< int > vars)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a5b974fe8e4a3772b79aaebf81b5a6a3c"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a5b974fe8e4a3772b79aaebf81b5a6a3c">operations_research::RoutingLinearSolverWrapper::AddReifiedLinearConstraint</a></div><div class="ttdeci">int AddReifiedLinearConstraint(int64 lower_bound, int64 upper_bound, const std::vector< std::pair< int, double >> &weighted_variables)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00185">routing_lp_scheduling.h:185</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a6bcbec446b5474e98e50ef78544c82b0"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a6bcbec446b5474e98e50ef78544c82b0">operations_research::RoutingLinearSolverWrapper::CreateNewPositiveVariable</a></div><div class="ttdeci">virtual int CreateNewPositiveVariable()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a7bdd4be7fd06d5c445403fdf3de0eeda"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a7bdd4be7fd06d5c445403fdf3de0eeda">operations_research::RoutingLinearSolverWrapper::GetVariableLowerBound</a></div><div class="ttdeci">virtual int64 GetVariableLowerBound(int index) const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a96c0dc62ea646307ec5007fea27721c5"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a96c0dc62ea646307ec5007fea27721c5">operations_research::RoutingLinearSolverWrapper::AddLinearConstraint</a></div><div class="ttdeci">int AddLinearConstraint(int64 lower_bound, int64 upper_bound, const std::vector< std::pair< int, double >> &variable_coeffs)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00172">routing_lp_scheduling.h:172</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a9e2ef65ea95577f9df6ba20c43813573"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a9e2ef65ea95577f9df6ba20c43813573">operations_research::RoutingLinearSolverWrapper::SetVariableBounds</a></div><div class="ttdeci">virtual bool SetVariableBounds(int index, int64 lower_bound, int64 upper_bound)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_aa2e5858c4b94c8f69486993bfe4ffea9"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa2e5858c4b94c8f69486993bfe4ffea9">operations_research::RoutingLinearSolverWrapper::IsCPSATSolver</a></div><div class="ttdeci">virtual bool IsCPSATSolver()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_aa5b31c976cc6734003d9950e731dfed3"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3">operations_research::RoutingLinearSolverWrapper::Clear</a></div><div class="ttdeci">virtual void Clear()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ab8bd6c2ebc0fe292221efda5c39de361"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab8bd6c2ebc0fe292221efda5c39de361">operations_research::RoutingLinearSolverWrapper::ClearObjective</a></div><div class="ttdeci">virtual void ClearObjective()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ac154a773600edab5f5fbc597c5639cce"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ac154a773600edab5f5fbc597c5639cce">operations_research::RoutingLinearSolverWrapper::GetValue</a></div><div class="ttdeci">virtual double GetValue(int index) const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_acb5447abf2fd0ef52e46ce561ffef5cb"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb">operations_research::RoutingLinearSolverWrapper::Solve</a></div><div class="ttdeci">virtual DimensionSchedulingStatus Solve(absl::Duration duration_limit)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ad56b5d5264e07b44be873dfdcd29cb8e"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad56b5d5264e07b44be873dfdcd29cb8e">operations_research::RoutingLinearSolverWrapper::SetObjectiveCoefficient</a></div><div class="ttdeci">virtual void SetObjectiveCoefficient(int index, double coefficient)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ad991a1d6dd97f42e55d45dbe336207a5"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad991a1d6dd97f42e55d45dbe336207a5">operations_research::RoutingLinearSolverWrapper::AddVariable</a></div><div class="ttdeci">int AddVariable(int64 lower_bound, int64 upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00163">routing_lp_scheduling.h:163</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ada616cd8a8068937fd4a72ae741e05d9"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ada616cd8a8068937fd4a72ae741e05d9">operations_research::RoutingLinearSolverWrapper::SetEnforcementLiteral</a></div><div class="ttdeci">virtual void SetEnforcementLiteral(int ct, int condition)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_af1eb90688746692ec522c88d501bd598"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af1eb90688746692ec522c88d501bd598">operations_research::RoutingLinearSolverWrapper::SolutionIsInteger</a></div><div class="ttdeci">virtual bool SolutionIsInteger() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_af3a7be118910d54c87da7d9ecf7949ac"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af3a7be118910d54c87da7d9ecf7949ac">operations_research::RoutingLinearSolverWrapper::~RoutingLinearSolverWrapper</a></div><div class="ttdeci">virtual ~RoutingLinearSolverWrapper()</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00138">routing_lp_scheduling.h:138</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_afbe78c86a32370311f3ab5d5ac3770ca"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#afbe78c86a32370311f3ab5d5ac3770ca">operations_research::RoutingLinearSolverWrapper::AddMaximumConstraint</a></div><div class="ttdeci">virtual void AddMaximumConstraint(int max_var, std::vector< int > vars)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sorted_disjoint_interval_list_html"><div class="ttname"><a href="classoperations__research_1_1_sorted_disjoint_interval_list.html">operations_research::SortedDisjointIntervalList</a></div><div class="ttdoc">This class represents a sorted list of disjoint, closed intervals.</div><div class="ttdef"><b>Definition:</b> <a href="sorted__interval__list_8h_source.html#l00390">sorted_interval_list.h:390</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sorted_disjoint_interval_list_html_a69b6e2a03c835ca5d658a1f16acbaa9c"><div class="ttname"><a href="classoperations__research_1_1_sorted_disjoint_interval_list.html#a69b6e2a03c835ca5d658a1f16acbaa9c">operations_research::SortedDisjointIntervalList::end</a></div><div class="ttdeci">ConstIterator end() const</div><div class="ttdef"><b>Definition:</b> <a href="sorted__interval__list_8h_source.html#l00484">sorted_interval_list.h:484</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sorted_disjoint_interval_list_html_ac63f8d1453d2e8d7a2718bf978a88ecd"><div class="ttname"><a href="classoperations__research_1_1_sorted_disjoint_interval_list.html#ac63f8d1453d2e8d7a2718bf978a88ecd">operations_research::SortedDisjointIntervalList::FirstIntervalGreaterOrEqual</a></div><div class="ttdeci">Iterator FirstIntervalGreaterOrEqual(int64 value) const</div><div class="ttdoc">Returns an iterator to either:</div><div class="ttdef"><b>Definition:</b> <a href="sorted__interval__list_8cc_source.html#l00726">sorted_interval_list.cc:726</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html">operations_research::glop::LPSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8h_source.html#l00029">lp_solver.h:29</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_a71b04920d660067fdb3d2f4eaa5c7dc0"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#a71b04920d660067fdb3d2f4eaa5c7dc0">operations_research::glop::LPSolver::GetMutableParameters</a></div><div class="ttdeci">GlopParameters * GetMutableParameters()</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00119">lp_solver.cc:119</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_a79f4b1dff56ea4e839e0d380019c4869"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#a79f4b1dff56ea4e839e0d380019c4869">operations_research::glop::LPSolver::variable_values</a></div><div class="ttdeci">const DenseRow & variable_values() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8h_source.html#l00100">lp_solver.h:100</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_a96c1f660991b5007ca24564f69cd27b8"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#a96c1f660991b5007ca24564f69cd27b8">operations_research::glop::LPSolver::GetObjectiveValue</a></div><div class="ttdeci">Fractional GetObjectiveValue() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00476">lp_solver.cc:476</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_ad0677fd7b636de2bffe3cffca65dcd20"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#ad0677fd7b636de2bffe3cffca65dcd20">operations_research::glop::LPSolver::Solve</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT ProblemStatus Solve(const LinearProgram &lp)</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00121">lp_solver.cc:121</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_ae7202d055b6b172a8a1da4f5b136f9ea"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#ae7202d055b6b172a8a1da4f5b136f9ea">operations_research::glop::LPSolver::SetParameters</a></div><div class="ttdeci">void SetParameters(const GlopParameters &parameters)</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00113">lp_solver.cc:113</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html">operations_research::glop::LinearProgram</a></div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8h_source.html#l00054">lp_data.h:54</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_a0fe7ba825c8c6cd1efdcff6dec631093"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a0fe7ba825c8c6cd1efdcff6dec631093">operations_research::glop::LinearProgram::SetVariableBounds</a></div><div class="ttdeci">void SetVariableBounds(ColIndex col, Fractional lower_bound, Fractional upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00248">lp_data.cc:248</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_a2d695f450ae446d5d9c225b991f8d88e"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a2d695f450ae446d5d9c225b991f8d88e">operations_research::glop::LinearProgram::SetCoefficient</a></div><div class="ttdeci">void SetCoefficient(RowIndex row, ColIndex col, Fractional value)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00316">lp_data.cc:316</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_a4ba664b00317505a0026d2a38e6dd565"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a4ba664b00317505a0026d2a38e6dd565">operations_research::glop::LinearProgram::variable_lower_bounds</a></div><div class="ttdeci">const DenseRow & variable_lower_bounds() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8h_source.html#l00228">lp_data.h:228</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_a5c8255f82269d42db81cc944eff0180f"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a5c8255f82269d42db81cc944eff0180f">operations_research::glop::LinearProgram::objective_coefficients</a></div><div class="ttdeci">const DenseRow & objective_coefficients() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8h_source.html#l00222">lp_data.h:222</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_a62b98dec38b6506442f9fc63f1a9b88f"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a62b98dec38b6506442f9fc63f1a9b88f">operations_research::glop::LinearProgram::SetConstraintBounds</a></div><div class="ttdeci">void SetConstraintBounds(RowIndex row, Fractional lower_bound, Fractional upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00308">lp_data.cc:308</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_a695ac3d8db5a986f572711f2ef3a6a39"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a695ac3d8db5a986f572711f2ef3a6a39">operations_research::glop::LinearProgram::CreateNewVariable</a></div><div class="ttdeci">ColIndex CreateNewVariable()</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00161">lp_data.cc:161</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_a887289f2d9928ca7a603fee5b77df258"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a887289f2d9928ca7a603fee5b77df258">operations_research::glop::LinearProgram::SolutionIsInteger</a></div><div class="ttdeci">bool SolutionIsInteger(const DenseRow &solution, Fractional absolute_tolerance) const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00515">lp_data.cc:515</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::glop::LinearProgram::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00133">lp_data.cc:133</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_aab451f1144133e621abdcd566c048a8d"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#aab451f1144133e621abdcd566c048a8d">operations_research::glop::LinearProgram::NotifyThatColumnsAreClean</a></div><div class="ttdeci">void NotifyThatColumnsAreClean()</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8h_source.html#l00539">lp_data.h:539</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_ab4a8456683d4572bd9426efab8489e99"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#ab4a8456683d4572bd9426efab8489e99">operations_research::glop::LinearProgram::Dump</a></div><div class="ttdeci">std::string Dump() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00558">lp_data.cc:558</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_ab5af7f232cddcd91f70be84c0d398ba9"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#ab5af7f232cddcd91f70be84c0d398ba9">operations_research::glop::LinearProgram::SetObjectiveCoefficient</a></div><div class="ttdeci">void SetObjectiveCoefficient(ColIndex col, Fractional value)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00325">lp_data.cc:325</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_acd8437353d8dc686a75c98b5897dd871"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#acd8437353d8dc686a75c98b5897dd871">operations_research::glop::LinearProgram::num_variables</a></div><div class="ttdeci">ColIndex num_variables() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8h_source.html#l00204">lp_data.h:204</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_ad9d564651057c77b3f2ca1293134557f"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#ad9d564651057c77b3f2ca1293134557f">operations_research::glop::LinearProgram::CreateNewConstraint</a></div><div class="ttdeci">RowIndex CreateNewConstraint()</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00190">lp_data.cc:190</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_ae3201a343d8df987411b55830bff7fa3"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#ae3201a343d8df987411b55830bff7fa3">operations_research::glop::LinearProgram::SetMaximizationProblem</a></div><div class="ttdeci">void SetMaximizationProblem(bool maximize)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00342">lp_data.cc:342</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00038">sat/model.h:38</a></div></div>
|
|
<div class="ttc" id="acp__model_8h_html"><div class="ttname"><a href="cp__model_8h.html">cp_model.h</a></div><div class="ttdoc">This file implements a wrapper around the CP-SAT model proto.</div></div>
|
|
<div class="ttc" id="acp__model_8pb_8h_html"><div class="ttname"><a href="cp__model_8pb_8h.html">cp_model.pb.h</a></div></div>
|
|
<div class="ttc" id="acp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a></div><div class="ttdeci">SatParameters parameters</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00108">cp_model_fz_solver.cc:108</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695"><div class="ttname"><a href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a></div><div class="ttdeci">const Constraint * ct</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00042">demon_profiler.cc:42</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a21edc7ca4cc5802c8779d68556bc09cf"><div class="ttname"><a href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a></div><div class="ttdeci">int64 value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01858">expr_array.cc:1858</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00272">gurobi_interface.cc:272</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a74ea76ea27f48fb1b6e148e1577b3719"><div class="ttname"><a href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a></div><div class="ttdeci">static const int64 kint64max</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00062">integral_types.h:62</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_af458164b470cbba416d5ed579e00ff60"><div class="ttname"><a href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a></div><div class="ttdeci">static const int64 kint64min</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00060">integral_types.h:60</a></div></div>
|
|
<div class="ttc" id="alp__solver_8h_html"><div class="ttname"><a href="lp__solver_8h.html">lp_solver.h</a></div></div>
|
|
<div class="ttc" id="alp__types_8h_html"><div class="ttname"><a href="lp__types_8h.html">lp_types.h</a></div></div>
|
|
<div class="ttc" id="amathutil_8h_html"><div class="ttname"><a href="mathutil_8h.html">mathutil.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_ae8a885303349cb7807c7c87b405bc0c9"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9">operations_research::glop::ProblemStatus</a></div><div class="ttdeci">ProblemStatus</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00101">lp_types.h:101</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_ae8a885303349cb7807c7c87b405bc0c9a0beacd9ca195de65e685252f1b46b954"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9a0beacd9ca195de65e685252f1b46b954">operations_research::glop::ProblemStatus::IMPRECISE</a></div><div class="ttdeci">@ IMPRECISE</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_ae8a885303349cb7807c7c87b405bc0c9af00c8dbdd6e1f11bdae06be94277d293"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#ae8a885303349cb7807c7c87b405bc0c9af00c8dbdd6e1f11bdae06be94277d293">operations_research::glop::ProblemStatus::OPTIMAL</a></div><div class="ttdeci">@ OPTIMAL</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_af9a790b7e8c5b0c6d55b336177378e78"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">operations_research::glop::kInfinity</a></div><div class="ttdeci">const double kInfinity</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00083">lp_types.h:83</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1684fe34484d78336d3cdac55ec6de57"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1684fe34484d78336d3cdac55ec6de57">operations_research::sat::NewSatParameters</a></div><div class="ttdeci">std::function< SatParameters(Model *)> NewSatParameters(const std::string &params)</div><div class="ttdoc">Creates parameters for the solver, which you can add to the model with.</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l00921">cp_model_solver.cc:921</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aa9299de04255b99318446500127d79e1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa9299de04255b99318446500127d79e1">operations_research::sat::SolveCpModel</a></div><div class="ttdeci">CpSolverResponse SolveCpModel(const CpModelProto &model_proto, Model *model)</div><div class="ttdoc">Solves the given CpModelProto.</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02878">cp_model_solver.cc:2878</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aedc4ddb96acc28481c09828d2e016815a03f919221217f95d21a593a7120165e1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a03f919221217f95d21a593a7120165e1">operations_research::sat::FEASIBLE</a></div><div class="ttdeci">@ FEASIBLE</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l00225">cp_model.pb.h:225</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aedc4ddb96acc28481c09828d2e016815a2579881e7c83261bc21bafb5a5c92cad"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2579881e7c83261bc21bafb5a5c92cad">operations_research::sat::OPTIMAL</a></div><div class="ttdeci">@ OPTIMAL</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l00227">cp_model.pb.h:227</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a228fe84d99348c2b62bb4f70a6371d9b"><div class="ttname"><a href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">operations_research::CapSub</a></div><div class="ttdeci">int64 CapSub(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00154">saturated_arithmetic.h:154</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a99264812cf177270e521f226a5c012c3"><div class="ttname"><a href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">operations_research::CapAdd</a></div><div class="ttdeci">int64 CapAdd(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00124">saturated_arithmetic.h:124</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aa0787bf78fb09d1e30f2451b5a68d4b8"><div class="ttname"><a href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">operations_research::DimensionSchedulingStatus</a></div><div class="ttdeci">DimensionSchedulingStatus</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00126">routing_lp_scheduling.h:126</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93"><div class="ttname"><a href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">operations_research::DimensionSchedulingStatus::INFEASIBLE</a></div><div class="ttdeci">@ INFEASIBLE</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293"><div class="ttname"><a href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">operations_research::DimensionSchedulingStatus::OPTIMAL</a></div><div class="ttdeci">@ OPTIMAL</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aa0787bf78fb09d1e30f2451b5a68d4b8af8cfb2115ef7ab822bca8edd1edac285"><div class="ttname"><a href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af8cfb2115ef7ab822bca8edd1edac285">operations_research::DimensionSchedulingStatus::RELAXED_OPTIMAL_ONLY</a></div><div class="ttdeci">@ RELAXED_OPTIMAL_ONLY</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ab216763dccd16f5060d2fbcfb08173fb"><div class="ttname"><a href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">operations_research::CapProd</a></div><div class="ttdeci">int64 CapProd(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00231">saturated_arithmetic.h:231</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00508">pack.cc:508</a></div></div>
|
|
<div class="ttc" id="arouting_8h_html"><div class="ttname"><a href="routing_8h.html">routing.h</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a26a8cbbc7bcf4117c2bf65104b4a54b4"><div class="ttname"><a href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a></div><div class="ttdeci">int64 cost</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00130">routing_flow.cc:130</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_ac891d9f514e55ec8ee1212757a147888"><div class="ttname"><a href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a></div><div class="ttdeci">int64 head</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00128">routing_flow.cc:128</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_ab66ad179c8a6fcf1adb958cb51f4c7cb"><div class="ttname"><a href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a></div><div class="ttdeci">int64 coefficient</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00973">routing_search.cc:973</a></div></div>
|
|
<div class="ttc" id="asaturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_afbb39f66221aac28bbdefd1dca2b2b0.html">constraint_solver</a></li><li class="navelem"><a class="el" href="routing__lp__scheduling_8h.html">routing_lp_scheduling.h</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.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|