An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem

DOI10.1287/mnsc.18.3.184zbMath0238.90075OpenAlexW2151525839MaRDI QIDQ5650540

Pierre N. Robillard, Michael Florian

Publication date: 1971

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.18.3.184

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (11)

A Lagrangean heuristic for the capacitated concave minimum cost network flow problem ⋮ Enumerative techniques for solving some nonconvex global optimization problems ⋮ On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope ⋮ Minimizing a sum of staircase functions under linear constraints ⋮ Networks synthesis and optimum network design problems: Models, solution methods and applications ⋮ Unnamed Item ⋮ An improved branch and bound algorithm for minimum concave cost network flow problems ⋮ Global search algorithms for minimum concave-cost network flow problems ⋮ Minimum concave-cost network flow problems: Applications, complexity, and algorithms ⋮ The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs ⋮ Strongly polynomial algorithm for two special minimum concave cost network flow problems

This page was built for publication: An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem