کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482485 | 1446214 | 2006 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems](/preview/png/482485.png)
چکیده انگلیسی
In this paper, we describe a dynamic programming approach to solve optimally the single-source uncapacitated minimum cost network flow problem with general concave costs. This class of problems is known to be NP-Hard and there is a scarcity of methods to solve them in their full generality. The algorithms previously developed critically depend on the type of cost functions considered and on the number of nonlinear arc costs. Here, a new dynamic programming approach that does not depend on any of these factors is proposed. Computational experiments were performed using randomly generated problems. The computational results reported for small and medium size problems indicate the effectiveness of the proposed approach.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 174, Issue 2, 16 October 2006, Pages 1205–1219
Journal: European Journal of Operational Research - Volume 174, Issue 2, 16 October 2006, Pages 1205–1219
نویسندگان
Dalila B.M.M. Fontes, Eleni Hadjiconstantinou, Nicos Christofides,