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

Uloženo v:
Podrobná bibliografie
Vydáno v:Optimization Ročník 32; číslo 1; s. 23 - 43
Hlavní autoři: Tuy, H., Ghannadan, S., Migdalas, A., VÄrbrand, P.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Gordon and Breach Science Publishers 01.01.1995
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 solved by efficient strongly polynomial time algorithms. More specifically, the algorithms developed have running times polynomial in the number of nodes and arcs and the number of sinks
ISSN:0233-1934
1029-4945
1029-4945
DOI:10.1080/02331939508844033