72 lines
5.8 KiB
HTML
72 lines
5.8 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<title>OR-Tools</title>
|
|
<meta http-equiv="Content-Type" content="text/html;"/>
|
|
<meta charset="utf-8"/>
|
|
<!--<link rel='stylesheet' type='text/css' href="https://fonts.googleapis.com/css?family=Ubuntu:400,700,400italic"/>-->
|
|
<link rel="stylesheet" type="text/css" href="ortools.css" title="default" media="screen,print" />
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
</head>
|
|
<body>
|
|
<div id="banner-container">
|
|
<div id="banner">
|
|
<span id="sfml">OR-Tools 7.2</span>
|
|
</div>
|
|
</div>
|
|
<link rel="icon" href="https://developers.google.com/optimization/images/orLogo.png">
|
|
<div id="content">
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<li><a href="index.html"><span>Main Page</span></a></li>
|
|
<li class="current"><a href="pages.html"><span>Related Pages</span></a></li>
|
|
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
|
|
<li><a href="annotated.html"><span>Classes</span></a></li>
|
|
<li><a href="files.html"><span>Files</span></a></li>
|
|
</ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="PageDoc"><div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">Todo List </div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<div class="textblock"><dl class="reflist">
|
|
<dt>Namespace <a class="el" href="namespaceoperations__research.html">operations_research</a> </dt>
|
|
<dd><p class="startdd"><a class="anchor" id="_todo000001"></a>(user,user): refine this toplevel comment when this file settles.</p>
|
|
<p class="interdd"><a class="anchor" id="_todo000007"></a>(user): base this code on LinearSumAssignment. </p>
|
|
<p class="enddd"><a class="anchor" id="_todo000008"></a>(user) Multi-dimensional knapsack problem with n-ary conflicts between items. </p>
|
|
</dd>
|
|
<dt>Class <a class="el" href="classoperations__research_1_1DynamicPartition.html">operations_research::DynamicPartition</a> </dt>
|
|
<dd><a class="anchor" id="_todo000002"></a>(user): rename this to BacktrackableSplittingPartition. </dd>
|
|
<dt>Member <a class="el" href="classoperations__research_1_1DynamicPartition.html#a16fce09dd4c359a6acfd0a864e0a5ebd">operations_research::DynamicPartition::Refine</a> (const std::vector< int > &distinguished_subset)</dt>
|
|
<dd><a class="anchor" id="_todo000003"></a>(user): the graph symmetry finder could probably benefit a lot from keeping track of one additional bit of information for each part that remains unchanged by a <a class="el" href="classoperations__research_1_1DynamicPartition.html#a16fce09dd4c359a6acfd0a864e0a5ebd" title="Refines the partition such that elements that are in distinguished_subset never share the same part a...">Refine()</a> operation: was that part entirely <em>in</em> the distinguished subset or entirely <em>out</em>? </dd>
|
|
<dt>Member <a class="el" href="classoperations__research_1_1DynamicPermutation.html#acf9308c2eb8d7c1d5b5e3193c672f36d">operations_research::DynamicPermutation::LooseEnds</a> () const</dt>
|
|
<dd><a class="anchor" id="_todo000004"></a>(user): use a faster underlying container like SparseBitSet, and tweak this API accordingly. </dd>
|
|
<dt>Member <a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html#a0923c1bbc2e1514814a1d7fa55d7b0dc">operations_research::GraphSymmetryFinder::FindSymmetries</a> (double time_limit_seconds, std::vector< int > *node_equivalence_classes_io, std::vector< std::unique_ptr< SparsePermutation > > *generators, std::vector< int > *factorized_automorphism_group_size)</dt>
|
|
<dd><a class="anchor" id="_todo000006"></a>(user): verify the minimality in unit tests. </dd>
|
|
<dt>Member <a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html#af670a8f7f325e3a7431f2723c52ec25d">operations_research::GraphSymmetryFinder::GraphSymmetryFinder</a> (const Graph &graph, bool is_undirected)</dt>
|
|
<dd><a class="anchor" id="_todo000005"></a>(user): support multi-arcs. </dd>
|
|
<dt>Class <a class="el" href="structoperations__research_1_1KnapsackAssignment.html">operations_research::KnapsackAssignment</a> </dt>
|
|
<dd><p class="startdd"><a class="anchor" id="_todo000009"></a>(user): Add a new propagator class for conflict constraint.</p>
|
|
<p class="enddd"><a class="anchor" id="_todo000010"></a>(user): Add a new propagator class used as a guide when the problem has several dimensions. </p>
|
|
</dd>
|
|
<dt>Class <a class="el" href="classoperations__research_1_1KnapsackGenericSolver.html">operations_research::KnapsackGenericSolver</a> </dt>
|
|
<dd><a class="anchor" id="_todo000011"></a>(user): In the case of a multi-dimensional knapsack problem, implement an aggregated propagator to combine all dimensions and give a better guide to select the next item (see, for instance, Dobson's aggregated efficiency). </dd>
|
|
<dt>Member <a class="el" href="classoperations__research_1_1SparsePermutation.html#a9fc0ca5752b5ad6cc2a78ff7c512b22a">operations_research::SparsePermutation::LastElementInCycle</a> (int i) const</dt>
|
|
<dd><a class="anchor" id="_todo000013"></a>(user): Provide a full iterator for this? Note that we have more information with the loop above. Not sure it is needed though. </dd>
|
|
<dt>Member <a class="el" href="classoperations__research_1_1SparsePermutation.html#aff385d18c768ffa364c5dccb5fb35c0a">operations_research::SparsePermutation::Size</a> () const</dt>
|
|
<dd><a class="anchor" id="_todo000012"></a>(user,user): complete the reader API. </dd>
|
|
</dl>
|
|
</div></div><!-- PageDoc -->
|
|
</div><!-- contents -->
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|