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

Improved formulations to the hierarchical health facility 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)
Tien, J.M. ; Rensselaer Polytech. Inst., Troy, NY, USA ; El-Tell, K. ; Simons, G.R.

A.B. Calvo and D.H. Marks (1973) formulated the problem of locating various types of health facilities, and allocating different types and levels of demand to these facilities, as a zero-one integer programming model. Although the model has been widely referenced in the literature no solution algorithm has been developed to date. It is shown in this work that the model is actually only locally inclusive and that it can be solved as a special case of another general, successively exclusive, model that is formulated and solved. A second model is presented that corrects for a shortcoming in the A.B. Calvo and D.H. Marks model and solves for the successively inclusive hierarchical location-allocation problem.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:SMC-13 ,  Issue: 6 )

Date of Publication:

Nov.-Dec. 1983

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.