کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10347577 | 699240 | 2013 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case](/preview/png/10347577.png)
چکیده انگلیسی
This work addresses the correction and improvement of Mavrotas and Diakoulaki's branch and bound algorithm for mixed 0-1 multiple objective linear programs. We first elaborate the issues encountered by the original algorithm and then propose a corrected version for the biobjective case using an exact representation of the nondominated set associated with an appropriate update procedure. Then we introduce several improvements using better bound sets and branching strategies and finally present some experiments to study the effectiveness of our propositions.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 40, Issue 1, January 2013, Pages 498-509
Journal: Computers & Operations Research - Volume 40, Issue 1, January 2013, Pages 498-509
نویسندگان
Thomas Vincent, Florian Seipp, Stefan Ruzika, Anthony Przybylski, Xavier Gandibleux,