[[["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."],[[["The `BasicKnapsackSolver` utilizes dynamic programming to address the single knapsack problem, simplifying variables within a single linear constraint during presolving."],["The solver boasts a complexity that is determined by the most efficient option between O(num_variables \\* num_relevant_values \\^ 2) and O(num_variables \\* num_relevant_values \\* max_domain_size)."],["A `Solve` method is provided, accepting domains, coefficients, costs, and a right-hand side to compute a solution."]]],["The `BasicKnapsackSolver` class utilizes dynamic programming to solve a single knapsack problem. It simplifies variables in single linear constraints, with a time complexity of either O(num_variables * num_relevant_values ^ 2) or O(num_variables * num_relevant_values * max_domain_size). The primary action is performed by the `Solve` method, which accepts vectors of domains, coefficients, costs, and a right-hand side domain (`rhs`) as input and returns a `Result`.\n"]]
