Cart (Loading....) | Create Account
Close category search window
 

A generalized approach to modeling the hierarchical location-allocation problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Eitan, Y. ; Center for Naval Anal., Alexandria, VA, USA ; Narula, S.C. ; Tien, J.M.

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

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:21 ,  Issue: 1 )

Date of Publication:

Jan/Feb 1991

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.