Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem (Q2282074): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / 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: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and analysis of approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent Analysis and Algorithmic Improvement of Differential Evolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for randomized time-varying knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel hybrid multi-objective immune algorithm with adaptive differential evolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic knapsack problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid algorithm for the unbounded knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best first search exact algorithm for the multiple-choice multidimensional knapsack problem / rank
 
Normal rank

Latest revision as of 08:47, 21 July 2024

scientific article
Language Label Description Also known as
English
Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem
scientific article

    Statements

    Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 January 2020
    0 references
    discounted \(\{0\text{-}1\}\) knapsack problem
    0 references
    exact algorithm
    0 references
    approximate algorithm
    0 references
    dynamic programming
    0 references
    particle swarm optimization
    0 references

    Identifiers