The cost-to-time ratio problem for large or infinite graphs
type: Item
instance of: scholarly article
title: The cost-to-time ratio problem for large or infinite graphs
zbMATH Open document ID: 0642.90100
DOI: 10.1016/0166-218X(87)90049-7
published in: Discrete Applied Mathematics
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 4047467
zbMATH Keywords: minimal cost-to-time ratio
zbMATH Keywords: doubly weighted directed graph
zbMATH Keywords: systems of linear inequalities
zbMATH Keywords: maximal cost-to-time ratio
author: Manfred von Golitschek
MaRDI profile type: Publication
cites work: Q3964346
cites work: Eigenfunctions and optimal orbits
cites work: Q5583694
cites work: An algorithm for scaling matrices and computing the minimum cycle mean in a digraph
cites work: Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones
cites work: Applications of shortest path algorithms to matrix scalings
cites work: A characterization of the minimum cycle mean in a digraph
cites work: Parametric shortest path algorithms with an application to cyclic staffing
cites work: Q5593809
cites work: Q4050410
cites work: Q4130999
cites work: Combinatorial Optimization with Rational Objective Functions
description: scientific article; zbMATH DE number 4047467