A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations (Q5429275)
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: A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations |
scientific article; zbMATH DE number 5216149
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations |
scientific article; zbMATH DE number 5216149 |
Statements
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations (English)
0 references
29 November 2007
0 references
