Mincut ideals of two-terminal networks
DOI10.1007/s00200-010-0132-2zbMath1203.13032WikidataQ60246199 ScholiaQ60246199MaRDI QIDQ613609
Eduardo Sáenz-de-Cabezón, Henry P. Wynn
Publication date: 21 December 2010
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-010-0132-2
90B25: Reliability, availability, maintenance, inspection in operations research
90B10: Deterministic network models in operations research
13F55: Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes
13P25: Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.)
05E40: Combinatorial aspects of commutative algebra
Related Items
Cites Work
- Unnamed Item
- Computational algebraic algorithms for the reliability of generalized \(k\)-out-of-\(n\) and related systems
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
- Cohen-Macaulay clutters with combinatorial optimization properties and parallelizations of normal edge ideals
- Multigraded Betti numbers without computing minimal free resolutions
- Properties of cut ideals associated to ring graphs
- Computing the support of monomial iterated mapping cones
- Betti numbers and minimal free resolutions for multi-state system reliability bounds
- Combinatorial aspects of network reliability
- Abstract tubes, improved inclusion-exclusion identities and inequalities and importance sampling
- Improved Bonferroni inequalities via abstract tubes. Inequalities and identities of inclusion-exclusion type
- Cohen-Macaulay properties of square-free monomial ideals
- Monomial ideals and the Scarf complex for coherent systems in reliability theory.
- Combinatorics and commutative algebra.
- A Minimizing Algorithm for Sum of Disjoint Products
