The Minimum Cost Network Flow Problem (MCNFP) includes a wide range of combinatorial optimization problems. Many applications exist for MCNFPs for instance supply chains, logistics, production planning, communications and transportations. Concave costs are, in many applications, more realistic...

Scientific literature is prolific both on exact and on heuristic solution methods developed to solve optimization problems. Although the former methods have an indisputable theoretical value when it comes to solve large realistic combinatorial optimization problems they are usually associated...