MINIMUM COVERING SPHERE PROBLEM

[1] BLUMENTHAL LM, 1941, AM MATH SOC B, V47, P771

[2] CHRYSTAL G, 1885, P EDINBURGH MATH SOC, P00030

[3] Dantzig G.B., 1963, LINEAR PROGRAMMING

[4] SOME ASPECTS OF A MINIMAX LOCATION PROBLEM [J]. OPERATIONS RESEARCH, 1967, 15 (06) : 1163 - &

[5] GROENEWO.C, 1965, SIAM REV, V7, P415

[6] HEARN DW, 1971, THESIS JOHNS HOPKINS

[7] DUAL PROGRAMS [J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1962, 6 (01) : 137 - 139

[8] ISAACS R, 1964, CNA3164 CTR NAV AN I

[9] John F., 1948, STUDIES ESSAYS COURA

[10] Jung H, 1901, J REINE ANGEW MATH, V123, P241

[1] BLUMENTHAL LM, 1941, AM MATH SOC B, V47, P771

[2] CHRYSTAL G, 1885, P EDINBURGH MATH SOC, P00030

[3] Dantzig G.B., 1963, LINEAR PROGRAMMING

[4] SOME ASPECTS OF A MINIMAX LOCATION PROBLEM [J]. OPERATIONS RESEARCH, 1967, 15 (06) : 1163 - &

[5] GROENEWO.C, 1965, SIAM REV, V7, P415

[6] HEARN DW, 1971, THESIS JOHNS HOPKINS

[7] DUAL PROGRAMS [J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1962, 6 (01) : 137 - 139

[8] ISAACS R, 1964, CNA3164 CTR NAV AN I

[9] John F., 1948, STUDIES ESSAYS COURA

[10] Jung H, 1901, J REINE ANGEW MATH, V123, P241