Show simple item record

AuthorGhoniem, Ahmed
AuthorFlamand, Tulay
AuthorHaouari, Mohamed
Available date2021-09-07T06:16:17Z
Publication Date2016
Publication NameINFORMS Journal on Computing
ResourceScopus
ISSN10919856
URIhttp://dx.doi.org/10.1287/ijoc.2016.0700
URIhttp://hdl.handle.net/10576/22795
AbstractWe 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.
Languageen
PublisherINFORMS Inst.for Operations Res.and the Management Sciences
SubjectBranch and price
Column generation
Generalized assignment problems
Mixed-integer programming
TitleExact solution methods for a generalized assignment problem with location/allocation considerations
TypeArticle
Pagination589-602
Issue Number3
Volume Number28
dc.accessType Abstract Only


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record