A facility location problem with aggregate capacity

A facility location problem with aggregate capacity

0.00 Avg rating0 Votes
Article ID: iaor1994856
Country: Canada
Volume: 31
Issue: 1
Start Page Number: 1
End Page Number: 18
Publication Date: Feb 1994
Journal: INFOR
Authors:
Keywords: lagrange multipliers, programming: integer, programming: mathematical, optimization, heuristics
Abstract:

A variant of the classical capacitated facility location problem is formulated, and some of its relaxations are analyzed. An implementation of a Lagrangean relaxation of the demand constraints usually yields a stronger bound than the common Lagrangean relaxation of the capacity constraint. A dual adjustment implementation provides the base for a fast optimal enumeration on well-known data sets. Lagrangean decomposition can yield an even stronger bound.

Reviews

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