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.
Recommendations
Cites work
- A note on selectors and greedoids
- Geometries on partially ordered sets
- Greedoids and Linear Objective Functions
- scientific article; zbMATH DE number 3880732 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Structural properties of greedoids
- The greedy algorithm for partially ordered sets
Cited in
(3)
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)