A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow
From MaRDI portal
Publication:5746246
DOI10.1007/978-3-319-04657-0_9zbMath1408.90292OpenAlexW183428525MaRDI QIDQ5746246
Jean-François Baffier, Vorapong Suppakitpaisarn
Publication date: 18 February 2014
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-04657-0_9
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (2)
Bilevel model for adaptive network flow problem ⋮ Parametric multiroute flow and its application to multilink-attack network
This page was built for publication: A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow