Pages that link to "Item:Q3322709"
From MaRDI portal
The following pages link to Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions (Q3322709):
Displaying 20 items.
- On the complexity of submodular function minimisation on diamonds (Q665998) (← links)
- A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors (Q761525) (← links)
- Are dualities appropriate for duality theories in optimization? (Q989899) (← links)
- Submodular function minimization (Q995782) (← links)
- A note on submodular set cover on matroids (Q1045066) (← links)
- Directed submodularity, ditroids and directed submodular flows (Q1116891) (← links)
- Fenchel-type duality for matroid valuations (Q1290625) (← links)
- Discrete convex analysis (Q1290668) (← links)
- \(M\)-convex functions and tree metrics (Q1764353) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Discrete Fenchel duality for a pair of integrally convex and separable convex functions (Q2135548) (← links)
- Critical duality (Q2481108) (← links)
- The Lovász extension of market games (Q2487783) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
- On the subdifferential of a submodular function (Q3332786) (← links)
- Extensions of functions of 0-1 variables and applications to combinatorial optimization (Q3337950) (← links)
- Dualities between complete lattices (Q3352851) (← links)
- Convexity and Steinitz's exchange property (Q4645928) (← links)
- Improved Randomized Algorithm for <i>k</i>-Submodular Function Maximization (Q5855531) (← links)
- Recent progress on integrally convex functions (Q6072365) (← links)
