Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem (Q955337): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2008.05.001 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2008.05.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050251301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / 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: An upper bound for the zero-one knapsack problem and a branch and bound algorithm / 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: An algorithm for the solution of the 0-1 knapsack problem / 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: New trends in exact algorithms for the \(0-1\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Core Problems in Knapsack Algorithms / 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: Q3901292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis of a greedy heuristic for knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis for knapsack problems: A negative result / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis for knapsack problems: Another negative result / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4377042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-Variable Extremum Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2008.05.001 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:47, 10 December 2024

scientific article
Language Label Description Also known as
English
Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
scientific article

    Statements

    Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem (English)
    0 references
    0 references
    0 references
    19 November 2008
    0 references
    combinatorial optimization
    0 references
    knapsack
    0 references
    optimality
    0 references
    sensitivity analysis
    0 references

    Identifiers