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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1529261801 / rank | |||
Normal rank | |||
Revision as of 00:52, 20 March 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
