On the second point-to-point undirected shortest simple path problem

DOI10.1007/s11590-012-0528-yzbMath1287.90083OpenAlexW2016824557MaRDI QIDQ395858

Antonio Sedeño-Noda, Carlos González-Martín

Publication date: 30 January 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0528-y

zbMATH Keywords

shortest pathseffective reduced costpoint-to-point undirected shortest simple pathsecond best solution

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Finding next-to-shortest paths in a graph
• Tight bounds for worst-case equilibria
• Undirected single-source shortest paths with positive integer weights in linear time
• An efficient algorithm for K shortest simple paths
• A Shortest Path Algorithm for Real-Weighted Undirected Graphs

This page was built for publication: On the second point-to-point undirected shortest simple path problem