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

DOI10.1111/itor.12624OpenAlexW2909688310MaRDI QIDQ6069837

Marta M. B. Pascoal, Joao Carlos Namorado Climaco

Publication date: 17 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10316/90443

zbMATH Keywords

costbicriteria problemspairs of pathsmaximally disjoint labels

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (3)

Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations ⋮ Finding shortest and dissimilar paths ⋮ An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks

Cites Work

• Finding non-dominated bicriteria shortest pairs of disjoint simple paths
• A bicriterion shortest path algorithm
• Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models
• Finding the k Shortest Paths
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
• Solving the edge‐disjoint paths problem using a two‐stage method
• Unnamed Item

This page was built for publication: On a relaxed maximally disjoint path pair problem: a bicriteria approach