A note on solving large p-median problems (Q1060943): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 97 / rank | |||
Normal rank | |||
Revision as of 22:06, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on solving large p-median problems |
scientific article |
Statements
A note on solving large p-median problems (English)
0 references
1985
0 references
In a previous paper by \textit{N. Christofides} and the author [ibid. 10, 196-204 (1982; Zbl 0481.90020)] we presented a tree search algorithm for the p-median problem, the problem of locating p facilities (medians) on a network, which was based upon Lagrangean relaxation and subgradient optimisation. That algorithm solved (optimally) problems with an arbitrary number of medians and having up to 200 vertices. In this note we show that it is possible to enhance that algorithm to solve (optimally) problems having up to 900 vertices using the Cray-1S computer.
0 references
network location
0 references
tree search algorithm
0 references
p-median problem
0 references
Lagrangean relaxation
0 references
subgradient optimisation
0 references
