Maximum multicommodity flows over time without intermediate storage

DOI10.1007/978-3-642-33090-2_47MaRDI QIDQ2912872zbMATH OpenOpenAlexFDO

Authors Martin Groß, Martin Skutella

Publication date 25 September 2012

Published in Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33090-2_47

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 2079322
• Quickest Flows Over Time
• Multicommodity flows over time: Efficient algorithms and complexity
• An FPTAS for quickest multicommodity flows with inflow-dependent transit times
• scientific article; zbMATH DE number 2086912

Cited in

(13)

• An exact algorithm for a multicommodity min-cost flow over time problem
• A tight bound on the speed-up through storage for quickest multi-commodity flows
• Abstract flows over time: a first step towards solving dynamic packing problems
• A decomposition-based approach for the multiperiod multiproduct distribution planning problem
• Multicommodity flows over time: Efficient algorithms and complexity
• An FPTAS for flows over time with aggregate arc capacities
• scientific article; zbMATH DE number 2038726 (Why is no real title available?)
• scientific article; zbMATH DE number 2079322 (Why is no real title available?)
• scientific article; zbMATH DE number 2086912 (Why is no real title available?)
• Quickest Flows Over Time
• On the approximability of time disjoint walks
• Generalized maximum flow over time with intermediate storage
• Distributionally robust chance-constrained multicommodity network flow problem in dynamic networks: a column-generation approach

This page was built for publication: Maximum multicommodity flows over time without intermediate storage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912872)