Downloadable (with restrictions)! This is the second part of a two-part analysis of optimal spatial search begun in Harwitz et al. (1998). In the present article, two explicit computational procedures are developed for the optimal spatial search problem studied in Part I. The first uses reservation prices with continuous known distributions of prices and is illustrated for three 0x2b632c4c9ae0array By mattgundersenin Spatial > spatial searchwith spatialsearcharticlesoptimalpathsrecallpartcomputational