Minimum cost time-varying network flow problems

DOI10.1080/10556780903239121MaRDI QIDQ3562412zbMATH OpenOpenAlexFDO

Authors Ebrahim Nasrabadi, S. Mehdi Hashemi

Publication date 21 May 2010

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556780903239121

zbMATH Keywords

minimum cost dynamic flownetwork flowsshortest dynamic pathtime-varying networks

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Time-varying minimum cost flow problems
• scientific article; zbMATH DE number 1918689
• The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
• A polynomial time algorithm for the minimum flow problem in time-varying networks
• Minimum cost multicommodity flows in dynamic networks and algorithms for their findings

Cited in

(27)

• Efficient contraflow algorithms for quickest evacuation planning
• A polynomial time algorithm for the minimum flow problem in time-varying networks
• Algorithmic approach to time-cost analysis of queued commodity flowing through critical path
• Flows over time in time-varying networks: optimality conditions and strong duality
• The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
• An approximation algorithm for discrete minimum cost flows over time problem
• A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
• The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks
• Dynamic flows in time-varying networks.
• scientific article; zbMATH DE number 5990494 (Why is no real title available?)
• Finding minimum cost to time ratio cycles with small integral transit times
• Minimum cost paths over dynamic networks
• Minimum Convex Cost Dynamic Network Flows
• Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
• A continuous-time network simplex algorithm
• scientific article; zbMATH DE number 2079322 (Why is no real title available?)
• Minimum-cost dynamic flows: The series-parallel case
• scientific article; zbMATH DE number 1918689 (Why is no real title available?)
• Optimal Rounding of Instantaneous Fractional Flows Over Time
• On solving continuous-time dynamic network flows
• Minimum parametric flow in time-dependent dynamic networks
• scientific article; zbMATH DE number 6913891 (Why is no real title available?)
• A Min Cost Flow Solution for Dynamic Assignment Problems in Networks with Storage Devices
• Minimum cost multicommodity flows in dynamic networks and algorithms for their findings
• Time-varying minimum cost flow problems
• Minimum flow problem on network flows with time-varying bounds
• Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle

This page was built for publication: Minimum cost time-varying network flow problems

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