Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle

DOI10.1007/s11590-019-01519-5zbMath1466.90115OpenAlexW2996743959WikidataQ126594400 ScholiaQ126594400MaRDI QIDQ828730

Salman Khodayifar

Publication date: 5 May 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-019-01519-5

zbMATH Keywords

combinatorial optimizationminimum cost flow problem(dynamic) multicommoditydecomposition principle

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

Minimum‐cost flow problems having arc‐activation costs, Cost minimizing planning of container inspection and repair in multiple facilities

Uses Software

• GAMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum flow problem on network flows with time-varying bounds
• Dynamic shortest path problems with time-varying costs
• A survey of dynamic network flows
• The energy-constrained quickest path problem
• 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
• Multicommodity flows over time: Efficient algorithms and complexity
• An Introduction to Network Flows over Time
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Optimal Dynamic Multicommodity Flows in Networks
• Minimum-cost dynamic flows: The series-parallel case
• Paths in graphs
• Constructing Maximal Dynamic Flows from Static Flows
• Quickest Flows Over Time