Upper bounds for single-source uncapacitated concave minimum-cost network flow problems

DOI10.1002/net.10076zbMath1035.90006OpenAlexW2028827726MaRDI QIDQ4419278

Eleni Hadjiconstantinou, Dalila B. M. M. Fontes, Nicos Christofides

Publication date: 31 July 2003

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10076

zbMATH Keywords

heuristicslocal searchconcave-cost optimizationminimum-cost network flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items

A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks ⋮ Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks ⋮ A deterministic annealing algorithm for the minimum concave cost network flow problem ⋮ Lower bounds from state space relaxations for concave cost network flow problems ⋮ A branch-and-bound algorithm for concave network flow problems ⋮ The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach ⋮ A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems

Uses Software

• CPLEX