کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10347634 | 699252 | 2012 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A Lagrangian approach for minimum cost single round robin tournaments
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Single round robin tournaments are a well known class of sports leagues schedules. We consider leagues with a set T of n teams where n is even. Costs are associated to each match and period. Since matches are carried out at one of the both opponents venues matches may be forbidden in certain periods due to unavailability of stadiums. The goal is to find a minimum cost tournament among those having no match scheduled infeasible. We employ a Lagrangian relaxation approach in order to obtain tight lower bounds. Moreover, we develop a cost-oriented repair mechanism yielding a feasible tournament schedule to each solution of the relaxed problem.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 39, Issue 3, March 2012, Pages 718-727
Journal: Computers & Operations Research - Volume 39, Issue 3, March 2012, Pages 718-727
نویسندگان
Dirk Briskorn, Andrei Horbach,