Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6223482 / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial optimization problem
Property / zbMATH Keywords: combinatorial optimization problem / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-hard problem
Property / zbMATH Keywords: NP-hard problem / rank
 
Normal rank
Property / zbMATH Keywords
 
meta-heuristic algorithm
Property / zbMATH Keywords: meta-heuristic algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
binary particle swarm optimization
Property / zbMATH Keywords: binary particle swarm optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
binary accelerated particle swarm algorithm
Property / zbMATH Keywords: binary accelerated particle swarm algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
multidimensional knapsack problem
Property / zbMATH Keywords: multidimensional knapsack problem / rank
 
Normal rank

Revision as of 10:59, 29 June 2023

scientific article
Language Label Description Also known as
English
Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
scientific article

    Statements

    Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (English)
    0 references
    7 November 2013
    0 references
    combinatorial optimization problem
    0 references
    NP-hard problem
    0 references
    meta-heuristic algorithm
    0 references
    binary particle swarm optimization
    0 references
    binary accelerated particle swarm algorithm
    0 references
    multidimensional knapsack problem
    0 references

    Identifiers