The node capacitated graph partitioning problem: A computational study (Q1290618)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1294672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The node capacitated graph partitioning problem: A computational study |
scientific article; zbMATH DE number 1294672 |
Statements
The node capacitated graph partitioning problem: A computational study (English)
0 references
3 June 1999
0 references
branch-and-cut algorithm
0 references
clustering
0 references
graph partitioning
0 references
layout of electronic circuits
0 references
\(k\)-partitioning
0 references
valid inequalities
0 references
separation heuristics
0 references
equipartitioning
0 references
finite element methods
0 references
0 references
0 references
0 references
0 references
0 references
0.9121152758598328
0 references
0.8441599607467651
0 references
0.8279708623886108
0 references
0.8217464089393616
0 references
