Finding minimum cost to time ratio cycles with small integral transit times

DOI10.1002/net.3230230607zbMath0786.90081OpenAlexW2146709340MaRDI QIDQ3141113

James B. Orlin, Mark E. Hartmann

Publication date: 5 May 1994

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230230607

zbMATH Keywords

digraphminimum mean cycleparametric shortest pathscost to time ratio

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (14)

Balancing problems in acyclic networks ⋮ A fifth bibliography of fractional programming^* ⋮ Fractional 0-1 programming: applications and algorithms ⋮ Minimum-cost flow algorithms: an experimental evaluation ⋮ Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory ⋮ Randomized algorithms for finding the shortest negative cost cycle in networks ⋮ Online Regret Bounds for Markov Decision Processes with Deterministic Transitions ⋮ Static maxium cycle mean problem of a trivalent matrix ⋮ Computing the throughput of concatenation state machines ⋮ An algorithm to compute the nucleolus of shortest path games ⋮ Approximating the minimum cycle mean ⋮ Online regret bounds for Markov decision processes with deterministic transitions ⋮ Faster algorithms for quantitative verification in bounded treewidth graphs ⋮ A parametric critical path problem and an application for cyclic scheduling

Cites Work

• A characterization of the minimum cycle mean in a digraph
• Balancing problems in acyclic networks
• Unnamed Item

This page was built for publication: Finding minimum cost to time ratio cycles with small integral transit times