An extreme point theorem for ordered polymatroids on chain orders (Q1380702): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 04:09, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An extreme point theorem for ordered polymatroids on chain orders |
scientific article |
Statements
An extreme point theorem for ordered polymatroids on chain orders (English)
0 references
12 March 1998
0 references
We consider ordered polymatroids as a generalization of polymatroids and extend the extreme point characterization of polymatroids by the greedy algorithm to the ordered case. It is proved that a feasible point of an ordered polymatroid is a vertex iff it is a greedy-vector with respect to an appropriate primal greedy-procedure.
0 references
ordered polymatroids
0 references
extreme point characterization
0 references
greedy algorithm
0 references
