2008Journal of Qingdao UniversityRequires access

Dynamic Minimum Cost Flow Problems

Yufeng Zhang

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Minimum-cost flow problem, Flow (mathematics), Maximum flow problem, Mathematical optimization, Flow network, Computer science, Arc (geometry), Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Dynamic Minimum Cost Flow Problems — Research Paper | ScholarLens