Formulations and valid inequalities of the node capacitated graph partitioning problem (Q1814793)
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: Formulations and valid inequalities of the node capacitated graph partitioning problem |
scientific article; zbMATH DE number 940771
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Formulations and valid inequalities of the node capacitated graph partitioning problem |
scientific article; zbMATH DE number 940771 |
Statements
Formulations and valid inequalities of the node capacitated graph partitioning problem (English)
0 references
31 October 1996
0 references
clustering
0 references
equipartition
0 references
knapsack
0 references
ear decomposition
0 references
partitioning the nodes of a graph
0 references
design of electronic circuits and devices
0 references
feasible multicuts
0 references
