On an approximate minimax circle closest to a set of points

被引:3
|
作者
Gass, SI [1 ]
Witzgall, C
机构
[1] Univ Maryland, Robert H Smith Sch Business, College Pk, MD 20742 USA
[2] Natl Inst Stand & Technol, Gaithersburg, MD 20899 USA
关键词
facility location; quality control; linear programming;
D O I
10.1016/S0305-0548(03)00015-7
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We show how the Chebychev minimax criterion for finding a circle closest to a set of points can be approximated well by standard linear programming procedures.
引用
收藏
页码:637 / 643
页数:7
相关论文
共 50 条