An extreme point theorem for ordered polymatroids on chain orders (Q1380702)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1127111
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An extreme point theorem for ordered polymatroids on chain orders |
scientific article; zbMATH DE number 1127111 |
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
0.883358359336853
0 references
0.8540135622024536
0 references
0.7719305753707886
0 references
