A Generalized Approach to Modeling the Hierarchical Location-Allocation Problem

Yair Eitan, Subhash C. Narula, James M. Tien

Research output: Contribution to journalArticle

16 Scopus citations

Abstract

The hierarchical location-allocation problem is generalized in four respects: different hierarchical relationships are allowed to be simultaneously present; capacity constraints are placed on service types and service groups; a flexible (fixed and variable) cost structure is used; and interservice referrals are permitted. These four generalizations are captured in a mixed-integer linear programming model which is shown to subsume less general formulations documented in the literature. A comprehensive example is included to demonstrate the model's capabilities.

Original languageEnglish (US)
Pages (from-to)39-46
Number of pages8
JournalIEEE Transactions on Systems, Man and Cybernetics
Volume21
Issue number1
DOIs
StatePublished - Jan 1 1991
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'A Generalized Approach to Modeling the Hierarchical Location-Allocation Problem'. Together they form a unique fingerprint.

  • Cite this