Skip to search formSkip to main contentSkip to account menu

Polymatroid

In mathematics, polymatroid is a polytope associated with a submodular function. The notion was introduced by Jack Edmonds in 1970.
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The constrained linear representability problem (CLRP) for polymatroids determines whether there exists a polymatroid that is… 
2014
2014
A matroid is a notion of independence that is closely related to computational efficiency in combinatorial optimization. In this… 
2010
2010
In this paper we prove that the Caratheodory rank of the set of bases of a (poly)matroid is upper bounded by the cardinality of… 
Review
2006
Review
2006
For a wide class of multiuser systems, a subset of capacity region which includes the corner points and the sum-capacity facet… 
2006
2006
For a wide class of multiuser systems, a subset of capacity region which includes the corner points and the sum-capacity facet… 
2006
2006
Algorithmic aspects in information and management : Second International Conference, AAIM 2006, Hong Kong, China, June 20-22… 
2006
2006
We consider market-based mechanisms for allocating transmission rates to a set of users whose rates are constrained to lie in a… 
1993
1993
Two natural classes of polymatroids can be associated with hypergraphs: the so-called Boolean and hypergraphic polymatroids…