Time-varying minimum cost flow problems

DOI10.1016/S0377-2217(00)00059-XMaRDI QIDQ5935419zbMATH OpenFDO

Authors Xiaoqiang Cai, D. Sha, C. K. Wong

Publication date 8 September 2002

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0377-2217(00)00059-X

zbMATH Keywords

dynamic programmingminimum cost flowtime-varying network

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Recommendations

• Minimum cost time-varying network flow problems
• scientific article; zbMATH DE number 1918689
• scientific article; zbMATH DE number 1488014
• Determining minimum cost flows in dynamic networks with transit time functions that depend on flow and time
• A polynomial time algorithm for the minimum flow problem in time-varying networks

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• A forward network simplex algorithm for solving multiperiod network flow problems
• Minimum Convex Cost Dynamic Network Flows
• Network flows. Theory, algorithms, and applications.
• Time-varying shortest path problems with constraints

Cited in

(18)

• Minimum flow problem on network flows with time-varying bounds
• Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
• Minimum cost time-varying network flow problems
• scientific article; zbMATH DE number 3906196 (Why is no real title available?)
• A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
• A polynomial time algorithm for the minimum flow problem in time-varying networks
• Flows over time in time-varying networks: optimality conditions and strong duality
• Efficient contraflow algorithms for quickest evacuation planning
• Combinatorial algorithms for the minimum interval cost flow problem
• A critical survey on the network optimization algorithms for evacuation planning problems
• Time-varying universal maximum flow problems
• Modular circulation and applications to traffic management
• Algorithms for finding optimal flows in dynamic networks
• scientific article; zbMATH DE number 6913891 (Why is no real title available?)
• Updating network flows given multiple, heterogeneous arc attribute changes
• Optimal 4-D aircraft trajectories in a contrail-sensitive environment
• Generalized minimal cost flow problem in fuzzy nature: an application in bus network planning problem
• Minimum cost noncrossing flow problem on layered networks

This page was built for publication: Time-varying minimum cost flow problems

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