Pages that link to "Item:Q1850505"
From MaRDI portal
The following pages link to A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505):
Displaying 11 items.
- Efficient, optimal stochastic-action selection when limited by an action budget (Q5962147) (← links)
- Discrete convexity and polynomial solvability in minimum 0-extension problems (Q5962712) (← links)
- Efficient joint object matching via linear programming (Q6052052) (← links)
- The <i>b</i>‐bibranching problem: TDI system, packing, and discrete convexity (Q6065852) (← links)
- Distributed strategy selection: a submodular set function maximization approach (Q6110260) (← links)
- Constraint generation approaches for submodular function maximization leveraging graph properties (Q6154401) (← links)
- On optimization problems in acyclic hypergraphs (Q6161450) (← links)
- Minimization problems with non-submodular cover constraint (Q6542984) (← links)
- Generalized class cover problem with axis-parallel strips (Q6543343) (← links)
- Regularized nonmonotone submodular maximization (Q6548318) (← links)
- Minimizing convex functions with rational minimizers (Q6567265) (← links)