scientific article; zbMATH DE number 2086912
From MaRDI portal
Publication:4737515
zbMath1049.90106MaRDI QIDQ4737515
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2337/23370036.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle ⋮ Scheduling algorithms for procrastinators ⋮ 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 ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Paths of bounded length and their cuts: parameterized complexity and algorithms ⋮ Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks ⋮ A heuristic algorithm for the earliest arrival flow with multiple sources ⋮ A tight bound on the speed-up through storage for quickest multi-commodity flows ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ Traffic Networks and Flows over Time ⋮ Minimum-cost dynamic flows: The series-parallel case ⋮ Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms ⋮ Optimal Dynamic Multicommodity Flows in Networks
This page was built for publication:
