Parametric multiroute flow and its application to multilink-attack network

DOI10.1016/j.disopt.2016.05.002zbMath1387.90044OpenAlexW2399886052MaRDI QIDQ1751172

Hidefumi Hiraishi, Jean-François Baffier, Hiroshi Imai, Vorapong Suppakitpaisarn

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2016.05.002

zbMATH Keywords

parametric optimizationapproximation algorithmnetwork flownetwork interdictionmultiroute flowgraph and network algorithm

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Deterministic network models in operations research (90B10)

Related Items (1)

The complexity of computing a robust flow

Cites Work

• Unnamed Item
• Unnamed Item
• On robust maximum flow with polyhedral uncertainty sets
• Parametric shortest path algorithms with an application to cyclic staffing
• On the power of randomization in network interdiction
• Deterministic network interdiction
• Multi-terminal multipath flows: synthesis
• The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
• Flows over edge-disjoint mixed multipaths and applications
• On multiroute maximum flows in networks
• Impact of a varying capacity on the all pairs 2-route network flows
• Parametric Multiroute Flow and Its Application to Robust Network with $$k$$ Edge Failures
• Maximal Flow Through a Network
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
• Robust and Adaptive Network Flows
• The network inhibition problem
• The multiroute maximum flow problem revisited
• Max flows in O(nm) time, or better
• Removing Arcs from a Network
• A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow

This page was built for publication: Parametric multiroute flow and its application to multilink-attack network