On Hilbert bases of cuts
From MaRDI portal
Publication:898132
DOI10.1016/j.disc.2015.09.021zbMath1327.05271arXiv1409.5451MaRDI QIDQ898132
Tanmay Deshpande, Tony Huynh, Luis A. Goddyn
Publication date: 8 December 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.5451
90C27: Combinatorial optimization
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
A Note on Seminormality of Cut Polytopes, The lattice of cycles of an undirected graph, The $h^{*}$-polynomial of the cut polytope of $K_{2,m}$ in the lattice spanned by its vertices
Uses Software
Cites Work
- Total dual integrality and integer polyhedra
- Normaliz: Algorithms for affine monoids and rational cones
- Normality of cut polytopes of graphs is a minor closed property
- Matching structure and the matching lattice
- Matroids and multicommodity flows
- Facets for the cut cone. I
- Matroids with the circuit cover property
- Hilbert bases of cuts
- Excluding a small minor
- A Macaulay2 interface for Normaliz
- Alternatives for testing total dual integrality
- Generating facets for the cut polytope of a graph by triangular elimination
- Graphs with the Circuit Cover Property
- Maximum matching and a polyhedron with 0,1-vertices
- Unnamed Item
- Unnamed Item
- Unnamed Item
