Uncapacitated minimum cost flow problemsin a distribution network
碩士 === 國立成功大學 === 工業與資訊管理學系碩博士班 === 93 === In this thesis, we consider three special minimum cost flow problems in a distri- bution network, a kind of manufacturing network recently introduced by Fang and Qi. The network diRers from a traditional network model because a new kind of nodes, called D-n...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Online Access: | http://ndltd.ncl.edu.tw/handle/cbtugk |
| Summary: | 碩士 === 國立成功大學 === 工業與資訊管理學系碩博士班 === 93 === In this thesis, we consider three special minimum cost flow problems in a distri-
bution network, a kind of manufacturing network recently introduced by Fang and Qi.
The network diRers from a traditional network model because a new kind of nodes,
called D-nodes, are incorporated to describe a distilling operation that decomposes one
raw-material to several products with fixed ratios. Besides, all the arcs in our models
have no upper bounds. We treat these uncapacitated minimum cost flow problems as
specialized shortest path problems with side constraints in a distribution network. We
give a preprocessing that compacts a distribution network to an equivalent network
of smaller size, derive their mathematical formulations and develop e±cient solution
methods.
|
|---|