Greedoid polyhedra (Q1097283): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5684698 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4149476 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The greedy algorithm for partially ordered sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Geometries on partially ordered sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Structural properties of greedoids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on selectors and greedoids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3346344 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Greedoids and Linear Objective Functions / rank | |||
Normal rank |
Latest revision as of 14:30, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Greedoid polyhedra |
scientific article |
Statements
Greedoid polyhedra (English)
0 references
1985
0 references
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.
0 references
Greedoids
0 references
APS-greedoids
0 references
greedoid polyhedra
0 references