
AbstractIn this paper, we study a special single‐commodity spatial equilibrium problem. We show how the problem is related to a shortest‐path problem and develop a simple algorithm for its solution. We also discuss an extension of the single‐commodity problem to a multicommodity problem.
multicommodity problem, algorithm, shortest-path, Deterministic network models in operations research, single-commodity spatial equilibrium
multicommodity problem, algorithm, shortest-path, Deterministic network models in operations research, single-commodity spatial equilibrium
| 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). | 2 | |
| 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. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
