Structural aspects of ordered polymatroids
From MaRDI portal
Publication:1962039
DOI10.1016/S0166-218X(99)00129-8zbMath1016.90079MaRDI QIDQ1962039
Publication date: 14 November 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
greedy algorithm; submodularity; partially ordered sets; polymatroid; base polytope; facial structure of ordered polymatroids
52B40: Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.)
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C27: Combinatorial optimization
05B35: Combinatorial aspects of matroids and geometric lattices
Related Items
Note on pseudolattices, lattices and submodular linear programs, A general model for matroids and the greedy algorithm, A greedy algorithm for convex geometries, K-submodular functions and convexity of their Lovász extension, Lattice polyhedra and submodular flows, Dual greedy polyhedra, choice functions, and abstract convex geometries
Cites Work