Note on a vertex stability radius in the shortest path problem
From MaRDI portal
Publication:6579095
DOI10.1007/S43069-024-00338-4MaRDI QIDQ6579095FDOQ6579095
Authors: Egor Grishin, Elena Musatova, Alexander A. Lazarev 
Publication date: 25 July 2024
Published in: SN Operations Research Forum (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Some concepts of stability analysis in combinatorial optimization
- Sensitivity analysis: a review of recent advances
- Arc tolerances in shortest path and network flow problems
- A note on Arc tolerances in sparse shortest-path and network flow problems
- Title not available (Why is that?)
- Stability radius of a vector investment problem with Savage's minimax risk criteria
- Post-Optimal Analysis in Linear Semi-Infinite Optimization
- Calculation of stability radii for combinatorial optimization problems
- A general approach to the study of the stability of solutions in discrete optimization problems
- Stability analysis in discrete optimization involving generalized addition operations
- Stability of the travelling salesman problem
- Title not available (Why is that?)
- The stability radius of an optimal line balance with maximum efficiency for a simple assembly line
- Estimating the Stability Radius of an Optimal Solution to the Simple Assembly Line Balancing Problem
This page was built for publication: Note on a vertex stability radius in the shortest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579095)
