Concave cost minimization on networks

DOI10.1016/0377-2217(79)90144-9zbMath0405.90079OpenAlexW1973312272MaRDI QIDQ1257417

Claudio Sodini, Giorgio Gallo

Publication date: 1979

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(79)90144-9

zbMATH Keywords

Convex ProgrammingNetwork ProgrammingComputational StudyFeasible Direction MethodsLocal MinimaMulti-Commodity Flow ProblemsNetwork DesignNetwork Flow OptimizationVertex Following Algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Related Items (3)

A Lagrangean heuristic for the capacitated concave minimum cost network flow problem ⋮ Resource downgrading ⋮ The interactive fixed charge inhomogeneous flows optimization problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extreme points and adjacency relationship in the flow polytope
• Adjacent extreme flows and application to min concave cost flow problems
• An Approach to Locational Analysis
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• On building minimum cost communication networks
• Optimal Facility Location with Concave Costs
• On building minimum cost communication networks over time
• Concave minimization over a convex polyhedron
• Minimum Concave Cost Flows in Certain Networks
• Minimum cost routing for static network models
• Solving the Fixed Charge Problem by Ranking the Extreme Points

This page was built for publication: Concave cost minimization on networks