Pages that link to "Item:Q1149744"
From MaRDI portal
The following pages link to An algorithm for scaling matrices and computing the minimum cycle mean in a digraph (Q1149744):
Displayed 9 items.
- Scaling linear optimization problems prior to application of the simplex method (Q453620) (← links)
- Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones (Q794387) (← links)
- Applications of shortest path algorithms to matrix scalings (Q799343) (← links)
- The Chebyshev solution of certain matrix equations (Q920580) (← links)
- The cost-to-time ratio problem for large or infinite graphs (Q1101357) (← links)
- Extremal signatures for bivariate Chebyshev approximation problems (Q1315202) (← links)
- A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds (Q3336583) (← links)
- Computing optimal scalings by parametric network algorithms (Q3691441) (← links)
- On scaling linear programs—some experimental results (Q3835674) (← links)