Robust and Adaptive Network Flows
From MaRDI portal
Publication:5166277
DOI10.1287/opre.2013.1200zbMath1291.90046OpenAlexW2133182510MaRDI QIDQ5166277
Ebrahim Nasrabadi, Sebastian Stiller, Dimitris J. Bertsimas
Publication date: 26 June 2014
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/71327793446fc6ff3af0629c1cbac11330dd8b48
Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15)
Related Items (23)
Probability Distributions on Partially Ordered Sets and Network Interdiction Games ⋮ An iterative security game for computing robust and adaptive network flows ⋮ A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty ⋮ On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems ⋮ Robust flows with adaptive mitigation ⋮ Design of survivable wireless backhaul networks with reliability considerations ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ Minimizing recovery cost of network optimization problems ⋮ Robust capacitated Steiner trees and networks with uniform demands ⋮ Shortest path network interdiction with asymmetric uncertainty ⋮ Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints ⋮ Rerouting Flows when Links Fail ⋮ A robust signal control system for equilibrium flow under uncertain travel demand and traffic delay ⋮ Complexity of strict robust integer minimum cost flow problems: an overview and further results ⋮ Protection of flows under targeted attacks ⋮ Bilevel model for adaptive network flow problem ⋮ Parametric multiroute flow and its application to multilink-attack network ⋮ Robust flows over time: models and complexity results ⋮ On the power of randomization in network interdiction ⋮ The complexity of computing a robust flow ⋮ Impact of compressor failures on gas transmission network capability ⋮ A decomposition approach for stochastic shortest-path network interdiction with goal threshold ⋮ Designing networks with resiliency to edge failures using two-stage robust optimization
This page was built for publication: Robust and Adaptive Network Flows
