On a relaxed maximally disjoint path pair problem: a bicriteria approach-Reference-Cited by-同舟云学术

On a relaxed maximally disjoint path pair problem: a bicriteria approach

Published:2019-01-08 Issue:4 Volume:27 Page:2045-2063
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

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

Affiliation:

1. Department of MathematicsCMUCUniversity of Coimbra3001‐501 Coimbra Portugal

2. Institute for Systems Engineering and Computers – CoimbraUniversity of Coimbra, rua Sílvio LimaPólo II 3030‐290 Coimbra Portugal

Funder

Fundação para a Ciência e a Tecnologia

European Regional Development Fund

Publisher

Wiley

Subject

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

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/itor.12624

Reference19 articles.

1. A bicriterion shortest path algorithm

2. Finding non-dominated bicriteria shortest pairs of disjoint simple paths

3. Multicriteria path and tree problems: discussion on exact algorithms and applications

4. SHARED RISK RESOURCE GROUP COMPLEXITY AND APPROXIMABILITY ISSUES

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

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

2. An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks;INFOR: Information Systems and Operational Research;2023-07-11

3. Finding K dissimilar paths: Single-commodity and discretized flow formulations;Computers & Operations Research;2022-11

4. Finding shortest and dissimilar paths;International Transactions in Operational Research;2021-09-25