 |
 |
 |
 |
| |
|
|
|
|
SECAN-Lab Home News Projects SECAN-LAB Mesh Sequencer U-2010 NARTUS EFIPSANS IRMA SECRICOM The Group Members Publications Theses Teaching Presentations Topics Mobile Computing Ad-Hoc Networks Ad-Hoc Protocols Mesh Computing Trust Related Stuff L-101 Laboratory Systems AS28 Systems 802.11 Network Simulator Internships Conferences Publications Standards Projects Links Partners OSTN Miscellaneous Contact About Job Opportunities Search |
Bellman1958
On a Routing Problem
Richard Bellman The RAND Corporation Quarterly of Applied Mathematics Vol. 16, No. 1 Pages 87-90 1958  CommentBellman-Ford-Algorithmsee [Ford1956] AbstractGiving a set of N cities, with every two linked by a road, and the times required to travers these roads, we wish to determin the path from one given city to an other given city which minimizes the travel time.BibTeX
@ARTICLE(Bellman1958,
AUTHOR = {Richard Bellman},
TITLE = {On a Routing Problem},
JOURNAL = {Quarterly of Applied Mathematics},
VOLUME = {16},
NUMBER = {1}
YEAR = {1958},
PAGES = {87-90},
URL = {http://wisl.ece.cornell.edu/ECE794/Jan29/bellman1958.pdf},
FILE = {Bellmann1958.pdf}
)
"Bellman1958" wird erwähnt auf: Bellman-Ford Algorithm | Ford1956 | Fundamental Papers | Schijver1990 |