Pages that link to "Item:Q3818096"
From MaRDI portal
The following pages link to A NETWORK SIMPLEX METHOD FOR THE MAXIMUM BALANCED FLOW PROBLEM (Q3818096):
Displaying 21 items.
- A specialized network simplex algorithm for the constrained maximum flow problem (Q531424) (← links)
- Duality for balanced submodular flows (Q581206) (← links)
- The linear balancing flow problem (Q684332) (← links)
- On the equivalence of the maximum balanced flow problem and the weighted minimax flow problem (Q1083364) (← links)
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem (Q1176566) (← links)
- The balanced linear programming problem (Q1278929) (← links)
- On the complexity of the dual method for maximum balanced flows (Q1324690) (← links)
- Balancing problems in acyclic networks (Q1327220) (← links)
- A strongly polynomial algorithm for the uniform balanced network flow problem (Q1382257) (← links)
- Network simplex algorithm for the general equal flow problem. (Q1406491) (← links)
- Maximum balanced flow in a network (Q1569079) (← links)
- A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks (Q1758062) (← links)
- A simplex algorithm for network flow problems with piecewise linear fractional objective function (Q1956474) (← links)
- Balanced network flows. VII: Primal-dual algorithms. (Q2782730) (← links)
- Network simplex algorithm for the bi-criteria minimum cost flow over time problem (Q2881179) (← links)
- A POLYNOMIAL ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM WITH A CONSTANT BALANCING RATE FUNCTION (Q3030554) (← links)
- A primal simplex variant for the maximum-flow problem (Q3316928) (← links)
- A POLYNOMIAL-TIME BINARY SEARCH ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM (Q3489766) (← links)
- NP-COMPLETENESS AND APPROXIMATION ALGORITHM FOR THE MAXIMUM INTEGRAL VERTEX-BALANCED FLOW PROBLEM (Q3982631) (← links)
- TWO EFFICIENT ALGORITHMS FOR THE GENERALIZED MAXIMUM BALANCED FLOW PROBLEM (Q4483742) (← links)
- Balanced network flows. III. Strongly polynomial augmentation algorithms (Q4540088) (← links)
