Matroids on convex geometries: subclasses, operations, and optimization

DOI10.2977/PRIMS/48zbMath1253.05057OpenAlexW2092136115MaRDI QIDQ638783

Yoshio Sano

Publication date: 14 September 2011

Published in: Publications of the Research Institute for Mathematical Sciences, Kyoto University (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2977/prims/48

zbMATH Keywords

independent setspanning setconvex geometry matroids

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Poset matching---a distributive analog of independent matching
• An intersection theorem for supermatroids
• Greedoids
• Extreme point axioms for closure spaces
• Matroids on convex geometries (cg-matroids)
• Rank functions of strict cg-matroids
• A general model for matroids and the greedy algorithm
• The theory of convex geometries
• Matroids on partially ordered sets
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Submodular functions and optimization.
• On the Abstract Properties of Linear Dependence