Stochastic graph partitioning: quadratic versus SOCP formulations (Q331990)
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: Stochastic graph partitioning: quadratic versus SOCP formulations |
scientific article; zbMATH DE number 6644663
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stochastic graph partitioning: quadratic versus SOCP formulations |
scientific article; zbMATH DE number 6644663 |
Statements
Stochastic graph partitioning: quadratic versus SOCP formulations (English)
0 references
27 October 2016
0 references
graph partitioning
0 references
chance constrained programming
0 references
second-order cone programming
0 references
quadratic 0/1 programming
0 references
branch-and-bound
0 references
0 references
0.792801558971405
0 references
0.7876800894737244
0 references
0.7863526940345764
0 references
0.7397267818450928
0 references
0.7384231090545654
0 references
