ALGORITHMIC AND TECHNICAL IMPROVEMENTS: OPTIMAL SOLUTIONS TO THE (GENERALIZED) MULTI‐WEBER PROBLEM

Kenneth E. Rosing and Britton Harris

Papers in Regional Science, 1992, vol. 71, issue 3, 331-352

Abstract: ABSTRACT Rosing has recently demonstrated a new method for obtaining optimal solutions to the (Generalized) Multi‐Weber Problem and proved the optimally of the results. The method develops all convex hulls and then covers the destinations with disjoint convex hulls. This paper seeks to improve implementation of the algorithm to make such solutions economically attractive. Four areas are considered: sharper decision rules to eliminate unnecessary searching, bit pattern matching as a method of recording a history and eliminating duplication, vector intrinsic functions to speed up comparisons, and profiling a program to maximize operating efficiency. Computational experience is also presented.

Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://doi.org/10.1111/j.1435-5597.1992.tb01850.x

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:bla:presci:v:71:y:1992:i:3:p:331-352

Access Statistics for this article

Papers in Regional Science is currently edited by Jouke van Dijk

More articles in Papers in Regional Science from Wiley Blackwell
Bibliographic data for series maintained by Wiley Content Delivery ().