Pages that link to "Item:Q1016120"
From MaRDI portal
The following pages link to A faster strongly polynomial time algorithm for submodular function minimization (Q1016120):
Displaying 50 items.
- Realizing symmetric set functions as hypergraph cut capacity (Q284712) (← links)
- The submodular joint replenishment problem (Q304238) (← links)
- A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
- Efficient minimization of higher order submodular functions using monotonic Boolean functions (Q507571) (← links)
- Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
- Faster algorithms for security games on matroids (Q666676) (← links)
- Minimizing a sum of submodular functions (Q713320) (← links)
- The expressive power of valued constraints: Hierarchies and collapses (Q959827) (← links)
- The expressive power of binary submodular functions (Q967393) (← links)
- Soft arc consistency revisited (Q969527) (← links)
- New algorithms for convex cost tension problem with application to computer vision (Q1040084) (← links)
- Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
- Stochastic block-coordinate gradient projection algorithms for submodular maximization (Q1723100) (← links)
- Complexity and approximations for submodular minimization problems on two variables per inequality constraints (Q1801066) (← 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)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- Envy-free matchings with one-sided preferences and matroid constraints (Q2060385) (← links)
- An exact cutting plane method for \(k\)-submodular function maximization (Q2067498) (← links)
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
- Submodular function minimization and polarity (Q2097629) (← links)
- A game theoretic approach to a problem in polymatroid maximization (Q2098075) (← links)
- Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
- A variation of DS decomposition in set function optimization (Q2185813) (← links)
- The median partition and submodularity (Q2245064) (← links)
- A computational study for common network design in multi-commodity supply chains (Q2257365) (← links)
- Symmetric submodular system: contractions and Gomory-Hu tree (Q2304523) (← links)
- Set function optimization (Q2314057) (← links)
- Discrete Newton methods for the evacuation problem (Q2330131) (← links)
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Submodular functions: from discrete to continuous domains (Q2414912) (← links)
- Submodular reassignment problem for reallocating agents to tasks with synergy effects (Q2673247) (← links)
- Submodular Function Minimization under a Submodular Set Covering Constraint (Q3010395) (← links)
- The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
- Structured Sparsity: Discrete and Convex Approaches (Q3460840) (← links)
- Quantum machine learning: a classical perspective (Q4556858) (← links)
- Geometric Rescaling Algorithms for Submodular Function Minimization (Q4958557) (← links)
- Intersection Disjunctions for Reverse Convex Sets (Q5076701) (← links)
- Efficient Solution Methods for a General <i>r</i>-Interdiction Median Problem with Fortification (Q5086024) (← links)
- Hypergraph Cuts with General Splitting Functions (Q5094916) (← links)
- Finding a Stable Allocation in Polymatroid Intersection (Q5108257) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
- Some Results about the Contractions and the Pendant Pairs of a Submodular System (Q5241673) (← links)
- A Note on Appointment Scheduling with Piecewise Linear Cost Functions (Q5247619) (← links)
- A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)
- Optimal hierarchical clustering on a graph (Q6065857) (← links)
- Lexicographically optimal earliest arrival flows (Q6068531) (← links)
