AbstractA. Frank introduced a concept of generalized polymatroid. We show that a generalized polymatroid is a projection of a base polyhedron associated with a submodular system and discuss implication of this observation such as characterizations of faces, the intersection theorem and the greedy algorithm for generalized polymatroids
This thesis is a study of the faces of certain combinatorially defined polyhedra. In particular, we...
This paper studies axiom systems of supermatroids. Barnabei et al.'s base axioms concerning poset ma...
During the last few years submodularity has intensively been investigated in combinatorial optimizat...
Published in the proceedings of the 6. Hungarian combinatorial colloquium, Eger, 1981SIGLEDEGerman
This paper extends results on the cardinality constrained matroid polytope presented in [Maurras, J....
AbstractWe generalize the matroid intersection theorem to distributive supermatroids, a structure th...
AbstractIn this paper we suggest a generalization of the well known concept of matroid. This include...
Abstract Generalized polymatroids are a family of polyhedra with several nice properties and applica...
We present a general model for set systems to be independence families with respect to set families ...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
AbstractThis paper discusses polymatroid greedoids, a superclass of them, called local poset greedoi...
This paper deals with polymatroids, generalized and bisubmodular polytopes that are expressed by a s...
AbstractAntimatroids are combinatorial structures abstracting some properties of convexity, and in a...
AbstractWe consider matroidal structures on convex geometries, which we call cg-matroids. The concep...
AbstractIt has widely been recognized that submodular set functions and base polyhedra associated wi...
This thesis is a study of the faces of certain combinatorially defined polyhedra. In particular, we...
This paper studies axiom systems of supermatroids. Barnabei et al.'s base axioms concerning poset ma...
During the last few years submodularity has intensively been investigated in combinatorial optimizat...
Published in the proceedings of the 6. Hungarian combinatorial colloquium, Eger, 1981SIGLEDEGerman
This paper extends results on the cardinality constrained matroid polytope presented in [Maurras, J....
AbstractWe generalize the matroid intersection theorem to distributive supermatroids, a structure th...
AbstractIn this paper we suggest a generalization of the well known concept of matroid. This include...
Abstract Generalized polymatroids are a family of polyhedra with several nice properties and applica...
We present a general model for set systems to be independence families with respect to set families ...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
AbstractThis paper discusses polymatroid greedoids, a superclass of them, called local poset greedoi...
This paper deals with polymatroids, generalized and bisubmodular polytopes that are expressed by a s...
AbstractAntimatroids are combinatorial structures abstracting some properties of convexity, and in a...
AbstractWe consider matroidal structures on convex geometries, which we call cg-matroids. The concep...
AbstractIt has widely been recognized that submodular set functions and base polyhedra associated wi...
This thesis is a study of the faces of certain combinatorially defined polyhedra. In particular, we...
This paper studies axiom systems of supermatroids. Barnabei et al.'s base axioms concerning poset ma...
During the last few years submodularity has intensively been investigated in combinatorial optimizat...
DOI
Add to ORKG