LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866)
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: LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison |
scientific article; zbMATH DE number 6194481
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison |
scientific article; zbMATH DE number 6194481 |
Statements
LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (English)
0 references
5 August 2013
0 references
branch and cut algorithms
0 references
cutting plane algorithms
0 references
polyhedral combinatorics
0 references
semidefinite programs
0 references
graph bisection
0 references
0 references
0 references
0 references
0.9597965478897096
0 references
0.865248441696167
0 references
0.8316755294799805
0 references
0.8045058846473694
0 references
