Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240)
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: Improved compact formulations for a wide class of graph partitioning problems in sparse graphs |
scientific article; zbMATH DE number 6872144
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved compact formulations for a wide class of graph partitioning problems in sparse graphs |
scientific article; zbMATH DE number 6872144 |
Statements
Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (English)
0 references
24 May 2018
0 references
graph partitioning
0 references
triangle inequality
0 references
SONET/SDH network design
0 references
0 references
0 references
0.92658323
0 references
0.9070432
0 references
0.9070228
0 references
0.9010734
0 references
0.89688504
0 references
0.89292383
0 references
0 references
0.89137757
0 references
