Finding non-dominated bicriteria shortest pairs of disjoint simple paths

DOI10.1016/j.cor.2009.01.002zbMath1162.90351OpenAlexW2079895178MaRDI QIDQ1025230

Marta M. B. Pascoal, Joao Carlos Namorado Climaco

Publication date: 18 June 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

disjoint pathsbicriteriaranking algorithmsshortest simple paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (4)

On a relaxed maximally disjoint path pair problem: a bicriteria approach ⋮ Risk approaches for delivering disaster relief supplies ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ The multiple shortest path problem with path deconfliction

Cites Work

• A note on two problems in connexion with graphs
• A bicriterion shortest path algorithm
• A quick method for finding shortest pairs of disjoint paths
• Disjoint paths in a network
• Fibonacci heaps and their uses in improved network optimization algorithms
• DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding non-dominated bicriteria shortest pairs of disjoint simple paths