scientific article; zbMATH DE number 4191655

MaRDI QIDQ3211313zbMATH OpenFDO

Authors Bernhard Korte, László Lovász

Publication date 1989

zbMATH Keywords

antimatroidsfeasible sets

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Greedoids
• Characterizations of polygreedoids and poly-antimatroids by greedy algorithms
• An algorithmic characterization of antimatroids
• Introduction to Greedoids
• Matroids and antimatroids - a survey

Cited in

(18)

• Polyhedral results for the precedence-constrained knapsack problem
• Optimum partitioning into intersections of ring families
• Anti-matroids
• A correct response model in knowledge structure theory
• The intersection of matroids and antimatroids
• Antiprismlessness, or: reducing combinatorial equivalence to projective equivalence in realizability problems for polytopes
• Antimatroids and balanced pairs
• Characterizations of polygreedoids and poly-antimatroids by greedy algorithms
• An algorithmic characterization of antimatroids
• Chip-firing, antimatroids, and polyhedra
• Finding a maximum-weight convex set in a chordal graph
• A Geometric Characterization of Poly-antimatroids
• On reduced polytopes and antipodality
• Transitive packing
• scientific article; zbMATH DE number 7366716 (Why is no real title available?)
• The computational complexity of antimatroid properties
• Antinorms and self-polar polyhedra
• Optimum turn-restricted paths, nested compatibility, and optimum convex polygons

This page was built for publication:

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