Improved linearized models for graph partitioning problem under capacity constraints (Q4594838)
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 linearized models for graph partitioning problem under capacity constraints |
scientific article; zbMATH DE number 6812865
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved linearized models for graph partitioning problem under capacity constraints |
scientific article; zbMATH DE number 6812865 |
Statements
Improved linearized models for graph partitioning problem under capacity constraints (English)
0 references
24 November 2017
0 references
graph partitioning
0 references
capacity constraint
0 references
\(0/1\) quadratically constrained programming
0 references
linearization techniques
0 references
branch-and-bound
0 references
0.9204181
0 references
0.8988836
0 references
0.89627695
0 references
0.89280564
0 references
0.8896085
0 references
0.87948585
0 references
0.8784744
0 references
0.8783135
0 references
0.8757785
0 references
0 references
