Pages that link to "Item:Q4706234"

The following pages link to A Faster Scaling Algorithm for Minimizing Submodular Functions (Q4706234):

Displaying 19 items.

• Minimizing a sum of submodular functions (Q713320) (← links)
• Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
• The expressive power of valued constraints: Hierarchies and collapses (Q959827) (← links)
• The expressive power of binary submodular functions (Q967393) (← links)
• Submodular function minimization (Q995782) (← links)
• A faster strongly polynomial time algorithm for submodular function minimization (Q1016120) (← links)
• Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
• A capacity scaling algorithm for M-convex submodular flow (Q1777220) (← links)
• Buyer selection and service pricing in an electric fleet supply chain (Q2239895) (← links)
• The median partition and submodularity (Q2245064) (← 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)
• A strongly polynomial algorithm for line search in submodular polyhedra (Q2427694) (← links)
• Theory of Principal Partitions Revisited (Q2971607) (← links)
• Submodular Function Minimization under a Submodular Set Covering Constraint (Q3010395) (← links)
• The Expressive Power of Valued Constraints: Hierarchies and Collapses (Q3523088) (← links)
• Geometric Rescaling Algorithms for Submodular Function Minimization (Q4958557) (← links)
• A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)
• Minimizing convex functions with rational minimizers (Q6567265) (← links)