A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks |
| |
Authors: | Ufuk Bah?eci Orhan Feyziog?lu |
| |
Institution: | 1. Department of Industrial Engineering, Galatasaray University, ??rag?an Cad. No:36 Ortak?y, 34357, ?stanbul, Turkey
|
| |
Abstract: | In this study, we present a variant of the minimum cost network flow problem where the associated graph contains several disconnected subgraphs and it is required that the flows on arcs belonging to same arc subsets to be proportional. This type of network is mostly observed in large supply chains of assemble-to-order products. It is shown that any feasible solution of a reformulation of this problem has a special characteristic. By taking into account this fact, a network simplex based primal simplex algorithm is developed and its details are provided. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|