A note on Arc tolerances in sparse shortest-path and network flow problems

DOI10.1002/NET.3230130204MaRDI QIDQ3661270zbMATH OpenOpenAlexFDO

Authors Dan Gusfield

Publication date 1983

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230130204

zbMATH Keywords

large sparse graphscomputation of arc tolerancescycle tracingdead end retractiondirected tree of shortest paths

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Paths and cycles (05C38)

Cites work

• Efficiency of a Good But Not Linear Set Union Algorithm

Cited in

(9)

• Note on a vertex stability radius in the shortest path problem
• Minimum spanning trees in networks with varying edge weights
• Extremal values of global tolerances in combinatorial optimization with an additive objective function
• Some concepts of stability analysis in combinatorial optimization
• Stability analysis in discrete optimization involving generalized addition operations
• Extending single tolerances to set tolerances
• A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
• Global tolerances in the problems of combinatorial optimization with an additive objective function
• Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems

This page was built for publication: A note on Arc tolerances in sparse shortest-path and network flow problems

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