An algorithm for ranking paths in acyclic networks

DOI10.1007/BF01720017zbMath0513.90083MaRDI QIDQ1050909

Ernesto de Queirós Vieira Martins

Publication date: 1983

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

computational complexityshortest treeacyclic networksalgorithm for ranking paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Paths and cycles (05C38)

Related Items (1)

Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa

Cites Work

• Unnamed Item
• A bicriterion shortest path algorithm
• On algorithms for finding the k shortest paths in a network
• A Method for the Solution of the N th Best Path Problem
• Shortest Path and Network Flow Algorithms
• An Appraisal of Some Shortest-Path Algorithms
• Computing the N Best Loopless Paths in a Network
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: An algorithm for ranking paths in acyclic networks