Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
type: Item
instance of: scholarly article
title: Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
zbMATH Open document ID: 1466.90115
author: Salman Khodayifar
published in: Optimization Letters
publication date: 2021-05-05T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7343994
zbMATH Keywords: minimum cost flow problem
zbMATH Keywords: (dynamic) multicommodity
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: decomposition principle
describes a project that uses: GAMS
MaRDI profile type: Publication
full work available at URL: s11590-019-01519-5
OpenAlex ID: W2996743959
Wikidata QID: Q126594400
cites work: Q3056948
cites work: A survey of dynamic network flows
cites work: Q3998396
cites work: Paths in graphs
cites work: The energy-constrained quickest path problem
cites work: Minimum flow problem on network flows with time-varying bounds
cites work: Quickest Flows Over Time
cites work: Q4471275
cites work: Q4737515
cites work: Encyclopedia of optimization. In 6 vols.
cites work: Constructing Maximal Dynamic Flows from Static Flows
cites work: Multicommodity flows over time: Efficient algorithms and complexity
cites work: Dynamic shortest path problems with time-varying costs
cites work: A polynomial time algorithm for the minimum flow problem in time-varying networks
cites work: Minimum-cost dynamic flows: The series-parallel case
cites work: Flows over time in time-varying networks: optimality conditions and strong duality
cites work: Optimal Dynamic Multicommodity Flows in Networks
cites work: Q5687194
cites work: An Introduction to Network Flows over Time
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
DOI: 10.1007/S11590-019-01519-5
description: scientific article; zbMATH DE number 7343994