Some optimal path problems subject to improvements

DOI10.1007/BF01917653MaRDI QIDQ4157613zbMATH OpenFDO

Authors C. P. Bajaj, J. P. Jain

Publication date 1978

Published in Zeitschrift für Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Hamilton-Jacobi theories (49L99)

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3453054 (Why is no real title available?)
• scientific article; zbMATH DE number 3383723 (Why is no real title available?)
• A Decomposition Algorithm for the Shortest-Route Problem
• A Dynamic Programming Approach to Sequencing Problems
• A Shortest Path Algorithm for Edge-Sparse Graphs
• A decomposition algorithm for shortest paths in a network with many strongly connected components
• Algorithms for Obtaining Shortest Paths Visiting Specified Nodes
• An Appraisal of Some Shortest-Path Algorithms
• Dynamic Programming Treatment of the Travelling Salesman Problem
• On a routing problem
• Solutions of the Shortest-Route Problem—A Review
• Some constrained shortest-route problems
• The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph

This page was built for publication: Some optimal path problems subject to improvements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4157613)