Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (Q995928): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710461151948
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-005-4105-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021247021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for large-scale unconstrained two and three staged cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: New trends in exact algorithms for the \(0-1\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for large multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Core Problems in Knapsack Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LP-based approach to a two-stage cutting stock problem / rank
 
Normal rank

Latest revision as of 14:14, 26 June 2024

scientific article
Language Label Description Also known as
English
Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
scientific article

    Statements

    Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    10 September 2007
    0 references
    combinatorial optimization
    0 references
    knapsacks
    0 references
    optimality
    0 references
    sensitivity analysis
    0 references
    0 references
    0 references

    Identifiers