Pages that link to "Item:Q1751219"
From MaRDI portal
The following pages link to Polyhedral results for a class of cardinality constrained submodular minimization problems (Q1751219):
Displaying 12 items.
- Polymatroids and mean-risk minimization in discrete optimization (Q957370) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case (Q1278287) (← links)
- An exact cutting plane method for \(k\)-submodular function maximization (Q2067498) (← links)
- Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens (Q2089774) (← links)
- Special issue: Global solution of integer, stochastic and nonconvex optimization problems (Q2097627) (← links)
- Sequence independent lifting for a set of submodular maximization problems (Q2097631) (← links)
- On distributionally robust chance constrained programs with Wasserstein distance (Q2227531) (← links)
- A Structure Theory for the Parametric Submodular Intersection Problem (Q3169048) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← 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)
