Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class KnapsackStateForCuts
Note: This documentation is automatically generated.
----- KnapsackStateForCuts -----
KnapsackStateForCuts represents a partial solution to the knapsack problem.
| Method |
GetNumberOfItems | Return type: int |
Init | Return type: void Arguments: int number_of_items Initializes vectors with number_of_items set to false (i.e. not bound yet).
|
is_bound | Return type: bool Arguments: int id |
is_in | Return type: bool Arguments: int id |
KnapsackStateForCuts | |
KnapsackStateForCuts | Arguments: const KnapsackStateForCuts&) = delete;
KnapsackStateForCuts& operator=(const KnapsackStateForCuts&) = delete;
// Initializes vectors with number_of_items set to false (i.e. not bound yet).
void Init(int number_of_items |
UpdateState | Return type: bool Arguments: bool revert, const KnapsackAssignmentForCuts& assignment Updates the state by applying or reverting a decision.
Returns false if fails, i.e. trying to apply an inconsistent decision
to an already assigned item.
|
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[[["\u003cp\u003e\u003ccode\u003eKnapsackStateForCuts\u003c/code\u003e is a C++ class representing a partial solution to the knapsack problem.\u003c/p\u003e\n"],["\u003cp\u003eIt provides methods to initialize, update, and query the state of items within the knapsack solution.\u003c/p\u003e\n"],["\u003cp\u003eThe class includes functionality to track whether items are included (\u003ccode\u003eis_in\u003c/code\u003e) or excluded (\u003ccode\u003eis_bound\u003c/code\u003e) from the current solution.\u003c/p\u003e\n"],["\u003cp\u003e\u003ccode\u003eUpdateState\u003c/code\u003e allows applying or reverting decisions, ensuring consistency by preventing conflicting assignments.\u003c/p\u003e\n"]]],["`KnapsackStateForCuts` represents a partial knapsack problem solution. Key actions include initializing the state via `Init`, setting items as not bound. `UpdateState` applies or reverts a decision, returning false if inconsistent. Methods `GetNumberOfItems`, `is_bound`, and `is_in` provide information about the current number of items and if an item is bound or part of the current state. Two constructors are provided, and the assignment operator is deleted.\n"],null,["# KnapsackStateForCuts\n\nC++ Reference: class KnapsackStateForCuts\n=========================================\n\n\nNote: This documentation is automatically generated.\n\n----- KnapsackStateForCuts ----- \nKnapsackStateForCuts represents a partial solution to the knapsack problem.\n\n| Method ||\n|---------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| [`GetNumberOfItems`](https://github.com/google/or-tools/blob/v9.4/ortools/algorithms/knapsack_solver_for_cuts.h#L201) | Return type: `int ` \u003cbr /\u003e |\n| [`Init`](https://github.com/google/or-tools/blob/v9.4/ortools/algorithms/knapsack_solver_for_cuts.h#L194) | Return type: `void ` Arguments: `int number_of_items` Initializes vectors with number_of_items set to false (i.e. not bound yet). |\n| [`is_bound`](https://github.com/google/or-tools/blob/v9.4/ortools/algorithms/knapsack_solver_for_cuts.h#L202) | Return type: `bool ` Arguments: `int id` \u003cbr /\u003e |\n| [`is_in`](https://github.com/google/or-tools/blob/v9.4/ortools/algorithms/knapsack_solver_for_cuts.h#L203) | Return type: `bool ` Arguments: `int id` \u003cbr /\u003e |\n| [`KnapsackStateForCuts`](https://github.com/google/or-tools/blob/v9.4/ortools/algorithms/knapsack_solver_for_cuts.h#L188) | \u003cbr /\u003e |\n| [`KnapsackStateForCuts`](https://github.com/google/or-tools/blob/v9.4/ortools/algorithms/knapsack_solver_for_cuts.h#L190) | \u003cbr /\u003e Arguments: `const KnapsackStateForCuts&) = delete; KnapsackStateForCuts& operator=(const KnapsackStateForCuts&) = delete; // Initializes vectors with number_of_items set to false (i.e. not bound yet). void Init(int number_of_items` \u003cbr /\u003e |\n| [`UpdateState`](https://github.com/google/or-tools/blob/v9.4/ortools/algorithms/knapsack_solver_for_cuts.h#L199) | Return type: `bool ` Arguments: `bool revert, const KnapsackAssignmentForCuts& assignment` Updates the state by applying or reverting a decision. Returns false if fails, i.e. trying to apply an inconsistent decision to an already assigned item. |"]]
