Properties of Kruithof's Projection Method

DOI10.1002/J.1538-7305.1979.TB02231.XzbMATH Open0402.90095OpenAlexW2066872093MaRDI QIDQ4187614FDOQ4187614

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

Flows in NetworksNetwork ProgrammingProjection MethodConvergence AnalysisTelephone NetworksIll- Conditioned ProblemLabelling AlgorithmTelephone Traffic Forecasting

Mathematics Subject Classification ID

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

Cited In (8)

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

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)