Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

operations_research::BaseKnapsackSolver	BaseKnapsackSolver This the base class for knapsack solvers
operations_research::HungarianOptimizer
operations_research::Knapsack64ItemsSolver	Knapsack64ItemsSolver Knapsack64ItemsSolver solves the 0-1 knapsack problem when the number of items is less or equal to 64
operations_research::KnapsackAssignment	The following code defines needed classes for the KnapsackGenericSolver class which is the entry point to extend knapsack with new constraints such as conflicts between items
operations_research::KnapsackBruteForceSolver	KnapsackBruteForceSolver KnapsackBruteForceSolver solves the 0-1 knapsack problem when the number of items is less or equal to 30 with brute force, ie
operations_research::KnapsackCapacityPropagator	KnapsackCapacityPropagator KnapsackCapacityPropagator is a KnapsackPropagator used to enforce a capacity constraint
operations_research::KnapsackDynamicProgrammingSolver	KnapsackDynamicProgrammingSolver KnapsackDynamicProgrammingSolver solves the 0-1 knapsack problem using dynamic programming
operations_research::KnapsackGenericSolver	KnapsackGenericSolver KnapsackGenericSolver is the multi-dimensional knapsack solver class
operations_research::KnapsackItem	KnapsackItem KnapsackItem is a small struct to pair an item weight with its corresponding profit
operations_research::KnapsackItemWithEfficiency	KnapsackItemWithEfficiency KnapsackItem is a small struct to pair an item weight with its corresponding profit
operations_research::KnapsackMIPSolver	KnapsackMIPSolver
operations_research::KnapsackPropagator	KnapsackPropagator KnapsackPropagator is the base to model and propagate a constraint given an assignment
operations_research::KnapsackSearchNode	KnapsackSearchNode KnapsackSearchNode is a class used to describe a decision in the decision search tree
operations_research::KnapsackSearchPath	KnapsackSearchPath KnapsackSearchPath is a small class used to represent the path between a node to another node in the search tree
operations_research::KnapsackSolver
operations_research::KnapsackState	KnapsackState KnapsackState represents a partial solution to the knapsack problem