The all-to-all alternative route problem

Brian Boffey

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

  • Volume: 27, Issue: 4, page 375-387
  • ISSN: 0399-0559

How to cite

top

Boffey, Brian. "The all-to-all alternative route problem." RAIRO - Operations Research - Recherche Opérationnelle 27.4 (1993): 375-387. <http://eudml.org/doc/105067>.

@article{Boffey1993,
author = {Boffey, Brian},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {-best route problems; dynamic vehicle guidance; routing in communication networks},
language = {eng},
number = {4},
pages = {375-387},
publisher = {EDP-Sciences},
title = {The all-to-all alternative route problem},
url = {http://eudml.org/doc/105067},
volume = {27},
year = {1993},
}

TY - JOUR
AU - Boffey, Brian
TI - The all-to-all alternative route problem
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1993
PB - EDP-Sciences
VL - 27
IS - 4
SP - 375
EP - 387
LA - eng
KW - -best route problems; dynamic vehicle guidance; routing in communication networks
UR - http://eudml.org/doc/105067
ER -

References

top
  1. 1. M. BEN-AKIVA, A. D. PALMA and I. KAYSI, Dynamic Network Models and Driver Information Systems, Transpn. Res. A., 1991, 25A, pp. 251-266. 
  2. 2. D. R BERTSEKAS and R. GALLAGER, Data Network, 1987, Prentice-Hall, Englewood Cliffs, NJ. Zbl0734.68006
  3. 3. T. B. BOFFEY, Distributed Computing: Associated Combinatorial Problems, 1992, Blackwell Scientific Publications, Oxford. 
  4. 4. M. FLORIAN, S. NGUYEN and S. PALLOTTINO, A Dual Simplex Algorithm for Finding all Shortest Paths, Networks, 1981, 11, pp. 367-378. Zbl0471.90085MR645113
  5. 5. G. GALLO and S. PALLOTTINO, Shortest Path Methods: a Unifying Approach, Math. Prog. Study, 1986, 26, pp. 38-64. Zbl0605.90123MR830485
  6. 6. P. HART, N. NILSSON and B. RAPHAEL, A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Trans. Syst. Man Cybernet., 1968, 4, pp. 100-107. 
  7. 7. G. J. HORNE, Finding the K Least Cost Paths in an Acyclic Activity Network, J. Opl Res. Soc. 1980, 31, pp. 443-448. 
  8. 8. C. L. MONMA and D. F. SHALLCROSS, Methods for Designing Communications Networks with Two-Connected Survivability Constraints, Oper. Res., 1989, 37, pp. 531-541. 
  9. 9. G. L. NEMHAUSER, A Generalized Permanent Label Setting Algorithm for the Shortest Path Between all Nodes J. Math. Analysis & Applic, 1972, 38, pp. 328-334. Zbl0234.90063MR309540
  10. 10. N. J. NILSSON, Problem Solving Methods in Artificial Intelligence, 1971, McGraw-Hill, New York. 
  11. 11. A. PERKO, A Representation of Disjoint Sets with Fast Initialization, Information Processing Lett., 1983, 16, p. 21 
  12. 12. A. PERKO, Implementation of Algorithms for K Shortest Loopless Paths, Networks, 1986, pp. 149-160. Zbl0642.90097MR835634
  13. 13. H. RUDIN, On Routing and Delta Routing: a Taxonomy and Performance Comparison of Techniques for Packet-Switched Networks, IEEE Trans. Commun., 1976, COM-24, pp. 43-59. 
  14. 14. D. M. TOPKIS, A k Shortest Path Algorithm for Adaptive Routing in Communication Networks, IEEE Trans. Commun., 1988, COM-36, pp. 855-859. Zbl0654.90021MR948321

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.