C++ Reference: class KnapsackSearchNode
Note: 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 KnapsackAssignment). 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: |
current_profit | Return type: |
depth | Return type: |
KnapsackSearchNode | Arguments: |
next_item_id | Return type: |
parent | Return type: |
profit_upper_bound | Return type: |
set_current_profit | Return type: Arguments: |
set_next_item_id | Return type: Arguments: |
set_profit_upper_bound | Return type: Arguments: |