FACILITY LOCATION;
CENTER PROBLEMS;
MEDIAN PROBLEMS;
COMPUTATIONAL COMPLEXITY;
D O I:
10.1016/0167-6377(91)90041-M
中图分类号:
C93 [管理学];
O22 [运筹学];
学科分类号:
070105 ;
12 ;
1201 ;
1202 ;
120202 ;
摘要:
In this note we apply recent results in dynamic programming to improve the complexity bounds of several median and coverage location models on the real line.