Submodular function minimization and maximization in discrete convex analysis
From MaRDI portal
Recommendations
Cited in
(22)- A submodular approach to discrete dynamic programming
- Structures of subpartitions related to a submodular function minimization
- The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions
- Disjunctive analogues of submodular and supermodular pseudo-Boolean functions
- Matroid rank functions and discrete concavity
- Discrete Newton's algorithm for parametric submodular function minimization
- Inequalities on submodular functions via term rewriting
- Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function
- A note on the implications of approximate submodularity in discrete optimization
- A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract)
- Recent developments in discrete convex analysis
- Submodularity on a tree: unifying L^-convex and bisubmodular functions
- M-convex function minimization by continuous relaxation approach: proximity theorem and algorithm
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS
- Odd Submodular Functions, Dilworth Functions and Discrete Convex Functions
- Valuated matroid-based algorithm for submodular welfare problem
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Near-optimal Approximate Discrete and Continuous Submodular Function Minimization
- Multiple Exchange Property for M♮-Concave Functions and Valuated Matroids
- A min-max theorem for transversal submodular functions and its implications
- On equivalence of M^-concavity of a set function and submodularity of its conjugate
- Submodular function minimization
This page was built for publication: Submodular function minimization and maximization in discrete convex analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999658)
