Robust and adaptive network flows
From MaRDI portal
Publication:5166277
Recommendations
Cited in
(35)- 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
- On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems
- An iterative security game for computing robust and adaptive network flows
- Robust minimum cost flow problem under consistent flow constraints
- Robust Fluid Processing Networks
- Probability Distributions on Partially Ordered Sets and Network Interdiction Games
- Rerouting flows when links fail
- Rerouting Flows when Links Fail
- Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
- A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty
- Robust flows with adaptive mitigation
- Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions
- 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
- Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption
- A (B + 1)-approximation for network flow interdiction with unit costs
- Robust static and dynamic maximum flows
- Width helps and hinders splitting flows
- Width helps and hinders splitting flows
- On robust maximum flow with polyhedral uncertainty sets
- Polynomial-time identification of robust network flows under uncertain arc failures
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)
