Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CPLEX / rank | |||
Normal rank | |||
Revision as of 22:20, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Engineering Branch-and-Cut Algorithms for the Equicut Problem |
scientific article |
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
