Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

1-center problem

Known as: Minimax facility location, 1-center, Minmax facility location 
The 1-center problem or minimax or minmax location problem is a classical combinatorial optimization problem in operations research of facilities… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Clustering categorical distributions in the probability simplex is a fundamental task met in many applications dealing with… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2012
2012
Robustness in Operations Research/Decision Aid is often associated with min–max and min–max regret criteria. This common approach… Expand
  • table 1
  • table 2
  • figure 1
  • table 3
  • table 4
Highly Cited
2010
Highly Cited
2010
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2009
2009
We show that both confined atoms and electron-atom scattering can be described by a unified basis set method. The central idea… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Highly Cited
2008
Highly Cited
2008
Given a set of points [email protected]?R^d and value @e>0, an @[email protected]?P has the property that the smallest ball… Expand
2006
2006
The traditional problems of facility location are defined statically; a set (or multiset) of n points is given as input… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • table 2.1
2006
2006
In this paper, an optimal algorithm to solve the continuous/discrete weighted 2-center problem is proposed. The method… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2005
Highly Cited
2005
This paper discusses dynamical systems for disk-covering and sphere-packing problems. We present facility location functions from… Expand
  • figure 2.1
  • figure 3.1
  • figure 4.1
  • figure 4.2
  • figure 5.1
2005
2005
Consider n sites evolving within a convex polygon according to one of the following interaction laws: (i) each site moves away… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1983
Highly Cited
1983
We present an O(n(log n)3(log log n)2) algorithm for the problem of finding a point (x, y) in the plane that minimizes the… Expand