Gass, S.
and Witzgall, C.
(2003),
On an Approximate Minimax Circle Closest to a Set of Points, Journal of Computers and Operations Research
(Accessed May 9, 2025)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
On an Approximate Minimax Circle Closest to a Set of Points
Published
Author(s)
,
Abstract
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.Citation
Journal of Computers and Operations Research
Volume
31
Issue
4
Pub Type
Journals
Keywords
linear programming, location theory minimax criterion
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created April 15, 2003, Updated February 17, 2017