The critical node problem in stochastic networks with discrete-time Markov chain

DOI10.17535/CRORR.2016.0003MaRDI QIDQ2966481zbMATH OpenOpenAlexFDO

Authors Mohsen Abdolhosseinzadeh, Gholam Hassan Shirdel

Publication date 7 March 2017

Published in Croatian operational research review (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.17535/crorr.2016.0003

zbMATH Keywords

critical node problemstochastic networkdiscrete-time Markov chainarrival probability

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Stochastic network models in operations research (90B15)

Recommendations

• Arrival probability in the stochastic networks with an established discrete time Markov chain
• A factoring approach for the stochastic shortest path problem
• Réseaux stochastiques
• scientific article; zbMATH DE number 4053318
• Finding the shortest path in stochastic networks

Cited in

(3)

• Multi server queuing model with dynamic power shifting and performance efficiency factor
• An analytical method for the analysis of inhomogeneous continuous Markov processes with piecewise constant transition intensities
• Arrival probability in the stochastic networks with an established discrete time Markov chain

This page was built for publication: The critical node problem in stochastic networks with discrete-time Markov chain

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