Résolution directe du problème général de distribution

Khoan Vo Khac

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

  • Volume: 26, Issue: 2, page 139-152
  • ISSN: 0399-0559

How to cite

top

Khac, Khoan Vo. "Résolution directe du problème général de distribution." RAIRO - Operations Research - Recherche Opérationnelle 26.2 (1992): 139-152. <http://eudml.org/doc/105034>.

@article{Khac1992,
author = {Khac, Khoan Vo},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {transshipment},
language = {fre},
number = {2},
pages = {139-152},
publisher = {EDP-Sciences},
title = {Résolution directe du problème général de distribution},
url = {http://eudml.org/doc/105034},
volume = {26},
year = {1992},
}

TY - JOUR
AU - Khac, Khoan Vo
TI - Résolution directe du problème général de distribution
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1992
PB - EDP-Sciences
VL - 26
IS - 2
SP - 139
EP - 152
LA - fre
KW - transshipment
UR - http://eudml.org/doc/105034
ER -

References

top
  1. 1. M. S. BAZARAA et R. W. LANGLEY, A Dual Shortest Path Algorithm, J. S.I.A.M., 1974, 26, 3, p. 496-501. Zbl0251.90051MR347376
  2. 2. C. BERGE, Graphes, Gauthier-Villars, Paris, 1987. Zbl0531.05031
  3. 3. C. BERGE et A. GHOUILA-HOURI, Programmes, jeux et réseaux de transport, Dunod, Paris, 1962. Zbl0111.17302MR192912
  4. 4. G. B. DANTZIG, W. O. BLATTNER et M. R. RAO, All Shortest Routes from a Fixed Origin in a Graphe, dans Théorie des graphes, Journées Internationales d'Étude, Rome, juillet 1966, Dunod, Paris, 1967. Zbl0189.24103MR221980
  5. 5. A. V. KARZANOV, Determining the Maximal Flow in a Network with the Method of Preflows, Soviet Math. Dokl., 1974, 15, p. 434-437. Zbl0303.90014
  6. 6. V. M. MALHOTRA, M. P. KUMAR et S. N. MAHESHWARI, An O (| V|³) Algorithm for Finding Maximum Flows in Networks, Inform. Process. Lett., 1978, 7, 6, p. 277-278. Zbl0391.90041MR509428
  7. 7. M. MINOUX, Programmation mathématique, Dunod, Paris, 1983. Zbl0546.90056
  8. 8. G. L. NEMHAUSER, A Generalized Permanent Label Setting Algorithm for the Shortest Path Between Specified Nodes, J. Math. Anal. Appl., 1972, 38, p. 328-334. Zbl0234.90063MR309540
  9. 9. M. SIMMONARD, Programmation linéaire, Dunod, Paris, 1962. Zbl0115.37902MR138505

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.