Properties of Kruithof's Projection Method

DOI10.1002/J.1538-7305.1979.TB02231.XMaRDI QIDQ4187614zbMATH OpenOpenAlexFDO

Authors R. S. Krupp

Publication date 1979

Published in Bell System Technical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/j.1538-7305.1979.tb02231.x

zbMATH Keywords

Convergence AnalysisFlows in NetworksIll- Conditioned ProblemLabelling AlgorithmNetwork ProgrammingProjection MethodTelephone NetworksTelephone Traffic Forecasting

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Applications of graph theory to circuits and networks (94C15)

Cited in

(9)

• On some optimization techniques in image reconstruction from projections
• Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions
• Scalings of matrices which have prespecified row sums and column sums via optimization
• Scalings of matrices satisfying line-product constraints and generalizations
• Implementing an “exact” Newton method for separable convex transportation problems
• Diagonal Scalings for the Eigenstructure of Arbitrary Pencils
• Order independence and factor convergence in iterative scaling
• Proportionality in multiple dimensions to design electoral systems
• Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem

This page was built for publication: Properties of Kruithof's Projection Method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187614)