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

Celý popis

Podrobná bibliografia

Vydané v:	Optimization Ročník 32; číslo 1; s. 23 - 43
Hlavní autori:	Tuy, H., Ghannadan, S., Migdalas, A., VÄrbrand, P.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Gordon and Breach Science Publishers 01.01.1995
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!