1140 lines
282 KiB
HTML
1140 lines
282 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.3"/>
|
|
<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">9.3</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.3 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(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 id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#ifndef OR_TOOLS_CONSTRAINT_SOLVER_ROUTING_LP_SCHEDULING_H_</span></div>
|
|
<div class="line"><a id="l00015" 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 id="l00016" name="l00016"></a><span class="lineno"> 16</span> </div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <deque></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <functional></span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include <map></span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> </div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include "absl/memory/memory.h"</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include "absl/time/time.h"</span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="preprocessor">#include "<a class="code" href="mathutil_8h.html">ortools/base/mathutil.h</a>"</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="preprocessor">#include "<a class="code" href="routing_8h.html">ortools/constraint_solver/routing.h</a>"</span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="preprocessor">#include "ortools/constraint_solver/routing_parameters.pb.h"</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</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 id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="preprocessor">#include "ortools/glop/parameters.pb.h"</span></div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="preprocessor">#include "<a class="code" href="lp__data_8h.html">ortools/lp_data/lp_data.h</a>"</span></div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</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 id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="preprocessor">#include "ortools/sat/cp_model.pb.h"</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="preprocessor">#include "<a class="code" href="cp__model__solver_8h.html">ortools/sat/cp_model_solver.h</a>"</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="preprocessor">#include "<a class="code" href="sat_2lp__utils_8h.html">ortools/sat/lp_utils.h</a>"</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="preprocessor">#include "<a class="code" href="sat_2model_8h.html">ortools/sat/model.h</a>"</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="preprocessor">#include "ortools/sat/sat_parameters.pb.h"</span></div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</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 id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="preprocessor">#include "<a class="code" href="sorted__interval__list_8h.html">ortools/util/sorted_interval_list.h</a>"</span></div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> </div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> </div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span><span class="comment">// Classes to solve dimension cumul placement (aka scheduling) problems using</span></div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span><span class="comment">// linear programming.</span></div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> </div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span><span class="comment">// Utility class used in the core optimizer to tighten the cumul bounds as much</span></div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="comment">// as possible based on the model precedences.</span></div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cumul_bounds_propagator.html"> 54</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_cumul_bounds_propagator.html">CumulBoundsPropagator</a> {</div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keyword">explicit</span> <a class="code hl_function" href="classoperations__research_1_1_cumul_bounds_propagator.html#aff8f29b2fce9f6447474ee6077af1b72">CumulBoundsPropagator</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code hl_function" href="classoperations__research_1_1_cumul_bounds_propagator.html#a03e0559549552ae0d25421ab310f73e1">dimension</a>);</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> </div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// Tightens the cumul bounds starting from the current cumul var min/max,</span></div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="comment">// and propagating the precedences resulting from the next_accessor, and the</span></div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="comment">// dimension's precedence rules.</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// Returns false iff the precedences are infeasible with the given routes.</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// Otherwise, the user can call CumulMin() and CumulMax() to retrieve the new</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="comment">// bounds of an index.</span></div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_cumul_bounds_propagator.html#aa83a7ff5ef57860290d9838959d6ecf1">PropagateCumulBounds</a>(</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> int64_t cumul_offset);</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> </div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cumul_bounds_propagator.html#af1f46eca007a484893dbde252abb8251"> 68</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1_cumul_bounds_propagator.html#af1f46eca007a484893dbde252abb8251">CumulMin</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">return</span> propagated_bounds_[PositiveNode(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)];</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> }</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> </div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cumul_bounds_propagator.html#a9fd8e875c97504d8d8121125decee57a"> 72</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1_cumul_bounds_propagator.html#a9fd8e875c97504d8d8121125decee57a">CumulMax</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="keyword">const</span> int64_t negated_upper_bound = propagated_bounds_[NegativeNode(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)];</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keywordflow">return</span> negated_upper_bound == <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>()</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> ? <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> : -negated_upper_bound;</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> }</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> </div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cumul_bounds_propagator.html#a03e0559549552ae0d25421ab310f73e1"> 79</a></span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>& <a class="code hl_function" href="classoperations__research_1_1_cumul_bounds_propagator.html#a03e0559549552ae0d25421ab310f73e1">dimension</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> dimension_; }</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> </div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// An arc "tail --offset--> head" represents the relation</span></div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="comment">// tail + offset <= head.</span></div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="comment">// As arcs are stored by tail, we don't store it in the struct.</span></div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keyword">struct </span>ArcInfo {</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a>;</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> int64_t offset;</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> };</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> kNoParent;</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> kParentToBePropagated;</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> </div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="comment">// Return the node corresponding to the lower bound of the cumul of index and</span></div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="comment">// -index respectively.</span></div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keywordtype">int</span> PositiveNode(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> 2 * <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>; }</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="keywordtype">int</span> NegativeNode(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> 2 * <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> + 1; }</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> </div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="keywordtype">void</span> AddNodeToQueue(<span class="keywordtype">int</span> node) {</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="keywordflow">if</span> (!node_in_queue_[node]) {</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> bf_queue_.push_back(node);</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> node_in_queue_[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> }</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> }</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> </div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="comment">// Adds the relation first_index + offset <= second_index, by adding arcs</span></div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="comment">// first_index --offset--> second_index and</span></div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// -second_index --offset--> -first_index.</span></div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="keywordtype">void</span> AddArcs(<span class="keywordtype">int</span> first_index, <span class="keywordtype">int</span> second_index, int64_t offset);</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> </div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="keywordtype">bool</span> InitializeArcsAndBounds(</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> int64_t cumul_offset);</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> </div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="keywordtype">bool</span> UpdateCurrentLowerBoundOfNode(<span class="keywordtype">int</span> node, int64_t new_lb, int64_t offset);</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> </div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="keywordtype">bool</span> DisassembleSubtree(<span class="keywordtype">int</span> source, <span class="keywordtype">int</span> target);</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> </div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordtype">bool</span> CleanupAndReturnFalse() {</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="comment">// We clean-up node_in_queue_ for future calls, and return false.</span></div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node_to_cleanup : bf_queue_) {</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> node_in_queue_[node_to_cleanup] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> }</div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> bf_queue_.clear();</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> }</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> </div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keyword">const</span> RoutingDimension& dimension_;</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="keyword">const</span> int64_t num_nodes_;</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> </div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="comment">// TODO(user): Investigate if all arcs for a given tail can be created</span></div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</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 id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="comment">// for each tail index.</span></div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> std::vector<std::vector<ArcInfo>> outgoing_arcs_;</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> </div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> std::deque<int> bf_queue_;</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> std::vector<bool> node_in_queue_;</div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> std::vector<int> tree_parent_node_of_;</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="comment">// After calling PropagateCumulBounds(), for each node index n,</span></div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="comment">// propagated_bounds_[2*n] and -propagated_bounds_[2*n+1] respectively contain</span></div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="comment">// the propagated lower and upper bounds of n's cumul variable.</span></div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> std::vector<int64_t> propagated_bounds_;</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> </div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="comment">// Vector used in DisassembleSubtree() to avoid memory reallocation.</span></div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> std::vector<int> tmp_dfs_stack_;</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> </div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// Used to store the pickup/delivery pairs encountered on the routes.</span></div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> std::vector<std::pair<int64_t, int64_t>></div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> visited_pickup_delivery_indices_for_pair_;</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span>};</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> </div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8"> 150</a></span><span class="keyword">enum class</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> {</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <span class="comment">// An optimal solution was found respecting all constraints.</span></div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">OPTIMAL</a>,</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// An optimal solution was found, however constraints which were relaxed were</span></div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="comment">// violated.</span></div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af8cfb2115ef7ab822bca8edd1edac285">RELAXED_OPTIMAL_ONLY</a>,</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="comment">// A solution could not be found.</span></div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">INFEASIBLE</a></div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span>};</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> </div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html"> 160</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a> {</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af3a7be118910d54c87da7d9ecf7949ac"> 162</a></span> <span class="keyword">virtual</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af3a7be118910d54c87da7d9ecf7949ac">~RoutingLinearSolverWrapper</a>() {}</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3"> 163</a></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3">Clear</a>() = 0;</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a6bcbec446b5474e98e50ef78544c82b0"> 164</a></span> <span class="keyword">virtual</span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a6bcbec446b5474e98e50ef78544c82b0">CreateNewPositiveVariable</a>() = 0;</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad1a3a80256c0caa8f7ebdacb42294c81"> 165</a></span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad1a3a80256c0caa8f7ebdacb42294c81">SetVariableBounds</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>,</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) = 0;</div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ace2a6846080948210abab0845d93e819"> 167</a></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ace2a6846080948210abab0845d93e819">SetVariableDisjointBounds</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>,</div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <span class="keyword">const</span> std::vector<int64_t>& starts,</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="keyword">const</span> std::vector<int64_t>& ends) = 0;</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#afaf5c7b0c88dbe8a11b8d9d66a7c2871"> 170</a></span> <span class="keyword">virtual</span> int64_t <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#afaf5c7b0c88dbe8a11b8d9d66a7c2871">GetVariableLowerBound</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af146d17809b0a879227c142b8814a98c"> 171</a></span> <span class="keyword">virtual</span> int64_t <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af146d17809b0a879227c142b8814a98c">GetVariableUpperBound</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad56b5d5264e07b44be873dfdcd29cb8e"> 172</a></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad56b5d5264e07b44be873dfdcd29cb8e">SetObjectiveCoefficient</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keywordtype">double</span> <a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>) = 0;</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a4812d528a6d93d471be496e9ca79c820"> 173</a></span> <span class="keyword">virtual</span> <span class="keywordtype">double</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a4812d528a6d93d471be496e9ca79c820">GetObjectiveCoefficient</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab8bd6c2ebc0fe292221efda5c39de361"> 174</a></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab8bd6c2ebc0fe292221efda5c39de361">ClearObjective</a>() = 0;</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a155f6032f05d373d7375078c1be4a01b"> 175</a></span> <span class="keyword">virtual</span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a155f6032f05d373d7375078c1be4a01b">NumVariables</a>() <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#abd20c644980c8ff8d122dad397f04f8e"> 176</a></span> <span class="keyword">virtual</span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#abd20c644980c8ff8d122dad397f04f8e">CreateNewConstraint</a>(int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) = 0;</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190"> 177</a></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">SetCoefficient</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keywordtype">double</span> <a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>) = 0;</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa2e5858c4b94c8f69486993bfe4ffea9"> 178</a></span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa2e5858c4b94c8f69486993bfe4ffea9">IsCPSATSolver</a>() = 0;</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab570a51d5ff506f435fa428d3f145f0a"> 179</a></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab570a51d5ff506f435fa428d3f145f0a">AddObjectiveConstraint</a>() = 0;</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#afbe78c86a32370311f3ab5d5ac3770ca"> 180</a></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code hl_function" 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 id="l00181" name="l00181"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a589402033ed732725c2053255cb3ffde"> 181</a></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code hl_function" 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 id="l00182" name="l00182"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ada616cd8a8068937fd4a72ae741e05d9"> 182</a></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ada616cd8a8068937fd4a72ae741e05d9">SetEnforcementLiteral</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <span class="keywordtype">int</span> condition) = 0;</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb"> 183</a></span> <span class="keyword">virtual</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb">Solve</a>(absl::Duration duration_limit) = 0;</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa7ad30a5bcbd156380533cc7abb69172"> 184</a></span> <span class="keyword">virtual</span> int64_t <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa7ad30a5bcbd156380533cc7abb69172">GetObjectiveValue</a>() <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ac154a773600edab5f5fbc597c5639cce"> 185</a></span> <span class="keyword">virtual</span> <span class="keywordtype">double</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ac154a773600edab5f5fbc597c5639cce">GetValue</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af1eb90688746692ec522c88d501bd598"> 186</a></span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af1eb90688746692ec522c88d501bd598">SolutionIsInteger</a>() <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> </div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="comment">// Adds a variable with bounds [lower_bound, upper_bound].</span></div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a822c1b23168a59678bc36920d882d813"> 189</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a822c1b23168a59678bc36920d882d813">AddVariable</a>(int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <a class="code hl_define" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="keyword">const</span> <span class="keywordtype">int</span> variable = <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a6bcbec446b5474e98e50ef78544c82b0">CreateNewPositiveVariable</a>();</div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad1a3a80256c0caa8f7ebdacb42294c81">SetVariableBounds</a>(variable, <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <span class="keywordflow">return</span> variable;</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> }</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="comment">// Adds a linear constraint, enforcing</span></div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="comment">// lower_bound <= sum variable * coeff <= upper_bound,</span></div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <span class="comment">// and returns the identifier of that constraint.</span></div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#abee3ed815d72e0ececa0a9c1474ab2b9"> 198</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#abee3ed815d72e0ececa0a9c1474ab2b9">AddLinearConstraint</a>(</div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>,</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="keyword">const</span> std::vector<std::pair<int, double>>& variable_coeffs) {</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <a class="code hl_define" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#abd20c644980c8ff8d122dad397f04f8e">CreateNewConstraint</a>(<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</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 id="l00204" name="l00204"></a><span class="lineno"> 204</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">SetCoefficient</a>(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, variable_coeff.first, variable_coeff.second);</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> }</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>;</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> }</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="comment">// Adds a linear constraint and a 0/1 variable that is true iff</span></div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> <span class="comment">// lower_bound <= sum variable * coeff <= upper_bound,</span></div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <span class="comment">// and returns the identifier of that variable.</span></div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a37a896bc69864d8bf32ea51a901a0512"> 211</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a37a896bc69864d8bf32ea51a901a0512">AddReifiedLinearConstraint</a>(</div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>,</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <span class="keyword">const</span> std::vector<std::pair<int, double>>& weighted_variables) {</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="keyword">const</span> <span class="keywordtype">int</span> reification_ct = <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#abee3ed815d72e0ececa0a9c1474ab2b9">AddLinearConstraint</a>(1, 1, {});</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>() < <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>) {</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="keyword">const</span> <span class="keywordtype">int</span> under_lower_bound = <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a822c1b23168a59678bc36920d882d813">AddVariable</a>(0, 1);</div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">SetCoefficient</a>(reification_ct, under_lower_bound, 1);</div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <span class="keyword">const</span> <span class="keywordtype">int</span> under_lower_bound_ct =</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#abee3ed815d72e0ececa0a9c1474ab2b9">AddLinearConstraint</a>(<a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>(),</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a> - 1, weighted_variables);</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <a class="code hl_function" 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 id="l00222" name="l00222"></a><span class="lineno"> 222</span> }</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> < <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <span class="keyword">const</span> <span class="keywordtype">int</span> above_upper_bound = <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a822c1b23168a59678bc36920d882d813">AddVariable</a>(0, 1);</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">SetCoefficient</a>(reification_ct, above_upper_bound, 1);</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="keyword">const</span> <span class="keywordtype">int</span> above_upper_bound_ct = <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#abee3ed815d72e0ececa0a9c1474ab2b9">AddLinearConstraint</a>(</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> + 1, <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>(),</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> weighted_variables);</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <a class="code hl_function" 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 id="l00230" name="l00230"></a><span class="lineno"> 230</span> }</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="keyword">const</span> <span class="keywordtype">int</span> within_bounds = <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a822c1b23168a59678bc36920d882d813">AddVariable</a>(0, 1);</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">SetCoefficient</a>(reification_ct, within_bounds, 1);</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <span class="keyword">const</span> <span class="keywordtype">int</span> within_bounds_ct =</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#abee3ed815d72e0ececa0a9c1474ab2b9">AddLinearConstraint</a>(<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, weighted_variables);</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ada616cd8a8068937fd4a72ae741e05d9">SetEnforcementLiteral</a>(within_bounds_ct, within_bounds);</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> <span class="keywordflow">return</span> within_bounds;</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> }</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span>};</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> </div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html"> 240</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_routing_glop_wrapper.html">RoutingGlopWrapper</a> : <span class="keyword">public</span> <a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a> {</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a2f4d02d43a8ef41bc24c1ba7588e8e9d"> 242</a></span> <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#a2f4d02d43a8ef41bc24c1ba7588e8e9d">RoutingGlopWrapper</a>(<span class="keywordtype">bool</span> is_relaxation, <span class="keyword">const</span> glop::GlopParameters& <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>)</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> : is_relaxation_(is_relaxation) {</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> lp_solver_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#ae7202d055b6b172a8a1da4f5b136f9ea">SetParameters</a>(<a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>);</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#ae3201a343d8df987411b55830bff7fa3">SetMaximizationProblem</a>(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> }</div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc"> 247</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc">Clear</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#ae3201a343d8df987411b55830bff7fa3">SetMaximizationProblem</a>(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> allowed_intervals_.clear();</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> }</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a314fad7efb918f0fe41673b65a44253c"> 252</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#a314fad7efb918f0fe41673b65a44253c">CreateNewPositiveVariable</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <span class="keywordflow">return</span> linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#a695ac3d8db5a986f572711f2ef3a6a39">CreateNewVariable</a>().value();</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> }</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a377c018786f6eaa2272bf3d014a3226d"> 255</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#a377c018786f6eaa2272bf3d014a3226d">SetVariableBounds</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>,</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, 0);</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <span class="comment">// When variable upper bounds are greater than this threshold, precision</span></div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> <span class="comment">// issues arise in GLOP. In this case we are just going to suppose that</span></div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="comment">// these high bound values are infinite and not set the upper bound.</span></div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> <span class="keyword">const</span> int64_t kMaxValue = 1e10;</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> <span class="keyword">const</span> <span class="keywordtype">double</span> lp_min = <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>;</div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> <span class="keyword">const</span> <span class="keywordtype">double</span> lp_max =</div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> (<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> > kMaxValue) ? <a class="code hl_variable" href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">glop::kInfinity</a> : <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>;</div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <span class="keywordflow">if</span> (lp_min <= lp_max) {</div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#a0fe7ba825c8c6cd1efdcff6dec631093">SetVariableBounds</a>(glop::ColIndex(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>), lp_min, lp_max);</div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> }</div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <span class="comment">// The linear_program would not be feasible, and it cannot handle the</span></div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> <span class="comment">// lp_min > lp_max case, so we must detect infeasibility here.</span></div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> }</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a9bed98c336ea6bfd483e6c59ff901e0a"> 273</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#a9bed98c336ea6bfd483e6c59ff901e0a">SetVariableDisjointBounds</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keyword">const</span> std::vector<int64_t>& starts,</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> <span class="keyword">const</span> std::vector<int64_t>& ends)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="comment">// TODO(user): Investigate if we can avoid rebuilding the interval list</span></div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <span class="comment">// each time (we could keep a reference to the forbidden interval list in</span></div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> <span class="comment">// RoutingDimension but we would need to store cumul offsets and use them</span></div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="comment">// when checking intervals).</span></div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> allowed_intervals_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] =</div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> absl::make_unique<SortedDisjointIntervalList>(starts, ends);</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> }</div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#af771c825609aad65a2ab27d69c94f42c"> 282</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#af771c825609aad65a2ab27d69c94f42c">GetVariableLowerBound</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> <span class="keywordflow">return</span> linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#adb3b261831be8afb947baceaba1c220b">variable_lower_bounds</a>()[glop::ColIndex(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)];</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> }</div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a939c293c5a4c8f24eb100b7cf6c7a1e2"> 285</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#a939c293c5a4c8f24eb100b7cf6c7a1e2">GetVariableUpperBound</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> =</div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#a74f1c824468608a9bb5fee6f10eca698">variable_upper_bounds</a>()[glop::ColIndex(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)];</div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, 0);</div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> == <a class="code hl_variable" href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">glop::kInfinity</a> ? <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()</div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> : <span class="keyword">static_cast<</span>int64_t<span class="keyword">></span>(<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> }</div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#af5469274c2e2ba025997a4677d13be80"> 292</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#af5469274c2e2ba025997a4677d13be80">SetObjectiveCoefficient</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keywordtype">double</span> <a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#ab5af7f232cddcd91f70be84c0d398ba9">SetObjectiveCoefficient</a>(glop::ColIndex(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>), <a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>);</div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> }</div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a8b4d155c1cccad5c76188e25b49aad47"> 295</a></span> <span class="keywordtype">double</span> <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#a8b4d155c1cccad5c76188e25b49aad47">GetObjectiveCoefficient</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> <span class="keywordflow">return</span> linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#a977f52b2e6fa6e9d6db8d8ac9cbf33c4">objective_coefficients</a>()[glop::ColIndex(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)];</div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> }</div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068"> 298</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068">ClearObjective</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="keywordflow">for</span> (glop::ColIndex i(0); i < linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#acd8437353d8dc686a75c98b5897dd871">num_variables</a>(); ++i) {</div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#ab5af7f232cddcd91f70be84c0d398ba9">SetObjectiveCoefficient</a>(i, 0);</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> }</div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> }</div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a0d53b135116dda43796783fc1c812f83"> 303</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#a0d53b135116dda43796783fc1c812f83">NumVariables</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> <span class="keywordflow">return</span> linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#acd8437353d8dc686a75c98b5897dd871">num_variables</a>().value();</div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> }</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#aad45008823f0ecdab2258f5603233a28"> 306</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#aad45008823f0ecdab2258f5603233a28">CreateNewConstraint</a>(int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> <span class="keyword">const</span> glop::RowIndex <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#ad9d564651057c77b3f2ca1293134557f">CreateNewConstraint</a>();</div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#a62b98dec38b6506442f9fc63f1a9b88f">SetConstraintBounds</a>(</div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>,</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> (<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a> == <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>()) ? -<a class="code hl_variable" href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">glop::kInfinity</a></div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> : <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>,</div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> (<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> == <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) ? <a class="code hl_variable" href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">glop::kInfinity</a></div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> : <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.value();</div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> }</div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a691ac6745157fb62e18c3d8cf1c4538b"> 316</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#a691ac6745157fb62e18c3d8cf1c4538b">SetCoefficient</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keywordtype">double</span> <a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#a2d695f450ae446d5d9c225b991f8d88e">SetCoefficient</a>(glop::RowIndex(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>), glop::ColIndex(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>),</div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> <a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>);</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> }</div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a16adf99185c4a2351c3eb6c9ab44544d"> 320</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" 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 id="l00321" name="l00321"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a9b8503db548f9f4ef7f01c4706d4d56d"> 321</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#a9b8503db548f9f4ef7f01c4706d4d56d">AddObjectiveConstraint</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#aad45008823f0ecdab2258f5603233a28">CreateNewConstraint</a>(0, <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#a624e1c907319c025fd9187bdc441f12b">GetObjectiveValue</a>());</div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> variable = 0; variable < <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#a0d53b135116dda43796783fc1c812f83">NumVariables</a>(); variable++) {</div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#a8b4d155c1cccad5c76188e25b49aad47">GetObjectiveCoefficient</a>(variable);</div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> != 0) {</div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#a691ac6745157fb62e18c3d8cf1c4538b">SetCoefficient</a>(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, variable, <a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>);</div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> }</div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> }</div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> }</div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a6f7b90643fd4e207a1167fc9ee517c02"> 330</a></span> <span class="keywordtype">void</span> <a class="code hl_function" 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 id="l00331" name="l00331"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a73f41f82e421be82b07fe60a42438c3b"> 331</a></span> <span class="keywordtype">void</span> <a class="code hl_function" 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 id="l00332" name="l00332"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a819cbc555690ea6f6f2eadf989455c82"> 332</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#a819cbc555690ea6f6f2eadf989455c82">SetEnforcementLiteral</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <span class="keywordtype">int</span> condition)<span class="keyword"> override</span>{};</div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a671fad375e30cdfe6c95447a43aed2aa"> 333</a></span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" 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 id="l00334" name="l00334"></a><span class="lineno"> 334</span> lp_solver_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a71b04920d660067fdb3d2f4eaa5c7dc0">GetMutableParameters</a>()->set_max_time_in_seconds(</div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> absl::ToDoubleSeconds(duration_limit));</div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> </div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> <span class="comment">// Because we construct the lp one constraint at a time and we never call</span></div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> <span class="comment">// SetCoefficient() on the same variable twice for a constraint, we know</span></div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> <span class="comment">// that the columns do not contain duplicates and are already ordered by</span></div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> <span class="comment">// constraint so we do not need to call linear_program->CleanUp() which can</span></div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> <span class="comment">// be costly. Note that the assumptions are DCHECKed() in the call below.</span></div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#aab451f1144133e621abdcd566c048a8d">NotifyThatColumnsAreClean</a>();</div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#ab4a8456683d4572bd9426efab8489e99">Dump</a>();</div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> <span class="keyword">const</span> <a class="code hl_enumeration" href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493">glop::ProblemStatus</a> <a class="code hl_variable" href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a> = lp_solver_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#ad0677fd7b636de2bffe3cffca65dcd20">Solve</a>(linear_program_);</div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a> != <a class="code hl_enumvalue" href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493af00c8dbdd6e1f11bdae06be94277d293">glop::ProblemStatus::OPTIMAL</a> &&</div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <a class="code hl_variable" href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a> != <a class="code hl_enumvalue" href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493a0beacd9ca195de65e685252f1b46b954">glop::ProblemStatus::IMPRECISE</a>) {</div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> }</div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> <span class="keywordflow">if</span> (is_relaxation_) {</div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af8cfb2115ef7ab822bca8edd1edac285">DimensionSchedulingStatus::RELAXED_OPTIMAL_ONLY</a>;</div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> }</div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</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 id="l00353" name="l00353"></a><span class="lineno"> 353</span> <span class="keyword">const</span> <span class="keywordtype">double</span> value_double = <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0">GetValue</a>(allowed_interval.first);</div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> =</div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> (value_double >= <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>())</div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> ? <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()</div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> : <a class="code hl_function" href="classoperations__research_1_1_math_util.html#a55fc8a3af7c2526c83e83586cd578d89">MathUtil::FastInt64Round</a>(value_double);</div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_sorted_disjoint_interval_list.html">SortedDisjointIntervalList</a>* <span class="keyword">const</span> interval_list =</div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> allowed_interval.second.get();</div>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> <span class="keyword">const</span> <span class="keyword">auto</span> it = interval_list-><a class="code hl_function" href="classoperations__research_1_1_sorted_disjoint_interval_list.html#a815bbd9d71f04362c32528f444b2e5f4">FirstIntervalGreaterOrEqual</a>(<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> <span class="keywordflow">if</span> (it == interval_list-><a class="code hl_function" href="classoperations__research_1_1_sorted_disjoint_interval_list.html#a69b6e2a03c835ca5d658a1f16acbaa9c">end</a>() || value < it-><a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>) {</div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af8cfb2115ef7ab822bca8edd1edac285">DimensionSchedulingStatus::RELAXED_OPTIMAL_ONLY</a>;</div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> }</div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> }</div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">DimensionSchedulingStatus::OPTIMAL</a>;</div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> }</div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a624e1c907319c025fd9187bdc441f12b"> 367</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#a624e1c907319c025fd9187bdc441f12b">GetObjectiveValue</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_math_util.html#a55fc8a3af7c2526c83e83586cd578d89">MathUtil::FastInt64Round</a>(lp_solver_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a96c1f660991b5007ca24564f69cd27b8">GetObjectiveValue</a>());</div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> }</div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0"> 370</a></span> <span class="keywordtype">double</span> <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0">GetValue</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> <span class="keywordflow">return</span> lp_solver_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#ac5d36607cb29127a9ce5f6d6e7c140eb">variable_values</a>()[glop::ColIndex(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)];</div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> }</div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#aa8f92595bdcd4aefc72ce6c0015d41cb"> 373</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_routing_glop_wrapper.html#aa8f92595bdcd4aefc72ce6c0015d41cb">SolutionIsInteger</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> <span class="keywordflow">return</span> linear_program_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_linear_program.html#a887289f2d9928ca7a603fee5b77df258">SolutionIsInteger</a>(lp_solver_.<a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#ac5d36607cb29127a9ce5f6d6e7c140eb">variable_values</a>(),</div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> <span class="comment">/*absolute_tolerance*/</span> 1e-3);</div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> }</div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> </div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> is_relaxation_;</div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">glop::LinearProgram</a> linear_program_;</div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_l_p_solver.html">glop::LPSolver</a> lp_solver_;</div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> absl::flat_hash_map<int, std::unique_ptr<SortedDisjointIntervalList>></div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> allowed_intervals_;</div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span>};</div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> </div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html"> 386</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html">RoutingCPSatWrapper</a> : <span class="keyword">public</span> <a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a> {</div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a28fd517263e8003e3e545d646b96d75f"> 388</a></span> <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a28fd517263e8003e3e545d646b96d75f">RoutingCPSatWrapper</a>() {</div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> parameters_.set_num_search_workers(1);</div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> <span class="comment">// Keeping presolve but with 0 iterations; as of 11/2019 it is</span></div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> <span class="comment">// significantly faster than both full presolve and no presolve.</span></div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> parameters_.set_cp_model_presolve(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> parameters_.set_max_presolve_iterations(0);</div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> parameters_.set_catch_sigint_signal(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> parameters_.set_mip_max_bound(1e8);</div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> parameters_.set_search_branching(sat::SatParameters::LP_SEARCH);</div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> }</div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a68ad095b727149311d03f62a86c34080"> 398</a></span> <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a68ad095b727149311d03f62a86c34080">~RoutingCPSatWrapper</a>()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc"> 399</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc">Clear</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> model_.Clear();</div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> response_.Clear();</div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> objective_coefficients_.clear();</div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> }</div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a314fad7efb918f0fe41673b65a44253c"> 404</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a314fad7efb918f0fe41673b65a44253c">CreateNewPositiveVariable</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = model_.variables_size();</div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> sat::IntegerVariableProto* <span class="keyword">const</span> variable = model_.add_variables();</div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> variable->add_domain(0);</div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> variable->add_domain(<span class="keyword">static_cast<</span>int64_t<span class="keyword">></span>(parameters_.mip_max_bound()));</div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> }</div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a377c018786f6eaa2272bf3d014a3226d"> 411</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a377c018786f6eaa2272bf3d014a3226d">SetVariableBounds</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>,</div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, 0);</div>
|
|
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span> <span class="keyword">const</span> int64_t capped_upper_bound =</div>
|
|
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> std::min<int64_t>(<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, parameters_.mip_max_bound());</div>
|
|
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a> > capped_upper_bound) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> sat::IntegerVariableProto* <span class="keyword">const</span> variable = model_.mutable_variables(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> variable->set_domain(0, <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>);</div>
|
|
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> variable->set_domain(1, capped_upper_bound);</div>
|
|
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> }</div>
|
|
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a9bed98c336ea6bfd483e6c59ff901e0a"> 422</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a9bed98c336ea6bfd483e6c59ff901e0a">SetVariableDisjointBounds</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keyword">const</span> std::vector<int64_t>& starts,</div>
|
|
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> <span class="keyword">const</span> std::vector<int64_t>& ends)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(starts.size(), ends.size());</div>
|
|
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aad45008823f0ecdab2258f5603233a28">CreateNewConstraint</a>(1, 1);</div>
|
|
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < starts.size(); ++i) {</div>
|
|
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> <span class="keyword">const</span> <span class="keywordtype">int</span> variable = <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a314fad7efb918f0fe41673b65a44253c">CreateNewPositiveVariable</a>();</div>
|
|
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a377c018786f6eaa2272bf3d014a3226d">SetVariableBounds</a>(variable, 0, 1);</div>
|
|
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a00bd8299ff5696ff8a0ef53928901955">SetCoefficient</a>(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, variable, 1);</div>
|
|
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> <span class="keyword">const</span> <span class="keywordtype">int</span> window_ct = <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aad45008823f0ecdab2258f5603233a28">CreateNewConstraint</a>(starts[i], ends[i]);</div>
|
|
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a00bd8299ff5696ff8a0ef53928901955">SetCoefficient</a>(window_ct, <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, 1);</div>
|
|
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> model_.mutable_constraints(window_ct)->add_enforcement_literal(variable);</div>
|
|
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> }</div>
|
|
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> }</div>
|
|
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af771c825609aad65a2ab27d69c94f42c"> 435</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af771c825609aad65a2ab27d69c94f42c">GetVariableLowerBound</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> <span class="keywordflow">return</span> model_.variables(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>).domain(0);</div>
|
|
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> }</div>
|
|
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a939c293c5a4c8f24eb100b7cf6c7a1e2"> 438</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a939c293c5a4c8f24eb100b7cf6c7a1e2">GetVariableUpperBound</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> <span class="keyword">const</span> <span class="keyword">auto</span>& domain = model_.variables(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>).domain();</div>
|
|
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> <span class="keywordflow">return</span> domain[domain.size() - 1];</div>
|
|
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> }</div>
|
|
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af5469274c2e2ba025997a4677d13be80"> 442</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af5469274c2e2ba025997a4677d13be80">SetObjectiveCoefficient</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keywordtype">double</span> <a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> >= objective_coefficients_.size()) {</div>
|
|
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> objective_coefficients_.resize(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> + 1, 0);</div>
|
|
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> }</div>
|
|
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> objective_coefficients_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = <a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>;</div>
|
|
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span> sat::FloatObjectiveProto* <span class="keyword">const</span> objective =</div>
|
|
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> model_.mutable_floating_point_objective();</div>
|
|
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> objective->add_vars(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> objective->add_coeffs(<a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>);</div>
|
|
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> }</div>
|
|
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a8b4d155c1cccad5c76188e25b49aad47"> 452</a></span> <span class="keywordtype">double</span> <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a8b4d155c1cccad5c76188e25b49aad47">GetObjectiveCoefficient</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> <span class="keywordflow">return</span> (<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < objective_coefficients_.size())</div>
|
|
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> ? objective_coefficients_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]</div>
|
|
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span> : 0;</div>
|
|
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> }</div>
|
|
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068"> 457</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068">ClearObjective</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> model_.mutable_floating_point_objective()->Clear();</div>
|
|
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> }</div>
|
|
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a0d53b135116dda43796783fc1c812f83"> 460</a></span> <span class="keywordtype">int</span> <a class="code hl_function" 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 id="l00461" name="l00461"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aad45008823f0ecdab2258f5603233a28"> 461</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aad45008823f0ecdab2258f5603233a28">CreateNewConstraint</a>(int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> sat::LinearConstraintProto* <span class="keyword">const</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> =</div>
|
|
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> model_.add_constraints()->mutable_linear();</div>
|
|
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->add_domain(<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>);</div>
|
|
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->add_domain(<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div>
|
|
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> <span class="keywordflow">return</span> model_.constraints_size() - 1;</div>
|
|
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> }</div>
|
|
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a00bd8299ff5696ff8a0ef53928901955"> 468</a></span> <span class="keywordtype">void</span> <a class="code hl_function" 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 hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keywordtype">double</span> <a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> sat::LinearConstraintProto* <span class="keyword">const</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> =</div>
|
|
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span> model_.mutable_constraints(ct_index)->mutable_linear();</div>
|
|
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->add_vars(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> <span class="keyword">const</span> int64_t integer_coefficient = <a class="code hl_variable" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a>;</div>
|
|
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->add_coeffs(integer_coefficient);</div>
|
|
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span> }</div>
|
|
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a16adf99185c4a2351c3eb6c9ab44544d"> 475</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" 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 id="l00476" name="l00476"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a9b8503db548f9f4ef7f01c4706d4d56d"> 476</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a9b8503db548f9f4ef7f01c4706d4d56d">AddObjectiveConstraint</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span> <span class="comment">// Scale the objective to get its integer representation.</span></div>
|
|
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> <span class="keyword">const</span> sat::FloatObjectiveProto& fp_objective =</div>
|
|
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"> 479</span> model_.floating_point_objective();</div>
|
|
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> std::vector<std::pair<int, double>> terms;</div>
|
|
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < fp_objective.vars_size(); ++i) {</div>
|
|
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> terms.push_back({fp_objective.vars(i), fp_objective.coeffs(i)});</div>
|
|
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> }</div>
|
|
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> <a class="code hl_class" href="classoperations__research_1_1_solver_logger.html">SolverLogger</a> logger;</div>
|
|
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code hl_variable" href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a> =</div>
|
|
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a0b38571bb1f48f98df1134a4005d9c21">sat::ScaleAndSetObjective</a>(parameters_, terms, fp_objective.offset(),</div>
|
|
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> fp_objective.maximize(), &model_, &logger);</div>
|
|
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code hl_variable" href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a>);</div>
|
|
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> <span class="keyword">const</span> sat::CpObjectiveProto& objective = model_.objective();</div>
|
|
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> int64_t activity = 0;</div>
|
|
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < objective.vars_size(); ++i) {</div>
|
|
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> activity += response_.solution(objective.vars(i)) * objective.coeffs(i);</div>
|
|
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> }</div>
|
|
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aad45008823f0ecdab2258f5603233a28">CreateNewConstraint</a>(0, activity);</div>
|
|
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < objective.vars_size(); ++i) {</div>
|
|
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a00bd8299ff5696ff8a0ef53928901955">SetCoefficient</a>(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, objective.vars(i), objective.coeffs(i));</div>
|
|
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> }</div>
|
|
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> model_.clear_objective();</div>
|
|
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span> }</div>
|
|
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a6f7b90643fd4e207a1167fc9ee517c02"> 500</a></span> <span class="keywordtype">void</span> <a class="code hl_function" 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 id="l00501" name="l00501"></a><span class="lineno"> 501</span> sat::LinearArgumentProto* <span class="keyword">const</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> =</div>
|
|
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"> 502</span> model_.add_constraints()->mutable_lin_max();</div>
|
|
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno"> 503</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->mutable_target()->add_vars(max_var);</div>
|
|
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->mutable_target()->add_coeffs(1);</div>
|
|
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars) {</div>
|
|
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> sat::LinearExpressionProto* <span class="keyword">const</span> expr = <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->add_exprs();</div>
|
|
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span> expr->add_vars(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> expr->add_coeffs(1);</div>
|
|
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span> }</div>
|
|
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> }</div>
|
|
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a73f41f82e421be82b07fe60a42438c3b"> 511</a></span> <span class="keywordtype">void</span> <a class="code hl_function" 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 id="l00512" name="l00512"></a><span class="lineno"> 512</span> sat::LinearArgumentProto* <span class="keyword">const</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> =</div>
|
|
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span> model_.add_constraints()->mutable_int_prod();</div>
|
|
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"> 514</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->mutable_target()->add_vars(product_var);</div>
|
|
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"> 515</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->mutable_target()->add_coeffs(1);</div>
|
|
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno"> 516</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars) {</div>
|
|
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> sat::LinearExpressionProto* expr = <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>->add_exprs();</div>
|
|
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span> expr->add_vars(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"> 519</span> expr->add_coeffs(1);</div>
|
|
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"> 520</span> }</div>
|
|
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno"> 521</span> }</div>
|
|
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a819cbc555690ea6f6f2eadf989455c82"> 522</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a819cbc555690ea6f6f2eadf989455c82">SetEnforcementLiteral</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <span class="keywordtype">int</span> condition)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, model_.constraints_size());</div>
|
|
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"> 524</span> model_.mutable_constraints(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>)->add_enforcement_literal(condition);</div>
|
|
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> }</div>
|
|
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a671fad375e30cdfe6c95447a43aed2aa"> 526</a></span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" 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 id="l00527" name="l00527"></a><span class="lineno"> 527</span> parameters_.set_max_time_in_seconds(absl::ToDoubleSeconds(duration_limit));</div>
|
|
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"> 528</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << model_.DebugString();</div>
|
|
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno"> 529</span> <span class="keywordflow">if</span> (hint_.vars_size() == model_.variables_size()) {</div>
|
|
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno"> 530</span> *model_.mutable_solution_hint() = hint_;</div>
|
|
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"> 531</span> }</div>
|
|
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno"> 532</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_model.html">sat::Model</a> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>;</div>
|
|
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno"> 533</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.Add(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1684fe34484d78336d3cdac55ec6de57">sat::NewSatParameters</a>(parameters_));</div>
|
|
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"> 534</span> response_ = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#aa9299de04255b99318446500127d79e1">sat::SolveCpModel</a>(model_, &<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno"> 535</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << response_.DebugString();</div>
|
|
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno"> 536</span> <span class="keywordflow">if</span> (response_.status() == sat::CpSolverStatus::OPTIMAL ||</div>
|
|
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"> 537</span> (response_.status() == sat::CpSolverStatus::FEASIBLE &&</div>
|
|
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno"> 538</span> !model_.has_floating_point_objective())) {</div>
|
|
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno"> 539</span> hint_.Clear();</div>
|
|
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"> 540</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < response_.solution_size(); ++i) {</div>
|
|
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno"> 541</span> hint_.add_vars(i);</div>
|
|
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno"> 542</span> hint_.add_values(response_.solution(i));</div>
|
|
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno"> 543</span> }</div>
|
|
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno"> 544</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">DimensionSchedulingStatus::OPTIMAL</a>;</div>
|
|
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno"> 545</span> }</div>
|
|
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno"> 546</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> }</div>
|
|
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a624e1c907319c025fd9187bdc441f12b"> 548</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a624e1c907319c025fd9187bdc441f12b">GetObjectiveValue</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_math_util.html#a55fc8a3af7c2526c83e83586cd578d89">MathUtil::FastInt64Round</a>(response_.objective_value());</div>
|
|
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno"> 550</span> }</div>
|
|
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0"> 551</a></span> <span class="keywordtype">double</span> <a class="code hl_function" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0">GetValue</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"> 552</span> <span class="keywordflow">return</span> response_.solution(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> }</div>
|
|
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aa8f92595bdcd4aefc72ce6c0015d41cb"> 554</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" 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 id="l00555" name="l00555"></a><span class="lineno"> 555</span> </div>
|
|
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno"> 556</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"> 557</span> sat::CpModelProto model_;</div>
|
|
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno"> 558</span> sat::CpSolverResponse response_;</div>
|
|
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno"> 559</span> sat::SatParameters parameters_;</div>
|
|
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"> 560</span> std::vector<double> objective_coefficients_;</div>
|
|
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"> 561</span> sat::PartialVariableAssignment hint_;</div>
|
|
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno"> 562</span>};</div>
|
|
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno"> 563</span> </div>
|
|
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno"> 564</span><span class="comment">// Utility class used in Local/GlobalDimensionCumulOptimizer to set the linear</span></div>
|
|
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno"> 565</span><span class="comment">// solver constraints and solve the problem.</span></div>
|
|
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html"> 566</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html">DimensionCumulOptimizerCore</a> {</div>
|
|
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno"> 567</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno"> 568</span> <a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a5967f72ac911a2ed971a1ce103d1c47b">DimensionCumulOptimizerCore</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a771ef9d454a03f02a8c884aacaf61765">dimension</a>,</div>
|
|
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno"> 569</span> <span class="keywordtype">bool</span> use_precedence_propagator);</div>
|
|
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno"> 570</span> </div>
|
|
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno"> 571</span> <span class="comment">// In the OptimizeSingleRoute() and Optimize() methods, if both "cumul_values"</span></div>
|
|
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno"> 572</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 id="l00573" name="l00573"></a><span class="lineno"> 573</span> <span class="comment">// first feasible solution in the linear solver (since in this case only</span></div>
|
|
<div class="line"><a id="l00574" name="l00574"></a><span class="lineno"> 574</span> <span class="comment">// feasibility is of interest).</span></div>
|
|
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno"> 575</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ad8f55e0b1048c51c733207c60a2f87b0">OptimizeSingleRoute</a>(</div>
|
|
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno"> 576</span> <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"> 577</span> <a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, std::vector<int64_t>* cumul_values,</div>
|
|
<div class="line"><a id="l00578" name="l00578"></a><span class="lineno"> 578</span> std::vector<int64_t>* break_values, int64_t* <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>, int64_t* transit_cost,</div>
|
|
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno"> 579</span> <span class="keywordtype">bool</span> clear_lp = <span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno"> 580</span> </div>
|
|
<div class="line"><a id="l00581" name="l00581"></a><span class="lineno"> 581</span> std::vector<DimensionSchedulingStatus> <a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a164fa51cd8575b74cbc058770461eac3">OptimizeSingleRouteWithResources</a>(</div>
|
|
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno"> 582</span> <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno"> 583</span> <span class="keyword">const</span> std::vector<RoutingModel::ResourceGroup::Resource>& resources,</div>
|
|
<div class="line"><a id="l00584" name="l00584"></a><span class="lineno"> 584</span> <span class="keyword">const</span> std::vector<int>& resource_indices, <span class="keywordtype">bool</span> optimize_vehicle_costs,</div>
|
|
<div class="line"><a id="l00585" name="l00585"></a><span class="lineno"> 585</span> <a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver,</div>
|
|
<div class="line"><a id="l00586" name="l00586"></a><span class="lineno"> 586</span> std::vector<int64_t>* costs_without_transits,</div>
|
|
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno"> 587</span> std::vector<std::vector<int64_t>>* cumul_values,</div>
|
|
<div class="line"><a id="l00588" name="l00588"></a><span class="lineno"> 588</span> std::vector<std::vector<int64_t>>* break_values, <span class="keywordtype">bool</span> clear_lp = <span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno"> 589</span> </div>
|
|
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno"> 590</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a2f7a5a1dd37425548dd240eaa26b3778">Optimize</a>(</div>
|
|
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno"> 591</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno"> 592</span> <a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, std::vector<int64_t>* cumul_values,</div>
|
|
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno"> 593</span> std::vector<int64_t>* break_values,</div>
|
|
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno"> 594</span> std::vector<std::vector<int>>* resource_indices_per_group, int64_t* <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>,</div>
|
|
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno"> 595</span> int64_t* transit_cost, <span class="keywordtype">bool</span> clear_lp = <span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno"> 596</span> </div>
|
|
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno"> 597</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a9af3ca4bab4b91eac932f71596ada6ac">OptimizeAndPack</a>(</div>
|
|
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno"> 598</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno"> 599</span> <a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, std::vector<int64_t>* cumul_values,</div>
|
|
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno"> 600</span> std::vector<int64_t>* break_values,</div>
|
|
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno"> 601</span> std::vector<std::vector<int>>* resource_indices_per_group);</div>
|
|
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno"> 602</span> </div>
|
|
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno"> 603</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#aec1c4f058fbbbd5e0b5f767c5f0a87a3">OptimizeAndPackSingleRoute</a>(</div>
|
|
<div class="line"><a id="l00604" name="l00604"></a><span class="lineno"> 604</span> <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00605" name="l00605"></a><span class="lineno"> 605</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model_1_1_resource_group_1_1_resource.html">RoutingModel::ResourceGroup::Resource</a>* resource,</div>
|
|
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno"> 606</span> <a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, std::vector<int64_t>* cumul_values,</div>
|
|
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno"> 607</span> std::vector<int64_t>* break_values);</div>
|
|
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno"> 608</span> </div>
|
|
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a771ef9d454a03f02a8c884aacaf61765"> 609</a></span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a771ef9d454a03f02a8c884aacaf61765">dimension</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> dimension_; }</div>
|
|
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno"> 610</span> </div>
|
|
<div class="line"><a id="l00611" name="l00611"></a><span class="lineno"> 611</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00612" name="l00612"></a><span class="lineno"> 612</span> <span class="comment">// Initializes the containers and given solver. Must be called prior to</span></div>
|
|
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno"> 613</span> <span class="comment">// setting any contraints and solving.</span></div>
|
|
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno"> 614</span> <span class="keywordtype">void</span> InitOptimizer(<a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver);</div>
|
|
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno"> 615</span> </div>
|
|
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno"> 616</span> <span class="comment">// Computes the minimum/maximum of cumuls for nodes on "route", and sets them</span></div>
|
|
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno"> 617</span> <span class="comment">// in current_route_[min|max]_cumuls_ respectively.</span></div>
|
|
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno"> 618</span> <span class="comment">// If the propagator_ is not null, uses the bounds tightened by the</span></div>
|
|
<div class="line"><a id="l00619" name="l00619"></a><span class="lineno"> 619</span> <span class="comment">// propagator.</span></div>
|
|
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno"> 620</span> <span class="comment">// Otherwise, the bounds are computed by going over the nodes on the route</span></div>
|
|
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno"> 621</span> <span class="comment">// using the CP bounds, and the fixed transits are used to tighten them.</span></div>
|
|
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno"> 622</span> <span class="keywordtype">bool</span> ComputeRouteCumulBounds(<span class="keyword">const</span> std::vector<int64_t>& route,</div>
|
|
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno"> 623</span> <span class="keyword">const</span> std::vector<int64_t>& fixed_transits,</div>
|
|
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno"> 624</span> int64_t cumul_offset);</div>
|
|
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno"> 625</span> </div>
|
|
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno"> 626</span> <span class="comment">// Sets the constraints for all nodes on "vehicle"'s route according to</span></div>
|
|
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno"> 627</span> <span class="comment">// "next_accessor". If optimize_costs is true, also sets the objective</span></div>
|
|
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno"> 628</span> <span class="comment">// coefficients for the LP.</span></div>
|
|
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno"> 629</span> <span class="comment">// Returns false if some infeasibility was detected, true otherwise.</span></div>
|
|
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno"> 630</span> <span class="keywordtype">bool</span> SetRouteCumulConstraints(</div>
|
|
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno"> 631</span> <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno"> 632</span> int64_t cumul_offset, <span class="keywordtype">bool</span> optimize_costs,</div>
|
|
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno"> 633</span> <a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, int64_t* route_transit_cost,</div>
|
|
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno"> 634</span> int64_t* route_cost_offset);</div>
|
|
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno"> 635</span> </div>
|
|
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno"> 636</span> <span class="comment">// Sets the global constraints on the dimension, and adds global objective</span></div>
|
|
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno"> 637</span> <span class="comment">// cost coefficients if optimize_costs is true.</span></div>
|
|
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno"> 638</span> <span class="comment">// NOTE: When called, the call to this function MUST come after</span></div>
|
|
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno"> 639</span> <span class="comment">// SetRouteCumulConstraints() has been called on all routes, so that</span></div>
|
|
<div class="line"><a id="l00640" name="l00640"></a><span class="lineno"> 640</span> <span class="comment">// index_to_cumul_variable_ and min_start/max_end_cumul_ are correctly</span></div>
|
|
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno"> 641</span> <span class="comment">// initialized.</span></div>
|
|
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno"> 642</span> <span class="comment">// Returns false if some infeasibility was detected, true otherwise.</span></div>
|
|
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno"> 643</span> <span class="keywordtype">bool</span> SetGlobalConstraints(</div>
|
|
<div class="line"><a id="l00644" name="l00644"></a><span class="lineno"> 644</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00645" name="l00645"></a><span class="lineno"> 645</span> int64_t cumul_offset, <span class="keywordtype">bool</span> optimize_costs,</div>
|
|
<div class="line"><a id="l00646" name="l00646"></a><span class="lineno"> 646</span> <a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver);</div>
|
|
<div class="line"><a id="l00647" name="l00647"></a><span class="lineno"> 647</span> </div>
|
|
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno"> 648</span> <span class="keywordtype">void</span> SetValuesFromLP(<span class="keyword">const</span> std::vector<int>& lp_variables, int64_t offset,</div>
|
|
<div class="line"><a id="l00649" name="l00649"></a><span class="lineno"> 649</span> <a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver,</div>
|
|
<div class="line"><a id="l00650" name="l00650"></a><span class="lineno"> 650</span> std::vector<int64_t>* lp_values) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno"> 651</span> </div>
|
|
<div class="line"><a id="l00652" name="l00652"></a><span class="lineno"> 652</span> <span class="keywordtype">void</span> SetResourceIndices(</div>
|
|
<div class="line"><a id="l00653" name="l00653"></a><span class="lineno"> 653</span> <a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver,</div>
|
|
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno"> 654</span> std::vector<std::vector<int>>* resource_indices_per_group) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno"> 655</span> </div>
|
|
<div class="line"><a id="l00656" name="l00656"></a><span class="lineno"> 656</span> <span class="comment">// This function packs the routes of the given vehicles while keeping the cost</span></div>
|
|
<div class="line"><a id="l00657" name="l00657"></a><span class="lineno"> 657</span> <span class="comment">// of the LP lower than its current (supposed optimal) objective value.</span></div>
|
|
<div class="line"><a id="l00658" name="l00658"></a><span class="lineno"> 658</span> <span class="comment">// It does so by setting the current objective variables' coefficient to 0 and</span></div>
|
|
<div class="line"><a id="l00659" name="l00659"></a><span class="lineno"> 659</span> <span class="comment">// setting the coefficient of the route ends to 1, to first minimize the route</span></div>
|
|
<div class="line"><a id="l00660" name="l00660"></a><span class="lineno"> 660</span> <span class="comment">// ends' cumuls, and then maximizes the starts' cumuls without increasing the</span></div>
|
|
<div class="line"><a id="l00661" name="l00661"></a><span class="lineno"> 661</span> <span class="comment">// ends.</span></div>
|
|
<div class="line"><a id="l00662" name="l00662"></a><span class="lineno"> 662</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> PackRoutes(std::vector<int> vehicles,</div>
|
|
<div class="line"><a id="l00663" name="l00663"></a><span class="lineno"> 663</span> <a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver);</div>
|
|
<div class="line"><a id="l00664" name="l00664"></a><span class="lineno"> 664</span> </div>
|
|
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno"> 665</span> std::unique_ptr<CumulBoundsPropagator> propagator_;</div>
|
|
<div class="line"><a id="l00666" name="l00666"></a><span class="lineno"> 666</span> std::vector<int64_t> current_route_min_cumuls_;</div>
|
|
<div class="line"><a id="l00667" name="l00667"></a><span class="lineno"> 667</span> std::vector<int64_t> current_route_max_cumuls_;</div>
|
|
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno"> 668</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <span class="keyword">const</span> dimension_;</div>
|
|
<div class="line"><a id="l00669" name="l00669"></a><span class="lineno"> 669</span> <span class="comment">// Scheduler variables for current route cumuls and for all nodes cumuls.</span></div>
|
|
<div class="line"><a id="l00670" name="l00670"></a><span class="lineno"> 670</span> std::vector<int> current_route_cumul_variables_;</div>
|
|
<div class="line"><a id="l00671" name="l00671"></a><span class="lineno"> 671</span> std::vector<int> index_to_cumul_variable_;</div>
|
|
<div class="line"><a id="l00672" name="l00672"></a><span class="lineno"> 672</span> <span class="comment">// Scheduler variables for current route breaks and all vehicle breaks.</span></div>
|
|
<div class="line"><a id="l00673" name="l00673"></a><span class="lineno"> 673</span> <span class="comment">// There are two variables for each break: start and end.</span></div>
|
|
<div class="line"><a id="l00674" name="l00674"></a><span class="lineno"> 674</span> <span class="comment">// current_route_break_variables_ has variables corresponding to</span></div>
|
|
<div class="line"><a id="l00675" name="l00675"></a><span class="lineno"> 675</span> <span class="comment">// break[0] start, break[0] end, break[1] start, break[1] end, etc.</span></div>
|
|
<div class="line"><a id="l00676" name="l00676"></a><span class="lineno"> 676</span> std::vector<int> current_route_break_variables_;</div>
|
|
<div class="line"><a id="l00677" name="l00677"></a><span class="lineno"> 677</span> <span class="comment">// Vector all_break_variables contains the break variables of all vehicles,</span></div>
|
|
<div class="line"><a id="l00678" name="l00678"></a><span class="lineno"> 678</span> <span class="comment">// in the same format as current_route_break_variables.</span></div>
|
|
<div class="line"><a id="l00679" name="l00679"></a><span class="lineno"> 679</span> <span class="comment">// It is the concatenation of break variables of vehicles in [0, #vehicles).</span></div>
|
|
<div class="line"><a id="l00680" name="l00680"></a><span class="lineno"> 680</span> std::vector<int> all_break_variables_;</div>
|
|
<div class="line"><a id="l00681" name="l00681"></a><span class="lineno"> 681</span> <span class="comment">// Allows to retrieve break variables of a given vehicle: those go from</span></div>
|
|
<div class="line"><a id="l00682" name="l00682"></a><span class="lineno"> 682</span> <span class="comment">// all_break_variables_[vehicle_to_all_break_variables_offset_[vehicle]] to</span></div>
|
|
<div class="line"><a id="l00683" name="l00683"></a><span class="lineno"> 683</span> <span class="comment">// all_break_variables[vehicle_to_all_break_variables_offset_[vehicle+1]-1].</span></div>
|
|
<div class="line"><a id="l00684" name="l00684"></a><span class="lineno"> 684</span> std::vector<int> vehicle_to_all_break_variables_offset_;</div>
|
|
<div class="line"><a id="l00685" name="l00685"></a><span class="lineno"> 685</span> <span class="comment">// The following vector contains indices of resource-to-vehicle assignment</span></div>
|
|
<div class="line"><a id="l00686" name="l00686"></a><span class="lineno"> 686</span> <span class="comment">// variables. For every resource group, stores indices of</span></div>
|
|
<div class="line"><a id="l00687" name="l00687"></a><span class="lineno"> 687</span> <span class="comment">// num_resources*num_vehicles boolean variables indicating whether resource #r</span></div>
|
|
<div class="line"><a id="l00688" name="l00688"></a><span class="lineno"> 688</span> <span class="comment">// is assigned to vehicle #v.</span></div>
|
|
<div class="line"><a id="l00689" name="l00689"></a><span class="lineno"> 689</span> std::vector<std::vector<int>></div>
|
|
<div class="line"><a id="l00690" name="l00690"></a><span class="lineno"> 690</span> resource_group_to_resource_to_vehicle_assignment_variables_;</div>
|
|
<div class="line"><a id="l00691" name="l00691"></a><span class="lineno"> 691</span> </div>
|
|
<div class="line"><a id="l00692" name="l00692"></a><span class="lineno"> 692</span> <span class="keywordtype">int</span> max_end_cumul_;</div>
|
|
<div class="line"><a id="l00693" name="l00693"></a><span class="lineno"> 693</span> <span class="keywordtype">int</span> min_start_cumul_;</div>
|
|
<div class="line"><a id="l00694" name="l00694"></a><span class="lineno"> 694</span> std::vector<std::pair<int64_t, int64_t>></div>
|
|
<div class="line"><a id="l00695" name="l00695"></a><span class="lineno"> 695</span> visited_pickup_delivery_indices_for_pair_;</div>
|
|
<div class="line"><a id="l00696" name="l00696"></a><span class="lineno"> 696</span>};</div>
|
|
<div class="line"><a id="l00697" name="l00697"></a><span class="lineno"> 697</span> </div>
|
|
<div class="line"><a id="l00698" name="l00698"></a><span class="lineno"> 698</span><span class="comment">// Class used to compute optimal values for dimension cumuls of routes,</span></div>
|
|
<div class="line"><a id="l00699" name="l00699"></a><span class="lineno"> 699</span><span class="comment">// minimizing cumul soft lower and upper bound costs, and vehicle span costs of</span></div>
|
|
<div class="line"><a id="l00700" name="l00700"></a><span class="lineno"> 700</span><span class="comment">// a route.</span></div>
|
|
<div class="line"><a id="l00701" name="l00701"></a><span class="lineno"> 701</span><span class="comment">// In its methods, next_accessor is a callback returning the next node of a</span></div>
|
|
<div class="line"><a id="l00702" name="l00702"></a><span class="lineno"> 702</span><span class="comment">// given node on a route.</span></div>
|
|
<div class="line"><a id="l00703" name="l00703"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html"> 703</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html">LocalDimensionCumulOptimizer</a> {</div>
|
|
<div class="line"><a id="l00704" name="l00704"></a><span class="lineno"> 704</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00705" name="l00705"></a><span class="lineno"> 705</span> <a class="code hl_function" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a5bcbf49ff1a9dd9f92c40750ec0267b4">LocalDimensionCumulOptimizer</a>(</div>
|
|
<div class="line"><a id="l00706" name="l00706"></a><span class="lineno"> 706</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code hl_function" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a771ef9d454a03f02a8c884aacaf61765">dimension</a>,</div>
|
|
<div class="line"><a id="l00707" name="l00707"></a><span class="lineno"> 707</span> RoutingSearchParameters::SchedulingSolver solver_type);</div>
|
|
<div class="line"><a id="l00708" name="l00708"></a><span class="lineno"> 708</span> </div>
|
|
<div class="line"><a id="l00709" name="l00709"></a><span class="lineno"> 709</span> <span class="comment">// If feasible, computes the optimal cost of the route performed by a vehicle,</span></div>
|
|
<div class="line"><a id="l00710" name="l00710"></a><span class="lineno"> 710</span> <span class="comment">// minimizing cumul soft lower and upper bound costs and vehicle span costs,</span></div>
|
|
<div class="line"><a id="l00711" name="l00711"></a><span class="lineno"> 711</span> <span class="comment">// and stores it in "optimal_cost" (if not null).</span></div>
|
|
<div class="line"><a id="l00712" name="l00712"></a><span class="lineno"> 712</span> <span class="comment">// Returns true iff the route respects all constraints.</span></div>
|
|
<div class="line"><a id="l00713" name="l00713"></a><span class="lineno"> 713</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a10cab4b73bfe12bef44924a47c5345b6">ComputeRouteCumulCost</a>(</div>
|
|
<div class="line"><a id="l00714" name="l00714"></a><span class="lineno"> 714</span> <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00715" name="l00715"></a><span class="lineno"> 715</span> int64_t* optimal_cost);</div>
|
|
<div class="line"><a id="l00716" name="l00716"></a><span class="lineno"> 716</span> </div>
|
|
<div class="line"><a id="l00717" name="l00717"></a><span class="lineno"> 717</span> <span class="comment">// Same as ComputeRouteCumulCost, but the cost computed does not contain</span></div>
|
|
<div class="line"><a id="l00718" name="l00718"></a><span class="lineno"> 718</span> <span class="comment">// the part of the vehicle span cost due to fixed transits.</span></div>
|
|
<div class="line"><a id="l00719" name="l00719"></a><span class="lineno"> 719</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a296e8d7e154740a84c59774f20a295ba">ComputeRouteCumulCostWithoutFixedTransits</a>(</div>
|
|
<div class="line"><a id="l00720" name="l00720"></a><span class="lineno"> 720</span> <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00721" name="l00721"></a><span class="lineno"> 721</span> int64_t* optimal_cost_without_transits);</div>
|
|
<div class="line"><a id="l00722" name="l00722"></a><span class="lineno"> 722</span> </div>
|
|
<div class="line"><a id="l00723" name="l00723"></a><span class="lineno"> 723</span> std::vector<DimensionSchedulingStatus></div>
|
|
<div class="line"><a id="l00724" name="l00724"></a><span class="lineno"> 724</span> <a class="code hl_function" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#adc503615328f6444d3286281f8ba786f">ComputeRouteCumulCostsForResourcesWithoutFixedTransits</a>(</div>
|
|
<div class="line"><a id="l00725" name="l00725"></a><span class="lineno"> 725</span> <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00726" name="l00726"></a><span class="lineno"> 726</span> <span class="keyword">const</span> std::vector<RoutingModel::ResourceGroup::Resource>& resources,</div>
|
|
<div class="line"><a id="l00727" name="l00727"></a><span class="lineno"> 727</span> <span class="keyword">const</span> std::vector<int>& resource_indices, <span class="keywordtype">bool</span> optimize_vehicle_costs,</div>
|
|
<div class="line"><a id="l00728" name="l00728"></a><span class="lineno"> 728</span> std::vector<int64_t>* optimal_costs_without_transits,</div>
|
|
<div class="line"><a id="l00729" name="l00729"></a><span class="lineno"> 729</span> std::vector<std::vector<int64_t>>* optimal_cumuls,</div>
|
|
<div class="line"><a id="l00730" name="l00730"></a><span class="lineno"> 730</span> std::vector<std::vector<int64_t>>* optimal_breaks);</div>
|
|
<div class="line"><a id="l00731" name="l00731"></a><span class="lineno"> 731</span> </div>
|
|
<div class="line"><a id="l00732" name="l00732"></a><span class="lineno"> 732</span> <span class="comment">// If feasible, computes the optimal values for cumul and break variables</span></div>
|
|
<div class="line"><a id="l00733" name="l00733"></a><span class="lineno"> 733</span> <span class="comment">// of the route performed by a vehicle, minimizing cumul soft lower, upper</span></div>
|
|
<div class="line"><a id="l00734" name="l00734"></a><span class="lineno"> 734</span> <span class="comment">// bound costs and vehicle span costs, stores them in "optimal_cumuls"</span></div>
|
|
<div class="line"><a id="l00735" name="l00735"></a><span class="lineno"> 735</span> <span class="comment">// (if not null), and optimal_breaks, and returns true.</span></div>
|
|
<div class="line"><a id="l00736" name="l00736"></a><span class="lineno"> 736</span> <span class="comment">// Returns false if the route is not feasible.</span></div>
|
|
<div class="line"><a id="l00737" name="l00737"></a><span class="lineno"> 737</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a161ed371fd2e35ef76b4539540bfcfd6">ComputeRouteCumuls</a>(</div>
|
|
<div class="line"><a id="l00738" name="l00738"></a><span class="lineno"> 738</span> <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00739" name="l00739"></a><span class="lineno"> 739</span> std::vector<int64_t>* optimal_cumuls,</div>
|
|
<div class="line"><a id="l00740" name="l00740"></a><span class="lineno"> 740</span> std::vector<int64_t>* optimal_breaks);</div>
|
|
<div class="line"><a id="l00741" name="l00741"></a><span class="lineno"> 741</span> </div>
|
|
<div class="line"><a id="l00742" name="l00742"></a><span class="lineno"> 742</span> <span class="comment">// Similar to ComputeRouteCumuls, but also tries to pack the cumul values on</span></div>
|
|
<div class="line"><a id="l00743" name="l00743"></a><span class="lineno"> 743</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 id="l00744" name="l00744"></a><span class="lineno"> 744</span> <span class="comment">// minimized, and then the cumul of the start of the route is maximized.</span></div>
|
|
<div class="line"><a id="l00745" name="l00745"></a><span class="lineno"> 745</span> <span class="comment">// If 'resource' is non-null, the packed route must also respect its start/end</span></div>
|
|
<div class="line"><a id="l00746" name="l00746"></a><span class="lineno"> 746</span> <span class="comment">// time window.</span></div>
|
|
<div class="line"><a id="l00747" name="l00747"></a><span class="lineno"> 747</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a070e10db63b6b261c4fffaf68d517a82">ComputePackedRouteCumuls</a>(</div>
|
|
<div class="line"><a id="l00748" name="l00748"></a><span class="lineno"> 748</span> <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00749" name="l00749"></a><span class="lineno"> 749</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model_1_1_resource_group_1_1_resource.html">RoutingModel::ResourceGroup::Resource</a>* resource,</div>
|
|
<div class="line"><a id="l00750" name="l00750"></a><span class="lineno"> 750</span> std::vector<int64_t>* packed_cumuls, std::vector<int64_t>* packed_breaks);</div>
|
|
<div class="line"><a id="l00751" name="l00751"></a><span class="lineno"> 751</span> </div>
|
|
<div class="line"><a id="l00752" name="l00752"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a771ef9d454a03f02a8c884aacaf61765"> 752</a></span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code hl_function" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a771ef9d454a03f02a8c884aacaf61765">dimension</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00753" name="l00753"></a><span class="lineno"> 753</span> <span class="keywordflow">return</span> optimizer_core_.<a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a771ef9d454a03f02a8c884aacaf61765">dimension</a>();</div>
|
|
<div class="line"><a id="l00754" name="l00754"></a><span class="lineno"> 754</span> }</div>
|
|
<div class="line"><a id="l00755" name="l00755"></a><span class="lineno"> 755</span> </div>
|
|
<div class="line"><a id="l00756" name="l00756"></a><span class="lineno"> 756</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00757" name="l00757"></a><span class="lineno"> 757</span> std::vector<std::unique_ptr<RoutingLinearSolverWrapper>> solver_;</div>
|
|
<div class="line"><a id="l00758" name="l00758"></a><span class="lineno"> 758</span> <a class="code hl_class" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html">DimensionCumulOptimizerCore</a> optimizer_core_;</div>
|
|
<div class="line"><a id="l00759" name="l00759"></a><span class="lineno"> 759</span>};</div>
|
|
<div class="line"><a id="l00760" name="l00760"></a><span class="lineno"> 760</span> </div>
|
|
<div class="line"><a id="l00761" name="l00761"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html"> 761</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html">GlobalDimensionCumulOptimizer</a> {</div>
|
|
<div class="line"><a id="l00762" name="l00762"></a><span class="lineno"> 762</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00763" name="l00763"></a><span class="lineno"> 763</span> <a class="code hl_function" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a06f837315ff17857e7a2dcd6524784f4">GlobalDimensionCumulOptimizer</a>(</div>
|
|
<div class="line"><a id="l00764" name="l00764"></a><span class="lineno"> 764</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code hl_function" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a771ef9d454a03f02a8c884aacaf61765">dimension</a>,</div>
|
|
<div class="line"><a id="l00765" name="l00765"></a><span class="lineno"> 765</span> RoutingSearchParameters::SchedulingSolver solver_type);</div>
|
|
<div class="line"><a id="l00766" name="l00766"></a><span class="lineno"> 766</span> <span class="comment">// If feasible, computes the optimal cost of the entire model with regards to</span></div>
|
|
<div class="line"><a id="l00767" name="l00767"></a><span class="lineno"> 767</span> <span class="comment">// the optimizer_core_'s dimension costs, minimizing cumul soft lower/upper</span></div>
|
|
<div class="line"><a id="l00768" name="l00768"></a><span class="lineno"> 768</span> <span class="comment">// bound costs and vehicle/global span costs, and stores it in "optimal_cost"</span></div>
|
|
<div class="line"><a id="l00769" name="l00769"></a><span class="lineno"> 769</span> <span class="comment">// (if not null).</span></div>
|
|
<div class="line"><a id="l00770" name="l00770"></a><span class="lineno"> 770</span> <span class="comment">// Returns true iff all the constraints can be respected.</span></div>
|
|
<div class="line"><a id="l00771" name="l00771"></a><span class="lineno"> 771</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a3ad9e218b0cfe6e27394f39c7117c065">ComputeCumulCostWithoutFixedTransits</a>(</div>
|
|
<div class="line"><a id="l00772" name="l00772"></a><span class="lineno"> 772</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00773" name="l00773"></a><span class="lineno"> 773</span> int64_t* optimal_cost_without_transits);</div>
|
|
<div class="line"><a id="l00774" name="l00774"></a><span class="lineno"> 774</span> <span class="comment">// If feasible, computes the optimal values for cumul, break and resource</span></div>
|
|
<div class="line"><a id="l00775" name="l00775"></a><span class="lineno"> 775</span> <span class="comment">// variables, minimizing cumul soft lower/upper bound costs and vehicle/global</span></div>
|
|
<div class="line"><a id="l00776" name="l00776"></a><span class="lineno"> 776</span> <span class="comment">// span costs, stores them in "optimal_cumuls" (if not null), "optimal_breaks"</span></div>
|
|
<div class="line"><a id="l00777" name="l00777"></a><span class="lineno"> 777</span> <span class="comment">// and "optimal_resource_indices_per_group", and returns true.</span></div>
|
|
<div class="line"><a id="l00778" name="l00778"></a><span class="lineno"> 778</span> <span class="comment">// Returns false if the routes are not feasible.</span></div>
|
|
<div class="line"><a id="l00779" name="l00779"></a><span class="lineno"> 779</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a29be0207f4e9f5407644119da4e80890">ComputeCumuls</a>(</div>
|
|
<div class="line"><a id="l00780" name="l00780"></a><span class="lineno"> 780</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00781" name="l00781"></a><span class="lineno"> 781</span> std::vector<int64_t>* optimal_cumuls,</div>
|
|
<div class="line"><a id="l00782" name="l00782"></a><span class="lineno"> 782</span> std::vector<int64_t>* optimal_breaks,</div>
|
|
<div class="line"><a id="l00783" name="l00783"></a><span class="lineno"> 783</span> std::vector<std::vector<int>>* optimal_resource_indices_per_group);</div>
|
|
<div class="line"><a id="l00784" name="l00784"></a><span class="lineno"> 784</span> </div>
|
|
<div class="line"><a id="l00785" name="l00785"></a><span class="lineno"> 785</span> <span class="comment">// Similar to ComputeCumuls, but also tries to pack the cumul values on all</span></div>
|
|
<div class="line"><a id="l00786" name="l00786"></a><span class="lineno"> 786</span> <span class="comment">// routes, such that the cost remains the same, the cumuls of route ends are</span></div>
|
|
<div class="line"><a id="l00787" name="l00787"></a><span class="lineno"> 787</span> <span class="comment">// minimized, and then the cumuls of the starts of the routes are maximized.</span></div>
|
|
<div class="line"><a id="l00788" name="l00788"></a><span class="lineno"> 788</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a516015649889c185288546056d3e8e63">ComputePackedCumuls</a>(</div>
|
|
<div class="line"><a id="l00789" name="l00789"></a><span class="lineno"> 789</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00790" name="l00790"></a><span class="lineno"> 790</span> std::vector<int64_t>* packed_cumuls, std::vector<int64_t>* packed_breaks,</div>
|
|
<div class="line"><a id="l00791" name="l00791"></a><span class="lineno"> 791</span> std::vector<std::vector<int>>* resource_indices_per_group);</div>
|
|
<div class="line"><a id="l00792" name="l00792"></a><span class="lineno"> 792</span> </div>
|
|
<div class="line"><a id="l00793" name="l00793"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a771ef9d454a03f02a8c884aacaf61765"> 793</a></span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code hl_function" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a771ef9d454a03f02a8c884aacaf61765">dimension</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00794" name="l00794"></a><span class="lineno"> 794</span> <span class="keywordflow">return</span> optimizer_core_.<a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a771ef9d454a03f02a8c884aacaf61765">dimension</a>();</div>
|
|
<div class="line"><a id="l00795" name="l00795"></a><span class="lineno"> 795</span> }</div>
|
|
<div class="line"><a id="l00796" name="l00796"></a><span class="lineno"> 796</span> </div>
|
|
<div class="line"><a id="l00797" name="l00797"></a><span class="lineno"> 797</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00798" name="l00798"></a><span class="lineno"> 798</span> std::unique_ptr<RoutingLinearSolverWrapper> solver_;</div>
|
|
<div class="line"><a id="l00799" name="l00799"></a><span class="lineno"> 799</span> <a class="code hl_class" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html">DimensionCumulOptimizerCore</a> optimizer_core_;</div>
|
|
<div class="line"><a id="l00800" name="l00800"></a><span class="lineno"> 800</span>};</div>
|
|
<div class="line"><a id="l00801" name="l00801"></a><span class="lineno"> 801</span> </div>
|
|
<div class="line"><a id="l00802" name="l00802"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_resource_assignment_optimizer.html"> 802</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_resource_assignment_optimizer.html">ResourceAssignmentOptimizer</a> {</div>
|
|
<div class="line"><a id="l00803" name="l00803"></a><span class="lineno"> 803</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00804" name="l00804"></a><span class="lineno"> 804</span> <a class="code hl_function" href="classoperations__research_1_1_resource_assignment_optimizer.html#a190cb09ddb5b31582a9ce6ba943738d0">ResourceAssignmentOptimizer</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model_1_1_resource_group.html">RoutingModel::ResourceGroup</a>* resource_group,</div>
|
|
<div class="line"><a id="l00805" name="l00805"></a><span class="lineno"> 805</span> <a class="code hl_class" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html">LocalDimensionCumulOptimizer</a>* optimizer,</div>
|
|
<div class="line"><a id="l00806" name="l00806"></a><span class="lineno"> 806</span> <a class="code hl_class" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html">LocalDimensionCumulOptimizer</a>* mp_optimizer);</div>
|
|
<div class="line"><a id="l00807" name="l00807"></a><span class="lineno"> 807</span> </div>
|
|
<div class="line"><a id="l00808" name="l00808"></a><span class="lineno"> 808</span> <span class="comment">// Returns the cost resulting from the min-cost assignment of resources to</span></div>
|
|
<div class="line"><a id="l00809" name="l00809"></a><span class="lineno"> 809</span> <span class="comment">// (used) vehicles, or -1 if the assignment is impossible.</span></div>
|
|
<div class="line"><a id="l00810" name="l00810"></a><span class="lineno"> 810</span> <span class="comment">// For each vehicle v and resource r, the cost of assigning r to v is equal to</span></div>
|
|
<div class="line"><a id="l00811" name="l00811"></a><span class="lineno"> 811</span> <span class="comment">// - primary_vehicle_to_resource_assignment_costs[v][r] if</span></div>
|
|
<div class="line"><a id="l00812" name="l00812"></a><span class="lineno"> 812</span> <span class="comment">// primary_vehicle_to_resource_assignment_costs[v] is not empty,</span></div>
|
|
<div class="line"><a id="l00813" name="l00813"></a><span class="lineno"> 813</span> <span class="comment">// - secondary_vehicle_to_resource_assignment_costs[v][r] otherwise</span></div>
|
|
<div class="line"><a id="l00814" name="l00814"></a><span class="lineno"> 814</span> <span class="comment">// (secondary_vehicle_to_resource_assignment_costs[v] can never be empty).</span></div>
|
|
<div class="line"><a id="l00815" name="l00815"></a><span class="lineno"> 815</span> <span class="comment">// If non-null, 'resource_indices' contains the index of the resource assigned</span></div>
|
|
<div class="line"><a id="l00816" name="l00816"></a><span class="lineno"> 816</span> <span class="comment">// to each vehicle.</span></div>
|
|
<div class="line"><a id="l00817" name="l00817"></a><span class="lineno"> 817</span> int64_t <a class="code hl_function" href="classoperations__research_1_1_resource_assignment_optimizer.html#aea5d749ab9acc34d5c7a7a62be3d20a3">ComputeBestAssignmentCost</a>(</div>
|
|
<div class="line"><a id="l00818" name="l00818"></a><span class="lineno"> 818</span> <span class="keyword">const</span> std::vector<std::vector<int64_t>>&</div>
|
|
<div class="line"><a id="l00819" name="l00819"></a><span class="lineno"> 819</span> primary_vehicle_to_resource_assignment_costs,</div>
|
|
<div class="line"><a id="l00820" name="l00820"></a><span class="lineno"> 820</span> <span class="keyword">const</span> std::vector<std::vector<int64_t>>&</div>
|
|
<div class="line"><a id="l00821" name="l00821"></a><span class="lineno"> 821</span> secondary_vehicle_to_resource_assignment_costs,</div>
|
|
<div class="line"><a id="l00822" name="l00822"></a><span class="lineno"> 822</span> <span class="keyword">const</span> std::function<<span class="keywordtype">bool</span>(<span class="keywordtype">int</span>)>& use_primary_for_vehicle,</div>
|
|
<div class="line"><a id="l00823" name="l00823"></a><span class="lineno"> 823</span> std::vector<int>* resource_indices) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00824" name="l00824"></a><span class="lineno"> 824</span> </div>
|
|
<div class="line"><a id="l00825" name="l00825"></a><span class="lineno"> 825</span> <span class="comment">// Computes the vehicle-to-resource assignment costs for the given vehicle to</span></div>
|
|
<div class="line"><a id="l00826" name="l00826"></a><span class="lineno"> 826</span> <span class="comment">// all resources in the group, and sets these costs in assignment_costs (if</span></div>
|
|
<div class="line"><a id="l00827" name="l00827"></a><span class="lineno"> 827</span> <span class="comment">// non-null).</span></div>
|
|
<div class="line"><a id="l00828" name="l00828"></a><span class="lineno"> 828</span> <span class="comment">// optimize_vehicle_costs indicates if the costs should be optimized or if</span></div>
|
|
<div class="line"><a id="l00829" name="l00829"></a><span class="lineno"> 829</span> <span class="comment">// we merely care about feasibility (cost of 0) and infeasibility (cost of -1)</span></div>
|
|
<div class="line"><a id="l00830" name="l00830"></a><span class="lineno"> 830</span> <span class="comment">// of the assignments.</span></div>
|
|
<div class="line"><a id="l00831" name="l00831"></a><span class="lineno"> 831</span> <span class="comment">// The cumul and break values corresponding to the assignment of each resource</span></div>
|
|
<div class="line"><a id="l00832" name="l00832"></a><span class="lineno"> 832</span> <span class="comment">// are also set in cumul_values and break_values, if non-null.</span></div>
|
|
<div class="line"><a id="l00833" name="l00833"></a><span class="lineno"> 833</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_resource_assignment_optimizer.html#a4797496dc1aa3aac373d5e3df4a26336">ComputeAssignmentCostsForVehicle</a>(</div>
|
|
<div class="line"><a id="l00834" name="l00834"></a><span class="lineno"> 834</span> <span class="keywordtype">int</span> v, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00835" name="l00835"></a><span class="lineno"> 835</span> <span class="keywordtype">bool</span> optimize_vehicle_costs, std::vector<int64_t>* assignment_costs,</div>
|
|
<div class="line"><a id="l00836" name="l00836"></a><span class="lineno"> 836</span> std::vector<std::vector<int64_t>>* cumul_values,</div>
|
|
<div class="line"><a id="l00837" name="l00837"></a><span class="lineno"> 837</span> std::vector<std::vector<int64_t>>* break_values);</div>
|
|
<div class="line"><a id="l00838" name="l00838"></a><span class="lineno"> 838</span> </div>
|
|
<div class="line"><a id="l00839" name="l00839"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_resource_assignment_optimizer.html#a1ed23c8f62342f4f212059ea2966b933"> 839</a></span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <span class="keyword">const</span> <a class="code hl_function" href="classoperations__research_1_1_resource_assignment_optimizer.html#a1ed23c8f62342f4f212059ea2966b933">dimension</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00840" name="l00840"></a><span class="lineno"> 840</span> <span class="keywordflow">return</span> optimizer_.<a class="code hl_function" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a771ef9d454a03f02a8c884aacaf61765">dimension</a>();</div>
|
|
<div class="line"><a id="l00841" name="l00841"></a><span class="lineno"> 841</span> }</div>
|
|
<div class="line"><a id="l00842" name="l00842"></a><span class="lineno"> 842</span> </div>
|
|
<div class="line"><a id="l00843" name="l00843"></a><span class="lineno"> 843</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00844" name="l00844"></a><span class="lineno"> 844</span> <a class="code hl_class" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html">LocalDimensionCumulOptimizer</a>& optimizer_;</div>
|
|
<div class="line"><a id="l00845" name="l00845"></a><span class="lineno"> 845</span> <a class="code hl_class" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html">LocalDimensionCumulOptimizer</a>& mp_optimizer_;</div>
|
|
<div class="line"><a id="l00846" name="l00846"></a><span class="lineno"> 846</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>& model_;</div>
|
|
<div class="line"><a id="l00847" name="l00847"></a><span class="lineno"> 847</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model_1_1_resource_group.html">RoutingModel::ResourceGroup</a>& resource_group_;</div>
|
|
<div class="line"><a id="l00848" name="l00848"></a><span class="lineno"> 848</span>};</div>
|
|
<div class="line"><a id="l00849" name="l00849"></a><span class="lineno"> 849</span> </div>
|
|
<div class="line"><a id="l00850" name="l00850"></a><span class="lineno"> 850</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a id="l00851" name="l00851"></a><span class="lineno"> 851</span> </div>
|
|
<div class="line"><a id="l00852" name="l00852"></a><span class="lineno"> 852</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_CONSTRAINT_SOLVER_ROUTING_LP_SCHEDULING_H_</span></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></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#l00895">base/logging.h:895</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#l00894">base/logging.h:894</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00890">base/logging.h:890</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae4db23f10f5d4aad6d735f5a74cd6f8c"><div class="ttname"><a href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a></div><div class="ttdeci">#define CHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00705">base/logging.h:705</a></div></div>
|
|
<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#l00891">base/logging.h:891</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#l00984">base/logging.h:984</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#l00054">routing_lp_scheduling.h:54</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_a03e0559549552ae0d25421ab310f73e1"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#a03e0559549552ae0d25421ab310f73e1">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#l00079">routing_lp_scheduling.h:79</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_a9fd8e875c97504d8d8121125decee57a"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#a9fd8e875c97504d8d8121125decee57a">operations_research::CumulBoundsPropagator::CumulMax</a></div><div class="ttdeci">int64_t CumulMax(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00072">routing_lp_scheduling.h:72</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_aa83a7ff5ef57860290d9838959d6ecf1"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#aa83a7ff5ef57860290d9838959d6ecf1">operations_research::CumulBoundsPropagator::PropagateCumulBounds</a></div><div class="ttdeci">bool PropagateCumulBounds(const std::function< int64_t(int64_t)> &next_accessor, int64_t cumul_offset)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00420">routing_lp_scheduling.cc:420</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_af1f46eca007a484893dbde252abb8251"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#af1f46eca007a484893dbde252abb8251">operations_research::CumulBoundsPropagator::CumulMin</a></div><div class="ttdeci">int64_t CumulMin(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00068">routing_lp_scheduling.h:68</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#l00257">routing_lp_scheduling.cc:257</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#l00566">routing_lp_scheduling.h:566</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a164fa51cd8575b74cbc058770461eac3"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a164fa51cd8575b74cbc058770461eac3">operations_research::DimensionCumulOptimizerCore::OptimizeSingleRouteWithResources</a></div><div class="ttdeci">std::vector< DimensionSchedulingStatus > OptimizeSingleRouteWithResources(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, const std::vector< RoutingModel::ResourceGroup::Resource > &resources, const std::vector< int > &resource_indices, bool optimize_vehicle_costs, RoutingLinearSolverWrapper *solver, std::vector< int64_t > *costs_without_transits, std::vector< std::vector< int64_t > > *cumul_values, std::vector< std::vector< int64_t > > *break_values, bool clear_lp=true)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00614">routing_lp_scheduling.cc:614</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a2f7a5a1dd37425548dd240eaa26b3778"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a2f7a5a1dd37425548dd240eaa26b3778">operations_research::DimensionCumulOptimizerCore::Optimize</a></div><div class="ttdeci">DimensionSchedulingStatus Optimize(const std::function< int64_t(int64_t)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64_t > *cumul_values, std::vector< int64_t > *break_values, std::vector< std::vector< int > > *resource_indices_per_group, int64_t *cost, int64_t *transit_cost, bool clear_lp=true)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00709">routing_lp_scheduling.cc:709</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#l00475">routing_lp_scheduling.cc:475</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a771ef9d454a03f02a8c884aacaf61765"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a771ef9d454a03f02a8c884aacaf61765">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#l00609">routing_lp_scheduling.h:609</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a9af3ca4bab4b91eac932f71596ada6ac"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a9af3ca4bab4b91eac932f71596ada6ac">operations_research::DimensionCumulOptimizerCore::OptimizeAndPack</a></div><div class="ttdeci">DimensionSchedulingStatus OptimizeAndPack(const std::function< int64_t(int64_t)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64_t > *cumul_values, std::vector< int64_t > *break_values, std::vector< std::vector< int > > *resource_indices_per_group)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00780">routing_lp_scheduling.cc:780</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_ad8f55e0b1048c51c733207c60a2f87b0"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ad8f55e0b1048c51c733207c60a2f87b0">operations_research::DimensionCumulOptimizerCore::OptimizeSingleRoute</a></div><div class="ttdeci">DimensionSchedulingStatus OptimizeSingleRoute(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64_t > *cumul_values, std::vector< int64_t > *break_values, int64_t *cost, int64_t *transit_cost, bool clear_lp=true)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00504">routing_lp_scheduling.cc:504</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_aec1c4f058fbbbd5e0b5f767c5f0a87a3"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#aec1c4f058fbbbd5e0b5f767c5f0a87a3">operations_research::DimensionCumulOptimizerCore::OptimizeAndPackSingleRoute</a></div><div class="ttdeci">DimensionSchedulingStatus OptimizeAndPackSingleRoute(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, const RoutingModel::ResourceGroup::Resource *resource, RoutingLinearSolverWrapper *solver, std::vector< int64_t > *cumul_values, std::vector< int64_t > *break_values)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00815">routing_lp_scheduling.cc:815</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#l00761">routing_lp_scheduling.h:761</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a06f837315ff17857e7a2dcd6524784f4"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a06f837315ff17857e7a2dcd6524784f4">operations_research::GlobalDimensionCumulOptimizer::GlobalDimensionCumulOptimizer</a></div><div class="ttdeci">GlobalDimensionCumulOptimizer(const RoutingDimension *dimension, RoutingSearchParameters::SchedulingSolver solver_type)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01708">routing_lp_scheduling.cc:1708</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a29be0207f4e9f5407644119da4e80890"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a29be0207f4e9f5407644119da4e80890">operations_research::GlobalDimensionCumulOptimizer::ComputeCumuls</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeCumuls(const std::function< int64_t(int64_t)> &next_accessor, std::vector< int64_t > *optimal_cumuls, std::vector< int64_t > *optimal_breaks, std::vector< std::vector< int > > *optimal_resource_indices_per_group)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01748">routing_lp_scheduling.cc:1748</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a3ad9e218b0cfe6e27394f39c7117c065"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a3ad9e218b0cfe6e27394f39c7117c065">operations_research::GlobalDimensionCumulOptimizer::ComputeCumulCostWithoutFixedTransits</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeCumulCostWithoutFixedTransits(const std::function< int64_t(int64_t)> &next_accessor, int64_t *optimal_cost_without_transits)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01733">routing_lp_scheduling.cc:1733</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a516015649889c185288546056d3e8e63"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a516015649889c185288546056d3e8e63">operations_research::GlobalDimensionCumulOptimizer::ComputePackedCumuls</a></div><div class="ttdeci">DimensionSchedulingStatus ComputePackedCumuls(const std::function< int64_t(int64_t)> &next_accessor, std::vector< int64_t > *packed_cumuls, std::vector< int64_t > *packed_breaks, std::vector< std::vector< int > > *resource_indices_per_group)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01757">routing_lp_scheduling.cc:1757</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a771ef9d454a03f02a8c884aacaf61765"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a771ef9d454a03f02a8c884aacaf61765">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#l00793">routing_lp_scheduling.h:793</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#l00703">routing_lp_scheduling.h:703</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a070e10db63b6b261c4fffaf68d517a82"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a070e10db63b6b261c4fffaf68d517a82">operations_research::LocalDimensionCumulOptimizer::ComputePackedRouteCumuls</a></div><div class="ttdeci">DimensionSchedulingStatus ComputePackedRouteCumuls(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, const RoutingModel::ResourceGroup::Resource *resource, std::vector< int64_t > *packed_cumuls, std::vector< int64_t > *packed_breaks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00245">routing_lp_scheduling.cc:245</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a10cab4b73bfe12bef44924a47c5345b6"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a10cab4b73bfe12bef44924a47c5345b6">operations_research::LocalDimensionCumulOptimizer::ComputeRouteCumulCost</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeRouteCumulCost(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, int64_t *optimal_cost)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00197">routing_lp_scheduling.cc:197</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a161ed371fd2e35ef76b4539540bfcfd6"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a161ed371fd2e35ef76b4539540bfcfd6">operations_research::LocalDimensionCumulOptimizer::ComputeRouteCumuls</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeRouteCumuls(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, std::vector< int64_t > *optimal_cumuls, std::vector< int64_t > *optimal_breaks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00235">routing_lp_scheduling.cc:235</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a296e8d7e154740a84c59774f20a295ba"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a296e8d7e154740a84c59774f20a295ba">operations_research::LocalDimensionCumulOptimizer::ComputeRouteCumulCostWithoutFixedTransits</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeRouteCumulCostWithoutFixedTransits(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, int64_t *optimal_cost_without_transits)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00206">routing_lp_scheduling.cc:206</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#l00167">routing_lp_scheduling.cc:167</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a771ef9d454a03f02a8c884aacaf61765"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a771ef9d454a03f02a8c884aacaf61765">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#l00752">routing_lp_scheduling.h:752</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_adc503615328f6444d3286281f8ba786f"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#adc503615328f6444d3286281f8ba786f">operations_research::LocalDimensionCumulOptimizer::ComputeRouteCumulCostsForResourcesWithoutFixedTransits</a></div><div class="ttdeci">std::vector< DimensionSchedulingStatus > ComputeRouteCumulCostsForResourcesWithoutFixedTransits(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, const std::vector< RoutingModel::ResourceGroup::Resource > &resources, const std::vector< int > &resource_indices, bool optimize_vehicle_costs, std::vector< int64_t > *optimal_costs_without_transits, std::vector< std::vector< int64_t > > *optimal_cumuls, std::vector< std::vector< int64_t > > *optimal_breaks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00221">routing_lp_scheduling.cc:222</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_math_util_html_a55fc8a3af7c2526c83e83586cd578d89"><div class="ttname"><a href="classoperations__research_1_1_math_util.html#a55fc8a3af7c2526c83e83586cd578d89">operations_research::MathUtil::FastInt64Round</a></div><div class="ttdeci">static int64_t 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_resource_assignment_optimizer_html"><div class="ttname"><a href="classoperations__research_1_1_resource_assignment_optimizer.html">operations_research::ResourceAssignmentOptimizer</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00802">routing_lp_scheduling.h:802</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_resource_assignment_optimizer_html_a190cb09ddb5b31582a9ce6ba943738d0"><div class="ttname"><a href="classoperations__research_1_1_resource_assignment_optimizer.html#a190cb09ddb5b31582a9ce6ba943738d0">operations_research::ResourceAssignmentOptimizer::ResourceAssignmentOptimizer</a></div><div class="ttdeci">ResourceAssignmentOptimizer(const RoutingModel::ResourceGroup *resource_group, LocalDimensionCumulOptimizer *optimizer, LocalDimensionCumulOptimizer *mp_optimizer)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01768">routing_lp_scheduling.cc:1768</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_resource_assignment_optimizer_html_a1ed23c8f62342f4f212059ea2966b933"><div class="ttname"><a href="classoperations__research_1_1_resource_assignment_optimizer.html#a1ed23c8f62342f4f212059ea2966b933">operations_research::ResourceAssignmentOptimizer::dimension</a></div><div class="ttdeci">const RoutingDimension *const dimension() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00839">routing_lp_scheduling.h:839</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_resource_assignment_optimizer_html_a4797496dc1aa3aac373d5e3df4a26336"><div class="ttname"><a href="classoperations__research_1_1_resource_assignment_optimizer.html#a4797496dc1aa3aac373d5e3df4a26336">operations_research::ResourceAssignmentOptimizer::ComputeAssignmentCostsForVehicle</a></div><div class="ttdeci">bool ComputeAssignmentCostsForVehicle(int v, const std::function< int64_t(int64_t)> &next_accessor, bool optimize_vehicle_costs, std::vector< int64_t > *assignment_costs, std::vector< std::vector< int64_t > > *cumul_values, std::vector< std::vector< int64_t > > *break_values)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01777">routing_lp_scheduling.cc:1777</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_resource_assignment_optimizer_html_aea5d749ab9acc34d5c7a7a62be3d20a3"><div class="ttname"><a href="classoperations__research_1_1_resource_assignment_optimizer.html#aea5d749ab9acc34d5c7a7a62be3d20a3">operations_research::ResourceAssignmentOptimizer::ComputeBestAssignmentCost</a></div><div class="ttdeci">int64_t ComputeBestAssignmentCost(const std::vector< std::vector< int64_t > > &primary_vehicle_to_resource_assignment_costs, const std::vector< std::vector< int64_t > > &secondary_vehicle_to_resource_assignment_costs, const std::function< bool(int)> &use_primary_for_vehicle, std::vector< int > *resource_indices) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01867">routing_lp_scheduling.cc:1867</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#l00386">routing_lp_scheduling.h:386</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#l00468">routing_lp_scheduling.h:468</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#l00460">routing_lp_scheduling.h:460</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#l00475">routing_lp_scheduling.h:475</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#l00388">routing_lp_scheduling.h:388</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#l00404">routing_lp_scheduling.h:404</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a377c018786f6eaa2272bf3d014a3226d"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a377c018786f6eaa2272bf3d014a3226d">operations_research::RoutingCPSatWrapper::SetVariableBounds</a></div><div class="ttdeci">bool SetVariableBounds(int index, int64_t lower_bound, int64_t upper_bound) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00411">routing_lp_scheduling.h:411</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#l00551">routing_lp_scheduling.h:551</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a624e1c907319c025fd9187bdc441f12b"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a624e1c907319c025fd9187bdc441f12b">operations_research::RoutingCPSatWrapper::GetObjectiveValue</a></div><div class="ttdeci">int64_t GetObjectiveValue() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00548">routing_lp_scheduling.h:548</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#l00526">routing_lp_scheduling.h:526</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#l00398">routing_lp_scheduling.h:398</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#l00500">routing_lp_scheduling.h:500</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#l00511">routing_lp_scheduling.h:511</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#l00522">routing_lp_scheduling.h:522</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#l00452">routing_lp_scheduling.h:452</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a939c293c5a4c8f24eb100b7cf6c7a1e2"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a939c293c5a4c8f24eb100b7cf6c7a1e2">operations_research::RoutingCPSatWrapper::GetVariableUpperBound</a></div><div class="ttdeci">int64_t GetVariableUpperBound(int index) const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00438">routing_lp_scheduling.h:438</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a9b8503db548f9f4ef7f01c4706d4d56d"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a9b8503db548f9f4ef7f01c4706d4d56d">operations_research::RoutingCPSatWrapper::AddObjectiveConstraint</a></div><div class="ttdeci">void AddObjectiveConstraint() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00476">routing_lp_scheduling.h:476</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a9bed98c336ea6bfd483e6c59ff901e0a"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a9bed98c336ea6bfd483e6c59ff901e0a">operations_research::RoutingCPSatWrapper::SetVariableDisjointBounds</a></div><div class="ttdeci">void SetVariableDisjointBounds(int index, const std::vector< int64_t > &starts, const std::vector< int64_t > &ends) 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_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#l00554">routing_lp_scheduling.h:554</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_aad45008823f0ecdab2258f5603233a28"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aad45008823f0ecdab2258f5603233a28">operations_research::RoutingCPSatWrapper::CreateNewConstraint</a></div><div class="ttdeci">int CreateNewConstraint(int64_t lower_bound, int64_t upper_bound) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00461">routing_lp_scheduling.h:461</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#l00399">routing_lp_scheduling.h:399</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#l00442">routing_lp_scheduling.h:442</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_af771c825609aad65a2ab27d69c94f42c"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af771c825609aad65a2ab27d69c94f42c">operations_research::RoutingCPSatWrapper::GetVariableLowerBound</a></div><div class="ttdeci">int64_t GetVariableLowerBound(int index) const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00435">routing_lp_scheduling.h:435</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#l00457">routing_lp_scheduling.h:457</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#l02590">routing.h:2590</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#l00240">routing_lp_scheduling.h:240</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#l00303">routing_lp_scheduling.h:303</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#l00320">routing_lp_scheduling.h:320</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a2f4d02d43a8ef41bc24c1ba7588e8e9d"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a2f4d02d43a8ef41bc24c1ba7588e8e9d">operations_research::RoutingGlopWrapper::RoutingGlopWrapper</a></div><div class="ttdeci">RoutingGlopWrapper(bool is_relaxation, const glop::GlopParameters &parameters)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00242">routing_lp_scheduling.h:242</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#l00252">routing_lp_scheduling.h:252</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a377c018786f6eaa2272bf3d014a3226d"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a377c018786f6eaa2272bf3d014a3226d">operations_research::RoutingGlopWrapper::SetVariableBounds</a></div><div class="ttdeci">bool SetVariableBounds(int index, int64_t lower_bound, int64_t upper_bound) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00255">routing_lp_scheduling.h:255</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#l00370">routing_lp_scheduling.h:370</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a624e1c907319c025fd9187bdc441f12b"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a624e1c907319c025fd9187bdc441f12b">operations_research::RoutingGlopWrapper::GetObjectiveValue</a></div><div class="ttdeci">int64_t GetObjectiveValue() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00367">routing_lp_scheduling.h:367</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#l00333">routing_lp_scheduling.h:333</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#l00316">routing_lp_scheduling.h:316</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#l00330">routing_lp_scheduling.h:330</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#l00331">routing_lp_scheduling.h:331</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#l00332">routing_lp_scheduling.h:332</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#l00295">routing_lp_scheduling.h:295</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a939c293c5a4c8f24eb100b7cf6c7a1e2"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a939c293c5a4c8f24eb100b7cf6c7a1e2">operations_research::RoutingGlopWrapper::GetVariableUpperBound</a></div><div class="ttdeci">int64_t GetVariableUpperBound(int index) const 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_a9b8503db548f9f4ef7f01c4706d4d56d"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a9b8503db548f9f4ef7f01c4706d4d56d">operations_research::RoutingGlopWrapper::AddObjectiveConstraint</a></div><div class="ttdeci">void AddObjectiveConstraint() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00321">routing_lp_scheduling.h:321</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a9bed98c336ea6bfd483e6c59ff901e0a"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a9bed98c336ea6bfd483e6c59ff901e0a">operations_research::RoutingGlopWrapper::SetVariableDisjointBounds</a></div><div class="ttdeci">void SetVariableDisjointBounds(int index, const std::vector< int64_t > &starts, const std::vector< int64_t > &ends) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00273">routing_lp_scheduling.h:273</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#l00373">routing_lp_scheduling.h:373</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_aad45008823f0ecdab2258f5603233a28"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#aad45008823f0ecdab2258f5603233a28">operations_research::RoutingGlopWrapper::CreateNewConstraint</a></div><div class="ttdeci">int CreateNewConstraint(int64_t lower_bound, int64_t upper_bound) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00306">routing_lp_scheduling.h:306</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#l00247">routing_lp_scheduling.h:247</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#l00292">routing_lp_scheduling.h:292</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_af771c825609aad65a2ab27d69c94f42c"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#af771c825609aad65a2ab27d69c94f42c">operations_research::RoutingGlopWrapper::GetVariableLowerBound</a></div><div class="ttdeci">int64_t GetVariableLowerBound(int index) const 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_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#l00298">routing_lp_scheduling.h:298</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#l00160">routing_lp_scheduling.h:160</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_a37a896bc69864d8bf32ea51a901a0512"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a37a896bc69864d8bf32ea51a901a0512">operations_research::RoutingLinearSolverWrapper::AddReifiedLinearConstraint</a></div><div class="ttdeci">int AddReifiedLinearConstraint(int64_t lower_bound, int64_t 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#l00211">routing_lp_scheduling.h:211</a></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_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_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_a822c1b23168a59678bc36920d882d813"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a822c1b23168a59678bc36920d882d813">operations_research::RoutingLinearSolverWrapper::AddVariable</a></div><div class="ttdeci">int AddVariable(int64_t lower_bound, int64_t upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00189">routing_lp_scheduling.h:189</a></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_aa7ad30a5bcbd156380533cc7abb69172"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa7ad30a5bcbd156380533cc7abb69172">operations_research::RoutingLinearSolverWrapper::GetObjectiveValue</a></div><div class="ttdeci">virtual int64_t GetObjectiveValue() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ab570a51d5ff506f435fa428d3f145f0a"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab570a51d5ff506f435fa428d3f145f0a">operations_research::RoutingLinearSolverWrapper::AddObjectiveConstraint</a></div><div class="ttdeci">virtual void AddObjectiveConstraint()=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_abd20c644980c8ff8d122dad397f04f8e"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#abd20c644980c8ff8d122dad397f04f8e">operations_research::RoutingLinearSolverWrapper::CreateNewConstraint</a></div><div class="ttdeci">virtual int CreateNewConstraint(int64_t lower_bound, int64_t upper_bound)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_abee3ed815d72e0ececa0a9c1474ab2b9"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#abee3ed815d72e0ececa0a9c1474ab2b9">operations_research::RoutingLinearSolverWrapper::AddLinearConstraint</a></div><div class="ttdeci">int AddLinearConstraint(int64_t lower_bound, int64_t 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#l00198">routing_lp_scheduling.h:198</a></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_ace2a6846080948210abab0845d93e819"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ace2a6846080948210abab0845d93e819">operations_research::RoutingLinearSolverWrapper::SetVariableDisjointBounds</a></div><div class="ttdeci">virtual void SetVariableDisjointBounds(int index, const std::vector< int64_t > &starts, const std::vector< int64_t > &ends)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ad1a3a80256c0caa8f7ebdacb42294c81"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad1a3a80256c0caa8f7ebdacb42294c81">operations_research::RoutingLinearSolverWrapper::SetVariableBounds</a></div><div class="ttdeci">virtual bool SetVariableBounds(int index, int64_t lower_bound, int64_t upper_bound)=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_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_af146d17809b0a879227c142b8814a98c"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af146d17809b0a879227c142b8814a98c">operations_research::RoutingLinearSolverWrapper::GetVariableUpperBound</a></div><div class="ttdeci">virtual int64_t GetVariableUpperBound(int index) const =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#l00162">routing_lp_scheduling.h:162</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_afaf5c7b0c88dbe8a11b8d9d66a7c2871"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#afaf5c7b0c88dbe8a11b8d9d66a7c2871">operations_research::RoutingLinearSolverWrapper::GetVariableLowerBound</a></div><div class="ttdeci">virtual int64_t GetVariableLowerBound(int index) const =0</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_routing_model_1_1_resource_group_1_1_resource_html"><div class="ttname"><a href="classoperations__research_1_1_routing_model_1_1_resource_group_1_1_resource.html">operations_research::RoutingModel::ResourceGroup::Resource</a></div><div class="ttdoc">A Resource sets attributes (costs/constraints) for a set of dimensions.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00419">routing.h:419</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_1_1_resource_group_html"><div class="ttname"><a href="classoperations__research_1_1_routing_model_1_1_resource_group.html">operations_research::RoutingModel::ResourceGroup</a></div><div class="ttdoc">A ResourceGroup defines a set of available Resources with attributes on one or multiple dimensions.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00398">routing.h:398</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html">operations_research::RoutingModel</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00210">routing.h:210</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_logger_html"><div class="ttname"><a href="classoperations__research_1_1_solver_logger.html">operations_research::SolverLogger</a></div><div class="ttdef"><b>Definition:</b> <a href="util_2logging_8h_source.html#l00033">util/logging.h:33</a></div></div>
|
|
<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#l00476">sorted_interval_list.h:476</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#l00571">sorted_interval_list.h:571</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sorted_disjoint_interval_list_html_a815bbd9d71f04362c32528f444b2e5f4"><div class="ttname"><a href="classoperations__research_1_1_sorted_disjoint_interval_list.html#a815bbd9d71f04362c32528f444b2e5f4">operations_research::SortedDisjointIntervalList::FirstIntervalGreaterOrEqual</a></div><div class="ttdeci">Iterator FirstIntervalGreaterOrEqual(int64_t 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#l00814">sorted_interval_list.cc:814</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#l00030">lp_solver.h:30</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#l00126">lp_solver.cc:126</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#l00491">lp_solver.cc:491</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_ac5d36607cb29127a9ce5f6d6e7c140eb"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#ac5d36607cb29127a9ce5f6d6e7c140eb">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#l00101">lp_solver.h:101</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#l00130">lp_solver.cc:130</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#l00112">lp_solver.cc:112</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#l00055">lp_data.h:55</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#l00249">lp_data.cc:249</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#l00317">lp_data.cc:317</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#l00309">lp_data.cc:309</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#l00162">lp_data.cc:162</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_a74f1c824468608a9bb5fee6f10eca698"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a74f1c824468608a9bb5fee6f10eca698">operations_research::glop::LinearProgram::variable_upper_bounds</a></div><div class="ttdeci">const DenseRow & variable_upper_bounds() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8h_source.html#l00232">lp_data.h:232</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#l00517">lp_data.cc:517</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_a977f52b2e6fa6e9d6db8d8ac9cbf33c4"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a977f52b2e6fa6e9d6db8d8ac9cbf33c4">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#l00223">lp_data.h:223</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#l00134">lp_data.cc:134</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#l00543">lp_data.h:543</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#l00560">lp_data.cc:560</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#l00326">lp_data.cc:326</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#l00205">lp_data.h:205</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#l00191">lp_data.cc:191</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html_adb3b261831be8afb947baceaba1c220b"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#adb3b261831be8afb947baceaba1c220b">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#l00229">lp_data.h:229</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#l00343">lp_data.cc:343</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#l00042">sat/model.h:42</a></div></div>
|
|
<div class="ttc" id="acp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a></div><div class="ttdeci">SatParameters parameters</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00119">cp_model_fz_solver.cc:119</a></div></div>
|
|
<div class="ttc" id="acp__model__solver_8h_html"><div class="ttname"><a href="cp__model__solver_8h.html">cp_model_solver.h</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695"><div class="ttname"><a href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a></div><div class="ttdeci">const Constraint * ct</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="ag__gurobi_8cc_html_a2237393c7ae7ad7344c9885066d5ab6d"><div class="ttname"><a href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a></div><div class="ttdeci">absl::Status status</div><div class="ttdef"><b>Definition:</b> <a href="g__gurobi_8cc_source.html#l00035">g_gurobi.cc:35</a></div></div>
|
|
<div class="ttc" id="agscip__solver_8cc_html_a1ba5ca0f61f2fa13bd23bf0f89004f35"><div class="ttname"><a href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a></div><div class="ttdeci">double upper_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00137">gscip_solver.cc:137</a></div></div>
|
|
<div class="ttc" id="agscip__solver_8cc_html_a1e2f9a2352c1d9a6cada9544898fceec"><div class="ttname"><a href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a></div><div class="ttdeci">double lower_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00136">gscip_solver.cc:136</a></div></div>
|
|
<div class="ttc" id="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#l00274">gurobi_interface.cc:274</a></div></div>
|
|
<div class="ttc" id="alocal__search_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l02750">local_search.cc:2750</a></div></div>
|
|
<div class="ttc" id="alp__data_8h_html"><div class="ttname"><a href="lp__data_8h.html">lp_data.h</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_a884f3b645d22471e5ed3320e182cd493"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493">operations_research::glop::ProblemStatus</a></div><div class="ttdeci">ProblemStatus</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00102">lp_types.h:102</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_a884f3b645d22471e5ed3320e182cd493a0beacd9ca195de65e685252f1b46b954"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493a0beacd9ca195de65e685252f1b46b954">operations_research::glop::ProblemStatus::IMPRECISE</a></div><div class="ttdeci">@ IMPRECISE</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_a884f3b645d22471e5ed3320e182cd493af00c8dbdd6e1f11bdae06be94277d293"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493af00c8dbdd6e1f11bdae06be94277d293">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#l00084">lp_types.h:84</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a0b38571bb1f48f98df1134a4005d9c21"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0b38571bb1f48f98df1134a4005d9c21">operations_research::sat::ScaleAndSetObjective</a></div><div class="ttdeci">bool ScaleAndSetObjective(const SatParameters &params, const std::vector< std::pair< int, double > > &objective, double objective_offset, bool maximize, CpModelProto *cp_model, SolverLogger *logger)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l01059">sat/lp_utils.cc:1059</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#l00783">cp_model_solver.cc:783</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#l03055">cp_model_solver.cc:3055</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_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#l00150">routing_lp_scheduling.h:150</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="arouting_8h_html"><div class="ttname"><a href="routing_8h.html">routing.h</a></div></div>
|
|
<div class="ttc" id="arouting__filters_8cc_html_a8e4ee19dee0e00541dbe9bbc83d806ba"><div class="ttname"><a href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a></div><div class="ttdeci">int64_t coefficient</div><div class="ttdef"><b>Definition:</b> <a href="routing__filters_8cc_source.html#l00969">routing_filters.cc:969</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a75d7b5e4cab1e156cc7a2c5eba1e16f1"><div class="ttname"><a href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a></div><div class="ttdeci">int64_t cost</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00152">routing_flow.cc:152</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_afca32f65388659a4b0956496169488b4"><div class="ttname"><a href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a></div><div class="ttdeci">int64_t head</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00150">routing_flow.cc:150</a></div></div>
|
|
<div class="ttc" id="asat_2lp__utils_8h_html"><div class="ttname"><a href="sat_2lp__utils_8h.html">lp_utils.h</a></div></div>
|
|
<div class="ttc" id="asat_2model_8h_html"><div class="ttname"><a href="sat_2model_8h.html">model.h</a></div></div>
|
|
<div class="ttc" id="asaturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.h</a></div></div>
|
|
<div class="ttc" id="asorted__interval__list_8h_html"><div class="ttname"><a href="sorted__interval__list_8h.html">sorted_interval_list.h</a></div></div>
|
|
<div class="ttc" id="asparse__submatrix_8cc_html_a9b7656b922ea4ec96097d7380c0e61fe"><div class="ttname"><a href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a></div><div class="ttdeci">int64_t start</div><div class="ttdef"><b>Definition:</b> <a href="sparse__submatrix_8cc_source.html#l00035">sparse_submatrix.cc:35</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.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|