Solving large scale combinatorial optimization problems based on a divide and conquer strategy (Q1271691)
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: Solving large scale combinatorial optimization problems based on a divide and conquer strategy |
scientific article; zbMATH DE number 1221194
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving large scale combinatorial optimization problems based on a divide and conquer strategy |
scientific article; zbMATH DE number 1221194 |
Statements
Solving large scale combinatorial optimization problems based on a divide and conquer strategy (English)
0 references
5 May 1999
0 references
Hopfield neural network
0 references
divide and conquer
0 references
large scale optimization
0 references
Grossberg regularity detector
0 references
sequence-dependent set-up time minimization
0 references
