A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network

DOI10.1016/0377-2217(92)90311-VzbMath0768.90080MaRDI QIDQ1197968

J. L. Scott, C. E. Yang, Les R. Foulds

Publication date: 16 January 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

minimal cost-to-time ratioall-pairs minimum average weighted length path

Mathematics Subject Classification ID

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

Cites Work

• Dioïds and semirings: Links to fuzzy sets and other applications
• Programming with linear fractional functionals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network