Solving the edge-disjoint paths problem using a two-stage method-Reference-Cited by-同舟云学术

Solving the edge-disjoint paths problem using a two-stage method

Published:2018-04-30 Issue:1 Volume:27 Page:435-457
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Martín Bernardo¹,Sánchez Ángel¹,Beltran-Royo Cesar¹,Duarte Abraham¹^ORCID

Affiliation:

1. Department of Computer Sciences; Universidad Rey Juan Carlos; C/Tulipán s/n Móstoles Madrid Spain

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1111/itor.12544/fullpdf

Reference58 articles.

1. The edge-disjoint path problem on random graphs by message-passing;Altarelli;PLoS One,2015

2. Awerbuch , B. Gawlick , R. Leighton , F.T. Rabani , Y. 1994 On-line admission control and circuit routing for high performance computing and communication IEEE New York 412 423

3. Emergence of scaling in random networks;Barabasi;Science,1999

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

1. Enhancing Network Availability: An Optimization Approach;Computation;2023-10-09

2. Design of survivable wireless backhaul networks with reliability considerations;Computers & Operations Research;2023-03

3. Disjoint-Path Segment Routing: Network Reliability Perspective;2022 International Wireless Communications and Mobile Computing (IWCMC);2022-05-30

4. An SDN-Coordinated Steering Framework for Multipath Big Data Transfer Application;IEEE Access;2022

5. Design of Survivable Wireless Backhaul Networks Withreliability Considerations;SSRN Electronic Journal;2022