A linear relaxation heuristic for the generalized assignment problem

A linear relaxation heuristic for the generalized assignment problem

0.00 Avg rating0 Votes
Article ID: iaor19921916
Country: United States
Volume: 39
Issue: 2
Start Page Number: 137
End Page Number: 151
Publication Date: Mar 1992
Journal: Naval Research Logistics
Authors:
Keywords: programming: network
Abstract:

The paper examines the basis structure of the linear relaxation of the generalized assignment problem. The basis gives a surprising amount of information. This leads to a very simple heuristic that uses only generalized network optimization codes. Lower bounds can be generated by cut generation, where the violated inequalities are found directly from the relaxation basis. An improvement heuristic with the same flavor is also presented.

Reviews

Required fields are marked *. Your email address will not be published.