Structural aspects of ordered polymatroids

DOI10.1016/S0166-218X(99)00129-8zbMath1016.90079OpenAlexW2085472726MaRDI QIDQ1962039

Ulrich Krüger

Publication date: 14 November 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00129-8

zbMATH Keywords

greedy algorithmsubmodularitypartially ordered setspolymatroidbase polytopefacial structure of ordered polymatroids

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (6)

K-submodular functions and convexity of their Lovász extension ⋮ Dual greedy polyhedra, choice functions, and abstract convex geometries ⋮ Lattice polyhedra and submodular flows ⋮ A greedy algorithm for convex geometries ⋮ Note on pseudolattices, lattices and submodular linear programs ⋮ A general model for matroids and the greedy algorithm

Cites Work

• Submodular functions and optimization
• Geometric algorithms and combinatorial optimization.
• An extreme point theorem for ordered polymatroids on chain orders
• On the core of ordered submodular cost games
• Submodular linear programs on forests
• Unnamed Item
• Unnamed Item

This page was built for publication: Structural aspects of ordered polymatroids