A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem (Q3503843): Difference between revisions
From MaRDI portal
Latest revision as of 10:33, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem |
scientific article |
Statements
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem (English)
0 references
10 June 2008
0 references
Branch and cut algorithms
0 references
cutting plane algorithms
0 references
polyhedral combinatorics
0 references
semidefinite programs
0 references
0 references
0 references
0 references