Polynomial-time identification of robust network flows under uncertain arc failures
type: Item
instance of: scholarly article
title: Polynomial-time identification of robust network flows under uncertain arc failures
zbMATH Open document ID: 1169.90323
author: Vladimir Boginski
author: Clayton W. Commander
author: Timofey Turko
published in: Optimization Letters
publication date: 2009-09-03T00:00:00Z
Mathematics Subject Classification ID: 90B15
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5601655
zbMATH Keywords: network flows
zbMATH Keywords: minimum cost flow problems
zbMATH Keywords: linear programming
zbMATH Keywords: robust optimization
zbMATH Keywords: quantitative risk measures
zbMATH Keywords: conditional value-at-risk
describes a project that uses: XPRESS
MaRDI profile type: Publication
full work available at URL: s11590-009-0125-x
OpenAlex ID: W2046849669
cites work: Q3056948
cites work: Maximizing residual flow under an arc destruction
cites work: Q4225395
cites work: Robust discrete optimization and network flows
cites work: Q3996777
cites work: The wireless network jamming problem
cites work: Minimum Cost Routing on Stochastic Networks
cites work: Stochastic network interdiction
cites work: Q3844775
cites work: Maximal Flow in a Multi-Terminal Network with Any One Arc Subject to Failure
cites work: Q4198056
cites work: A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
cites work: Q3730336
cites work: On the history of the transportation and maximum flow problems
cites work: Introduction to the theory of probabilistic functions and percentiles (value-at-risk)
DOI: 10.1007/S11590-009-0125-X
description: scientific article; zbMATH DE number 5601655