The single most vital arc in the most economical path problem -- a parametric analysis

DOI10.1016/0305-0548(94)90096-5zbMath0789.90085OpenAlexW1944228763MaRDI QIDQ1317083

Maw-Sheng Chern, Kao-Chêng Lin

Publication date: 24 March 1994

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

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90096-5

zbMATH Keywords

shortest path problemsingle most vital arc

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Parametric matroid interdiction, The fuzzy shortest path problem and its most vital arcs

Cites Work

• Unnamed Item
• Unnamed Item
• The quickest path problem
• The k most vital arcs in the shortest path problem
• Parametric shortest path algorithms with an application to cyclic staffing
• Most vital links and nodes in weighted networks
• The fuzzy shortest path problem and its most vital arcs
• Finding the most vital arcs in a network
• Combinatorial Optimization with Rational Objective Functions
• Computational complexity of parametric linear programming
• Efficient Shortest Path Simplex Algorithms
• Faster parametric shortest path and minimum‐balance algorithms