Pages that link to "Item:Q5951962"
From MaRDI portal
The following pages link to A strongly polynomial time algorithm for a constrained submodular optimization problem (Q5951962):
Displaying 6 items.
- A faster strongly polynomial time algorithm for submodular function minimization (Q1016120) (← links)
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505) (← links)
- A strongly polynomial algorithm for line search in submodular polyhedra (Q2427694) (← links)
- A Structure Theory for the Parametric Submodular Intersection Problem (Q3169048) (← links)
- Characterizations of Natural Submodular Graphs: A Polynomially Solvable Class of the TSP (Q4327639) (← links)
- A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization (Q5429271) (← links)