Greedoid polyhedra

From MaRDI portal





Greedoids can be viewed as relaxations of matroids. As a subclass, APS- greedoids cover many combinatorial problems. This paper deals with APS- greedoid polyhedra. These polyhedra are similar in properties to matroid polyhedra. That is, the vertices of an APS-greedoid polyhedron are precisely the incidence vectors of the members of an APS-greedoid.











This page was built for publication: Greedoid polyhedra

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