Abstract
In chapter 4 we have demonstrated that the spatial search problem as we have defined it there is highly complex. It belongs to a class of problems for which it seems a general solution does not exist. Although minimum expected cost and choice probabilities can be computed quite easily for a spatial search problem with few alternatives, when the number of alternatives increases, the resource requirements for solving the spatial search problem grow beyond bounds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Physica-Verlag Heidelberg
About this chapter
Cite this chapter
Maier, G. (1995). Tractable Spatial Search Problems. In: Spatial Search. Studies in Contemporary Economics. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-49346-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-49346-1_5
Publisher Name: Physica-Verlag HD
Print ISBN: 978-3-7908-0874-2
Online ISBN: 978-3-642-49346-1
eBook Packages: Springer Book Archive