Regular (2, 2)-systems
From MaRDI portal
Publication:4740583
DOI10.1007/BF01585111zbMath0505.05022MaRDI QIDQ4740583
Publication date: 1982
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
Polynomial-time algorithms for regular set-covering and threshold synthesis, Recent trends in combinatorial optimization
Cites Work
- Unnamed Item
- A characterization of threshold matroids
- Transversal theory. An account of some aspects of combinatorial mathematics
- Boolean Elements in Combinatorial Optimization
- The Concavity and Intersection Properties for Integral Polyhedra
- Coefficient reduction for inequalities in 0–1 variables
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- An Algorithm to Dualize a Regular Switching Function
- A bound for the number of matroids
- On a classification of independence systems