Level-based heuristics and hill climbing for the antibandwidth maximization problem (Q4982954): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SparseMatrix / rank | |||
Normal rank | |||
Revision as of 17:23, 28 February 2024
scientific article; zbMATH DE number 6424542
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Level-based heuristics and hill climbing for the antibandwidth maximization problem |
scientific article; zbMATH DE number 6424542 |
Statements
Level-based heuristics and hill climbing for the antibandwidth maximization problem (English)
0 references
13 April 2015
0 references
antibandwidth maximization
0 references
sparse matrices
0 references
level sets
0 references
hill climbing
0 references
heuristic algorithms
0 references
