L'affectation exponentielle et le problème du plus court chemin dans un graphe

J. Fonlupt

RAIRO - Operations Research - Recherche Opérationnelle (1981)

  • Volume: 15, Issue: 2, page 165-184
  • ISSN: 0399-0559

How to cite

top

Fonlupt, J.. "L'affectation exponentielle et le problème du plus court chemin dans un graphe." RAIRO - Operations Research - Recherche Opérationnelle 15.2 (1981): 165-184. <http://eudml.org/doc/104784>.

@article{Fonlupt1981,
author = {Fonlupt, J.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {road network; traffic; traffic assignment; penalty function; shortest path problem; entropy function; systems of linear equations; graphs; transportation},
language = {fre},
number = {2},
pages = {165-184},
publisher = {EDP-Sciences},
title = {L'affectation exponentielle et le problème du plus court chemin dans un graphe},
url = {http://eudml.org/doc/104784},
volume = {15},
year = {1981},
}

TY - JOUR
AU - Fonlupt, J.
TI - L'affectation exponentielle et le problème du plus court chemin dans un graphe
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1981
PB - EDP-Sciences
VL - 15
IS - 2
SP - 165
EP - 184
LA - fre
KW - road network; traffic; traffic assignment; penalty function; shortest path problem; entropy function; systems of linear equations; graphs; transportation
UR - http://eudml.org/doc/104784
ER -

References

top
  1. 1. B. A. CARRE, An Algebra for Network Routing Problems, J. Inst Math. Appl., vol. 7, 1971, p. 273-294. Zbl0219.90020MR292583
  2. 2. G. B. DANTZIG, Linear Programming and Extensions, Princeton University Press, 1963. Zbl0997.90504MR201189
  3. 3. G. B. DANTZIG, On a Shortest Route Through a Network, Manag. Sc., vol. 6, 1960, p. 187-189. Zbl0995.90518MR113815
  4. 4. R. B. DIAL, A Probabilistic Multipath Traffic Assignment Model which Obviates Path Enumeration, Transp. Res., vol. 5, 1971, p. 83-111. 
  5. 5. E. DURAND, Solutions numériques des équations algébriques, tome II, Masson, Paris 1961. Zbl0099.10801
  6. 6. P. H. FARGIER, Une méthode de détermination de réseau optimal, février 1977, I.R.T. 
  7. 7. J. FONLUPT, L'affectation exponentielle et le problème du plus court chemin dans un graphe, Séminaire Analyse numérique n° 275, Mathématiques appliquées, Université scientifique et médicale de Grenoble. Zbl0457.90078
  8. 8. M. GONDRAN, Algèbre linéaire et cheminement dans un graphe, R.A.I.R.O., 1975, p. 77-98. Zbl0311.90071MR371724
  9. 9. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, 1970. Zbl0932.90001MR274683

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.