Pages that link to "Item:Q688924"

The following pages link to A polynomial-time simplex method for the maximum \(k\)-flow problem (Q688924):

Displaying 10 items.

• Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
• A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time (Q750277) (← links)
• On the \(k\)-cut subgraph polytope (Q1340072) (← links)
• A simplex algorithm for a class of Leontief flow problems (Q1381763) (← links)
• A faster polynomial algorithm for the constrained maximum flow problem (Q1761207) (← links)
• A note on the problem of \(r\) disjoint \((s, t)\)-cuts and some related issues (Q2417161) (← links)
• A primal simplex variant for the maximum-flow problem (Q3316928) (← links)
• (Q4875223) (← links)
• Approximation Algorithms for k-Hurdle Problems (Q5458550) (← links)
• A polynomial dual simplex algorithm fot the generalized circulation problem. (Q5957566) (← links)