کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
479106 | 1446193 | 2007 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Solving the maximum edge weight clique problem via unconstrained quadratic programming
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Solving the maximum edge weight clique problem via unconstrained quadratic programming Solving the maximum edge weight clique problem via unconstrained quadratic programming](/preview/png/479106.png)
چکیده انگلیسی
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience reported in the literature with several problem classes has demonstrated that this approach works surprisingly well in terms of solution quality and computational times, often rivaling and sometimes surpassing more traditional methods. In this paper we report on the application of UQP to the maximum edge-weighted clique problem. Computational experience is reported illustrating the attractiveness of the approach.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 181, Issue 2, 1 September 2007, Pages 592–597
Journal: European Journal of Operational Research - Volume 181, Issue 2, 1 September 2007, Pages 592–597
نویسندگان
Bahram Alidaee, Fred Glover, Gary Kochenberger, Haibo Wang,