An FPTAS for quickest multicommodity flows with inflow-dependent transit times
From MaRDI portal
Publication:878444
DOI10.1007/s00453-006-0196-3zbMath1122.68153OpenAlexW1517764537MaRDI QIDQ878444
Publication date: 26 April 2007
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/record/315349/files/453_2006_Article_196.pdf
Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)
Related Items (4)
A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ Unnamed Item ⋮ Universal Packet Routing with Arbitrary Bandwidths and Transit Times ⋮ Traffic Networks and Flows over Time
This page was built for publication: An FPTAS for quickest multicommodity flows with inflow-dependent transit times
