未找到相关数据
ALGORITHM FOR THE M-MEDIAN PLANT LOCATION PROBLEM.
被引：48
作者：
Garfinkel, R.S.
Neebe, A.W.
Rao, M.R.
机构：
关键词：
MATHEMATICAL MODELS - MATHEMATICAL TECHNIQUES - Linearization;
D O I：
10.1287/trsc.8.3.217
中图分类号：
学科分类号：
摘要：
The problem is to locate a given number of plants along a road network so as to minimize the total distance between plants and warehouses assigned to them. It is modeled as an integer programming problem and the relaxed linear program is solved by decomposition. In cases of noninteger termination, the integer linear program is attacked using group theoretics and a dynamic programming recursion. Computational results are given, which contrast this procedure to a branch-and-bound approach.
引用
收藏
页码：217 / 236
相关论文