The following pages link to Robust and Adaptive Network Flows (Q5166277):
Displaying 25 items.
- A robust signal control system for equilibrium flow under uncertain travel demand and traffic delay (Q1716465) (← links)
- Complexity of strict robust integer minimum cost flow problems: an overview and further results (Q1725614) (← links)
- Protection of flows under targeted attacks (Q1727948) (← links)
- Bilevel model for adaptive network flow problem (Q1742209) (← links)
- Parametric multiroute flow and its application to multilink-attack network (Q1751172) (← links)
- Robust flows over time: models and complexity results (Q1785195) (← links)
- On the power of randomization in network interdiction (Q1785482) (← links)
- The complexity of computing a robust flow (Q2294522) (← links)
- Impact of compressor failures on gas transmission network capability (Q2295182) (← links)
- A decomposition approach for stochastic shortest-path network interdiction with goal threshold (Q2311034) (← links)
- Designing networks with resiliency to edge failures using two-stage robust optimization (Q2315627) (← links)
- On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems (Q2423820) (← links)
- An iterative security game for computing robust and adaptive network flows (Q2669664) (← links)
- Probability Distributions on Partially Ordered Sets and Network Interdiction Games (Q5076709) (← links)
- Rerouting Flows when Links Fail (Q5128505) (← links)
- A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty (Q6103748) (← links)
- Robust flows with adaptive mitigation (Q6114899) (← links)
- Design of survivable wireless backhaul networks with reliability considerations (Q6164320) (← links)
- Mean‐standard deviation model for minimum cost flow problem (Q6179689) (← links)
- Minimizing recovery cost of network optimization problems (Q6179707) (← links)
- Robust capacitated Steiner trees and networks with uniform demands (Q6179720) (← links)
- Shortest path network interdiction with asymmetric uncertainty (Q6196902) (← links)
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints (Q6202946) (← links)
- Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption (Q6547016) (← links)
- A \((B + 1)\)-approximation for network flow interdiction with unit costs (Q6558673) (← links)
