Pages that link to "Item:Q2427694"
From MaRDI portal
The following pages link to A strongly polynomial algorithm for line search in submodular polyhedra (Q2427694):
Displaying 6 items.
- Zonotopes and the LP-Newton method (Q833464) (← links)
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
- Submodular function minimization (Q995782) (← links)
- Equivalence of convex minimization problems over base polytopes (Q1926652) (← links)
- Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation (Q5962716) (← links)
