Robust and adaptive network flows

DOI10.1287/OPRE.2013.1200zbMATH Open1291.90046OpenAlexW2133182510MaRDI QIDQ5166277FDOQ5166277

Authors Ebrahim Nasrabadi, Sebastian Stiller, Dimitris 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

zbMATH Keywords

game theorynetwork flowsrobust optimizationflows over time

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15)

Recommendations

• Robust flows over time: models and complexity results
• On robust maximum flow with polyhedral uncertainty sets
• Robust capacity expansion of network flows
• An iterative security game for computing robust and adaptive network flows
• Bilevel model for adaptive network flow problem

Cited in

(32)

• An iterative security game for computing robust and adaptive network flows
• Design of survivable wireless backhaul networks with reliability considerations
• On the power of randomization in network interdiction
• Rerouting Flows when Links Fail
• A \((B + 1)\)-approximation for network flow interdiction with unit costs
• Impact of compressor failures on gas transmission network capability
• Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
• Robust flows with adaptive mitigation
• Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption
• Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
• Complexity of strict robust integer minimum cost flow problems: an overview and further results
• Protection of flows under targeted attacks
• Designing networks with resiliency to edge failures using two-stage robust optimization
• Mean‐standard deviation model for minimum cost flow problem
• On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems
• Minimizing recovery cost of network optimization problems
• Robust capacitated Steiner trees and networks with uniform demands
• A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty
• On robust maximum flow with polyhedral uncertainty sets
• Polynomial-time identification of robust network flows under uncertain arc failures
• A decomposition approach for stochastic shortest-path network interdiction with goal threshold
• Shortest path network interdiction with asymmetric uncertainty
• Bilevel model for adaptive network flow problem
• Robust Fluid Processing Networks
• Probability Distributions on Partially Ordered Sets and Network Interdiction Games
• Robust minimum cost flow problem under consistent flow constraints
• A robust signal control system for equilibrium flow under uncertain travel demand and traffic delay
• Robust flows over time: models and complexity results
• Parametric multiroute flow and its application to multilink-attack network
• Rerouting flows when links fail
• Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions
• The complexity of computing a robust flow

This page was built for publication: Robust and adaptive network flows

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