NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

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.

PUBLICATIONS

On an Approximate Minimax Circle Closest to a Set of Points

Published

Author(s)

Saul I. Gass, Christoph J. Witzgall

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

Gass, S. and Witzgall, C. (2003), On an Approximate Minimax Circle Closest to a Set of Points, Journal of Computers and Operations Research (Accessed October 16, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created April 15, 2003, Updated February 17, 2017
Was this page helpful?