LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison |
scientific article |
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
