Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MINTO / rank | |||
Normal rank | |||
Revision as of 00:06, 1 March 2024
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
