Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
type: Item
instance of: scholarly article
title: Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
zbMATH Open document ID: 1079.90137
author: Ramkumar Ramaswamy
author: James B. Orlin
author: Nilotpal Chakravarti
published in: Mathematical Programming. Series A. Series B
publication date: 2005-04-19T00:00:00Z
full work available at URL: http://hdl.handle.net/1721.1/5065
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 2159476
zbMATH Keywords: Sensitivity analysis
zbMATH Keywords: Shortest path problem
zbMATH Keywords: Bottleneck shortest path
zbMATH Keywords: Maximum capacity path problem
MaRDI profile type: Publication
OpenAlex ID: W2159018822
Wikidata QID: Q59592484
cites work: Q3056948
cites work: Parallel algorithm for finding the most vital edge in weighted graphs
cites work: A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Advances in sensitivity analysis and parametric programming
cites work: Q4377042
cites work: Q4418662
cites work: Finding the most vital edge with respect to minimum spanning tree in weighted graphs
cites work: Parallel algorithms for finding the most vital edge with respect to minimum spanning tree
cites work: A randomized linear-time algorithm to find minimum spanning trees
cites work: The k most vital arcs in the shortest path problem
cites work: Arc tolerances in shortest path and network flow problems
cites work: A simple version of Karzanov's blocking flow algorithm
cites work: Undirected single-source shortest paths with positive integer weights in linear time
cites work: NC algorithms for the Single Most Vital Edge problem with respect to shortest paths
DBLP publication ID: journals/mp/RamaswamyOC05
DOI: 10.1007/S10107-004-0517-8
Recommended article: Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
Recommended article: Sensitive and parametric analysis of the maximum flow in a network
Recommended article: Sensitivity analysis on the all pairsq-route flows in a network
Recommended article: Sensitivity analysis for bottleneck assignment problems
Recommended article: The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
Recommended article: Q4845160
Recommended article: Q4489157
Recommended article: Q3753768
Recommended article: Q4726020
description: scientific article; zbMATH DE number 2159476