Hybrid Bellman-Ford-Dijkstra algorithm

DOI10.1016/J.JDA.2017.01.001zbMATH Open1364.05071OpenAlexW2570013196MaRDI QIDQ511150FDOQ511150

Authors: Rotem Itzhak, Yefim Dinitz 

Publication date: 14 February 2017

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2017.01.001

Recommendations

• A hybrid algorithm for TSP
• On the optimality of Bellman-Ford-Moore shortest path algorithm
• A heuristic improvement of the Bellman-Ford algorithm
• A hybrid algorithm for a class of vehicle routing problems
• Randomized Speedup of the Bellman–Ford Algorithm
• An improvement on fixed order Bellman-Ford algorithm

zbMATH Keywords

graph algorithmshortest pathnegative edge

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40)

Cites Work

• Introduction to algorithms
• Title not available (Why is that?)
• Scaling Algorithms for the Shortest Paths Problem
• A Shortest Path Algorithm for Real-Weighted Undirected Graphs
• Application of a Technique for Research and Development Program Evaluation
• Undirected single-source shortest paths with positive integer weights in linear time
• A generalization of Dijkstra's algorithm
• A Note on Dijkstra's Shortest Path Algorithm
• (Incremental) priority algorithms
• A Shortest Path Algorithm for Edge-Sparse Graphs
• Buckets, Heaps, Lists, and Monotone Priority Queues
• Shortest Path Feasibility Algorithms: An Experimental Evaluation
• Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
• Models of greedy algorithms for graph problems

Cited In (1)

• The shortest-path and bee colony optimization algorithms for traffic control at single intersection with Networkx application

Uses Software

• Algorithm 360

This page was built for publication: Hybrid Bellman-Ford-Dijkstra algorithm

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