Title

A Linear Relaxation Heuristic for the Generalized Assignment Problem

Date of Original Version

3-1991

Type

Article

Abstract or Description

We examine 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.

DOI

10.1002/1520-6750(199203)39:2<137::AID-NAV3220390202>3.0.CO;2-D

This document is currently not available here.

Share

COinS
 

Published In

Naval Research Logistics, 39, 2, 137-151.