A multiplier adjustment method for the generalized assignment problem
Management Science
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
A genetic algorithm for the generalised assignment problem
Computers and Operations Research
A dynamic tabu search for large-scale generalised assignment problems
Computers and Operations Research
Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach
INFORMS Journal on Computing
An Ejection Chain Approach for the Generalized Assignment Problem
INFORMS Journal on Computing
An LP-based heuristic procedure for the generalized assignment problem with special ordered sets
Computers and Operations Research
Multicriteria assignment problem (selection of access points)
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
| Hi-index | 0.00 |
The generalized assignment problem (GAP), the 0--1 integer programming (IP) problem of assigning a set of n items to a set of m knapsacks, where each item must be assigned to exactly one knapsack and there are constraints on the availability of resources for item assignment, has been further generalized recently to include cases where items may be shared by a pair of adjacent knapsacks. This problem is termed the generalized assignment problem with special ordered sets of type 2 (GAPS2). For reasonably large values of m and n the NP-hard combinatorial problem GAPS2 becomes intractable for standard IP software, hence there is a need for the development of heuristic algorithms to solve such problems. It will be shown how a heuristic algorithm developed previously for the GAP problem can be modified and extended to solve GAPS2. Encouraging results, in terms of speed and accuracy, have been achieved.