Some optimal path problems subject to improvements

DOI10.1007/BF01917653zbMATH Open0378.49020MaRDI QIDQ4157613FDOQ4157613

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

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

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)