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

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

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)

Cited In (29)

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

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)