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 18 items.
- 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)
- A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization (Q5429271) (← links)
- New Query Lower Bounds for Submodular Function Minimization (Q5875771) (← links)
- Posimodular function optimization (Q5918641) (← links)
- Optimal hierarchical clustering on a graph (Q6065857) (← links)
- Lexicographically optimal earliest arrival flows (Q6068531) (← links)
- Tractability of explaining classifier decisions (Q6098842) (← links)
- Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints (Q6110458) (← links)
- Supermodularity and valid inequalities for quadratic optimization with indicators (Q6165587) (← links)
- Minimizing convex functions with rational minimizers (Q6567265) (← links)
- An approximation algorithm for the \(\boldsymbol{K}\)-prize-collecting multicut problem in trees with submodular penalties (Q6620014) (← links)
