Pages that link to "Item:Q1183393"
From MaRDI portal
The following pages link to A dual algorithm for submodular flow problems (Q1183393):
Displaying 15 items.
- A fast cost scaling algorithm for submodular flow (Q294751) (← links)
- On DC optimization algorithms for solving minmax flow problems (Q406644) (← links)
- Duality for balanced submodular flows (Q581206) (← links)
- Negative circuits for flows and submodular flows (Q1192951) (← links)
- Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (Q1200795) (← links)
- On the complexity of the dual method for maximum balanced flows (Q1324690) (← links)
- On dual minimum cost flow algorithms (Q1396922) (← links)
- A note on Faigle and Kern's dual greedy polyhedra (Q1591366) (← links)
- A practical algorithm for computing a subadditive dual function for set partitioning (Q1771223) (← links)
- Exact bounds for steepest descent algorithms of $L$-convex function minimization (Q1785253) (← links)
- Dijkstra's algorithm and L-concave function maximization (Q2248748) (← links)
- A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows (Q2785397) (← links)
- MONOTONICITY IN STEEPEST ASCENT ALGORITHMS FOR POLYHEDRAL L-CONCAVE FUNCTIONS (Q3456031) (← links)
- A Primal-Dual Algorithm for Submodular Flows (Q3680637) (← links)
- (Q3725833) (← links)
