کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482958 | 1446226 | 2006 | 24 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem](/preview/png/482958.png)
چکیده انگلیسی
There appear to be two versions of the Dual Bin Packing problem in the literature. In addition, one of the versions has a counterpart in the cutting stock literature, known as the Skiving Stock Problem. This paper outlines branch-and-price algorithms for both. We introduce combinatorial upper bounds and well-performing heuristics from the literature in the branch-and-price framework. Extensive computational tests indicate that the branch-and-price approach is superior to the existing branch-and-bound procedures, based on combinatorial bounds. The tests illustrate the influence of different problem characteristics on the computation time and the limits of the branch-and-price approach.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 170, Issue 2, 16 April 2006, Pages 416–439
Journal: European Journal of Operational Research - Volume 170, Issue 2, 16 April 2006, Pages 416–439
نویسندگان
Marc Peeters, Zeger Degraeve,