Pages that link to "Item:Q4021823"
From MaRDI portal
The following pages link to Shortest path problems with node failures (Q4021823):
Displaying 16 items.
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function (Q1280137) (← links)
- Probabilistic combinatorial optimization problems on graphs: A new domain in operational research (Q1390342) (← links)
- The probabilistic minimum dominating set problem (Q1686054) (← links)
- On the probabilistic min spanning tree problem (Q1935723) (← links)
- Dynamic journeying under uncertainty (Q2253524) (← links)
- Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
- Finding the shortest path in stochastic networks (Q2459617) (← links)
- On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
- A fully polynomial time approximation scheme for the probability maximizing shortest path problem (Q2670558) (← links)
- The \(\alpha\)-reliable shortest path problem (Q2867322) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- The most likely path on series-parallel networks (Q3113510) (← links)
- A LOWER BOUND OF THE EXPECTED MAXIMUM NUMBER OF VERTEX-DISJOINT s-t PATHS ON PROBABILISTIC GRAPHS (Q4320147) (← links)
- Vertex-Uncertainty in Graph-Problems (Q5505652) (← links)
- A priori optimization for the probabilistic maximum independent set problem (Q5958320) (← links)
