A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6423620
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new separation algorithm for the Boolean quadric and cut polytopes |
scientific article; zbMATH DE number 6423620 |
Statements
A new separation algorithm for the Boolean quadric and cut polytopes (English)
0 references
9 April 2015
0 references
zero-one quadratic programming
0 references
max-cut problem
0 references
polyhedral combinatorics
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0.8548089265823364
0 references
0.820351243019104
0 references
0.805972695350647
0 references
0.8052775263786316
0 references
0.7887202501296997
0 references
