A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network
type: Item
instance of: scholarly article
title: A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network
zbMATH Open document ID: 0768.90080
DOI: 10.1016/0377-2217(92)90311-V
author: C. E. Yang
author: J. L. Scott
author: Les R. Foulds
published in: European Journal of Operational Research
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 92055
zbMATH Keywords: minimal cost-to-time ratio
zbMATH Keywords: all-pairs minimum average weighted length path
MaRDI profile type: Publication
cites work: Programming with linear fractional functionals
cites work: Q5583694
cites work: Q4198056
cites work: Dioïds and semirings: Links to fuzzy sets and other applications
cites work: Q4130999
cites work: Q4739657
cites work: Q3707420
cites work: Q3351166
description: scientific article; zbMATH DE number 92055