<trid="row_0_"class="even"><tdclass="entry"><spanstyle="width:0px;display:inline-block;"> </span><spanid="arr_0_"class="arrow"onclick="toggleFolder('0_')">▼</span><spanclass="icona"><spanclass="icon">N</span></span><aclass="el"href="namespaceoperations__research.html"target="_self">operations_research</a></td><tdclass="desc">Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License </td></tr>
<trid="row_0_0_"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1BaseKnapsackSolver.html"target="_self">BaseKnapsackSolver</a></td><tdclass="desc">--—<aclass="el"href="classoperations__research_1_1BaseKnapsackSolver.html"title="--— BaseKnapsackSolver --— This is the base class for knapsack solvers.">BaseKnapsackSolver</a> --— This is the base class for knapsack solvers </td></tr>
<trid="row_0_1_"class="even"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1DenseDoublyLinkedList.html"target="_self">DenseDoublyLinkedList</a></td><tdclass="desc">Specialized doubly-linked list that initially holds [0..n-1] in an arbitrary (user-specified) and fixed order </td></tr>
<trid="row_0_2_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_0_2_"class="arrow"onclick="toggleFolder('0_2_')">▼</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1DynamicPartition.html"target="_self">DynamicPartition</a></td><tdclass="desc">Partition class that supports incremental splitting, with backtracking </td></tr>
<trid="row_0_3_"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1DynamicPermutation.html"target="_self">DynamicPermutation</a></td><tdclass="desc">Maintains a 'partial' permutation of [0..n-1] onto itself, with a dynamic API allowing it to be built incrementally, and allowing some backtracking </td></tr>
<trid="row_0_5_"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1KnapsackAssignment.html"target="_self">KnapsackAssignment</a></td><tdclass="desc">--— KnapsackAssignement --— KnapsackAssignement is a small struct used to pair an item with its assignment </td></tr>
<trid="row_0_6_"class="even"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1KnapsackCapacityPropagator.html"target="_self">KnapsackCapacityPropagator</a></td><tdclass="desc">--—<aclass="el"href="classoperations__research_1_1KnapsackCapacityPropagator.html"title="--— KnapsackCapacityPropagator --— KnapsackCapacityPropagator is a KnapsackPropagator used to enforce...">KnapsackCapacityPropagator</a> --—<aclass="el"href="classoperations__research_1_1KnapsackCapacityPropagator.html"title="--— KnapsackCapacityPropagator --— KnapsackCapacityPropagator is a KnapsackPropagator used to enforce...">KnapsackCapacityPropagator</a> is a <aclass="el"href="classoperations__research_1_1KnapsackPropagator.html"title="--— KnapsackPropagator --— KnapsackPropagator is the base class for modeling and propagating a constr...">KnapsackPropagator</a> used to enforce a capacity constraint </td></tr>
<trid="row_0_7_"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1KnapsackGenericSolver.html"target="_self">KnapsackGenericSolver</a></td><tdclass="desc">--—<aclass="el"href="classoperations__research_1_1KnapsackGenericSolver.html"title="--— KnapsackGenericSolver --— KnapsackGenericSolver is the multi-dimensional knapsack solver class.">KnapsackGenericSolver</a> --—<aclass="el"href="classoperations__research_1_1KnapsackGenericSolver.html"title="--— KnapsackGenericSolver --— KnapsackGenericSolver is the multi-dimensional knapsack solver class.">KnapsackGenericSolver</a> is the multi-dimensional knapsack solver class </td></tr>
<trid="row_0_8_"class="even"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1KnapsackItem.html"target="_self">KnapsackItem</a></td><tdclass="desc">--—<aclass="el"href="structoperations__research_1_1KnapsackItem.html"title="--— KnapsackItem --— KnapsackItem is a small struct to pair an item weight with its corresponding pro...">KnapsackItem</a> --—<aclass="el"href="structoperations__research_1_1KnapsackItem.html"title="--— KnapsackItem --— KnapsackItem is a small struct to pair an item weight with its corresponding pro...">KnapsackItem</a> is a small struct to pair an item weight with its corresponding profit </td></tr>
<trid="row_0_9_"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1KnapsackPropagator.html"target="_self">KnapsackPropagator</a></td><tdclass="desc">--—<aclass="el"href="classoperations__research_1_1KnapsackPropagator.html"title="--— KnapsackPropagator --— KnapsackPropagator is the base class for modeling and propagating a constr...">KnapsackPropagator</a> --—<aclass="el"href="classoperations__research_1_1KnapsackPropagator.html"title="--— KnapsackPropagator --— KnapsackPropagator is the base class for modeling and propagating a constr...">KnapsackPropagator</a> is the base class for modeling and propagating a constraint given an assignment </td></tr>
<trid="row_0_10_"class="even"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1KnapsackSearchNode.html"target="_self">KnapsackSearchNode</a></td><tdclass="desc">--—<aclass="el"href="classoperations__research_1_1KnapsackSearchNode.html"title="--— KnapsackSearchNode --— KnapsackSearchNode is a class used to describe a decision in the decision ...">KnapsackSearchNode</a> --—<aclass="el"href="classoperations__research_1_1KnapsackSearchNode.html"title="--— KnapsackSearchNode --— KnapsackSearchNode is a class used to describe a decision in the decision ...">KnapsackSearchNode</a> is a class used to describe a decision in the decision search tree </td></tr>
<trid="row_0_11_"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1KnapsackSearchPath.html"target="_self">KnapsackSearchPath</a></td><tdclass="desc">--—<aclass="el"href="classoperations__research_1_1KnapsackSearchPath.html"title="--— KnapsackSearchPath --— KnapsackSearchPath is a small class used to represent the path between a n...">KnapsackSearchPath</a> --—<aclass="el"href="classoperations__research_1_1KnapsackSearchPath.html"title="--— KnapsackSearchPath --— KnapsackSearchPath is a small class used to represent the path between a n...">KnapsackSearchPath</a> is a small class used to represent the path between a node to another node in the search tree </td></tr>
<trid="row_0_13_"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1KnapsackState.html"target="_self">KnapsackState</a></td><tdclass="desc">--—<aclass="el"href="classoperations__research_1_1KnapsackState.html"title="--— KnapsackState --— KnapsackState represents a partial solution to the knapsack problem.">KnapsackState</a> --—<aclass="el"href="classoperations__research_1_1KnapsackState.html"title="--— KnapsackState --— KnapsackState represents a partial solution to the knapsack problem.">KnapsackState</a> represents a partial solution to the knapsack problem </td></tr>
<trid="row_0_14_"class="even"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1MergingPartition.html"target="_self">MergingPartition</a></td><tdclass="desc">Partition class that supports incremental merging, using the union-find algorithm (see <ahref="http://en.wikipedia.org/wiki/Disjoint-set_data_structure">http://en.wikipedia.org/wiki/Disjoint-set_data_structure</a>) </td></tr>
<trid="row_0_15_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_0_15_"class="arrow"onclick="toggleFolder('0_15_')">▼</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1SparsePermutation.html"target="_self">SparsePermutation</a></td><tdclass="desc">A compact representation for permutations of {0..N-1} that displaces few elements: it needs only O(K) memory for a permutation that displaces K elements </td></tr>
