Two problems in multicommodity networks
RAIRO - Operations Research - Recherche Opérationnelle (1979)
- Volume: 13, Issue: 2, page 135-142
- ISSN: 0399-0559
Access Full Article
top
How to cite
topAneja, Y. P., and Nair, K. P. K.. "Two problems in multicommodity networks." RAIRO - Operations Research - Recherche Opérationnelle 13.2 (1979): 135-142. <http://eudml.org/doc/104723>.
@article{Aneja1979,
author = {Aneja, Y. P., Nair, K. P. K.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {Multicommodity Networks; Maximal Flows; Network Programming},
language = {eng},
number = {2},
pages = {135-142},
publisher = {EDP-Sciences},
title = {Two problems in multicommodity networks},
url = {http://eudml.org/doc/104723},
volume = {13},
year = {1979},
}
TY - JOUR
AU - Aneja, Y. P.
AU - Nair, K. P. K.
TI - Two problems in multicommodity networks
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1979
PB - EDP-Sciences
VL - 13
IS - 2
SP - 135
EP - 142
LA - eng
KW - Multicommodity Networks; Maximal Flows; Network Programming
UR - http://eudml.org/doc/104723
ER -
References
top- 1. E. W. DIJKSTRA, A Note on Two Problems in Connection with Graphs, Numerische Mathematik, Vol. 1, 1959, pp. 269-271. Zbl0092.16002MR107609
- 2. L. R. FORD and D. R. FULKERSON, A Suggested Computation for Maximal Multicommodity Network Flows, Management Science, Vol. 5, 1958, pp. 97-101. Zbl0995.90516MR97878
- 3. A. M. FRIEZE, Bottleneck Linear Programming, Operational Research Quaterly, Vol. 26, 1975, pp. 871-874. Zbl0312.90035MR401128
NotesEmbed ?
topYou 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.