数学季刊（英文版）
數學季刊（英文版）
수학계간（영문판）
CHINESE QUARTERLY JOURNAL OF MATHEMATICS
2010年
1期
52-59
,共8页
branch-and-bound algorithm%transportation-production problem%Lagrangian relaxation
In this paper, a new algorithm relaxation-strategy-based modification branch-and-bound algorithm is developed for a type of solving the minimum cost transportation-production problem with concave production costs. The major improvement of the proposed new method is that modification algorithm reinforces the bounding operation using a La-grangian relaxation, which is a concave minimization but obtains a tighter bound than the usual linear programming relaxation. Some computational results are included. Computa-tion results indicate that the algorithm can solve fairly large scale problems.
