Time-varying minimum cost flow problems

DOI10.1016/S0377-2217(00)00059-XzbMath0991.90016MaRDI QIDQ5935419

No author found.

Publication date: 8 September 2002

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

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)

Related Items

Optimal 4-D aircraft trajectories in a contrail-sensitive environment, Efficient contraflow algorithms for quickest evacuation planning, Generalized minimal cost flow problem in fuzzy nature: an application in bus network planning problem, A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs, Algorithms for Finding Optimal Flows in Dynamic Networks, Unnamed Item, Updating network flows given multiple, heterogeneous arc attribute changes, 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, Combinatorial algorithms for the minimum interval cost flow problem, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum Convex Cost Dynamic Network Flows
• A forward network simplex algorithm for solving multiperiod network flow problems
• Time-varying shortest path problems with constraints