Supermodular programming on finite lattices
From MaRDI portal
Recommendations
- Supermodular programming on lattices
- scientific article; zbMATH DE number 4204115
- Lattice of cubes
- Basic properties of lattices of cubes, algorithms for their construction, and application capabilities in discrete optimization.
- A note on supermodular sublattices in finite relatively complemented lattices
Cited in
(17)- Supermodular programming on lattices
- The cone of supermodular games on finite distributive lattices
- A generalization of semimodular supersolvable lattice
- On the dynamics of Pérez Laraudogoitia's supertask
- Robust budget allocation via continuous submodular functions
- Generalized target-allocation functions and their evaluation by the branch-and-bound method
- Basic properties of lattices of cubes, algorithms for their construction, and application capabilities in discrete optimization.
- Finite supermodular design with interdependent valuations
- Supermodular functions on finite lattices
- scientific article; zbMATH DE number 6112829 (Why is no real title available?)
- scientific article; zbMATH DE number 4204115 (Why is no real title available?)
- scientific article; zbMATH DE number 4033805 (Why is no real title available?)
- Minimizing modular and supermodular functions on \(L\)-matroids
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Inverse problem for a distributed system from pulse technology
- Lattice of cubes
- A note on supermodular sublattices in finite relatively complemented lattices
This page was built for publication: Supermodular programming on finite lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836599)
