A generalized approach to modeling the hierarchical location-allocation problem

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

Research output: Contribution to journalArticle

16 Citations (Scopus)

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
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

Fingerprint

Linear programming
Costs

ASJC Scopus subject areas

  • Engineering(all)

Cite this

A generalized approach to modeling the hierarchical location-allocation problem. / Eitan, Yair; Narula, Subhash C.; Tien, James M.

In: IEEE Transactions on Systems, Man and Cybernetics, Vol. 21, No. 1, 01.01.1991, p. 39-46.

Research output: Contribution to journalArticle

@article{bede0d662e9e4de781cc0f1b4dbab084,
title = "A generalized approach to modeling the hierarchical location-allocation problem",
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.",
author = "Yair Eitan and Narula, {Subhash C.} and Tien, {James M.}",
year = "1991",
month = "1",
day = "1",
doi = "10.1109/21.101135",
language = "English",
volume = "21",
pages = "39--46",
journal = "IEEE Transactions on Systems, Man and Cybernetics",
issn = "0018-9472",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - A generalized approach to modeling the hierarchical location-allocation problem

AU - Eitan, Yair

AU - Narula, Subhash C.

AU - Tien, James M.

PY - 1991/1/1

Y1 - 1991/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0025838949&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025838949&partnerID=8YFLogxK

U2 - 10.1109/21.101135

DO - 10.1109/21.101135

M3 - Article

VL - 21

SP - 39

EP - 46

JO - IEEE Transactions on Systems, Man and Cybernetics

JF - IEEE Transactions on Systems, Man and Cybernetics

SN - 0018-9472

IS - 1

ER -