Dynamic Minimum Cost Flow Problems
Yufeng Zhang
Abstract
Yufeng Zhang
Abstract
Considering of the time effect on each parameter in the minimum cost flow problem,this paper propses the definitions of each parameter and the model of the dynamic minimum cost flow problem.On suchdirected network, the flow can wait at any medial points for a period for of time;The capacityof arcs and medial points are time varying,The cost of the flow transmitting throw an arc are time varying too.It is introduced that the concept of dynamic minimum cost augmented chains,and proved some related theorems.At last,an algorithm is proposed to solve the dynamic minimum cost flow problem.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Considering of the time effect on each parameter in the minimum cost flow problem,this paper propses the definitions of each parameter and the model of the dynamic minimum cost flow problem.On suchdirected network, the flow can wait at any medial points for a period for of time;The capacityof arcs and medial points are time varying,The cost of the flow transmitting throw an arc are time varying too.It is introduced that the concept of dynamic minimum cost augmented chains,and proved some related theorems.At last,an algorithm is proposed to solve the dynamic minimum cost flow problem.
Key concepts: Minimum-cost flow problem, Flow (mathematics), Maximum flow problem, Mathematical optimization, Flow network, Computer science, Arc (geometry), Mathematics