Pages that link to "Item:Q2661581"
From MaRDI portal
The following pages link to A polyhedral approach to bisubmodular function minimization (Q2661581):
Displaying 5 items.
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
- An exact cutting plane method for \(k\)-submodular function maximization (Q2067498) (← 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)
- A Polyhedral Approach to Bisubmodular Function Minimization (Q6336663) (← links)