C++ Reference: class KnapsackSearchNodeForCuts

This documentation is automatically generated.


   ----- KnapsackSearchNodeForCuts -----
KnapsackSearchNodeForCuts 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 KnapsackAssignementForCuts). 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 KnapsackAssignmentForCuts&

current_profit

Return type: double

depth

Return type: int

KnapsackSearchNodeForCuts

Arguments: const KnapsackSearchNodeForCuts* parent, const KnapsackAssignmentForCuts& assignment

KnapsackSearchNodeForCuts

Arguments: const KnapsackSearchNodeForCuts&) = delete; KnapsackSearchNodeForCuts& operator=(const KnapsackSearchNodeForCuts&) = delete; int depth(

next_item_id

Return type: int

parent

Return type: const KnapsackSearchNodeForCuts* const

profit_upper_bound

Return type: double

set_current_profit

Return type: void

Arguments: double profit

set_next_item_id

Return type: void

Arguments: int id

set_profit_upper_bound

Return type: void

Arguments: double profit