An extreme point theorem for ordered polymatroids on chain orders
type: Item
instance of: scholarly article
title: An extreme point theorem for ordered polymatroids on chain orders
zbMATH Open document ID: 0889.90118
author: Ulrich Krüger
published in: Séminaire Lotharingien de Combinatoire
publication date: 1998-03-12T00:00:00Z
full work available at URL: https://eudml.org/doc/119436
full work available at URL: s36krueger.html
review text: 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.
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1127111
zbMATH Keywords: ordered polymatroids
zbMATH Keywords: extreme point characterization
zbMATH Keywords: greedy algorithm
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1127111