On minimum concave cost network flow problems

• Tipo: Artigo em Revista Científica Internacional
• Data: 2008

Autores

Dalila B.M.M. Fontes (Autor) FEP

Revista

Título: International Journal of Pure and Applied Mathematics

Vol. 49 Nº 4

Páginas: 517-524

ISSN: 1311-8080

Editora: Academic Publications Ltd

Classificação Científica

FOS: Ciências sociais > Economia e gestão

CORDIS: Ciências Físicas > Matemática > Matemática aplicada > Investigação operacional ; Ciências Sociais > Economia > Estudos de gestão > Gestão industrial ; Ciências Sociais > Economia > Estudos de gestão > Gestão de transportes

Outras Informações

Abstract (EN): Minimum concave Cost Network Flow Problems (MCNFPs) arise naturally in many practical applications such as communication, transportation, distribution, and manufacturing, due to economic considerations. In addition, it has been shown that every MCNFP with general nonlinear cost functions can be transformed into a concave MCNFP on an expanded network. It must also be noted, that multiple source and capacitated networks can be transformed into single source and uncapacitated networks. The main feature defining the complexity of MCNFPs is the type of cost function for each arc. Concave MCNFPs are known to be NP-hard even for the simplest version (i.e. fixed-charge single source and uncapacitated). The review presented in this work describes several approaches to the design of Single Source Uncapacitated (SSU) flow networks involving concave costs.

Idioma: Inglês

Tipo (Avaliação Docente): Científica