Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems |
scientific article; zbMATH DE number 6223482
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems |
scientific article; zbMATH DE number 6223482 |
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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.820458710193634
0 references
0.8012755513191223
0 references
0.7718961834907532
0 references
0.7705025672912598
0 references
0.7616909146308899
0 references
