Inverse minimax circle location problem with variable coordinates
Traditionally, the minimax circle location problems concern finding a circle $C$ in the plane such that the maximum distance from the given points to the circumference of the circle is minimized. The radius of the circle can be fixed or variable. In this paper we consider the inverse case, that is:...
Main Authors: | Mehraneh Gholami, Jafar Fathali |
---|---|
Format: | Article |
Language: | English |
Published: |
Amirkabir University of Technology
2022-09-01
|
Series: | AUT Journal of Mathematics and Computing |
Subjects: | |
Online Access: | https://ajmc.aut.ac.ir/article_4664_682f682b1c703b019d1dba3fe3ecaaf2.pdf |
Similar Items
-
The inverse minisum circle location problem
by: Gholami Mehraneh, et al.
Published: (2022-01-01) -
Re-Aggregation Heuristics for the Large Location Problems with Lexicographic Minimax Objective
by: Matej Cebecauer, et al.
Published: (2015-05-01) -
Inverse of Backup 2-Median Problems with Variable Edge Lengths and Vertex Weight on Trees and Variable Coordinates on the Plane
by: Morteza Nazari, et al.
Published: (2018-10-01) -
Solving Weber Problem on Plane with Minimax Criterion and Forbidden Gaps
by: G.G. Zabudsky, et al.
Published: (2014-09-01) -
The capacitated minimax location-allocation problem with probabilistic customer locations and border crossing constraints /
by: Mirzapourrezaei, Seyyedali, 1987-, et al.
Published: (2013)