Engineering branch-and-cut algorithms for the equicut problem (Q2848989)
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 6208187
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Engineering branch-and-cut algorithms for the equicut problem |
scientific article; zbMATH DE number 6208187 |
Statements
Engineering Branch-and-Cut Algorithms for the Equicut Problem (English)
0 references
13 September 2013
0 references
equicut
0 references
maximum-cut
0 references
bisection
0 references
graph partitioning
0 references
linear programming
0 references
semidefinite programming
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0.905354142189026
0 references
0.834952712059021
0 references
0.8152971863746643
0 references
0.814793586730957
0 references
