
doi: 10.1137/1006005
Summary: A number of heuristic algorithms have been devised for solving large location-allocation problems. The algorithms have been extensively tested and several are in use in at least one industrial corporation. It has been found that one of the algorithms, the random destination algorithm, appears to provide satisfactorily close approximations to the optimal solution to location-allocation problems in reasonable amounts of computation time.
Methods of reduced gradient type, Continuous location
Methods of reduced gradient type, Continuous location
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 406 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 1% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 0.1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
