عرض بسيط للتسجيلة

المؤلفGhoniem, Ahmed
المؤلفFlamand, Tulay
المؤلفHaouari, Mohamed
تاريخ الإتاحة2021-09-07T06:16:17Z
تاريخ النشر2016
اسم المنشورINFORMS Journal on Computing
المصدرScopus
الرقم المعياري الدولي للكتاب10919856
معرّف المصادر الموحدhttp://dx.doi.org/10.1287/ijoc.2016.0700
معرّف المصادر الموحدhttp://hdl.handle.net/10576/22795
الملخصWe investigate modeling approaches and exact solution methods for a generalized assignment problem with location/allocation (GAPLA) considerations. In contrast with classical generalized assignment problems, each knapsack in GAPLA is discretized into consecutive segments having different levels of attractiveness. To maximize a total reward function, the decision maker decides not only about item knapsack assignments, but also the specific location of items within their assigned knapsacks and their total space allocation within prespecified lower and upper bounds. Mathematical programming formulations are developed for single and multiple knapsack variants of this problem along with valid inequalities, preprocessing routines, and model enhancements. Further, a branch-and-price algorithm is devised for a set partitioning reformulation of GAPLA, and is demonstrated to yield substantial computational savings over solving the original formulation using branch-and-bound/cut solvers such as CPLEX over challenging problem instances. 2016 INFORMS.
اللغةen
الناشرINFORMS Inst.for Operations Res.and the Management Sciences
الموضوعBranch and price
Column generation
Generalized assignment problems
Mixed-integer programming
العنوانExact solution methods for a generalized assignment problem with location/allocation considerations
النوعArticle
الصفحات589-602
رقم العدد3
رقم المجلد28
dc.accessType Abstract Only


الملفات في هذه التسجيلة

الملفاتالحجمالصيغةالعرض

لا توجد ملفات لها صلة بهذه التسجيلة.

هذه التسجيلة تظهر في المجموعات التالية

عرض بسيط للتسجيلة