An algorithm for the min concave cost flow problem
type: Item
instance of: scholarly article
title: An algorithm for the min concave cost flow problem
zbMATH Open document ID: 0439.90092
DOI: 10.1016/0377-2217(80)90109-5
author: Giorgio Gallo
author: Claudio Sandi
author: Claudio Sodini
published in: European Journal of Operational Research
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3687122
zbMATH Keywords: min concave cost flow problem
zbMATH Keywords: network flow problems
zbMATH Keywords: concave costs
zbMATH Keywords: global optimum
zbMATH Keywords: branch and bound procedure
zbMATH Keywords: linear relaxations
zbMATH Keywords: lower bounds
zbMATH Keywords: one source-multiple destination problem
MaRDI profile type: Publication
full work available at URL: 0377-2217(80)90109-5
OpenAlex ID: W1996431511
cites work: Q4083324
cites work: Adjacent extreme flows and application to min concave cost flow problems
cites work: Optimal Facility Location with Concave Costs
cites work: Minimum cost routing for static network models
cites work: On building minimum cost communication networks
cites work: On building minimum cost communication networks over time
cites work: Minimum Concave Cost Flows in Certain Networks
description: scientific article; zbMATH DE number 3687122