TheO(n3) algorithm for a special case of the maximum cost-to-time ratio cycle problem and its coherence with an eigenproblem of a matrix

DOI10.1007/BF01415758zbMath0773.90076OpenAlexW314609130MaRDI QIDQ4015964

Ján Plavka

Publication date: 12 November 1992

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

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

zbMATH Keywords

generalized eigenproblemcyclic permutationcost-to-time optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Fractional programming (90C32) Combinatorial optimization (90C27)

Cites Work

• A characterization of the minimum cycle mean in a digraph
• Unnamed Item