C++ Reference: class KnapsackSearchNode

This documentation is automatically generated.


   ----- KnapsackSearchNode -----
KnapsackSearchNode is a class used to describe a decision in the decision search tree. The node is defined by a pointer to the parent search node and an assignment (see KnapsackAssignement). As the current state is not explicitly stored in a search node, one should go through the search tree to incrementally build a partial solution from a previous search node.
Method
assignment

Return type: const KnapsackAssignment&

current_profit

Return type: int64

depth

Return type: int

KnapsackSearchNode

Arguments: const KnapsackSearchNode* const parent, const KnapsackAssignment& assignment

next_item_id

Return type: int

parent

Return type: const KnapsackSearchNode* const

profit_upper_bound

Return type: int64

set_current_profit

Return type: void

Arguments: int64 profit

set_next_item_id

Return type: void

Arguments: int id

set_profit_upper_bound

Return type: void

Arguments: int64 profit