Pages that link to "Item:Q3220318"
From MaRDI portal
The following pages link to A submodular network simplex method (Q3220318):
Displaying 13 items.
- A fast cost scaling algorithm for submodular flow (Q294751) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- An out-of-kilter method for submodular flows (Q1095780) (← links)
- Directed submodularity, ditroids and directed submodular flows (Q1116891) (← links)
- An application of submodular flows (Q1119596) (← links)
- Submodular flow problem with a nonseparable cost function (Q1125610) (← links)
- A dual algorithm for submodular flow problems (Q1183393) (← links)
- Submodular functions in problems of synthesis of networks (Q1407173) (← links)
- Fast cycle canceling algorithms for minimum cost submodular flow (Q1882113) (← links)
- Fair integral submodular flows (Q2166258) (← links)
- Submodular containment is hard, even for networks (Q2564307) (← links)
- Substitutes and complements in network flows viewed as discrete convexity (Q2581320) (← links)
- A submodular optimization problem with side constraints (Q2757558) (← links)