A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem (Q2003457): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q124306155, #quickstatements; #temporary_batch_1711504539957
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Ambulance location and relocation models. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Particle Swarm Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the knapsack sharing problem with common items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved convergent heuristics for the 0-1 multidimensional knapsack problem / 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: Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: AI 2005: Advances in Artificial Intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-one programming with many variables and few constraints / rank
 
Normal rank

Latest revision as of 19:24, 19 July 2024

scientific article
Language Label Description Also known as
English
A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem
scientific article

    Statements

    A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 July 2019
    0 references
    discrete optimization
    0 references
    hybrid heuristic
    0 references
    knapsack
    0 references
    max-min optimization
    0 references
    population-based heuristic
    0 references

    Identifiers