scientific article; zbMATH DE number 2230212
From MaRDI portal
Publication:5708498
Cites work
- A Generalization of the Perfect Graph Theorem Under the Disjunctive Index
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Geometric algorithms and combinatorial optimization
- Lift and project relaxations for the matching and related polytopes
- Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, “A Generalization of the Perfect Graph Theorem Under the Disjunctive Index”
- On a representation of the matching polytope via semidefinite liftings
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 Q5708498)