In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming.

The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems ...

Abstract. In this paper we obtain Lower Bounds (LBs) to concave cost network flow prob- lems. The LBs are derived from state space relaxations of a dynamic ...

Apr 27, 2024 · The BB algorithm presented here can be used to solve optimally single source uncapacitated minimum cost NFPs with any kind of concave arc costs.

These lower bounds are used in the bounding phase of a branch-and-bound procedure that is developed in (Fontes et al, 2006a) in order to solve SSU concave ...

Christofides, Lower bounds from state space relaxations for concave network flow problems, J. Glob. Optim., 34 (2006), 97-125. [11] S. Forjanis, B.W. Lamar ...

no more moves can improve its cost, and thus the optimal solution has been found. Lower bounds for SSU concave MCNFPs, derived from state space relaxations, are ...

This paper gives a survey of a general relaxation procedure whereby the state-space associated with a given dynamic programming recursion is relaxed in such ...

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problemsmore. by Nicos Christofides and Dalila Fontes. In this paper we obtain Lower ...

In this paper a Branch-and-Bound (BB) algorithm is developed to obtain an optimal solution to the single source uncapacitated minimum cost Network Flow ...