Computing optimal scalings by parametric network algorithms-Reference-Cited by-同舟云学术

Computing optimal scalings by parametric network algorithms

Published:1985-05 Issue:1 Volume:32 Page:1-10
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Orlin J. B.,Rothblum U. G.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01585655.pdf

Reference26 articles.

1. G. Aumann, “Über approximative Nomo-graphie, 1”,Bayerische Akademie der Wissenschaften, Mathematisch-Naturwissenschaftliche Klasse, Sitzungsberichte (1958) 137–155.

2. G. Aumann, “Über approximative Nomo-graphie, II”,Bayerische Akademie der Wissenschaften, Mathematisch-Naturwissenschaftliche Klasse, Sitzungsberichte (1959) 103–109.

3. M. Bacharach,Biproportional matrices and input-output change (Cambridge University Press, Cambridge, 1970).

4. F.L. Bauer, “Optimally scaled matrices”,Numerische Mathematik 5 (1963) 73–87.

5. F.L. Bauer, “Remarks on optimally scaled matrices”,Numerische Mathematik 13 (1969) 1–3.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An approximation algorithm for a general class of multi-parametric optimization problems;Journal of Combinatorial Optimization;2022-08-30

2. An approximation algorithm for a general class of parametric optimization problems;Journal of Combinatorial Optimization;2020-09-22

3. Multi-parameter clock skew scheduling;Integration;2015-01

4. Qualitative Sensitivity Analysis;Advances in Sensitivity Analysis and Parametric Programming;1997

5. Chapter 1 Applications of network optimization;Handbooks in Operations Research and Management Science;1995