Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks.

DOI10.1023/A:1008379621400zbMath1073.90059MaRDI QIDQ5929388

Rainer E. Burkard, Phan Thien Thach, Helidon Dollani

Publication date: 14 June 2001

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

Dynamic programmingConvergenceConcave costsLinear approximationUncapacitated single-source acyclic networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Related Items (6)

Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks ⋮ On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope ⋮ Fractional routing using pairs of failure-disjoint paths ⋮ Lower bounds from state space relaxations for concave cost network flow problems ⋮ A branch-and-bound algorithm for concave network flow problems ⋮ A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems

This page was built for publication: Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks.