Skip to main content

ETHNOS_APP

Home • Search • Journals • List 0

P J Densham

Biographic Data

ID2262216
NAMEP J Densham
GIVEN NAMESP J
FAMILY NAMEDensham
SIGNATUREDENSHAM P J
AFFILIATIONSNational Center for Geographic Information and Analysis, and Department of Geography, State University of New York at Buffalo, Buffalo, NY 14261, USA
VERIFIEDNo
TOTAL WORKS1
TOTAL CITATIONS9
WORKS AS AUTHOR1
WORKS AS EDITOR0
FIRST PUBLICATION YEAR1992
LATEST PUBLICATION YEAR1992
H-INDEX1
  • Strategies for Solving Large Location-Allocation Problems by Heuristic Methods

    Open Access•P J Densham, G Rushton•ARTICLE•Environment and Planning A…•1992•Cited by: 9•References: 13

    Solution techniques for location-allocation problems usually are not a part of microcomputer-based geoprocessing systems because of the large volumes of data to process and store and the complexity of algorithms. In this paper, it is shown that processing costs for the most accurate, heuristic, location-allocation algorithm can be drastically reduced by exploiting the spatial structure of location-allocation problems. The strategies used, preproc…

  • Strategies for Solving Large Location-Allocation Problems by Heuristic Methods

    Open Access•P J Densham, G Rushton•ARTICLE•Environment and Planning A…•1992•Cited by: 9•References: 13

    Solution techniques for location-allocation problems usually are not a part of microcomputer-based geoprocessing systems because of the large volumes of data to process and store and the complexity of algorithms. In this paper, it is shown that processing costs for the most accurate, heuristic, location-allocation algorithm can be drastically reduced by exploiting the spatial structure of location-allocation problems. The strategies used, preproc…

  • Strategies for Solving Large Location-Allocation Problems by Heuristic Methods

    Open Access•P J Densham, G Rushton•ARTICLE•Environment and Planning A…•1992•Cited by: 9•References: 13

    Solution techniques for location-allocation problems usually are not a part of microcomputer-based geoprocessing systems because of the large volumes of data to process and store and the complexity of algorithms. In this paper, it is shown that processing costs for the most accurate, heuristic, location-allocation algorithm can be drastically reduced by exploiting the spatial structure of location-allocation problems. The strategies used, preproc…

Artificial Intelligence (1 work) · Computer network (1 work) · Computer Science (1 work) · Data mining (1 work) · Facility Location and Emergency Management (1 work) · Geoprocessing (1 work) · Heuristic (1 work) · Location-allocation (1 work) · Mathematical optimization (1 work) · Mathematics (1 work)

Ethnos_APP • Open Source Project • MIT License • Frontend v2.0.0 • Privacy and Cookies • API Documentation: api.ethnos.app/docs • API Source Code: GitHub • DOI: 10.5281/zenodo.17049435 • Frontend Source Code: GitHub • DOI: 10.5281/zenodo.17050053 • cruz.rio.br • Expectantes Misericordiae