Pages that link to "Item:Q839810"
From MaRDI portal
The following pages link to Polynomial-time identification of robust network flows under uncertain arc failures (Q839810):
Displaying 12 items.
- Information theory perspective on network robustness (Q341919) (← links)
- On risk-averse maximum weighted subgraph problems (Q405680) (← links)
- Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios (Q513625) (← links)
- Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs (Q895762) (← links)
- Cooperative maximum-flow problem under uncertainty in logistic networks (Q902866) (← links)
- Complexity of strict robust integer minimum cost flow problems: an overview and further results (Q1725614) (← links)
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures (Q1945698) (← links)
- Shortest path network problems with stochastic arc weights (Q2230798) (← links)
- Designing networks with resiliency to edge failures using two-stage robust optimization (Q2315627) (← links)
- On Strategic Defense in Stochastic Networks (Q5420645) (← links)
- Conditional value‐at‐risk beyond finance: a survey (Q6090467) (← links)
- Risk‐averse optimization and resilient network flows (Q6139370) (← links)
