Pages that link to "Item:Q2541470"

The following pages link to Optimum flows in general communication networks (Q2541470):

Displaying 10 items.

• A parametric algorithm for convex cost network flow and related problems (Q789313) (← links)
• Improving time bounds on maximum generalised flow computations by contracting the network (Q1884873) (← links)
• A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
• Optimum flows in general communication networks (Q2541470) (← links)
• A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148) (← links)
• Parametric maximal flows in generalized networks – complexity and algorithms (Q3813580) (← links)
• (Q5020876) (← links)
• A simple GAP-canceling algorithm for the generalized maximum flow problem (Q5901710) (← links)
• Multi-commodity flow problem on lossy network with partial lane reversals (Q6170570) (← links)
• Generalized maximum flow over time with intermediate storage (Q6546986) (← links)