scientific article; zbMATH DE number 6004030
From MaRDI portal
Publication:3113173
Cited in
(7)- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Facets for the cut cone. II: Clique-web inequalities
- Node and edge relaxations of the max-cut problem
- Collapsing and lifting for the cut cone
- Application of cut polyhedra. I
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
- On skeletons, diameters and volumes of metric polyhedra
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113173)