On the Chvátal-rank of facets for the set covering polyhedron of circular matrices.
Graciela L. NasiniLuis Miguel TorresHervé KerivinAnnegret WaglerPublished in: Electron. Notes Discret. Math. (2018)
Keyphrases
- set covering
- strictly convex
- set covering problem
- singular values
- integer programming
- newton method
- column generation
- hough transform
- hypergraph model
- crew pairing
- singular value decomposition
- integer program
- low rank approximation
- positive semidefinite matrices
- combinatorial auctions
- linear programming
- positive semidefinite
- feasible set
- boundary points
- computational complexity