Properties of Kruithof's Projection Method

DOI10.1002/j.1538-7305.1979.tb02231.xzbMath0402.90095OpenAlexW2066872093MaRDI QIDQ4187614

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

Network ProgrammingFlows in NetworksProjection MethodConvergence AnalysisTelephone NetworksIll- Conditioned ProblemLabelling AlgorithmTelephone Traffic Forecasting

Mathematics Subject Classification ID

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

Related Items (8)

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 ⋮ Diagonal Scalings for the Eigenstructure of Arbitrary Pencils ⋮ Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem ⋮ Implementing an “exact” Newton method for separable convex transportation problems ⋮ Order independence and factor convergence in iterative scaling ⋮ Scalings of matrices satisfying line-product constraints and generalizations

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