Finding Multi-Constrained Multiple Shortest Paths

DOI10.1109/TC.2014.2366762MaRDI QIDQ2982105zbMATH OpenOpenAlexFDO

Authors Turgay Korkmaz, Gang Feng

Publication date 16 May 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2014.2366762

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)

Recommendations

• Shortest path problem with multiple shortest paths
• Algorithms for finding paths with multiple constraints
• A multi-objective shortest path problem
• The multiple shortest path problem with path deconfliction
• On a multicriteria shortest path problem
• scientific article; zbMATH DE number 1380434
• The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph
• Multi-objective and multi-constrained non-additive shortest path problems

Cited in

(2)

• Finding cheapest deadline paths
• The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph

This page was built for publication: Finding Multi-Constrained Multiple Shortest Paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2982105)