An exact algorithm for a multicommodity min-cost flow over time problem
From MaRDI portal
Recommendations
- Maximum multicommodity flows over time without intermediate storage
- Minimum cost paths over dynamic networks
- scientific article; zbMATH DE number 2038726
- The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
- Minimum cost multicommodity flows in dynamic networks and algorithms for their findings
Cites work
- scientific article; zbMATH DE number 2079322 (Why is no real title available?)
- An introduction to network flows over time
- Cheapest paths in dynamic networks
- Constructing maximal dynamic flows from static flows
- Minimum cost paths over dynamic networks
- Minimum-cost dynamic flows: The series-parallel case
- Multicommodity flows over time: Efficient algorithms and complexity
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Quickest Flows Over Time
Cited in
(6)- A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
- Branch-and-cut for a 2-commodity flow relocation model with time constraints
- Algorithmic approach to time-cost analysis of queued commodity flowing through critical path
- Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
- Cost minimizing planning of container inspection and repair in multiple facilities
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
This page was built for publication: An exact algorithm for a multicommodity min-cost flow over time problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742211)
