Regular (2, 2)-systems

DOI10.1007/BF01585111zbMATH Open0505.05022MaRDI QIDQ4740583FDOQ4740583

Authors: Reinhardt Euler 

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

regularityKnapsack problemindependence system2-system

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Transversal theory. An account of some aspects of combinatorial mathematics
• Faces for a linear inequality in 0–1 variables
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• A characterization of threshold matroids
• A bound for the number of matroids
• An Algorithm to Dualize a Regular Switching Function
• Coefficient reduction for inequalities in 0–1 variables
• The Concavity and Intersection Properties for Integral Polyhedra
• Title not available (Why is that?)
• Boolean Elements in Combinatorial Optimization
• On a classification of independence systems

Cited In (2)

• Polynomial-time algorithms for regular set-covering and threshold synthesis
• Recent trends in combinatorial optimization

This page was built for publication: Regular (2, 2)-systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4740583)