<areashape="rect"href="classoperations__research_1_1BaseKnapsackSolver.html"title="--â BaseKnapsackSolver --â This is the base class for knapsack solvers."alt=""coords="5,5,161,44"/>
<areashape="rect"href="classoperations__research_1_1KnapsackGenericSolver.html"title="--â KnapsackGenericSolver --â KnapsackGenericSolver is the multi-dimensional knapsack solver class."alt=""coords="209,5,381,44"/>
<areashape="rect"href="classoperations__research_1_1DenseDoublyLinkedList.html"title="Specialized doubly-linked list that initially holds [0..n-1] in an arbitrary (user-specified) and fix..."alt=""coords="5,5,174,44"/>
<areashape="rect"href="classoperations__research_1_1DynamicPartition.html"title="Partition class that supports incremental splitting, with backtracking."alt=""coords="5,5,148,44"/>
<areashape="rect"href="classoperations__research_1_1DynamicPermutation.html"title="Maintains a 'partial' permutation of [0..n-1] onto itself, with a dynamic API allowing it to be built..."alt=""coords="5,5,158,44"/>
<areashape="rect"href="structoperations__research_1_1KnapsackAssignment.html"title="--â KnapsackAssignement --â KnapsackAssignement is a small struct used to pair an item with its assig..."alt=""coords="5,5,162,44"/>
<areashape="rect"href="structoperations__research_1_1KnapsackItem.html"title="--â KnapsackItem --â KnapsackItem is a small struct to pair an item weight with its corresponding pro..."alt=""coords="5,5,148,44"/>
<areashape="rect"href="classoperations__research_1_1KnapsackPropagator.html"title="--â KnapsackPropagator --â KnapsackPropagator is the base class for modeling and propagating a constr..."alt=""coords="5,5,159,44"/>
<areashape="rect"href="classoperations__research_1_1KnapsackCapacityPropagator.html"title="--â KnapsackCapacityPropagator --â KnapsackCapacityPropagator is a KnapsackPropagator used to enforce..."alt=""coords="207,5,412,44"/>
<areashape="rect"href="classoperations__research_1_1KnapsackSearchNode.html"title="--â KnapsackSearchNode --â KnapsackSearchNode is a class used to describe a decision in the decision ..."alt=""coords="5,5,167,44"/>
<areashape="rect"href="classoperations__research_1_1KnapsackSearchPath.html"title="--â KnapsackSearchPath --â KnapsackSearchPath is a small class used to represent the path between a n..."alt=""coords="5,5,162,44"/>
<areashape="rect"href="classoperations__research_1_1KnapsackState.html"title="--â KnapsackState --â KnapsackState represents a partial solution to the knapsack problem."alt=""coords="5,5,148,44"/>
<areashape="rect"href="classoperations__research_1_1MergingPartition.html"title="Partition class that supports incremental merging, using the union-find algorithm (see http://en...."alt=""coords="5,5,148,44"/>
<areashape="rect"href="classoperations__research_1_1SparsePermutation.html"title="A compact representation for permutations of {0..N-1} that displaces few elements: it needs only O(K)..."alt=""coords="5,5,148,44"/>