{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T16:32:49Z","timestamp":1747153969530,"version":"3.40.5"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,6,29]],"date-time":"2024-06-29T00:00:00Z","timestamp":1719619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,29]],"date-time":"2024-06-29T00:00:00Z","timestamp":1719619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-024-00338-4","type":"journal-article","created":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T20:31:01Z","timestamp":1719865861000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Note on a Vertex Stability Radius in the Shortest Path Problem"],"prefix":"10.1007","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6274-920X","authenticated-orcid":false,"given":"Egor","family":"Grishin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2746-3975","authenticated-orcid":false,"given":"Elena","family":"Musatova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0979-8189","authenticated-orcid":false,"given":"Alexander","family":"Lazarev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,29]]},"reference":[{"key":"338_CR1","doi-asserted-by":"publisher","DOI":"10.1201\/9781003071884","volume-title":"Mathematical programming with data perturbations II","author":"AV Fiacco","year":"2020","unstructured":"Fiacco AV (2020) Mathematical programming with data perturbations II. CRC Press, Boca Raton"},{"issue":"2","key":"338_CR2","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0166-218X(93)E0126-J","volume":"58","author":"YN Sotskov","year":"1995","unstructured":"Sotskov YN, Leontev VK, Gordeev EN (1995) Some concepts of stability analysis in combinatorial optimization. Discret Appl Math 58(2):169\u2013190","journal-title":"Discret Appl Math"},{"issue":"5","key":"338_CR3","first-page":"199","volume":"15","author":"V Leontiev","year":"1975","unstructured":"Leontiev V (1975) Stability of the traveling salesman problem. Comput Math 15(5):199\u2013213","journal-title":"Comput Math"},{"key":"338_CR4","series-title":"Applied Optimization","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2876-7_4","volume-title":"Industrial Applications of Combinatorial Optimization","author":"YN Sotskov","year":"1998","unstructured":"Sotskov YN, Tanaev VS, Werner F (1998) Stability radius of an optimal schedule: a survey and recent developments. In: Yu G (ed) Industrial Applications of Combinatorial Optimization, vol 16. Applied Optimization. Springer, Boston"},{"key":"338_CR5","volume-title":"Stability of optimality principles","author":"DA Molodtsov","year":"1987","unstructured":"Molodtsov DA (1987) Stability of optimality principles. URSS, Moscow"},{"issue":"3","key":"338_CR6","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/j.ejor.2015.06.032","volume":"248","author":"E Borgonovo","year":"2016","unstructured":"Borgonovo E, Plischke E (2016) Sensitivity analysis: a review of recent advances. Eur J Oper Res 248(3):869\u2013887","journal-title":"Eur J Oper Res"},{"key":"338_CR7","volume-title":"Encyclopedia of Operations Research and Management Science","author":"A Redchuk","year":"2016","unstructured":"Redchuk A, Insua DR (2016) Sensitivity analysis. In: Gass SI, Fu MC (eds) Encyclopedia of Operations Research and Management Science. Springer, Boston"},{"key":"338_CR8","series-title":"Springer Optimization and Its Applications","volume-title":"Advanced Optimization and Operations Research","author":"A Bhunia","year":"2020","unstructured":"Bhunia A, Sahoo L, Shaikh A (2020) Postoptimality analysis in LPPs. Advanced Optimization and Operations Research, vol 153. Springer Optimization and Its Applications. Springer, Singapore"},{"key":"338_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-8044-1","volume-title":"Postoptimal analysis in linear semi-infinite optimization","author":"MA Goberna","year":"2014","unstructured":"Goberna MA, L\u00f3pez MA (2014) Postoptimal analysis in linear semi-infinite optimization. Springer, Boston"},{"key":"338_CR10","first-page":"62","volume":"2","author":"AA Juan","year":"2015","unstructured":"Juan AA, Faulin J, Grasman SE, Rabe M, Figueira G (2015) A review of simheuristics: extending metaheuristics to deal with stochastic combinatorial optimization problems. Oper Res Perspect 2:62\u201372","journal-title":"Oper Res Perspect"},{"key":"338_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(98)00031-5","volume":"23","author":"N Chakravarti","year":"1995","unstructured":"Chakravarti N, Wagelmans APM (1995) Calculation of stability radii for combinatorial optimization problems. Oper Res Lett 23:1\u20137","journal-title":"Oper Res Lett"},{"issue":"2","key":"338_CR12","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.ejor.2018.10.013","volume":"272","author":"T-C Laia","year":"2019","unstructured":"Laia T-C, Sotskov YN, Dolgui A (2019) The stability radius of an optimal line balance with maximum efficiency for a simple assembly line. Eur J Oper Res 272(2):466\u2013481","journal-title":"Eur J Oper Res"},{"issue":"2","key":"338_CR13","first-page":"79","volume":"12","author":"KG Kuzmin","year":"2019","unstructured":"Kuzmin KG, Haritonova VR (2019) Estimating the stability radius of an optimal solution to the simple assembly line balancing problem. J Appl Ind Math 12(2):79\u201397","journal-title":"J Appl Ind Math"},{"issue":"3","key":"338_CR14","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/s10559-012-9417-8","volume":"48","author":"VA Emelichev","year":"2012","unstructured":"Emelichev VA, Korotkov VV (2012) Stability radius of a vector investment problem with Savage\u2019s minimax risk criteria. Cybern Syst Anal 48(3):378\u2013386","journal-title":"Cybern Syst Anal"},{"issue":"5","key":"338_CR15","first-page":"1040","volume":"297","author":"EN Gordeev","year":"1987","unstructured":"Gordeev EN (1987) Polynomial algorithms for computing the stability radius for two classes of selection problems. Reports of the USSR Academy of Sciences. 297(5):1040\u20131043","journal-title":"Reports of the USSR Academy of Sciences."},{"issue":"3","key":"338_CR16","first-page":"39","volume":"1","author":"EN Gordeev","year":"1989","unstructured":"Gordeev EN (1989) Stability of a solution in a problem on the shortest path on a graph. Discret Math 1(3):39\u201346","journal-title":"Discret Math"},{"issue":"1","key":"338_CR17","first-page":"66","volume":"36","author":"EN Gordeev","year":"1996","unstructured":"Gordeev EN, Leontiev VK (1996) A general approach to studying solution stability in discrete optimization problems. Comput Math Math Phys 36(1):66\u201372","journal-title":"Comput Math Math Phys"},{"issue":"2","key":"338_CR18","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s10957-015-0709-9","volume":"167","author":"VV Chistyakov","year":"2015","unstructured":"Chistyakov VV, Pardalos PM (2015) Stability analysis in discrete optimization involving generalized addition operations. J Optim Theory Appl 167(2):585\u2013616","journal-title":"J Optim Theory Appl"},{"issue":"4","key":"338_CR19","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/net.3230100402","volume":"10","author":"DR Shier","year":"1980","unstructured":"Shier DR, Witzgall C (1980) Arc tolerances in shortest path and network flow problems. Networks 10(4):277\u2013291","journal-title":"Networks"},{"issue":"2","key":"338_CR20","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1002\/net.3230130204","volume":"13","author":"D Gusfield","year":"1983","unstructured":"Gusfield D (1983) A note on arc tolerances in sparse shortest-path and network flow problems. Networks 13(2):191\u2013196","journal-title":"Networks"},{"issue":"1","key":"338_CR21","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/0020-0190(82)90137-5","volume":"14","author":"RE Tarjan","year":"1982","unstructured":"Tarjan RE (1982) Sensitivity analysis of minimum spanning trees and shortest path trees. Inf Process Lett 14(1):30\u201333","journal-title":"Inf Process Lett"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00338-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-024-00338-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00338-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T13:07:56Z","timestamp":1728565676000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-024-00338-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,29]]},"references-count":21,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,9]]}},"alternative-id":["338"],"URL":"https:\/\/doi.org\/10.1007\/s43069-024-00338-4","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2024,6,29]]},"assertion":[{"value":"29 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"55"}}