Strongly polynomial algorithm for two special minimum concave cost network flow problems

We consider two special cases of the Minimum Concave Cost Network Flow Problem (MCCNFP);the single source uncapacitated MCCNFP where all arc costs, except two, are linear and the uncapacitated MCCNFP with 2 sources and 1 nonlinear arc cost. Due to their specific structure these problems can he solve...

Full description

Bibliographic Details

Published in:	Optimization Vol. 32; no. 1; pp. 23 - 43
Main Authors:	Tuy, H., Ghannadan, S., Migdalas, A., VÄrbrand, P.
Format:	Journal Article
Language:	English
Published:	Gordon and Breach Science Publishers 01.01.1995
Subjects:	Complexity Concave Minimization Global Optimization Industrial Logistics Industriell logistik Network Flow Problem Production-Transportation Problem Strongly Polynomial Time Algorithms
ISSN:	0233-1934, 1029-4945, 1029-4945
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!