Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item (Q2384607): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q955336
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Tarik Belgacem / 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.cor.2006.02.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2154996796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and reduction algorithms for the knapsack sharing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving knapsack sharing problems with general tradeoff functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for solving continuous maximin knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax resource allocation problems: Optimization and parametric analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A min-max resource allocation problem with substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Max-Min Allocation Problem: Its Solutions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The knapsack sharing problem: an exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the knapsack sharing 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

Latest revision as of 09:43, 27 June 2024

scientific article
Language Label Description Also known as
English
Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
scientific article

    Statements

    Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item (English)
    0 references
    0 references
    0 references
    10 October 2007
    0 references
    Combinatorial optimization
    0 references
    Knapsack sharing
    0 references
    Knapsack problem
    0 references
    sensitivity analysis
    0 references

    Identifiers