Location problems |
| |
| Authors: | P.M Dearing |
| |
| Affiliation: | Department of Mathematical Sciences, Clemson University, Clemson, SC 29634-1907, USA |
| |
| Abstract: | Recent developments for several location problems are surveyed. These include: graph theoretic and combinatorial formulations of the simple plant location problem, the NP-hardness of some p-center problems, worst-case bounds for several polynomial-time heuristics for some p-center problems, and a general solution to a class of one facility network problems with convex cost functions. |
| |
| Keywords: | facility location optimization integer programming |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
