Finding non-dominated bicriteria shortest pairs of disjoint simple paths-Reference-Cited by-同舟云学术

Finding non-dominated bicriteria shortest pairs of disjoint simple paths

Published:2009-11 Issue:11 Volume:36 Page:2892-2898
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Clímaco João C.N.,Pascoal Marta M.B.

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference11 articles.

1. Survivable networks: algorithms for diverse routing;Bhandari,1998

2. Disjoint paths in a network;Suurballe;Networks,1974

3. A quick method for finding shortest pairs of disjoint paths;Suurballe;Networks,1984

4. Craveirinha J, Clímaco J, Pascoal M, Martins L. Traffic splitting in MPLS networks—a hierarchical multicriteria approach. In: VI international conference on decision support for telecommunications and information society—DSTIS’2007, Warsaw, Poland, July 2007.

5. Multiple criteria decision analysis—state of the art surveys;Clímaco,2005

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Original optimal method to solve the all-pairs shortest path problem: Dhouib-matrix-ALL-SPP;Data Science and Management;2024-09

2. Multiobjective Path Problems and Algorithms in Telecommunication Network Design—Overview and Trends;Algorithms;2024-05-22

3. The multiple shortest path problem with path deconfliction;European Journal of Operational Research;2021-08

4. On a relaxed maximally disjoint path pair problem: a bicriteria approach;International Transactions in Operational Research;2019-01-08

5. Diversification of Route Planning Results for Improved User Satisfaction;2015 IEEE 18th International Conference on Intelligent Transportation Systems;2015-09