The cost-to-time ratio problem for large or infinite graphs

DOI10.1016/0166-218X(87)90049-7zbMath0642.90100MaRDI QIDQ1101357

Manfred von Golitschek

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

systems of linear inequalitiesdoubly weighted directed graphmaximal cost-to-time ratiominimal cost-to-time ratio

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

A Fourth bibliography of fractional programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones
• Applications of shortest path algorithms to matrix scalings
• Eigenfunctions and optimal orbits
• 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
• Combinatorial Optimization with Rational Objective Functions