Heuristic Programs For Some Transshipment Plant Location Problems

George W. Ladd

ISU General Staff Papers from Iowa State University, Department of Economics

Abstract: The main objective of this paper is presentation of complete details on two procedures for solving transshipment plant location problems: procedures called "Simple Version of 0RA(1, t)" and "Simple Version of 0RA(2, t)" in Ladd and Lifferth [61. The second of these two procedures is a "heuristic" procedure or a "heuristic program." A number of heuristic procedures have already appeared in the literature for solving plant location problems: in papers by King and Logan Chern and Polopolus p3"|, Warrack and Fletcher [12] and Candler^ Snyder and Faught [2],

Date: 1975-05-01
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://dr.lib.iastate.edu/server/api/core/bitstre ... fc63a2e14526/content
Our link check indicates that this URL is bad, the error code is: 403 Forbidden

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:isu:genstf:197505010700001009

Access Statistics for this paper

More papers in ISU General Staff Papers from Iowa State University, Department of Economics Iowa State University, Dept. of Economics, 260 Heady Hall, Ames, IA 50011-1070. Contact information at EDIRC.
Bibliographic data for series maintained by Curtis Balmer ().