Pages that link to "Item:Q3489766"
From MaRDI portal
The following pages link to A POLYNOMIAL-TIME BINARY SEARCH ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM (Q3489766):
Displaying 9 items.
- A strongly polynomial algorithm for the uniform balanced network flow problem (Q1382257) (← links)
- A POLYNOMIAL ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM WITH A CONSTANT BALANCING RATE FUNCTION (Q3030554) (← links)
- (Q3348697) (← links)
- A POLYNOMIAL TIME ALGORITHM TO DETERMINE MAXIMAL BALANCED EQUIVALENCE RELATIONS (Q3520739) (← links)
- A NETWORK SIMPLEX METHOD FOR THE MAXIMUM BALANCED FLOW PROBLEM (Q3818096) (← 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. II: Simple augmentation algorithms (Q4540087) (← links)
- (Q4812956) (← links)