Matrix scaling by network flow
From MaRDI portal
Publication:2934673
zbMATH Open1302.65115MaRDI QIDQ2934673FDOQ2934673
Authors: Günter Rote, Martin Zachariasen
Publication date: 18 December 2014
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
Deterministic network models in operations research (90B10) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)
Cited In (14)
- Complexity and algorithms for nonlinear optimization problems
- Greatest remainder bi-proportional rounding and the Greek parliamentary elections of 2007
- Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems
- Nonequispaced fast Fourier transform boost for the Sinkhorn algorithm
- Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
- Algorithms for proportional matrices in reals and integers
- The nested Sinkhorn divergence to learn the nested distance
- Biproportional scaling of matrices and the iterative proportional fitting procedure
- Vector and matrix apportionment problems and separable convex integer optimization
- Generalized scalings satisfying linear equations
- Network models and biproportional rounding for fair seat allocations in the UK elections
- 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
- 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)