Concave cost minimization on networks
type: Item
instance of: scholarly article
title: Concave cost minimization on networks
zbMATH Open document ID: 0405.90079
DOI: 10.1016/0377-2217(79)90144-9
published in: European Journal of Operational Research
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 3630511
zbMATH Keywords: Convex Programming
zbMATH Keywords: Network Programming
zbMATH Keywords: Computational Study
zbMATH Keywords: Network Design
zbMATH Keywords: Network Flow Optimization
zbMATH Keywords: Local Minima
zbMATH Keywords: Multi-Commodity Flow Problems
zbMATH Keywords: Feasible Direction Methods
zbMATH Keywords: Vertex Following Algorithms
author: Giorgio Gallo
author: Claudio Sodini
MaRDI profile type: Publication
full work available at URL: 0377-2217(79)90144-9
OpenAlex ID: W1973312272
cites work: Q4773298
cites work: Q4083324
cites work: An Approach to Locational Analysis
cites work: Q5627898
cites work: Extreme points and adjacency relationship in the flow polytope
cites work: Adjacent extreme flows and application to min concave cost flow problems
cites work: Q5342287
cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points
cites work: Q4039868
cites work: Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
cites work: Q5650538
cites work: Optimal Facility Location with Concave Costs
cites work: Concave minimization over a convex polyhedron
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
cites work: Q5638112
description: scientific article; zbMATH DE number 3630511