Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class KnapsackSearchNodeForCuts
Note: 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 KnapsackAssignmentForCuts).
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.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["\u003cp\u003e\u003ccode\u003eKnapsackSearchNodeForCuts\u003c/code\u003e objects represent decisions in a knapsack problem's decision search tree, defined by a parent node and an assignment.\u003c/p\u003e\n"],["\u003cp\u003eThe current state is not directly stored within the node; instead, it's incrementally built by traversing the search tree from a previous node.\u003c/p\u003e\n"],["\u003cp\u003eEach node stores information such as its depth in the tree, current profit, an upper bound on the profit, and the next item to consider.\u003c/p\u003e\n"],["\u003cp\u003eVarious methods allow access to and manipulation of the node's properties, including assignment, profit, depth, and the next item ID.\u003c/p\u003e\n"]]],["`KnapsackSearchNodeForCuts` represents a decision within a search tree, defined by a parent node and an assignment. Key actions include accessing the `assignment`, `current_profit`, `depth`, `next_item_id`, `parent`, and `profit_upper_bound`. You can also set the `current_profit`, `next_item_id`, and `profit_upper_bound`. Nodes are constructed with a parent node and assignment. Partial solutions are incrementally built by traversing the tree. Copying and assignment operations are disabled for this class.\n"],null,[]]
