An algorithm to determine a path with minimal cost/capacity ratio

DOI10.1016/0166-218X(84)90100-8zbMath0458.68014OpenAlexW2001125358MaRDI QIDQ5904728

Corina Reischer, Louise C. Martin

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/0166-218x(84)90100-8

zbMATH Keywords

probabilistic automatonminimization of the entropic interdependence measure

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Unnamed Item ⋮ A remark on a variational problem in probability

Cites Work

• On a special class of bicriterion path problems
• A bicriterion shortest path algorithm
• Shortest Path and Network Flow Algorithms
• Hyperbolic programming

This page was built for publication: An algorithm to determine a path with minimal cost/capacity ratio