The following pages link to (Q5292089):
Displaying 37 items.
- A bilevel programming problem with maximization of a supermodular function in the lower level (Q385481) (← links)
- A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
- On the complexity of submodular function minimisation on diamonds (Q665998) (← links)
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← 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)
- 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)
- Matroid optimisation problems with nested non-linear monomials in the objective function (Q1646569) (← links)
- Submodular goal value of Boolean functions (Q1701106) (← links)
- The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206) (← links)
- Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
- Lattice polyhedra and submodular flows (Q1926644) (← links)
- Computational geometric approach to submodular function minimization for multiclass queueing systems (Q1926646) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- Discrete Newton's algorithm for parametric submodular function minimization (Q2401158) (← links)
- Covering intersecting bi-set families under matroid constraints (Q2820858) (← links)
- SFO: a toolbox for submodular function optimization (Q2896071) (← links)
- Theory of Principal Partitions Revisited (Q2971607) (← links)
- A Primal-Dual Algorithm for Weighted Abstract Cut Packing (Q3009773) (← links)
- (Q3142412) (← links)
- (Q3523377) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- (Q4633864) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- A Discrete Convex Min-Max Formula for Box-TDI Polyhedra (Q5085130) (← links)
- Efficient Solution Methods for a General <i>r</i>-Interdiction Median Problem with Fortification (Q5086024) (← links)
- Near-optimal Approximate Discrete and Continuous Submodular Function Minimization (Q5146821) (← links)
- Some Results about the Contractions and the Pendant Pairs of a Submodular System (Q5241673) (← links)
- A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)
- Learning submodular functions (Q5419150) (← links)
- New Query Lower Bounds for Submodular Function Minimization (Q5875771) (← links)
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation (Q5962716) (← links)
- Submodular Maximization With Limited Function Access (Q6047047) (← links)
- Minimizing convex functions with rational minimizers (Q6567265) (← links)
