Some constrained shortest-route problems

DOI10.1007/BF01939836zbMath0228.90049MaRDI QIDQ5636707

C. P. Bajaj

Publication date: 1971

Published in: Unternehmensforschung Operations Research - Recherche Opérationnelle (Search for Journal in Brave)

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Dynamic programming (90C39)

Related Items

Analyzing the reachability problem in choice networks, The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions, Reachability in choice networks, Some optimal path problems subject to improvements, Shortest path tour problem with time windows, An efficient exact approach for the constrained shortest path tour problem, A generalized shortest path tour problem with time windows

Cites Work

• Unnamed Item
• Unnamed Item
• On a routing problem
• Solutions of the Shortest-Route Problem—A Review
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• A Decomposition Algorithm for the Shortest-Route Problem
• The Routing Problem with “K” Specified Nodes
• The Extension of the Cascade Algorithm to Large Graphs
• An Appraisal of Some Shortest-Path Algorithms
• The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph
• The Traveling Salesman Problem: A Survey