کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482302 | 1446187 | 2007 | 21 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Subadditive approaches in integer programming
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Subadditive approaches in integer programming Subadditive approaches in integer programming](/preview/png/482302.png)
چکیده انگلیسی
Linear programming duality is well understood and the reduced cost of a column is frequently used in various algorithms. On the other hand, for integer programs it is not clear how to define a dual function even though the subadditive dual theory has been developed a long time ago. In this work we propose a family of computationally tractable subadditive dual functions for integer programs. We develop a solution methodology that computes an optimal primal solution and an optimal subadditive dual function. We present computational experiments, which show that the new algorithm is tractable.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 183, Issue 2, 1 December 2007, Pages 525–545
Journal: European Journal of Operational Research - Volume 183, Issue 2, 1 December 2007, Pages 525–545
نویسندگان
Diego Klabjan,