scientific article; zbMATH DE number 2086912
From MaRDI portal
Publication:4737515
Recommendations
Cited in
(23)- Multicommodity network flows: a survey. I: Applications and formulations
- Minimum‐cost flow problems having arc‐activation costs
- Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
- An FPTAS for quickest multicommodity flows with inflow-dependent transit times
- Multicommodity flows over time: Efficient algorithms and complexity
- A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
- Algorithms for the quickest time distribution of dynamic stochastic-flow networks
- Optimal Dynamic Multicommodity Flows in Networks
- Maximum multicommodity flows over time without intermediate storage
- A critical survey on the network optimization algorithms for evacuation planning problems
- Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
- An FPTAS for quickest multicommodity flows with inflow-dependent transit times
- Quickest Flows Over Time
- Traffic Networks and Flows over Time
- A survey on models and algorithms for discrete evacuation planning network problems
- A heuristic algorithm for the earliest arrival flow with multiple sources
- Minimum-cost dynamic flows: The series-parallel case
- Speeding up Karmarkar's algorithm for multicommodity flows
- A tight bound on the speed-up through storage for quickest multi-commodity flows
- Scheduling algorithms for procrastinators
- Paths of bounded length and their cuts: parameterized complexity and algorithms
- Paths of bounded length and their cuts: parameterized complexity and algorithms
- Approximate algorithms for continuous-time quickest multi-commodity contraflow problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737515)
