Dijkstra's algorithm revisited: the dynamic programming connexion

Moshe Sniedovich

Control and Cybernetics (2006)

  • Volume: 35, Issue: 3, page 599-620
  • ISSN: 0324-8569

How to cite

top

Sniedovich, Moshe. "Dijkstra's algorithm revisited: the dynamic programming connexion." Control and Cybernetics 35.3 (2006): 599-620. <http://eudml.org/doc/209437>.

@article{Sniedovich2006,
author = {Sniedovich, Moshe},
journal = {Control and Cybernetics},
keywords = {Dijkstra's algorithm; shortest path problem; dynamic programming; successive approximation},
language = {eng},
number = {3},
pages = {599-620},
title = {Dijkstra's algorithm revisited: the dynamic programming connexion},
url = {http://eudml.org/doc/209437},
volume = {35},
year = {2006},
}

TY - JOUR
AU - Sniedovich, Moshe
TI - Dijkstra's algorithm revisited: the dynamic programming connexion
JO - Control and Cybernetics
PY - 2006
VL - 35
IS - 3
SP - 599
EP - 620
LA - eng
KW - Dijkstra's algorithm; shortest path problem; dynamic programming; successive approximation
UR - http://eudml.org/doc/209437
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.