Pages that link to "Item:Q1850585"
From MaRDI portal
The following pages link to A fully combinatorial algorithm for submodular function minimization. (Q1850585):
Displayed 6 items.
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
- Submodular function minimization (Q995782) (← links)
- Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
- Coordinatewise domain scaling algorithm for M-convex function minimization (Q1771308) (← links)
- Traveling salesman games with the Monge property (Q1827808) (← links)
- A strongly polynomial algorithm for line search in submodular polyhedra (Q2427694) (← links)