Note on pseudolattices, lattices and submodular linear programs
From MaRDI portal
Recommendations
- A NOTE ON SUBMODULAR FUNCTIONS ON DISTRIBUTIVE LATTICES
- Lattice polyhedra and submodular flows
- Polynomial-time algorithms for submodular Laplacian systems
- The principal lattice of partitions of a submodular function
- Representation of the lattice of optimal solutions in the problem of submodular function minimization
- Submodular Maximization Through the Lens of Linear Programming
- A note on supermodular sublattices in finite relatively complemented lattices
- A note on the implications of approximate submodularity in discrete optimization
- A note on submodular set cover on matroids
- A generalization of semimodular supersolvable lattice
Cites work
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3634269 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- scientific article; zbMATH DE number 3272833 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- 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
- Dual greedy polyhedra, choice functions, and abstract convex geometries
- Increasing the rooted connectivity of a digraph by one
- On the core of ordered submodular cost games
- Perspectives of Monge properties in optimization
- Structural aspects of ordered polymatroids
- Submodular functions and optimization
- Submodular linear programs on forests
- The greedy algorithm for partially ordered sets
This page was built for publication: Note on pseudolattices, lattices and submodular linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q951121)
