Matrix scaling by network flow
From MaRDI portal
Publication:2934673
Recommendations
- Scalings of matrices which have prespecified row sums and column sums via optimization
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
- Greatest remainder bi-proportional rounding and the Greek parliamentary elections of 2007
- Scaling Matrices to Prescribed Row and Column Maxima
- A Comparative Study of Algorithms for Matrix Balancing
Cited in
(14)- Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems
- Greatest remainder bi-proportional rounding and the Greek parliamentary elections of 2007
- Network models and biproportional rounding for fair seat allocations in the UK elections
- Generalized scalings satisfying linear equations
- Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
- Algorithms for proportional matrices in reals and integers
- Complexity and algorithms for nonlinear optimization problems
- The nested Sinkhorn divergence to learn the nested distance
- Biproportional scaling of matrices and the iterative proportional fitting procedure
- Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment
- Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
- Nonequispaced fast Fourier transform boost for the Sinkhorn algorithm
- Vector and matrix apportionment problems and separable convex integer optimization
- Apportionment with parity constraints
This page was built for publication: Matrix scaling by network flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934673)
