Note on pseudolattices, lattices and submodular linear programs

DOI10.1016/j.disopt.2007.03.001zbMath1190.90092OpenAlexW2043163149MaRDI QIDQ951121

Ulrich Faigle, Britta Peis

Publication date: 29 October 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2007.03.001

zbMATH Keywords

submodularitydistributive latticepolymatroidMonge and Greedy algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The greedy algorithm for partially ordered sets
• Submodular functions and optimization
• Increasing the rooted connectivity of a digraph by one
• On the core of ordered submodular cost games
• Submodular linear programs on forests
• Perspectives of Monge properties in optimization
• Structural aspects of ordered polymatroids
• Dual greedy polyhedra, choice functions, and abstract convex geometries
• A General Class of Greedily Solvable Linear Programs
• An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games

This page was built for publication: Note on pseudolattices, lattices and submodular linear programs