Pages that link to "Item:Q3680637"

The following pages link to A Primal-Dual Algorithm for Submodular Flows (Q3680637):

Displaying 21 items.

• A fast cost scaling algorithm for submodular flow (Q294751) (← links)
• Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
• Testing membership in matroid polyhedra (Q1056350) (← links)
• A strongly polynomial minimum cost circulation algorithm (Q1079110) (← links)
• An out-of-kilter method for submodular flows (Q1095780) (← links)
• An application of simultaneous diophantine approximation in combinatorial optimization (Q1101013) (← links)
• Generalized polymatroids and submodular flows (Q1116889) (← links)
• Directed submodularity, ditroids and directed submodular flows (Q1116891) (← links)
• An application of submodular flows (Q1119596) (← links)
• A dual algorithm for submodular flow problems (Q1183393) (← links)
• A capacity scaling algorithm for convex cost submodular flows (Q1363412) (← links)
• Optimum partitioning into intersections of ring families (Q1363743) (← links)
• Coordinatewise domain scaling algorithm for M-convex function minimization (Q1771308) (← links)
• A capacity scaling algorithm for M-convex submodular flow (Q1777220) (← links)
• Polyhedral structure of submodular and posi-modular systems (Q1841887) (← links)
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
• Fair integral submodular flows (Q2166258) (← links)
• The edge-orientation problem and some of its variants on weighted graphs (Q2509220) (← links)
• A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows (Q2785397) (← links)
• A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm (Q3731344) (← links)
• A Unified Framework for Pricing in Nonconvex Resource Allocation Games (Q6114782) (← links)