Pages that link to "Item:Q5259600"

The following pages link to A strongly polynomial algorithm for generalized flow maximization (Q5259600):

Displaying 13 items.

• Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← links)
• On maximum flows in polyhedral domains (Q918212) (← links)
• The MA-ordering max-flow algorithm is not strongly polynomial for directed networks (Q1433655) (← links)
• A strongly polynomial contraction-expansion algorithm for network flow problems (Q1652310) (← links)
• A faster polynomial algorithm for the constrained maximum flow problem (Q1761207) (← links)
• A generalization of the scaling max-flow algorithm (Q1885993) (← links)
• A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q2817799) (← links)
• A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148) (← links)
• A Polynomial Algorithm for Weighted Abstract Flow (Q3503842) (← links)
• (Q4875223) (← links)
• A simpler and faster strongly polynomial algorithm for generalized flow maximization (Q4977964) (← links)
• Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q5415463) (← links)
• SOFSEM 2004: Theory and Practice of Computer Science (Q5902005) (← links)