search query: @indexterm Numerical computation / total: 22
reference: 18 / 22
| Author: | Berman, O. Yang, E. K. |
| Title: | Medi-centre location problems |
| Journal: | Journal of the Operational Research Society
1991 : APR, VOL. 42:4, p. 313-322 |
| Index terms: | ALGORITHMS STATISTICAL METHODS LOCATION PROBLEM TRAVEL NUMERICAL COMPUTATION |
| Language: | eng |
| Abstract: | The m-median and m-centre problems are considered as the two main problems in location theory. In the m-median problem the objective is to mimimize the total travel distance to or from the facilities for the population of their users. In the case of the uncapacitated medi-centre problem the fixed costs of establishing facilities are included, and thus the number of facilities is also a decision variable. Algorithms are presented and computational experience is discussed for the two problems. For the m-mediam problem an iterative relaxation algorithm was developed. For the m-centre problem a simple algorithm is presented that uses repeatedly the algorithm for the other problem. |
SCIMA