| ▼Noperations_research | Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License |
| CBaseKnapsackSolver | --— BaseKnapsackSolver --— This is the base class for knapsack solvers |
| CDenseDoublyLinkedList | Specialized doubly-linked list that initially holds [0..n-1] in an arbitrary (user-specified) and fixed order |
| ▼CDynamicPartition | Partition class that supports incremental splitting, with backtracking |
| CIterablePart | |
| CDynamicPermutation | Maintains a 'partial' permutation of [0..n-1] onto itself, with a dynamic API allowing it to be built incrementally, and allowing some backtracking |
| CGraphSymmetryFinder | |
| CKnapsackAssignment | --— KnapsackAssignement --— KnapsackAssignement is a small struct used to pair an item with its assignment |
| CKnapsackCapacityPropagator | --— KnapsackCapacityPropagator --— KnapsackCapacityPropagator is a KnapsackPropagator used to enforce a capacity constraint |
| CKnapsackGenericSolver | --— KnapsackGenericSolver --— KnapsackGenericSolver is the multi-dimensional knapsack solver class |
| CKnapsackItem | --— KnapsackItem --— KnapsackItem is a small struct to pair an item weight with its corresponding profit |
| CKnapsackPropagator | --— KnapsackPropagator --— KnapsackPropagator is the base class for modeling and propagating a constraint given an assignment |
| CKnapsackSearchNode | --— KnapsackSearchNode --— KnapsackSearchNode is a class used to describe a decision in the decision search tree |
| CKnapsackSearchPath | --— KnapsackSearchPath --— KnapsackSearchPath is a small class used to represent the path between a node to another node in the search tree |
| CKnapsackSolver | |
| CKnapsackState | --— KnapsackState --— KnapsackState represents a partial solution to the knapsack problem |
| CMergingPartition | Partition class that supports incremental merging, using the union-find algorithm (see http://en.wikipedia.org/wiki/Disjoint-set_data_structure) |
| ▼CSparsePermutation | 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 |
| CIterator |