Computing optimal scalings by parametric network algorithms

DOI10.1007/BF01585655zbMath0573.90095OpenAlexW2002018571WikidataQ59592728 ScholiaQ59592728MaRDI QIDQ3691441

Uriel G. Rothblum, James B. Orlin

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585655

zbMATH Keywords

symmetric scalingasymmetric scalingmaximal ratio criterionparametric network optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Balancing problems in acyclic networks, An approximation algorithm for a general class of parametric optimization problems, Characterizations of max-balanced flows, On scaling linear programs—some experimental results, An approximation algorithm for a general class of multi-parametric optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimally scaled matrices
• Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones
• Applications of shortest path algorithms to matrix scalings
• Parametric shortest path algorithms with an application to cyclic staffing
• An algorithm for scaling matrices and computing the minimum cycle mean in a digraph
• A characterization of the minimum cycle mean in a digraph
• Remarks on optimally scaled matrices
• On the approximation of a function of several variables by the sum of functions of fewer variables
• Evolution of Linear Programming Computing Techniques
• A Class Of Abelian Groups
• A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds
• An Algorithm for Scaling Matrices
• Combinatorial Optimization with Rational Objective Functions
• Cones, graphs and optimal scalings of matrices
• Characterizations of optimal scalings of matrices
• On the Automatic Scaling of Matrices for Gaussian Elimination