Efficient algorithms for the smallest enclosing ball problem in high dimensional space, Novel approached to hard discrete optimization (Waterloo, ON, 2001)

Guanglu Zhou; J Sun; KC Toh

Efficient algorithms for the smallest enclosing ball problem in high dimensional space, Novel approached to hard discrete optimization (Waterloo, ON, 2001)

Guanglu Zhou, J Sun, KC Toh

Mathematics

Research output: Contribution to journal › Article

Original language	English
Pages (from-to)	173-181
Number of pages	9
Journal	Fields Inst. Commun. Amer. Math. Soc
Volume	37
Publication status	Published - 1 Jan 2003

Cite this

@article{274b20a4df214bfca992e7dd3095e9c6,

title = "Efficient algorithms for the smallest enclosing ball problem in high dimensional space, Novel approached to hard discrete optimization (Waterloo, ON, 2001)",

author = "Guanglu Zhou and J Sun and KC Toh",

year = "2003",

month = jan,

day = "1",

language = "English",

volume = "37",

pages = "173--181",

journal = "Fields Inst. Commun. Amer. Math. Soc",

}

TY - JOUR

T1 - Efficient algorithms for the smallest enclosing ball problem in high dimensional space, Novel approached to hard discrete optimization (Waterloo, ON, 2001)

AU - Zhou, Guanglu

AU - Sun, J

AU - Toh, KC

PY - 2003/1/1

Y1 - 2003/1/1

M3 - Article

VL - 37

SP - 173

EP - 181

JO - Fields Inst. Commun. Amer. Math. Soc

JF - Fields Inst. Commun. Amer. Math. Soc

ER -