Pages that link to "Item:Q651729"
From MaRDI portal
The following pages link to An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem (Q651729):
Displaying 4 items.
- A new algorithm for solving the feasibility problem of a network flow (Q990544) (← links)
- A discrete EOQ problem is solvable in \(O(\log n)\) time (Q2482773) (← links)
- Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility (Q3833848) (← links)
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems (Q3912012) (← links)