Pages that link to "Item:Q1332311"
From MaRDI portal
The following pages link to New algorithms for generalized network flows (Q1332311):
Displaying 20 items.
- Maximum outflow in generalized flow networks (Q583080) (← links)
- Bimonotone linear inequalities and sublattices of \(\mathbb R^n\) (Q817640) (← links)
- A decomposition algorithm to determine the maximum flow in a generalized network (Q1121762) (← links)
- On the relation of max-flow to min-cut for generalized networks (Q1122471) (← links)
- Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
- Maximum flows in generalized processing networks (Q2012883) (← links)
- Convex generalized flows (Q2352786) (← links)
- Generalized max flow in series-parallel graphs (Q2445843) (← links)
- Faster algorithms for the generalized network flow problem (Q2757524) (← links)
- A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148) (← links)
- Some Recent Advances in Network Flows (Q3359973) (← links)
- A new algorithm for general matching problems using network flow subproblems (Q3829354) (← links)
- A comparison of phase and nonphase network flow algorithms (Q3833846) (← links)
- An ε-Relaxation method for generalized separable convex cost network flow problems (Q4645915) (← links)
- A simpler and faster strongly polynomial algorithm for generalized flow maximization (Q4977964) (← links)
- A POLYNOMIAL-TIME ALGORITHM FOR THE GENERALIZED INDEPENDENT-FLOW PROBLEM (Q5697484) (← links)
- A simple GAP-canceling algorithm for the generalized maximum flow problem (Q5901710) (← links)
- Modular circulation and applications to traffic management (Q5919619) (← links)
- Fast and simple approximation schemes for generalized flow. (Q5957564) (← links)
- A polynomial dual simplex algorithm fot the generalized circulation problem. (Q5957566) (← links)
