In mathematics, a polymatroid is a polytope associated with a submodular function. The notion was introduced by Jack Edmonds in 1970. It is also described...

describes finite graphs from the point of view of matchings. He introduced polymatroids, submodular flows with Richard Giles, and the terms clutter and blocker...

can be explained by taking the line search greedoid instead. Matroid Polymatroid Note that the accessibility property is strictly weaker than the hereditary...

submodular flow polyhedra, and the intersection of two generalized polymatroids/g-polymatroids – e.g. see Schrijver 2003. Permissive licenses: Copyleft (reciprocal)...

optimization Oriented matroid – Abstraction of ordered linear algebra Polymatroid – Multiset analogue of matroids Pregeometry (model theory) – Formulation...

diversity, information and coverage. Supermodular function Matroid, Polymatroid Utility functions on indivisible goods H. Lin and J. Bilmes, A Class...

{\displaystyle M} , the independence matroid polytope is equal to the polymatroid determined by ψ {\displaystyle \psi } . The flag matroid polytope is...

generalization of graph matching and matroid intersection. It is also known as polymatroid matching, or the matchoid problem. Matroid parity can be solved in polynomial...