The following pages link to Submodular function minimization (Q995782):
Displaying 46 items.
- Submodular spectral functions of principal submatrices of a Hermitian matrix, extensions and applications (Q389651) (← links)
- Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
- On the complexity of submodular function minimisation on diamonds (Q665998) (← links)
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
- Polymatroids and mean-risk minimization in discrete optimization (Q957370) (← links)
- The expressive power of valued constraints: Hierarchies and collapses (Q959827) (← links)
- The expressive power of binary submodular functions (Q967393) (← links)
- A faster strongly polynomial time algorithm for submodular function minimization (Q1016120) (← links)
- Applications of relaxed submodularity (Q1126827) (← links)
- A submodular approach to discrete dynamic programming (Q1129966) (← links)
- Structures of subpartitions related to a submodular function minimization (Q1365312) (← links)
- A note on Schrijver's submodular function minimization algorithm. (Q1400972) (← links)
- Submodular function minimization with submodular set covering constraints and precedence constraints (Q1644928) (← links)
- Submodular goal value of Boolean functions (Q1701106) (← links)
- Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Computational geometric approach to submodular function minimization for multiclass queueing systems (Q1926646) (← links)
- Equivalence of convex minimization problems over base polytopes (Q1926652) (← links)
- Nonnegative definite Hermitian matrices with increasing principal minors (Q2017183) (← links)
- Submodular function minimization and polarity (Q2097629) (← links)
- Cuts in undirected graphs. I (Q2215599) (← links)
- Cuts in undirected graphs. II (Q2215853) (← links)
- The median partition and submodularity (Q2245064) (← links)
- Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity (Q2300641) (← links)
- Discrete Newton's algorithm for parametric submodular function minimization (Q2401158) (← links)
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q2428700) (← links)
- SFO: a toolbox for submodular function optimization (Q2896071) (← links)
- Theory of Principal Partitions Revisited (Q2971607) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
- Submodular function minimization and related topics (Q3046539) (← links)
- (Q3142412) (← links)
- The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
- The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity (Q3462365) (← links)
- (Q3523377) (← links)
- Submodular functions and convexity (Q3682236) (← links)
- (Q4633864) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- Near-optimal Approximate Discrete and Continuous Submodular Function Minimization (Q5146821) (← links)
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints (Q5207510) (← links)
- Polynomially Computable Bounds for the Probability of the Union of Events (Q5247622) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- Learning submodular functions (Q5419150) (← links)
- New Query Lower Bounds for Submodular Function Minimization (Q5875771) (← links)
- Submodular Maximization With Limited Function Access (Q6047047) (← links)
- Minimizing convex functions with rational minimizers (Q6567265) (← links)
- Core potentials: the consensus segmentation conjecture (Q6653667) (← links)
