A decomposition framework based on memorized binary search for large-scale optimization problems (Q6576948)
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: A decomposition framework based on memorized binary search for large-scale optimization problems |
scientific article; zbMATH DE number 7885242
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A decomposition framework based on memorized binary search for large-scale optimization problems |
scientific article; zbMATH DE number 7885242 |
Statements
A decomposition framework based on memorized binary search for large-scale optimization problems (English)
0 references
23 July 2024
0 references
divide-and-conquer
0 references
differential grouping
0 references
cooperative co-evolution
0 references
large-scale optimization problem
0 references
0.7979320883750916
0 references
0.7626502513885498
0 references
0.6911156177520752
0 references
