A FACILITY LOCATION PROBLEM WITH AGGREGATE CAPACITY

Authors
THIZY JM
Citation
Jm. Thizy, A FACILITY LOCATION PROBLEM WITH AGGREGATE CAPACITY, INFOR. Information systems and operational research, 32(1), 1994, pp. 1-18
Citations number
NO
Categorie Soggetti
Operatione Research & Management Science
Journal title
INFOR. Information systems and operational research → ACNP
ISSN journal
03155986
Volume
32
Issue
1
Year of publication
1994
Pages
1 - 18
Database
ISI
SICI code
0315-5986(1994)32:1<1:AFLPWA>2.0.ZU;2-7
Abstract
A variant of the classical capacitated facility location problem is fo rmulated, and some of its relaxations are analyzed. An implementation of a Lagrangian relaxation of the demand constraints usually yields a stronger bound than the common Lagrangian relaxation of the capacity c onstraint. A dual adjustment implementation provides the base for a fa st optimal enumeration on well-known data sets. Lagrangian decompositi on can yield an even stronger bound.